An Optimal Design for the Capacitated Hub Location Problem with Asymmetric Allocation

2013 ◽  
Vol 284-287 ◽  
pp. 1203-1207
Author(s):  
Ji Ung Sun
Keyword(s):  
Solution Method ◽  
Location Problem ◽  
Programming Model ◽  
Service Level ◽  
Transportation Costs ◽  
Ant Colony Optimization Algorithm ◽  
Hub Location ◽  
Hub Location Problem ◽  
Hub And Spoke ◽  
Pass Through

Hub and Spoke (H&S) network reflecting the scale economies through consolidation and a large amount of freight transportation is widely used to reduce total transportation costs. H&S network has transportation routes that go to the final delivery point pass through hub linking destination from hub linking origin. In this paper we present a 0-1 integer programming model and a solution method for the capacitated asymmetric allocation hub location problem (CAAHLP). We determine the number of hubs, the locations of hubs, and asymmetric allocation of non-hub nodes to hub with the objective of minimum total transportation costs satisfying the required service level. As the CAAHLP has impractically demanding for the large sized problem, we develop a solution method based on ant colony optimization algorithm. We investigate performance of the proposed solution method through the comparative study. The experimental results show that the newly proposed asymmetrically allocated network can provide better solution than the singly allocated network in terms of cost and service level.

An Integrated Hub Location and Multi-Depot Vehicle Routing Problem

2013 ◽  
Vol 409-410 ◽  
pp. 1188-1192 ◽  
Author(s):  
Ji Ung Sun
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Solution Method ◽  
Location Problem ◽  
Total System ◽  
Ant Colony Optimization Algorithm ◽  
Hub Location ◽  
Hub Location Problem ◽  
Routing Problem ◽  
Number Of Customers

This paper considers the integrated hub location and multi-depot vehicle routing problem. In this type of problem, we have to determine the location of hubs within a set of candidate locations, allocation of customers to each selected hub location and routes of the vehicles to meet the demands of number of customers in order to minimize the total system cost. To solve these problems simultaneously we apply a hierarchical structure, which hub location as the main problem and vehicle routing as a subordinate one. An integrated solution method based on ant colony optimization algorithm is developed which solves hub location problem and vehicle routing problem hierarchically. Its performance is examined through a comparative study.

scholarly journals Location of regional and international hub ports in liner shipping

2017 ◽  
Vol 2 (2) ◽  
pp. 114-125 ◽  
Author(s):  
Jianfeng Zheng ◽  
Cong Fu ◽  
Haibo Kuang
Keyword(s):  
Design Methodology ◽  
Location Problem ◽  
Programming Model ◽  
Liner Shipping ◽  
Mixed Integer ◽  
Eastern Asia ◽  
Hub Location ◽  
Hub Location Problem ◽  
Content Type ◽  
Western Asia

Purpose This paper aims to investigate the location of regional and international hub ports in liner shipping by proposing a hierarchical hub location problem. Design/methodology/approach This paper develops a mixed-integer linear programming model for the authors’ proposed problem. Numerical experiments based on a realistic Asia-Europe-Oceania liner shipping network are carried out to account for the effectiveness of this model. Findings The results show that one international hub port (i.e. Rotterdam) and one regional hub port (i.e. Zeebrugge) are opened in Europe. Two international hub ports (i.e. Sokhna and Salalah) are located in Western Asia, where no regional hub port is established. One international hub port (i.e. Colombo) and one regional hub port (i.e. Cochin) are opened in Southern Asia. One international hub port (i.e. Singapore) and one regional hub port (i.e. Jakarta) are opened in Southeastern Asia and Australia. Three international hub ports (i.e. Hong Kong, Shanghai and Yokohama) and two regional hub ports (i.e. Qingdao and Kwangyang) are opened in Eastern Asia. Originality/value This paper proposes a hierarchical hub location problem, in which the authors distinguish between regional and international hub ports in liner shipping. Moreover, scale economies in ship size are considered. Furthermore, the proposed problem introduces the main ports.

scholarly journals Hub location problem in round-trip service applications

2020 ◽  
Author(s):  
Omar Kemmar ◽  
Karim Bouamrane ◽  
Shahin Gelareh
Keyword(s):  
Economies Of Scale ◽  
Location Problem ◽  
Service Providers ◽  
Real Life ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Hub Location ◽  
Service Networks ◽  
Hub Location Problem ◽  
Hub And Spoke

In this paper, we introduce a new hub-and-spoke structure for service networks based on round-trips as practiced by some transport service providers. This problem is a variant of Uncapacitated Hub Location Problem wherein the spoke nodes allocated to a hub node form round-trips (cycles) starting from and ending to the hub node. This problem is motivated by two real-life practices in logistics wherein  runaway  nodes and  runaway  connections with their associated economies of scale were foreseen to increase redundancy in the network. We propose a mixed integer linear programming mathematical model with exponential number of constraints. In addition to the separation routines for separating from among exponential constraints, we propose a hyper-heuristic based on reinforcement learning and its comparable counterpart as a variable neighborhood search. Our extensive computational experiments confirm efficiency of the proposed approaches.In this paper, we introduce a new hub-and-spoke structure for service networks based on round-trips as practiced by some transport service providers. This problem is a variant of Uncapacitated Hub Location Problem wherein the spoke nodes allocated to a hub node form round-trips (cycles) starting from and ending to the hub node. This problem is motivated by two real-life practices in logistics wherein  runaway  nodes and  runaway  connections with their associated economies of scale were foreseen to increase redundancy in the network. We propose a mixed integer linear programming mathematical model with exponential number of constraints. In addition to the separation routines for separating from among exponential constraints, we propose a hyper-heuristic based on reinforcement learning and its comparable counterpart as a variable neighborhood search. Our extensive computational experiments confirm efficiency of the proposed approaches.

