Recent progress of local search in handling the time window constraints of the vehicle routing problem

Recent progress of local search in handling the time window constraints of the vehicle routing problem

0.00 Avg rating0 Votes
Article ID: iaor20106959
Volume: 8
Issue: 3
Start Page Number: 221
End Page Number: 238
Publication Date: Oct 2010
Journal: 4OR
Authors: , , ,
Keywords: heuristics: local search
Abstract:

Vehicle routing and scheduling problems have a wide range of applications and have been intensively studied in the past half century. The condition that enforces each vehicle to start service at each customer in the period specified by the customer is called the time window constraint. This paper reviews recent results on how to handle hard and soft time window constraints, putting emphasis on its different definitions and algorithms. With these diverse time windows, the problem becomes applicable to a wide range of real-world problems.

Reviews

Required fields are marked *. Your email address will not be published.