scholarly journals Bi-objective load balancing multiple allocation hub location: a compromise programming approach

2020 ◽  
Vol 296 (1-2) ◽  
pp. 363-406 ◽  
Author(s):  
Rahimeh Neamatian Monemi ◽  
Shahin Gelareh ◽  
Anass Nagih ◽  
Dylan Jones

AbstractIn this paper we address unbalanced spatial distribution of hub-level flows in an optimal hub-and-spoke network structure of median-type models. Our study is based on a rather general variant of the multiple allocation hub location problems with fixed setup costs for hub nodes and hub edges in both capacitated and uncapacitated variants wherein the number of hub nodes traversed along origin-destination pairs is not constrained to one or two as in the classical models.. From the perspective of an infrastructure owner, we want to make sure that there exists a choice of design for the hub-level sub-network (hubs and hub edges) that considers both objectives of minimizing cost of transportation and balancing spatial distribution of flow across the hub-level network. We propose a bi-objective (transportation cost and hub-level flow variance) mixed integer non-linear programming formulation and handle the bi-objective model via a compromise programming framework. We exploit the structure of the problem and propose a second-order conic reformulation of the model along with a very efficient matheuristics algorithm for larger size instances.

2018 ◽  
Vol 14 (4) ◽  
pp. 155014771877326 ◽  
Author(s):  
Wei Zhong ◽  
Zhicai Juan ◽  
Fang Zong ◽  
Huishuang Su

Integration of urban and rural infrastructure is critical to integrating urban and rural public transport. A public transport hub is an important element of infrastructure, and it is the key facilities that serve as transferring points between cities and towns. The location of hub is related to the convenience of travel for urban and rural residents and the closeness of economic interactions between urban and rural areas. In this article, considering the background of the integration of urban and rural public transport, from the perspective of public transport hubs in urban and central town, a multi-level hub-and-spoke network is designed, and the location of integration of urban and rural public transport hub is determined. Based on the connection associated with central towns and the capacity constraints of hubs and to achieve the minimum total cost, this article proposes a mixed-integer programming model that employs a genetic and tabu search hybrid optimization algorithm to validate and analyze, which used the urban and rural public transport data from a specified area of Shandong province in China. The results indicate that the model can simultaneously determine locations for hubs in cities and central towns while minimizing total cost. The hub capacity constraint significantly influences the location of two-level hubs. The hub capacity constraint in the model can reduce the transportation cost for an entire network and optimize the transportation network. This study on urban and rural public transport hub location in a hub-and-spoke network not only reduces the transportation cost of the network but also completes and supplements the location theory of integration of urban and rural public transport.


Author(s):  
Omar Kemmar ◽  
Karim Bouamrane ◽  
Shahin Gelareh

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.


2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Yuxiong Ji ◽  
Yujing Zheng ◽  
Jizhou Zhao ◽  
Yu Shen ◽  
Yuchuan Du

This paper envisions a multimodal passenger-and-package sharing (PPS) network for urban logistics integrating metro, taxi, and truck. A hub-and-spoke structure is designed including hubs located at metro stations and service stores connected to the hubs. Packages are transported by metro on backbone links between the hubs and are carried by taxis or trucks between service stores and hubs, depending on the unit costs of these two modes and capacity constraint of the taxi. A mixed integer linear programming model for hub location problems—fusing the multiassignment p-hub median problem without capacity constraints and the capacitated multiassignment p-hub covering problem—is formulated to optimize the multimodal PPS network. The model is implemented based on the real-world data in Shanghai (China) under a series of scenarios to evaluate the network performance from two perspectives: the number of hubs and the proportion of taxi drivers who are willing to carry packages. The scenarios show that with increased number of hubs, the spatial distribution of hubs disperses from the city center to peripheral areas and more areas can be serviced by taxis. There is, however, a trade-off between the operation cost saved by taxis and the establishment cost of an extra hub. The analysis also presents that if the proportion of taxis willing to carry packages associates with the incentive payments to taxi drivers, an optimal value of incentives exists, by balancing the operation costs of taxis and trucks.


2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Farnaz Javadi Gargari ◽  
Mahjoube Sayad ◽  
Seyed Ali Posht Mashhadi ◽  
Abdolhossein Sadrnia ◽  
Arman Nedjati ◽  
...  

Medicine unreliability problem is taken into consideration as one of the most important issues in health supply chain management. This research is associated with the development of a multiobjective optimization problem for the selection of suppliers and distributors. To achieve the purposes, the optimal quota allocation is determined with respect to disruption of suppliers in a five-echelon supply chain network and consideration of the distributor centers as a hub location-allocation mode. The objective of the optimization model is involved in simultaneous minimization of transactions costs dealing with suppliers, expected purchasing costs from suppliers, expected percentages of delayed and returned products in each distributor, as well as transportation cost in each echelon and fixed cost for distributor centers, and finally maximization of the expected scores for suppliers and high priority of product customers. The optimization problem is formulated as a mixed-integer nonlinear programming model. The proposed optimization model is utilized to investigate a numerical case study for asthma-specific medicines. The analyzing procedure is conducted based on the collected real data from Cobel Darou pharmaceutical company in 2019. Furthermore, a fuzzy multichoice goal programming model is considered to solve the proposed optimization model by R optimization solver. The numerical results confirmed the authenticity of the model.


2021 ◽  
Vol 33 (2) ◽  
pp. 247-258
Author(s):  
Huang Yan ◽  
Xiaoning Zhang ◽  
Xiaolei Wang

The rapid growth of the intercity travel demand has resulted in enormous pressure on the passenger transportation network in a megaregion area. Optimally locating hubs and allocating demands to hubs influence the effectiveness of a passenger transportation network. This study develops a hierarchical passenger hub location model considering the service availability of hierarchical hubs. A mixed integer linear programming formulation was developed to minimize the total cost of hub operation and transportation for multiple travel demands and determine the proportion of passengers that access hubs at each level. This model was implemented for the Wuhan metropolitan area in four different scenarios to illustrate the applicability of the model. Then, a sensitivity analysis was performed to assess the impact of changing key parameters on the model results. The results are compared to those of traditional models, and the findings demonstrate the importance of considering hub choice behavior in demand allocation.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Weiya Chen ◽  
Kaixian He ◽  
Xiaoping Fang

This paper presents a mixed integer linear programming model (MILP) for optimizing the hybrid hub-and-spoke network operation for a less-than-truckload transportation service. The model aims to minimize the total operation costs (transportation cost and transfer cost), given the determined demand matrix, truck load capacity, and uncapacitated road transportation. The model also incorporates an incremental quantity discount function to solve the reversal of the total cost and the total demand. The model is applied to a real case of a Chinese transportation company engaged in nationwide freight transportation. The numerical example shows that, with uncapacitated road transportation, the total costs and the total vehicle trips of the hybrid hub-and-spoke network operation are, respectively, 8.0% and 15.3% less than those of the pure hub-and-spoke network operation, and the assumed capacity constraints in an extension model result in more target costs on the hybrid hub-and-spoke network. The two models can be used to support the decision making in network operations by transportation and logistics companies.


Filomat ◽  
2020 ◽  
Vol 34 (8) ◽  
pp. 2463-2484
Author(s):  
Dimitrije Cvokic

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.


2004 ◽  
Vol 6 (3) ◽  
pp. 237-252 ◽  
Author(s):  
Silvina M. Cabrini ◽  
Brian G. Stark ◽  
Hayri Önal ◽  
Scott H. Irwin ◽  
Darrel L. Good ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document