A multi-swarm fruit fly optimization algorithm to minimize makespan for the hybrid flowshop problem

This paper aims to minimize makespan for the hybrid flowshop scheduling problem. We present a novel Fruit Fly Optimization (FFO), called multi-swarm FFO, by introducing a multiple-swarm strategy and a competition-and-updating mechanism to the basic FFO. The parameters and operators for the presented...

Full description

Saved in:
Bibliographic Details
Published in:Chinese Control Conference pp. 2796 - 2800
Main Authors: Duan, Junhua, Chen, Qingda, Sun, Weiqing, Pan, Quanke
Format: Conference Proceeding
Language:English
Published: Technical Committee on Control Theory, CAA 01.07.2017
Subjects:
ISSN:1934-1768
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper aims to minimize makespan for the hybrid flowshop scheduling problem. We present a novel Fruit Fly Optimization (FFO), called multi-swarm FFO, by introducing a multiple-swarm strategy and a competition-and-updating mechanism to the basic FFO. The parameters and operators for the presented MMFO algorithm are calibrated by means of a design of experiments approach. The numerical comparisons show that MFFO performs much better than several well-known metaheuristics in the literature for the considered HFS problem.
ISSN:1934-1768
DOI:10.23919/ChiCC.2017.8027788