A single-level mixed integer linear formulation for a bi-level discrete network design problem

2011 ◽  
Vol 47 (5) ◽  
pp. 623-640 ◽  
Author(s):  
Hamid Farvaresh ◽  
Mohammad Mehdi Sepehri
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Linear Formulation ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Single Level ◽  
Mixed Integer Linear Formulation ◽  
Discrete Network Design Problem

scholarly journals Discrete Network Design Problem

2020 ◽  
Author(s):  
Alireza Rahimi
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Variable Demand ◽  
Total Cost ◽  
Discrete Network Design Problem ◽  
The Impact ◽  
Budget Restrictions

The network design problem aims to minimize the travelers’ total cost under budget restrictions. This research provides a framework to incorporate variable demand assignment in the discrete network design problem. The findings emphasized the impact of considering variable demand in discrete network design problem.

scholarly journals Multi-Period Network Design Problem in Regional Hazardous Waste Management Systems

2019 ◽  
Vol 16 (11) ◽  
pp. 2042 ◽  
Author(s):  
Jun Zhao ◽  
Lixiang Huang
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Programming Model ◽  
Planning Horizon ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Hazardous Wastes ◽  
Total Risk ◽  
Total Cost ◽  
Treatment And Disposal

The management of hazardous wastes in regions is required to design a multi-echelon network with multiple facilities including recycling, treatment and disposal centers servicing the transportation, recycling, treatment and disposal procedures of hazardous wastes and waste residues. The multi-period network design problem within is to determine the location of waste facilities and allocation/transportation of wastes/residues in each period during the planning horizon, such that the total cost and total risk in the location and transportation procedures are minimized. With consideration of the life cycle capacity of disposal centers, we formulate the problem as a bi-objective mixed integer linear programming model in which a unified modeling strategy is designed to describe the closing of existing waste facilities and the opening of new waste facilities. By exploiting the characteristics of the proposed model, an augmented ε -constraint algorithm is developed to solve the model and find highly qualified representative non-dominated solutions. Finally, computational results of a realistic case demonstrate that our algorithm can identify obviously distinct and uniformly distributed representative non-dominated solutions within reasonable time, revealing the trade-off between the total cost and total risk objectives efficiently. Meanwhile, the multi-period network design optimization is superior to the single-period optimization in terms of the objective quality.

Research on Uncertain Network Design Problem

2014 ◽  
Vol 505-506 ◽  
pp. 613-618
Author(s):  
Yang Wang ◽  
Jin Xin Cao ◽  
Ri Dong Wang ◽  
Xia Xi Li
Keyword(s):  
Stochastic Model ◽  
Network Design ◽  
Design Problem ◽  
User Equilibrium ◽  
Network Design Problem ◽  
Construction Costs ◽  
Travel Costs ◽  
Uncertain Network ◽  
Level Model ◽  
Discrete Network Design Problem

In this study, a kind of uncertain network design problem, network design problem under uncertain construction cost, is researched.The discrete network design problem under uncertain construction costs deals with the selection of links to be added to the existing network, so as to minimize the total travel costs in the network. It is assumed that the value of the demand between each pair of origin and destination is a constant and the construction costs of each potential link addition follow a certain stochastic distribution. In this paper, a bi-level and stochastic programming model for the discrete network design problem is proposed. The construction costs of potential links are assumed as random variables and mutually independent with each other in this model. The upper-level model is a chance constrain model with the objective function of minimizing the total travel costs in the network, and the lower-level model is a user equilibrium model. The stochastic model is then transformed into a deterministic one. A branch-and-bound solution algorithm is designed to solve the deterministic model in an efficient way. At last, a computational experiment is conducted to illustrate the effectiveness and efficiency of the approach proposed in this paper. The results show that the stochastic model is more flexible and practical compared with the deterministic one.

scholarly journals Some Computational Insights on the Optimal Bus Transit Route Network Design Problem

2012 ◽  
Vol 47 (3) ◽  
Author(s):  
Wei (David) Fan ◽  
Randy B. Machemehl
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Large Scale ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Research Experiences ◽  
Bus Transit ◽  
Route Network ◽  
Transit Route ◽  
Demand Aggregation

The objective of this paper is to present some computational insights based on previous extensive research experiences on the optimal bus transit route network design problem (BTRNDP) with zonal demand aggregation and variable transit demand. A multi-objective, nonlinear mixed integer model is developed. A general meta-heuristics-based solution methodology is proposed. Genetic algorithms (GA), simulated annealing (SA), and a combination of the GA and SA are implemented and compared to solve the BTRNDP. Computational results show that zonal demand aggregation is necessary and combining metaheuristic algorithms to solve the large scale BTRNDP is very promising.

Sign in / Sign up

Export Citation Format

Share Document