Hybrid metaheuristics for the clustered vehicle routing problem

DOI10.1016/j.cor.2014.10.019zbMath1348.90138arXiv1404.6696OpenAlexW2093698911MaRDI QIDQ337513

Thibaut Vidal, Anand Subramanian, Güneş Erdoğan, Maria Battarra

Publication date: 10 November 2016

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

Full work available at URL: https://arxiv.org/abs/1404.6696

zbMATH Keywords

shortest pathhybrid genetic algorithmiterated local searchclustered vehicle routinglarge neighborhoods

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (19)

A heuristic algorithm for a single vehicle static bike sharing rebalancing problem ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ A fast two-level variable neighborhood search for the clustered vehicle routing problem ⋮ Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ Large multiple neighborhood search for the soft-clustered vehicle-routing problem ⋮ The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem ⋮ The static bike relocation problem with multiple vehicles and visits ⋮ A branch-and-cut algorithm for the soft-clustered vehicle-routing problem ⋮ Heuristics for vehicle routing problems: sequence or set optimization? ⋮ Dynamic vehicle routing problems with enhanced ant colony optimization ⋮ A hybrid ant colony optimization for dynamic multidepot vehicle routing problem ⋮ Large multiple neighborhood search for the clustered vehicle-routing problem ⋮ Exact solution of the soft-clustered vehicle-routing problem ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem ⋮ Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Unnamed Item ⋮ A unified exact approach for clustered and generalized vehicle routing problems

Uses Software

• Concorde
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• A general heuristic for vehicle routing problems
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A simple and effective metaheuristic for the minimum latency problem
• An efficient transformation of the generalized vehicle routing problem
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• New mathematical models of the generalized vehicle routing problem and extensions
• Very large-scale vehicle routing: new test problems, algorithms, and results
• A unified solution framework for multi-attribute vehicle routing problems
• Implicit depot assignments and rotations in vehicle routing heuristics
• The Vehicle Routing Problem
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• Exact Algorithms for the Clustered Vehicle Routing Problem

This page was built for publication: Hybrid metaheuristics for the clustered vehicle routing problem