(Created page with " == Abstract == In this study, we present a bilevel programming model in which upper level is defined as a biobjective problem and the lower level is considered as a stochast...")
 
m (Scipediacontent moved page Draft Content 574708503 to 238,295gk)
 
(No difference)

Latest revision as of 21:32, 22 March 2021

Abstract

In this study, we present a bilevel programming model in which upper level is defined as a biobjective problem and the lower level is considered as a stochastic user equilibrium assignment problem. It is clear that the biobjective problem has two objectives: the first maximizes the reserve capacity whereas the second minimizes performance index of a road network. We use a weighted-sum method to determine the Pareto optimal solutions of the biobjective problem by applying normalization approach for making the objective functions dimensionless. Following, a differential evolution based heuristic solution algorithm is introduced to overcome the problem presented by use of biobjective bilevel programming model. The first numerical test is conducted on two-junction network in order to represent the effect of the weighting on the solution of combined reserve capacity maximization and delay minimization problem. Allsop & Charlesworth's network, which is a widely preferred road network in the literature, is selected for the second numerical application in order to present the applicability of the proposed model on a medium-sized signalized road network. Results support authorities who should usually make a choice between two conflicting issues, namely, reserve capacity maximization and delay minimization. C1 [Baskan, Ozgur; Ceylan, Huseyin] Pamukkale Univ, Dept Civil Engn, Fac Engn, TR-20160 Denizli, Turkey. [Ozan, Cenk] Adnan Menderes Univ, Dept Civil Engn, Fac Engn, TR-09100 Aydin, Turkey.

Document type: Article

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document

Original document

The different versions of the original document can be found in:

http://downloads.hindawi.com/journals/jat/2019/6203137.xml,
http://dx.doi.org/10.1155/2019/6203137
https://doaj.org/toc/0197-6729,
https://doaj.org/toc/2042-3195 under the license http://creativecommons.org/licenses/by/4.0/
http://downloads.hindawi.com/journals/jat/2019/6203137.pdf,
https://academic.microsoft.com/#/detail/2944355247
Back to Top

Document information

Published on 01/01/2019

Volume 2019, 2019
DOI: 10.1155/2019/6203137
Licence: Other

Document Score

0

Views 1
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?