Filters








3,732 Hits in 3.5 sec

Adaptive penalties for evolutionary graph coloring [chapter]

A. E. Eiben, J. K. van der Hauw
1998 Lecture Notes in Computer Science  
In this paper we consider a problem independent constraint handling mechanism, Stepwise Adaptation of Weights (SAW) and show its working on graph coloring problems.  ...  In an extensive series of comparative experiments we show that the SAW-ing EA outperforms a powerful graph coloring heuristic algorithm, DSatur, on the hardest graph instances and has a linear scale-up  ...  Introduction In this paper we consider an adaptive mechanism for constraint handling (called SAW-ing) on graph 3-coloring problems.  ... 
doi:10.1007/bfb0026593 fatcat:wvhrtro4xbdzlkb7mlc5uhk2uq

Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm

Iztok Fister, Marjan Mernik, Bogdan Filipič
2012 Computational optimization and applications  
This paper proposes a hybrid self-adaptive evolutionary algorithm for graph coloring that is hybridized with the following novel elements: heuristic genotype-phenotype mapping, a swap local search heuristic  ...  best graph-coloring algorithms today.  ...  THE HYBRID SELF-ADAPTIVE EVOLUTIONARY ALGORITHM The hybrid self-adaptive evolutionary algorithm (HSA-EA) for graph 3-coloring integrates concepts from various problem solving methods.  ... 
doi:10.1007/s10589-012-9496-5 fatcat:fie2yqfn4ngeli3zvv5knkzomq

Complexity Analysis and Stochastic Convergence of Some Well-known Evolutionary Operators for Solving Graph Coloring Problem

Raja Marappan, Gopalakrishnan Sethumadhavan
2020 Mathematics  
The stochastic convergence of recent evolutionary operators for solving graph coloring is newly analyzed.  ...  The selection of an evolutionary operator plays an essential role in reducing the bounds for minimum color obtained so far for some of the benchmark graphs.  ...  The authors would like to thank Gary Lewandowski and Michael Trick for uploading the graph repository in W3C [27, 60] . Conflicts of Interest: Page: 17 The authors declare no conflict of interest.  ... 
doi:10.3390/math8030303 fatcat:nom77dvdardclhxn6f2uz2bufa

Hybridization of Evolutionary Algorithms [chapter]

Iztok Fister, Marjan Mernik, Janez Brest
2011 Evolutionary Algorithms  
Sect. 4 introduces the implementations of hybrid self-adaptive evolutionary algorithm for graph 3-coloring in details.  ...  Analysis of the hybrid self-adaptive evolutionary algorithm for graph 3-coloring The goal of this subsection is twofold.  ... 
doi:10.5772/15592 fatcat:zbprxwprz5hjjbgth2qucgvdti

Using differential evolution for the graph coloring

Iztok Fister, Janez Brest
2011 2011 IEEE Symposium on Differential Evolution (SDE)  
Therefore, a hybrid self-adaptive differential evolution algorithm for graph coloring was proposed that is comparable with the best heuristics for graph coloring today, i.e.  ...  Tabucol of Hertz and de Werra and the hybrid evolutionary algorithm of Galinier and Hao. We have focused on the graph 3-coloring.  ...  HYBRID SELF-ADAPTIVE DIFFERENTIAL EVOLUTION FOR GRAPH 3-COLORING The DE is simple, powerful, population-based direct search algorithm for the globally optimization of functions [30] .  ... 
doi:10.1109/sde.2011.5952075 dblp:conf/sdiev/FisterB11 fatcat:ylvernxi3zf2xeflj2ayw53uji

Hybridization of Evolutionary Algorithms [article]

Iztok Fister, Marjan Mernik, Janez Brest
2013 arXiv   pre-print
Finally, such hybrid self-adaptive evolutionary algorithm is applied to the two real-world NP-hard problems: the graph 3-coloring and the optimization of markers in the clothing industry.  ...  To avoid of wrong setting of parameters that control the behavior of the evolutionary algorithm, the self-adaptation is used.  ...  Sect. 4 introduces the implementations of hybrid self-adaptive evolutionary algorithm for graph 3-coloring in details.  ... 
arXiv:1301.0929v1 fatcat:37tuqonznrcmljm2j4ssss5mqm

Automatically Generated Algorithms for the Vertex Coloring Problem

Carlos Contreras Bolton, Gustavo Gatica, Víctor Parada, Aaron Alain-Jon Golden
2013 PLoS ONE  
In this paper, we propose exploring the heuristics space for the vertex coloring problem using evolutionary algorithms.  ...  The vertex coloring problem is a classical problem in combinatorial optimization that consists of assigning a color to each vertex of a graph such that no adjacent vertices share the same color, minimizing  ...  Each graph vertex is numbered, as are the colors available for coloring. The functions are subdivided into coloring and generic functions.  ... 
doi:10.1371/journal.pone.0058551 pmid:23516506 pmcid:PMC3596313 fatcat:gvwszcgtjzchvpcxozleodawki

Evolutionary Algorithms and Constraint Satisfaction: Definitions, Survey, Methodology, and Research Directions [chapter]

