Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
From MaRDI portal
Publication:4596148
DOI10.1007/978-1-4614-5134-1_2zbMath1375.90294OpenAlexW2218340586MaRDI QIDQ4596148
Samira Almoustafa, Nenad Mladenović, Saïd Hanafi
Publication date: 30 November 2017
Published in: Optimization Theory, Decision Making, and Operations Research Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-5134-1_2
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Recent advances in vehicle routing exact algorithms
- Variable neighbourhood search: methods and applications
- Improving the Hungarian assignment algorithm
- The vehicle routing problem: An overview of exact and approximate algorithms
- Variable neighborhood search
- Sensitivity analysis of the optimal assignment.
- A unified exact method for solving different classes of vehicle routing problems
- Tolerance-based branch and bound algorithms for the ATSP
- An addendum on: ``Sensitivity analysis of the optimal assignment
- Projection results for vehicle routing
- The Vehicle Routing Problem
- What you should know about the vehicle routing problem
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- An overview on polynomial approximation of NP-hard problems
- Optimal Routing under Capacity and Distance Restrictions
- A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
- State-space relaxation procedures for the computation of bounds to routing problems
- Some Simple Applications of the Travelling Salesman Problem
- Solution of a Large-Scale Traveling-Salesman Problem
