STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM

Autor:	M.E. De San Pedro, Andrea Villagra, Gabriela Vilanova, D. Pandolfi, Raúl Hector Gallard
Rok vydání:	2002
Předmět:	Mathematical optimization Job shop scheduling business.industry Computer science Tardiness Mating pool Crossover Evolutionary algorithm Artificial Intelligence Artificial intelligence Mating business Software Information Systems
Zdroj:	Cybernetics and Systems. 33:391-400
ISSN:	1087-6553 0196-9722
DOI:	10.1080/01969720290040650
Popis:	Current trends in manufacturing are focused on just-in-time production which emphasizes policies discouraging earliness as well as tardiness of job completion. New trends to enhance evolutionary algorithms introduced multiple-crossovers-on-multiple-parents (MCMP) a multirecombinative approach allowing multiple crossovers on the selected pool of (more than two) parents. As a novel variant, MCMP-SRI considers the inclusion of a stud-breeding individual in a pool of random immigrant parents. Members of this mating pool subsequently undergo multiple crossover operations. This paper describes implementation and performance of MCMP-SRI when solving diverse instances of the earliness-tardiness problem in a single machine environment.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::42d660bbfd25fc42fda20938edb6abd2 https://doi.org/10.1080/01969720290040650 Zobrazit plný text záznamu