scholarly journals Solving Continuous Network Design Problem with Generalized Geometric Programming Approach

2016 ◽  
Vol 2567 (1) ◽  
pp. 38-46
Author(s):  
Bo Du ◽  
David Z. W. Wang
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Geometric Programming ◽  
Network Design Problem ◽  
Programming Approach ◽  
Generalized Geometric Programming

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.

Sign in / Sign up

Export Citation Format

Share Document