首页> 外文期刊>Simulation >Comparative study of simulated annealing, tabu search, and the genetic algorithm for calibration of the microsimulation model
【24h】

Comparative study of simulated annealing, tabu search, and the genetic algorithm for calibration of the microsimulation model

机译:模拟退火,禁忌搜索和遗传算法用于微仿真模型校准的比较研究

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

摘要

Microsimulation modeling is one of the contemporary techniques that has potential to perform complex transportation studies faster, safer, and in a less expensive manner. However, to get accurate and reliable results, the microsimulation models need to be well calibrated. Microsimulation model consists of various sub-models each having many parameters, most of which are user-adjustable and are attuned for calibrating the model. Manual calibration involves an iterative trial-and-error process of using the intuitive discrete values of each parameter and feasible combinations of multiple parameters each time until the desired results are obtained. With this approach, it is possible to easily get caught in a never-ending circular process of fixing one problem only to generate another. This can make manual calibration a time-consuming process and is suggested only when the number of parameters is small. However, when the calibration parameter subset is large, an automated process is suggested in the literature. Amongst the meta-heuristics used for calibrating microsimulation models, the genetic algorithm (GA) has been widely used and simulated annealing (SA) has been used only once in the past. Thus, the question of which meta-heuristics is more suitable for the problem of calibration of the microsimulation model still remains open. Thus, the objective of this paper is to evaluate and compare the manual and three (the GA, SA, and tabu search (TS)) meta-heuristics for calibration of microsimulation models. This paper therefore addresses the need to examine and identify the suitability of a meta-heuristics for calibrating microsimulation models. The results show that the meta-heuristics approach can be relied upon for calibrating simulation models very effectively, as it offers the benefit of automating the cumbersome calibrating process. All three meta-heuristics (the GA, SA, and TS) have the ability to find better calibrating parameters than the manually calibrated parameters. The number of better solutions, the best solution, and convergence to the best solution by TS is better than those by the GA and SA. Significant time can be saved by automating calibration of microsimulation models using meta-heuristics. The approach presented in this research can be used to help engineers and planners achieve better modeled results, as the calibration of microsimulation models is likely to become more complex in the future.
机译:微观仿真建模是当代技术之一,它有可能更快,更安全且以更便宜的方式执行复杂的运输研究。但是,为了获得准确和可靠的结果,需要对微仿真模型进行良好的校准。微观仿真模型由各种子模型组成,每个子模型都具有许多参数,其中大多数参数都是用户可调整的,并经过调整以校准模型。手动校准涉及反复的反复试验过程,每次使用直观的离散参数值和多个参数的可行组合,直到获得所需的结果。使用这种方法,可以轻松地陷入一个永无休止的循环过程中,即只解决一个问题就产生另一个问题。这可能会使手动校准成为一个耗时的过程,并且仅在参数数量较少时才建议使用。但是,当校准参数子集很大时,在文献中建议使用自动过程。在用于校准微观仿真模型的元启发式方法中,遗传算法(GA)已被广泛使用,而模拟退火(SA)过去仅被使用过一次。因此,哪种元启发式方法更适合于微观仿真模型的校准问题仍然悬而未决。因此,本文的目的是评估和比较手册和三种(GA,SA和禁忌搜索(TS))元启发式方法用于微仿真模型的校准。因此,本文满足了检查和确定元启发式方法对微仿真模型校准的适用性的需求。结果表明,元启发式方法可以非常有效地用于校准仿真模型,因为它具有使繁琐的校准过程自动化的优势。所有三种元启发式算法(GA,SA和TS)都能够找到比手动校准参数更好的校准参数。 TS提出的更好的解决方案,最好的解决方案和收敛到最好的解决方案的数量要比GA和SA更好。通过使用meta-heuristics自动校准微观仿真模型,可以节省大量时间。由于微观仿真模型的校准将来可能会变得更加复杂,因此本研究中提出的方法可用于帮助工程师和计划人员获得更好的建模结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号