The feeder fleet planning problem of the same-day ground express service in Taiwan

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Time-definite freight delivery common carriers in Taiwan provide same-day ground express service for urgent customer shipments. Their line-haul operations consist of a single hub serving various centers in each express district with all of the hubs connected linearly. The fleet planning problem at the district level involves simultaneously determining the feeder fleet size and paths so that the total operating cost is minimized while meeting the service constraint. Under the triangle inequality principle, this is equivalent to a time and degree constrained minimum spanning tree with a fixed cost problem. We propose a branch and bound algorithm with two different bounding approaches using the largest carrier in Taiwan for numerical testing. The computational results show a smaller fleet size than the existing operation.

Original languageEnglish
Pages (from-to)165-191
Number of pages27
JournalAsia-Pacific Journal of Operational Research
Volume18
Issue number2
Publication statusPublished - 2001 Nov 1

Fingerprint

Planning
Taiwan
Hub
Common carrier
Fixed costs
Branch and bound algorithm
Testing
Freight
Operating costs
Minimum spanning tree

All Science Journal Classification (ASJC) codes

  • Management Science and Operations Research

Cite this

@article{c4e426e407b247d28507053462449e5f,
title = "The feeder fleet planning problem of the same-day ground express service in Taiwan",
abstract = "Time-definite freight delivery common carriers in Taiwan provide same-day ground express service for urgent customer shipments. Their line-haul operations consist of a single hub serving various centers in each express district with all of the hubs connected linearly. The fleet planning problem at the district level involves simultaneously determining the feeder fleet size and paths so that the total operating cost is minimized while meeting the service constraint. Under the triangle inequality principle, this is equivalent to a time and degree constrained minimum spanning tree with a fixed cost problem. We propose a branch and bound algorithm with two different bounding approaches using the largest carrier in Taiwan for numerical testing. The computational results show a smaller fleet size than the existing operation.",
author = "Cheng-Chang Lin",
year = "2001",
month = "11",
day = "1",
language = "English",
volume = "18",
pages = "165--191",
journal = "Asia-Pacific Journal of Operational Research",
issn = "0217-5959",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "2",

}

The feeder fleet planning problem of the same-day ground express service in Taiwan. / Lin, Cheng-Chang.

In: Asia-Pacific Journal of Operational Research, Vol. 18, No. 2, 01.11.2001, p. 165-191.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The feeder fleet planning problem of the same-day ground express service in Taiwan

AU - Lin, Cheng-Chang

PY - 2001/11/1

Y1 - 2001/11/1

N2 - Time-definite freight delivery common carriers in Taiwan provide same-day ground express service for urgent customer shipments. Their line-haul operations consist of a single hub serving various centers in each express district with all of the hubs connected linearly. The fleet planning problem at the district level involves simultaneously determining the feeder fleet size and paths so that the total operating cost is minimized while meeting the service constraint. Under the triangle inequality principle, this is equivalent to a time and degree constrained minimum spanning tree with a fixed cost problem. We propose a branch and bound algorithm with two different bounding approaches using the largest carrier in Taiwan for numerical testing. The computational results show a smaller fleet size than the existing operation.

AB - Time-definite freight delivery common carriers in Taiwan provide same-day ground express service for urgent customer shipments. Their line-haul operations consist of a single hub serving various centers in each express district with all of the hubs connected linearly. The fleet planning problem at the district level involves simultaneously determining the feeder fleet size and paths so that the total operating cost is minimized while meeting the service constraint. Under the triangle inequality principle, this is equivalent to a time and degree constrained minimum spanning tree with a fixed cost problem. We propose a branch and bound algorithm with two different bounding approaches using the largest carrier in Taiwan for numerical testing. The computational results show a smaller fleet size than the existing operation.

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

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

M3 - Article

VL - 18

SP - 165

EP - 191

JO - Asia-Pacific Journal of Operational Research

JF - Asia-Pacific Journal of Operational Research

SN - 0217-5959

IS - 2

ER -