New Imperialist Competitive Algorithm to solve the travelling salesman problem

DOI10.1080/00207160.2012.758362zbMath1361.68210OpenAlexW1992937816MaRDI QIDQ2855772

Mohammad Sedighpour, Majid Yousefikhoshbakht

Publication date: 22 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.758362

zbMATH Keywords

local searchtraveling salesman problemimperialist competitive algorithmorder crossover

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Application of imperialist competitive algorithm on solving the traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
• A genetic algorithm for finding a salesman's route
• Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement
• Colonial competitive algorithm
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem

This page was built for publication: New Imperialist Competitive Algorithm to solve the travelling salesman problem