Heterogeneous truck routing policies with tour routing time restriction

We study a heterogeneous full-truckload vehicle routing problem based on the case of a trucking company in Malaysia. Our objective is to minimize total deadhead costs. 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 when it returns to the depot. Cross-sectional computation results show that the one-off policy is the best amongst the four. Cumulative analysis results show that all four policies do better than the companyÆs original assignment in terms of deadhead costs and truck utilization. (a)

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/1832570X
• Authors:
  • NG, A S
  • ONG, M K
• Publication Date: 2010-3

Language

• English

Media Info

• Pagination: 21P
• Serial:
  • Institute of Transport and Logistics Studies Working Paper
  • Issue Number: ITLS-WP-10-03
  • Publisher: University of Sydney
  • ISSN: 1832-570X

Subject/Index Terms

• TRT Terms: Administration; Freight transportation; Itinerary; Logistics; Trucks; Vehicles
• Uncontrolled Terms: Guidance
• ITRD Terms: 1112: Freight transport; 9104: Guidance; 1236: Heavy goods vehicle; 1236: Heavy vehicle; 1236: HGV; 699: Itinerary; 264: Logistics; 155: Management; 1236: Truck; 1255: Vehicle
• Subject Areas: Freight Transportation; Motor Carriers; Vehicles and Equipment; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01174295
• Record Type: Publication
• Source Agency: TRL
• Files: ITRD, ATRI
• Created Date: Sep 30 2010 11:08AM