메뉴 건너뛰기




Volumn 218, Issue 3, 2012, Pages 636-647

Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW

Author keywords

Ant colony optimization; Beverage distribution; Mixed integer programming; Tabu search; Vehicle routing with multiple deliverymen; Vehicle routing with time windows

Indexed keywords

ANT-COLONY OPTIMIZATION; HEURISTIC APPROACH; HIGHLY DENSE; MINIMUM COST; MIXED INTEGER PROGRAMMING; ROUTING AND SCHEDULING; SERVICE TIME; TIME RESTRICTION; TIME WINDOWS; URBAN AREAS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING WITH TIME WINDOWS; WORKING HOURS;

EID: 84855792252     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.12.005     Document Type: Article
Times cited : (83)

References (42)
  • 1
    • 76749122240 scopus 로고    scopus 로고
    • Exact algorithms for routing problems under vehicle capacity constraints
    • R. Baldacci, P. Toth, and D. Vigo Exact algorithms for routing problems under vehicle capacity constraints Annals of Operations Research 175 2010 213 245
    • (2010) Annals of Operations Research , vol.175 , pp. 213-245
    • Baldacci, R.1    Toth, P.2    Vigo, D.3
  • 2
    • 0036567019 scopus 로고    scopus 로고
    • A branch-and-cut procedure for the vehicle routing problem with time windows
    • DOI 10.1287/trsc.36.2.250.565
    • J. Bard, G. Kontoravdis, and G. Yu A branch-and-cut procedure for the vehicle routing problem with time windows Transportation Science 36 2 2002 250 269 (Pubitemid 34554780)
    • (2002) Transportation Science , vol.36 , Issue.2 , pp. 250-269
    • Bard, J.F.1    Kontoravdis, G.2    Yu, G.3
  • 3
    • 10644284878 scopus 로고    scopus 로고
    • A two-stage hybrid local search for the vehicle routing problem with time windows
    • R. Bent, and P. Van Hentenryck A two-stage hybrid local search for the vehicle routing problem with time windows Transportation Science 38 4 2004 515 530
    • (2004) Transportation Science , vol.38 , Issue.4 , pp. 515-530
    • Bent, R.1    Van Hentenryck, P.2
  • 4
    • 85132117646 scopus 로고    scopus 로고
    • Static pickup and delivery problems: A classification scheme and survey
    • G. Berbeglia, J. Cordeau, I. Gribkovskaia, and G. Laporte Static pickup and delivery problems: A classification scheme and survey TOP 15 2007 1 31
    • (2007) TOP , vol.15 , pp. 1-31
    • Berbeglia, G.1    Cordeau, J.2    Gribkovskaia, I.3    Laporte, G.4
  • 6
    • 0003307112 scopus 로고
    • Special issue - Routing and scheduling of vehicles and crews - The state of the art
    • L. Bodin, B. Golden, A. Assad, and M. Ball Special issue - Routing and scheduling of vehicles and crews - the state of the art Computers & Operations Research 1983 10
    • (1983) Computers & Operations Research , pp. 10
    • Bodin, L.1    Golden, B.2    Assad, A.3    Ball, M.4
  • 7
    • 16244364524 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part I: Route construction and local search algorithms
    • DOI 10.1287/trsc.1030.0056
    • 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 (Pubitemid 40466664)
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 104-118
    • Braysy, O.1    Gendreau, M.2
  • 8
    • 16244404291 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part II: Metaheuristics
    • DOI 10.1287/trsc.1030.0057
    • O. Bräysy, and M. Gendreau Vehicle routing problem with time windows, part II: Metaheuristics Transportation Science 39 1 2005 119 139 (Pubitemid 40453880)
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 119-139
    • Braysy, O.1    Gendreau, M.2
  • 10
    • 0029365975 scopus 로고
    • Toward a characterization of landscapes of combinatorial optimization problems, with special attention to the phylogeny problem
    • M.A. Charleston Toward a characterization of landscapes of combinatorial optimization problems, with special attention to the phylogeny problem Journal of Computational Biology 2 3 1995 439 450
    • (1995) Journal of Computational Biology , vol.2 , Issue.3 , pp. 439-450
    • Charleston, M.A.1
  • 11
    • 0006112432 scopus 로고    scopus 로고
    • The VRP with time windows
    • P. Toth, D. Vigo, SIAM, Monographs on Discrete Mathematics and Applications SIAM Philadelphia, PA
    • J-F. Cordeau, G. Desaulniers, J. Desrosiers, M.M. Solomon, and F. Soumis The VRP with time windows P. Toth, D. Vigo, The Vehicle Routing Problem SIAM, Monographs on Discrete Mathematics and Applications 2002 SIAM Philadelphia, PA 157 193
    • (2002) The Vehicle Routing Problem , pp. 157-193
    • Cordeau, J.-F.1    Desaulniers, G.2    Desrosiers, J.3    Solomon, M.M.4    Soumis, F.5
  • 13
    • 77957089136 scopus 로고
    • Time constrained routing and scheduling
    • M.T. Ball, L. Magnanti, C.L. Monma, G.L. Nemhauser, Handbooks in Operations Research and Management Science North-Holland Amsterdam
    • J. Desroisiers, Y. Dumas, M. Solomon, and F. Soumis Time constrained routing and scheduling M.T. Ball, L. Magnanti, C.L. Monma, G.L. Nemhauser, Network Routing Handbooks in Operations Research and Management Science 1995 North-Holland Amsterdam 35 139
    • (1995) Network Routing , pp. 35-139
    • Desroisiers, J.1    Dumas, Y.2    Solomon, M.3    Soumis, F.4
  • 19
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers Massachusetts
    • F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Publishers Massachusetts
    • (1997) Tabu Search
    • Glover, F.1    Laguna, M.2
  • 22
  • 23
    • 0037118189 scopus 로고    scopus 로고
    • ACO algorithms with guaranteed convergence to the optimal solution
    • DOI 10.1016/S0020-0190(01)00258-7, PII S0020019001002587
    • W.J. Gutjahr ACO algorithms with guaranteed convergence to the optimal solution Information Processing Letters 82 2002 145 153 (Pubitemid 34181987)
    • (2002) Information Processing Letters , vol.82 , Issue.3 , pp. 145-153
    • Gutjahr, W.J.1
  • 25
    • 0026874435 scopus 로고
    • The vehicle routing problem: An overview of exact and approximate algorithms
    • G. Laporte The vehicle routing problem: An overview of exact and approximate algorithms European Journal of Operational Research 59 1992 345 358
    • (1992) European Journal of Operational Research , vol.59 , pp. 345-358
    • Laporte, G.1
  • 26
    • 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
  • 27
    • 0019572333 scopus 로고
    • Complexity of vehicle routing and scheduling problems
    • J. Lenstra, and A. Rinnooy-Kan Complexity of vehicle routing and scheduling problems Networks 11 1981 221 227 (Pubitemid 13506973)
    • (1981) Networks , vol.11 , Issue.2 , pp. 221-227
    • Lenstra, J.K.1    Rinnooy Kan, A.H.G.2
  • 28
    • 23344441137 scopus 로고    scopus 로고
    • A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
    • DOI 10.1016/j.cor.2004.07.009, PII S0305054804001741
    • F. Montane, and R. Galvao A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service Computers & Operations Research 33 3 2006 595 619 (Pubitemid 41101115)
    • (2006) Computers and Operations Research , vol.33 , Issue.3 , pp. 595-619
    • Montane, F.A.T.1    Galvao, R.D.2
  • 29
    • 21144460138 scopus 로고
    • Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
    • I.H. Osman Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem Annals of Operations Research 41 1993 421 452
    • (1993) Annals of Operations Research , vol.41 , pp. 421-452
    • Osman, I.H.1
  • 30
    • 41349095406 scopus 로고    scopus 로고
    • A survey on pickup and delivery problems
    • 10.1007/s11301-008-0033-7
    • S. Parragh, K. Doerner, and R. Hartl A survey on pickup and delivery problems Journal für Betriebswirtschaft 58 1 2008 21 51 10.1007/s11301-008-0033-7
    • (2008) Journal für Betriebswirtschaft , vol.58 , Issue.1 , pp. 21-51
    • Parragh, S.1    Doerner, K.2    Hartl, R.3
  • 31
    • 84855774392 scopus 로고    scopus 로고
    • Desenvolvimento de um modelo matemático e um protótipo computacional para planejamento de rotas de atendimento
    • FAI-UFSCar, Sao Carlos, Brazil
    • Pureza, V., Morabito, R., 2008. Desenvolvimento de um modelo matemático e um protótipo computacional para planejamento de rotas de atendimento. Technical Report of Project Transmute 863*04, FAI-UFSCar, Sao Carlos, Brazil.
    • (2008) Technical Report of Project Transmute 863*04
    • Pureza, V.1    Morabito, R.2
  • 32
    • 33750926125 scopus 로고    scopus 로고
    • Combining an exact algorithm with an ant system for travelling salesman problems
    • University of Vienna
    • Reimann, M., 2003. Combining an exact algorithm with an ant system for travelling salesman problems. Working paper, University of Vienna.
    • (2003) Working Paper
    • Reimann, M.1
  • 33
    • 33750916754 scopus 로고    scopus 로고
    • Comparing backhauling strategies in vehicle routing using Ant Colony Optimization
    • DOI 10.1007/s10100-006-0163-8
    • M. Reimann, and H. Ulrich Comparing backhauling strategies in vehicle routing using ant colony optimization Central European Journal of Operations Research 14 2 2006 105 123 (Pubitemid 44727093)
    • (2006) Central European Journal of Operations Research , vol.14 , Issue.2 , pp. 105-123
    • Reimann, M.1    Ulrich, H.2
  • 34
    • 84974730882 scopus 로고    scopus 로고
    • Insertion based ants for vehicle routing problems with backhauls and time windows
    • M. Dorigo, G. Di Caro, M. Samples, LNCS Springer Berlin/Heidelberg
    • M. Reimann, K.F. Dörner, and R.F. Hartl Insertion based ants for vehicle routing problems with backhauls and time windows M. Dorigo, G. Di Caro, M. Samples, Ant Algorithms LNCS vol. 2463 2002 Springer Berlin/Heidelberg 135 147
    • (2002) Ant Algorithms , vol.2463 , pp. 135-147
    • Reimann, M.1    Dörner, K.F.2    Hartl, R.F.3
  • 35
    • 33750912627 scopus 로고    scopus 로고
    • Analyzing a unified ant system for the VRP and some of its variants
    • G. Raidl, LNCS Springer Berlin/Heidelberg
    • M. Reimann, K.F. Dörner, and R.F. Hartl Analyzing a unified ant system for the VRP and some of its variants G. Raidl, Applications of Evolutionary Computing LNCS vol. 2611 2003 Springer Berlin/Heidelberg 300 310
    • (2003) Applications of Evolutionary Computing , vol.2611 , pp. 300-310
    • Reimann, M.1    Dörner, K.F.2    Hartl, R.F.3
  • 36
    • 0030282456 scopus 로고    scopus 로고
    • The plant location problem: New models and research prospects
    • C.S. Revelle, and G. Laporte The plant location problem: New models and research prospects Operations Research 44 6 1996 864 874 (Pubitemid 126669561)
    • (1996) Operations Research , vol.44 , Issue.6 , pp. 864-874
    • Revelle, C.S.1    Laporte, G.2
  • 37
    • 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 (Pubitemid 17652588)
    • (1987) Operations Research , vol.35 , Issue.2 , pp. 254-265
    • Solomon Marius, M.1
  • 38
    • 0036670452 scopus 로고    scopus 로고
    • A short convergence proof for a class of ant colony optimization algorithms
    • DOI 10.1109/TEVC.2002.802444, PII 1011092002802444
    • T. Stützle, and M. Dorigo A short convergence proof for a class of ACO algorithms IEEE Transactions on Evolutionary Computation 6 2002 358 365 (Pubitemid 35032737)
    • (2002) IEEE Transactions on Evolutionary Computation , vol.6 , Issue.4 , pp. 358-365
    • Stutzle, T.1    Dorigo, M.2
  • 39
    • 0003386121 scopus 로고    scopus 로고
    • The max-min ant system and local search for combinatorial optimization problems
    • S. Voß, S. Martello, I.H. Osman, C. Roucairol, Kluwer Boston
    • T. Stützle, and H. Hoos The max-min ant system and local search for combinatorial optimization problems S. Voß, S. Martello, I.H. Osman, C. Roucairol, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization 1999 Kluwer Boston 313 329
    • (1999) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , pp. 313-329
    • Stützle, T.1    Hoos, H.2
  • 40
    • 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
  • 41
    • 0041791136 scopus 로고    scopus 로고
    • SIAM, Monographs on Discrete Mathematics and Applications SIAM Philadelphia, PA
    • P. Toth, and D. Vigo The vehicle routing problem SIAM, Monographs on Discrete Mathematics and Applications 2002 SIAM Philadelphia, PA 157 193
    • (2002) The Vehicle Routing Problem , pp. 157-193
    • Toth, P.1    Vigo, D.2
  • 42
    • 8144230385 scopus 로고    scopus 로고
    • A vehicle routing problem with backhauls and time windows: A guided local search solution
    • DOI 10.1016/j.tre.2003.12.003, PII S136655450400016X
    • Y. Zhong, and M. Cole A vehicle routing problem with backhauls and time windows: A guided local search solution Transportation Research, Part E 41 2 2005 131 144 (Pubitemid 39474113)
    • (2005) Transportation Research Part E: Logistics and Transportation Review , vol.41 , Issue.2 , pp. 131-144
    • Zhong, Y.1    Cole, M.H.2


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