机译:德黑兰公交网络中的多峰K最短可行路径问题及其蚁群和模拟退火算法的求解
Department of Computer Science, Amirkabir University of Technology, No. 424, Hafez Ave., Tehran 15875-4413, Iran Laboratory of Network and Optimization Research Center (NORC), Amirkabir University of Technology, Tehran, Iran;
Department of Computer Science, Amirkabir University of Technology, No. 424, Hafez Ave., Tehran 15875-4413, Iran Laboratory of Network and Optimization Research Center (NORC), Amirkabir University of Technology, Tehran, Iran;
Department of Computer Science, Amirkabir University of Technology, No. 424, Hafez Ave., Tehran 15875-4413, Iran Laboratory of Network and Optimization Research Center (NORC), Amirkabir University of Technology, Tehran, Iran;
metaheuristic algorithms; multimodal networks; k-shortest path problem; bi-direction search; congestion level;
机译:使用混合模拟退火和蚁群优化算法寻找伊朗城市的最短哈密顿路径
机译:使用模拟退火和蚁群优化算法解决调度问题
机译:基于蚁群算法模拟退火算法的MCM互连测试优化方法
机译:基于蚁群算法在低碳背景下的时间窗口多式联运路径优化研究
机译:应用蚁群优化(ACO)元启发式方法解决有侧约束的森林运输计划问题
机译:Covid-19紧急公共健康事件中医疗废物运输路线的路径优化:基于免疫蚁群算法的混合优化算法
机译:运输网络的k最短路径算法的改编