메뉴 건너뛰기




Volumn 231, Issue 1, 2013, Pages 1-21

Heuristics for multi-attribute vehicle routing problems: A survey and synthesis

Author keywords

Analysis; Heuristics; Meta heuristics; Multi attribute problems; Survey; Vehicle routing

Indexed keywords

SURVEYING; SURVEYS; VEHICLES;

EID: 84879975668     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.02.053     Document Type: Article
Times cited : (366)

References (279)
  • 2
    • 84867980790 scopus 로고    scopus 로고
    • A survey of very large-scale neighborhood search techniques
    • R. Ahuja, O. Ergun, J. Orlin, and A. Punnen A survey of very large-scale neighborhood search techniques Discrete Applied Mathematics 123 1-3 2002 75 102
    • (2002) Discrete Applied Mathematics , vol.123 , Issue.13 , pp. 75-102
    • Ahuja, R.1    Ergun, O.2    Orlin, J.3    Punnen, A.4
  • 4
    • 33646112638 scopus 로고    scopus 로고
    • Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm
    • E. Alba, and B. Dorronsoro Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm Information Processing Letters 98 6 2006 225 230
    • (2006) Information Processing Letters , vol.98 , Issue.6 , pp. 225-230
    • Alba, E.1    Dorronsoro, B.2
  • 5
    • 33845925304 scopus 로고    scopus 로고
    • Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
    • J. Alegre, M. Laguna, and J. Pacheco Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts European Journal of Operational Research 179 3 2007 736 746
    • (2007) European Journal of Operational Research , vol.179 , Issue.3 , pp. 736-746
    • Alegre, J.1    Laguna, M.2    Pacheco, J.3
  • 6
    • 84863624412 scopus 로고    scopus 로고
    • A tabu search with vocabulary building approach for the vehicle routing problem with split demands
    • R. Aleman, and R. Hill A tabu search with vocabulary building approach for the vehicle routing problem with split demands International Journal of Metaheuristics 1 1 2010 55 80
    • (2010) International Journal of Metaheuristics , vol.1 , Issue.1 , pp. 55-80
    • Aleman, R.1    Hill, R.2
  • 7
    • 44849106364 scopus 로고    scopus 로고
    • A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
    • F. Alonso, M.J. Alvarez, and J.E. Beasley A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions Journal of the Operational Research Society 59 7 2008 963 976
    • (2008) Journal of the Operational Research Society , vol.59 , Issue.7 , pp. 963-976
    • Alonso, F.1    Alvarez, M.J.2    Beasley, J.E.3
  • 8
    • 33749651515 scopus 로고    scopus 로고
    • A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
    • G. Alvarenga, G. Mateus, and G. De Tomi A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows Computers & Operations Research 34 6 2007 1561 1584
    • (2007) Computers & Operations Research , vol.34 , Issue.6 , pp. 1561-1584
    • Alvarenga, G.1    Mateus, G.2    De Tomi, G.3
  • 10
    • 33846106058 scopus 로고    scopus 로고
    • Metaheuristics for the team orienteering problem
    • C. Archetti, A. Hertz, and M.G. Speranza Metaheuristics for the team orienteering problem Journal of Heuristics 13 1 2006 49 76
    • (2006) Journal of Heuristics , vol.13 , Issue.1 , pp. 49-76
    • Archetti, C.1    Hertz, A.2    Speranza, M.G.3
  • 11
    • 84859700901 scopus 로고    scopus 로고
    • Archetti, C., Speranza, M., 2012. Vehicle routing problems with split deliveries. International Transactions in Operational Research 19 (1-2), 3-22.
    • Archetti, C., Speranza, M., 2012. Vehicle routing problems with split deliveries. International Transactions in Operational Research 19 (1-2), 3-22.
  • 12
    • 51649122201 scopus 로고    scopus 로고
    • An optimization-based heuristic for the split delivery vehicle routing problem
    • C. Archetti, M. Speranza, and M. Savelsbergh An optimization-based heuristic for the split delivery vehicle routing problem Transportation Science 42 1 2008 22 31
    • (2008) Transportation Science , vol.42 , Issue.1 , pp. 22-31
    • Archetti, C.1    Speranza, M.2    Savelsbergh, M.3
  • 13
    • 0001900128 scopus 로고
    • Modeling and implementation issues in vehicle routing
    • B. Golden, A. Assad, North-Holland Amsterdam
    • A. Assad Modeling and implementation issues in vehicle routing B. Golden, A. Assad, Vehicle Routing: Methods and Studies 1988 North-Holland Amsterdam 7 45
    • (1988) Vehicle Routing: Methods and Studies , pp. 7-45
    • Assad, A.1
  • 17
    • 45149121178 scopus 로고    scopus 로고
    • An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
    • R. Baldacci, N. Christofides, and A. Mingozzi An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts Mathematical Programming 115 2 2008 351 385
    • (2008) Mathematical Programming , vol.115 , Issue.2 , pp. 351-385
    • Baldacci, R.1    Christofides, N.2    Mingozzi, A.3
  • 18
    • 67349235349 scopus 로고    scopus 로고
    • A unified exact method for solving different classes of vehicle routing problems
    • R. Baldacci, and A. Mingozzi A unified exact method for solving different classes of vehicle routing problems Mathematical Programming 120 2 2009 347 380
    • (2009) Mathematical Programming , vol.120 , Issue.2 , pp. 347-380
    • Baldacci, R.1    Mingozzi, A.2
  • 19
    • 81455135706 scopus 로고    scopus 로고
    • New route relaxation and pricing strategies for the vehicle routing problem
    • R. Baldacci, A. Mingozzi, and R. Roberti New route relaxation and pricing strategies for the vehicle routing problem Operations Research 59 5 2011 1269 1283
    • (2011) Operations Research , vol.59 , Issue.5 , pp. 1269-1283
    • Baldacci, R.1    Mingozzi, A.2    Roberti, R.3
  • 20
    • 63949084627 scopus 로고    scopus 로고
    • Recent advances in vehicle routing exact algorithms
    • R. Baldacci, P. Toth, and D. Vigo Recent advances in vehicle routing exact algorithms 4OR 5 4 2007 269 298
    • (2007) 4OR , vol.5 , Issue.4 , pp. 269-298
    • Baldacci, R.1    Toth, P.2    Vigo, D.3
  • 21
    • 78549273306 scopus 로고    scopus 로고
    • An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows
    • S. Balseiro, I. Loiseau, and J. Ramonet An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows Computers & Operations Research 38 6 2011 954 966
    • (2011) Computers & Operations Research , vol.38 , Issue.6 , pp. 954-966
    • Balseiro, S.1    Loiseau, I.2    Ramonet, J.3
  • 22
    • 0029362492 scopus 로고
    • Designing and reporting on computational experiments with heuristic methods
    • R. Barr, B. Golden, J. Kelly, M. Resende, and J.R.W. Stewart Designing and reporting on computational experiments with heuristic methods Journal of Heuristics 1 1 1995 9 32
    • (1995) Journal of Heuristics , vol.1 , Issue.1 , pp. 9-32
    • Barr, R.1    Golden, B.2    Kelly, J.3    Resende, M.4    Stewart, J.R.W.5
  • 23
    • 0021034477 scopus 로고
    • Route first - Cluster second methods for vehicle routing
    • J. Beasley Route first - cluster second methods for vehicle routing Omega 11 4 1983 403 408
    • (1983) Omega , vol.11 , Issue.4 , pp. 403-408
    • Beasley, J.1
  • 25
    • 0034262328 scopus 로고    scopus 로고
    • A lower bound for the split delivery vehicle routing problem
    • J.M. Belenguer, M.C. Martinez, and E. Mota A lower bound for the split delivery vehicle routing problem Operations Research 48 5 2000 801 810
    • (2000) Operations Research , vol.48 , Issue.5 , pp. 801-810
    • Belenguer, J.M.1    Martinez, M.C.2    Mota, E.3
  • 26
    • 9344232811 scopus 로고    scopus 로고
    • Ant colony optimization techniques for the vehicle routing problem
    • J. Bell, and P. Mc Mullen Ant colony optimization techniques for the vehicle routing problem Advanced Engineering Informatics 18 1 2004 41 48
    • (2004) Advanced Engineering Informatics , vol.18 , Issue.1 , pp. 41-48
    • Bell, J.1    Mc Mullen, P.2
  • 27
    • 27144512258 scopus 로고    scopus 로고
    • A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
    • R. Bent, and P. Van Hentenryck A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows Computers & Operations Research 33 4 2006 875 893
    • (2006) Computers & Operations Research , vol.33 , Issue.4 , pp. 875-893
    • Bent, R.1    Van Hentenryck, P.2
  • 28
    • 78149258340 scopus 로고    scopus 로고
    • Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows
    • D. Cohen, LNCS Springer Berlin, Heidelberg
    • R. Bent, and P. Van Hentenryck Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows D. Cohen, Proceedings of CP'10 LNCS vol. 6308 2010 Springer Berlin, Heidelberg 99 113
    • (2010) Proceedings of CP'10 , vol.6308 VOL. , pp. 99-113
    • Bent, R.1    Van Hentenryck, P.2
  • 29
    • 85132117646 scopus 로고    scopus 로고
    • Static pickup and delivery problems: A classification scheme and survey
    • G. Berbeglia, J.-F. Cordeau, I. Gribkovskaia, and G. Laporte Static pickup and delivery problems: a classification scheme and survey Top 15 1 2007 1 31
    • (2007) Top , vol.15 , Issue.1 , pp. 1-31
    • Berbeglia, G.1    Cordeau, J.-F.2    Gribkovskaia, I.3    Laporte, G.4
  • 31
    • 79956127340 scopus 로고    scopus 로고
    • Hybrid metaheuristics in combinatorial optimization: A survey
    • C. Blum, J. Puchinger, G. Raidl, and A. Roli Hybrid metaheuristics in combinatorial optimization: a survey Applied Soft Computing 11 6 2011 4135 4151
    • (2011) Applied Soft Computing , vol.11 , Issue.6 , pp. 4135-4151
    • Blum, C.1    Puchinger, J.2    Raidl, G.3    Roli, A.4
  • 32
    • 0344236266 scopus 로고    scopus 로고
    • Metaheuristics in combinatorial optimization: Overview and conceptual comparison
    • C. Blum, and A. Roli Metaheuristics in combinatorial optimization: overview and conceptual comparison ACM Computing Surveys (CSUR) 35 3 2003 268 308
    • (2003) ACM Computing Surveys (CSUR) , vol.35 , Issue.3 , pp. 268-308
    • Blum, C.1    Roli, A.2
  • 33
    • 0018468261 scopus 로고
    • Routing and scheduling of school buses by computer
    • L. Bodin, and L. Berman Routing and scheduling of school buses by computer Transportation Science 13 2 1979 113
    • (1979) Transportation Science , vol.13 , Issue.2 , pp. 113
    • Bodin, L.1    Berman, L.2
  • 34
    • 0019572346 scopus 로고
    • Classification in vehicle routing and scheduling
    • L. Bodin, and B. Golden Classification in vehicle routing and scheduling Networks 11 2 1981 97 108
    • (1981) Networks , vol.11 , Issue.2 , pp. 97-108
    • Bodin, L.1    Golden, B.2
  • 35
    • 0016409852 scopus 로고
    • A taxonomic structure for vehicle routing and scheduling problems
    • L.D. Bodin A taxonomic structure for vehicle routing and scheduling problems Computers & Urban Society 1 1 1975 11 29
    • (1975) Computers & Urban Society , vol.1 , Issue.1 , pp. 11-29
    • Bodin, L.D.1
  • 36
    • 84879946938 scopus 로고    scopus 로고
    • Boese, K., 1995. Cost versus distance in the traveling salesman problem. Tech. rep.
    • Boese, K., 1995. Cost versus distance in the traveling salesman problem. Tech. rep.
  • 37
    • 84855560615 scopus 로고    scopus 로고
    • A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
    • A. Bortfeldt A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints Computers & Operations Research 39 9 2012 2248 2257
    • (2012) Computers & Operations Research , vol.39 , Issue.9 , pp. 2248-2257
    • Bortfeldt, A.1
  • 38
    • 38149137304 scopus 로고    scopus 로고
    • An effective memetic algorithm with population management for the split delivery vehicle routing problem
    • LNCS Springer Berlin, Heidelberg
    • M. Boudia, C. Prins, and M. Reghioui An effective memetic algorithm with population management for the split delivery vehicle routing problem Hybrid Metaheuristics LNCS vol. 4771 2007 Springer Berlin, Heidelberg 16 30
    • (2007) Hybrid Metaheuristics , vol.4771 VOL. , pp. 16-30
    • Boudia, M.1    Prins, C.2    Reghioui, M.3
  • 39
    • 77952882395 scopus 로고    scopus 로고
    • A memetic algorithm for the team orienteering problem
    • H. Bouly, D.-C. Dang, and A. Moukrim A memetic algorithm for the team orienteering problem 4OR 8 1 2009 49 70
    • (2009) 4OR , vol.8 , Issue.1 , pp. 49-70
    • Bouly, H.1    Dang, D.-C.2    Moukrim, A.3
  • 40
    • 34848923791 scopus 로고    scopus 로고
    • An exact algorithm for team orienteering problems
    • S. Boussier, D. Feillet, and M. Gendreau An exact algorithm for team orienteering problems 4OR 5 3 2006 211 230
    • (2006) 4OR , vol.5 , Issue.3 , pp. 211-230
    • Boussier, S.1    Feillet, D.2    Gendreau, M.3
  • 41
    • 33646514887 scopus 로고    scopus 로고
    • A new tabu search algorithm for the vehicle routing problem with backhauls
    • J. Brandão A new tabu search algorithm for the vehicle routing problem with backhauls European Journal of Operational Research 173 2 2006 540 555
    • (2006) European Journal of Operational Research , vol.173 , Issue.2 , pp. 540-555
    • Brandão, J.1
  • 42
    • 77956058285 scopus 로고    scopus 로고
    • A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
    • J. Brandão A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem Computers & Operations Research 38 1 2011 140 151
    • (2011) Computers & Operations Research , vol.38 , Issue.1 , pp. 140-151
    • Brandão, J.1
  • 43
    • 3843138356 scopus 로고    scopus 로고
    • A reactive variable neighborhood search for the vehicle-routing problem with time windows
    • O. Bräysy A reactive variable neighborhood search for the vehicle-routing problem with time windows INFORMS Journal on Computing 15 4 2003 347 368
    • (2003) INFORMS Journal on Computing , vol.15 , Issue.4 , pp. 347-368
    • Bräysy, O.1
  • 44
    • 16244364524 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows. Part I: Route construction and local search algorithms
    • O. Bräysy, and M. Gendreau Vehicle routing problem with time windows. Part I: Route construction and local search algorithms Transportation Science 39 1 2005 104 118
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 104-118
    • Bräysy, O.1    Gendreau, M.2
  • 45
    • 16244404291 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows. Part II: Metaheuristics
    • O. Bräysy, and M. Gendreau Vehicle routing problem with time windows. Part II: Metaheuristics Transportation Science 39 1 2005 119 139
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 119-139
    • Bräysy, O.1    Gendreau, M.2
  • 46
    • 84879930140 scopus 로고    scopus 로고
    • Bräysy, O., Gendreau, M., Hasle, G., Lokketangen, A., 2008a. A Survey of Heuristics for the Vehicle Routing Problem Part I: Basic Problems and Supply Side Extensions. Tech. rep., SINTEF, Norway.
    • Bräysy, O., Gendreau, M., Hasle, G., Lokketangen, A., 2008a. A Survey of Heuristics for the Vehicle Routing Problem Part I: Basic Problems and Supply Side Extensions. Tech. rep., SINTEF, Norway.
  • 47
    • 84879941318 scopus 로고    scopus 로고
    • Bräysy, O., Gendreau, M., Hasle, G., Lokketangen, A., 2008b. A Survey of Heuristics for the Vehicle Routing Problem Part II: Demand Side Extensions. Tech. rep., SINTEF, Norway.
    • Bräysy, O., Gendreau, M., Hasle, G., Lokketangen, A., 2008b. A Survey of Heuristics for the Vehicle Routing Problem Part II: Demand Side Extensions. Tech. rep., SINTEF, Norway.
  • 48
    • 0033446619 scopus 로고    scopus 로고
    • An improved ant system algorithm for the vehicle routing problem
    • B. Bullnheimer, R. Hartl, and C. Strauss An improved ant system algorithm for the vehicle routing problem Annals of Operations Research 89 1999 319 328
    • (1999) Annals of Operations Research , vol.89 , pp. 319-328
    • Bullnheimer, B.1    Hartl, R.2    Strauss, C.3
  • 50
    • 79959444534 scopus 로고    scopus 로고
    • Modeling and solving the capacitated vehicle routing problem on trees
    • B. Golden, S. Raghavan, E. Wasil, Springer New York
    • B. Chandran, and S. Raghavan Modeling and solving the capacitated vehicle routing problem on trees B. Golden, S. Raghavan, E. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges 2008 Springer New York 616 622
    • (2008) The Vehicle Routing Problem: Latest Advances and New Challenges , pp. 616-622
    • Chandran, B.1    Raghavan, S.2
  • 52
    • 71749092006 scopus 로고    scopus 로고
    • Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem
    • P. Chen, H.-K. Huang, and X.-Y. Dong Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem Expert Systems with Applications 37 2 2010 1620 1627
    • (2010) Expert Systems with Applications , vol.37 , Issue.2 , pp. 1620-1627
    • Chen, P.1    Huang, H.-K.2    Dong, X.-Y.3
  • 53
    • 34548214096 scopus 로고    scopus 로고
    • The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
    • S. Chen, B. Golden, and E. Wasil The split delivery vehicle routing problem: applications, algorithms, test problems, and computational results Networks 49 4 2007 318 329
    • (2007) Networks , vol.49 , Issue.4 , pp. 318-329
    • Chen, S.1    Golden, B.2    Wasil, E.3
  • 55
    • 0342934405 scopus 로고
    • Algorithms for large-scale travelling salesman problems
    • N. Christofides, and S. Eilon Algorithms for large-scale travelling salesman problems Operational Research Quarterly 23 4 1972 511
    • (1972) Operational Research Quarterly , vol.23 , Issue.4 , pp. 511
    • Christofides, N.1    Eilon, S.2
  • 56
    • 0001208905 scopus 로고
    • The vehicle routing problem
    • N. Christofides, A. Mingozzi, P. Toth, C. Sandi, Wiley Chichester, UK
    • N. Christofides, A. Mingozzi, and P. Toth The vehicle routing problem N. Christofides, A. Mingozzi, P. Toth, C. Sandi, Combined Optimization 1979 Wiley Chichester, UK 315 338
    • (1979) Combined Optimization , pp. 315-338
    • Christofides, N.1    Mingozzi, A.2    Toth, P.3
  • 57
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 4 1964 568 581
    • (1964) Operations Research , vol.12 , Issue.4 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 58
    • 84879940154 scopus 로고    scopus 로고
    • Coelho, L., Cordeau, J.-F., Laporte, G., 2012. Thirty Years of Inventory-Routing. Tech. rep., CIRRELT, Montreal, Canada.
    • Coelho, L., Cordeau, J.-F., Laporte, G., 2012. Thirty Years of Inventory-Routing. Tech. rep., CIRRELT, Montreal, Canada.
  • 60
    • 0041194626 scopus 로고    scopus 로고
    • A tabu search heuristic for periodic and multi-depot vehicle routing problems
    • J.-F. Cordeau, M. Gendreau, and G. Laporte A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 2 1997 105 119
    • (1997) Networks , vol.30 , Issue.2 , pp. 105-119
    • Cordeau, J.-F.1    Gendreau, M.2    Laporte, G.3
  • 61
    • 0038364102 scopus 로고    scopus 로고
    • A tabu search heuristic for the static multi-vehicle dial-a-ride problem
    • J.-F. Cordeau, and G. Laporte A tabu search heuristic for the static multi-vehicle dial-a-ride problem Transportation Research Part B: Methodological 37 6 2003 579 594
    • (2003) Transportation Research Part B: Methodological , vol.37 , Issue.6 , pp. 579-594
    • Cordeau, J.-F.1    Laporte, G.2
  • 63
    • 84888579643 scopus 로고    scopus 로고
    • Recent models and algorithms for one-to-one pickup and delivery problems
    • B. Golden, S. Raghavan, E. Wasil, Springer New York
    • J.-F. Cordeau, G. Laporte, and S. Ropke Recent models and algorithms for one-to-one pickup and delivery problems B. Golden, S. Raghavan, E. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges 2008 Springer New York 327 357
    • (2008) The Vehicle Routing Problem: Latest Advances and New Challenges , pp. 327-357
    • Cordeau, J.-F.1    Laporte, G.2    Ropke, S.3
  • 64
    • 71949092423 scopus 로고    scopus 로고
    • Vehicle routing
    • C. Barnhart, G. Laporte, Elsevier, North-Holland Amsterdam
    • J.-F. Cordeau, G. Laporte, M. Savelsbergh, and D. Vigo Vehicle routing C. Barnhart, G. Laporte, Transportation 2007 Elsevier, North-Holland Amsterdam 367 428
    • (2007) Transportation , pp. 367-428
    • Cordeau, J.-F.1    Laporte, G.2    Savelsbergh, M.3    Vigo, D.4
  • 65
    • 84855529861 scopus 로고    scopus 로고
    • A parallel iterated tabu search heuristic for vehicle routing problems
    • J.-F. Cordeau, and M. Maischberger A parallel iterated tabu search heuristic for vehicle routing problems Computers & Operations Research 39 9 2012 2033 2050
    • (2012) Computers & Operations Research , vol.39 , Issue.9 , pp. 2033-2050
    • Cordeau, J.-F.1    Maischberger, M.2
  • 67
    • 84888618481 scopus 로고    scopus 로고
    • Parallel solution methods for vehicle routing problems
    • B. Golden, S. Raghavan, E. Wasil, Springer New York
    • T. Crainic Parallel solution methods for vehicle routing problems B. Golden, S. Raghavan, E. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges 2008 Springer New York 171 198
    • (2008) The Vehicle Routing Problem: Latest Advances and New Challenges , pp. 171-198
    • Crainic, T.1
  • 68
    • 70450055925 scopus 로고    scopus 로고
    • Crainic, T., Crisan, G., Gendreau, M., Lahrichi, N., Rei, W., 2009. Multi-thread integrative cooperative optimization for rich combinatorial problems. In: Proceedings of IPDPS '09.
    • Crainic, T., Crisan, G., Gendreau, M., Lahrichi, N., Rei, W., 2009. Multi-thread integrative cooperative optimization for rich combinatorial problems. In: Proceedings of IPDPS '09.
  • 69
    • 84864692126 scopus 로고    scopus 로고
    • Parallel meta-heuristics
    • M. Gendreau, J.-Y. Potvin, Springer US, Boston, MA
    • T. Crainic, and M. Toulouse Parallel meta-heuristics M. Gendreau, J.-Y. Potvin, Handbook of Metaheuristics 2010 Springer US, Boston, MA 497 541
    • (2010) Handbook of Metaheuristics , pp. 497-541
    • Crainic, T.1    Toulouse, M.2
  • 70
    • 45849089526 scopus 로고    scopus 로고
    • The memetic self-organizing map approach to the vehicle routing problem
    • J.-C. Créput, and A. Koukam The memetic self-organizing map approach to the vehicle routing problem Soft Computing 12 11 2008 1125 1141
    • (2008) Soft Computing , vol.12 , Issue.11 , pp. 1125-1141
    • Créput, J.-C.1    Koukam, A.2
  • 71
    • 79955877112 scopus 로고    scopus 로고
    • A PSO-based memetic algorithm for the team orienteering problem
    • LNCS Springer Berlin, Heidelberg
    • D.-C. Dang, R. Guibadj, and A. Moukrim A PSO-based memetic algorithm for the team orienteering problem Applications of Evolutionary Computation LNCS vol. 6625 2011 Springer Berlin, Heidelberg 471 480
    • (2011) Applications of Evolutionary Computation , vol.6625 VOL. , pp. 471-480
    • Dang, D.-C.1    Guibadj, R.2    Moukrim, A.3
  • 72
    • 0001953950 scopus 로고
    • The truck dispatching problem
    • G. Dantzig, and J. Ramser The truck dispatching problem Management Science 6 1 1959 80 91
    • (1959) Management Science , vol.6 , Issue.1 , pp. 80-91
    • Dantzig, G.1    Ramser, J.2
  • 73
    • 29044449517 scopus 로고    scopus 로고
    • A new ILP-based refinement heuristic for vehicle routing problems
    • R. De Franceschi, M. Fischetti, and P. Toth A new ILP-based refinement heuristic for vehicle routing problems Mathematical Programming 105 2 2006 471 499
    • (2006) Mathematical Programming , vol.105 , Issue.2 , pp. 471-499
    • De Franceschi, R.1    Fischetti, M.2    Toth, P.3
  • 76
    • 33750462723 scopus 로고    scopus 로고
    • Applying the attribute based hill climber heuristic to the vehicle routing problem
    • U. Derigs, and R. Kaiser Applying the attribute based hill climber heuristic to the vehicle routing problem European Journal of Operational Research 177 2 2007 719 732
    • (2007) European Journal of Operational Research , vol.177 , Issue.2 , pp. 719-732
    • Derigs, U.1    Kaiser, R.2
  • 77
    • 77955501421 scopus 로고    scopus 로고
    • Local search-based metaheuristics for the split delivery vehicle routing problem
    • U. Derigs, B. Li, and U. Vogel Local search-based metaheuristics for the split delivery vehicle routing problem Journal of the Operational Research Society 2009 1356 1364
    • (2009) Journal of the Operational Research Society , pp. 1356-1364
    • Derigs, U.1    Li, B.2    Vogel, U.3
  • 79
    • 0033097826 scopus 로고    scopus 로고
    • Towards a model and algorithm management system for vehicle routing and scheduling problems
    • M. Desrochers, C. Jones, J. Lenstra, M. Savelsbergh, and L. Stougie Towards a model and algorithm management system for vehicle routing and scheduling problems Decision Support Systems 25 2 1999 109 133
    • (1999) Decision Support Systems , vol.25 , Issue.2 , pp. 109-133
    • Desrochers, M.1    Jones, C.2    Lenstra, J.3    Savelsbergh, M.4    Stougie, L.5
  • 81
    • 77957089136 scopus 로고
    • Time constrained routing and scheduling
    • M. Ball, T.L. Magnanti, C. Monma, G. Nemhauser, North-Holland Amsterdam
    • J. Desrosiers, Y. Dumas, M. Solomon, and F. Soumis Time constrained routing and scheduling M. Ball, T.L. Magnanti, C. Monma, G. Nemhauser, Network Routing 1995 North-Holland Amsterdam 35 139
    • (1995) Network Routing , pp. 35-139
    • Desrosiers, J.1    Dumas, Y.2    Solomon, M.3    Soumis, F.4
  • 82
    • 33749347594 scopus 로고    scopus 로고
    • Parallel cooperative savings based ant colony optimization: Multiple search and decomposition approaches
    • K. Doerner, R. Hartl, S. Benkner, and M. Lucka Parallel cooperative savings based ant colony optimization: multiple search and decomposition approaches Parallel Processing Letters 16 3 2006 351
    • (2006) Parallel Processing Letters , vol.16 , Issue.3 , pp. 351
    • Doerner, K.1    Hartl, R.2    Benkner, S.3    Lucka, M.4
  • 83
    • 35048857003 scopus 로고    scopus 로고
    • Parallel ant systems for the capacitated vehicle routing problem
    • J. Gottlieb, G. Raidl, LNCS Springer Berlin, Heidelberg
    • K. Doerner, R. Hartl, G. Kiechle, M. Lucka, and M. Reimann Parallel ant systems for the capacitated vehicle routing problem J. Gottlieb, G. Raidl, Evolutionary Computation in Combinatorial Optimization LNCS vol. 3004 2004 Springer Berlin, Heidelberg 72 83
    • (2004) Evolutionary Computation in Combinatorial Optimization , vol.3004 VOL. , pp. 72-83
    • Doerner, K.1    Hartl, R.2    Kiechle, G.3    Lucka, M.4    Reimann, M.5
  • 84
    • 78349263818 scopus 로고    scopus 로고
    • Survey: Matheuristics for rich vehicle routing problems
    • LNCS Springer Berlin, Heidelberg
    • K. Doerner, and V. Schmid Survey: matheuristics for rich vehicle routing problems Hybrid Metaheuristics LNCS vol. 6373 2010 Springer Berlin, Heidelberg 206 221
    • (2010) Hybrid Metaheuristics , vol.6373 VOL. , pp. 206-221
    • Doerner, K.1    Schmid, V.2
  • 85
    • 84879917658 scopus 로고    scopus 로고
    • Dongarra, J., 2011. Performance of various computers using standard linear equations software. Tech. rep., University of Tennessee.
    • Dongarra, J., 2011. Performance of various computers using standard linear equations software. Tech. rep., University of Tennessee.
  • 87
    • 84857537198 scopus 로고    scopus 로고
    • A grid-based hybrid cellular genetic algorithm for very large scale instances of the CVRP
    • W. Smari, Czech Republic Prague
    • B. Dorronsoro, D. Arias, F. Luna, A. Nebro, and E. Alba A grid-based hybrid cellular genetic algorithm for very large scale instances of the CVRP W. Smari, Proceedings of HPCS'07 2007 Czech Republic Prague 759 765
    • (2007) Proceedings of HPCS'07 , pp. 759-765
    • Dorronsoro, B.1    Arias, D.2    Luna, F.3    Nebro, A.4    Alba, E.5
  • 88
    • 84879931697 scopus 로고    scopus 로고
    • Dréo, J., Pétrowski, A., Siarry, P., Taillard, E., 2003. Métaheuristiques pour l'optimisation difficile. Eyrolles.
    • Dréo, J., Pétrowski, A., Siarry, P., Taillard, E., 2003. Métaheuristiques pour l'optimisation difficile. Eyrolles.
  • 89
    • 84865109540 scopus 로고    scopus 로고
    • Synchronization in vehicle routing - A survey of VRPs with multiple synchronization constraints
    • M. Drexl Synchronization in vehicle routing - a survey of VRPs with multiple synchronization constraints Transportation Science 46 3 2012 297 316
    • (2012) Transportation Science , vol.46 , Issue.3 , pp. 297-316
    • Drexl, M.1
  • 90
    • 0002535331 scopus 로고
    • New optimization heuristics: The great deluge algorithm and the record-to-record travel
    • G. Dueck New optimization heuristics: the great deluge algorithm and the record-to-record travel Journal of Computational Physics 104 1 1993 86 92
    • (1993) Journal of Computational Physics , vol.104 , Issue.1 , pp. 86-92
    • Dueck, G.1
  • 91
    • 77957321273 scopus 로고    scopus 로고
    • A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
    • C. Duhamel, P. Lacomme, A. Quilliot, and H. Toussaint A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem Computers & Operations Research 38 3 2011 617 640
    • (2011) Computers & Operations Research , vol.38 , Issue.3 , pp. 617-640
    • Duhamel, C.1    Lacomme, P.2    Quilliot, A.3    Toussaint, H.4
  • 94
    • 0028508261 scopus 로고
    • A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs
    • M. Fischetti, P. Toth, and D. Vigo A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs Operations Research 42 5 1994 846 859
    • (1994) Operations Research , vol.42 , Issue.5 , pp. 846-859
    • Fischetti, M.1    Toth, P.2    Vigo, D.3
  • 95
    • 0019574134 scopus 로고
    • A generalized assignment heuristic for vehicle routing
    • M. Fisher, and R. Jaikumar A generalized assignment heuristic for vehicle routing Networks 11 2 1981 109 124
    • (1981) Networks , vol.11 , Issue.2 , pp. 109-124
    • Fisher, M.1    Jaikumar, R.2
  • 97
    • 56349100703 scopus 로고    scopus 로고
    • A variable neighbourhood search algorithm for the open vehicle routing problem
    • K. Fleszar, I. Osman, and K. Hindi A variable neighbourhood search algorithm for the open vehicle routing problem European Journal of Operational Research 195 3 2009 803 809
    • (2009) European Journal of Operational Research , vol.195 , Issue.3 , pp. 803-809
    • Fleszar, K.1    Osman, I.2    Hindi, K.3
  • 99
    • 53749107567 scopus 로고    scopus 로고
    • Ant colony optimization for the two-dimensional loading vehicle routing problem
    • G. Fuellerer, K. Doerner, R. Hartl, and M. Iori Ant colony optimization for the two-dimensional loading vehicle routing problem Computers & Operations Research 36 3 2009 655 673
    • (2009) Computers & Operations Research , vol.36 , Issue.3 , pp. 655-673
    • Fuellerer, G.1    Doerner, K.2    Hartl, R.3    Iori, M.4
  • 101
    • 24344437669 scopus 로고    scopus 로고
    • Local search for vehicle routing and scheduling problems: Review and conceptual integration
    • B. Funke, T. Grünert, and S. Irnich Local search for vehicle routing and scheduling problems: review and conceptual integration Journal of Heuristics 11 4 2005 267 306
    • (2005) Journal of Heuristics , vol.11 , Issue.4 , pp. 267-306
    • Funke, B.1    Grünert, T.2    Irnich, S.3
  • 102
    • 56549130581 scopus 로고    scopus 로고
    • Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
    • Y. Gajpal, and P. Abad Multi-ant colony system (MACS) for a vehicle routing problem with backhauls European Journal of Operational Research 196 1 2009 102 117
    • (2009) European Journal of Operational Research , vol.196 , Issue.1 , pp. 102-117
    • Gajpal, Y.1    Abad, P.2
  • 103
    • 0001765830 scopus 로고
    • Bases for vehicle fleet scheduling
    • T. Gaskell Bases for vehicle fleet scheduling Operational Research Quarterly 18 3 1967 281 295
    • (1967) Operational Research Quarterly , vol.18 , Issue.3 , pp. 281-295
    • Gaskell, T.1
  • 104
    • 84879960984 scopus 로고    scopus 로고
    • Gehring, H., Homberger, J., 1999. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Proceedings of EURO-GEN'99, pp. 57-64.
    • Gehring, H., Homberger, J., 1999. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Proceedings of EURO-GEN'99, pp. 57-64.
  • 105
    • 0000866856 scopus 로고
    • New insertion and postoptimization procedures for the traveling salesman problem
    • M. Gendreau, A. Hertz, and G. Laporte New insertion and postoptimization procedures for the traveling salesman problem Operations Research 40 6 1992 1086 1094
    • (1992) Operations Research , vol.40 , Issue.6 , pp. 1086-1094
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 106
    • 0028530194 scopus 로고
    • A tabu search heuristic for the vehicle routing problem
    • M. Gendreau, A. Hertz, and G. Laporte A tabu search heuristic for the vehicle routing problem Management Science 40 10 1994 1276 1290
    • (1994) Management Science , vol.40 , Issue.10 , pp. 1276-1290
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 107
    • 33746588314 scopus 로고    scopus 로고
    • A tabu search algorithm for a routing and container loading problem
    • M. Gendreau, M. Iori, G. Laporte, and S. Martello A tabu search algorithm for a routing and container loading problem Transportation Science 40 3 2006 342 350
    • (2006) Transportation Science , vol.40 , Issue.3 , pp. 342-350
    • Gendreau, M.1    Iori, M.2    Laporte, G.3    Martello, S.4
  • 108
    • 38149064537 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
    • M. Gendreau, M. Iori, G. Laporte, and S. Martello A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints Networks 51 1 2008 4 18
    • (2008) Networks , vol.51 , Issue.1 , pp. 4-18
    • Gendreau, M.1    Iori, M.2    Laporte, G.3    Martello, S.4
  • 111
    • 28244470744 scopus 로고    scopus 로고
    • Metaheuristics in combinatorial optimization
    • M. Gendreau, and J.-Y. Potvin Metaheuristics in combinatorial optimization Annals of Operations Research 140 1 2005 189 213
    • (2005) Annals of Operations Research , vol.140 , Issue.1 , pp. 189-213
    • Gendreau, M.1    Potvin, J.-Y.2
  • 113
    • 84879973431 scopus 로고    scopus 로고
    • Gendreau, M., Tarantilis, C., 2010. Solving large-scale vehicle routing problems with time windows: the state-of-the-art. Tech. rep., CIRRELT.
    • Gendreau, M., Tarantilis, C., 2010. Solving large-scale vehicle routing problems with time windows: the state-of-the-art. Tech. rep., CIRRELT.
  • 114
    • 0003127851 scopus 로고    scopus 로고
    • Supervision in the self-organizing feature map: Application to the vehicle routing problem
    • I. Osman, J. Kelly, Kluwer Boston
    • H. Ghaziri Supervision in the self-organizing feature map: application to the vehicle routing problem I. Osman, J. Kelly, Meta-heuristics: Theory & Applications 1996 Kluwer Boston 651 660
    • (1996) Meta-heuristics: Theory & Applications , pp. 651-660
    • Ghaziri, H.1
  • 115
    • 0001535867 scopus 로고
    • A heuristic algorithm for the vehicle-dispatch problem
    • B. Gillett, and L. Miller A heuristic algorithm for the vehicle-dispatch problem Operations Research 22 2 1974 340 349
    • (1974) Operations Research , vol.22 , Issue.2 , pp. 340-349
    • Gillett, B.1    Miller, L.2
  • 116
    • 84989487658 scopus 로고
    • Heuristics for integer programming using surrogate constraints
    • F. Glover Heuristics for integer programming using surrogate constraints Decision Sciences 8 1977 156 166
    • (1977) Decision Sciences , vol.8 , pp. 156-166
    • Glover, F.1
  • 117
    • 0022865373 scopus 로고
    • Future paths for integer programming and links to artificial intelligence
    • F. Glover Future paths for integer programming and links to artificial intelligence Computers & Operations Research 13 5 1986 533 549
    • (1986) Computers & Operations Research , vol.13 , Issue.5 , pp. 533-549
    • Glover, F.1
  • 118
  • 120
    • 0042765768 scopus 로고
    • New ejection chain and alternating path methods for traveling salesman problems
    • O. Balci, R. Sharda, S. Zenios, Pergamon Press
    • F. Glover New ejection chain and alternating path methods for traveling salesman problems O. Balci, R. Sharda, S. Zenios, Computer Science and Operations Research: New Developments in Their Interfaces 1992 Pergamon Press 449 509
    • (1992) Computer Science and Operations Research: New Developments in Their Interfaces , pp. 449-509
    • Glover, F.1
  • 121
    • 0000204030 scopus 로고    scopus 로고
    • Ejection chains, reference structures and alternating path methods for traveling salesman problems
    • F. Glover Ejection chains, reference structures and alternating path methods for traveling salesman problems Discrete Applied Mathematics 65 1-3 1996 223 253
    • (1996) Discrete Applied Mathematics , vol.65 , Issue.13 , pp. 223-253
    • Glover, F.1
  • 122
  • 124
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers Boston, MA
    • F. Glover, and M. Laguna Tabu Search 1998 Kluwer Academic Publishers Boston, MA
    • (1998) Tabu Search
    • Glover, F.1    Laguna, M.2
  • 125
    • 70450099996 scopus 로고    scopus 로고
    • Vehicle scheduling and routing with drivers' working hours
    • A. Goel Vehicle scheduling and routing with drivers' working hours Transportation Science 43 1 2009 17 26
    • (2009) Transportation Science , vol.43 , Issue.1 , pp. 17-26
    • Goel, A.1
  • 126
    • 78649777354 scopus 로고    scopus 로고
    • Truck driver scheduling in the European Union
    • A. Goel Truck driver scheduling in the European Union Transportation Science 44 4 2010 429 441
    • (2010) Transportation Science , vol.44 , Issue.4 , pp. 429-441
    • Goel, A.1
  • 127
    • 84866421228 scopus 로고    scopus 로고
    • Goel, A., Kok, L., 2012. Truck driver scheduling in the United States. Transportation Science 46 (3), 317-326.
    • Goel, A., Kok, L., 2012. Truck driver scheduling in the United States. Transportation Science 46 (3), 317-326.
  • 128
    • 84879960877 scopus 로고    scopus 로고
    • Goel, A., Vidal, T., 2012. Hours of service regulations in road freight transport: an optimization-based international assessment. Tech. rep., CIRRELT.
    • Goel, A., Vidal, T., 2012. Hours of service regulations in road freight transport: an optimization-based international assessment. Tech. rep., CIRRELT.
  • 132
    • 0001799407 scopus 로고    scopus 로고
    • The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results
    • T. Crainic, G. Laporte, Kluwer Academic Publishers Boston, MA
    • B. Golden, E. Wasil, J. Kelly, and I. Chao The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results T. Crainic, G. Laporte, Fleet Management and Logistics 1998 Kluwer Academic Publishers Boston, MA 33 56
    • (1998) Fleet Management and Logistics , pp. 33-56
    • Golden, B.1    Wasil, E.2    Kelly, J.3    Chao, I.4
  • 133
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • R. Graham, E. Lawler, J. Lenstra, and A. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 1979 287 326
    • (1979) Annals of Discrete Mathematics , vol.5 , pp. 287-326
    • Graham, R.1    Lawler, E.2    Lenstra, J.3    Rinnooy Kan, A.4
  • 135
    • 79955785654 scopus 로고    scopus 로고
    • A parallel algorithm for the vehicle routing problem
    • C. Groër, B. Golden, and E. Wasil A parallel algorithm for the vehicle routing problem INFORMS Journal on Computing 23 2 2011 315 330
    • (2011) INFORMS Journal on Computing , vol.23 , Issue.2 , pp. 315-330
    • Groër, C.1    Golden, B.2    Wasil, E.3
  • 136
    • 84879943093 scopus 로고    scopus 로고
    • Gulczynski, D., Golden, B., Wasil, E., 2008. Recent developments in modeling and solving the split delivery vehicle routing problem. In: Chen, Z., Raghavan, S. (Eds.), Tutorials in Operations Research. INFORMS, Hanover, MD, pp. 170-180.
    • Gulczynski, D., Golden, B., Wasil, E., 2008. Recent developments in modeling and solving the split delivery vehicle routing problem. In: Chen, Z., Raghavan, S. (Eds.), Tutorials in Operations Research. INFORMS, Hanover, MD, pp. 170-180.
  • 139
    • 33747820517 scopus 로고    scopus 로고
    • The vehicle routing problem with flexible time windows and traveling times
    • H. Hashimoto, T. Ibaraki, S. Imahori, and M. Yagiura The vehicle routing problem with flexible time windows and traveling times Discrete Applied Mathematics 154 16 2006 2271 2290
    • (2006) Discrete Applied Mathematics , vol.154 , Issue.16 , pp. 2271-2290
    • Hashimoto, H.1    Ibaraki, T.2    Imahori, S.3    Yagiura, M.4
  • 140
    • 47249124516 scopus 로고    scopus 로고
    • A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows
    • J. Hemert, C. Cotta, LNCS Springer Berlin, Heidelberg
    • H. Hashimoto, and M. Yagiura A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows J. Hemert, C. Cotta, Evolutionary Computation in Combinatorial Optimization LNCS vol. 4972 2008 Springer Berlin, Heidelberg 254 265
    • (2008) Evolutionary Computation in Combinatorial Optimization , vol.4972 VOL. , pp. 254-265
    • Hashimoto, H.1    Yagiura, M.2
  • 141
    • 41149179705 scopus 로고    scopus 로고
    • An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
    • H. Hashimoto, M. Yagiura, and T. Ibaraki An iterated local search algorithm for the time-dependent vehicle routing problem with time windows Discrete Optimization 5 2 2008 434 456
    • (2008) Discrete Optimization , vol.5 , Issue.2 , pp. 434-456
    • Hashimoto, H.1    Yagiura, M.2    Ibaraki, T.3
  • 142
    • 77957319638 scopus 로고    scopus 로고
    • Recent progress of local search in handling the time window constraints of the vehicle routing problem
    • H. Hashimoto, M. Yagiura, S. Imahori, and T. Ibaraki Recent progress of local search in handling the time window constraints of the vehicle routing problem 4OR 8 3 2010 221 238
    • (2010) 4OR , vol.8 , Issue.3 , pp. 221-238
    • Hashimoto, H.1    Yagiura, M.2    Imahori, S.3    Ibaraki, T.4
  • 143
    • 84862988333 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for Two-Echelon vehicle routing problems arising in city logistics
    • V. Hemmelmayr, J.-F. Cordeau, and T. Crainic An adaptive large neighborhood search heuristic for Two-Echelon vehicle routing problems arising in city logistics Computers & Operations Research 39 12 2012 3215 3228
    • (2012) Computers & Operations Research , vol.39 , Issue.12 , pp. 3215-3228
    • Hemmelmayr, V.1    Cordeau, J.-F.2    Crainic, T.3
  • 144
  • 145
    • 32644441804 scopus 로고    scopus 로고
    • Path relinking for the vehicle routing problem
    • S. Ho, and M. Gendreau Path relinking for the vehicle routing problem Journal of Heuristics 12 1-2 2006 55 72
    • (2006) Journal of Heuristics , vol.12 , Issue.12 , pp. 55-72
    • Ho, S.1    Gendreau, M.2
  • 146
    • 0003463297 scopus 로고
    • An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence The University of Michigan Press Ann Arbor
    • J. Holland Adaptation in Natural and Artificial Systems An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence 1975 The University of Michigan Press Ann Arbor
    • (1975) Adaptation in Natural and Artificial Systems
    • Holland, J.1
  • 147
    • 19944391610 scopus 로고    scopus 로고
    • Effective local search algorithms for routing and scheduling problems with general time-window constraints
    • T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, and M. Yagiura Effective local search algorithms for routing and scheduling problems with general time-window constraints Transportation Science 39 2 2005 206 232
    • (2005) Transportation Science , vol.39 , Issue.2 , pp. 206-232
    • Ibaraki, T.1    Imahori, S.2    Kubo, M.3    Masuda, T.4    Uno, T.5    Yagiura, M.6
  • 148
    • 47549094649 scopus 로고    scopus 로고
    • An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
    • T. Ibaraki, S. Imahori, K. Nonobe, K. Sobue, T. Uno, and M. Yagiura An iterated local search algorithm for the vehicle routing problem with convex time penalty functions Discrete Applied Mathematics 156 11 2008 2050 2069
    • (2008) Discrete Applied Mathematics , vol.156 , Issue.11 , pp. 2050-2069
    • Ibaraki, T.1    Imahori, S.2    Nonobe, K.3    Sobue, K.4    Uno, T.5    Yagiura, M.6
  • 150
    • 77956965595 scopus 로고    scopus 로고
    • Routing problems with loading constraints
    • M. Iori, and S. Martello Routing problems with loading constraints Top 18 1 2010 4 27
    • (2010) Top , vol.18 , Issue.1 , pp. 4-27
    • Iori, M.1    Martello, S.2
  • 151
    • 29144447717 scopus 로고    scopus 로고
    • Sequential search and its application to vehicle-routing problems
    • S. Irnich, B. Funke, and T. Grünert Sequential search and its application to vehicle-routing problems Computers & Operations Research 33 8 2006 2405 2429
    • (2006) Computers & Operations Research , vol.33 , Issue.8 , pp. 2405-2429
    • Irnich, S.1    Funke, B.2    Grünert, T.3
  • 152
    • 61449183550 scopus 로고    scopus 로고
    • Subset-row inequalities applied to the vehicle-routing problem with time windows
    • M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger Subset-row inequalities applied to the vehicle-routing problem with time windows Operations Research 56 2 2008 497 511
    • (2008) Operations Research , vol.56 , Issue.2 , pp. 497-511
    • Jepsen, M.1    Petersen, B.2    Spoorendonk, S.3    Pisinger, D.4
  • 153
    • 84879944357 scopus 로고    scopus 로고
    • Jin, J., Crainic, T., Lokketangen, A., 2011. A guided cooperative parallel tabu search for the capacitated vehicle routing problem. In: Proceedings of NIK'11. pp. 49-60.
    • Jin, J., Crainic, T., Lokketangen, A., 2011. A guided cooperative parallel tabu search for the capacitated vehicle routing problem. In: Proceedings of NIK'11. pp. 49-60.
  • 154
    • 84863986931 scopus 로고    scopus 로고
    • A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problem
    • J. Jin, T. Crainic, and A. Lokketangen A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problem European Journal of Operational Research 222 3 2012 441 451
    • (2012) European Journal of Operational Research , vol.222 , Issue.3 , pp. 441-451
    • Jin, J.1    Crainic, T.2    Lokketangen, A.3
  • 155
    • 0001193147 scopus 로고    scopus 로고
    • The traveling salesman problem: A case study in local optimization
    • E. Aarts, J. Lenstra, Princeton Univ Pr
    • D. Johnson, and L. McGeoch The traveling salesman problem: a case study in local optimization E. Aarts, J. Lenstra, Local Search in Combinatorial Optimization 1997 Princeton Univ Pr 215 310
    • (1997) Local Search in Combinatorial Optimization , pp. 215-310
    • Johnson, D.1    McGeoch, L.2
  • 156
    • 0003155122 scopus 로고
    • Fitness distance correlation as a measure of problem difficulty for genetic algorithms
    • Morgan Kaufmann San Francisco, CA, USA
    • T. Jones Fitness distance correlation as a measure of problem difficulty for genetic algorithms Proceedings ICGA'95 1995 Morgan Kaufmann San Francisco, CA, USA 184 192
    • (1995) Proceedings ICGA'95 , pp. 184-192
    • Jones, T.1
  • 157
    • 26444602999 scopus 로고    scopus 로고
    • Lagrangian duality applied to the vehicle routing problem with time windows
    • B. Kallehauge, J. Larsen, and O. Madsen Lagrangian duality applied to the vehicle routing problem with time windows Computers & Operations Research 33 5 2006 1464 1487
    • (2006) Computers & Operations Research , vol.33 , Issue.5 , pp. 1464-1487
    • Kallehauge, B.1    Larsen, J.2    Madsen, O.3
  • 161
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, C. Gelatt, and M. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 680
    • (1983) Science , vol.220 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.2    Vecchi, M.3
  • 162
    • 84879990717 scopus 로고    scopus 로고
    • Kovacs, A., Parragh, S., Hartl, R., 2012. A template based adaptive large neighborhood search for the consistent vehicle routing problem.
    • Kovacs, A., Parragh, S., Hartl, R., 2012. A template based adaptive large neighborhood search for the consistent vehicle routing problem.
  • 163
    • 84888615368 scopus 로고    scopus 로고
    • Distance measures and fitness-distance analysis for the capacitated vehicle routing problem
    • Springer New York
    • M. Kubiak Distance measures and fitness-distance analysis for the capacitated vehicle routing problem Metaheuristics: Progress in Complex Systems Optimization vol. 39 2007 Springer New York 345 364
    • (2007) Metaheuristics: Progress in Complex Systems Optimization , vol.39 VOL. , pp. 345-364
    • Kubiak, M.1
  • 164
    • 33846581449 scopus 로고    scopus 로고
    • An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
    • J. Kytöjoki, T. Nuortio, O. Bräysy, and M. Gendreau An efficient variable neighborhood search heuristic for very large scale vehicle routing problems Computers & Operations Research 34 9 2007 2743 2757
    • (2007) Computers & Operations Research , vol.34 , Issue.9 , pp. 2743-2757
    • Kytöjoki, J.1    Nuortio, T.2    Bräysy, O.3    Gendreau, M.4
  • 165
    • 84879959898 scopus 로고    scopus 로고
    • Lahrichi, N., Crainic, T., Gendreau, M., Rei, W., Crisan, G., Vidal, T., 2012. An Integrative Cooperative Search Framework for Multi-Decision-Attribute Combinatorial Optimization. Tech. rep., CIRRELT.
    • Lahrichi, N., Crainic, T., Gendreau, M., Rei, W., Crisan, G., Vidal, T., 2012. An Integrative Cooperative Search Framework for Multi-Decision-Attribute Combinatorial Optimization. Tech. rep., CIRRELT.
  • 166
    • 73349128424 scopus 로고    scopus 로고
    • Fifty years of vehicle routing
    • G. Laporte Fifty years of vehicle routing Transportation Science 43 4 2009 408 416
    • (2009) Transportation Science , vol.43 , Issue.4 , pp. 408-416
    • Laporte, G.1
  • 170
    • 9744241693 scopus 로고    scopus 로고
    • A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
    • A. Le Bouthillier, and T. Crainic A cooperative parallel meta-heuristic for the vehicle routing problem with time windows Computers & Operations Research 32 7 2005 1685 1708
    • (2005) Computers & Operations Research , vol.32 , Issue.7 , pp. 1685-1708
    • Le Bouthillier, A.1    Crainic, T.2
  • 171
    • 24644439324 scopus 로고    scopus 로고
    • A guided cooperative search for the vehicle routing problem with time windows
    • A. Le Bouthillier, and T. Crainic A guided cooperative search for the vehicle routing problem with time windows Intelligent Systems, IEEE 20 4 2005 36 42
    • (2005) Intelligent Systems, IEEE , vol.20 , Issue.4 , pp. 36-42
    • Le Bouthillier, A.1    Crainic, T.2
  • 173
    • 36248969139 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the capacitated open vehicle routing problem
    • A. Letchford, J. Lysgaard, and R. Eglese A branch-and-cut algorithm for the capacitated open vehicle routing problem Journal of the Operational Research Society 58 12 2006 1642 1651
    • (2006) Journal of the Operational Research Society , vol.58 , Issue.12 , pp. 1642-1651
    • Letchford, A.1    Lysgaard, J.2    Eglese, R.3
  • 174
    • 7544224084 scopus 로고    scopus 로고
    • Very large-scale vehicle routing: New test problems, algorithms, and results
    • F. Li, B. Golden, and E. Wasil Very large-scale vehicle routing: new test problems, algorithms, and results Computers & Operations Research 32 5 2005 1165 1179
    • (2005) Computers & Operations Research , vol.32 , Issue.5 , pp. 1165-1179
    • Li, F.1    Golden, B.2    Wasil, E.3
  • 175
    • 33846580155 scopus 로고    scopus 로고
    • A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
    • F. Li, B. Golden, and E. Wasil A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem Computers & Operations Research 34 9 2007 2734 2742
    • (2007) Computers & Operations Research , vol.34 , Issue.9 , pp. 2734-2742
    • Li, F.1    Golden, B.2    Wasil, E.3
  • 176
    • 33847667936 scopus 로고    scopus 로고
    • The open vehicle routing problem: Algorithms, large-scale test problems, and computational results
    • F. Li, B. Golden, and E. Wasil The open vehicle routing problem: Algorithms, large-scale test problems, and computational results Computers & Operations Research 34 10 2007 2918 2930
    • (2007) Computers & Operations Research , vol.34 , Issue.10 , pp. 2918-2930
    • Li, F.1    Golden, B.2    Wasil, E.3
  • 177
    • 0035557368 scopus 로고    scopus 로고
    • A metaheuristic for the pickup and delivery problem with time windows
    • IEEE Comput. Society
    • H. Li, and A. Lim A metaheuristic for the pickup and delivery problem with time windows Proceedings of ICTAI'01 2001 IEEE Comput. Society 160 167
    • (2001) Proceedings of ICTAI'01 , pp. 160-167
    • Li, H.1    Lim, A.2
  • 178
    • 84908780328 scopus 로고
    • Computer solutions of the traveling salesman problem
    • S. Lin Computer solutions of the traveling salesman problem Bell System Technical Journal 44 10 1965 2245 2269
    • (1965) Bell System Technical Journal , vol.44 , Issue.10 , pp. 2245-2269
    • Lin, S.1
  • 179
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling-salesman problem
    • S. Lin, and B. Kernighan An effective heuristic algorithm for the traveling-salesman problem Operations Research 21 2 1973 498 516
    • (1973) Operations Research , vol.21 , Issue.2 , pp. 498-516
    • Lin, S.1    Kernighan, B.2
  • 180
    • 80555126361 scopus 로고    scopus 로고
    • Iterated local search: Framework and applications
    • M. Gendreau, J.-Y. Potvin, Springer Boston, MA
    • H. Lourenço, O. Martin, and T. Stützle Iterated local search: framework and applications M. Gendreau, J.-Y. Potvin, Handbook of Metaheuristics 2010 Springer Boston, MA 363 397
    • (2010) Handbook of Metaheuristics , pp. 363-397
    • Lourenço, H.1    Martin, O.2    Stützle, T.3
  • 181
    • 0026904591 scopus 로고
    • Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms
    • C. Malandraki, and M. Daskin Time dependent vehicle routing problems: formulations, properties and heuristic algorithms Transportation Science 26 3 1992 185 200
    • (1992) Transportation Science , vol.26 , Issue.3 , pp. 185-200
    • Malandraki, C.1    Daskin, M.2
  • 182
    • 71749086093 scopus 로고    scopus 로고
    • A hybrid genetic - Particle swarm optimization algorithm for the vehicle routing problem
    • Y. Marinakis, and M. Marinaki A hybrid genetic - particle swarm optimization algorithm for the vehicle routing problem Expert Systems with Applications 37 2 2010 1446 1455
    • (2010) Expert Systems with Applications , vol.37 , Issue.2 , pp. 1446-1455
    • Marinakis, Y.1    Marinaki, M.2
  • 183
    • 84879970879 scopus 로고    scopus 로고
    • Bumble bees mating optimization algorithm for the vehicle routing problem
    • Springer Berlin, Heidelberg
    • Y. Marinakis, and M. Marinaki Bumble bees mating optimization algorithm for the vehicle routing problem Handbook of Swarm Intelligence 2011 Springer Berlin, Heidelberg 347 369
    • (2011) Handbook of Swarm Intelligence , pp. 347-369
    • Marinakis, Y.1    Marinaki, M.2
  • 185
    • 34250896800 scopus 로고    scopus 로고
    • A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
    • Y. Marinakis, A. Migdalas, and P. Pardalos A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm Journal of Global Optimization 38 4 2006 555 580
    • (2006) Journal of Global Optimization , vol.38 , Issue.4 , pp. 555-580
    • Marinakis, Y.1    Migdalas, A.2    Pardalos, P.3
  • 186
    • 51049083420 scopus 로고    scopus 로고
    • A neuro-immune algorithm to solve the capacitated vehicle routing problem
    • LNCS Springer Berlin, Heidelberg
    • T. Masutti A neuro-immune algorithm to solve the capacitated vehicle routing problem Artificial Immune Systems LNCS vol. 5132 2008 Springer Berlin, Heidelberg 210 219
    • (2008) Artificial Immune Systems , vol.5132 VOL. , pp. 210-219
    • Masutti, T.1
  • 187
    • 33847671359 scopus 로고    scopus 로고
    • Active-guided evolution strategies for large-scale capacitated vehicle routing problems
    • D. Mester, and O. Bräysy Active-guided evolution strategies for large-scale capacitated vehicle routing problems Computers & Operations Research 34 10 2007 2964 2975
    • (2007) Computers & Operations Research , vol.34 , Issue.10 , pp. 2964-2975
    • Mester, D.1    Bräysy, O.2
  • 188
    • 0033338780 scopus 로고    scopus 로고
    • An exact method for the vehicle routing problem with backhauls
    • A. Mingozzi, S. Giorgi, and R. Baldacci An exact method for the vehicle routing problem with backhauls Transportation Science 33 3 1999 315 329
    • (1999) Transportation Science , vol.33 , Issue.3 , pp. 315-329
    • Mingozzi, A.1    Giorgi, S.2    Baldacci, R.3
  • 189
    • 84877989560 scopus 로고    scopus 로고
    • Mingozzi, A., Roberti, R., Toth, P., 2012. An exact algorithm for the multi-trip vehicle routing problem. INFORMS Journal on Computing.
    • Mingozzi, A., Roberti, R., Toth, P., 2012. An exact algorithm for the multi-trip vehicle routing problem. INFORMS Journal on Computing. http://dx.doi.org/10.1287/ijoc.1110.0495.
  • 191
    • 0017151741 scopus 로고
    • A sequential route-building algorithm employing a generalised savings criterion
    • R. Mole, and S. Jameson A sequential route-building algorithm employing a generalised savings criterion Operational Research Quarterly 27 2 1976 503 511
    • (1976) Operational Research Quarterly , vol.27 , Issue.2 , pp. 503-511
    • Mole, R.1    Jameson, S.2
  • 192
    • 84879894835 scopus 로고    scopus 로고
    • Moscato, P., 1989. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Tech. rep., California Institute of Technology, Pasadena, California, USA.
    • Moscato, P., 1989. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Tech. rep., California Institute of Technology, Pasadena, California, USA.
  • 193
    • 79957891485 scopus 로고    scopus 로고
    • A modern introduction to memetic algorithms
    • M. Gendreau, J.-Y. Potvin, Springer Boston, MA
    • P. Moscato, and C. Cotta A modern introduction to memetic algorithms M. Gendreau, J.-Y. Potvin, Handbook of Metaheuristics vol. 146 2010 Springer Boston, MA 141 183
    • (2010) Handbook of Metaheuristics , vol.146 VOL. , pp. 141-183
    • Moscato, P.1    Cotta, C.2
  • 194
    • 38049014434 scopus 로고    scopus 로고
    • A new metaheuristic for the vehicle routing problem with split demands
    • LNCS Springer Berlin, Heidelberg
    • E. Mota, V. Campos, and A. Corberán A new metaheuristic for the vehicle routing problem with split demands Evolutionary Computation in Combinatorial Optimization LNCS vol. 4446 2007 Springer Berlin, Heidelberg 121 129
    • (2007) Evolutionary Computation in Combinatorial Optimization , vol.4446 VOL. , pp. 121-129
    • Mota, E.1    Campos, V.2    Corberán, A.3
  • 196
    • 47249126846 scopus 로고    scopus 로고
    • Efficient local search limitation strategies for vehicle routing problems
    • J. Hemert, C. Cotta, LNCS Springer Berlin, Heidelberg
    • Y. Nagata, and O. Bräysy Efficient local search limitation strategies for vehicle routing problems J. Hemert, C. Cotta, Evolutionary Computation in Combinatorial Optimization LNCS vol. 4972 2008 Springer Berlin, Heidelberg 48 60
    • (2008) Evolutionary Computation in Combinatorial Optimization , vol.4972 VOL. , pp. 48-60
    • Nagata, Y.1    Bräysy, O.2
  • 197
    • 71949088204 scopus 로고    scopus 로고
    • Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
    • Y. Nagata, and O. Bräysy Edge assembly-based memetic algorithm for the capacitated vehicle routing problem Networks 54 4 2009 205 215
    • (2009) Networks , vol.54 , Issue.4 , pp. 205-215
    • Nagata, Y.1    Bräysy, O.2
  • 198
    • 70350565396 scopus 로고    scopus 로고
    • A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
    • Y. Nagata, O. Bräysy, and W. Dullaert A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows Computers & Operations Research 37 4 2010 724 737
    • (2010) Computers & Operations Research , vol.37 , Issue.4 , pp. 724-737
    • Nagata, Y.1    Bräysy, O.2    Dullaert, W.3
  • 199
    • 78149231627 scopus 로고    scopus 로고
    • A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover
    • LNCS Springer Berlin, Heidelberg
    • Y. Nagata, and S. Kobayashi A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover Proceedings of PPSN'11 LNCS vol. 6238 2011 Springer Berlin, Heidelberg 536 545
    • (2011) Proceedings of PPSN'11 , vol.6238 VOL. , pp. 536-545
    • Nagata, Y.1    Kobayashi, S.2
  • 201
    • 68449094470 scopus 로고    scopus 로고
    • Efficient relevance estimation and value calibration of evolutionary algorithm parameters
    • IEEE
    • V. Nannen, and A. Eiben Efficient relevance estimation and value calibration of evolutionary algorithm parameters Proceedings of CEC'07 2007 IEEE 103 110
    • (2007) Proceedings of CEC'07 , pp. 103-110
    • Nannen, V.1    Eiben, A.2
  • 203
    • 77951101612 scopus 로고    scopus 로고
    • An effective memetic algorithm for the cumulative capacitated vehicle routing problem
    • S. Ngueveu, C. Prins, and R. Wolfler Calvo An effective memetic algorithm for the cumulative capacitated vehicle routing problem Computers & Operations Research 37 11 2010 1877 1885
    • (2010) Computers & Operations Research , vol.37 , Issue.11 , pp. 1877-1885
    • Ngueveu, S.1    Prins, C.2    Wolfler Calvo, R.3
  • 204
    • 33746267205 scopus 로고    scopus 로고
    • Adaptive memory programming for the vehicle routing problem with multiple trips
    • A. Olivera, and O. Viera Adaptive memory programming for the vehicle routing problem with multiple trips Computers & Operations Research 34 1 2007 28 47
    • (2007) Computers & Operations Research , vol.34 , Issue.1 , pp. 28-47
    • Olivera, A.1    Viera, O.2
  • 206
    • 84879944301 scopus 로고    scopus 로고
    • Or, I., 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Northwestern University, Evanston, IL.
    • Or, I., 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Northwestern University, Evanston, IL.
  • 207
    • 21144460138 scopus 로고
    • Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
    • I. Osman Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem Annals of Operations Research 41 1-4 1993 421 451
    • (1993) Annals of Operations Research , vol.41 , Issue.14 , pp. 421-451
    • Osman, I.1
  • 209
    • 84879951570 scopus 로고    scopus 로고
    • Ostertag, A., 2008. Decomposition strategies for large scale multi depot vehicle routing problems. Ph.D. thesis, Universität Wien.
    • Ostertag, A., 2008. Decomposition strategies for large scale multi depot vehicle routing problems. Ph.D. thesis, Universität Wien.
  • 210
    • 41349095406 scopus 로고    scopus 로고
    • A survey on pickup and delivery problems. Part I: Transportation between customers and depot
    • S. Parragh, K. Doerner, and R. Hartl A survey on pickup and delivery problems. Part I: Transportation between customers and depot Journal für Betriebswirtschaft 58 1 2008 21 51
    • (2008) Journal für Betriebswirtschaft , vol.58 , Issue.1 , pp. 21-51
    • Parragh, S.1    Doerner, K.2    Hartl, R.3
  • 211
    • 44349186058 scopus 로고    scopus 로고
    • A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations
    • S. Parragh, K. Doerner, and R. Hartl A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations Journal für Betriebswirtschaft 58 2 2008 81 117
    • (2008) Journal für Betriebswirtschaft , vol.58 , Issue.2 , pp. 81-117
    • Parragh, S.1    Doerner, K.2    Hartl, R.3
  • 212
    • 71749088943 scopus 로고    scopus 로고
    • Variable neighborhood search for the dial-a-ride problem
    • S. Parragh, K. Doerner, and R. Hartl Variable neighborhood search for the dial-a-ride problem Computers & Operations Research 37 6 2010 1129 1138
    • (2010) Computers & Operations Research , vol.37 , Issue.6 , pp. 1129-1138
    • Parragh, S.1    Doerner, K.2    Hartl, R.3
  • 213
    • 84896392766 scopus 로고    scopus 로고
    • Penna, P.H.V., Subramanian, A., Ochi, L.S., 2011. An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem. Journal of Heuristics.
    • Penna, P.H.V., Subramanian, A., Ochi, L.S., 2011. An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem. Journal of Heuristics. http://dx.doi.org/10.1007/s10732-011-9186-y.
  • 215
    • 84888596674 scopus 로고    scopus 로고
    • Robust branch-cut-and-price algorithms for vehicle routing problems
    • B. Golden, S. Raghavan, E. Wasil, Springer Boston, MA
    • A. Pessoa, M. de Aragão, and E. Uchoa Robust branch-cut-and-price algorithms for vehicle routing problems B. Golden, S. Raghavan, E. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges 2008 Springer Boston, MA 297 325
    • (2008) The Vehicle Routing Problem: Latest Advances and New Challenges , pp. 297-325
    • Pessoa, A.1    De Aragão, M.2    Uchoa, E.3
  • 216
    • 33846068585 scopus 로고    scopus 로고
    • A general heuristic for vehicle routing problems
    • D. Pisinger, and S. Ropke A general heuristic for vehicle routing problems Computers & Operations Research 34 8 2007 2403 2435
    • (2007) Computers & Operations Research , vol.34 , Issue.8 , pp. 2403-2435
    • Pisinger, D.1    Ropke, S.2
  • 217
    • 80555141577 scopus 로고    scopus 로고
    • Large neighborhood search
    • M. Gendreau, J.-Y. Potvin, Springer Boston, MA
    • D. Pisinger, and S. Ropke Large neighborhood search M. Gendreau, J.-Y. Potvin, Handbook of Metaheuristics 2010 Springer Boston, MA 399 419
    • (2010) Handbook of Metaheuristics , pp. 399-419
    • Pisinger, D.1    Ropke, S.2
  • 218
    • 70449597677 scopus 로고    scopus 로고
    • State-of-the art review: Evolutionary algorithms for vehicle routing
    • J.-Y. Potvin State-of-the art review: evolutionary algorithms for vehicle routing INFORMS Journal on Computing 21 4 2009 518 548
    • (2009) INFORMS Journal on Computing , vol.21 , Issue.4 , pp. 518-548
    • Potvin, J.-Y.1
  • 221
    • 71649099891 scopus 로고    scopus 로고
    • A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
    • E. Prescott-Gagnon, G. Desaulniers, and L. Rousseau A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows Networks 54 4 2009 190 204
    • (2009) Networks , vol.54 , Issue.4 , pp. 190-204
    • Prescott-Gagnon, E.1    Desaulniers, G.2    Rousseau, L.3
  • 222
    • 2642522782 scopus 로고    scopus 로고
    • A simple and effective evolutionary algorithm for the vehicle routing problem
    • C. Prins A simple and effective evolutionary algorithm for the vehicle routing problem Computers & Operations Research 31 12 2004 1985 2002
    • (2004) Computers & Operations Research , vol.31 , Issue.12 , pp. 1985-2002
    • Prins, C.1
  • 223
    • 51849120602 scopus 로고    scopus 로고
    • A GRASP - Evolutionary local search hybrid for the vehicle routing problem
    • F. Pereira, J. Tavares, Springer Berlin, Heidelberg
    • C. Prins A GRASP - evolutionary local search hybrid for the vehicle routing problem F. Pereira, J. Tavares, Bio-Inspired Algorithms for the Vehicle Routing Problem 2009 Springer Berlin, Heidelberg 35 53
    • (2009) Bio-Inspired Algorithms for the Vehicle Routing Problem , pp. 35-53
    • Prins, C.1
  • 224
    • 70449522378 scopus 로고    scopus 로고
    • Two memetic algorithms for heterogeneous fleet vehicle routing problems
    • C. Prins Two memetic algorithms for heterogeneous fleet vehicle routing problems Engineering Applications of Artificial Intelligence 22 6 2009 916 928
    • (2009) Engineering Applications of Artificial Intelligence , vol.22 , Issue.6 , pp. 916-928
    • Prins, C.1
  • 225
    • 84866148012 scopus 로고    scopus 로고
    • Metaheuristic hybrids
    • M. Gendreau, J.-Y. Potvin, Springer US, Boston, MA
    • R. Raidl, J. Puchinger, and C. Blum Metaheuristic hybrids M. Gendreau, J.-Y. Potvin, Handbook of Metaheuristics 2010 Springer US, Boston, MA 469 496
    • (2010) Handbook of Metaheuristics , pp. 469-496
    • Raidl, R.1    Puchinger, J.2    Blum, C.3
  • 226
    • 84873598629 scopus 로고    scopus 로고
    • Rancourt, M.-É., Cordeau, J.-F., Laporte, G., 2013. Long-haul vehicle routing and scheduling with working hour rules. Transportation Science 47 (1), 81-107.
    • Rancourt, M.-É., Cordeau, J.-F., Laporte, G., 2013. Long-haul vehicle routing and scheduling with working hour rules. Transportation Science 47 (1), 81-107.
  • 227
    • 0035247978 scopus 로고    scopus 로고
    • Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
    • C. Rego Node-ejection chains for the vehicle routing problem: sequential and parallel algorithms Parallel Computing 27 3 2001 201 222
    • (2001) Parallel Computing , vol.27 , Issue.3 , pp. 201-222
    • Rego, C.1
  • 228
    • 0346009088 scopus 로고    scopus 로고
    • D-ants: Savings based ants divide and conquer the vehicle routing problem
    • M. Reimann, K. Doerner, and R. Hartl D-ants: savings based ants divide and conquer the vehicle routing problem Computers & Operations Research 31 4 2004 563 591
    • (2004) Computers & Operations Research , vol.31 , Issue.4 , pp. 563-591
    • Reimann, M.1    Doerner, K.2    Hartl, R.3
  • 231
    • 77957719356 scopus 로고    scopus 로고
    • Scatter search and path-relinking: Fundamentals, advances, and applications
    • M. Gendreau, J.-Y. Potvin, Springer US, Boston, MA
    • M. Resende, C. Ribeiro, F. Glover, and R. Marti Scatter search and path-relinking: fundamentals, advances, and applications M. Gendreau, J.-Y. Potvin, Handbook of Metaheuristics 2010 Springer US, Boston, MA 87 107
    • (2010) Handbook of Metaheuristics , pp. 87-107
    • Resende, M.1    Ribeiro, C.2    Glover, F.3    Marti, R.4
  • 232
    • 79960165127 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
    • G. Ribeiro, and G. Laporte An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem Computers & Operations Research 39 3 2012 728 735
    • (2012) Computers & Operations Research , vol.39 , Issue.3 , pp. 728-735
    • Ribeiro, G.1    Laporte, G.2
  • 233
    • 0029362478 scopus 로고
    • Probabilistic diversification and intensification in local search for vehicle routing
    • Y. Rochat, and E. Taillard Probabilistic diversification and intensification in local search for vehicle routing Journal of Heuristics 1 1 1995 147 167
    • (1995) Journal of Heuristics , vol.1 , Issue.1 , pp. 147-167
    • Rochat, Y.1    Taillard, E.2
  • 234
    • 0024016482 scopus 로고
    • Perspectives on practical aspects of truck routing and scheduling
    • D. Ronen Perspectives on practical aspects of truck routing and scheduling European Journal of Operational Research 35 2 1988 137 145
    • (1988) European Journal of Operational Research , vol.35 , Issue.2 , pp. 137-145
    • Ronen, D.1
  • 235
    • 34250189938 scopus 로고    scopus 로고
    • Models and branch-and-cut algorithms for pickup and delivery problems with time windows
    • S. Ropke, J. Cordeau, and G. Laporte Models and branch-and-cut algorithms for pickup and delivery problems with time windows Networks 49 4 2007 258 272
    • (2007) Networks , vol.49 , Issue.4 , pp. 258-272
    • Ropke, S.1    Cordeau, J.2    Laporte, G.3
  • 236
    • 31144472823 scopus 로고    scopus 로고
    • A unified heuristic for a large class of vehicle routing problems with backhauls
    • S. Ropke, and D. Pisinger A unified heuristic for a large class of vehicle routing problems with backhauls European Journal of Operational Research 171 3 2006 750 775
    • (2006) European Journal of Operational Research , vol.171 , Issue.3 , pp. 750-775
    • Ropke, S.1    Pisinger, D.2
  • 237
    • 33751011598 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
    • S. Ropke, and D. Pisinger An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transportation Science 40 4 2006 455 472
    • (2006) Transportation Science , vol.40 , Issue.4 , pp. 455-472
    • Ropke, S.1    Pisinger, D.2
  • 238
    • 77955267030 scopus 로고    scopus 로고
    • An ILP improvement procedure for the open vehicle routing problem
    • M. Salari, P. Toth, and A. Tramontani An ILP improvement procedure for the open vehicle routing problem Computers & Operations Research 37 12 2010 2106 2120
    • (2010) Computers & Operations Research , vol.37 , Issue.12 , pp. 2106-2120
    • Salari, M.1    Toth, P.2    Tramontani, A.3
  • 239
    • 36549063541 scopus 로고    scopus 로고
    • A GA based heuristic for the vehicle routing problem with multiple trips
    • S. Salhi, and R.J. Petch A GA based heuristic for the vehicle routing problem with multiple trips Journal of Mathematical Modelling and Algorithms 6 4 2007 591 613
    • (2007) Journal of Mathematical Modelling and Algorithms , vol.6 , Issue.4 , pp. 591-613
    • Salhi, S.1    Petch, R.J.2
  • 240
    • 84879975551 scopus 로고    scopus 로고
    • Sarvanov, V., Doroshko, N., 1981. The approximate solution of the travelling salesman problem by a local algorithm with scanning neighborhoods of factorial cardinality in cubic time (in Russian). Software: Algorithms and Programs 31, Mathematical Institute of the Belorussian Academy of Sciences, Minsk, pp. 11-13.
    • Sarvanov, V., Doroshko, N., 1981. The approximate solution of the travelling salesman problem by a local algorithm with scanning neighborhoods of factorial cardinality in cubic time (in Russian). Software: Algorithms and Programs 31, Mathematical Institute of the Belorussian Academy of Sciences, Minsk, pp. 11-13.
  • 241
    • 0026839912 scopus 로고
    • The vehicle routing problem with time windows: Minimizing route duration
    • M. Savelsbergh The vehicle routing problem with time windows: minimizing route duration ORSA Journal on Computing 4 2 1992 146 154
    • (1992) ORSA Journal on Computing , vol.4 , Issue.2 , pp. 146-154
    • Savelsbergh, M.1
  • 242
    • 84879917520 scopus 로고    scopus 로고
    • Schulz, C., 2011. Efficient Local Search on the GPU Investigations on the Vehicle Routing Problem. SINTEF Report 2011-05-24.
    • Schulz, C., 2011. Efficient Local Search on the GPU Investigations on the Vehicle Routing Problem. SINTEF Report 2011-05-24.
  • 243
    • 84957372764 scopus 로고    scopus 로고
    • Using constraint programming and local search methods to solve vehicle routing problems
    • Springer Berlin, Heidelberg
    • P. Shaw Using constraint programming and local search methods to solve vehicle routing problems LNCS vol. 1520 1998 Springer Berlin, Heidelberg 417 431
    • (1998) LNCS , vol.1520 VOL. , pp. 417-431
    • Shaw, P.1
  • 244
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 2 1987 254 265
    • (1987) Operations Research , vol.35 , Issue.2 , pp. 254-265
    • Solomon, M.1
  • 245
    • 26444605411 scopus 로고    scopus 로고
    • MAPM: Memetic algorithms with population management
    • K. Sörensen, and M. Sevaux MAPM: memetic algorithms with population management Computers & Operations Research 33 5 2006 1214 1225
    • (2006) Computers & Operations Research , vol.33 , Issue.5 , pp. 1214-1225
    • Sörensen, K.1    Sevaux, M.2
  • 247
    • 84879961805 scopus 로고    scopus 로고
    • Subramanian, A., 2012. Heuristic, Exact and Hybrid Approaches for Vehicle Routing Problems. Ph.D. thesis, Universidade Federal Fluminense, Niterói, Brazil.
    • Subramanian, A., 2012. Heuristic, Exact and Hybrid Approaches for Vehicle Routing Problems. Ph.D. thesis, Universidade Federal Fluminense, Niterói, Brazil.
  • 248
    • 77951104453 scopus 로고    scopus 로고
    • A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
    • A. Subramanian, L. Drummond, C. Bentes, L. Ochi, and R. Farias A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery Computers & Operations Research 37 11 2010 1899 1911
    • (2010) Computers & Operations Research , vol.37 , Issue.11 , pp. 1899-1911
    • Subramanian, A.1    Drummond, L.2    Bentes, C.3    Ochi, L.4    Farias, R.5
  • 250
    • 33845512751 scopus 로고
    • Parallel iterative search methods for vehicle routing problems
    • E. Taillard Parallel iterative search methods for vehicle routing problems Networks 23 8 1993 661 673
    • (1993) Networks , vol.23 , Issue.8 , pp. 661-673
    • Taillard, E.1
  • 251
    • 0033283556 scopus 로고    scopus 로고
    • A heuristic column generation method for the heterogeneous fleet VRP
    • E. Taillard A heuristic column generation method for the heterogeneous fleet VRP RAIRO Operations Research 33 1 1999 1 14
    • (1999) RAIRO Operations Research , vol.33 , Issue.1 , pp. 1-14
    • Taillard, E.1
  • 252
  • 254
    • 12244261649 scopus 로고    scopus 로고
    • Solving the vehicle routing problem with adaptive memory programming methodology
    • C. Tarantilis Solving the vehicle routing problem with adaptive memory programming methodology Computers & Operations Research 32 9 2005 2309 2327
    • (2005) Computers & Operations Research , vol.32 , Issue.9 , pp. 2309-2327
    • Tarantilis, C.1
  • 255
    • 82255192239 scopus 로고    scopus 로고
    • A template-based tabu search algorithm for the consistent vehicle routing problem
    • C. Tarantilis, F. Stavropoulou, and P. Repoussis A template-based tabu search algorithm for the consistent vehicle routing problem Expert Systems with Applications 39 4 2012 4233 4239
    • (2012) Expert Systems with Applications , vol.39 , Issue.4 , pp. 4233-4239
    • Tarantilis, C.1    Stavropoulou, F.2    Repoussis, P.3
  • 257
    • 0027667558 scopus 로고
    • Cyclic transfer algorithms for multivehicle routing and scheduling problems
    • P. Thompson, and H. Psaraftis Cyclic transfer algorithms for multivehicle routing and scheduling problems Operations Research 41 5 1993 935 946
    • (1993) Operations Research , vol.41 , Issue.5 , pp. 935-946
    • Thompson, P.1    Psaraftis, H.2
  • 258
    • 84888631239 scopus 로고    scopus 로고
    • An integer linear programming local search for capacitated vehicle routing problems
    • B. Golden, S. Raghavan, E. Wasil, Springer New York
    • P. Toth An integer linear programming local search for capacitated vehicle routing problems B. Golden, S. Raghavan, E. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges 2008 Springer New York 275 295
    • (2008) The Vehicle Routing Problem: Latest Advances and New Challenges , pp. 275-295
    • Toth, P.1
  • 259
    • 0031273028 scopus 로고    scopus 로고
    • An exact algorithm for the vehicle routing problem with backhauls
    • P. Toth, and D. Vigo An exact algorithm for the vehicle routing problem with backhauls Transportation Science 31 4 1997 372 385
    • (1997) Transportation Science , vol.31 , Issue.4 , pp. 372-385
    • Toth, P.1    Vigo, D.2
  • 260
    • 84879988036 scopus 로고    scopus 로고
    • Toth, P., Vigo, D. (Eds.), 2002a. The vehicle routing problem. Society for Industrial Mathematics, Philadelphia, PA, USA.
    • Toth, P., Vigo, D. (Eds.), 2002a. The vehicle routing problem. Society for Industrial Mathematics, Philadelphia, PA, USA.
  • 261
    • 2142844130 scopus 로고    scopus 로고
    • VRP with backhauls
    • P. Toth, D. Vigo, SIAM Philadelphia, PA, USA
    • P. Toth, and D. Vigo VRP with backhauls P. Toth, D. Vigo, The Vehicle Routing Problem 2002 SIAM Philadelphia, PA, USA 195 224
    • (2002) The Vehicle Routing Problem , pp. 195-224
    • Toth, P.1    Vigo, D.2
  • 262
    • 3843131812 scopus 로고    scopus 로고
    • The granular tabu search and its application to the vehicle-routing problem
    • P. Toth, and D. Vigo The granular tabu search and its application to the vehicle-routing problem INFORMS Journal on Computing 15 4 2003 333 346
    • (2003) INFORMS Journal on Computing , vol.15 , Issue.4 , pp. 333-346
    • Toth, P.1    Vigo, D.2
  • 263
    • 0011442728 scopus 로고    scopus 로고
    • Communication issues in designing cooperative multi-thread parallel searches
    • I. Osman, J. Kelly, Kluwer Academic Publishers. Norwell, MA
    • M. Toulouse, T. Crainic, and M. Gendreau Communication issues in designing cooperative multi-thread parallel searches I. Osman, J. Kelly, Meta-heuristics: Theory & Applications 1996 Kluwer Academic Publishers. Norwell, MA 501 522
    • (1996) Meta-heuristics: Theory & Applications , pp. 501-522
    • Toulouse, M.1    Crainic, T.2    Gendreau, M.3
  • 264
    • 0028712413 scopus 로고
    • Solving vehicle routing problems using elastic nets
    • A. Vakhutinsky, and B. Golden Solving vehicle routing problems using elastic nets Proceedings of ICNN'94 7 2 1994 4535 4540
    • (1994) Proceedings of ICNN'94 , vol.7 , Issue.2 , pp. 4535-4540
    • Vakhutinsky, A.1    Golden, B.2
  • 265
    • 0001080956 scopus 로고
    • Improvement heuristics for the vehicle routing problem based on simulated annealing
    • A. Van Breedam Improvement heuristics for the vehicle routing problem based on simulated annealing European Journal of Operational Research 86 3 1995 480 490
    • (1995) European Journal of Operational Research , vol.86 , Issue.3 , pp. 480-490
    • Van Breedam, A.1
  • 267
    • 0021819411 scopus 로고
    • Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
    • V. Černý Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm Journal of Optimization Theory and Applications 45 1 1985 41 51
    • (1985) Journal of Optimization Theory and Applications , vol.45 , Issue.1 , pp. 41-51
    • Černý, V.1
  • 268
    • 84864700477 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems
    • T. Vidal, T. Crainic, M. Gendreau, N. Lahrichi, and W. Rei A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems Operations Research 60 3 2012 611 624
    • (2012) Operations Research , vol.60 , Issue.3 , pp. 611-624
    • Vidal, T.1    Crainic, T.2    Gendreau, M.3    Lahrichi, N.4    Rei, W.5
  • 269
    • 84879984832 scopus 로고    scopus 로고
    • Vidal, T., Crainic, T., Gendreau, M., Prins, C., 2011. A Unifying View on Timing Problems and Algorithms. Tech. rep., CIRRELT.
    • Vidal, T., Crainic, T., Gendreau, M., Prins, C., 2011. A Unifying View on Timing Problems and Algorithms. Tech. rep., CIRRELT.
  • 270
    • 84866177726 scopus 로고    scopus 로고
    • A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
    • T. Vidal, T. Crainic, M. Gendreau, and C. Prins A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows Computers & Operations Research 40 1 2013 475 489
    • (2013) Computers & Operations Research , vol.40 , Issue.1 , pp. 475-489
    • Vidal, T.1    Crainic, T.2    Gendreau, M.3    Prins, C.4
  • 272
    • 0033102347 scopus 로고    scopus 로고
    • Guided local search and its application to the traveling salesman problem
    • C. Voudouris, and E. Tsang Guided local search and its application to the traveling salesman problem European Journal of Operational Research 113 2 1999 469 499
    • (1999) European Journal of Operational Research , vol.113 , Issue.2 , pp. 469-499
    • Voudouris, C.1    Tsang, E.2
  • 274
    • 0001547673 scopus 로고
    • A computational modification to the savings method of vehicle scheduling
    • P. Yellow A computational modification to the savings method of vehicle scheduling Operational Research Quarterly 21 2 1970 281 283
    • (1970) Operational Research Quarterly , vol.21 , Issue.2 , pp. 281-283
    • Yellow, P.1
  • 275
    • 56549096370 scopus 로고    scopus 로고
    • An improved ant colony optimization for vehicle routing problem
    • B. Yu, Z. Yang, and B. Yao An improved ant colony optimization for vehicle routing problem European Journal of Operational Research 196 1 2009 171 176
    • (2009) European Journal of Operational Research , vol.196 , Issue.1 , pp. 171-176
    • Yu, B.1    Yang, Z.2    Yao, B.3
  • 276
    • 77955238232 scopus 로고    scopus 로고
    • A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem
    • E. Zachariadis, and C. Kiranoudis A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem Computers & Operations Research 37 12 2010 2089 2105
    • (2010) Computers & Operations Research , vol.37 , Issue.12 , pp. 2089-2105
    • Zachariadis, E.1    Kiranoudis, C.2
  • 277
    • 70350575200 scopus 로고    scopus 로고
    • An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
    • E. Zachariadis, and C. Kiranoudis An open vehicle routing problem metaheuristic for examining wide solution neighborhoods Computers & Operations Research 37 4 2010 712 723
    • (2010) Computers & Operations Research , vol.37 , Issue.4 , pp. 712-723
    • Zachariadis, E.1    Kiranoudis, C.2
  • 278
    • 80255131355 scopus 로고    scopus 로고
    • An effective local search approach for the vehicle routing problem with backhauls
    • E. Zachariadis, and C. Kiranoudis An effective local search approach for the vehicle routing problem with backhauls Expert Systems with Applications 39 3 2012 3174 3184
    • (2012) Expert Systems with Applications , vol.39 , Issue.3 , pp. 3174-3184
    • Zachariadis, E.1    Kiranoudis, C.2
  • 279
    • 84855554578 scopus 로고    scopus 로고
    • A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
    • W. Zhu, H. Qin, A. Lim, and L. Wang A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP Computers & Operations Research 39 9 2012 2178 2195
    • (2012) Computers & Operations Research , vol.39 , Issue.9 , pp. 2178-2195
    • Zhu, W.1    Qin, H.2    Lim, A.3    Wang, L.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.