Pi Dechang
Personal Homepage
Paper Publications
Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion
Hits:

Affiliation of Author(s):计算机科学与技术学院/人工智能学院/软件学院

Journal:APPLIED SOFT COMPUTING

Key Words:Memetic algorithm Node and edge histogram Random sample crossover Local refinements No-idle permutation flow shop scheduling problem

Abstract:This paper presents a memetic algorithm with hybrid node and edge histogram (MANEH) to solve no-idle permutation flow shop scheduling problem (NIPFSP) with the criterion to minimize the maximum completion time (the makespan criterion). The MANEH mainly composes of two components: population-based global search and local refinements for individuals. At the initialization stage, a modified speed-up NEH method and the random initialization are utilized to generate more promising solutions with a reasonable running time. At the population-based global search stage, a random sample crossover is first proposed to construct a hybrid node and edge histogram matrix (NEHM) with superior solutions in the population, and then a new sequence is generated by sampling the NEHM or selecting jobs from a template sequence. At the local refinements stage, an improved general variable neighborhood search with the simulated annealing acceptance (GVNS-SA) is developed to improve the current best individual. The GVNS-SA adopts a random referenced local search in the inner loop and the probability of SA to decide whether accept the incumbent solution for the next iteration. Moreover, the influence of key parameters in the MANEH is investigated based on the approach of a design of experiments (DOE). Finally, numerical simulation based on the benchmark of Ruiz and thorough statistical analysis are provided. The comparisons between MANEH and some existing algorithms as well as MA-based algorithms demonstrate the effectiveness and superiority of the proposed MANEH in solving the NIPFSP. Furthermore, the MANEH improves 89 out of the 250 current best solutions reported in the literature. (C) 2017 Elsevier B.V. All rights reserved.

ISSN No.:1568-4946

Translation or Not:no

Date of Publication:2017-05-01

Co-author:邵炜世,邵仲世

Correspondence Author:Pi Dechang

Personal information

Professor
Supervisor of Doctorate Candidates

Alma Mater:南京航空航天大学

School/Department:College of Computer Science and Technology

Business Address:南航江宁校区东区计算机学院

Contact Information:邮箱:nuaacs@126.com 电话:025-52110071

Click:

Open time:..

The Last Update Time:..


Copyright©2018- Nanjing University of Aeronautics and Astronautics·Informationization Department(Informationization Technology Center)

MOBILE Version