A heuristic method for dispatching repair men

DOI10.1007/BF02098289zbMATH Open0839.90034MaRDI QIDQ1908307FDOQ1908307

Kim Tosti, Oli B. G. Madsen, Jan Vælds

Publication date: 26 February 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

time windowroute designtotal distance travelledbooking algorithm for routing and timing of customersstart of service

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Transportation, logistics and supply chain management (90B06)

Cites Work

• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Vehicle Routing with Time Windows
• An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation

Cited In (5)

• Multi-period time window assignment for attended home delivery
• Adaptive demand peak management in online transport process planning
• Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
• A sorting based efficient heuristic for pooled repair shop designs
• Challenges and Opportunities in Attended Home Delivery

   Recommendations

• Heuristics to Schedule Service Engineers within Time Windows 👍 👎
• Modeling Distribution Problems with Time Windows: Part I 👍 👎
• Modeling Distribution Problems with Time Windows. Part II: Two Customer Types 👍 👎
• An Heuristic Method for Solving Time-Sensitive Routeing Problems 👍 👎
• Vehicle Routing with Time Windows 👍 👎

This page was built for publication: A heuristic method for dispatching repair men

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