Decomposition Strategies for Vehicle Routing Heuristics

DOI10.1287/IJOC.2023.1288MaRDI QIDQ6203501zbMATH OpenOpenAlexFDO

Authors

Publication date 28 February 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2023.1288

zbMATH Keywords

decomposition methodsheuristicsvehicle routing

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• A TSSP+1 decomposition strategy for the vehicle routing problem
• Heuristics for vehicle routing problems: sequence or set optimization?
• A decomposition-based method for solving the clustered vehicle routing problem
• A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
• A survey on matheuristics for routing problems

Cited in

(7)

• Routing one million customers in a handful of minutes
• Fair and efficient multi-agent routing for cooperative and autonomous agricultural fleets with implements
• Assigning airport ground handling operations: a data-driven matheuristic
• Problem size reduction methods for large CVRPs
• Fifty years of operational research: 1972--2022
• An adaptive large neighborhood decomposition search-based approach for the location-routing problem with pickup facilities and heterogeneous demands
• Solving heterogeneous vehicle routing problems using decomposition and set covering

This page was built for publication: Decomposition Strategies for Vehicle Routing Heuristics

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