Implementation and evaluation of nonlinear bi- level programming model of equilibrium network design problem

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.

Download Full-text

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

The Annals of Regional Science ◽

10.1007/s001680200112 ◽

2003 ◽

Vol 37 (1) ◽

pp. 93-105 ◽

Cited By ~ 29

Author(s):

Jen-Jia Lin ◽

Cheng-Min Feng

Keyword(s):

Land Use ◽

Network Design ◽

Design Problem ◽

Programming Model ◽

Network Design Problem

Download Full-text

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

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.1030-1032.2065 ◽

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.

Download Full-text