scholarly journals Designing a Multistage Supply Chain in Cross-Stage Reverse Logistics Environments: Application of Particle Swarm Optimization Algorithms

2014 ◽  
Vol 2014 ◽  
pp. 1-19 ◽  
Author(s):  
Tzu-An Chiang ◽  
Z. H. Che ◽  
Zhihua Cui
Keyword(s):  
Mathematical Model ◽  
Particle Swarm Optimization ◽  
Supply Chain ◽  
Objective Function ◽  
Reverse Logistics ◽  
Particle Swarm ◽  
Supply Chain Design ◽  
Reverse Supply Chain ◽  
Swarm Optimization ◽  
Objective Function Values

This study designed a cross-stage reverse logistics course for defective products so that damaged products generated in downstream partners can be directly returned to upstream partners throughout the stages of a supply chain for rework and maintenance. To solve this reverse supply chain design problem, an optimal cross-stage reverse logistics mathematical model was developed. In addition, we developed a genetic algorithm (GA) and three particle swarm optimization (PSO) algorithms: the inertia weight method (PSOA_IWM),VMaxmethod (PSOA_VMM), and constriction factor method (PSOA_CFM), which we employed to find solutions to support this mathematical model. Finally, a real case and five simulative cases with different scopes were used to compare the execution times, convergence times, and objective function values of the four algorithms used to validate the model proposed in this study. Regarding system execution time, the GA consumed more time than the other three PSOs did. Regarding objective function value, the GA, PSOA_IWM, and PSOA_CFM could obtain a lower convergence value than PSOA_VMM could. Finally, PSOA_IWM demonstrated a faster convergence speed than PSOA_VMM, PSOA_CFM, and the GA did.

scholarly journals Global optimization via neural network approximation of inverse coordinate mappings with evolutionary parameter control

2019 ◽  
Vol 10 (2) ◽  
pp. 3-31
Author(s):  
Kirill Vladimirovich Pushkaryov
Keyword(s):  
Neural Network ◽  
Global Optimization ◽  
Particle Swarm Optimization ◽  
Objective Function ◽  
Particle Swarm ◽  
Test Problems ◽  
Short Term ◽  
Swarm Optimization ◽  
Multiple Variables ◽  
Objective Function Values

A hybrid method of global optimization NNAICM-PSO is presented. It uses neural network approximation of inverse mappings of objective function values to coordinates combined with particle swarm optimization to find the global minimum of a continuous objective function of multiple variables with bound constraints. The objective function is viewed as a black box. The method employs groups of moving probe points attracted by goals like in particle swarm optimization. One of the possible goals is determined via mapping of decreased objective function values to coordinates by modified Dual Generalized Regression Neural Networks constructed from probe points. The parameters of the search are controlled by an evolutionary algorithm. The algorithm forms a population of evolving rules each containing a tuple of parameter values. There are two measures of fitness: short-term (charm) and long-term (merit). Charm is used to select rules for reproduction and application. Merit determines survival of an individual. This two-fold system preserves potentially useful individuals from extinction due to short-term situation changes. Test problems of 100 variables were solved. The results indicate that evolutionary control is better than random variation of parameters for NNAICM-PSO. With some problems, when rule bases are reused, error progressively decreases in subsequent runs, which means that the method adapts to the problem.

scholarly journals Hybrid Algorithms for Fuzzy Reverse Supply Chain Network Design

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Z. H. Che ◽  
Tzu-An Chiang ◽  
Y. C. Kuo ◽  
Zhihua Cui
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Supply Chain ◽  
Simulated Annealing ◽  
Decision Model ◽  
Particle Swarm ◽  
Hybrid Algorithms ◽  
Supply Chain Network ◽  
Reverse Supply Chain ◽  
Swarm Optimization

In consideration of capacity constraints, fuzzy defect ratio, and fuzzy transport loss ratio, this paper attempted to establish an optimized decision model for production planning and distribution of a multiphase, multiproduct reverse supply chain, which addresses defects returned to original manufacturers, and in addition, develops hybrid algorithms such as Particle Swarm Optimization-Genetic Algorithm (PSO-GA), Genetic Algorithm-Simulated Annealing (GA-SA), and Particle Swarm Optimization-Simulated Annealing (PSO-SA) for solving the optimized model. During a case study of a multi-phase, multi-product reverse supply chain network, this paper explained the suitability of the optimized decision model and the applicability of the algorithms. Finally, the hybrid algorithms showed excellent solving capability when compared with original GA and PSO methods.

Comparison of SVC and TCSC Installation in Transmission Line with Loss Minimization and Cost of Installation via Particle Swarm Optimization

