Multi-objective local search combined with NSGA-II for Bi-criteria permutation flow shop scheduling problem

Xin Wei, Wenqiang Zhang, Wei Weng, Shigeru Fujimura

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This paper proposed a multi-objective local search procedure (MOLS). It is combined with NSGA-II for solving bi-criteria PFSP with the objectives of minimizing makespan and maximum tardiness. Utilizing the properties of active blocks for flow shop scheduling problem, neighborhood structures MOINS (multi-objective insertion) and MOEXC (multi-objective exchange) are designed in order to improve efficiency of perturbation. Any perturbation based on MOINS and MOEXC takes effect on different criteria simultaneously. The original idea of MOLS is systematic change neighborhoods in the local search procedure. The search direction of MOLS on an individual is naturally guided by interaction of MOINS and MOEXC. Moreover, there is no need to set parameters in MOLS. The MOLS combined with popular multi-objective evolutionary algorithm NSGA-II (Non-dominated Sorting Genetic Algorithm-II) is called as "NSGA-II- MOLS". To illustrate the efficacy of proposed approach, four different scaled problems are used to test performance of NSGA-II-MOLS. The numerous comparisons show efficacy of NSGA-II-MOLS is better than most of algorithms even with the same number of individual evaluations and parameters setting.

Original languageEnglish
JournalIEEJ Transactions on Electronics, Information and Systems
Volume132
Issue number1
DOIs
Publication statusPublished - 2012

Fingerprint

Sorting
Genetic algorithms
Scheduling
Evolutionary algorithms
Local search (optimization)

Keywords

  • Flow Shop
  • Makespan
  • Maximum Tardiness
  • Multi-objective Genetic Algorithm

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

@article{ed57a731494d4654b8ef566d4443a873,
title = "Multi-objective local search combined with NSGA-II for Bi-criteria permutation flow shop scheduling problem",
abstract = "This paper proposed a multi-objective local search procedure (MOLS). It is combined with NSGA-II for solving bi-criteria PFSP with the objectives of minimizing makespan and maximum tardiness. Utilizing the properties of active blocks for flow shop scheduling problem, neighborhood structures MOINS (multi-objective insertion) and MOEXC (multi-objective exchange) are designed in order to improve efficiency of perturbation. Any perturbation based on MOINS and MOEXC takes effect on different criteria simultaneously. The original idea of MOLS is systematic change neighborhoods in the local search procedure. The search direction of MOLS on an individual is naturally guided by interaction of MOINS and MOEXC. Moreover, there is no need to set parameters in MOLS. The MOLS combined with popular multi-objective evolutionary algorithm NSGA-II (Non-dominated Sorting Genetic Algorithm-II) is called as {"}NSGA-II- MOLS{"}. To illustrate the efficacy of proposed approach, four different scaled problems are used to test performance of NSGA-II-MOLS. The numerous comparisons show efficacy of NSGA-II-MOLS is better than most of algorithms even with the same number of individual evaluations and parameters setting.",
keywords = "Flow Shop, Makespan, Maximum Tardiness, Multi-objective Genetic Algorithm",
author = "Xin Wei and Wenqiang Zhang and Wei Weng and Shigeru Fujimura",
year = "2012",
doi = "10.1541/ieejeiss.132.32",
language = "English",
volume = "132",
journal = "IEEJ Transactions on Electronics, Information and Systems",
issn = "0385-4221",
publisher = "The Institute of Electrical Engineers of Japan",
number = "1",

}

TY - JOUR

T1 - Multi-objective local search combined with NSGA-II for Bi-criteria permutation flow shop scheduling problem

AU - Wei, Xin

AU - Zhang, Wenqiang

AU - Weng, Wei

AU - Fujimura, Shigeru

PY - 2012

Y1 - 2012

N2 - This paper proposed a multi-objective local search procedure (MOLS). It is combined with NSGA-II for solving bi-criteria PFSP with the objectives of minimizing makespan and maximum tardiness. Utilizing the properties of active blocks for flow shop scheduling problem, neighborhood structures MOINS (multi-objective insertion) and MOEXC (multi-objective exchange) are designed in order to improve efficiency of perturbation. Any perturbation based on MOINS and MOEXC takes effect on different criteria simultaneously. The original idea of MOLS is systematic change neighborhoods in the local search procedure. The search direction of MOLS on an individual is naturally guided by interaction of MOINS and MOEXC. Moreover, there is no need to set parameters in MOLS. The MOLS combined with popular multi-objective evolutionary algorithm NSGA-II (Non-dominated Sorting Genetic Algorithm-II) is called as "NSGA-II- MOLS". To illustrate the efficacy of proposed approach, four different scaled problems are used to test performance of NSGA-II-MOLS. The numerous comparisons show efficacy of NSGA-II-MOLS is better than most of algorithms even with the same number of individual evaluations and parameters setting.

AB - This paper proposed a multi-objective local search procedure (MOLS). It is combined with NSGA-II for solving bi-criteria PFSP with the objectives of minimizing makespan and maximum tardiness. Utilizing the properties of active blocks for flow shop scheduling problem, neighborhood structures MOINS (multi-objective insertion) and MOEXC (multi-objective exchange) are designed in order to improve efficiency of perturbation. Any perturbation based on MOINS and MOEXC takes effect on different criteria simultaneously. The original idea of MOLS is systematic change neighborhoods in the local search procedure. The search direction of MOLS on an individual is naturally guided by interaction of MOINS and MOEXC. Moreover, there is no need to set parameters in MOLS. The MOLS combined with popular multi-objective evolutionary algorithm NSGA-II (Non-dominated Sorting Genetic Algorithm-II) is called as "NSGA-II- MOLS". To illustrate the efficacy of proposed approach, four different scaled problems are used to test performance of NSGA-II-MOLS. The numerous comparisons show efficacy of NSGA-II-MOLS is better than most of algorithms even with the same number of individual evaluations and parameters setting.

KW - Flow Shop

KW - Makespan

KW - Maximum Tardiness

KW - Multi-objective Genetic Algorithm

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

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

U2 - 10.1541/ieejeiss.132.32

DO - 10.1541/ieejeiss.132.32

M3 - Article

VL - 132

JO - IEEJ Transactions on Electronics, Information and Systems

JF - IEEJ Transactions on Electronics, Information and Systems

SN - 0385-4221

IS - 1

ER -