메뉴 건너뛰기




Volumn 40, Issue 10, 2013, Pages 2519-2531

A hybrid algorithm for a class of vehicle routing problems

Author keywords

Iterated Local Search; Matheuristic; Set Partitioning; Vehicle Routing Problems

Indexed keywords

ITERATED LOCAL SEARCH; MATHEURISTIC; META-HEURISTIC APPROACH; MIXED INTEGER PROGRAMMING (MIP); PICKUP AND DELIVERY; SET PARTITIONING; SIMULTANEOUS PICKUP AND DELIVERIES; VEHICLE ROUTING PROBLEMS;

EID: 84879055762     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.01.013     Document Type: Article
Times cited : (234)

References (46)
  • 3
    • 29044449517 scopus 로고    scopus 로고
    • A new ILP-based refinement heuristic for vehicle routing problems
    • DOI 10.1007/s10107-005-0662-8
    • R. De Franceschi, M. Fischetti, and P. Toth A new ILP-based refinement heuristic for vehicle routing problems Mathematical Programming 105 2-3 2006 471 499 (Pubitemid 41788330)
    • (2006) Mathematical Programming , vol.105 , Issue.2-3 , pp. 471-499
    • De Franceschi, R.1    Fischetti, M.2    Toth, P.3
  • 4
    • 33749651515 scopus 로고    scopus 로고
    • A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
    • DOI 10.1016/j.cor.2005.07.025, PII S0305054805002376
    • 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 (Pubitemid 44556982)
    • (2007) Computers and Operations Research , vol.34 , Issue.6 SPEC. ISS. , pp. 1561-1584
    • Alvarenga, G.B.1    Mateus, G.R.2    De Tomi, G.3
  • 6
    • 33846068585 scopus 로고    scopus 로고
    • A general heuristic for vehicle routing problems
    • DOI 10.1016/j.cor.2005.09.012, PII S0305054805003023
    • D. Pisinger, and S. Røpke A general heuristic for vehicle routing problems Computers & Operations Research 34 8 2007 2403 2435 (Pubitemid 46073431)
    • (2007) Computers and Operations Research , vol.34 , Issue.8 , pp. 2403-2435
    • Pisinger, D.1    Ropke, S.2
  • 7
    • 31144472823 scopus 로고    scopus 로고
    • A unified heuristic for a large class of Vehicle Routing Problems with Backhauls
    • DOI 10.1016/j.ejor.2004.09.004, PII S0377221704005831, Feature Cluster: Heuristic and Stochastic Methods in Optimization
    • S. Røpke, 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 (Pubitemid 43132944)
    • (2006) European Journal of Operational Research , vol.171 , Issue.3 , pp. 750-775
    • Ropke, S.1    Pisinger, D.2
  • 9
    • 84864700477 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems
    • T. Vidal, T.G. 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.G.2    Gendreau, M.3    Lahrichi, N.4    Rei, W.5
  • 12
    • 0000208259 scopus 로고    scopus 로고
    • A set-partitioning-based heuristic for the vehicle routing problem
    • J.P. Kelly, and J. Xu A set-partitioning-based heuristic for the vehicle routing problem INFORMS Journal on Computing 11 2 1999 161 172
    • (1999) INFORMS Journal on Computing , vol.11 , Issue.2 , pp. 161-172
    • Kelly, J.P.1    Xu, J.2
  • 13
    • 0029362478 scopus 로고
    • Probabilistic diversification and intensification in local search for vehicle routing
    • Y. Rochat, and R.D. 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, R.D.2
  • 16
    • 33847671359 scopus 로고    scopus 로고
    • Active-guided evolution strategies for large-scale capacitated vehicle routing problems
    • DOI 10.1016/j.cor.2005.11.006, PII S0305054805003552
    • 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 (Pubitemid 46356733)
    • (2007) Computers and Operations Research , vol.34 , Issue.10 , pp. 2964-2975
    • Mester, D.1    Braysy, O.2
  • 17
    • 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
  • 18
    • 77955238232 scopus 로고    scopus 로고
    • A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem
    • E.E. Zachariadis, and C.T. 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.E.1    Kiranoudis, C.T.2
  • 19
    • 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
  • 21
    • 56349100703 scopus 로고    scopus 로고
    • A variable neighbourhood search algorithm for the open vehicle routing problem
    • K. Fleszar, I.H. Osman, and K.S. 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.H.2    Hindi, K.S.3
  • 23
    • 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
  • 25
    • 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
  • 26
    • 80053289290 scopus 로고    scopus 로고
    • A hybrid heuristic, based on iterated local search and GENIUS, for the vehicle routing problem with simultaneous pickup and delivery
    • M.J.F. Souza, M.S.A. Silva, M.T. Mine, L.S. Ochi, and A. Subramanian A hybrid heuristic, based on iterated local search and GENIUS, for the vehicle routing problem with simultaneous pickup and delivery International Journal of Logistics Systems Management 10 2 2010 142 156
    • (2010) International Journal of Logistics Systems Management , vol.10 , Issue.2 , pp. 142-156
    • Souza, M.J.F.1    Silva, M.S.A.2    Mine, M.T.3    Ochi, L.S.4    Subramanian, A.5
  • 27
    • 67349254472 scopus 로고    scopus 로고
    • An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
    • Y. Gajpal, and P. Abad An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup Computers & Operations Research 36 12 2009 3215 3223
    • (2009) Computers & Operations Research , vol.36 , Issue.12 , pp. 3215-3223
    • Gajpal, Y.1    Abad, P.2
  • 28
    • 84896392766 scopus 로고    scopus 로고
    • An iterated local search heuristic for the heterogenous fleet vehicle routing problem
    • in press
    • Penna PHV, Subramanian A, Ochi LS. An iterated local search heuristic for the heterogenous fleet vehicle routing problem, Journal of Heuristics, 10.1007/s10732-011-9186-y, in press.
    • Journal of Heuristics
    • Phv, P.1    Subramanian, A.2    Ochi, L.S.3
  • 30
    • 84873911958 scopus 로고    scopus 로고
    • An iterated local search algorithm for the travelling salesman problem with pickups and deliveries
    • A. Subramanian, and M. Battarra An iterated local search algorithm for the travelling salesman problem with pickups and deliveries Journal of the Operational Research Society 64 2013 402 409
    • (2013) Journal of the Operational Research Society , vol.64 , pp. 402-409
    • Subramanian, A.1    Battarra, M.2
  • 31
    • 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 1-4 1993 421 451
    • (1993) Annals of Operations Research , vol.41 , Issue.14 , pp. 421-451
    • Osman, I.H.1
  • 32
    • 0031139685 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with soft time windows
    • E. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin A tabu search heuristic for the vehicle routing problem with soft time windows Transportation Science 31 1997 170 186 (Pubitemid 127597092)
    • (1997) Transportation Science , vol.31 , Issue.2 , pp. 170-186
    • Taillard, E.1    Badeau, P.2    Gendreau, M.3    Guertin, F.4    Potvin, J.-Y.5
  • 34
    • 0001237146 scopus 로고
    • A method for solving traveling salesman problems
    • G.A. Croes A method for solving traveling salesman problems Operations Research 6 1958 791 812
    • (1958) Operations Research , vol.6 , pp. 791-812
    • Croes, G.A.1
  • 39
    • 0028461566 scopus 로고
    • Optimal solutions of vehicle routing problems using minimum K-trees
    • M. Fisher Optimal solutions of vehicle routing problems using minimum K-trees Operations Research 42 1994 626 642
    • (1994) Operations Research , vol.42 , pp. 626-642
    • Fisher, M.1
  • 40
    • 33847667936 scopus 로고    scopus 로고
    • The open vehicle routing problem: Algorithms, large-scale test problems, and computational results
    • DOI 10.1016/j.cor.2005.11.018, PII S0305054805003515
    • 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 (Pubitemid 46356729)
    • (2007) Computers and Operations Research , vol.34 , Issue.10 , pp. 2918-2930
    • Li, F.1    Golden, B.2    Wasil, E.3
  • 41
    • 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 1999 1034 1042 (Pubitemid 129596355)
    • (1999) Journal of the Operational Research Society , vol.50 , Issue.10 , pp. 1034-1042
    • Salhi, S.1    Nagy, G.2
  • 42
    • 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
  • 43
    • 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.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 (Pubitemid 41101115)
    • (2006) Computers and Operations Research , vol.33 , Issue.3 , pp. 595-619
    • Montane, F.A.T.1    Galvao, R.D.2
  • 44
    • 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 (Pubitemid 127360996)
    • (1997) Networks , vol.30 , Issue.2 , pp. 105-119
    • Cordeau, J.-F.1    Gendreau, M.2    Laporte, G.3
  • 45
    • 33846580155 scopus 로고    scopus 로고
    • A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
    • DOI 10.1016/j.cor.2005.10.015, PII S0305054805003382
    • F. Li, B. Golden, and E. Wasil A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem Computers and Operations Research 34 2007 2734 2742 (Pubitemid 46176403)
    • (2007) Computers and Operations Research , vol.34 , Issue.9 , pp. 2734-2742
    • Li, F.1    Golden, B.2    Wasil, E.3
  • 46
    • 0030109346 scopus 로고    scopus 로고
    • A tabu search heuristic for the multi-depot vehicle routing problem
    • J. Renaud, G. Laporte, and F.F. Boctor A tabu search heuristic for the multi-depot vehicle routing problem Computers & Operations Research 23 3 1996 229 235.
    • (1996) Computers & Operations Research , vol.23 , Issue.3 , pp. 229-235
    • Renaud, J.1    Laporte, G.2    Boctor, F.F.3


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