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

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

doi:10.1504/IJLSM.2014.061020

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

Ada Suk Fung Ng, Mei Khing Ong, Angappa Gunasekaran, Chun Hung Cheng

School of Business Administration (Harrisburg)

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English (US)
Pages (from-to)	498-522
Number of pages	25
Journal	International Journal of Logistics Systems and Management
Volume	17
Issue number	4
DOIs	https://doi.org/10.1504/IJLSM.2014.061020
State	Published - 2014

All Science Journal Classification (ASJC) codes

Management Information Systems
Management Science and Operations Research
Information Systems and Management

Access to Document

10.1504/IJLSM.2014.061020

Cite this

@article{3ea225bbd7ed4dc38a90d201a4c92977,

title = "Heterogeneous truck routing policies with tour routing time restriction: A case study of a Malaysian trucking company",

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.",

author = "Ng, {Ada Suk Fung} and Ong, {Mei Khing} and Angappa Gunasekaran and Cheng, {Chun Hung}",

year = "2014",

doi = "10.1504/IJLSM.2014.061020",

language = "English (US)",

volume = "17",

pages = "498--522",

journal = "International Journal of Logistics Systems and Management",

issn = "1742-7967",

publisher = "Inderscience Enterprises Ltd",

number = "4",

}

TY - JOUR

T1 - Heterogeneous truck routing policies with tour routing time restriction

T2 - A case study of a Malaysian trucking company

AU - Ng, Ada Suk Fung

AU - Ong, Mei Khing

AU - Gunasekaran, Angappa

AU - Cheng, Chun Hung

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84901601477&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901601477&partnerID=8YFLogxK

U2 - 10.1504/IJLSM.2014.061020

DO - 10.1504/IJLSM.2014.061020

M3 - Article

AN - SCOPUS:84901601477

SN - 1742-7967

VL - 17

SP - 498

EP - 522

JO - International Journal of Logistics Systems and Management

JF - International Journal of Logistics Systems and Management

IS - 4

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this