Edge histogram based sampling with local search for solving permutation problems

DOI10.3233/HIS-2006-3102MaRDI QIDQ5479665zbMATH OpenOpenAlexFDO

Authors Shigeyoshi Tsutsui, Martin Pelikan, Ashish Ghosh

Publication date 11 July 2006

Published in International Journal of Hybrid Intelligent Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/his-2006-3102

zbMATH Keywords

probabilistic model-building genetic algorithmstraveling salesman problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35)

Recommendations

• Algorithm 989: \texttt{perm\_mateda}: a Matlab toolbox of estimation of distribution algorithms for permutation-based combinatorial optimization problems
• Genetic algorithms and traveling salesman problems
• scientific article; zbMATH DE number 1754728
• Sequential algorithm for the solution of problems of combinatorial optimization on permutations
• Large-step Markov chains for the TSP incorporating local search heuristics

Cited in

(1)

• Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems

This page was built for publication: Edge histogram based sampling with local search for solving permutation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479665)