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 meth...

In this paper, we introduce a new hub-and-spoke structure for service networks based on round-trips as practiced by some transport providers. This problem is variant of Uncapacitated Hub Location Problem wherein the spoke nodes allocated to hub node form (cycles) starting from and ending node. motivated two real-life practices in logistics runaway connections with their associated economies sca...

 We introduce a dynamic and stochastic transportation problem consisting of two subproblems. For parcel transportation in hub-and-spoke networks, swap containers are used to carry out hub-to-hub shipments. This constitutes a pickup and delivery problem on the operational level. On the tactical level, empty swap containers are balanced over the hub-network in order to match the stochastic deman...

Numerous recently uncovered cartels operated along the supply chain, with firms at one end facilitating collusion other – hub-and-spoke arrangements. These are hard to rationalize because they induce double marginalization and higher costs. We examine Canada’s alleged bread cartel provide first comprehensive analysis of collusion. make three contributions: i) Using court documents pricing data ...