首页> 外文期刊>Expert systems with applications >Study On Continuous Network Design Problem Using Simulatedannealing And Genetic Algorithm
【24h】

Study On Continuous Network Design Problem Using Simulatedannealing And Genetic Algorithm

机译:基于模拟退火和遗传算法的连续网络设计问题研究

获取原文
获取原文并翻译 | 示例
           

摘要

In general, a continuous network design problem (CNDP) is formulated as a bi-level program. The objective function at the upper level is defined as the total travel time on the network, plus total investment costs of link capacity expansions. The lower level problem is formulated as a certain traffic assignment model. It is well known that such bi-level program is non-convex and non-differentiable and algorithms for finding global optimal solutions are preferable to be used in solving it. Simulated annealing (SA) and genetic algorithm (GA) are two global methods and can then be used to determine the optimal solution of CNDP. Since application of SA and GA on continuous network design on real transportation network requires solving traffic assignment model many times at each iteration of the algorithm, computation time needed is tremendous. It is important to compare the efficacy of the two methods and choose the more efficient one as reference method in practice. In this paper, the continuous network design problem has been studied using SA and GA on a simulated network. The lower level program is formulated as user equilibrium traffic assignment model and Frank-Wolf method is used to solve it. It is found that when demand is large, SA is more efficient than GA in solving CNDP, and much more computational effort is needed for GA to achieve the same optimal solution as SA. However, when demand is light, GA can reach a more optimal solution at the expense of more computation time. It is also found that increasing the iteration number at each temperature in SA does not necessarily improve solution. The finding in this example is different from [Karoonsoontawong, A., & Waller, S. T. (2006). Dynamic continuous network design problem - Linear bilevel programming and metaheuristic approaches. Network Modeling 2006 Transportation Research Record (1964) (pp. 104-117)]. The reason might be the bi-lcvel model in this example is nonlinear while the bi-level model in their study is linear.
机译:通常,连续网络设计问题(CNDP)被制定为一个双层程序。较高级别的目标函数定义为网络上的总传输时间,加上链路容量扩展的总投资成本。下层问题被表述为某种交通分配模型。众所周知,这样的双层程序是非凸且不可微的,并且用于寻找全局最优解的算法优选地用于求解它。模拟退火(SA)和遗传算法(GA)是两种全局方法,可用于确定CNDP的最佳解决方案。由于SA和GA在实际交通网络的连续网络设计中的应用需要在算法的每次迭代中多次求解交通分配模型,因此需要大量的计算时间。在实践中比较两种方法的功效并选择效率更高的方法作为参考方法非常重要。在本文中,已经在模拟网络上使用SA和GA研究了连续网络设计问题。将较低级的程序制定为用户均衡流量分配模型,并使用Frank-Wolf方法对其进行求解。可以发现,当需求很大时,SA在求解CNDP方面比GA更为有效,而GA要获得与SA相同的最优解,则需要付出更多的计算工作。但是,当需求不大时,GA可以以更多的计算时间为代价达到更好的解决方案。还发现增加SA中每个温度的迭代次数并不一定会改善解。在此示例中的发现与[Karoonsoontawong,A.,&Waller,S. T.(2006)。动态连续网络设计问题-线性双层编程和元启发式方法。网络模型,2006年运输研究记录(1964)(pp。104-117)]。原因可能是此示例中的双水平模型是非线性的,而他们研究中的双水平模型是线性的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号