Fleet design optimisation from historical data using constraint programming and large neighbourhood search

DOI10.1007/S10601-015-9203-0MaRDI QIDQ265693zbMATH OpenOpenAlexFDO

Authors Philip Kilby, Tommaso Urli

Publication date 12 April 2016

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10601-015-9203-0

zbMATH Keywords

constraint programmingfleet size and mixlarge neighbourhood searchmixed integer programmingpre-processingvehicle routing problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• Optimal fleet composition via dynamic programming and golden section search
• A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model
• The fleet assignment problem: Solving a large scale integer program
• scientific article; zbMATH DE number 1728541
• Solving a large-scale integrated fleet assignment and crew pairing problem
• scientific article; zbMATH DE number 2050792
• A neighborhood search algorithm for the combined through and fleet assignment model with time windows
• Theoretical and algorithmic results for a class of hierarchical fleet mix problems
• An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach

Cites work

• scientific article; zbMATH DE number 5829047 (Why is no real title available?)
• A unified solution framework for multi-attribute vehicle routing problems
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Balancing bike sharing systems with constraint programming
• Handbook of transportation science.
• Savings by Split Delivery Routing
• Split delivery routing
• The split delivery vehicle routing problem: A survey
• The vehicle routing problem

Cited in

(4)

• Multimodal processes prototyping subject to grid-like network and fuzzy operation time constraints
• Optimal fleet composition via dynamic programming and golden section search
• A concise guide to existing and emerging vehicle routing problem variants
• A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles

Describes a project that uses

Uses Software

• json2run
• SPOT
• Gecode
• VRP
• Gurobi

This page was built for publication: Fleet design optimisation from historical data using constraint programming and large neighbourhood search

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