An efficient hybrid genetic hill-climbing algorithm for solving n-region 4-coloring map problems

zbMATH Open1178.90336MaRDI QIDQ3601348FDOQ3601348

Authors: Bah-Hwee Gwee, Joseph S. Chang 

Publication date: 10 February 2009

Recommendations

• Genetic and hybrid algorithms for graph coloring
• Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
• An application of a new hybrid genetic algorithm to graph coloring
• Evolutionary Computation in Combinatorial Optimization
• scientific article; zbMATH DE number 1703855

zbMATH Keywords

hybrid genetic algorithm4-coloring mapgenetic grouping representationmulti-point search and optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cited In (3)

• Title not available (Why is that?)
• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
• Graph colouring and its applications within cartography

This page was built for publication: An efficient hybrid genetic hill-climbing algorithm for solving \(n\)-region 4-coloring map problems

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