Optimal scheduling in combinatorial transportation

Optimal scheduling in combinatorial transportation

0.00 Avg rating0 Votes
Article ID: iaor20022827
Country: China
Volume: 21
Issue: 2
Start Page Number: 117
End Page Number: 121
Publication Date: Feb 2001
Journal: Systems Engineering Theory & Practice
Authors: , ,
Keywords: scheduling, programming: transportation
Abstract:

In this paper, the vehicle-scheduling problem with non-full load and the case of multiple depots is analyzed. The combinatorial transportation is presented in order to enhance the effectiveness of transportation utilizing a single vehicle. A sequential heuristic algorithm is constructed, which consists of clustering and chaining. Finally, the method is applied to a case study.

Reviews

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