A heuristic algorithm based on leaf photosynthate transport

作     者：Yu Bin Shan Wenxuan Guo Zhen Wang Yunpeng 

作者机构：Beihang Univ Sch Transportat Sci & Engn Beijing 100191 Peoples R China 

出 版 物：《SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL》 (Simulation)

年 卷 期：2018年第94卷第7期

页      面：593-607页

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Natural Science Foundation of China Trans-Century Training Program Foundation for Talents from the Ministry of Education of China [NCET-12-0752] Liaoning Excellent Talents in University [LJQ2012045] Fundamental Research Funds for the Central Universities [YWF-16-BJ-J-40] 

主　　题：Heuristic algorithm leaf photosynthate transport evolutionary rule transportation network optimization 

摘      要：Transportation network design is non-deterministic polynomial-time hard due to its attributes of multi-objects, multi-constraints, and the non-convexity objective function. In this paper, a bi-level programming model is proposed for the transportation network design. The upper layer pursues the minimum total travel time of users and the total length of the road network simultaneously, while the lower layer is an equilibrium assignment model. A new algorithm for the network optimization based on the principle of leaf photosynthate transport in nature is proposed. The proposed algorithm simulates the natural selection of biological evolution and genetic transmission. It can retain the genetic idea of the evolutionary algorithm, together with the heuristic information update mechanism of swarm intelligence. Finally, empirical research is carried out with the Sioux Falls network to validate the performance of the proposed algorithm. The results show that although the total network length obtained by the proposed algorithm increases slightly compared with the ant colony algorithm and the genetic algorithm, the total travel time and objective function value reduce obviously. This indicates that the proposed algorithm has good performance on topology and efficiency.