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

DOI10.1007/S10601-015-9203-0zbMATH Open1334.90085OpenAlexW1137265463MaRDI QIDQ265693FDOQ265693

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)

Cites Work

• Title not available (Why is that?)
• Handbook of transportation science.
• A unified solution framework for multi-attribute vehicle routing problems
• Balancing bike sharing systems with constraint programming
• The vehicle routing problem
• Split delivery routing
• The Split Delivery Vehicle Routing Problem: A Survey
• Savings by Split Delivery Routing
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems

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

Uses Software

• Gurobi
• VRP
• Gecode
• SPOT
• json2run

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Theoretical and algorithmic results for a class of hierarchical fleet mix problems 👍 👎
• The fleet assignment problem: Solving a large scale integer program 👍 👎
• An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach 👍 👎
• Solving a large-scale integrated fleet assignment and crew pairing problem 👍 👎
• A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model 👍 👎
• A neighborhood search algorithm for the combined through and fleet assignment model with time windows 👍 👎
• Optimal fleet composition via dynamic programming and golden section search 👍 👎

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)