A mixed PSO algorithm for the VRPSPD

Chinese Control and Decision Conference, 2008, CCDC 2008

Volumn , Issue , 2008, Pages 4017-4021

  Tao, Zhang ^a   Chunmei, Zhang ^b   Yuejie, Zhang ^c   Chuoya, Yu ^a  

^a SHANGHAI UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^b Business and Information Department   (China)

^c FUDAN UNIVERSITY   (China)

Author keywords

Mixed integer programming; Particle swarm optimization (PSO) simulated annealing algorithm (SA); Vehicle routing with simultaneous delivery and pick up (VRPSPD)

Indexed keywords

ANNEALING; DISTRIBUTION OF GOODS; FLEET OPERATIONS; FUNCTION EVALUATION; INTEGER PROGRAMMING; MATHEMATICAL PROGRAMMING; PARTICLE SWARM OPTIMIZATION (PSO); PROGRAMMING THEORY; SOLUTIONS; VEHICLE ROUTING; VEHICLES;

CODING RULES; COMPUTATIONAL TIME; COOLING SCHEDULES; EXPERIMENTAL STUDIES; FITNESS FUNCTIONS; INFORMATION EXCHANGING; INITIAL SOLUTION; LIMITED CAPACITY; MAXIMUM DISTANCE; MIXED INTEGER PROGRAMMING; MIXED INTEGER PROGRAMMING MODEL; PARTICLE SWARM OPTIMIZATION (PSO) SIMULATED ANNEALING ALGORITHM (SA); PARTICLE SWARM OPTIMIZATIONS; PENALTY FUNCTIONS; PSO ALGORITHMS; REVERSE LOGISTICS; SA ALGORITHMS; VEHICLE LOADS; VEHICLE ROUTING PROBLEMS; VEHICLE ROUTING WITH SIMULTANEOUS DELIVERY AND PICK-UP (VRPSPD);

SIMULATED ANNEALING;

EID: 52349121983     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCDC.2008.4598086     Document Type: Conference Paper

References (16)

1. R.H.Ballou, M. Chowdhury. MSVS: An Extended Computer Model for Transport Mode Selection. Logistics and Transportation Review, Vol.16, No.4, 325-338, 1980.
2. B. L.Golden, E. K.Baker, J. R. Alfaro. The vehicle routing problem with backhauling: two approaches. Working paper series M/S 85-037, College of Business Management, University of Maryland, 1985.
3. A. N. Maciek. The pickup and delivery problem with split load, Industrial and Systems Engineering Georgia Institute of Technology, 1-76, 2005.
4. H. Min. The multiple vehicle routing problems with simultaneous delivery and pick-up points. Transportation Research, Vol.23A, 377-386, 1989.
5. J. Dethloff. Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum, Vol.23, 79-96, 2001.
6. FA. Tang, RD. Galvao. Vehicle routing problem with delivery and pickup. Journal of the Operational Research Society of India (OPSEARCH), Vol.39: 19-33, 2002.
7. F. A. M. Tang, R. D. Galvao. A Tabu search algorithm for vehicle routing problem with simultaneous pickup and delivery service. Computes and Operations Research, Vol.33, No.3, 595-619, 2006.
8. Guo Fu, Long Ying. Vehicle routing problem with time windows and simultaneous pick-up and delivery, Northeastern University Journal, Vol.27, No.5, 575-578, 2006. (in Chinese)
9. Xie Ruhe, Liu Ting, Qiu ZhuQiang. Reverse logistics vehicle routing problem based on the loading capacity of the remaining, Northeastern University Journal (Natural Science), Vol.27, No.5, 22-25, 2006. (in Chinese)
10. J. Kennedy, R. C. Eberhart. Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, Piscataway, NJ: IEEE Service Center, 1942-1948, 1995.
11. N. A. Meteopolis, A. Rosenbluth, M. Rosenbluth, A, Teller, E. Teller. Equation of state Calculations by fast computing machines. Journal of Chemical Physics, Vol.21:1087-1092, 1953.
12. H. W. Leong, D. G. Wong, C. L. Liu. A simulated annealing channel router. Proceedings of the IEEE international Conference on Computer-Aided Design, Santa Clara, CA, 226-229, November 1985.
13. M. P. Vecchi, S. Kirkpatrick. Global wiring by simulated annealing. IEEE Trans. Computer-Aided Design, Vol.2, 215-222, 1983.
14. Solis F., Wets R. Minimization by random search techniques. Mathematics of Operations Research, Vol.6, 19-30, 1981.
15. L. S. Kang, Y. Xie. Nonnumerical Parllel Algorithm-Simulatted Annealing Algorithm, Science Press, Beijing, China, 1994.
16. Lang Maoxiang. Working hybrid vehicle routing problem simulated annealing algorithm, Journal of Systems Engineering, Vol.20, No.5, 41-47, 2005. (in Chinese)