Hybrid genetic particle swarm optimization algorithm for multiple vehicle transporting goods problem

Journal of Computational Information Systems

Volumn 6, Issue 6, 2010, Pages 1751-1758

  Feng, Hongkui ^a   Bao, Jinsong ^a,b   Jin, Ye ^a,b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b Shanghai Jiao Tong University   (China)

Author keywords

Evolutionary algorithms; Genetic particle swarm optimization; Space constraint; Traveling salesman problem

Indexed keywords

COMPUTATIONAL RESULTS; DESTINATION LOCATION; HYBRID GENETIC; JOB SHOP; PARTICLE SWARM; PARTICLE SWARM OPTIMIZATION ALGORITHM; PRODUCTION PROCESS; PSO ALGORITHMS; SPACE CONSTRAINTS; TRAVELING SALESMAN;

ALGORITHMS; PARTICLE SWARM OPTIMIZATION (PSO); PROBLEM SOLVING; VEHICLES;

TRAVELING SALESMAN PROBLEM;

EID: 77956964379     PISSN: 15539105     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (4)

1. Luping Fang, Pan Chen, Shihua Liu. Particle swarm optimization with SA for TSP problem[J]. WSEAS Transactions on Information Science and Applications, 2007, 4(6): 1157-1162.
2. Quan-Ke Pan, Ling Wang. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm [J]. International Journal of Advanced Manufacturing Technology, 2008, 39(7-8): 796-807.
3. Xianjun Shen, Yuanxiang Li, Bojin Zheng, and et al.. General particle swarm optimization based on simulated annealing for multi-specification one-dimensional cutting stock problem [J]. Lecture Notes in Computer Science, 2007, 4456 LNAI: 67-76.
4. Chao-Tang Tseng, Ching-Jong Liao. A discrete particle swarm optimization for lot-streaming flowshop scheduling problem [J]. European Journal of Operational Research, 2008, 191(2): 360-373.