Comparison of heuristics for the colourful travelling salesman problem

DOI10.1504/IJMHEUR.2013.054143zbMath1306.90024OpenAlexW2076755772MaRDI QIDQ2256917

Raffaele Cerulli, Monica Gentili, Si Chen, John Silberholz, Bruce L. Golden, Andrea Raiconi

Publication date: 23 February 2015

Published in: International Journal of Metaheuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmheur.2013.054143

zbMATH Keywords

metaheuristicsgenetic algorithmstravelling salesman problemoptical networkstelecommunication networksHamiltonian tourcolourful TSPCTSPmultimodal transport networks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Comparison of metaheuristics for the k‐labeled spanning forest problem ⋮ The labeled maximum matching problem

This page was built for publication: Comparison of heuristics for the colourful travelling salesman problem