A comparative study of metaheuristics for vehicle routing problem with stochastic demands

Asia-Pacific Journal of Operational Research

Volumn 20, Issue 1, 2003, Pages 103-119

  Teng, Suyan ^a   Ong, H L ^a   Huang, H C ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Simulated annealing; Stochastic demands; Tabu search; Threshold accepting; Vehicle routing problem

Indexed keywords

OPERATIONS RESEARCH; PLANNING; PROBLEM SOLVING; SIMULATED ANNEALING; VEHICLES;

METAHEURISTICS; VEHICLE ROUTING PROBLEM;

HEURISTIC METHODS;

EID: 0344084252     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. Bartholdi, J. and L. Platzman (1982), An O(n log n) planar traveling salesman heuristic based on spacefilling curves, Operations Research Letters 1, 121-125.
2. Bentley, J. L. (1992), Fast algorithms for geometric traveling salesman problems, ORSA Journal of Computing 4, 387-411.
3. Bertsimas, D., P. Chervi and M. Peterson (1995), Computational approaches to stochastic vehicle routing problems, Transportation Science 29, 342-352.
4. Bodin, L., B. Golden, A. Assad and M. Ball (1983), Routing and scheduling of vehicles and crew: The state of the art, Computers & Operations Research 10, 63-211.
5. Dorigo, M., E. Bonabeau and G. Theraulaz (2000), Ant algorithms and stigmergy, Future Generation Computer Systems 16, 851-871.
6. Gendreau, M., G. Laporte and R. Seguin (1996), Stochastic vehicle routing, European Journal of Operational Research 88, 3-12.
7. Hiquebran, D. T., A. S. Alfa, J. A. Shapiro and D. H. Gittoes (1994), A revised simulated annealing and cluster-first route-second algorithm applied to the vehicle routing problem, Engineering Optimization 22, 77-107.
8. Lambert, V., G. Laporte and F. V. Louveaux (1993), Designing collection routes through bank branches, Computers & Operations Research 20, 783-791.
9. Lin, S. (1965). Computer solutions of the traveling salesman problem. Bell System Technical Journal 44, 2245-2269.
10. Ong, H. L., B. W. Ang, T. N. Goh and C. C. Deng (1997), A vehicle routing and scheduling problem with time windows and stochastic demand constraints, Asia-Pacific Journal of Operational Research 14, 1-17.
11. Or, I. (1976), Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking, Ph.D. Thesis, Evanston, IL: Northwestern University.
12. Protonotarios, M., G. Mourkousis, I. Vyridis and T. Varvarigou (2000), Very large scale vehicle routing with time windows and stochastic demand using genetic algorithms with parallel fitness evaluation, Lecture Notes in Computer Science 1823, 467-476.
13. Rosenkrantz, D. J., R. E. Stearns and P. M. Lewis (1977), An analysis of several heuristics for the traveling salesman problem, SIAM Journal of Computing 6, 563-581.
14. Stewart, W. R. and B. L. Golden (1983), Stochastic vehicle routing: a comprehensive approach, European Journal of Operational Research 14, 371-385.
15. Teng, S. Y., H. L. Ong and H. C. Huang (2001), A comparative study on algorithms for vehicle routing problems with stochastic demands, In: Proceedings of the 5th International Conference on Optimization: Techniques and Applications, Hong Kong, 1621-1629.
16. Teodorovic, D. and G. Pavkovic (1992), A simulated annealing technique approach to the vehicle routing problem in the case of Stochastic Demand, Transportation Planning and Technology 16, 261-270.
17. Yang, W. H., K. Mathur and R. H. Ballou (2000), Stochastic vehicle routing problem with restocking, Transportation Science 34, 99-112.