scholarly journals Megaregional Passenger Transportation Hub Location Problem Considering Congestion Effects

2021 ◽  
Vol 33 (4) ◽  
pp. 551-563
Author(s):  
Huang Yan ◽  
Xiaoning Zhang
Keyword(s):  
Location Problem ◽  
Travel Demand ◽  
Programming Model ◽  
Transportation Network ◽  
Network Capacity ◽  
Mixed Integer ◽  
Hub Location ◽  
Hub Location Problem ◽  
Passenger Transportation ◽  
Congestion Effects

The need to make effective plans for locating transportation hubs is of increasing importance in the megaregional area, as recent research suggests that the growing intercity travel demand affects the efficiency of a megaregional transportation system. This paper investigates a hierarchical facility location problem in a megaregional passenger transportation network. The aim of the study is to determine the locations of hub facilities at different hierarchical levels and distribute the demands to these facilities with minimum total cost, including investment, transportation, and congestion costs. The problem is formulated as a mixed-integer nonlinear programming model considering the service availability structure and hub congestion effects. A case study is designed to demonstrate the effectiveness of the proposed model in the Wuhan metropolitan area. The results show that the congestion effects can be addressed by reallocating the demand to balance the hub utilisation or constructing new hubs to increase the network capacity. The methods of appropriately locating hubs and distributing traffic flows are proposed to optimise the megaregional passenger transportation networks, which has important implications for decision makers.

scholarly journals An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Ji Ung Sun
Keyword(s):  
Evolutionary Algorithm ◽  
Vehicle Routing ◽  
Solution Method ◽  
Programming Model ◽  
Mixed Integer ◽  
Hub Location ◽  
Hub Location Problem ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

We consider a capacitated hub location-routing problem (HLRP) which combines the hub location problem and multihub vehicle routing decisions. The HLRP not only determines the locations of the capacitatedp-hubs within a set of potential hubs but also deals with the routes of the vehicles to meet the demands of customers. This problem is formulated as a 0-1 mixed integer programming model with the objective of the minimum total cost including routing cost, fixed hub cost, and fixed vehicle cost. As the HLRP has impractically demanding for the large sized problems, we develop a solution method based on the endosymbiotic evolutionary algorithm (EEA) which solves hub location and vehicle routing problem simultaneously. The performance of the proposed algorithm is examined through a comparative study. The experimental results show that the proposed EEA can be a viable solution method for the supply chain network planning.

Centralized Carrier Collaboration Multihub Location Problem for Less-Than-Truckload Industry

2012 ◽  
Vol 2269 (1) ◽  
pp. 20-28 ◽  
Author(s):  
Salvador Hernández ◽  
Avinash Unnikrishnan ◽  
Satyen S. Awale
Keyword(s):  
Location Problem ◽  
Network Size ◽  
Expected Profit ◽  
Third Party ◽  
Third Party Logistics ◽  
Hub Location ◽  
Hub Location Problem ◽  
Hub And Spoke ◽  
Profit Margins ◽  
Insight Into

A centralized carrier collaboration multihub location problem (CCCMLP) for the small to medium-sized less-than-truckload industry is addressed. In the CCCMLP, a central entity (e.g., a third-party logistics firm) seeks a set of collaborative consolidation transshipment hubs to establish a hybrid collaborative hub-and-spoke system that minimizes the total collaborative costs for the set of collaborating carriers. Previous studies focused on addressing the exchange of capacity without considering the location of transfer hubs and the routes that connect them. A carrier has the option either to collaborate or to ship its demand directly without collaborating. The decision depends on the expected profit margin over shipping directly while following a revenue-generating, rate-setting behavior. The CCCMLP was formulated as a variant of the P-hub location problem, which is NP-hard and solved with Lagrangian relaxation. Numerical experiments were conducted to gain insight into the performance of the CCCMLP formulation under various network sizes and numbers of hubs. The results indicate that larger expected profit margins from collaborative carriers applying revenue-generating behavior would increase the likelihood of collaboration by carriers. As the network size increases, the effect of hybrid hub location costs drops.

scholarly journals A leader-follower single allocation hub location problem under fixed markups

Filomat ◽  
2020 ◽  
Vol 34 (8) ◽  
pp. 2463-2484
Author(s):  
Dimitrije Cvokic
Keyword(s):  
Location Problem ◽  
State Of The Art ◽  
Mixed Integer ◽  
Hub Location ◽  
Hub Location Problem ◽  
Hub And Spoke ◽  
Solution Approach ◽  
Feasible Solutions ◽  
S Model ◽  
Robust Variant

This study examines a scenario in which two competitors, called a leader and a follower, sequentially create their hub and spoke networks to maximize their profits. It is assumed that a non-hub node can be allocated to at most one hub. The pricing is regulated with a fixed markup. Demand is split according to the logit model, and customers patronize their choice of route by a price. Two variants of this Stackelberg competition are addressed: deterministic and robust. In both cases, it was shown how to present the problem as a bi-level mixed-integer non-linear program. When it comes to the deterministic variant, a mixed-integer linear reformulation of the follower?s model is given. For the robust variant, it is shown how to reformulate the follower?s program as a mixed-integer conic-quadratic one. The benefits of these reformulations are that they allow the usage of state-of-the-art solvers in finding feasible solutions. As a solution approach for the leader, an alternating heuristic is proposed. Computational experiments are conducted on the set of Cinstances and thoroughly discussed, providing some managerial insights.

Sign in / Sign up

Export Citation Format

Share Document