In this paper we propose several heuristics for the Uncapacitated -Allocation -Hub Median Problem. In the classical -hub problem, given a set of nodes with pairwise traffic demands, we must select of them as hub locations and route all traffics through them at a minimum cost. We target here an extension, called the -allocation -hub median problem, recently proposed by Yaman (2011), in which eve...

This paper deals with a hub location-routing problem (HLRP) which integrates the hub location problem (HLP) and the multi-hub vehicle routing problem (MH-VRP) in parcel delivery service. The HLRP is very difficult to be solved since it is composed of two NP-hard problems, the HLP and the MH-VRP. To solve these problems simultaneously we present a novel solution framework which divides the probl...

In this paper, we concentrate on the service structure of ground-transportation based cargo delivery companies. The transient times that arise from nonsimultaneous arrivals at hubs (typically spent for unloading, loading, and sorting operations) can constitute a significant portion of the total delivery time for cargo delivery systems. The latest arrival hub location problem is a new minimax mo...

This paper deals with hub-and-spoke network design in the liner shipping sector. It introduces a capacitated directed cycle hub location and cargo routing problem under congestion. The involves four decisions: of ports; allocation non-hub ports to construction cyclic route at port level; between all origin-destination demand pairs network. objective is minimize cost which includes fixed opening...

Introduction The Airline Deregulation Act (ADA) of 1978 caused many changes in the industry. For the first time in 40 years, new airlines were permitted to enter the industry, and all airlines could choose the routes they would serve and the fares they would charge. Airlines were also free to exit the industry (go bankrupt), if they made poor choices in these matters. Naturally, this has led to...

A different approach to the capacitated single allocation hub location problem is presented. Instead of using capacity constraints to limit the amount of flow that can be received by the hubs, we introduce a second objective function to the model (besides the traditional cost minimizing function), that tries to minimize the time to process the flow entering the hubs. Two bi-criteria single allo...