Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Decomposition Strategies for Vehicle Routing Heuristics

From MaRDI portal
Publication:6203501
Jump to:navigation, search

DOI10.1287/IJOC.2023.1288OpenAlexW4361221305MaRDI QIDQ6203501FDOQ6203501


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




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


zbMATH Keywords

heuristicsdecomposition methodsvehicle routing


Mathematics Subject Classification ID

Mathematical programming (90Cxx)



Cited In (1)

  • Routing one million customers in a handful of minutes





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6203501&oldid=35705725"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 10 July 2024, at 07:17. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki