Calibration of traffic flow models using a memetic algorithm

A Memetic Algorithm (MA) for the calibration of microscopic traffic flow simulation models is proposed in this study. The proposed MA includes a combination of genetic and simulated annealing algorithms. The genetic algorithm performs the exploration of the search space and identifies a zone where a possible global solution could be located. After this zone has been found, the simulated annealing algorithm refines the search and locates an optimal set of parameters within that zone. The design and implementation of this methodology seeks to enable the generalized calibration of microscopic traffic flow models. Two different Corridor Simulation (CORSIM) vehicular traffic systems were calibrated for this study. All parameters after the calibration were within reasonable boundaries. The calibration methodology was developed independently of the characteristics of the traffic flow models. Hence, it is easily used for the calibration of any other model. The proposed methodology has the capability to calibrate all model parameters, considering multiple performance measures and time periods simultaneously. A comparison between the proposed MA and the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm was provided; results were similar between the two. However, the effort required to fine-tune the MA was considerably smaller when compared to the SPSA. The running time of the MA-based calibration was larger when it was compared to the SPSA running time. The MA still required some knowledge of the model in order to set adequate optimization parameters. The perturbation of the parameters during the mutation process must have been large enough to create a measurable change in the objective function, but not too large to avoid noisy measurements.     

基于Memetic算法的动态武器目标分配问题研究

考虑时间和空间的影响,动态武器目标分配是一个复杂的问题。针对时间和空间对武器目标分配过程的约束,建立了动态武器目标分配数学模型;提出了一种Memetic算法来解该问题,采用遗传算法作为全局搜索策略,模拟退火算法作为局部搜索策略,根据Any-time算法的特性,设置了一种有限时间元级控制策略来响应分配动态过程。最后,通过仿真实例,验证了该算法的有效性和实用性。     

基于Memetic算法的客运站到发线分配问题研究

为了探索客运站到发线分配问题有效合理的解决方法,以到发线利用均衡值以及到发线分配权重总和为优化目标,建立了客运站到发线的整数规划模型,并利用Memetic算法进行求解.通过实例验证,表明建立的模型和设计的算法是可行的,得到的分配结果令人满意.