Comparison of multiobjective evolutionary algorithms for operations scheduling under machine availability constraints.

ScientificWorldJournal

Department of Engineering and Instituto de Investigaciones Económicas y Sociales del Sur (IIESS-CONICET), Universidad Nacional del Sur, Avenida. Alem 1253, 8000 Bahía Blanca, Argentina.

Published: September 2014

Many of the problems that arise in production systems can be handled with multiobjective techniques. One of those problems is that of scheduling operations subject to constraints on the availability of machines and buffer capacity. In this paper we analyze different Evolutionary multiobjective Algorithms (MOEAs) for this kind of problems. We consider an experimental framework in which we schedule production operations for four real world Job-Shop contexts using three algorithms, NSGAII, SPEA2, and IBEA. Using two performance indexes, Hypervolume and R2, we found that SPEA2 and IBEA are the most efficient for the tasks at hand. On the other hand IBEA seems to be a better choice of tool since it yields more solutions in the approximate Pareto frontier.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3892943PMC
http://dx.doi.org/10.1155/2013/418396DOI Listing

Publication Analysis

Top Keywords

spea2 ibea
8
comparison multiobjective
4
multiobjective evolutionary
4
evolutionary algorithms
4
algorithms operations
4
operations scheduling
4
scheduling machine
4
machine availability
4
availability constraints
4
constraints problems
4

Similar Publications

Empowering decision makers with cost-effective solutions for reducing industrial processes environmental burden, at both design and operation stages, is nowadays a major worldwide concern. The paper addresses this issue for the sector of drinking water production plants (DWPPs), seeking for optimal solutions trading-off operation cost and life cycle assessment (LCA)-based environmental impact while satisfying outlet water quality criteria. This leads to a challenging bi-objective constrained optimization problem, which relies on a computationally expensive intricate process-modelling simulator of the DWPP and has to be solved with limited computational budget.

View Article and Find Full Text PDF

Comparison of multiobjective evolutionary algorithms for operations scheduling under machine availability constraints.

ScientificWorldJournal

September 2014

Department of Engineering and Instituto de Investigaciones Económicas y Sociales del Sur (IIESS-CONICET), Universidad Nacional del Sur, Avenida. Alem 1253, 8000 Bahía Blanca, Argentina.

Many of the problems that arise in production systems can be handled with multiobjective techniques. One of those problems is that of scheduling operations subject to constraints on the availability of machines and buffer capacity. In this paper we analyze different Evolutionary multiobjective Algorithms (MOEAs) for this kind of problems.

View Article and Find Full Text PDF

Diagnostic assessment of search controls and failure modes in many-objective evolutionary optimization.

Evol Comput

December 2012

Department of Computer Science and Engineering, The Pennsylvania State University, University Park 16802, USA.

The growing popularity of multiobjective evolutionary algorithms (MOEAs) for solving many-objective problems warrants the careful investigation of their search controls and failure modes. This study contributes a new diagnostic assessment framework for rigorously evaluating the effectiveness, reliability, efficiency, and controllability of MOEAs as well as identifying their search controls and failure modes. The framework is demonstrated using the recently introduced Borg MOEA, [Formula: see text]-NSGA-II, [Formula: see text]-MOEA, IBEA, OMOPSO, GDE3, MOEA/D, SPEA2, and NSGA-II on 33 instances of 18 test problems from the DTLZ, WFG, and CEC 2009 test suites.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!