Please use this identifier to cite or link to this item:
Title: Modified differential evolution algorithm for the continuous network design problem
Authors: Başkan, Özgür
Ceylan, Hüseyin
Keywords: Continuous network design problem; differential evolution; bilevel
Abstract: The Continuous Network Design Problem (CNDP) is recognized to be one of the most difficult problems in transportation field since the bilevel formulation of the CNDP is nonconvex. On the other hand, the computation time is crucial importance for solving the CNDP because the algorithms implemented on real sized networks require solving traffic assignment model many times, which is the most time consuming part of the solution process. Although the methods developed so far are capable of solving the CNDP, an efficient algorithm, which is able to solve the CNDP with less number of User Equilibrium (UE) assignments, is still needed. Therefore, this paper deals with solving the CNDP using MOdified Differential Evolution (MODE) algorithm with a new local search and mutation operators. For this purpose, a bilevel model is proposed, in which the upper level problem deals with minimizing the sum of total travel time and investment cost of link capacity expansions, while at the lower level problem, UE link Bows are determined by Wardrop's first principle. A numerical example is presented to compare the proposed MODE algorithm with some existing methods. Results showed that the proposed algorithm may effectively be used in order to reduce the number of UE assignments in solving the CNDP. (C) 2013 The Authors. Published by Elsevier Ltd.
ISSN: 1877-0428
Appears in Collections:Mühendislik Fakültesi Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File SizeFormat 
1-s2.0-S187704281400038X-main.pdf354.05 kBAdobe PDFView/Open
Show full item record

CORE Recommender


checked on May 14, 2024

Page view(s)

checked on May 6, 2024


checked on May 6, 2024

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.