Predatory search algorithm for vehicle routing problem

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS

Volumn 12, Issue 11, 2006, Pages

  Jiang, Zhong Zhong ^a   Wang, Ding Wei ^b  

^a NORTHEASTERN UNIVERSITY   (China)

^b NORTHEASTERN UNIVERSITY   (China)

Author keywords

Combinatorial optimization; Predatory search algorithm; Vehicle routing problem

Indexed keywords

TRAVELING SALESMAN PROBLEM; VEHICLES;

COMBINATORIAL OPTIMIZATION; LOCAL SEARCH; NP HARD COMPLEXITY; PREDATORY SEARCH ALGORITHM; VEHICLE ROUTING PROBLEM;

OPTIMIZATION;

EID: 33846151406     PISSN: 10065911     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. BODIN L, GOLDEN B, ASSAD A, et al. Routing and scheduling of vehicles and crews: the state of the art[J]. Computation and Operation Research, 1983, 52(10): 62-212.
2. CLARKE G, WRIGHT J W. Scheduling of vehicles from a central depot to a number of delivery points[J]. Operations Research, 1964, 12(4): 568-581.
3. GILLETT B, MILLER L. A heuristic algorithm for the vehicle dispatch problem[J]. Operations Research, 1974, 22(2): 340-349.
4. BRAMEL J, SIMCHI-LEVI D. A location based heuristic for general routing problems[J]. Operation Research, 1995, 43(4): 649-660.
5. FISHER M L, JAIKUMAR R. A generalized assignment heuristic for vehicle routing[J]. Networks, 1981, 11(2): 24-109.
6. CHRISTOFIDES N, MINGOZZI A, TOTH P. Combinational optimization[M]. New York, N. Y., USA: Johnly Wiley, 1979.
7. ZHAO Yanwei, WU Bin, JIANG Li, et al. Double populations genetic algorithm for vehicle routing problem[J]. Computer Integrated Manufacturing Systems, 2004, 10(3): 303-306 (in Chinese).
8. BAKER B M, AYECHEW M A. A genetic algorithm for the vehicle routing problem[J]. Computers and Operations Research, 2003, 30(5): 787-800.
9. JIANG Dali, YANG Silong, DU Wen. A study on the genetic algorithm for vehicle routing problem[J]. System Engineering-Theory and Practice, 1999, 19(6): 44-45 (in Chinese).
10. OSMAN I H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem[J]. Annals of Operations Research, 1993, 41(2): 421-451.
11. BERND B, RICHARD F H, CHRISTINE S. Applying the ant system to the vehicle routing problem[A]. Meta-Heuristics Advances and Trends in Local Search Paradigms for Optimization[C]. Boston, Mass., USA: Kluwer, 1997. 1-11.
12. LIU Yunzhong, XUAN Huiyu. Application of the ant algorithm to vehicle routing problem[J]. Information and Control, 2004, 33(2): 249-252 (in Chinese).
13. LINHARES A. Preying on optimal: a predatory search strategy for combinatorial problems[A]. Proceedings of IEEE International Conference on Systems, Man and Cybernetics[C]. Washington, D. C., USA: IEEE, 1998. 2974-2978.
14. LINHARES A. State-space search strategies gleaned from animal behavior: a traveling salesman experiment[J]. Biological Cybernetic, 1998, 78(3): 167-173.
15. LINHARES A. Synthesizing a predatory search strategy for VLSI layouts[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(2): 147-152.
16. SHAW P. Using constraint programming and local search method to solve vehicle routing problem[A]. Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming (CP'98)[C]. Berlin, Germany: Springer-Verlag, 1998. 417-431.
17. BOESE K D, KAHNG A B, MUDDU S. A new adaptive multi-start technique for combinatorial global optimizations[J]. Operations Research Letters, 1994, 16(3): 101-113.