Title: Heterogeneous truck routing policies with tour routing time restriction: a case study of a Malaysian trucking company

Authors: Ada Suk-Fung Ng; Mei Khing Ong; Angappa Gunasekaran; Chun-Hung Cheng

Addresses: Institute of Transport and Logistics Studies, C37, Business School, The University of Sydney, New South Wales 2006, Australia ' Department of Transportation and Logistics, Malaysia University of Science and Technology, GL33, Block C, Dataran Usahawan Kelana, 17, Jalan SS7/26, 47301, Petaling Jaya, Malaysia ' Department of Decision & Information Sciences, University of Massachusetts Dartmouth, North Dartmouth, MA 02747, USA ' Department of Systems Engineering & Engineering Management, The Chinese University of Hong Kong, Shatin, NT, Hong Kong

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.

Keywords: vehicle routing; full truckload; pickup and delivery; heterogeneous fleet; tour routing time; truck routing policies; case study; Malaysia; trucking industry; integer programming.

DOI: 10.1504/IJLSM.2014.061020

International Journal of Logistics Systems and Management, 2014 Vol.17 No.4, pp.498 - 522

Published online: 21 Jun 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article