A heuristic algorithm for the period vehicle routing problem

作者: C.C.R. Tan , J.E. Beasley

DOI: 10.1016/0305-0483(84)90050-1

关键词: Transportation theoryDestination-Sequenced Distance Vector routingPeriodic vehicle routing problemComputer scienceStatic routingVehicle routing problemDistribution systemCustomer serviceMathematical optimizationPeriod (music)Management Science and Operations ResearchStrategy and ManagementInformation Systems and Management

摘要: … the period vehicle routing problem, which is the problem of designing routes for delivery vehicles … require delivery on every day in the period). A heuristic algorithm, based upon the daily …

参考文章(11)
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
R. H. Mole, A Survey of Local Delivery Vehicle Routing Methodology Journal of the Operational Research Society. ,vol. 30, pp. 245- 252 ,(1979) , 10.1057/JORS.1979.46
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
Marshall L. Fisher, Arnold J. Greenfield, R. Jaikumar, Joseph T. Lester, A COMPUTERIZED VEHICLE ROUTING APPLICATION Interfaces. ,vol. 12, pp. 42- 52 ,(1982) , 10.1287/INTE.12.4.42
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
N. Christofides, J. E. Beasley, The period routing problem Networks. ,vol. 14, pp. 237- 256 ,(1984) , 10.1002/NET.3230140205
Marshall L. Fisher, Ramchandran Jaikumar, A generalized assignment heuristic for vehicle routing Networks. ,vol. 11, pp. 109- 124 ,(1981) , 10.1002/NET.3230110205