New Imperialist Competitive Algorithm to solve the travelling salesman problem

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.90, Iss.7, 2013-07, pp. : 1495-1505

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The travelling salesman problem with neighbourhoods: MINLP solution

By Gentilini Iacopo Margot François Shimada Kenji

Optimization Methods and Software, Vol. 28, Iss. 2, 2013-04 ,pp. : 364-378

Taylor & Francis Ltd

Access to resources Recommend Favorite

A bilevel programming approach to the travelling salesman problem

By Marcotte P. Savard G. Semet F.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 240-248

Elsevier

Access to resources Recommend Favorite

New policies for the dynamic traveling salesman problem

By Ghiani Gianpaolo Quaranta Antonella Triki Chefi

Optimization Methods and Software, Vol. 22, Iss. 6, 2007-12 ,pp. : 971-983

Taylor & Francis Ltd

Access to resources Recommend Favorite

Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

By Mak Vicky Thomadsen Tommy

Journal of Combinatorial Optimization, Vol. 11, Iss. 4, 2006-06 ,pp. : 421-434

Springer Publishing Company

Access to resources Recommend Favorite

A New Mixed Iterative Algorithm to Solve the Fuel-Optimal Linear Impulsive Rendezvous Problem

By Arzelier D. Louembet C. Rondepierre A. Kara-Zaitri M.

Journal of Optimization Theory and Applications, Vol. 159, Iss. 1, 2013-10 ,pp. : 210-230

Springer Publishing Company

Access to resources Recommend Favorite