메뉴 건너뛰기




Volumn 58, Issue , 2015, Pages 87-99

Corrigendum to “Hybrid metaheuristics for the clustered vehicle routing problem [Comput. Oper. Res., 58 (2015): 87–99]”(S0305054814002767)(10.1016/j.cor.2014.10.019);Hybrid metaheuristics for the Clustered Vehicle Routing Problem

Author keywords

Clustered Vehicle Routing; Hybrid Genetic Algorithm; Iterated Local Search; Large neighborhoods; Shortest path

Indexed keywords

ALGORITHMS; AMPHIBIOUS VEHICLES; BENCHMARKING; DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; HYBRID VEHICLES; LOCAL SEARCH (OPTIMIZATION); NETWORK ROUTING; ROUTING ALGORITHMS; VEHICLES;

EID: 84939131456     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2017.04.003     Document Type: Erratum
Times cited : (81)

References (30)
  • 1
    • 84939201401 scopus 로고    scopus 로고
    • Applegate D, Bixby R, Chvàtal V, Cook W. Concorde TSP solver. 2001. URL.
    • Applegate D, Bixby R, Chvàtal V, Cook W. Concorde TSP solver. 2001. URL (http://www.tsp.gatech.edu/concorde/index.html).
  • 3
    • 84896879959 scopus 로고    scopus 로고
    • The clustered vehicle routing problem
    • M. Battarra, G. Erdoʇan, and D. Vigo The clustered vehicle routing problem Oper Res 62 2014 58 71
    • (2014) Oper Res , vol.62 , pp. 58-71
    • Battarra, M.1    Erdoʇan, G.2    Vigo, D.3
  • 4
    • 80051924578 scopus 로고    scopus 로고
    • Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
    • T. Bektaş, G. Erdoʇan, and S. Ropke Formulations and branch-and-cut algorithms for the generalized vehicle routing problem Transp Sci 45 2011 299 316
    • (2011) Transp Sci , vol.45 , pp. 299-316
    • Bektaş, T.1    Erdoʇan, G.2    Ropke, S.3
  • 5
    • 0001201888 scopus 로고
    • The clustered traveling salesman problem
    • J. Chisman The clustered traveling salesman problem Comput Oper Res 2 1975 115 119
    • (1975) Comput Oper Res , vol.2 , pp. 115-119
    • Chisman, J.1
  • 6
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Oper Res 12 1964 568 581
    • (1964) Oper Res , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 7
    • 0033887939 scopus 로고    scopus 로고
    • An efficient transformation of the generalized vehicle routing problem
    • G. Ghiani, and G. Improta An efficient transformation of the generalized vehicle routing problem Eur J Oper Res 122 2000 11 17
    • (2000) Eur J Oper Res , vol.122 , pp. 11-17
    • Ghiani, G.1    Improta, G.2
  • 8
    • 84907750061 scopus 로고    scopus 로고
    • Hours of service regulations in road freight transport: An optimization-based international assessment
    • A. Goel, and T. Vidal Hours of service regulations in road freight transport: an optimization-based international assessment Transp Sci 48 2014 391 412
    • (2014) Transp Sci , vol.48 , pp. 391-412
    • Goel, A.1    Vidal, T.2
  • 10
    • 7544224084 scopus 로고    scopus 로고
    • Very large-scale vehicle routing: New test problems, algorithms, and results
    • F. Li, G. Golden, and E. Wasil Very large-scale vehicle routing: new test problems, algorithms, and results Comput Oper Res 32 2005 1165 1179
    • (2005) Comput Oper Res , vol.32 , pp. 1165-1179
    • Li, F.1    Golden, G.2    Wasil, E.3
  • 12
    • 84896392766 scopus 로고    scopus 로고
    • An iterated local search heuristic for the heterogeneous fleet vehicle routing problem
    • P. Penna, A. Subramanian, and L. Ochi An iterated local search heuristic for the heterogeneous fleet vehicle routing problem J Heuristics 19 2013 201 232
    • (2013) J Heuristics , vol.19 , pp. 201-232
    • Penna, P.1    Subramanian, A.2    Ochi, L.3
  • 13
    • 33846068585 scopus 로고    scopus 로고
    • A general heuristic for vehicle routing problems
    • D. Pisinger, and S. Ropke A general heuristic for vehicle routing problems Comput Oper Res 34 2007 2403 2435
    • (2007) Comput Oper Res , vol.34 , pp. 2403-2435
    • Pisinger, D.1    Ropke, S.2
  • 14
    • 80051805369 scopus 로고    scopus 로고
    • New mathematical models of the generalized vehicle routing problem and extensions
    • P. Pop, I. Kara, and A. Horvat-Marc New mathematical models of the generalized vehicle routing problem and extensions Appl Math Model 36 2012 97 107
    • (2012) Appl Math Model , vol.36 , pp. 97-107
    • Pop, P.1    Kara, I.2    Horvat-Marc, A.3
  • 15
    • 84875915301 scopus 로고    scopus 로고
    • An improved hybrid algorithm for solving the generalized vehicle routing problem
    • P. Pop, O. Matei, and C. Pop Sitar An improved hybrid algorithm for solving the generalized vehicle routing problem Neurocomputing 109 2013 76 83
    • (2013) Neurocomputing , vol.109 , pp. 76-83
    • Pop, P.1    Matei, O.2    Pop Sitar, C.3
  • 16
    • 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 Comput Oper Res 31 2004 1985 2002
    • (2004) Comput Oper Res , vol.31 , pp. 1985-2002
    • Prins, C.1
  • 18
    • 84861619155 scopus 로고    scopus 로고
    • A simple and effective metaheuristic for the Minimum Latency Problem
    • M. Silva, A. Subramanian, T. Vidal, and L. Ochi A simple and effective metaheuristic for the Minimum Latency Problem Eur J Oper Res 221 2012 513 520
    • (2012) Eur J Oper Res , vol.221 , pp. 513-520
    • Silva, M.1    Subramanian, A.2    Vidal, T.3    Ochi, L.4
  • 21
    • 84873911958 scopus 로고    scopus 로고
    • An iterated local search algorithm for the traveling salesman problem with pickups and deliveries
    • A. Subramanian, and M. Battarra An iterated local search algorithm for the traveling salesman problem with pickups and deliveries J Oper Res Soc 64 2013 402 409
    • (2013) J Oper Res Soc , vol.64 , pp. 402-409
    • Subramanian, A.1    Battarra, M.2
  • 22
    • 84896395074 scopus 로고    scopus 로고
    • An iterated local search heuristic for the single machine total weighted tardiness problem with sequence-dependent setup times
    • A. Subramanian, M. Battarra, and C. Potts An iterated local search heuristic for the single machine total weighted tardiness problem with sequence-dependent setup times Int J Prod Res 52 2014 2729 2742
    • (2014) Int J Prod Res , vol.52 , pp. 2729-2742
    • Subramanian, A.1    Battarra, M.2    Potts, C.3
  • 23
    • 77951104453 scopus 로고    scopus 로고
    • A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
    • A. Subramanian, L. Drummond, C. Bentes, L. Ochi, and R. Farias A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery Comput Oper Res 37 2010 1899 1911
    • (2010) Comput Oper Res , vol.37 , pp. 1899-1911
    • Subramanian, A.1    Drummond, L.2    Bentes, C.3    Ochi, L.4    Farias, R.5
  • 24
    • 0041791136 scopus 로고    scopus 로고
    • Society for Industrial and Applied Mathematics Philadelphia
    • P. Toth, and D. Vigo The vehicle routing problem 2002 Society for Industrial and Applied Mathematics Philadelphia
    • (2002) The Vehicle Routing Problem
    • Toth, P.1    Vigo, D.2
  • 25
    • 84864700477 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for multidepot and periodic vehicle routing problems
    • T. Vidal, T. Crainic, M. Gendreau, N. Lahrichi, and W. Rei A hybrid genetic algorithm for multidepot and periodic vehicle routing problems Oper Res 60 2012 611 624
    • (2012) Oper Res , vol.60 , pp. 611-624
    • Vidal, T.1    Crainic, T.2    Gendreau, M.3    Lahrichi, N.4    Rei, W.5
  • 26
    • 84866177726 scopus 로고    scopus 로고
    • A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
    • T. Vidal, T. Crainic, M. Gendreau, and C. Prins A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows Comput Oper Res 40 2013 475 489
    • (2013) Comput Oper Res , vol.40 , pp. 475-489
    • Vidal, T.1    Crainic, T.2    Gendreau, M.3    Prins, C.4
  • 27
    • 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 2013 1 21
    • (2013) Eur J Oper Res , vol.231 , pp. 1-21
    • Vidal, T.1    Crainic, T.2    Gendreau, M.3    Prins, C.4
  • 28
    • 84892769501 scopus 로고    scopus 로고
    • A unified solution framework for multi-attribute vehicle routing problems
    • T. Vidal, T. Crainic, M. Gendreau, and C. Prins A unified solution framework for multi-attribute vehicle routing problems Eur J Oper Res 234 2014 658 673
    • (2014) Eur J Oper Res , vol.234 , pp. 658-673
    • Vidal, T.1    Crainic, T.2    Gendreau, M.3    Prins, C.4
  • 29
    • 84898817519 scopus 로고    scopus 로고
    • Implicit depot assignments and rotations in vehicle routing heuristics
    • T. Vidal, T. Crainic, M. Gendreau, and C. Prins Implicit depot assignments and rotations in vehicle routing heuristics Eur J Oper Res 237 2014 15 28
    • (2014) Eur J Oper Res , vol.237 , pp. 15-28
    • Vidal, T.1    Crainic, T.2    Gendreau, M.3    Prins, C.4
  • 30
    • 84958199985 scopus 로고    scopus 로고
    • Large neighborhoods with implicit customer selection for vehicle routing problems with profits
    • in press
    • Vidal T, Maculan N, Ochi L, Penna P. Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transp Sci, in press, 2014. URL http://arxiv.org/abs/1401.3794.
    • (2014) Transp Sci
    • Vidal, T.1    Maculan, N.2    Ochi, L.3    Penna, P.4


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