Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem

DOI10.1007/978-1-4614-5134-1_2MaRDI QIDQ4596148zbMATH OpenOpenAlexFDO

Authors Samira Almoustafa, Saïd Hanafi, Nenad Mladenović

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Recommendations

• A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
• Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
• New exact method for large asymmetric distance-constrained vehicle routing problem
• Two new exact methods for asymmetric distance-constrained vehicle routing problem
• An efficient multistart heuristic for the driver and vehicle routing problem
• A multi-start algorithm for a balanced real-world open vehicle routing problem
• scientific article; zbMATH DE number 4047425
• An exact algorithm for the asymmetrical capacitated vehicle routing problem

Cites work

• scientific article; zbMATH DE number 3908167 (Why is no real title available?)
• scientific article; zbMATH DE number 3989085 (Why is no real title available?)
• scientific article; zbMATH DE number 4066603 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
• A unified exact method for solving different classes of vehicle routing problems
• An addendum on: ``Sensitivity analysis of the optimal assignment
• An overview on polynomial approximation of NP-hard problems
• Improving the Hungarian assignment algorithm
• Optimal Routing under Capacity and Distance Restrictions
• Projection results for vehicle routing
• Recent advances in vehicle routing exact algorithms
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• Sensitivity analysis of the optimal assignment.
• Solution of a Large-Scale Traveling-Salesman Problem
• Some Simple Applications of the Travelling Salesman Problem
• State-space relaxation procedures for the computation of bounds to routing problems
• The vehicle routing problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• Tolerance-based branch and bound algorithms for the ATSP
• Two new exact methods for asymmetric distance-constrained vehicle routing problem
• Variable neighborhood search
• Variable neighbourhood search: methods and applications
• What you should know about the vehicle routing problem

Cited in

(2)

• Two new exact methods for asymmetric distance-constrained vehicle routing problem
• New exact method for large asymmetric distance-constrained vehicle routing problem

This page was built for publication: Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596148)