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

Lin, Cheng Chang; Chen, Sheu Hua

doi:10.1016/s0191-2615(03)00013-4

Cited by 68 publications

(40 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Lin et al (2003), Lin and Chen (2004), and Chen et al (2008) focus on routing decisions over a given network. Lin and Chen (2004) allow two modes of transport and determine the fleet size of each mode. Chen et al (2008) design tree structures over the already established network while minimizing the violations of the service levels.…”

Section: Literature Reviewmentioning

confidence: 99%

Release Time Scheduling and Hub Location for Next-Day Delivery

Yaman

Karaşan

Kara

2012

Operations Research

View full text Add to dashboard Cite

Inspired by a real-life problem faced by one of the largest ground-based cargo companies of Turkey, the current study introduces a new facet to the hub location literature. The release time scheduling and hub location problem aims to select a specified number of hubs from a fixed set of demand centers, to allocate each demand center to a hub, and to decide on the release times of trucks from each demand center in such a way that the total amount of cargo guaranteed to be delivered to every potential destination by the next day is not below a threshold and the total routing cost is minimized. The paper introduces integer programming models to solve this problem in the special cases when the cargo uniformly arrives to each demand center during the day and the more realistic pattern of when the cargo arrivals exhibit a piecewise linear form. Several classes of valid inequalities are proposed to strengthen the formulations. Extensions with multiple service levels and discrete sets for release times are also discussed. Computational results show the computational viability of the models under realistic scenarios as well as the validity of the proposed problems in answering several interesting questions from the cargo sector's perspective.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Release Time Scheduling and Hub Location for Next-Day Delivery

Yaman

Karaşan

Kara

2012

Operations Research

View full text Add to dashboard Cite

show abstract

“…The authors do not integrate loaded and empty container flow decisions in a single model. Lin and Chen (2004) study a network design problem of a door-to-door express service. An air-ground intermodal carrier provides a delivery service in a hierarchical hub-and-spoke network.…”

Section: Network Operatormentioning

confidence: 99%

Simulation and optimisation of intermodal barge transport networks

Caris

2010

4OR-Q J Oper Res

View full text Add to dashboard Cite

“…Two algorithms, a Lagrangian Relaxation and implicit enumeration algorithm with e-inequality are used to solve the flow routing problem. Lin and Chen (2004) considers the integrated flow routing and fleet scheduling problem of an air-ground express carrier. Clusters of nodes are created, in which each such cluster contains a hub location.…”

Section: Related Literaturementioning

confidence: 99%

“…Again, fleet routes are derived and each such route can be performed by one vehicle or aircraft. Compared to their work in Lin and Chen (2004), no clustering operation is performed although the model will still assign a node location to one hub. However, the hub used for inbound operations can differ from the hub used for outbound operations, though all inbound (outbound) flow will use the same route to (from) the hub location.…”

Section: Related Literaturementioning

confidence: 99%

Enriching the tactical network design of express service carriers with fleet scheduling characteristics

et al. 2010

View full text Add to dashboard Cite

Express service carriers provide time-guaranteed deliveries of parcels via a network consisting of nodes and hubs. In this, nodes take care of the collection and delivery of parcels, and hubs have the function to consolidate parcels in between the nodes. The tactical network design problem assigns nodes to hubs, determines arcs between hubs, and routes parcels through the network. Afterwards, fleet scheduling creates a schedule for vehicles operated in the network. The strong relation between flow routing and fleet scheduling makes it difficult to optimise the Flex Serv Manuf J (2010) 22:3-35 DOI 10.1007 network cost. Due to this complexity, fleet scheduling and network design are usually decoupled. We propose a new tactical network design model that is able to include fleet scheduling characteristics (like vehicle capacities, vehicle balancing, and drivers' legislations) in the network design. The model is tested on benchmark data based on instances from an express provider, resulting in significant cost reductions. 123

show abstract

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

Cited by 68 publications

References 7 publications

Release Time Scheduling and Hub Location for Next-Day Delivery

Release Time Scheduling and Hub Location for Next-Day Delivery

Simulation and optimisation of intermodal barge transport networks

Enriching the tactical network design of express service carriers with fleet scheduling characteristics

Contact Info

Product

Resources

About