Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem

Aykin, Turgut

doi:10.1016/0377-2217(94)90062-0

Cited by 183 publications

(78 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Afterwards, several researchers studied strategic and tactical hub network design and several variants of the problem are proposed. The strategic hub network design selects the locations of hubs in the network such that the sum of unit transport cost is minimised (O'Kelly 1992; Aykin 1994Aykin , 1995O'Kelly et al 1996), the largest transport time is minimised (Kara and Tansel 2001), the number of hubs is minimised (Kara and Tansel 2003;Tan and Kara 2007;Yaman et al 2007;Alumur and Kara 2008), or the total freight to be delivered to customers within a certain time bound is maximised (Yaman et al 2008). This paper focuses on the tactical hub network design.…”

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

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

show abstract

“…Aykin [35] presents the capacitated versions of the hub location problem with fixed costs. Ernst and Krishnamoorthy [36] present two new formulations modified versions of the previous mixed integer formulations to the p-hub median problem for the capacitated single allocation hub location problem.…”

Section: Hub Location Problem With Fixed Costsmentioning

confidence: 99%

The hub location and routing problem

Bayraktar¹

1996

Location Science

View full text Add to dashboard Cite

Hubs are special facilities that consolidate and disseminate flows in many-to-many distribution systems. The hub location problem aims to find locations of hubs and allocate non-hub nodes directly to the hubs. However, this problem is necessary to extend when nodes do not have sufficient demand to justify direct connections between the non-hub nodes to the hubs since such direct connections increase the number of vehicles required and decrease the utilization of vehicles. Hence, it is necessary to construct local tours among the nodes allocated to the same hubs to generate economies of scale and to decrease vehicle costs. Nevertheless, forcing each non-hub node to be visited by a local tour is not the best way to design a many-to-many distribution system. Therefore, in this study two options for each non-hub node are given: (i) either it could be visited by a local tour or (ii) it could be directly connected to a hub without an economy of scale. We develop a mixed integer programming formulation and strengthen it with valid inequalities. We also develop three different Benders formulations as exact solution methods. In addition, we develop a hierarchical heuristic with two phases in order to solve large-sized problem instances. We test the performances of our solution methodologies on CAB and TR data sets. Anahtar sözcükler : ADÜ yer seçimi, rotalama, Benders ayrıştırma yöntemi. Keywordsiv

show abstract

“…A common way of addressing congestion in SAHLP and SApHLP networks is to limit the amount of traffic a installed hub can handle [7,8,20,30,41,44,52]. Unfortunately, capacity constraints do not mimic the explosive nature of congestion: the more flow a hub attracts, the harder the handling process becomes, the greater the costs.…”

Section: Introductionmentioning

confidence: 99%

Addressing congestion on single allocation hub-and-spoke networks

Camargo

Miranda

2012

Pesqui. Oper.

View full text Add to dashboard Cite

ABSTRACT. When considering hub-and-spoke networks with single allocation, the absence of alternative routes makes this kind of systems specially vulnerable to congestion effects. In order to improve the design of such networks, congestion costs must be addressed. This article deploys two different techniques for addressing congestion on single allocation hub-and-spoke networks: the Generalized Benders Decomposition and the Outer Approximation method. Both methods are able to solve large scale instances. Computational experiments show how the adoption of advanced solution strategies, such as Pareto-optimal cut generation on the Master Problem branch-and-bound tree, may be decisive. They also demonstrate that the solution effort is not only associated with the size of the instances, but also with their combination of the installation and congestion costs.

show abstract

Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem

Cited by 183 publications

References 11 publications

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

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

The hub location and routing problem

Addressing congestion on single allocation hub-and-spoke networks

Contact Info

Product

Resources

About