The period routing problem
作者： N. Christofides , J. E. Beasley
关键词: Mathematical optimization 、 Simulation 、 Service level requirement 、 Transportation theory 、 Routing (electronic design automation) 、 Heuristic (computer science) 、 Computer science 、 Service level 、 Vehicle routing problem 、 Travelling salesman problem 、 Level of service
摘要: In this paper we present heuristic algorithms for the period vehicle routing problem, problem of designing routes to meet required service levels customers and minimize distribution costs over a given several-day time. These are based on an initial choice customer delivery days which level requirements, followed by interchange procedure in attempt costs. The represent replacing each day (I) median (II) traveling salesman problem. Computational results comparisons algorithms, test problems derived from literature with up 126 customers. largest these is one solved Russell Igo. solution obtained shows improvement 13% previous best solution. (Author/TRRL)
sci-hub.se 参考文章(8)
E. J. Beltrami, L. D. Bodin, Networks and vehicle routing for municipal waste collection Networks. ,vol. 4, pp. 65- 94 ,(1974) , 10.1002/NET.3230040106
Nicos Christofides, Samuel Eilon, EXPECTED DISTANCES IN DISTRIBUTION PROBLEMS Journal of the Operational Research Society. ,vol. 20, pp. 437- 443 ,(1969) , 10.1057/JORS.1969.101
S. Lin, B. W. Kernighan, An Effective Heuristic Algorithm for the Traveling-Salesman Problem Operations Research. ,vol. 21, pp. 498- 516 ,(1973) , 10.1287/OPRE.21.2.498
R. Russell, W. Igo, An assignment routing problem Networks. ,vol. 9, pp. 1- 17 ,(1979) , 10.1002/NET.3230090102
B. L. Golden, T. L. Magnanti, H. Q. Nguyen, Implementing vehicle routing algorithms Networks. ,vol. 7, pp. 113- 148 ,(1977) , 10.1002/NET.3230070203
G. Clarke, J. W. Wright, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points Operations Research. ,vol. 12, pp. 568- 581 ,(1964) , 10.1287/OPRE.12.4.568
Samuel Eilon, Nicos Christofides, The Loading Problem Management Science. ,vol. 17, pp. 259- 268 ,(1971) , 10.1287/MNSC.17.5.259
Robert A. Russell, Technical Note—An Effective Heuristic for theM-Tour Traveling Salesman Problem with Some Side Conditions Operations Research. ,vol. 25, pp. 517- 524 ,(1977) , 10.1287/OPRE.25.3.517