Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
A multiagent evolutionary algorithm for constraint satisfaction problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
With the properties of multi-objective job shop problem (MOJSP) in mind, we integrate the multiagent systems and evolutionary algorithms to form a new algorithm, multiagent evolutionary algorithm for MOJSP (MAEAMOJSP). In MAEA-MOJSP, an agent represents a candidate solution to MOJSP, and all agents live in a latticelike environment. Making use of three designed behaviors, the agents sense and interact with their neighbors. In the experiments, eight benchmark problems are used to test the performance of the algorithm proposed. The experimental results show that MAEA-MOJSP is effective.