scholarly journals Differential Evolution Algorithm Based Solution Approaches for Solving Transportation Network Design Problems

2014 ◽  
Vol 20 (9) ◽  
pp. 324-331 ◽  
Author(s):  
Özgür Başkan ◽  
Hüseyin Ceylan
2016 ◽  
Vol 15 (2) ◽  
pp. 89
Author(s):  
A.M. Gujarathia ◽  
G. Vakili-Nezhaad ◽  
M. Vatani

 A modified differential evolution algorithm (MDE) has been used for solving different process related design problems (namely calculation of the NRTL and Two-Suffix Margules activity coefficient models parameters in 20 ternary extraction systems including different ionic liquids and reactor network design problem). The obtained results, in terms of root mean square deviations (rmsd) for these models are satisfactory, with the overall values of 0.0023 and 0.0170 for 169 tie-lines for NRTL and Two-Suffix Margules models, respectively. The results showed that the MDE algorithm results in better solutions compared to the previous work based on genetic algorithm (GA) for correlating liquid-liquid equilibrium (LLE) data in these systems. MDE also outperformed DE algorithm when tested on reactor network design problem with respect to convergence and speed. 


2019 ◽  
Vol 2019 ◽  
pp. 1-22 ◽  
Author(s):  
Guo-Ling Jia ◽  
Rong-Guo Ma ◽  
Zhi-Hua Hu

This paper provides a comprehensive review of urban transportation network design problems according to CiteSpace, including main problem classifications, mathematical models, and solution methods obtained from CiteSpace clusters. The review attempts to present the systematic picture of urban transportation network design and show the future directions of it.


Author(s):  
Saeed Asadi Bagloee ◽  
Madjid Tavana ◽  
Avishai Ceder ◽  
Claire Bozic ◽  
Mohsen Asadi

Author(s):  
Yufeng Zhang ◽  
Alireza Khani

A significant amount of research has been performed on network accessibility evaluation, but studies on incorporating accessibility maximization into network design problems have been relatively scarce. This study aimed to bridge the gap by proposing an integer programming model that explicitly maximizes the number of accessible opportunities within a given travel time budget. We adopted the Lagrangian relaxation method for decomposing the main problem into three subproblems that can be solved more efficiently using dynamic programming. The proposed method was applied to several case studies, which identified critical links for maximizing network accessibility with limited construction budget, and also illustrated the accuracy and efficiency of the algorithm. This method is promisingly scalable as a solution algorithm for large-scale accessibility-oriented network design problems.


Sign in / Sign up

Export Citation Format

Share Document