An effective hybrid harmony search for the asymmetric travelling salesman problem

DOI10.1080/0305215X.2019.1579804OpenAlexW2925302285WikidataQ128175781 ScholiaQ128175781MaRDI QIDQ5059301

Urszula Boryczka, Krzysztof Szwarc

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2019.1579804

zbMATH Keywords

memetic algorithmasymmetric travelling salesman problemharmony searchhill climbinghybrid harmony search

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Hybrid harmony search and artificial bee colony algorithm for global optimization problems
• A unified heuristic for a large class of vehicle routing problems with backhauls
• Novel derivative of harmony search algorithm for discrete design variables
• A comparative analysis of several asymmetric traveling salesman problem formulations
• A harmony search algorithm for university course timetabling
• A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
• Hybrid Metaheuristics
• A hybrid algorithm for optimizing multi-modal functions

This page was built for publication: An effective hybrid harmony search for the asymmetric travelling salesman problem