...
机译:求解对称和非对称旅行商问题的改进离散蝙蝠算法
Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain,School of Science and Technology, Middlesex University, Hendon Campus, London, NW4 4ST, United Kingdom;
School of Science and Technology, Middlesex University, Hendon Campus, London, NW4 4ST, United Kingdom;
Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain;
Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain;
Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain;
Bat algorithm; Traveling Salesman Problem; Genetic algorithms; Combinatorial optimization; Routing problems;
机译:一种解决对称和非对称旅行推销员问题的离散水循环算法
机译:一种基于Levy航班的离散BAT算法,为欧几里德旅行推销员问题
机译:一种解决旅行商问题的新型离散蝙蝠算法
机译:一种杂交共生生物搜索算法,可变邻域搜索解决对称和不对称旅行推销员问题
机译:求解对称多目标旅行商问题的混合交互式随机密钥遗传算法。
机译:旅行商问题的离散果蝇优化算法
机译:求解对称和非对称旅行商问题的改进离散蝙蝠算法