A travelling saleman Problem–Genetic Algorithm multi-objective algorithm for flow-shop scheduling

A travelling saleman Problem–Genetic Algorithm multi-objective algorithm for flow-shop scheduling

0.00 Avg rating0 Votes
Article ID: iaor2006457
Country: United States
Volume: 23
Issue: 11/12
Start Page Number: 909
End Page Number: 915
Publication Date: Jun 2004
Journal: International Journal of Advanced Manufacturing Technology
Authors: , , ,
Keywords: programming: multiple criteria, programming: travelling salesman
Abstract:

A multi-objective evolutionary search algorithm using a travelling salesman algorithm and genetic algorithm for flow-shop scheduling is proposed in this paper. The initial sequence is obtained by solving the TSP. The initial population of the genetic algorithm is created with the help of a neighbourhood creation scheme known as a random insertion perturbation scheme, which uses the sequence obtained from TSP. The proposed algorithm uses a weighted sum of multiple objectives as a fitness function. The weights are randomly generated for each generation to enable a multi-directional search. The performance measures considered include minimising makespan, mean flow time and machine idle time. The performance of the proposed algorithm is demonstrated by applying it to benchmark problems available in the OR-Library.

Reviews

Required fields are marked *. Your email address will not be published.