A hybrid algorithm for a class of vehicle routing problems

DOI10.1016/j.cor.2013.01.013zbMath1348.90132OpenAlexW2059715080MaRDI QIDQ336559

Eduardo Uchoa, Anand Subramanian, Luiz Satoru Ochi

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.01.013

zbMATH Keywords

iterated local searchmatheuristicset partitioningvehicle routing problems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Collection of different types of milk with multi-tank tankers under uncertainty: a real case study ⋮ A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem ⋮ A matheuristic approach for the pollution-routing problem ⋮ An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints ⋮ The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints ⋮ An iterated tabu search for the multi-compartment vehicle routing problem ⋮ An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen ⋮ A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking ⋮ A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem ⋮ Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization ⋮ A review of vehicle routing with simultaneous pickup and delivery ⋮ A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood ⋮ A matheuristic for the asymmetric capacitated vehicle routing problem ⋮ Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions ⋮ Adjusting the order crossover operator for capacitated vehicle routing problems ⋮ A performance study on multi improvement neighborhood search strategy ⋮ The r‐interdiction selective multi‐depot vehicle routing problem ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ In-depth analysis of granular local search for capacitated vehicle routing ⋮ The Vehicle Routing Problem with Release and Due Dates ⋮ Knowledge-guided local search for the vehicle routing problem ⋮ Heuristics for vehicle routing problems: sequence or set optimization? ⋮ A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet ⋮ Solution strategies for the vehicle routing problem with backhauls ⋮ Efficiently solving very large-scale routing problems ⋮ A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem ⋮ A matheuristic for the cell formation problem ⋮ Routing a mix of conventional, plug-in hybrid, and electric vehicles ⋮ New benchmark instances for the capacitated vehicle routing problem ⋮ Granular tabu search for the pickup and delivery problem with time windows and electric vehicles ⋮ A comment on: ``What makes a VRP solution good? The generation of problem-specific knowledge for heuristics ⋮ A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation ⋮ A GVNS algorithm for solving the multi-depot vehicle routing problem ⋮ A survey on matheuristics for routing problems ⋮ Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles ⋮ A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances ⋮ Shipper collaboration in forward and reverse logistics ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ The multiple traveling salesman problem in presence of drone- and robot-supported packet stations ⋮ An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem ⋮ A matheuristic for the truck and trailer routing problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified heuristic for a large class of vehicle routing problems with backhauls
• An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
• A general heuristic for vehicle routing problems
• A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A hybrid evolution strategy for the open vehicle routing problem
• An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
• A tabu search heuristic for the multi-depot vehicle routing problem
• Probabilistic diversification and intensification in local search for vehicle routing
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem
• A simple and effective metaheuristic for the minimum latency problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• A variable neighbourhood search algorithm for the open vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• A new ILP-based refinement heuristic for vehicle routing problems
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A guide to vehicle routing heuristics
• A unified tabu search heuristic for vehicle routing problems with time windows
• A Method for Solving Traveling-Salesman Problems