A surrogate-based optimization algorithm for network design problems

Network design problems (NDPs) have long been regarded as one of the most challenging problems in the field of transportation planning due to the intrinsic non-convexity of their bi-level programming form. Furthermore, a mixture of continuous/discrete decision variables makes the mixed network desig...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Frontiers of information technology & electronic engineering Ročník 18; číslo 11; s. 1693 - 1704
Hlavní autoři: Li, Meng, Lin, Xi, Chen, Xi-qun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hangzhou Zhejiang University Press 01.11.2017
Springer Nature B.V
Témata:
Algorithms
Communications Engineering
Computer Hardware
Computer Science
Computer Systems Organization and Communication Networks
Continuity (mathematics)
Convexity
Design optimization
Electrical Engineering
Electronics and Microelectronics
Instrumentation
Mixed integer
Network design
Networks
Optimization
Transportation networks
Transportation planning
U491
Surrogate-based optimization
TP202
Heuristics
Transportation planning
Network design problem
ISSN:2095-9184, 2095-9230
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Network design problems (NDPs) have long been regarded as one of the most challenging problems in the field of transportation planning due to the intrinsic non-convexity of their bi-level programming form. Furthermore, a mixture of continuous/discrete decision variables makes the mixed network design problem (MNDP) more complicated and difficult to solve. We adopt a surrogate-based optimization (SBO) framework to solve three featured categories of NDPs (continuous, discrete, and mixed-integer). We prove that the method is asymptotically completely convergent when solving continuous NDPs, guaranteeing a global optimum with probability one through an indefinitely long run. To demonstrate the practical performance of the proposed framework, numerical examples are provided to compare SBO with some existing solving algorithms and other heuristics in the literature for NDP. The results show that SBO is one of the best algorithms in terms of both accuracy and efficiency, and it is efficient for solving large-scale problems with more than 20 decision variables. The SBO approach presented in this paper is a general algorithm of solving other optimization problems in the transportation field.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2095-9184
2095-9230
DOI:10.1631/FITEE.1601403