{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:48:45Z","timestamp":1725900525693},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540250565"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32392-9_31","type":"book-chapter","created":{"date-parts":[[2006,5,27]],"date-time":"2006-05-27T07:09:20Z","timestamp":1148713760000},"page":"299-308","source":"Crossref","is-referenced-by-count":1,"title":["Effects of Versatile Crossover and Mutation Operators on Evolutionary Search in Partition and Permutation Problems"],"prefix":"10.1007","author":[{"given":"Zbigniew","family":"Kokosi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Croitoriu C., Luchian H., Gheorghies O., Apetrei A. (2002) A new genetic graph coloring heuristic. Computational Symposium on Graph Coloring and Generalizations COLOR\u201902. Proc. Int. Conf. Constraint Programming CP\u201902"},{"key":"31_CR2","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/BFb0056916","volume":"1498","author":"R. Dorne","year":"1998","unstructured":"Dorne R., Hao J-K. (1998) A new genetic local search for graph coloring. Parallel Problem Solving from Nature 1998, LNCS 1498, 745\u2013754","journal-title":"Parallel Problem Solving from Nature"},{"key":"31_CR3","unstructured":"Filho G. R., Lorena L. A. N. (2000) Constructive genetic algorithm and column generation: an application to graph coloring, Proc. Asia Pacific Operarions Research Symposium APORS\u20192000"},{"key":"31_CR4","unstructured":"Galinier P., Hao J-K. (1999) Hybrid evolutionary algorithms for graph coloring. J. Combinatorial Optimization, 374\u2013397"},{"key":"31_CR5","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"R. Garey","year":"1979","unstructured":"Garey R., Johnson D. S. (1979) Computers and intractability. A guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"31_CR6","unstructured":"Grefenstette J. J. et al. (1985) Genetic algorithm for the TSP. Proc. 1st Int. Conf. on Genetic Algorithms, 160\u2013168"},{"key":"31_CR7","unstructured":"Johnson D. S., Trick M. A. (1996) Cliques, coloring and satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discr. Math. and Theor. Comp. Sc. 26"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Khuri S., Walters T. Sugono Y. (2000) Grouping genetic algorithm for coloring edges of graph. Proc. 2000 ACM Symposium on Applied Computing, 422\u2013427","DOI":"10.1145\/335603.335880"},{"key":"31_CR9","unstructured":"Kokosi\u0144ski Z. (1999) A chromosome representation of permutations for genetic algorithms. Proc. International Conference on Artificial Intelligence ICAI\u20191999, Las Vegas, CSREA Press, 66\u201369"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Kokosi\u0144ski Z., Kolodziej M., Kwarciany K. (2004) Parallel genetic algorithm for graph coloring problem. Proc. International Conference on Computational Science ICCS\u20192004, LNCS 3036, 215\u2013222","DOI":"10.1007\/978-3-540-24685-5_27"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Kubale, M. (ed.) (2004) Graph colorings. American Mathematical Society","DOI":"10.1090\/conm\/352"},{"key":"31_CR12","unstructured":"Lorena L. A. N., Filho G. R. (1997) Constructive genetic algorithm for graph coloring. Proc. Asia Pacific Operarions Research Symposium APORS\u20191997"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Michalewicz Z.: Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag (1996)","DOI":"10.1007\/978-3-662-03315-9"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Murata T., Ischibuchi H. (1996) Positive and negative combination effect of crossover and mutation operators in sequencing problems. Proc. Int. Conf. on Evolutionary Computation ICEC\u201996, IEEE Computer Society Press, 170\u2013175","DOI":"10.1109\/ICEC.1996.542355"},{"key":"31_CR15","unstructured":"Oliver M., Smith D. J., Holland J. R. C. (1987) A study of permutation crossover operators on the travelling salesman problem, Proc. 2nd Int. Conf. on Genetic Algorithms and Their Application, 224\u2013230"},{"key":"31_CR16","unstructured":"Syswerda G. (1991) Scheduling optimization using genetic algorithms. [in:] Davis L. (ed.) Handbook of Genetic Algorithms. Van Nostrand Reinhold, 332\u2013349"},{"key":"31_CR17","unstructured":"\u00dc\u00e7oluk G. (1997) A method for chromosome handling of r-permutations of n-element set in genetic algorithms. Proc. 4th Int. Conf. on Evolutionary Computing ICEC\u201997, IEEE Computer Society, 55\u201358"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"de Werra D. (1990) Heuristics for graph coloring. [in:] Tinhofer G. et all. (eds.) Computational graph theory. Springer-Verlag, 191\u2013208","DOI":"10.1007\/978-3-7091-9076-0_10"},{"key":"31_CR19","unstructured":"Whitley D., Starweather T., Fuquay D. A. (1989) Scheduling problems and travelling salesman: The genetic edge recombination operator. Proc. 3rd Int. Conf. on Genetic Algorithms, 133\u2013140"},{"key":"31_CR20","unstructured":"http:\/\/mat.gsia.cmu.edu\/COLOR\/instances.html"}],"container-title":["Advances in Soft Computing","Intelligent Information Processing and Web Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32392-9_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:53:47Z","timestamp":1619571227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32392-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540250565"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-32392-9_31","relation":{},"subject":[]}}