Hybrid metaheuristics for the clustered vehicle routing problem
From MaRDI portal
(Redirected from Publication:337513)
Abstract: The Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capacitated Vehicle Routing Problem in which customers are grouped into clusters. Each cluster has to be visited once, and a vehicle entering a cluster cannot leave it until all customers have been visited. This article presents two alternative hybrid metaheuristic algorithms for the CluVRP. The first algorithm is based on an Iterated Local Search algorithm, in which only feasible solutions are explored and problem-specific local search moves are utilized. The second algorithm is a Hybrid Genetic Search, for which the shortest Hamiltonian path between each pair of vertices within each cluster should be precomputed. Using this information, a sequence of clusters can be used as a solution representation and large neighborhoods can be efficiently explored by means of bi-directional dynamic programming, sequence concatenations, by using appropriate data structures. Extensive computational experiments are performed on benchmark instances from the literature, as well as new large scale ones. Recommendations on promising algorithm choices are provided relatively to average cluster size.
Recommendations
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- Exact algorithms for the clustered vehicle routing problem
- A unified exact approach for clustered and generalized vehicle routing problems
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- A decomposition-based method for solving the clustered vehicle routing problem
Cites work
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A general heuristic for vehicle routing problems
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- 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
- A unified solution framework for multi-attribute vehicle routing problems
- An efficient transformation of the generalized vehicle routing problem
- Exact algorithms for the clustered vehicle routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Implicit depot assignments and rotations in vehicle routing heuristics
- New mathematical models of the generalized vehicle routing problem and extensions
- The vehicle routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
Cited in
(26)- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- Heuristics for vehicle routing problems: sequence or set optimization?
- A hybrid ant colony optimization for dynamic multidepot vehicle routing problem
- The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
- The vacation planning problem: a multi-level clustering-based metaheuristic approach
- Exact solution of the soft-clustered vehicle-routing problem
- A decomposition-based method for solving the clustered vehicle routing problem
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
- A heuristic for the solution of vehicle routing problems with time windows and multiple dumping sites in waste collection
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem
- 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 clustered vehicle-routing problem
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- The static bike relocation problem with multiple vehicles and visits
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands
- Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- A unified exact approach for clustered and generalized vehicle routing problems
- Exact algorithms for the clustered vehicle routing problem
- Dynamic vehicle routing problems with enhanced ant colony optimization
This page was built for publication: Hybrid metaheuristics for the clustered vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337513)