A. E. Eiben
2001 Natural Computing Series  
In this tutorial we consider the issue of constraint handling by evolutionary algorithms (EA).  ...  A survey of related literature, however, discloses that there are quite a few successful attempts to evolutionary constraint satisfaction.  ...  Example 1 . 1 In the graph 3-coloring problem the nodes of a graph G = (N, E), E ⊆ N × N have to be colored by three colors in such a way that no neighboring nodes, i.e., nodes connected by an edge, have  ... 
doi:10.1007/978-3-662-04448-3_2 fatcat:ul5f7cq7erh7llt5gf757pmbia

Memetic firefly algorithm for combinatorial optimization [article]

Iztok Fister Jr, Xin-She Yang, Iztok Fister, Janez Brest
2012 arXiv   pre-print
by coloring the suite of medium-scaled random graphs (graphs with 500 vertices) generated using the Culberson random graph generator.  ...  In this paper, we have been applied the firefly algorithm, hybridized with local search heuristic, to combinatorial optimization problems, where we use graph 3-coloring problems as test benchmarks.  ...  As in evolutionary computation, constraints can be handled indirectly in the sense of a penalty function, that punishes the unfeasible solutions.  ... 
arXiv:1204.5165v2 fatcat:hdefpkp2trh57dupsda22efhye

Evaluation of Metaheuristics for Robust Graph Coloring Problem

Zbigniew Kokosinski, Łukasz Ochał
2015 Proceedings of the 2015 Federated Conference on Computer Science and Information Systems  
In addition to satisfying constraints related to the number of colors and/or a threshold of the acceptable sum of penalties for color conflicts in graph complementary edges (rigidity level), a new bound  ...  In opposition to classical GCP defined for the given graph G(V,E) not only elements of E but also Ē can be subject of color conflicts in edge vertices. Conflicts in Ē are assigned penalties 0<P(e)<1.  ...  Parameters for Tabu Search Algorithm Tabu Search metaheuristic presented in [19] is adapted for parallelization.  ... 
doi:10.15439/2015f293 dblp:conf/fedcsis/KokosinskiO15 fatcat:vougupk3vfbwzbnrby64xmiqu4

Acceleration Based Particle Swarm Optimization for Graph Coloring Problem

Jitendra Agrawal, Shikha Agrawal
2015 Procedia Computer Science  
The graph coloring problem is one of the combinatorial optimization problems.  ...  A swarm intelligence based technique called as particle swarm optimization is therefore employed to solve the graph coloring problem.  ...  Genetic Algorithm Evolutionary algorithms have been adapted in the context of the graph coloring problem.  ... 
doi:10.1016/j.procs.2015.08.223 fatcat:mycmrbqd6zbnrfyjotno3juzwq

A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring [chapter]

Iztok Fister, Iztok Fister, Janez Brest
2012 Lecture Notes in Computer Science  
This paper proposes a hybrid ABC (HABC) algorithm for graph 3-coloring, which is a well-known discrete optimization problem.  ...  The results of HABC are compared with results of the well-known graph coloring algorithms of today, i.e. the Tabucol and Hybrid Evolutionary algorithm (HEA) and results of the traditional evolutionary  ...  The minimum k for which a graph G is k-colorable is called its chromatic number χ(G). Many approaches for solving the graph coloring problem (GCP) have been proposed over the time [12, 20] .  ... 
doi:10.1007/978-3-642-29353-5_8 fatcat:cp24giijonbwjp4ned6mfswa7u

A unified modeling and solution framework for combinatorial optimization problems

Gary A. Kochenberger, Fred Glover, Bahram Alidaee, Cesar Rego
2004 OR spectrum  
Indeed, they are typically regarded to have little value except for dealing with small or simple problems. This paper reports on recent work that calls this commonly held view into question.  ...  ., K (2) for all adjacent nodes (i, j) in the graph.  ...  Once in this unified form, the problems can be solved effectively by adaptive memory tabu search metaheuristics and associated evolutionary (scatter search) procedures.  ... 
doi:10.1007/s00291-003-0153-3 fatcat:u35q7c5rcffflfo4yqbnlzzav4

Cognitive rhythms and evolutionary algorithms in university timetables scheduling

Omar Danilo Castrillón
2015 Revista de Matemática: Teoría y Aplicaciones  
In [5] an adaptive linear combination between graph coloring and multiple heuristic was proposed. Finally other applications can be found in [6] .  ...  In 2011, [29] a methodology based on graph coloring and heuristic multiples was proposed. Similarly, in [31] a mimic algorithm based on heuristics and knowledge databases was proposed.  ... 
doi:10.15517/rmta.v22i1.17559 fatcat:dl2vd6nrljfnpkszmmywyxygmy

A Review on Constraint Handling Techniques for Population-based Algorithms: from single-objective to multi-objective optimization [article]

Iman Rahimi, Amir H. Gandomi, Fang Chen, Efren Mezura-Montes
2022 arXiv   pre-print
The most promising algorithms for such optimization were determined to be genetic algorithms, differential evolutionary algorithms, and particle swarm intelligence.  ...  The extracted papers include research articles, reviews, book/book chapters, and conference papers published between 2000 and 2020 for the analysis.  ...  . • Repair methods in graphs that are represented as spanning trees and repairing graphs [144] , [145] . • Repair methods in grouping GAs, which are proper for scenarios that a number of items should  ... 
arXiv:2206.13802v1 fatcat:zhr2ril2bjgqbaefd2ygh3l2tu
« Previous Showing results 1 — 15 out of 3,732 results