메뉴 건너뛰기




Volumn 234, Issue 3, 2014, Pages 658-673

A unified solution framework for multi-attribute vehicle routing problems

Author keywords

General purpose solver; Multiple attributes; Vehicle routing

Indexed keywords

COMPONENT BASED DESIGN; COMPUTATIONAL EXPERIMENT; DIVERSITY MANAGEMENTS; GENERAL-PURPOSE SOLVERS; MULTIPLE ATTRIBUTES; PROBLEM FORMULATION; REAL-LIFE APPLICATIONS; VEHICLE ROUTING PROBLEMS;

EID: 84892769501     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.09.045     Document Type: Article
Times cited : (351)

References (107)
  • 5
    • 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
  • 6
    • 81455141797 scopus 로고    scopus 로고
    • An exact method for the capacitated location-routing problem
    • R. Baldacci, A. Mingozzi, and R.W. Calvo An exact method for the capacitated location-routing problem Operations Research 59 5 2011 1284 1296
    • (2011) Operations Research , vol.59 , Issue.5 , pp. 1284-1296
    • Baldacci, R.1    Mingozzi, A.2    Calvo, R.W.3
  • 7
    • 78549273306 scopus 로고    scopus 로고
    • An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows
    • S.R. 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.R.1    Loiseau, I.2    Ramonet, J.3
  • 8
    • 80051924578 scopus 로고    scopus 로고
    • Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
    • T. Bektas, G. Erdogan, and S. Ropke Formulations and branch-and-cut algorithms for the generalized vehicle routing problem Transportation Science 45 3 2011 299 316
    • (2011) Transportation Science , vol.45 , Issue.3 , pp. 299-316
    • Bektas, T.1    Erdogan, G.2    Ropke, S.3
  • 10
    • 84888602100 scopus 로고    scopus 로고
    • Multiperiod planning and routing on a rolling horizon for field force optimization logistics
    • Bruce Golden, S. Raghavan, Edward Wasil, Springer New York
    • N. Bostel, P. Dejax, P. Guez, and F. Tricoire Multiperiod planning and routing on a rolling horizon for field force optimization logistics Bruce Golden, S. Raghavan, Edward Wasil, The vehicle routing problem: Latest advances and new challenges 43 2008 Springer New York 503 525
    • (2008) The Vehicle Routing Problem: Latest Advances and New Challenges , vol.43 , pp. 503-525
    • Bostel, N.1    Dejax, P.2    Guez, P.3    Tricoire, F.4
  • 11
    • 70449650344 scopus 로고    scopus 로고
    • An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows
    • O. Bräysy, W. Dullaert, G. Hasle, D. Mester, and M. Gendreau An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows Transportation Science 42 3 2008 371 386
    • (2008) Transportation Science , vol.42 , Issue.3 , pp. 371-386
    • Bräysy, O.1    Dullaert, W.2    Hasle, G.3    Mester, D.4    Gendreau, M.5
  • 14
    • 3543137178 scopus 로고    scopus 로고
    • ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics
    • S. Cahon, N. Melab, and E.-G. Talbi ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics Journal of Heuristics 10 3 2004 357 380
    • (2004) Journal of Heuristics , vol.10 , Issue.3 , pp. 357-380
    • Cahon, S.1    Melab, N.2    Talbi, E.-G.3
  • 15
    • 4544373808 scopus 로고    scopus 로고
    • Efficient insertion heuristics for vehicle routing and scheduling problems
    • A.M. Campbell, and M. Savelsbergh Efficient insertion heuristics for vehicle routing and scheduling problems Transportation Science 38 3 2004 369 378
    • (2004) Transportation Science , vol.38 , Issue.3 , pp. 369-378
    • Campbell, A.M.1    Savelsbergh, M.2
  • 16
    • 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
  • 17
    • 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
  • 18
    • 0035418303 scopus 로고    scopus 로고
    • A tabu search algorithm for the site dependent vehicle routing problem with time windows
    • J.-F. Cordeau, and G. Laporte A tabu search algorithm for the site dependent vehicle routing problem with time windows INFOR 39 3 2001 292 298
    • (2001) INFOR , vol.39 , Issue.3 , pp. 292-298
    • Cordeau, J.-F.1    Laporte, G.2
  • 19
    • 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
  • 21
    • 2442505839 scopus 로고    scopus 로고
    • Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
    • J.-F. Cordeau, G. Laporte, and A. Mercier Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows Journal of the Operational Research Society 55 5 2004 542 546
    • (2004) Journal of the Operational Research Society , vol.55 , Issue.5 , pp. 542-546
    • Cordeau, J.-F.1    Laporte, G.2    Mercier, A.3
  • 22
    • 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
  • 24
    • 84864692126 scopus 로고    scopus 로고
    • Parallel meta-heuristics
    • M. Gendreau, J.-Y. Potvin, Springer US, Boston, MA
    • T.G. 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.G.1    Toulouse, M.2
  • 25
    • 0002127739 scopus 로고    scopus 로고
    • A unified framework for deterministic time constrained vehicle routing and crew scheduling problems
    • T.G. Crainic, G. Laporte, Kluwer Academic Publishers Boston, MA
    • G. Desaulniers, J. Desrosiers, I. Ioachim, M.M. Solomon, F. Soumis, and D. Villeneuve A unified framework for deterministic time constrained vehicle routing and crew scheduling problems T.G. Crainic, G. Laporte, Fleet management and logistics 1998 Kluwer Academic Publishers Boston, MA 129 154
    • (1998) Fleet Management and Logistics , pp. 129-154
    • Desaulniers, G.1    Desrosiers, J.2    Ioachim, I.3    Solomon, M.M.4    Soumis, F.5    Villeneuve, D.6
  • 27
    • 0035303769 scopus 로고    scopus 로고
    • Using object-oriented paradigm to develop an evolutional vehicle routing system
    • T.C. Du, and J.-L. Wu Using object-oriented paradigm to develop an evolutional vehicle routing system Computers in Industry 44 3 2001 229 249
    • (2001) Computers in Industry , vol.44 , Issue.3 , pp. 229-249
    • Du, T.C.1    Wu, J.-L.2
  • 29
    • 77953361445 scopus 로고    scopus 로고
    • An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows
    • M.A. Figliozzi An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows Transportation Research Part C: Emerging Technologies 18 5 2010 668 679
    • (2010) Transportation Research Part C: Emerging Technologies , vol.18 , Issue.5 , pp. 668-679
    • Figliozzi, M.A.1
  • 31
    • 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
  • 32
    • 0028461566 scopus 로고
    • Optimal solution of vehicle routing problems using minimum k-trees
    • M.L. Fisher Optimal solution of vehicle routing problems using minimum k-trees Operations Research 42 4 1994 626 642
    • (1994) Operations Research , vol.42 , Issue.4 , pp. 626-642
    • Fisher, M.L.1
  • 33
    • 42649126395 scopus 로고    scopus 로고
    • A unified tabu search algorithm for vehicle routing problems with soft time windows
    • Z. Fu, R. Eglese, and L.Y.O. Li A unified tabu search algorithm for vehicle routing problems with soft time windows Journal of the Operational Research Society 59 5 2007 663 673
    • (2007) Journal of the Operational Research Society , vol.59 , Issue.5 , pp. 663-673
    • Fu, Z.1    Eglese, R.2    Li, L.Y.O.3
  • 34
    • 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
  • 36
    • 0006052879 scopus 로고    scopus 로고
    • A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows
    • H. Gehring, and J. Homberger A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows Proceedings of EURO-GEN'99 1999 57 64
    • (1999) Proceedings of EURO-GEN'99 , pp. 57-64
    • Gehring, H.1    Homberger, J.2
  • 37
    • 21844484570 scopus 로고
    • A new branching strategy for time constrained routing problems with application to backhauling
    • S. Gélinas, M. Desrochers, J. Desrosiers, and M.M. Solomon A new branching strategy for time constrained routing problems with application to backhauling Annals of Operations Research 61 1 1995 91 109
    • (1995) Annals of Operations Research , vol.61 , Issue.1 , pp. 91-109
    • Gélinas, S.1    Desrochers, M.2    Desrosiers, J.3    Solomon, M.M.4
  • 39
  • 40
    • 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
  • 41
    • 84866421228 scopus 로고    scopus 로고
    • Truck driver scheduling in the United States
    • A. Goel, and L. Kok Truck driver scheduling in the United States Transportation Science 46 3 2012 317 326
    • (2012) Transportation Science , vol.46 , Issue.3 , pp. 317-326
    • Goel, A.1    Kok, L.2
  • 42
    • 84892745046 scopus 로고    scopus 로고
    • Hours of service regulations in road freight transport: An optimization-based international assessment
    • in press
    • A. Goel, and T. Vidal Hours of service regulations in road freight transport: An optimization-based international assessment Transportation Science 2013 in press
    • (2013) Transportation Science
    • Goel, A.1    Vidal, T.2
  • 44
    • 0021196710 scopus 로고
    • The fleet size and mix vehicle routing problem
    • B. Golden The fleet size and mix vehicle routing problem Computers & Operations Research 11 1 1984 49 66
    • (1984) Computers & Operations Research , vol.11 , Issue.1 , pp. 49-66
    • Golden, B.1
  • 46
    • 0001799407 scopus 로고    scopus 로고
    • The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results
    • T.G. Crainic, G. Laporte, Kluwer Academic Publishers Boston, MA
    • B.L. Golden, E.A. Wasil, J.P. Kelly, and I.M. Chao The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results T.G. 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.L.1    Wasil, E.A.2    Kelly, J.P.3    Chao, I.M.4
  • 47
    • 79955081124 scopus 로고    scopus 로고
    • A library of local search heuristics for the vehicle routing problem
    • C. Groër, B. Golden, and E. Wasil A library of local search heuristics for the vehicle routing problem Mathematical Programming Computation 2 2 2010 79 101
    • (2010) Mathematical Programming Computation , vol.2 , Issue.2 , pp. 79-101
    • Groër, C.1    Golden, B.2    Wasil, E.3
  • 48
    • 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
  • 49
    • 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
  • 50
    • 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
  • 52
    • 33646466321 scopus 로고    scopus 로고
    • Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
    • Y. Hendel, and F. Sourd Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem European Journal of Operational Research 173 1 2006 108 119
    • (2006) European Journal of Operational Research , vol.173 , Issue.1 , pp. 108-119
    • Hendel, Y.1    Sourd, F.2
  • 53
    • 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
  • 54
    • 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
  • 55
    • 60649121332 scopus 로고    scopus 로고
    • A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
    • A. Imran, S. Salhi, and N.A. Wassan A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem European Journal of Operational Research 197 2 2009 509 518
    • (2009) European Journal of Operational Research , vol.197 , Issue.2 , pp. 509-518
    • Imran, A.1    Salhi, S.2    Wassan, N.A.3
  • 56
    • 61349117954 scopus 로고    scopus 로고
    • A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
    • S. Irnich A unified modeling and solution framework for vehicle routing and local search-based metaheuristics INFORMS Journal on Computing 20 2 2008 270 287
    • (2008) INFORMS Journal on Computing , vol.20 , Issue.2 , pp. 270-287
    • Irnich, S.1
  • 57
    • 36148975708 scopus 로고    scopus 로고
    • Resource extension functions: Properties, inversion, and generalization to segments
    • S. Irnich Resource extension functions: properties, inversion, and generalization to segments OR Spectrum 30 2008 113 148
    • (2008) OR Spectrum , vol.30 , pp. 113-148
    • Irnich, S.1
  • 61
    • 49749083973 scopus 로고    scopus 로고
    • A memetic algorithm for the vehicle routing problem with time windows
    • N. Labadi, C. Prins, and M. Reghioui A memetic algorithm for the vehicle routing problem with time windows RAIRO Operations Research 42 3 2008 415 431
    • (2008) RAIRO Operations Research , vol.42 , Issue.3 , pp. 415-431
    • Labadi, N.1    Prins, C.2    Reghioui, M.3
  • 62
    • 0032679511 scopus 로고    scopus 로고
    • The fleet size and mix vehicle routing problem with time windows
    • F.-H. Liu, and S.-Y. Shen The fleet size and mix vehicle routing problem with time windows Journal of the Operational Research Society 50 7 1999 721 732
    • (1999) Journal of the Operational Research Society , vol.50 , Issue.7 , pp. 721-732
    • Liu, F.-H.1    Shen, S.-Y.2
  • 63
    • 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
  • 65
    • 84855686605 scopus 로고    scopus 로고
    • An incremental tabu search heuristic for the generalized vehicle routing problem with time windows
    • L. Moccia, J.-F. Cordeau, and G. Laporte An incremental tabu search heuristic for the generalized vehicle routing problem with time windows Journal of the Operational Research Society 63 2 2012 232 244
    • (2012) Journal of the Operational Research Society , vol.63 , Issue.2 , pp. 232-244
    • Moccia, L.1    Cordeau, J.-F.2    Laporte, G.3
  • 66
    • 23344441137 scopus 로고    scopus 로고
    • A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
    • F.A.T. Montané, and R.D. Galvão A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service Computers & Operations Research 33 3 2006 595 619
    • (2006) Computers & Operations Research , vol.33 , Issue.3 , pp. 595-619
    • Montané, F.A.T.1    Galvão, R.D.2
  • 67
    • 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
  • 68
    • 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
  • 69
    • 77951101612 scopus 로고    scopus 로고
    • An effective memetic algorithm for the cumulative capacitated vehicle routing problem
    • S.U. 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.U.1    Prins, C.2    Wolfler Calvo, R.3
  • 71
    • 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
  • 72
    • 85038011666 scopus 로고    scopus 로고
    • A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows
    • M. Polacek, S. Benkner, K.F. Doerner, and R.F. Hartl A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows BuR-Business Research 1 2 2008 207 218
    • (2008) BuR-Business Research , vol.1 , Issue.2 , pp. 207-218
    • Polacek, M.1    Benkner, S.2    Doerner, K.F.3    Hartl, R.F.4
  • 74
    • 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
  • 75
    • 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
  • 76
    • 38049185814 scopus 로고    scopus 로고
    • A memetic algorithm solving the VRP, the CARP, and more general routing problems with nodes, edges and arcs
    • W. Hart, N. Krasnogor, J. Smith Springer
    • C. Prins, and S. Bouchenoua A memetic algorithm solving the VRP, the CARP, and more general routing problems with nodes, edges and arcs W. Hart, N. Krasnogor, J. Smith, Recent advances in memetic algorithms Studies in fuzziness and soft computing 2005 Springer 65 85
    • (2005) Recent Advances in Memetic Algorithms, Studies in Fuzziness and Soft Computing , pp. 65-85
    • Prins, C.1    Bouchenoua, S.2
  • 78
    • 77953359101 scopus 로고    scopus 로고
    • Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming
    • P.P. Repoussis, and C.D. Tarantilis Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming Transportation Research Part C: Emerging Technologies 18 5 2010 695 712
    • (2010) Transportation Research Part C: Emerging Technologies , vol.18 , Issue.5 , pp. 695-712
    • Repoussis, P.P.1    Tarantilis, C.D.2
  • 81
    • 79960165127 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
    • G.M. 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.M.1    Laporte, G.2
  • 82
    • 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
  • 83
    • 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
  • 85
    • 0033440859 scopus 로고    scopus 로고
    • A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
    • S. Salhi, and G. Nagy A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling Journal of the Operational Research Society 50 10 1999 1034 1042
    • (1999) Journal of the Operational Research Society , vol.50 , Issue.10 , pp. 1034-1042
    • Salhi, S.1    Nagy, G.2
  • 86
    • 0000110116 scopus 로고
    • Local search in routing problems with time windows
    • M.W.P. Savelsbergh Local search in routing problems with time windows Annals of Operations Research 4 1 1985 285 305
    • (1985) Annals of Operations Research , vol.4 , Issue.1 , pp. 285-305
    • Savelsbergh, M.W.P.1
  • 87
    • 0026839912 scopus 로고
    • The vehicle routing problem with time windows: Minimizing route duration
    • M.W.P. 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.W.P.1
  • 89
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • M.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.M.1
  • 92
    • 84879055762 scopus 로고    scopus 로고
    • A hybrid algorithm for a class of vehicle routing problems
    • A. Subramanian, E. Uchoa, and L.S. Ochi A hybrid algorithm for a class of vehicle routing problems Computers & Operations Research 40 10 2013 2519 2531
    • (2013) Computers & Operations Research , vol.40 , Issue.10 , pp. 2519-2531
    • Subramanian, A.1    Uchoa, E.2    Ochi, L.S.3
  • 93
    • 84882378497 scopus 로고    scopus 로고
    • Adaptive path relinking for vehicle routing and scheduling problems with product returns
    • Articles in advance
    • C.D. Tarantilis, A.K. Anagnostopoulou, and P.P. Repoussis Adaptive path relinking for vehicle routing and scheduling problems with product returns Transportation Science 2013 Articles in advance
    • (2013) Transportation Science
    • Tarantilis, C.D.1    Anagnostopoulou, A.K.2    Repoussis, P.P.3
  • 94
    • 0041791136 scopus 로고    scopus 로고
    • Society for Industrial Mathematics, Philadelphia, PA, USA
    • Toth, P., & Vigo D. (Eds.) (2002). The vehicle routing problem. Society for Industrial Mathematics, Philadelphia, PA, USA.
    • (2002) The Vehicle Routing Problem
    • Toth, P.1    Vigo, D.2
  • 95
    • 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
  • 96
    • 84864700477 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for multidepot and periodic vehicle routing problems
    • T. Vidal, T.G. Crainic, M. Gendreau, N. Lahrichi, and W. Rei A hybrid genetic algorithm for multidepot 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.G.2    Gendreau, M.3    Lahrichi, N.4    Rei, W.5
  • 99
    • 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.G. 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.G.2    Gendreau, M.3    Prins, C.4
  • 103
    • 81555204400 scopus 로고    scopus 로고
    • Development of a fuel consumption optimization model for the capacitated vehicle routing problem
    • Y. Xiao, Q. Zhao, I. Kaku, and Y. Xu Development of a fuel consumption optimization model for the capacitated vehicle routing problem Computers & Operations Research 39 7 2012 1419 1431
    • (2012) Computers & Operations Research , vol.39 , Issue.7 , pp. 1419-1431
    • Xiao, Y.1    Zhao, Q.2    Kaku, I.3    Xu, Y.4
  • 104
    • 70350575200 scopus 로고    scopus 로고
    • An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
    • E.E. Zachariadis, and C.T. 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.E.1    Kiranoudis, C.T.2
  • 105
    • 78049529189 scopus 로고    scopus 로고
    • A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries
    • E.E. Zachariadis, and C.T. Kiranoudis A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries Expert Systems with Applications 38 3 2011 2717 2726
    • (2011) Expert Systems with Applications , vol.38 , Issue.3 , pp. 2717-2726
    • Zachariadis, E.E.1    Kiranoudis, C.T.2
  • 106
    • 80255131355 scopus 로고    scopus 로고
    • An effective local search approach for the vehicle routing problem with backhauls
    • E.E. Zachariadis, and C.T. 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.E.1    Kiranoudis, C.T.2
  • 107
    • 70349964564 scopus 로고    scopus 로고
    • An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
    • E.E. Zachariadis, C.D. Tarantilis, and C.T. Kiranoudis An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries European Journal of Operational Research 202 2 2010 401 411
    • (2010) European Journal of Operational Research , vol.202 , Issue.2 , pp. 401-411
    • Zachariadis, E.E.1    Tarantilis, C.D.2    Kiranoudis, C.T.3


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