메뉴 건너뛰기




Volumn 248, Issue 1, 2016, Pages 33-51

The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm

Author keywords

genetic algorithm; heterogeneous fleet; location routing; mixed integer programming; time windows

Indexed keywords

ALGORITHMS; AMPHIBIOUS VEHICLES; BENCHMARKING; COSTS; EVOLUTIONARY ALGORITHMS; FLEET OPERATIONS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LOCATION;

EID: 84940889504     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2015.06.082     Document Type: Article
Times cited : (98)

References (43)
  • 1
    • 0041704620 scopus 로고    scopus 로고
    • An improved branch-and-cut algorithm for the capacitated vehicle routing problem
    • Achuthan N., Caccetta L., and Hill S. An improved branch-and-cut algorithm for the capacitated vehicle routing problem Transportation Science 37 2003 153 169
    • (2003) Transportation Science , vol.37 , pp. 153-169
    • Achuthan, N.1    Caccetta, L.2    Hill, S.3
  • 2
    • 84940895401 scopus 로고    scopus 로고
    • Location-routing and location-arc routing problems
    • G. Laporte, S. Nickel, F. Saldanha da Gama, Springer Berlin-Heidelberg
    • Albareda-Sambola M. Location-routing and location-arc routing problems G. Laporte, S. Nickel, F. Saldanha da Gama, Location science. 2015 Springer Berlin-Heidelberg 399 418
    • (2015) Location Science. , pp. 399-418
    • Albareda-Sambola, M.1
  • 4
    • 52049103673 scopus 로고    scopus 로고
    • A heuristic based on multiexchange techniques for a regional fleet assignment location-routing problem
    • Ambrosino D., Sciomachen A., and Scutellà M.G. A heuristic based on multiexchange techniques for a regional fleet assignment location-routing problem Computers & Operations Research 36 2009 442 460
    • (2009) Computers & Operations Research , vol.36 , pp. 442-460
    • Ambrosino, D.1    Sciomachen, A.2    Scutellà, M.G.3
  • 6
    • 67349235349 scopus 로고    scopus 로고
    • A unified exact method for solving different classes of vehicle routing problems
    • Baldacci R., and Mingozzi A. A unified exact method for solving different classes of vehicle routing problems Mathematical Programming 120 2009 347 380
    • (2009) Mathematical Programming , vol.120 , pp. 347-380
    • Baldacci, R.1    Mingozzi, A.2
  • 7
    • 0000325698 scopus 로고
    • Integer programming: Methods, uses, computation
    • Balinski M.L. Integer programming: Methods, uses, computation Management Science 12 1965 253 313
    • (1965) Management Science , vol.12 , pp. 253-313
    • Balinski, M.L.1
  • 10
    • 70449650344 scopus 로고    scopus 로고
    • An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle routing problem with time windows
    • Bräysy O., Dullaert W., Hasle G., Mester D., and Gendreau M. An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle routing problem with time windows Transportation Science 42 2008 371 386
    • (2008) Transportation Science , vol.42 , pp. 371-386
    • Bräysy, O.1    Dullaert, W.2    Hasle, G.3    Mester, D.4    Gendreau, M.5
  • 12
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568 581
    • (1964) Operations Research , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 14
    • 70449652437 scopus 로고    scopus 로고
    • Heuristic approaches for the fleet size and mix vehicle routing problem with time windows
    • Dell'Amico M., Monaci M., Pagani C., and Vigo D. Heuristic approaches for the fleet size and mix vehicle routing problem with time windows Transportation Science 41 2007 516 526
    • (2007) Transportation Science , vol.41 , pp. 516-526
    • Dell'Amico, M.1    Monaci, M.2    Pagani, C.3    Vigo, D.4
  • 15
    • 84864633176 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for the pollution-routing problem
    • Demir E., Bektaş T., and Laporte G. An adaptive large neighborhood search heuristic for the pollution-routing problem European Journal of Operational Research 223 2012 346 359
    • (2012) European Journal of Operational Research , vol.223 , pp. 346-359
    • Demir, E.1    Bektaş, T.2    Laporte, G.3
  • 16
    • 84910134489 scopus 로고    scopus 로고
    • A survey of variants and extensions of the location-routing problem
    • Drexl M., and Schneider M. A survey of variants and extensions of the location-routing problem European Journal of Operational Research 241 2015 283 308
    • (2015) European Journal of Operational Research , vol.241 , pp. 283-308
    • Drexl, M.1    Schneider, M.2
  • 18
    • 78049449064 scopus 로고    scopus 로고
    • Efficient frameworks for greedy split and new depth first search split procedures for routing problems
    • Duhamel C., Lacomme P., and Prodhon C. Efficient frameworks for greedy split and new depth first search split procedures for routing problems Computers & Operations Research 38 2011 723 739
    • (2011) Computers & Operations Research , vol.38 , pp. 723-739
    • Duhamel, C.1    Lacomme, P.2    Prodhon, C.3
  • 20
    • 84862988333 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
    • Hemmelmayr V.C., Cordeau J.-F., and Crainic T.G. An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics Computers & Operations Research 39 2012 3215 3228
    • (2012) Computers & Operations Research , vol.39 , pp. 3215-3228
    • Hemmelmayr, V.C.1    Cordeau, J.-F.2    Crainic, T.G.3
  • 22
    • 84963788591 scopus 로고    scopus 로고
    • Four variants of the vehicle routing problem
    • P. Toth, D. Vigo, MOS-SIAM Series in Optimization Philadelphia
    • Irnich S., Schneider M., and Vigo D. Four variants of the vehicle routing problem P. Toth, D. Vigo, Vehicle routing: Problems, methods and applications 2014 MOS-SIAM Series in Optimization Philadelphia 241 271
    • (2014) Vehicle Routing: Problems, Methods and Applications , pp. 241-271
    • Irnich, S.1    Schneider, M.2    Vigo, D.3
  • 23
    • 79951678318 scopus 로고    scopus 로고
    • A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
    • Karaoglan I., Altiparmak F., Kara I., and Dengiz B. A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery European Journal of Operational Research 211 2011 318 332
    • (2011) European Journal of Operational Research , vol.211 , pp. 318-332
    • Karaoglan, I.1    Altiparmak, F.2    Kara, I.3    Dengiz, B.4
  • 24
    • 80054052743 scopus 로고    scopus 로고
    • The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach
    • Karaoglan I., Altiparmak F., Kara I., and Dengiz B. The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach Omega 40 2012 465 477
    • (2012) Omega , vol.40 , pp. 465-477
    • Karaoglan, I.1    Altiparmak, F.2    Kara, I.3    Dengiz, B.4
  • 26
    • 84930645150 scopus 로고    scopus 로고
    • A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems
    • Koç Ç., Bektaş T., Jabali O., and Laporte G. A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems Computers & Operations Research 64 2015 11 27
    • (2015) Computers & Operations Research , vol.64 , pp. 11-27
    • Koç, Ç.1    Bektaş, T.2    Jabali, O.3    Laporte, G.4
  • 28
    • 0001785441 scopus 로고
    • Location-routing problems
    • B. Golden, A. Assad, Amsterdam North-Holland
    • Laporte G. Location-routing problems B. Golden, A. Assad, Vehicle routing: Methods and studies 1988 Amsterdam North-Holland 163 198
    • (1988) Vehicle Routing: Methods and Studies , pp. 163-198
    • Laporte, G.1
  • 29
    • 0032679511 scopus 로고    scopus 로고
    • The fleet size and mix vehicle routing problem with time windows
    • Liu F.H., and Shen S.Y. The fleet size and mix vehicle routing problem with time windows Journal of the Operational Research Society 50 1999 721 732
    • (1999) Journal of the Operational Research Society , vol.50 , pp. 721-732
    • Liu, F.H.1    Shen, S.Y.2
  • 31
    • 70350565396 scopus 로고    scopus 로고
    • A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
    • Nagata Y., Bräysy O., and Dullaert W. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows Computers & Operations Research 37 2010 724 737
    • (2010) Computers & Operations Research , vol.37 , pp. 724-737
    • Nagata, Y.1    Bräysy, O.2    Dullaert, W.3
  • 33
    • 33748549934 scopus 로고    scopus 로고
    • Solving the capacitated locationrouting problem by a grasp complemented by a learning process and a path relinking
    • Prins C., Prodhon C., and Wolfler Calvo R. Solving the capacitated locationrouting problem by a grasp complemented by a learning process and a path relinking 4OR: A Quarterly Journal of Operations Research 4 2006 221 238
    • (2006) 4OR: A Quarterly Journal of Operations Research , vol.4 , pp. 221-238
    • Prins, C.1    Prodhon, C.2    Wolfler Calvo, R.3
  • 37
    • 77953359101 scopus 로고    scopus 로고
    • Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming
    • Repoussis P.P., and Tarantilis C.D. Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming Transportation Research Part C: Emerging Technologies 18 2010 695 712
    • (2010) Transportation Research Part C: Emerging Technologies , vol.18 , pp. 695-712
    • Repoussis, P.P.1    Tarantilis, C.D.2
  • 38
    • 33751011598 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
    • Ropke S., and Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transportation Science 40 2006 455 472
    • (2006) Transportation Science , vol.40 , pp. 455-472
    • Ropke, S.1    Pisinger, D.2
  • 39
    • 31144472823 scopus 로고    scopus 로고
    • A unified heuristic for a large class of vehicle routing problems with backhauls
    • Ropke S., and Pisinger D. A unified heuristic for a large class of vehicle routing problems with backhauls European Journal of Operational Research 171 2006 750 775
    • (2006) European Journal of Operational Research , vol.171 , pp. 750-775
    • Ropke, S.1    Pisinger, D.2
  • 40
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 1987 254 265
    • (1987) Operations Research , vol.35 , pp. 254-265
    • Solomon, M.M.1
  • 42
    • 0037508872 scopus 로고
    • The relationship between transportation costs and location rent in transportation problems
    • Von Boventer E. The relationship between transportation costs and location rent in transportation problems Journal of Regional Science 3 1961 27 40
    • (1961) Journal of Regional Science , vol.3 , pp. 27-40
    • Von Boventer, E.1
  • 43
    • 0036722144 scopus 로고    scopus 로고
    • Heuristic solutions to multi-depot location-routing problems
    • Wu T.H., Low C., and Bai J.W. Heuristic solutions to multi-depot location-routing problems Computers & Operations Research 29 2002 1393 1415
    • (2002) Computers & Operations Research , vol.29 , pp. 1393-1415
    • Wu, T.H.1    Low, C.2    Bai, J.W.3


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