A Parallel Algorithm for the Vehicle Routing Problem

From MaRDI portal
Publication:2899121

DOI10.1287/ijoc.1100.0402zbMath1243.90186OpenAlexW2143877830MaRDI QIDQ2899121

Bruce L. Golden, Edward A. Wasil, Chris Groër

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1d95c3c186fe3c15b4f33834199f2554e5f46c56




Related Items (16)

Sequential and parallel large neighborhood search algorithms for the periodic location routing problemAn integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problemAn iterated tabu search for the multi-compartment vehicle routing problemMulti-armed bandit-based hyper-heuristics for combinatorial optimization problemsParallel computational optimization in operations research: a new integrative framework, literature review and research directionsUpper and lower bounds for the vehicle-routing problem with private fleet and common carrierDecision support for the technician routing and scheduling problemLimited memory rank-1 cuts for vehicle routing problemsGranular tabu search for the pickup and delivery problem with time windows and electric vehiclesA multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulationA cooperative parallel metaheuristic for the capacitated vehicle routing problemCooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problemA unified solution framework for multi-attribute vehicle routing problemsImplicit depot assignments and rotations in vehicle routing heuristicsDesigning vehicle routes for a mix of different request types, under time windows and loading constraintsHeuristics for multi-attribute vehicle routing problems: a survey and synthesis


Uses Software



This page was built for publication: A Parallel Algorithm for the Vehicle Routing Problem