Articles liés à Scheduling and routing of vehicles: Fleet size Optimization

Scheduling and routing of vehicles: Fleet size Optimization - Couverture souple

Noureddine, Labiad

 
9783838302980: Scheduling and routing of vehicles: Fleet size Optimization
Couverture souple
ISBN 10 : 3838302982 ISBN 13 : 9783838302980
Editeur : LAP LAMBERT Academic Publishing, 2009

Synopsis

This work addresses the problem of finding the minimum number of vehicles required to service weekly a set of customers subject to time windows. The specific structure of the problem requires that a full loaded vehicle serve only one customer each time it leaves the depot. As a consequence, all feasible schedules involve the same total distance traveled. The fleet is homogeneous and is located in a common depot. Vehicle capacity is finite, weekly mileage is limited, and split service is not permitted. Four heuristics are developed to obtain feasible solutions. Results are reported for 1000 randomly generated problems with up to 150 deliveries. It is shown that the new heuristics outperform the actual algorithm used by the Transportation Company in terms of computation time and the quality of solution. To gauge the quality of the solutions, three lower bounding procedures are developed. The first considers the ‘bin packing aspect of the problem’ with regard to the maximum weekly mileage. The second exploits the time windows constraints while the third lowerbounding method uses a network flow formulation.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

This work addresses the problem of finding the minimum number of vehicles required to service weekly a set of customers subject to time windows. The specific structure of the problem requires that a full loaded vehicle serve only one customer each time it leaves the depot. As a consequence, all feasible schedules involve the same total distance traveled. The fleet is homogeneous and is located in a common depot. Vehicle capacity is finite, weekly mileage is limited, and split service is not permitted. Four heuristics are developed to obtain feasible solutions. Results are reported for 1000 randomly generated problems with up to 150 deliveries. It is shown that the new heuristics outperform the actual algorithm used by the Transportation Company in terms of computation time and the quality of solution. To gauge the quality of the solutions, three lower bounding procedures are developed. The first considers the ?bin packing aspect of the problem? with regard to the maximum weekly mileage. The second exploits the time windows constraints while the third lowerbounding method uses a network flow formulation.

Biographie de l'auteur

Consultant Manager at Capital Consulting(Morocco) Holds a Master's degree in Industrial Engineering and Operations Research from North Carolina State University. During his 12 years experience, he leaded many project related to Supply Chain Optimization and Business Process Improvement.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2009
Langue
anglais
ISBN 10 
3838302982
ISBN 13 
9783838302980
Reliure
Broché
Nombre de pages
48
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne