A bi-level programming model for the land use - network design problem

2003 ◽  
Vol 37 (1) ◽  
pp. 93-105 ◽  
Author(s):  
Jen-Jia Lin ◽  
Cheng-Min Feng
Keyword(s):  
Land Use ◽  
Network Design ◽  
Design Problem ◽  
Programming Model ◽  
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.

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.

scholarly journals An Optimization Method for the Train Service Network Design Problem

2020 ◽  
Vol 2020 ◽  
pp. 1-18
Author(s):  
Jie Xiao ◽  
Yi Xie ◽  
Haowei Yu ◽  
Hongying Yan
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Programming Model ◽  
Optimal Solution ◽  
Network Design Problem ◽  
Small Scale ◽  
Improved Genetic Algorithm ◽  
Service Network ◽  
Service Network Design ◽  
Train Services

Effective railway freight transportation relies on a well-designed train service network. This paper investigates the train service network design problem at the tactical level for the Chinese railway system. It aims to determine the types of train services to be offered, how many trains of each service are to be dispatched per day (service frequency), and by which train services shipments are to be transported. An integer programming model is proposed to address this problem. The optimization model considers both through train services between nonadjacent yards, and two classes of service between two adjacent yards ( i.e., shuttle train services directly from one yard to its adjacent yard, and local train services that make at least one intermediate stop). The objective of the model is to optimize the transportation of all the shipments with minimal costs. The costs consist of accumulation costs, classification coststrain operation costs, and train travel costs. The NP-hard nature of the problem prevents an exact solution algorithm from finding the optimal solution within a reasonable time, even for small-scale cases. Therefore, an improved genetic algorithm is designed and employed here. To demonstrate the proposed model and the algorithm, a case study on a real-world sub-network in China is carried out. The computational results show that the proposed approach can obtain high-quality solutions with satisfactory speed. Moreover, comparative analysis on a case that assumes all the shuttle train services between any two adjacent yards to be provided without optimization reveals some interesting insights.

scholarly journals A Bi-Level Programming Model for the Railway Express Cargo Service Network Design Problem

Symmetry ◽  
2018 ◽  
Vol 10 (6) ◽  
pp. 227 ◽  
Author(s):  
Boliang Lin ◽  
Jianping Wu ◽  
Jiaxi Wang ◽  
Jingsong Duan ◽  
Yinan Zhao
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Programming Model ◽  
Network Design Problem ◽  
Service Network ◽  
Service Network Design

scholarly journals Continuous Network Design Based on the Paired Combinatorial Logit Stochastic User Equilibrium Model

2014 ◽  
Vol 8 (1) ◽  
pp. 316-322
Author(s):  
Xuefei Li ◽  
Maoxiang Lang
Keyword(s):  
Network Design ◽  
Objective Function ◽  
Equilibrium Model ◽  
Design Problem ◽  
Programming Model ◽  
User Equilibrium ◽  
Network Design Problem ◽  
Stochastic User Equilibrium ◽  
Level Model ◽  
The Impact

In order to design the traffic network more accurately, the bi-level programming model for the continuous network design problem based on the paired combinatorial Logit stochastic user equilibrium model is proposed in this study. In the model, the paired combinatorial Logit stochastic user equilibrium model which is used to characterize the route choice behaviors of the users is adopted in the lower level model, and the minimum summation of the system total costs and investment amounts is used in the upper objective function. The route-based self-regulated averaging (SRA) algorithm is designed to solve the stochastic user equilibrium model and the genetic algorithm (GA) is designed to get the optimal solution of the upper objective function. The effectiveness of the proposed combining algorithm which contains GA and SRA is verified by using a simple numerical example. The solutions of the bi-level models which use the paired combinatorial Logit stochastic user equilibrium model in the lower level model with different demand levels are compared. Finally, the impact of the dispersion coefficient parameter which influences the decision results of the network design problem is analyzed.

Sign in / Sign up

Export Citation Format

Share Document