A computational experiment method in ACP framework for complex urban traffic networks

ITSC(2014)

引用 0|浏览27
暂无评分
摘要
Urban traffic congestion has already become an urgent problem. Artificial societies, Computational experiments, and Parallel execution (ACP) method is applied to urban traffic problems. In ACP framework, optimization for urban road networks achieves remarkable effect. Optimization for urban road networks is a problem of nonlinear and non-convex programming with typical large-scale continual and integer variables. Due to the complicated urban traffic system, this paper focuses on the ACP-based Computational experiments modeling. It hopes to find an optimization model that is further accord with the practical situation. To this end, we use a mixed integer nonlinear programming problem (MINLP) and an genetic algorithm (GA) for urban road networks optimization. The systemic simulation experiments show that the approach is more effective in improving traffic status and increasing traffic safety.
更多
查看译文
关键词
concave programming,genetic algorithms,integer programming,nonlinear programming,road traffic,acp framework,ga,minlp,artificial societies,complex urban traffic networks,computational experiments,genetic algorithm,mixed integer nonlinear programming problem,nonconvex programming,optimization,parallel execution,urban traffic congestion,simulation,mixed integer programming,networks
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要