Heuristic Particle Swarm Optimization for Batching and Scheduling Flowshop with Sequence-Independent Setup Time

2011 ◽  
Vol 130-134 ◽  
pp. 2504-2507 ◽  
Author(s):  
Qi Tang ◽  
Li Xin Tang
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Particle Swarm ◽  
Setup Time ◽  
Batch Scheduling ◽  
Swarm Optimization ◽  
Multi Stage ◽  
Set Up ◽  
Better Than ◽  
Conjunctive Model

This paper considers Integration of batching and scheduling with features on batch scheduling such as multi-product facilities, multi-stage, set-up time depending on sequence, limited storage. For this complicated problem, we present a Conjunctive model and Heuristic Particle Swarm Optimization. We proposed Local Search (LS) Strategy to improve the HPSO. Computations show that both methods are efficient. In addition, HPSO are better than CM.

Heuristic Particle Swarm Optimization for Scheduling Chemical Flowshop with Limited Intermediate Product Storage

2014 ◽  
Vol 1037 ◽  
pp. 514-517
Author(s):  
Qi Tang ◽  
Xiao Ye Zhou ◽  
Jian Xun Tang
Keyword(s):  
Particle Swarm Optimization ◽  
Intermediate Product ◽  
Particle Swarm ◽  
Batch Scheduling ◽  
Mixed Integer ◽  
Swarm Optimization ◽  
Complicated Problem ◽  
Multi Stage ◽  
Better Than ◽  
Product Storage

This paper considers integration of batching and scheduling with features on batch scheduling such as multi-product facilities, multi-stage. For this complicated problem, we present a mixed integer model (EM) and Heuristic Particle Swarm Optimization (HPSO). We proposed Strategies to improve the HPSO. Computations show that both methods are efficient. In addition, HPSO are better than EM.

scholarly journals An Enhanced Multi-Objective Particle Swarm Optimization in Water Distribution Systems Design

Water ◽  
2021 ◽  
Vol 13 (10) ◽  
pp. 1334
Author(s):  
Mohamed R. Torkomany ◽  
Hassan Shokry Hassan ◽  
Amin Shoukry ◽  
Ahmed M. Abdelrazek ◽  
Mohamed Elkholy
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Distribution Systems ◽  
Water Distribution ◽  
Water Distribution Systems ◽  
Particle Swarm ◽  
Large Network ◽  
Swarm Optimization ◽  
Original Algorithm ◽  
Multi Objective

The scarcity of water resources nowadays lays stress on researchers to develop strategies aiming at making the best benefit of the currently available resources. One of these strategies is ensuring that reliable and near-optimum designs of water distribution systems (WDSs) are achieved. Designing WDSs is a discrete combinatorial NP-hard optimization problem, and its complexity increases when more objectives are added. Among the many existing evolutionary algorithms, a new hybrid fast-convergent multi-objective particle swarm optimization (MOPSO) algorithm is developed to increase the convergence and diversity rates of the resulted non-dominated solutions in terms of network capital cost and reliability using a minimized computational budget. Several strategies are introduced to the developed algorithm, which are self-adaptive PSO parameters, regeneration-on-collision, adaptive population size, and using hypervolume quality for selecting repository members. A local search method is also coupled to both the original MOPSO algorithm and the newly developed one. Both algorithms are applied to medium and large benchmark problems. The results of the new algorithm coupled with the local search are superior to that of the original algorithm in terms of different performance metrics in the medium-sized network. In contrast, the new algorithm without the local search performed better in the large network.

ANALYSIS OF MUTATION OPERATORS ON QUANTUM-BEHAVED PARTICLE SWARM OPTIMIZATION ALGORITHM

2009 ◽  
Vol 05 (02) ◽  
pp. 487-496 ◽  
Author(s):  
WEI FANG ◽  
JUN SUN ◽  
WENBO XU
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm Optimization Algorithm ◽  
Novel Mutation ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Mutation Operator ◽  
Fundamental Theory ◽  
Swarm Optimization ◽  
Mutation Operators ◽  
Better Than

Mutation operator is one of the mechanisms of evolutionary algorithms (EAs) and it can provide diversity in the search and help to explore the undiscovered search place. Quantum-behaved particle swarm optimization (QPSO), which is inspired by fundamental theory of PSO algorithm and quantum mechanics, is a novel stochastic searching technique and it may encounter local minima problem when solving multi-modal problems just as that in PSO. A novel mutation mechanism is proposed in this paper to enhance the global search ability of QPSO and a set of different mutation operators is introduced and implemented on the QPSO. Experiments are conducted on several well-known benchmark functions. Experimental results show that QPSO with some of the mutation operators is proven to be statistically significant better than the original QPSO.

scholarly journals A Discrete Particle Swarm Optimization Algorithm for Uncapacitated Facility Location Problem

2008 ◽  
Vol 2008 ◽  
pp. 1-9 ◽  
Author(s):  
Ali R. Guner ◽  
Mehmet Sevkli
Keyword(s):  
Particle Swarm Optimization ◽  
Facility Location ◽  
Location Problem ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Facility Location Problem ◽  
Discrete Version ◽  
Discrete Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Better Than

A discrete version of particle swarm optimization (DPSO) is employed to solve uncapacitated facility location (UFL) problem which is one of the most widely studied in combinatorial optimization. In addition, a hybrid version with a local search is defined to get more efficient results. The results are compared with a continuous particle swarm optimization (CPSO) algorithm and two other metaheuristics studies, namely, genetic algorithm (GA) and evolutionary simulated annealing (ESA). To make a reasonable comparison, we applied to same benchmark suites that are collected from OR-library. In conclusion, the results showed that DPSO algorithm is slightly better than CPSO algorithm and competitive with GA and ESA.

scholarly journals A Multi-Objective Permanent Basic Farmland Delineation Model Based on Hybrid Particle Swarm Optimization

2020 ◽  
Vol 9 (4) ◽  
pp. 243 ◽  
Author(s):  
Hua Wang ◽  
Wenwen Li ◽  
Wei Huang ◽  
Ke Nie
Keyword(s):  
Particle Swarm Optimization ◽  
Fitness Function ◽  
Particle Swarm ◽  
Research Area ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Model Based ◽  
Hybrid Particle Swarm Optimization ◽  
General Rules ◽  
Set Up

The delimitation of permanent basic farmland is essentially a multi-objective optimization problem. The traditional demarcation methods cannot simultaneously take into account the requirements of cultivated land quality and the spatial layout of permanent basic farmland, and it cannot balance the relationship between agriculture and urban development. This paper proposed a multi-objective permanent basic farmland delimitation model based on an immune particle swarm optimization algorithm. The general rules for delineating the permanent basic farmland were defined in the model, and the delineation goals and constraints have been formally expressed. The model introduced the immune system concepts to complement the existing theory. This paper describes the coding and initialization methods for the algorithm, particle position and speed update mechanism, and fitness function design. We selected Xun County, Henan Province, as the research area and set up control experiments that aligned with the different targets and compared the performance of the three models of particle swarm optimization (PSO), artificial immune algorithm (AIA), and the improved AIA-PSO in solving multi-objective problems. The experiments proved the feasibility of the model. It avoided the adverse effects of subjective factors and promoted the scientific rationality of the results of permanent basic farmland delineation.

Sign in / Sign up

Export Citation Format

Share Document