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 language | English |
|---|---|
| Pages (from-to) | 165-191 |
| Number of pages | 27 |
| Journal | Asia-Pacific Journal of Operational Research |
| Volume | 18 |
| Issue number | 2 |
| Publication status | Published - 2001 Nov 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Management Science and Operations Research
Cite this
}
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 journal › Article
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 -