The hierarchical network design problem for time-definite express common carriers

Cheng Chang Lin, Sheu Hua Chen

Research output: Contribution to journalArticle

56 Citations (Scopus)

Abstract

Time-definite express common carriers provide time guaranteed door-to-door express service for small parcel shipments. Centers pick up and deliver parcels, while hubs consolidate partial loads. Each center is connected through a secondary route to its primary hub, while hubs are mutually connected by primary routes in a hierarchical hub-and-spoke network. The carriers may dispatch large trucks/aircraft on the primary routes but utilize smaller trucks/aircraft on the secondary routes. The time-constrained hierarchical hub-and-spoke network design problem involves determining the fleet size and schedules on the primary and secondary routes to minimize the total operating cost, while satisfying the desired level of service. We developed a route-space directed network and modeled the problem as a 0-1 binary program. An implicit enumeration method with an embedded least time path subproblem was developed. The sensitivity analysis on the service level in a partial line-haul operations network for the second largest carrier in Taiwan showed that the costs are not strictly monotonically increasing with the service levels, rather they are monotonically non-decreasing according to a step function. In addition, the determination of the sort start and pickup cutoff times has a great impact on the total cost.

Original languageEnglish
Pages (from-to)271-283
Number of pages13
JournalTransportation Research Part B: Methodological
Volume38
Issue number3
DOIs
Publication statusPublished - 2004 Mar

Fingerprint

common carrier
Trucks
Aircraft
Pickups
Operating costs
Sensitivity analysis
Costs
aircraft
operating costs
costs
Taiwan
time
Common carrier
Network design
Hub

All Science Journal Classification (ASJC) codes

  • Civil and Structural Engineering
  • Transportation

Cite this

@article{76fbfe2ec8da4ef7891ce8ccfaa3823e,
title = "The hierarchical network design problem for time-definite express common carriers",
abstract = "Time-definite express common carriers provide time guaranteed door-to-door express service for small parcel shipments. Centers pick up and deliver parcels, while hubs consolidate partial loads. Each center is connected through a secondary route to its primary hub, while hubs are mutually connected by primary routes in a hierarchical hub-and-spoke network. The carriers may dispatch large trucks/aircraft on the primary routes but utilize smaller trucks/aircraft on the secondary routes. The time-constrained hierarchical hub-and-spoke network design problem involves determining the fleet size and schedules on the primary and secondary routes to minimize the total operating cost, while satisfying the desired level of service. We developed a route-space directed network and modeled the problem as a 0-1 binary program. An implicit enumeration method with an embedded least time path subproblem was developed. The sensitivity analysis on the service level in a partial line-haul operations network for the second largest carrier in Taiwan showed that the costs are not strictly monotonically increasing with the service levels, rather they are monotonically non-decreasing according to a step function. In addition, the determination of the sort start and pickup cutoff times has a great impact on the total cost.",
author = "Lin, {Cheng Chang} and Chen, {Sheu Hua}",
year = "2004",
month = "3",
doi = "10.1016/S0191-2615(03)00013-4",
language = "English",
volume = "38",
pages = "271--283",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",
number = "3",

}

The hierarchical network design problem for time-definite express common carriers. / Lin, Cheng Chang; Chen, Sheu Hua.

In: Transportation Research Part B: Methodological, Vol. 38, No. 3, 03.2004, p. 271-283.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The hierarchical network design problem for time-definite express common carriers

AU - Lin, Cheng Chang

AU - Chen, Sheu Hua

PY - 2004/3

Y1 - 2004/3

N2 - Time-definite express common carriers provide time guaranteed door-to-door express service for small parcel shipments. Centers pick up and deliver parcels, while hubs consolidate partial loads. Each center is connected through a secondary route to its primary hub, while hubs are mutually connected by primary routes in a hierarchical hub-and-spoke network. The carriers may dispatch large trucks/aircraft on the primary routes but utilize smaller trucks/aircraft on the secondary routes. The time-constrained hierarchical hub-and-spoke network design problem involves determining the fleet size and schedules on the primary and secondary routes to minimize the total operating cost, while satisfying the desired level of service. We developed a route-space directed network and modeled the problem as a 0-1 binary program. An implicit enumeration method with an embedded least time path subproblem was developed. The sensitivity analysis on the service level in a partial line-haul operations network for the second largest carrier in Taiwan showed that the costs are not strictly monotonically increasing with the service levels, rather they are monotonically non-decreasing according to a step function. In addition, the determination of the sort start and pickup cutoff times has a great impact on the total cost.

AB - Time-definite express common carriers provide time guaranteed door-to-door express service for small parcel shipments. Centers pick up and deliver parcels, while hubs consolidate partial loads. Each center is connected through a secondary route to its primary hub, while hubs are mutually connected by primary routes in a hierarchical hub-and-spoke network. The carriers may dispatch large trucks/aircraft on the primary routes but utilize smaller trucks/aircraft on the secondary routes. The time-constrained hierarchical hub-and-spoke network design problem involves determining the fleet size and schedules on the primary and secondary routes to minimize the total operating cost, while satisfying the desired level of service. We developed a route-space directed network and modeled the problem as a 0-1 binary program. An implicit enumeration method with an embedded least time path subproblem was developed. The sensitivity analysis on the service level in a partial line-haul operations network for the second largest carrier in Taiwan showed that the costs are not strictly monotonically increasing with the service levels, rather they are monotonically non-decreasing according to a step function. In addition, the determination of the sort start and pickup cutoff times has a great impact on the total cost.

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

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

U2 - 10.1016/S0191-2615(03)00013-4

DO - 10.1016/S0191-2615(03)00013-4

M3 - Article

AN - SCOPUS:0346750594

VL - 38

SP - 271

EP - 283

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

IS - 3

ER -