Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime

Authors:
Wagner Emanoel Costa;Marco CéSar Goldbarg;Elizabeth G. Goldbarg
Affiliations:
Programa de Pós-Graduação em Sistemas e Computação - UFRN/CCET/PPGSC, Campus Universitário, Lagoa Nova, Natal, RN, Brazil;Departamento de Informática e Matemática Aplicada - UFRN/CCET/DIMAp, Campus Universitário, Lagoa Nova, Natal, RN, Brazil;Departamento de Informática e Matemática Aplicada - UFRN/CCET/DIMAp, Campus Universitário, Lagoa Nova, Natal, RN, Brazil
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 12
Cited 0

A discrete version of particle swarm optimization for flowshop scheduling problems

Computers and Operations Research
A combinatorial particle swarm optimisation for solving permutation flowshop problems

Computers and Industrial Engineering
A discrete differential evolution algorithm for the permutation flowshop scheduling problem

Computers and Industrial Engineering
An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion

Computers and Operations Research
An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems

Computers and Operations Research
Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization

CSCWD '09 Proceedings of the 2009 13th International Conference on Computer Supported Cooperative Work in Design
Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum

Computers and Industrial Engineering
An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization

Expert Systems with Applications: An International Journal
Estimation of distribution algorithm for permutation flow shops with total flowtime minimization

Computers and Industrial Engineering
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

Information Sciences: an International Journal
New VNS heuristic for total flowtime flowshop scheduling problem

Expert Systems with Applications: An International Journal
Path-relinking intensification methods for stochastic local search algorithms

Journal of Heuristics

Quantified Score

Hi-index	12.05

Visualization

Abstract

This paper presents a new hybridization of VNS and path-relinking on a particle swarm framework for the Permutational Flowshop Scheduling Problem with total flowtime criterion. The operators of the proposed particle swarm are based on path-relinking and variable neighborhood search methods. The performance of the new approach was tested on the benchmark suit of Taillard, and five novel solutions for the benchmark suit are reported. The results were compared against results obtained using methods from literature. Statistical analysis favors the new particle swarm approach over the other methods tested.