The hub covering flow problem

Abstract

The hub covering flow problem (HCFP) seeks to find the minimal cost hub-and-spoke network by optimally locating hub nodes and assigning non-hub nodes to the hub nodes subject to a coverage constraint. The cost of establishing such a hub network is based on a fixed cost of opening hubs and the cost of transporting demand flow through the network. We also present an extension called the multiaircraft HCFP. The results from computational experiments are presented and discussed.

Exact solution of hub network design problems with profits

“…In MHCPs, demand is covered if both origin and destination nodes are within a specified distance of a hub node. These problems were introduced by Campbell (1994) and more recently extended by Hwang and Lee (2012) and Lowe and Sim (2012). Similarly to HNDPPs, MHCPs allow some commodities not to be served (in this case due to covering constraints).…”

Location of a hierarchy of HIV/AIDS test laboratories in an inbound hub network: case study in South Africa

“…They point out that hub location is a network design problem, with hubs and demand nodes constituting a two-level network design. Lowe and Sim (2013) attend to the class of hub problems with maximum distance constraints but without limitations on capacity. Farahani et al (2013) indicate the range of both exact solution techniques and heuristic or metaheuristic approaches employed in finding solutions to hub location problems, including continuous or plane locations.…”

Hub network design problems with profits

“…More recently, Hwang and Lee (2012) study the uncapacitated single allocation p-hub maximal covering problem, which maximizes the overall demand that can be covered by p facilities within a fixed coverage radius. Lowe and Sim (2012) studies a MHCP that considers jointly hubs setup costs and flow transportation costs, subject to covering constraints. Similarly to HNDPPs, in MHCPs some commodities may remain unserved.…”