南京航空航天大学k8凯发集团主页平台管理系统 皮德常-k8凯发集团

点击次数：
所属单位：计算机科学与技术学院/人工智能学院/软件学院
发表刊物：applied soft computing
关键字：memetic algorithm node and edge histogram random sample crossover local refinements no-idle permutation flow shop scheduling problem
摘要：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号：1568-4946
是否译文：否
发表时间：2017-05-01
合写作者：邵炜世,邵仲世
通讯作者：皮德常