Fast and effective evolutionary algorithm for multiobjective process planning and scheduling problem

Wenqiang Zhang, Xin Wei, Shigeru Fujimura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Multiobjective process planning and scheduling (moPPS) is a most important, practical but very intractable problem in manufacturing systems. Many research works use multiobjective EA to solve such problems; however, they cannot achieve satisfactory results in both quality and speed. This paper proposes a fast and effective evolutionary algorithm (FEEA) to deal with moPPS problem. FEEA tactfully unites the advantages of vector evaluated genetic algorithm (VEGA) and Pareto dominating and dominated relationship-based (PDDR) fitness function. VEGA prefers the edge region of the Pareto front and PDDR has the tendency converging toward the central area of the Pareto front. These two mechanisms preserve both the convergence rate and the distribution performance. Numerical comparisons show that the convergence performance of FEEA is better than NSGA-II and SPEA2 while the distribution performance is slightly better or equivalent, and the efficiency is obviously better than they are.

Original languageEnglish
Title of host publication21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings
PublisherFraunhofer-Verlag
ISBN (Print)9783839602935
Publication statusPublished - 2011
Event21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Stuttgart
Duration: 2011 Jul 312011 Aug 4

Other

Other21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011
CityStuttgart
Period11/7/3111/8/4

Fingerprint

Process planning
Evolutionary algorithms
Scheduling
Genetic algorithms

Keywords

  • Evolutionary algorithm
  • Multiobjective optimization
  • Process planning and scheduling

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Industrial and Manufacturing Engineering

Cite this

Zhang, W., Wei, X., & Fujimura, S. (2011). Fast and effective evolutionary algorithm for multiobjective process planning and scheduling problem. In 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings Fraunhofer-Verlag.

Fast and effective evolutionary algorithm for multiobjective process planning and scheduling problem. / Zhang, Wenqiang; Wei, Xin; Fujimura, Shigeru.

21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag, 2011.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, W, Wei, X & Fujimura, S 2011, Fast and effective evolutionary algorithm for multiobjective process planning and scheduling problem. in 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag, 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011, Stuttgart, 11/7/31.
Zhang W, Wei X, Fujimura S. Fast and effective evolutionary algorithm for multiobjective process planning and scheduling problem. In 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag. 2011
Zhang, Wenqiang ; Wei, Xin ; Fujimura, Shigeru. / Fast and effective evolutionary algorithm for multiobjective process planning and scheduling problem. 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag, 2011.
@inproceedings{e258acb5a75640c5b02bbbf8003e32fa,
title = "Fast and effective evolutionary algorithm for multiobjective process planning and scheduling problem",
abstract = "Multiobjective process planning and scheduling (moPPS) is a most important, practical but very intractable problem in manufacturing systems. Many research works use multiobjective EA to solve such problems; however, they cannot achieve satisfactory results in both quality and speed. This paper proposes a fast and effective evolutionary algorithm (FEEA) to deal with moPPS problem. FEEA tactfully unites the advantages of vector evaluated genetic algorithm (VEGA) and Pareto dominating and dominated relationship-based (PDDR) fitness function. VEGA prefers the edge region of the Pareto front and PDDR has the tendency converging toward the central area of the Pareto front. These two mechanisms preserve both the convergence rate and the distribution performance. Numerical comparisons show that the convergence performance of FEEA is better than NSGA-II and SPEA2 while the distribution performance is slightly better or equivalent, and the efficiency is obviously better than they are.",
keywords = "Evolutionary algorithm, Multiobjective optimization, Process planning and scheduling",
author = "Wenqiang Zhang and Xin Wei and Shigeru Fujimura",
year = "2011",
language = "English",
isbn = "9783839602935",
booktitle = "21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings",
publisher = "Fraunhofer-Verlag",

}

TY - GEN

T1 - Fast and effective evolutionary algorithm for multiobjective process planning and scheduling problem

AU - Zhang, Wenqiang

AU - Wei, Xin

AU - Fujimura, Shigeru

PY - 2011

Y1 - 2011

N2 - Multiobjective process planning and scheduling (moPPS) is a most important, practical but very intractable problem in manufacturing systems. Many research works use multiobjective EA to solve such problems; however, they cannot achieve satisfactory results in both quality and speed. This paper proposes a fast and effective evolutionary algorithm (FEEA) to deal with moPPS problem. FEEA tactfully unites the advantages of vector evaluated genetic algorithm (VEGA) and Pareto dominating and dominated relationship-based (PDDR) fitness function. VEGA prefers the edge region of the Pareto front and PDDR has the tendency converging toward the central area of the Pareto front. These two mechanisms preserve both the convergence rate and the distribution performance. Numerical comparisons show that the convergence performance of FEEA is better than NSGA-II and SPEA2 while the distribution performance is slightly better or equivalent, and the efficiency is obviously better than they are.

AB - Multiobjective process planning and scheduling (moPPS) is a most important, practical but very intractable problem in manufacturing systems. Many research works use multiobjective EA to solve such problems; however, they cannot achieve satisfactory results in both quality and speed. This paper proposes a fast and effective evolutionary algorithm (FEEA) to deal with moPPS problem. FEEA tactfully unites the advantages of vector evaluated genetic algorithm (VEGA) and Pareto dominating and dominated relationship-based (PDDR) fitness function. VEGA prefers the edge region of the Pareto front and PDDR has the tendency converging toward the central area of the Pareto front. These two mechanisms preserve both the convergence rate and the distribution performance. Numerical comparisons show that the convergence performance of FEEA is better than NSGA-II and SPEA2 while the distribution performance is slightly better or equivalent, and the efficiency is obviously better than they are.

KW - Evolutionary algorithm

KW - Multiobjective optimization

KW - Process planning and scheduling

UR - http://www.scopus.com/inward/record.url?scp=84923408536&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84923408536&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84923408536

SN - 9783839602935

BT - 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings

PB - Fraunhofer-Verlag

ER -