Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem

DOI10.1155/2020/3431420zbMath1459.90171OpenAlexW3097862075MaRDI QIDQ2214785

Maha Ata Al-Furhud, Zakir Hussain Ahmed

Publication date: 10 December 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/3431420

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• TSPLIB

Cites Work

• A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
• An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem
• A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• A genetic algorithm for service level based vehicle scheduling
• A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
• A neural network algorithm for the multiple traveling salesman problem
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
• A Cutting Planes Algorithm for the m-Salesmen Problem
• TSPLIB—A Traveling Salesman Problem Library
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• Computational Experience with an M-Salesman Traveling Salesman Algorithm
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem