scholarly journals Optimization of m-MDPDPTW Using the Continuous and Discrete PSO

2019 ◽  
Vol 28 (3) ◽  
pp. 289-298 ◽  
Author(s):  
Imen Harbaoui DRIDI ◽  
Essia Ben ALAÏA ◽  
Pierre BORNE ◽  
Hanen BOUCHRIHA
Keyword(s):  
2012 ◽  
Vol 3 (2) ◽  
pp. 19-41 ◽  
Author(s):  
Kusum Deep ◽  
Pinkey Chauhan ◽  
Millie Pant

Trim loss minimization is the most common problem that arises during the cutting process, when products with variable width or length are to be produced in bulk to satisfy customer demands from limited available/stocked materials. The aim is to minimize inevitable waste material. Under various environmental and physical constraints, the trim loss problem is highly constrained, non convex, nonlinear, and with integer restriction on all variables. Due to the highly complex nature of trim loss problem, it is not easy for manufacturers to select an appropriate method that provides a global optimal solution, satisfying all restrictions. This paper proposes a discrete variant of PSO, which embeds a mutation operator, namely power mutation during the position update stage. The proposed variant is named as Hybrid Discrete PSO (HDPSO). Binary variables in HDPSO are generated using sigmoid function with its domain derived from position update equation. Four examples with different levels of complexity are solved and results are compared with two recently developed GA and PSO variants. The computational studies indicate the competitiveness of proposed variant over other considered methods.


Entropy ◽  
2019 ◽  
Vol 21 (8) ◽  
pp. 738 ◽  
Author(s):  
Łukasz Strąk ◽  
Rafał Skinderowicz ◽  
Urszula Boryczka ◽  
Arkadiusz Nowakowski

This paper presents a discrete particle swarm optimization (DPSO) algorithm with heterogeneous (non-uniform) parameter values for solving the dynamic traveling salesman problem (DTSP). The DTSP can be modeled as a sequence of static sub-problems, each of which is an instance of the TSP. In the proposed DPSO algorithm, the information gathered while solving a sub-problem is retained in the form of a pheromone matrix and used by the algorithm while solving the next sub-problem. We present a method for automatically setting the values of the key DPSO parameters (except for the parameters directly related to the computation time and size of a problem).We show that the diversity of parameters values has a positive effect on the quality of the generated results. Furthermore, the population in the proposed algorithm has a higher level of entropy. We compare the performance of the proposed heterogeneous DPSO with two ant colony optimization (ACO) algorithms. The proposed algorithm outperforms the base DPSO and is competitive with the ACO.


Sign in / Sign up

Export Citation Format

Share Document