Optimizing time slot allocation in single operator home delivery problems

DOI10.1007/978-3-319-28697-6_14zbMATH Open1342.90017OpenAlexW2464877900MaRDI QIDQ2806900FDOQ2806900

Alberto Ceselli, L. Létocart, Marco Casazza

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_14

Recommendations

• Anticipative dynamic slotting for attended home deliveries
• Time window optimization for attended home service delivery under multiple sources of uncertainties
• Single courier single restaurant meal delivery (without routing)
• Appointment scheduling and routing optimization of attended home delivery system with random customer behavior
• Home service routing and appointment scheduling with stochastic service times

zbMATH Keywords

combinatorial optimization modelstime slot assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cites Work

• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• An exact constraint logic programming algorithm for the traveling salesman problem with time windows

Cited In (3)

• On assigning drivers for a home-delivery system on a performance basis
• Time window optimization for attended home service delivery under multiple sources of uncertainties
• Demand management for attended home delivery -- a literature review

This page was built for publication: Optimizing time slot allocation in single operator home delivery problems

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