Large multiple neighborhood search for the clustered vehicle-routing problem
From MaRDI portal
Publication:1754733
Recommendations
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- Hybrid metaheuristics for the clustered vehicle routing problem
- Exact algorithms for the clustered vehicle routing problem
- A decomposition-based method for solving the clustered vehicle routing problem
Cites work
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- A general heuristic for vehicle routing problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A unified heuristic for a large class of vehicle routing problems with backhauls
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Approximations of the critical region of the fbietkan statistic
- Corrigendum to: ``Hybrid metaheuristics for the clustered vehicle routing problem
- Cut-first branch-and-price-second for the capacitated arc-routing problem
- Exact algorithms for the clustered vehicle routing problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Fast local search algorithms for the handicapped persons transportation problem
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- Handbook of metaheuristics
- scientific article; zbMATH DE number 2064413 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- Hybrid metaheuristics for the clustered vehicle routing problem
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- Modified Sequentially Rejective Multiple Test Procedures
- New classes of efficiently solvable generalized traveling salesman problems
- New mathematical models of the generalized vehicle routing problem and extensions
- Node, edge, arc routing and turn penalties: multiple problems -- one neighborhood extension
- On a Monotonicity Problem in Step-Down Multiple Test Procedures
- Record breaking optimization results using the ruin and recreate principle
- Solution of real-world postman problems
- The Shortest Hamiltonian Chain of a Graph
- Variable neighborhood search: Principles and applications
- Very large-scale vehicle routing: new test problems, algorithms, and results
Cited in
(21)- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- Heuristics for vehicle routing problems: sequence or set optimization?
- Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- A unified exact approach for clustered and generalized vehicle routing problems
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- Exact solution of the soft-clustered vehicle-routing problem
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- 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 adaptive large neighborhood search for a vehicle routing problem with multiple routes
- A computational study comparing different multiple neighbourhood strategies for solving rich 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
- Modeling and solving the two-level generalized median tour problem
- Clustered vehicle routing problem for waste collection with smart operational management approaches
- Energy-efficient UAV routing problem based on approximate cellular decomposition for geohazards monitoring
- Solving soft and hard-clustered vehicle routing problems: a bi-population collaborative memetic search approach
- Optimizing delivery systems within the e-retail context: a weighted self-organizing map for delivery region partitioning
- Very large-scale neighborhood search for drone routing with energy replenishment
This page was built for publication: Large multiple neighborhood search 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 Q1754733)
