首页> 外文期刊>Asia-Pacific Journal of Operational Research >AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS
【24h】

AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS

机译:一种有效且实用的鲁棒混合变元算法,用于解决模糊公交车终点定位问题

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

摘要

Bus network design is an important problem in public transportation. In practice, some parameters of this problem are uncertain. We propose two models for the bus terminal location problem with fuzzy parameters. In the first formulation, the number of passengers corresponding to each node is a fuzzy number. In the second formulation, an additional assumption of fuzzy neighborhood is considered. These problems being NP-hard, we use a genetic algorithm (GA) and a simulated annealing (SA) algorithm for solving them. We also propose an idea to hybridize these algorithms. In our hybrid algorithm, SA is applied as a neighborhood search procedure of GA on the best individual of the population, which is the best available approximation of the optimal solution, with a varying probability that is gradually increased with the increase in the number of iterations in GA. We then implement GA, SA, our hybrid algorithm, and a recently proposed hybrid algorithm making use of a constant probability for application of SA on all the individuals of the population of GA, and use a nonparametric statistical test to compare their performances on a collection of randomly generated medium to large-scale test problems. Results of computational experiments demonstrating the efficiency and practicability of our proposed algorithm are reported.
机译:公交网络设计是公共交通中的重要问题。实际上,此问题的某些参数是不确定的。针对具有模糊参数的公交车站位置问题,我们提出了两种模型。在第一公式中,与每个节点相对应的乘客数量是模糊数。在第二种公式中,考虑了模糊邻域的其他假设。这些问题都是NP难题,我们使用遗传算法(GA)和模拟退火(SA)算法来解决。我们还提出了一种混合这些算法的想法。在我们的混合算法中,将SA用作GA在总体最佳个体上的邻域搜索过程,这是最佳解的最佳可用近似值,其概率随着迭代次数的增加而逐渐增加在GA中。然后,我们实施GA,SA,我们的混合算法以及最近提出的混合算法,该算法利用恒定概率将SA应用于GA群体的所有个体,并使用非参数统计检验比较它们在集合上的性能随机生成的中大型测试问题。报告了计算实验的结果,证明了我们提出的算法的效率和实用性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号