A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil

Cunha, Cláudio Barbieri da; Silva, Marcos Roberto

doi:10.1016/j.ejor.2005.03.057

Cited by 133 publications

(62 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It is clear that (X * , Y * , U * , V * ) is feasible to R-SAHLP as it satisfies all the constraints (2) - (10). By multiplying U * ijn to both sides of (11) and sum them up over all i, j > i, n,…”

Section: Linear Models From Linear Reformulationmentioning

confidence: 99%

“…O'Kelly [33] and Campell [4] study a few formulas of fixed cost HLP. There also exist many literatures in search of effective solution algorithms for these problems, see [10], [7] and [5] for examples. We mention that [20] explore the polyhedral aspect of HLP and [21] develop a method of lifting facets from facility location problems(FLPs) to HLPs and derive a tighter formulation for MA fixed cost HLP.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

The reliable hub-and-spoke design problem: Models and algorithms

An¹,

Zhang²,

Zeng³

2015

Transportation Research Part B: Methodological

104

View full text Add to dashboard Cite

This paper presents a study on reliable single and multiple allocation hub-and-spoke network design problems where disruptions at hubs and the resulting hub unavailability can be mitigated by backup hubs and alternative routes. It builds nonlinear mixed integer programming models and presents linearized formulas. To solve those difficult problems, Lagrangian relaxation and Branch-and-Bound methods are developed to efficiently obtain optimal solutions. Numerical studies of proposed solution methods on practical instances are reported, along with a few insights of system design.Key words: reliable network design; hub-and-spoke; Lagrangian Relaxation; Branch-and- Bound Background and MotivationThe hub-and-spoke system has been widely employed in various industrial applications.It is a fully connected network with material/information flow between any two nodes being processed at a small number of critical nodes (i.e. hubs) and moved through interhub links. Compared with the one built with the point-to-point structure, it has a much smaller number of links. Also, because traffic flows are consolidated by hubs and interhub links, significantly less operating cost can be achieved because of economies of scale.Given such advantages, industry companies including airlines, logistics companies, and telecommunications firms extensively utilize the hub-and-spoke architecture to reduce the construction and operating costs.

show abstract

Section: Linear Models From Linear Reformulationmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

The reliable hub-and-spoke design problem: Models and algorithms

An¹,

Zhang²,

Zeng³

2015

Transportation Research Part B: Methodological

104

View full text Add to dashboard Cite

show abstract

“…In the SP (20)- (25), there are two sets of variables, x and g, coupled by the constraints (21). After dualizing these constraints by the associated dual multipliers β, a decomposable problem is implied:…”

Section: Benders Subproblemmentioning

confidence: 99%

“…Most of the algorithms [2,28,29,38,39,46,51,54] to solve the SApHLP are based on specialized heuristics and branch-and-bound procedures, while those [1,17,21,53,56] addressed to the SAHLP rely on meta-heuristics like genetic and simulated annealing algorithms.…”

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

“…O'Kelly (1992) introduces the hub location problem with fixed costs, which is first linearized by Campbell (1994). Hamacher et al (2004), Labbé and Yaman (2004), Labbé et al (2005), and Marin et al (2006) Canovas et al (2007), Cunha and Silva (2007), Chen (2007), and Silva and Cunha (2009). Kara and Tansel (2000) and Ernst et al (2009) give integer programming formulations for the p-hub center problem.…”

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

A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil

Cited by 133 publications

References 19 publications

The reliable hub-and-spoke design problem: Models and algorithms

The reliable hub-and-spoke design problem: Models and algorithms

Addressing congestion on single allocation hub-and-spoke networks

Release Time Scheduling and Hub Location for Next-Day Delivery

Contact Info

Product

Resources

About