메뉴 건너뛰기




Volumn 42, Issue , 2015, Pages 45-56

GVNS for a real-world rich vehicle routing problem with time windows

Author keywords

Fixed Heterogeneous Fleet; General Variable Neighbourhood Search; Metaheuristics; Rich VRPTW

Indexed keywords

HEURISTIC ALGORITHMS; NETWORK ROUTING; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

EID: 84961050764     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2015.03.009     Document Type: Article
Times cited : (46)

References (58)
  • 2
    • 67349235349 scopus 로고    scopus 로고
    • A unified exact method for solving different classes of vehicle routing problems
    • R. Baldacci, and A. Mingozzi A unified exact method for solving different classes of vehicle routing problems Math. Program. 120 2 2009 347 380
    • (2009) Math. Program. , vol.120 , Issue.2 , pp. 347-380
    • Baldacci, R.1    Mingozzi, A.2
  • 3
    • 63949084627 scopus 로고    scopus 로고
    • Recent advances in vehicle routing exact algorithms
    • R. Baldacci, P. Toth, and D. Vigo Recent advances in vehicle routing exact algorithms 4OR 5 4 2007 269 298
    • (2007) 4OR , vol.5 , Issue.4 , pp. 269-298
    • Baldacci, R.1    Toth, P.2    Vigo, D.3
  • 4
    • 55949112138 scopus 로고    scopus 로고
    • An algorithm for the capacitated vehicle routing problem with route balancing
    • I. Borgulya An algorithm for the capacitated vehicle routing problem with route balancing Centr. Eur. J. Oper. Res. 16 4 2008 331 344
    • (2008) Centr. Eur. J. Oper. Res. , vol.16 , Issue.4 , pp. 331-344
    • Borgulya, I.1
  • 5
    • 77956058285 scopus 로고    scopus 로고
    • A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
    • J. Brandão A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem Comput. Oper. Res. 38 1 2011 140 151
    • (2011) Comput. Oper. Res. , vol.38 , Issue.1 , pp. 140-151
    • Brandão, J.1
  • 6
    • 3843138356 scopus 로고    scopus 로고
    • A reactive variable neighborhood search for the vehicle routing problem with time windows
    • O. Bräysy A reactive variable neighborhood search for the vehicle routing problem with time windows INFORMS J. Comput. 15 2003 347 368
    • (2003) INFORMS J. Comput. , vol.15 , pp. 347-368
    • Bräysy, O.1
  • 7
    • 16244404291 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part ii metaheuristics
    • O. Bräysy, and M. Gendreau Vehicle routing problem with time windows, Part ii metaheuristics Transp. Sci. 39 1 2005 119 139
    • (2005) Transp. Sci. , vol.39 , Issue.1 , pp. 119-139
    • Bräysy, O.1    Gendreau, M.2
  • 8
    • 33750728885 scopus 로고    scopus 로고
    • A goal programming approach to vehicle routing problems with soft time windows
    • (6th International Conference on Multiple Objective Programming and Goal Programming, Hammamet, Tunisia, April 04-06, 2004)
    • H.I. Calvete, C. Gale, M.-J. Oliveros, and B. Sanchez-Valverde A goal programming approach to vehicle routing problems with soft time windows Eur. J. Oper. Res. 177 3 2007 1720 1733 (6th International Conference on Multiple Objective Programming and Goal Programming, Hammamet, Tunisia, April 04-06, 2004)
    • (2007) Eur. J. Oper. Res. , vol.177 , Issue.3 , pp. 1720-1733
    • Calvete, H.I.1    Gale, C.2    Oliveros, M.-J.3    Sanchez-Valverde, B.4
  • 10
    • 0001237146 scopus 로고
    • A method for solving traveling-salesman problems
    • G. Croes A method for solving traveling-salesman problems Oper. Res. 6 6 1958 791 812
    • (1958) Oper. Res. , vol.6 , Issue.6 , pp. 791-812
    • Croes, G.1
  • 12
    • 71849094353 scopus 로고    scopus 로고
    • Survey: The vehicle routing problem a taxonomic review
    • B. Eksioglu, A.V. Vural, and A. Reisman Survey: the vehicle routing problem a taxonomic review Comput. Ind. Eng. 57 4 2009 1472 1483
    • (2009) Comput. Ind. Eng. , vol.57 , Issue.4 , pp. 1472-1483
    • Eksioglu, B.1    Vural, A.V.2    Reisman, A.3
  • 13
    • 56349100703 scopus 로고    scopus 로고
    • A variable neighbourhood search algorithm for the open vehicle routing problem
    • K. Fleszar, I. Osman, and K. Hindi A variable neighbourhood search algorithm for the open vehicle routing problem Eur. J. Oper. Res. 195 3 2008 803 809
    • (2008) Eur. J. Oper. Res. , vol.195 , Issue.3 , pp. 803-809
    • Fleszar, K.1    Osman, I.2    Hindi, K.3
  • 14
    • 0000866856 scopus 로고
    • New insertion and postoptimization procedures for the traveling salesman problem
    • M. Gendreau, A. Hertz, and G. Laporte New insertion and postoptimization procedures for the traveling salesman problem Oper. Res. 40 6 1992 1086 1094
    • (1992) Oper. Res. , vol.40 , Issue.6 , pp. 1086-1094
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 16
    • 79952370268 scopus 로고    scopus 로고
    • Solving large-scale vehicle routing problems with time windows: The state-of-the-art
    • Gendreau, M., Tarantilis, C.D., 2010. Solving large-scale vehicle routing problems with time windows: the state-of-the-art. CIRRELT.
    • (2010) CIRRELT
    • Gendreau, M.1    Tarantilis, C.D.2
  • 17
    • 78049241435 scopus 로고    scopus 로고
    • Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm
    • K. Ghoseiri, and S.F. Ghannadpour Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm Appl. Soft Comput. 10 4 2010 1096 1107
    • (2010) Appl. Soft Comput. , vol.10 , Issue.4 , pp. 1096-1107
    • Ghoseiri, K.1    Ghannadpour, S.F.2
  • 18
    • 0022865373 scopus 로고
    • Future paths for integer programming and links to artificial intelligence
    • F. Glover Future paths for integer programming and links to artificial intelligence Comput. Oper. Res. 13 5 1986 533 549
    • (1986) Comput. Oper. Res. , vol.13 , Issue.5 , pp. 533-549
    • Glover, F.1
  • 19
    • 44649144533 scopus 로고    scopus 로고
    • A general vehicle routing problem
    • A. Goel, and V. Gruhn A general vehicle routing problem Eur. J. Oper. Res. 191 3 2008 650 660
    • (2008) Eur. J. Oper. Res. , vol.191 , Issue.3 , pp. 650-660
    • Goel, A.1    Gruhn, V.2
  • 24
    • 76849091335 scopus 로고    scopus 로고
    • Variable neighbourhood search methods and applications
    • P. Hansen, N. Mladenovic, and J.A. Moreno-Pérez Variable neighbourhood search methods and applications Ann. Oper. Res. 175 1 2010 367 407
    • (2010) Ann. Oper. Res. , vol.175 , Issue.1 , pp. 367-407
    • Hansen, P.1    Mladenovic, N.2    Moreno-Pérez, J.A.3
  • 25
    • 56349088499 scopus 로고    scopus 로고
    • A variable neighborhood search heuristic for periodic routing problems
    • V. Hemmelmayr, K. Doerner, and R. Hartl A variable neighborhood search heuristic for periodic routing problems Eur. J. Oper. Res. 195 3 2009 791 802
    • (2009) Eur. J. Oper. Res. , vol.195 , Issue.3 , pp. 791-802
    • Hemmelmayr, V.1    Doerner, K.2    Hartl, R.3
  • 26
    • 44649105042 scopus 로고    scopus 로고
    • Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks
    • H. Hoeller, B. Melian, and S. Voss Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks Eur. J. Oper. Res. 191 3 2008 691 704
    • (2008) Eur. J. Oper. Res. , vol.191 , Issue.3 , pp. 691-704
    • Hoeller, H.1    Melian, B.2    Voss, S.3
  • 27
    • 79958089424 scopus 로고    scopus 로고
    • An improved LNS algorithm for real-time vehicle routing problem with time windows
    • L. Hong An improved LNS algorithm for real-time vehicle routing problem with time windows Comput. Oper. Res. 39 2 2012 151 163
    • (2012) Comput. Oper. Res. , vol.39 , Issue.2 , pp. 151-163
    • Hong, L.1
  • 28
    • 0032646402 scopus 로고    scopus 로고
    • A heuristic for bi-objective vehicle routing with time window constraints
    • S. Hong, and Y. Park A heuristic for bi-objective vehicle routing with time window constraints Int. J. Prod. Econ. 62 3 1999 249 258
    • (1999) Int. J. Prod. Econ. , vol.62 , Issue.3 , pp. 249-258
    • Hong, S.1    Park, Y.2
  • 29
    • 19944391610 scopus 로고    scopus 로고
    • Effective local search algorithms for routing and scheduling problems with general time-window constraints
    • T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, and M. Yagiura Effective local search algorithms for routing and scheduling problems with general time-window constraints Transp. Sci. 39 2 2005 206 232
    • (2005) Transp. Sci. , vol.39 , Issue.2 , pp. 206-232
    • Ibaraki, T.1    Imahori, S.2    Kubo, M.3    Masuda, T.4    Uno, T.5    Yagiura, M.6
  • 30
    • 47549094649 scopus 로고    scopus 로고
    • An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
    • T. Ibaraki, S. Imahori, K. Nonobe, K. Sobue, T. Uno, and M. Yagiura An iterated local search algorithm for the vehicle routing problem with convex time penalty functions Discrete Appl. Math. 156 11 2008 2050 2069
    • (2008) Discrete Appl. Math. , vol.156 , Issue.11 , pp. 2050-2069
    • Ibaraki, T.1    Imahori, S.2    Nonobe, K.3    Sobue, K.4    Uno, T.5    Yagiura, M.6
  • 31
    • 84884587778 scopus 로고    scopus 로고
    • From single-objective to multi-objective vehicle routing problems motivations, case studies and methods
    • B. Golden, S. Raghavan, E. Wasil, Springer US
    • N. Jozefowiez, F. Semet, and E.G. Talbi From single-objective to multi-objective vehicle routing problems motivations, case studies and methods B. Golden, S. Raghavan, E. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges 2007 Springer US
    • (2007) The Vehicle Routing Problem: Latest Advances and New Challenges
    • Jozefowiez, N.1    Semet, F.2    Talbi, E.G.3
  • 32
    • 39649088959 scopus 로고    scopus 로고
    • Multi-objective vehicle routing problems
    • N. Jozefowiez, F. Semet, and E.-G. Talbi Multi-objective vehicle routing problems Eur. J. Oper. Res. 189 2 2008 293 309
    • (2008) Eur. J. Oper. Res. , vol.189 , Issue.2 , pp. 293-309
    • Jozefowiez, N.1    Semet, F.2    Talbi, E.-G.3
  • 33
    • 70449525352 scopus 로고    scopus 로고
    • The balanced cargo vehicle routing problem with time windows
    • M. Kritikos, and G. Ioannou The balanced cargo vehicle routing problem with time windows Int. J. Prod. Econ. 123 1 2010 42 51
    • (2010) Int. J. Prod. Econ. , vol.123 , Issue.1 , pp. 42-51
    • Kritikos, M.1    Ioannou, G.2
  • 34
    • 33846581449 scopus 로고    scopus 로고
    • An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
    • J. Kytöjoki, T. Nuortio, O. Brysy, and M. Gendreau An efficient variable neighborhood search heuristic for very large scale vehicle routing problems Comput. Oper. Res. 34 9 2007 2743 2757
    • (2007) Comput. Oper. Res. , vol.34 , Issue.9 , pp. 2743-2757
    • Kytöjoki, J.1    Nuortio, T.2    Brysy, O.3    Gendreau, M.4
  • 35
    • 84908204739 scopus 로고    scopus 로고
    • Rich vehicle routing problems from a taxonomy to a definition
    • R. Lahyani, M. Khemakhem, and F. Semet Rich vehicle routing problems from a taxonomy to a definition Eur. J. Oper. Res. 241 1 2015 1 14
    • (2015) Eur. J. Oper. Res. , vol.241 , Issue.1 , pp. 1-14
    • Lahyani, R.1    Khemakhem, M.2    Semet, F.3
  • 36
    • 73349128424 scopus 로고    scopus 로고
    • Fifty years of vehicle routing
    • G. Laporte Fifty years of vehicle routing Transp. Sci. 43 4 2009 408 416
    • (2009) Transp. Sci. , vol.43 , Issue.4 , pp. 408-416
    • Laporte, G.1
  • 37
    • 33846580155 scopus 로고    scopus 로고
    • A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
    • F. Li, B. Golden, and E. Wasil A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem Comput. Oper. Res. 34 9 2007 2734 2742
    • (2007) Comput. Oper. Res. , vol.34 , Issue.9 , pp. 2734-2742
    • Li, F.1    Golden, B.2    Wasil, E.3
  • 40
    • 51649111723 scopus 로고    scopus 로고
    • Introduction to the special issue on variable neighborhood search
    • J.M. Moreno-Vega, and B. Melian Introduction to the special issue on variable neighborhood search J. Heuristics 14 5 2008 403 404
    • (2008) J. Heuristics , vol.14 , Issue.5 , pp. 403-404
    • Moreno-Vega, J.M.1    Melian, B.2
  • 41
    • 69549111047 scopus 로고    scopus 로고
    • A powerful route minimization heuristic for the vehicle routing problem with time windows
    • Y. Nagata, and O. Bräysy A powerful route minimization heuristic for the vehicle routing problem with time windows Oper. Res. Lett. 37 5 2009 333 338
    • (2009) Oper. Res. Lett. , vol.37 , Issue.5 , pp. 333-338
    • Nagata, Y.1    Bräysy, O.2
  • 43
    • 51649112458 scopus 로고    scopus 로고
    • A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
    • D. Paraskevopoulos, P. Repoussis, C. Tarantilis, G. Ioannou, and G. Prastacos A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows J. Heuristics 14 5 2008 425 455
    • (2008) J. Heuristics , vol.14 , Issue.5 , pp. 425-455
    • Paraskevopoulos, D.1    Repoussis, P.2    Tarantilis, C.3    Ioannou, G.4    Prastacos, G.5
  • 44
    • 84875134472 scopus 로고    scopus 로고
    • Variable formulation search for the cutwidth minimization problem
    • E. Pardo, N. Mladenovi, J. Pantrigo, and A. Duarte Variable formulation search for the cutwidth minimization problem Appl. Soft Comput. J. 13 5 2013 2242 2252
    • (2013) Appl. Soft Comput. J. , vol.13 , Issue.5 , pp. 2242-2252
    • Pardo, E.1    Mladenovi, N.2    Pantrigo, J.3    Duarte, A.4
  • 45
    • 84897975949 scopus 로고    scopus 로고
    • An iterated local search heuristic for the heterogeneous fleet vehicle routing problem
    • P.H.V. Penna, A. Subramanian, and L.S. Ochi An iterated local search heuristic for the heterogeneous fleet vehicle routing problem J. Heuristics 2011 1 32
    • (2011) J. Heuristics , pp. 1-32
    • Penna, P.H.V.1    Subramanian, A.2    Ochi, L.S.3
  • 46
    • 14844361815 scopus 로고    scopus 로고
    • A variable neighborhood search for the multi depot vehicle routing problem with time windows
    • M. Polacek, K. Hartl, K. Doerner, and M. Reimann A variable neighborhood search for the multi depot vehicle routing problem with time windows J. Heuristics 10 6 2004 613 627
    • (2004) J. Heuristics , vol.10 , Issue.6 , pp. 613-627
    • Polacek, M.1    Hartl, K.2    Doerner, K.3    Reimann, M.4
  • 47
    • 70449597677 scopus 로고    scopus 로고
    • State-of-the art review - Evolutionary algorithms for vehicle routing
    • J.-Y. Potvin State-of-the art review - evolutionary algorithms for vehicle routing INFORMS J. Comput. 21 4 2009 518 548
    • (2009) INFORMS J. Comput. , vol.21 , Issue.4 , pp. 518-548
    • Potvin, J.-Y.1
  • 48
    • 70449522378 scopus 로고    scopus 로고
    • Two memetic algorithms for heterogeneous fleet vehicle routing problems
    • C. Prins Two memetic algorithms for heterogeneous fleet vehicle routing problems Eng. Appl. Artif. Intell. 22 6 2009 916 928
    • (2009) Eng. Appl. Artif. Intell. , vol.22 , Issue.6 , pp. 916-928
    • Prins, C.1
  • 51
    • 84868200552 scopus 로고    scopus 로고
    • Rich routing problems arising in supply chain management
    • V. Schmid, K.F. Doerner, and G. Laporte Rich routing problems arising in supply chain management Eur. J. Oper. Res. 224 3 2013 435 448
    • (2013) Eur. J. Oper. Res. , vol.224 , Issue.3 , pp. 435-448
    • Schmid, V.1    Doerner, K.F.2    Laporte, G.3
  • 52
    • 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 Oper. Res. 35 2 1987 254 265
    • (1987) Oper. Res. , vol.35 , Issue.2 , pp. 254-265
    • Solomon, M.1
  • 53
    • 84861097061 scopus 로고    scopus 로고
    • A hybrid algorithm for the heterogeneous fleet vehicle routing problem
    • A. Subramanian, P.H. Vaz Penna, E. Uchoa, and L.S. Ochi A hybrid algorithm for the heterogeneous fleet vehicle routing problem Eur. J. Oper. Res. 221 2 2012 285 295
    • (2012) Eur. J. Oper. Res. , vol.221 , Issue.2 , pp. 285-295
    • Subramanian, A.1    Vaz Penna, P.H.2    Uchoa, E.3    Ochi, L.S.4
  • 54
    • 0033283556 scopus 로고    scopus 로고
    • A heuristic column generation method for the heterogeneous fleet vrp
    • E. Taillard A heuristic column generation method for the heterogeneous fleet vrp Rairo-Rech. Oper.-Oper. Res. 33 1 1999 1 14
    • (1999) Rairo-Rech. Oper.-Oper. Res. , vol.33 , Issue.1 , pp. 1-14
    • Taillard, E.1
  • 55
    • 0031139685 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with soft time windows
    • É Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin A tabu search heuristic for the vehicle routing problem with soft time windows Transp. Sci. 31 2 1997 170 186
    • (1997) Transp. Sci. , vol.31 , Issue.2 , pp. 170-186
    • Taillard É.1    Badeau, P.2    Gendreau, M.3    Guertin, F.4    Potvin, J.-Y.5
  • 56
    • 67650239593 scopus 로고    scopus 로고
    • A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem
    • C.D. Tarantilis, E.E. Zachariadis, and C.T. Kiranoudis A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem IEEE Trans. Intell. Transp. Syst. 10 2 2009 255 271
    • (2009) IEEE Trans. Intell. Transp. Syst. , vol.10 , Issue.2 , pp. 255-271
    • Tarantilis, C.D.1    Zachariadis, E.E.2    Kiranoudis, C.T.3
  • 58
    • 84879975668 scopus 로고    scopus 로고
    • Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
    • T. Vidal, T. Crainic, M. Gendreau, and C. Prins Heuristics for multi-attribute vehicle routing problems: a survey and synthesis Eur. J. Oper. Res. 231 1 2013 1 21
    • (2013) Eur. J. Oper. Res. , vol.231 , Issue.1 , pp. 1-21
    • Vidal, T.1    Crainic, T.2    Gendreau, M.3    Prins, C.4


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