Convex-hull based two-phase algorithm to solve capacitated vehicle routing problem

DOI10.22067/IJNAO.2025.93411.1643MaRDI QIDQ6885022zbMATH OpenFDO

Authors Maria Afsharirad, Akbar Hashemi Borzabadi

Publication date 12 December 2025

Published in Iranian Journal of Numerical Analysis and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doaj.org/article/1a0119f5921a43568f251684ec2a206f

zbMATH Keywords

\(K\)-means algorithmant colony optimizationcapacitated vehicle routing problemconvex hull

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A branch and bound algorithm for the capacitated vehicle routing problem
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A heuristic method for the open vehicle routing problem
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain
• A tabu search heuristic for the multi-depot vehicle routing problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Approximate Traveling Salesman Algorithms
• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• scientific article; zbMATH DE number 1128822 (Why is no real title available?)
• scientific article; zbMATH DE number 1749221 (Why is no real title available?)
• scientific article; zbMATH DE number 2144496 (Why is no real title available?)
• On the capacitated vehicle routing problem
• Solving min-max multi-depot vehicle routing problem
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• The capacitated centred clustering problem
• The truck dispatching problem
• Using clustering analysis in a capacitated location-routing problem
• Variants and formulations of the vehicle routing problem
• Vehicle Routing

This page was built for publication: Convex-hull based two-phase algorithm to solve capacitated vehicle routing problem

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