Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
7427452 | Transportation Research Part E: Logistics and Transportation Review | 2018 | 17 Pages |
Abstract
This study introduces the multi-trip multi-repairman problem with time windows where an integrated traveling cost involving distance-dependent and time-dependent costs needs to be minimized. The problem is formulated as two mixed integer programming models. A branch-and-price algorithm is proposed, in which two route-generating approaches are devised to handle the pricing sub-problem. A large number of instances are randomly generated based on an actual service network of China. The proposed algorithm is validated based on these instances and compared to the direct solving method using Cplex. The comparison to the single-trip mode indicates the advantages of the multi-trip mode.
Keywords
Related Topics
Social Sciences and Humanities
Business, Management and Accounting
Business and International Management
Authors
Shixin Liu, Shujin Qin, Ruiyou Zhang,