Multi-objective job shop scheduling based on multiagent evolutionary algorithm

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 (MAEA-MOJSP). 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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Duan, X., Liu, J., Zhang, L., & Jiao, L. (2010). Multi-objective job shop scheduling based on multiagent evolutionary algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6457 LNCS, pp. 543–552). https://doi.org/10.1007/978-3-642-17298-4_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free