In this paper we introduce a genetic algorithm whose peculiarities are the introduction of an encoding based on preference rules and an updating step which speeds up the evolutionary process. This method improves on the results gained previously with Genetic Algorithms and has shown itself to be competitive with other heuristics. The same algorithm has been applied to flow shop problems, revealing itself to be considerably more effective than Branch and Bound techniques.
|Titolo:||A genetic algorithm for the job shop problem|
|Data di pubblicazione:||1995|
|Digital Object Identifier (DOI):||10.1016/0305-0548(93)E0015-L|
|Appare nelle tipologie:||1.1 Articolo in rivista|