2015 ◽  
Vol 785 ◽  
pp. 495-499
Author(s):  
Siti Amely Jumaat ◽  
Ismail Musirin
Keyword(s):  
Particle Swarm Optimization ◽  
Transmission Line ◽  
Objective Function ◽  
Transmission Loss ◽  
Particle Swarm ◽  
Static Var Compensator ◽  
Loss Minimization ◽  
Swarm Optimization ◽  
The Cost ◽  
Thyristor Controlled Series Compensator

The paper presents a comparison of performance Static Var Compensator (SVC) and Thyristor Controlled Series Compensator (TCSC) with objective function to minimize the transmission loss, improve the voltage and monitoring the cost of installation. Simulation performed on standard IEEE 30-Bus RTS and indicated that EPSO a feasible to achieve the objective function.

Inverse estimation of time-varying heat transfer coefficients for a hollow cylinder by using self-learning particle swarm optimization

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Kun-Yung Chen ◽  
Te-Wen Tu
Keyword(s):  
Heat Transfer ◽  
Particle Swarm Optimization ◽  
Objective Function ◽  
Hollow Cylinder ◽  
General Type ◽  
Particle Swarm ◽  
Time History ◽  
Time Varying ◽  
Swarm Optimization ◽  
Self Learning

Abstract An inverse methodology is proposed to estimate a time-varying heat transfer coefficient (HTC) for a hollow cylinder with time-dependent boundary conditions of different kinds on inner and outer surfaces. The temperatures at both the inner surface and the interior domain are measured for the hollow cylinder, while the time history of HTC of the outer surface will be inversely determined. This work first expressed the unknown function of HTC in a general form with unknown coefficients, and then regarded these unknown coefficients as the estimated parameters which can be randomly searched and found by the self-learning particle swarm optimization (SLPSO) method. The objective function which wants to be minimized was found with the absolute errors between the measured and estimated temperatures at several measurement times. If the objective function converges toward the null, the inverse solution of the estimated HTC will be found eventually. From numerical experiments, when the function of HTC with exponential type is performed, the unknown coefficients of the HTC function can be accurately estimated. On the contrary, when the function of HTC with a general type is conducted, the unknown coefficients of HTC are poorly estimated. However, the estimated coefficients of an HTC function with the general type can be regarded as the equivalent coefficients for the real function of HTC.

scholarly journals Minimization of Logistics Cost and Carbon Emissions Based on Quantum Particle Swarm Optimization

2018 ◽  
Vol 10 (10) ◽  
pp. 3791 ◽  
Author(s):  
Daqing Wu ◽  
Jiazhen Huo ◽  
Gefu Zhang ◽  
Weihua Zhang
Keyword(s):  
Particle Swarm Optimization ◽  
Supply Chain ◽  
Carbon Emissions ◽  
Time Window ◽  
Quantum Particle ◽  
Particle Swarm ◽  
Transport Cost ◽  
Distribution Centers ◽  
Swarm Optimization ◽  
Quantum Particle Swarm Optimization

This paper aims to simultaneously minimize logistics costs and carbon emissions. For this purpose, a mathematical model for a three-echelon supply chain network is created considering the relevant constraints such as capacity, production cost, transport cost, carbon emissions, and time window, which will be solved by the proposed quantum-particle swarm optimization algorithm. The three-echelon supply chain, consisting of suppliers, distribution centers, and retailers, is established based on the number and location of suppliers, the transport method from suppliers to distribution centers, and the quantity of products to be transported from suppliers to distribution centers and from these centers to retailers. Then, a quantum-particle swarm optimization is described as its performance is validated with different benchmark functions. The scenario analysis validates the model and evaluates its performance to balance the economic benefit and environmental effect.

scholarly journals Self-adaptive potential-based stopping criteria for Particle Swarm Optimization with forced moves

2020 ◽  
Vol 14 (4) ◽  
pp. 285-311
Author(s):  
Bernd Bassimir ◽  
Manuel Schmitt ◽  
Rolf Wanka
Keyword(s):  
Particle Swarm Optimization ◽  
Objective Function ◽  
Particle Swarm ◽  
Upper Bounds ◽  
Local Optimum ◽  
Adaptive Potential ◽  
Stopping Criteria ◽  
Swarm Optimization ◽  
Self Adaptive

Abstract We study the variant of Particle Swarm Optimization that applies random velocities in a dimension instead of the regular velocity update equations as soon as the so-called potential of the swarm falls below a certain small bound in this dimension, arbitrarily set by the user. In this case, the swarm performs a forced move. In this paper, we are interested in how, by counting the forced moves, the swarm can decide for itself to stop its movement because it is improbable to find better candidate solutions than the already-found best solution. We formally prove that when the swarm is close to a (local) optimum, it behaves like a blind-searching cloud and that the frequency of forced moves exceeds a certain, objective function-independent value. Based on this observation, we define stopping criteria and evaluate them experimentally showing that good candidate solutions can be found much faster than setting upper bounds on the iterations and better solutions compared to applying other solutions from the literature.

Sign in / Sign up

Export Citation Format

Share Document