Large multiple neighborhood search for the clustered vehicle-routing problem
From MaRDI portal
Publication:1754733
DOI10.1016/j.ejor.2018.02.056zbMath1403.90123OpenAlexW2597991082WikidataQ130152488 ScholiaQ130152488MaRDI QIDQ1754733
Publication date: 31 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1701.pdf
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (12)
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 ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping ⋮ Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery ⋮ A branch-and-cut algorithm for the soft-clustered vehicle-routing problem ⋮ Heuristics for vehicle routing problems: sequence or set optimization? ⋮ Exact solution of the soft-clustered vehicle-routing problem ⋮ Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances ⋮ A unified exact approach for clustered and generalized vehicle routing problems
Cites Work
- Unnamed Item
- Unnamed Item
- Hybrid metaheuristics for the clustered vehicle routing problem
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A general heuristic for vehicle routing problems
- New classes of efficiently solvable generalized traveling salesman problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- Corrigendum to: ``Hybrid metaheuristics for the clustered vehicle routing problem
- Record breaking optimization results using the ruin and recreate principle
- New mathematical models of the generalized vehicle routing problem and extensions
- Solution of real-world postman problems
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Fast local search algorithms for the handicapped persons transportation problem
- Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
- On a Monotonicity Problem in Step-Down Multiple Test Procedures
- Modified Sequentially Rejective Multiple Test Procedures
- Approximations of the critical region of the fbietkan statistic
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
- Exact Algorithms for the Clustered Vehicle Routing Problem
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
- The Shortest Hamiltonian Chain of a Graph
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Handbook of metaheuristics
- Variable neighborhood search: Principles and applications
This page was built for publication: Large multiple neighborhood search for the clustered vehicle-routing problem
