scholarly journals Incorporating Variable Demand Assignment Into Discrete Network Design Problem

2020 ◽  
Author(s):  
Alireza Rahimi
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Variable Demand ◽  
Total Cost ◽  
Demand Models ◽  
Level Problem ◽  
Level Method ◽  
Upper Level ◽  
Discrete Network Design Problem

The network design problem (NDP) is a bi-level problem with integer and decimal variables that aims to minimize the users' total cost under the budget constraints. Although utilizing variable demand models will theoretically change the NDP’s result, the demand was assumed to be fixed and known in the literature. In this paper, a mathematical analysis will be presented to justify the importance of using variable demand in the discrete network design problem (DNDP). The DNDP for Sioux-falls network will be solved in both variable and fixed demand conditions by using total enumeration (in the upper-level) and Frank-Wolf (in the lower-level) method. The result shows that DNDP findings for variable and fix demand conditions have significant differences, especially in the mid-budget level.

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 Solution Algorithm for a New Bi-Level Discrete Network Design Problem

1970 ◽  
Vol 25 (6) ◽  
pp. 513-524
Author(s):  
Qun Chen ◽  
Haibo Chen
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Solution Algorithm ◽  
Network Design Problem ◽  
Level Problem ◽  
Integer Solutions ◽  
Capacity Improvement ◽  
Upper Level ◽  
Branch Cutting ◽  
Discrete Network Design Problem

A new discrete network design problem (DNDP) was pro-posed in this paper, where the variables can be a series of integers rather than just 0-1. The new DNDP can determine both capacity improvement grades of reconstruction roads and locations and capacity grades of newly added roads, and thus complies with the practical projects where road capacity can only be some discrete levels corresponding to the number of lanes of roads. This paper designed a solution algorithm combining branch-and-bound with Hooke-Jeeves algorithm, where feasible integer solutions are recorded in searching the process of Hooke-Jeeves algorithm, lend -ing itself to determine the upper bound of the upper-level problem. The thresholds for branch cutting and ending were set for earlier convergence. Numerical examples are given to demonstrate the efficiency of the proposed algorithm.

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.

Park-and-Ride Network Design: A Goal Programming Approach

2014 ◽  
Vol 1030-1032 ◽  
pp. 2065-2068
Author(s):  
Xin Yuan Chen ◽  
Zhi Yuan Liu ◽  
Wei Deng
Keyword(s):  
Network Design ◽  
Goal Programming ◽  
Design Problem ◽  
Programming Model ◽  
Search Algorithm ◽  
Network Design Problem ◽  
Programming Approach ◽  
Multi Objective ◽  
Park And Ride ◽  
Upper Level

The paper addresses a park and ride network design problem in a bi-model transport network in a multi-objective decision making framework. A goal programming approach is adopted to solve the multi-objective park and ride network design problem. The goal programming approach considers the user-defined goals and priority structure, which are (i) traffic-efficient goal, (ii) total transit usage goal, (iii) spatial equity goal. This problem is formulated as a bi-level programming model. The upper level programming leads to minimize the deviation from stated goals in the context of a given priority ranking. While the lower level programming model is a modal split/traffic assignment model which is used to assess any given park and ride scheme. A heuristic tabu search algorithm is then adopted to solve this model.

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.

Sign in / Sign up

Export Citation Format

Share Document