Article ID: | iaor20011926 |
Country: | United Kingdom |
Volume: | 27 |
Issue: | 13 |
Start Page Number: | 1249 |
End Page Number: | 1269 |
Publication Date: | Nov 2000 |
Journal: | Computers and Operations Research |
Authors: | Pesenti R., Ukovich W., Baita F., Favaretto D. |
Keywords: | vehicle routing & scheduling, heuristics |
The Vehicle Scheduling Problem (VSP) consists in assigning a set of scheduled trips to a set of vehicles, satisfying a set of constraints and optimizing an objective function. A wide literature exists for the VSP, but usually not all the practical requirements of the real cases are taken into account. In the present paper a practical case is studied, and for it a traditional method is tailored and two innovative heuristics are developed. As the problem presents a multicriteria nature, each of the three algorithms adopts a different approch to multicriteria optimization. Scalarization of the different criteria is performed by the traditional algorithm. A lexicographic approach is followed by an algorithm based on logic programming. Finally, a Pareto optimization approach is implemented by a modified genetic algorithm. All the algorithms are tested on the real problem, and two of them produce interesting practical results.