Improved ant colony algorithm for the VRPSPD with maximum distance constraint

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice

Volumn 28, Issue 1, 2008, Pages

  Zhang, Tao ^a   Tian, Wen Xin ^b   Zhang, Yue Jie ^c   Liu, Shi Xin ^d  

^a SHANGHAI UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^b SHANGHAI LIXIN UNIVERSITY OF ACCOUNTING AND FINANCE   (China)

^c FUDAN UNIVERSITY   (China)

^d KEY LABORATORY OF INTEGRATED AUTOMATION OF PROCESS INDUSTRY   (China)

Author keywords

Ant colony system (ACS); Mixed integer programming; Reverse logistic; System engineering; VRPSPD

Indexed keywords

HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LOGISTICS; VEHICLE ROUTING;

ANT COLONY SYSTEM; MIXED INTEGER PROGRAMMING; REVERSE LOGISTIC; SYSTEM ENGINEERING;

SYSTEMS ENGINEERING;

EID: 43349099839     PISSN: 10006788     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. Min H. The multiple vehicle routing problems with simultaneous delivery and pick-up points[J]. Transportation Research, 1989, 23A: 377-386.
2. Halse K. Modeling and solving complex vehicle routing problems[D]. Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, Lyngby, 1992.
3. Gendreau M, Laporte G, Vigo D. Heuristics for the travelling salesman problem with pickup and delivery[J]. Computers and Operations Research, 1999, 26: 699-714.
4. Dethloff J. Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up[J]. OR Spektrum, 2001, 23: 79-96.
5. Tang F A, Galvāo R D. Vehicle routing problems with simultaneous pick-up and delivery service[J]. Journal of the Operational Research Society of India (OPSEARCH), 2002, 39: 19-33.
6. Tang F A, Galvāo R D. A Tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J]. Computer and Operations Research, 2006, 33: 595-619.
7. Angelelli E, Mansini R. The vehicle routing problem with time windows and simultaneous pick-up and delivery[C]//Quantitative approaches to distribution logistics and supply chain management series. Lecture Notes in Economics and Mathematical Systems, 2002, 249-267.
8. Anily S. The vehicle-routing problem with delivery and back-haul options[J]. Naval Research Logistics, 1996, 43: 415-434.
9. Dethloff J. Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls[J]. Journal of the Operational Research Society, 2002, 52: 115-118.
10. Gambardella L M, Taillard E, Agazzi G. MACSVRPTW: A multiple ant colony system for vehicle routing problems with time windows[C]//New Ideas in Optimization. McGraw-Hill, London UK, 1999, 63-76.
11. Montemanni R, Gambardella L M, Rizzoli A E, et al. A new algorithm for a dynamic vehicle routing problem based on ant colony system[R]. Technical Report IDSIA-23-02, IDSIA, November 2002.
12. Reimann M, Doerner K, Hartl R F. Analyzing a unified ant system for the VRP and some of its variants[C]//EvoWorkshops, LNCS 2611, 2003, 300-310.
13. Cui Xueli, Ma Liang, Fan Bingquan. Ant searching algorithm for vehicle routing problem[J]. Transaction of Systems Engineering, 2004, 19(4): 418-422.
14. Liu Zhishuo, Shen Jinsheng, Chai Yueting. Vehicle routing problem based on an adaptive ant colony algorithm[J]. Control and Decision, 2005, 20(5): 562-566.
15. Wan Xu, Lin Jianliang, Yang Xiaowei. Improved MMAS for vehicle routing problem with time window[J]. Computer Integrated Manufacturing Systems, 2005, 11(4): 572-576.
16. Wade A, Salhi S. An Ant System Algorithm for the Mixed Vehicle Routing Problem with Backhauls[M]. Metaheuristics: Computer Decision-Making. Kluwer Academic Publishers, Netherlands, 2004, 699-719.
17. Reimann M, Doerner K, Hartl R F. Insertion based ants for vehicle routing problems with backhauls and time windows[C]//ANTS: 2002 Lecture Notes in Computer Sciences, 2002, 2463: 136-148.
18. Catay B, Gökce E. An ant colony system approach for the capacitated vehicle routing problem with simultaneous delivery and pick-up[R]. Working Paper, Sabanci University, 2005.
19. Dorigo M, Maniezzo V, Colorni A. The ant system: Optimization by a colony of cooperating agents[J]. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 1996, 26: 29-41.
20. Dorigo M, Gambardella L M. Ant colonies for the traveling salesman problem[J]. Bio Systems, 1997, 43: 73-81.
21. Dorigo M, Gambardella L M. Ant colony system: A cooperative learning approach to the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation, 1997, 1: 53-66.
22. Stutzle T, Hoos H. MAX-MIN ant system[J]. Future Generation Computer Systems, 2000, 16(8): 889-914.
23. Bullnheimer B, Hartl R F, Strauss C. A new rank based version of the ant system: A computational study[J]. Central European Journal for Operation Research and Economics, 1999, 7(1): 25-28.
24. Middendorf M, Reischle F, Schmeck H. Multi colony ant algorithms[J]. Journal of Heuristics, 2002, 8(3): 305-320.
25. Wu Qinghong, Zhang Jihui, Xu Xinhe. An ant colony algorithm with mutation features[J]. Journal of Computer Research and Development, 1999, 36(10): 1240-1245.
26. Qin Gangli, Yang Jiaben. An improved ant colony algorithm based on adaptively adjusting pheromone[J]. Information and Control, 2002, 31(3): 198-201.
27. Hao Jin, Shi Libao, Zhou Jiaqi. An ant system algorithm with random perturbation behavior for complex TSP problem[J]. Systems Engineering - Theory and Practice, 2002, 25(9): 88-91.