Heterogeneous truck routing policies with tour routing time restriction: a case study of a Malaysian trucking company
by Ada Suk-Fung Ng; Mei Khing Ong; Angappa Gunasekaran; Chun-Hung Cheng
International Journal of Logistics Systems and Management (IJLSM), Vol. 17, No. 4, 2014

Abstract: We study a heterogeneous full-truckload vehicle routing problem based on a real world case where tour routing time is restricted. Four integer programming solution policies are proposed. Three of the policies identify the set of home-bound trucks before assigning jobs to trucks, while the last policy is a one-off algorithm that assigns job routes to all the trucks and makes sure that each truck will not exceed the total route time limit. Computation results show that all four policies do better than the solutions provided by expert planners of the company.

Online publication date: Sat, 21-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com