메뉴 건너뛰기




Volumn 41, Issue 1, 2014, Pages 167-173

An adaptive large neighborhood search for a vehicle routing problem with multiple routes

Author keywords

Adaptive large neighborhood search; Multi level; Multiple routes; Ruin and recreate; Vehicle routing

Indexed keywords

ADAPTIVE LARGE NEIGHBORHOOD SEARCHES; COMPUTATIONAL RESULTS; EUCLIDEAN INSTANCES; MULTI-LEVEL; MULTIPLE ROUTES; RECONSTRUCTION OPERATORS; RUIN-AND-RECREATE; VEHICLE ROUTING PROBLEMS;

EID: 84883491303     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.08.016     Document Type: Article
Times cited : (146)

References (22)
  • 1
    • 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 2008 963 976
    • (2008) Journal of the Operational Research Society , vol.59 , pp. 963-976
    • Alonso, F.1    Alvarez, M.J.2    Beasley, J.E.3
  • 2
    • 70350564194 scopus 로고    scopus 로고
    • An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
    • N. Azi, M. Gendreau, and J.-Y. Potvin An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles European Journal of Operational Research 202 2010 756 763
    • (2010) European Journal of Operational Research , vol.202 , pp. 756-763
    • Azi, N.1    Gendreau, M.2    Potvin, J.-Y.3
  • 3
    • 64549093697 scopus 로고    scopus 로고
    • An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
    • M. Battarra, M. Monaci, and D. Vigo An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem Computers & Operation Research 36 2009 3041 3050
    • (2009) Computers & Operation Research , vol.36 , pp. 3041-3050
    • Battarra, M.1    Monaci, M.2    Vigo, D.3
  • 5
    • 0031186464 scopus 로고    scopus 로고
    • A Tabu search algorithm for the multi-trip vehicle routing and scheduling problem
    • J. Brandão, and A. Mercer A Tabu search algorithm for the multi-trip vehicle routing and scheduling problem European Journal of Operational Research 100 1997 180 191
    • (1997) European Journal of Operational Research , vol.100 , pp. 180-191
    • Brandão, J.1    Mercer, A.2
  • 6
    • 25144435942 scopus 로고    scopus 로고
    • Decision support for consumer direct grocery initiatives
    • A.M. Campbell, and M. Savelsbergh Decision support for consumer direct grocery initiatives Transportation Science 39 2005 313 327
    • (2005) Transportation Science , vol.39 , pp. 313-327
    • Campbell, A.M.1    Savelsbergh, M.2
  • 10
    • 0037411888 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows and a limited number of vehicles
    • H.C. Lau, M. Sim, and K. Teo Vehicle routing problem with time windows and a limited number of vehicles European Journal of Operational Research 148 2003 559 569
    • (2003) European Journal of Operational Research , vol.148 , pp. 559-569
    • Lau, H.C.1    Sim, M.2    Teo, K.3
  • 11
    • 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 2007 28 47
    • (2007) Computers & Operations Research , vol.34 , pp. 28-47
    • Olivera, A.1    Viera, O.2
  • 12
    • 0242366703 scopus 로고    scopus 로고
    • A multi-phase constructive heuristic for the vehicle routing problem with multiple trips
    • R.J. Petch, and S. Salhi A multi-phase constructive heuristic for the vehicle routing problem with multiple trips Discrete Applied Mathematics 133 2003 69 92
    • (2003) Discrete Applied Mathematics , vol.133 , pp. 69-92
    • Petch, R.J.1    Salhi, S.2
  • 13
    • 36549063541 scopus 로고    scopus 로고
    • A GA based heuristic for the vehicle routing problem with multiple trips
    • R.J. Petch, and S. Salhi A GA based heuristic for the vehicle routing problem with multiple trips Journal of Mathematical Modelling and Algorithms 6 2007 591 613
    • (2007) Journal of Mathematical Modelling and Algorithms , vol.6 , pp. 591-613
    • Petch, R.J.1    Salhi, S.2
  • 14
    • 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 2007 2403 2435
    • (2007) Computers & Operations Research , vol.34 , pp. 2403-2435
    • Pisinger, D.1    Ropke, S.2
  • 15
    • 78650399170 scopus 로고    scopus 로고
    • Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier
    • J.-Y. Potvin, and M.-A. Naud Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier Journal of the Operational Research Society 62 2011 326 336
    • (2011) Journal of the Operational Research Society , vol.62 , pp. 326-336
    • Potvin, J.-Y.1    Naud, M.-A.2
  • 16
    • 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 1995 147 167
    • (1995) Journal of Heuristics , vol.1 , pp. 147-167
    • Rochat, Y.1    Taillard, E.2
  • 17
    • 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 2006 455 472
    • (2006) Transportation Science , vol.40 , pp. 455-472
    • Ropke, S.1    Pisinger, D.2
  • 18
    • 0007939495 scopus 로고    scopus 로고
    • Record breaking optimization results using the ruin and recreate principle
    • J. Schrimpf, H. Schneider, and G. Dueck Record breaking optimization results using the ruin and recreate principle Journal of Computational Physics 159 2000 139 171
    • (2000) Journal of Computational Physics , vol.159 , pp. 139-171
    • Schrimpf, J.1    Schneider, H.2    Dueck, G.3
  • 19
    • 84957372764 scopus 로고    scopus 로고
    • Using constraint programming and local search methods to solve vehicle routing problems
    • G. Goos, J. Hartmanis, J. van Leeuwen
    • P. Shaw Using constraint programming and local search methods to solve vehicle routing problems G. Goos, J. Hartmanis, J. van Leeuwen, Principles and practice of constraint programming - CP98, Lecture notes in computer science vol. 1520 1998 417 431
    • (1998) Principles and Practice of Constraint Programming - CP98, Lecture Notes in Computer Science , vol.1520 VOL. , pp. 417-431
    • Shaw, P.1
  • 20
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problem with time window constraints
    • M.M. Solomon Algorithms for the vehicle routing and scheduling problem with time window constraints Operations Research 35 1987 254 265
    • (1987) Operations Research , vol.35 , pp. 254-265
    • Solomon, M.M.1


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