A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
From MaRDI portal
Publication:4427373
DOI10.1287/ijoc.11.2.161zbMath1092.90503OpenAlexW2068160741MaRDI QIDQ4427373
Publication date: 16 December 2003
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d834d9a42fba3d4838c386c5419129e098c4b904
Related Items (14)
Use of the BATA algorithm and MIS to solve the mail carrier problem ⋮ A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem ⋮ A hybrid algorithm for a class of vehicle routing problems ⋮ A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times ⋮ A multi-space sampling heuristic for the vehicle routing problem with stochastic demands ⋮ A hybrid soft computing approach for subset problems ⋮ A new modeling and solution approach for the set-partitioning problem ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ A LP-based heuristic for a time-constrained routing problem ⋮ A survey on matheuristics for routing problems ⋮ Heuristics for the variable sized bin-packing problem ⋮ Survey of research in the design and control of automated guided vehicle systems ⋮ An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem ⋮ A matheuristic for the truck and trailer routing problem
This page was built for publication: A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
