A heuristic method for dispatching repair men

DOI10.1007/BF02098289MaRDI QIDQ1908307zbMATH OpenFDO

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

Publication date 26 February 1996

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

Full work available at URL https://doi.org/10.1007/BF02098289

zbMATH Keywords

booking algorithm for routing and timing of customersroute designstart of servicetime windowtotal distance travelled

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(7)

• Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
• A sorting based efficient heuristic for pooled repair shop designs
• An emergency vehicle dispatching system for an electric utility in Chile
• Challenges and opportunities in attended home delivery
• Multi-period time window assignment for attended home delivery
• Heuristic algorithms for visiting the customers in a rolling schedule environment
• Adaptive demand peak management in online transport process planning

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)