The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.

DOI10.1016/S0895-7177(00)00088-1zbMath1042.90651WikidataQ126351970 ScholiaQ126351970MaRDI QIDQ1597083

R. Smith

Publication date: 5 May 2002

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM ⋮ A new approach to solving the multiple traveling salesperson problem using genetic algorithms ⋮ A new genetic algorithm for solving nonconvex nonlinear programming problems ⋮ Minimum Energy Conformations of Self-Interacting Polymer Chains via Multipopulation Genetic Algorithms (MpGA) ⋮ Genetic algorithm for combinatorial path planning: the subtour problem ⋮ An effective genetic algorithm approach to large scale mixed integer programming problems ⋮ The multiagent planning problem ⋮ A variable-grouping based genetic algorithm for large-scale integer programming ⋮ Solving Rubik’s cube via quantum mechanics and deep reinforcement learning

Uses Software

• TSPLIB
• Genocop

Cites Work

• Optimization by Simulated Annealing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.