The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
From MaRDI portal
Publication:1597083
DOI10.1016/S0895-7177(00)00088-1zbMath1042.90651MaRDI QIDQ1597083
Publication date: 5 May 2002
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Related Items
Genetic algorithm for combinatorial path planning: the subtour problem, A new genetic algorithm for solving nonconvex nonlinear programming problems, A new approach to solving the multiple traveling salesperson problem using genetic algorithms, An effective genetic algorithm approach to large scale mixed integer programming problems, A variable-grouping based genetic algorithm for large-scale integer programming, A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
Uses Software
Cites Work