메뉴 건너뛰기




Volumn 39, Issue 8, 2012, Pages 6807-6815

Multiple phase neighborhood search-GRASP for the capacitated vehicle routing problem

Author keywords

Expanding Neighborhood Search; Greedy Randomized Adaptive Search Procedure; Langrangean Relaxation; Vehicle Routing Problem

Indexed keywords

AVERAGE VALUES; CAPACITATED VEHICLE ROUTING PROBLEM; COMPUTATIONAL TIME; EFFICIENT ALGORITHM; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; LAGRANGEAN RELAXATION; LANGRANGEAN RELAXATION; LOCAL OPTIMA; LOCAL SEARCH; LOCAL SEARCH STRATEGY; META HEURISTIC ALGORITHM; NEIGHBORHOOD SEARCH; NEW STRATEGY; OPTIMUM VALUE; SOLUTION QUALITY; STOPPING CRITERIA; SUB-GRADIENT OPTIMIZATION; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

EID: 84857657847     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2012.01.015     Document Type: Article
Times cited : (51)

References (72)
  • 1
    • 79952442619 scopus 로고    scopus 로고
    • A self-adaptive local search algorithm for the classical vehicle routing problem
    • doi: 10.1016/j.eswa.2011.01.116.
    • C. Alabas-Uslu, and B. Dengiz A self-adaptive local search algorithm for the classical vehicle routing problem Expert Systems with Applications 2011 doi: 10.1016/j.eswa.2011.01.116.
    • (2011) Expert Systems with Applications
    • Alabas-Uslu, C.1    Dengiz, B.2
  • 2
    • 0000592377 scopus 로고
    • Parallel savings based heuristics for the delivery problem
    • K. Altinkemer, and B. Gavish Parallel savings based heuristics for the delivery problem Operations Research 39 3 1991 456 469
    • (1991) Operations Research , vol.39 , Issue.3 , pp. 456-469
    • Altinkemer, K.1    Gavish, B.2
  • 3
    • 0037395316 scopus 로고    scopus 로고
    • A genetic algorithm for the vehicle routing problem
    • B.M. Baker, and M.A. Ayechew A genetic algorithm for the vehicle routing problem Computers and Operations Research 30 5 2003 787 800
    • (2003) Computers and Operations Research , vol.30 , Issue.5 , pp. 787-800
    • Baker, B.M.1    Ayechew, M.A.2
  • 4
  • 6
    • 0019572346 scopus 로고
    • Classification in vehicle routing and scheduling
    • L. Bodin, and B. Golden Classification in vehicle routing and scheduling Networks 11 1981 97 108
    • (1981) Networks , vol.11 , pp. 97-108
    • Bodin, L.1    Golden, B.2
  • 7
    • 0020504118 scopus 로고
    • The state of the art in the routing and scheduling of vehicles and crews
    • L. Bodin, B. Golden, A. Assad, and M. Ball The state of the art in the routing and scheduling of vehicles and crews Computers and Operations Research 10 1983 63 212
    • (1983) Computers and Operations Research , vol.10 , pp. 63-212
    • Bodin, L.1    Golden, B.2    Assad, A.3    Ball, M.4
  • 8
    • 0001574219 scopus 로고
    • A location based heuristic for general routing problems
    • J.B. Bramel, and D. Simchi-Levi A location based heuristic for general routing problems Operations Research 43 1995 649 660
    • (1995) Operations Research , vol.43 , pp. 649-660
    • Bramel, J.B.1    Simchi-Levi, D.2
  • 10
    • 71749092006 scopus 로고    scopus 로고
    • Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem
    • P. Chen, H.K. Huang, and X.Y. Dong Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem Expert Systems with Applications 37 2010 1620 1627
    • (2010) Expert Systems with Applications , vol.37 , pp. 1620-1627
    • Chen, P.1    Huang, H.K.2    Dong, X.Y.3
  • 11
    • 0001208905 scopus 로고
    • The vehicle routing problem
    • N. Christofides, A. Mingozzi, P. Toth, C. Sandi, Wiley Chichester
    • N. Christofides, A. Mingozzi, and P. Toth The vehicle routing problem N. Christofides, A. Mingozzi, P. Toth, C. Sandi, Combinatorial optimization 1979 Wiley Chichester
    • (1979) Combinatorial Optimization
    • Christofides, N.1    Mingozzi, A.2    Toth, P.3
  • 12
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • G. Clarke, and J. Wright 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.2
  • 18
    • 0028461566 scopus 로고
    • Optimal solution of vehicle routing problems using K-trees
    • M.L. Fisher Optimal solution of vehicle routing problems using K-trees Operations Research 42 4 1994 626 646
    • (1994) Operations Research , vol.42 , Issue.4 , pp. 626-646
    • Fisher, M.L.1
  • 20
    • 0019574134 scopus 로고
    • A generalized assignment heuristic for vehicle routing
    • M.L. Fisher, and R. Jaikumar A generalized assignment heuristic for vehicle routing Networks 11 1981 109 124
    • (1981) Networks , vol.11 , pp. 109-124
    • Fisher, M.L.1    Jaikumar, R.2
  • 21
    • 0017150934 scopus 로고
    • An integer programming approach to the vehicle scheduling problem
    • B.A. Foster, and D.M. Ryan An integer programming approach to the vehicle scheduling problem Operations Research 27 1976 367 384
    • (1976) Operations Research , vol.27 , pp. 367-384
    • Foster, B.A.1    Ryan, D.M.2
  • 23
    • 0028530194 scopus 로고
    • A tabu search heuristic for the vehicle routing problem
    • M. Gendreau, A. Hertz, and G. Laporte A tabu search heuristic for the vehicle routing problem Management Science 40 1994 1276 1290
    • (1994) Management Science , vol.40 , pp. 1276-1290
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 26
    • 0001535867 scopus 로고
    • A heuristic algorithm for the vehicle dispatch problem
    • B.E. Gillett, and L.R. Miller A heuristic algorithm for the vehicle dispatch problem Operations Research 22 1974 240 349
    • (1974) Operations Research , vol.22 , pp. 240-349
    • Gillett, B.E.1    Miller, L.R.2
  • 28
    • 0001799407 scopus 로고    scopus 로고
    • The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results
    • Kluwer Academic Publishers Boston
    • 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 Fleet management and logistics 1998 Kluwer Academic Publishers Boston 3 56
    • (1998) Fleet Management and Logistics , pp. 3-56
    • Golden, B.L.1    Wasil, E.A.2    Kelly, J.P.3    Chao, I.M.4
  • 34
    • 7544224084 scopus 로고    scopus 로고
    • Very large-scale vehicle routing: New test problems, algorithms and results
    • F. Li, B. Golden, and E. Wasil Very large-scale vehicle routing: new test problems, algorithms and results Computers and Operations Research 32 5 2005 1165 1179
    • (2005) Computers and Operations Research , vol.32 , Issue.5 , pp. 1165-1179
    • Li, F.1    Golden, B.2    Wasil, E.3
  • 35
    • 84908780328 scopus 로고
    • Computer solutions of the traveling salesman problem
    • S. Lin Computer solutions of the traveling salesman problem Bell Systems Technical Journal 44 1965 2245 2269
    • (1965) Bell Systems Technical Journal , vol.44 , pp. 2245-2269
    • Lin, S.1
  • 36
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling salesman problem
    • S. Lin, and B.W. Kernighan An effective heuristic algorithm for the traveling salesman problem Operation Research 21 1973 498 516
    • (1973) Operation Research , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2
  • 37
    • 56649112895 scopus 로고    scopus 로고
    • Applying hybrid meta-heuristics for capacitated vehicle routing problem
    • S.W. Lin, Z.J. Lee, K.C. Ying, and C.Y. Lee Applying hybrid meta-heuristics for capacitated vehicle routing problem Expert Systems with Applications 36 2009 1505 1512
    • (2009) Expert Systems with Applications , vol.36 , pp. 1505-1512
    • Lin, S.W.1    Lee, Z.J.2    Ying, K.C.3    Lee, C.Y.4
  • 38
    • 71749086093 scopus 로고    scopus 로고
    • A hybrid genetic - Particle swarm optimization algorithm for the vehicle routing problem
    • Y. Marinakis, and M. Marinaki A hybrid genetic - Particle swarm optimization algorithm for the vehicle routing problem Expert Systems with Applications 37 2010 1446 1455
    • (2010) Expert Systems with Applications , vol.37 , pp. 1446-1455
    • Marinakis, Y.1    Marinaki, M.2
  • 39
    • 14044256887 scopus 로고    scopus 로고
    • Heuristic solutions of vehicle routing problems in supply chain management
    • P.M. Pardalos, A. Migdalas, R. Burkard, World Scientific Publishing Co.
    • Y. Marinakis, and A. Migdalas Heuristic solutions of vehicle routing problems in supply chain management P.M. Pardalos, A. Migdalas, R. Burkard, Combinatorial and global optimization 2002 World Scientific Publishing Co. 205 236
    • (2002) Combinatorial and Global Optimization , pp. 205-236
    • Marinakis, Y.1    Migdalas, A.2
  • 42
    • 77949917583 scopus 로고    scopus 로고
    • Honey bees mating optimization algorithm for large scale vehicle routing problems
    • Y. Marinakis, M. Marinaki, and G. Dounias Honey bees mating optimization algorithm for large scale vehicle routing problems Natural Computing 9 2010 5 27
    • (2010) Natural Computing , vol.9 , pp. 5-27
    • Marinakis, Y.1    Marinaki, M.2    Dounias, G.3
  • 44
    • 27844516526 scopus 로고    scopus 로고
    • A hybrid genetic-GRASP algorithm using Langrangean relaxation for the traveling salesman problem
    • Y. Marinakis, A. Migdalas, and P.M. Pardalos A hybrid genetic-GRASP algorithm using Langrangean relaxation for the traveling salesman problem Journal of Combinatorial Optimization 10 2005 311 326
    • (2005) Journal of Combinatorial Optimization , vol.10 , pp. 311-326
    • Marinakis, Y.1    Migdalas, A.2    Pardalos, P.M.3
  • 45
    • 34250896800 scopus 로고    scopus 로고
    • A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
    • Y. Marinakis, A. Migdalas, and P.M. Pardalos A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm Journal of Global Optimization 38 2007 555 580
    • (2007) Journal of Global Optimization , vol.38 , pp. 555-580
    • Marinakis, Y.1    Migdalas, A.2    Pardalos, P.M.3
  • 46
    • 58349114279 scopus 로고    scopus 로고
    • Multiple phase neighborhood search GRASP based on Lagrangean relaxation and random backtracking lin kernighan for the traveling salesman problem
    • Y. Marinakis, A. Migdalas, and P.M. Pardalos Multiple phase neighborhood search GRASP based on Lagrangean relaxation and random backtracking lin kernighan for the traveling salesman problem Journal of Combinatorial Optimization 17 2008 134 156
    • (2008) Journal of Combinatorial Optimization , vol.17 , pp. 134-156
    • Marinakis, Y.1    Migdalas, A.2    Pardalos, P.M.3
  • 47
    • 9544247744 scopus 로고    scopus 로고
    • Active guided evolution strategies for the large scale vehicle routing problems with time windows
    • D. Mester, and O. Braysy Active guided evolution strategies for the large scale vehicle routing problems with time windows Computers and Operations Research 32 2005 1593 1614
    • (2005) Computers and Operations Research , vol.32 , pp. 1593-1614
    • Mester, D.1    Braysy, O.2
  • 48
    • 33847671359 scopus 로고    scopus 로고
    • Active guided evolution strategies for large scale capacitated vehicle routing problems
    • D. Mester, and O. Braysy Active guided evolution strategies for large scale capacitated vehicle routing problems Computers and Operations Research 34 2007 2964 2975
    • (2007) Computers and Operations Research , vol.34 , pp. 2964-2975
    • Mester, D.1    Braysy, O.2
  • 49
    • 33750489025 scopus 로고    scopus 로고
    • A multi-parametric evolution strategies algorithm for vehicle routing problems
    • D. Mester, O. Braysy, and W. Dullaert A multi-parametric evolution strategies algorithm for vehicle routing problems Expert Systems with Applications 32 2007 508 517
    • (2007) Expert Systems with Applications , vol.32 , pp. 508-517
    • Mester, D.1    Braysy, O.2    Dullaert, W.3
  • 50
    • 0017151741 scopus 로고
    • A sequential route-building algorithm employing a generalized savings criterion
    • R.H. Mole, and S.R. Jameson A sequential route-building algorithm employing a generalized savings criterion Operational Research Quarterly 27 1976 503 511
    • (1976) Operational Research Quarterly , vol.27 , pp. 503-511
    • Mole, R.H.1    Jameson, S.R.2
  • 51
    • 21144460138 scopus 로고
    • Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems
    • I.H. Osman Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems Annals of Operations Research 41 1993 421 451
    • (1993) Annals of Operations Research , vol.41 , pp. 421-451
    • Osman, I.H.1
  • 52
    • 77955238837 scopus 로고    scopus 로고
    • Bio-inspired algorithms for the vehicle routing problem
    • Springer Berlin Heideberg
    • F.B. Pereira, and J. Tavares Bio-inspired algorithms for the vehicle routing problem Studies in computational intelligence 161 2008 Springer Berlin Heideberg
    • (2008) Studies in Computational Intelligence , vol.161
    • Pereira, F.B.1    Tavares, J.2
  • 53
    • 33846068585 scopus 로고    scopus 로고
    • A general heuristic for vehicle routing problems
    • D. Pisinger, and S. Ropke A general heuristic for vehicle routing problems Computers and Operations Research 34 2007 2403 2435
    • (2007) Computers and Operations Research , vol.34 , pp. 2403-2435
    • Pisinger, D.1    Ropke, S.2
  • 54
    • 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 and Operations Research 31 2004 1985 2002
    • (2004) Computers and Operations Research , vol.31 , pp. 1985-2002
    • Prins, C.1
  • 55
    • 51849120602 scopus 로고    scopus 로고
    • A GRASP × evolutionary local search hybrid for the vehicle routing problem
    • F.B. Pereira, J. Tavares, Springer Berlin, Heideberg
    • C. Prins A GRASP × evolutionary local search hybrid for the vehicle routing problem F.B. Pereira, J. Tavares, Bio-inspired algorithms for the vehicle routing problem, SCI 161 2008 Springer Berlin, Heideberg 35 53
    • (2008) Bio-inspired Algorithms for the Vehicle Routing Problem, SCI , vol.161 , pp. 35-53
    • Prins, C.1
  • 56
    • 0032181671 scopus 로고    scopus 로고
    • A subpath ejection method for the vehicle routing problem
    • C. Rego A subpath ejection method for the vehicle routing problem Management Science 44 1998 1447 1459
    • (1998) Management Science , vol.44 , pp. 1447-1459
    • Rego, C.1
  • 57
    • 0035247978 scopus 로고    scopus 로고
    • Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
    • C. Rego Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms Parallel Computing 27 3 2001 201 222
    • (2001) Parallel Computing , vol.27 , Issue.3 , pp. 201-222
    • Rego, C.1
  • 59
    • 0346009088 scopus 로고    scopus 로고
    • D-ants: Savings based ants divide and conquer the vehicle routing problem
    • M. Reimann, K. Doerner, and R.F. Hartl D-ants: Savings based ants divide and conquer the vehicle routing problem Computers and Operations Research 31 4 2004 563 591
    • (2004) Computers and Operations Research , vol.31 , Issue.4 , pp. 563-591
    • Reimann, M.1    Doerner, K.2    Hartl, R.F.3
  • 60
    • 0012587086 scopus 로고    scopus 로고
    • Greedy randomized adaptive search procedures
    • F. Glover, G.A. Kochenberger, Kluwer Academic Publishers Boston
    • M.G.C. Resende, and C.C. Ribeiro Greedy randomized adaptive search procedures F. Glover, G.A. Kochenberger, Handbook of metaheuristics 2003 Kluwer Academic Publishers Boston 19 249
    • (2003) Handbook of Metaheuristics , pp. 19-249
    • Resende, M.G.C.1    Ribeiro, C.C.2
  • 61
    • 0029362478 scopus 로고
    • Probabilistic diversification and intensification in local search for vehicle routing
    • Y. Rochat, and E.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, E.D.2
  • 62
    • 33845512751 scopus 로고
    • Parallel iterative search methods for vehicle routing problems
    • E.D. Taillard Parallel iterative search methods for vehicle routing problems Networks 23 1993 661 672
    • (1993) Networks , vol.23 , pp. 661-672
    • Taillard, E.D.1
  • 63
    • 12244261649 scopus 로고    scopus 로고
    • Solving the vehicle routing problem with adaptive memory programming methodology
    • C.D. Tarantilis Solving the vehicle routing problem with adaptive memory programming methodology Computers and Operations Research 32 9 2005 2309 2327
    • (2005) Computers and Operations Research , vol.32 , Issue.9 , pp. 2309-2327
    • Tarantilis, C.D.1
  • 64
    • 0036439090 scopus 로고    scopus 로고
    • BoneRoute: An adaptive memory-based method for effective fleet management
    • C.D. Tarantilis, and C.T. Kiranoudis BoneRoute: An adaptive memory-based method for effective fleet management Annals of Operations Research 115 1 2002 227 241
    • (2002) Annals of Operations Research , vol.115 , Issue.1 , pp. 227-241
    • Tarantilis, C.D.1    Kiranoudis, C.T.2
  • 68
    • 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 348
    • (2003) INFORMS Journal on Computing , vol.15 , Issue.4 , pp. 333-348
    • Toth, P.1    Vigo, D.2
  • 69
    • 56349124140 scopus 로고    scopus 로고
    • A hybrid genetic algorithm that optimizes capacitated vehicle routing problems
    • C.H. Wang, and J.Z. Lu A hybrid genetic algorithm that optimizes capacitated vehicle routing problems Expert Systems with Applications 36 2009 2921 2936
    • (2009) Expert Systems with Applications , vol.36 , pp. 2921-2936
    • Wang, C.H.1    Lu, J.Z.2
  • 70
    • 0028516902 scopus 로고
    • A repeated matching heuristic for the vehicle routing problem
    • P. Wark, and J. Holt A repeated matching heuristic for the vehicle routing problem Journal of the Operational Research Society 45 1994 1156 1167
    • (1994) Journal of the Operational Research Society , vol.45 , pp. 1156-1167
    • Wark, P.1    Holt, J.2
  • 71
    • 0030287112 scopus 로고    scopus 로고
    • A new network flow-based tabu search heuristic for the vehicle routing problem
    • J. Xu, and J.P. Kelly A new network flow-based tabu search heuristic for the vehicle routing problem Transportation Science 30 1996 379 393
    • (1996) Transportation Science , vol.30 , pp. 379-393
    • Xu, J.1    Kelly, J.P.2
  • 72
    • 71349087430 scopus 로고    scopus 로고
    • A new hybrid electromagnetism-like algorithm for capacitated vehicle routing problems
    • A. Yurtkuran, and E. Emel A new hybrid electromagnetism-like algorithm for capacitated vehicle routing problems Expert Systems with Applications 37 2010 3427 3433
    • (2010) Expert Systems with Applications , vol.37 , pp. 3427-3433
    • Yurtkuran, A.1    Emel, E.2


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