A hybrid random-key genetic algorithm for a symmetric travelling salesman problem

Author： Samanlioglu Funda   Kurz Mary Beth   Ferrell William G.   Tangudu Sarat  

Publisher： Inderscience Publishers

ISSN： 1745-7645

Source： International Journal of Operational Research, Vol.2, Iss.1, 2006-11, pp. : 47-63

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

A data-guided lexisearch algorithm for the bottleneck travelling salesman problem

By Ahmed Zakir Hussain  

International Journal of Operational Research, Vol. 12, Iss. 1, 2011-08 ,pp. : 20-33

Inderscience Publishers

Access to resources Recommend Favorite

CLOSE: a heuristic to solve a precedence-constrained travelling salesman problem with delivery and pickup

By Ganesh K.   Narendran T.T.  

International Journal of Services and Operations Management, Vol. 1, Iss. 4, 2005-07 ,pp. : 320-343

Inderscience Publishers

Access to resources Recommend Favorite

Multi-parent extension of sequential constructive crossover for the travelling salesman problem

By Ahmed Zakir Hussain  

International Journal of Operational Research, Vol. 11, Iss. 3, 2011-07 ,pp. : 331-342

Inderscience Publishers

Access to resources Recommend Favorite

Heuristics for the Real-time Pickup-and-Delivery Travelling Salesman Problem

By Kumar Ch. S.N. Chandra Sunil   Narendran T.T.  

International Journal of Logistics Systems and Management, Vol. 4, Iss. 1, 2007-12 ,pp. : 116-133

Inderscience Publishers

Access to resources Recommend Favorite

A multi-depot travelling salesman problem and its iterative and integrated approaches

By Ho William   Ji Ping   Dey Prasanta K.  

International Journal of Operational Research, Vol. 1, Iss. 4, 2006-07 ,pp. : 382-395

Inderscience Publishers

Access to resources Recommend Favorite