A heuristic method for dispatching repair men

DOI10.1007/BF02098289zbMath0839.90034MaRDI QIDQ1908307

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

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

Related Items (3)

Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. ⋮ Challenges and Opportunities in Attended Home Delivery ⋮ Adaptive demand peak management in online transport process planning

Cites Work

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

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