Sequencing in an assembly line with blocking to minimize cycle time
Operations Research
The “molecular” traveling salesman
Biological Cybernetics
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
A parallel tabu search algorithm for large traveling salesman problems
Discrete Applied Mathematics
Genetic algorithms for flowshop scheduling problems
Computers and Industrial Engineering
Scheduling computer and manufacturing processes
Scheduling computer and manufacturing processes
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Tabu search for a class of single-machine scheduling problems
Computers and Operations Research
Minimizing tardiness in a two-machine flow-shop
Computers and Operations Research
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
Artificial Intelligence Review
New Operators of Genetic Algorithms for Traveling Salesman Problem
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
Computers and Operations Research
Applying adaptive algorithms to epistatic domains
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Computers and Operations Research
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
International Journal of Bio-Inspired Computation
International Journal of Bio-Inspired Computation
An evolutionary algorithm for large traveling salesman problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A novel genetic algorithm based on immunity
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Genetic algorithm and pure random search for exosensor distribution optimisation
International Journal of Bio-Inspired Computation
A review of concurrent optimisation methods
International Journal of Bio-Inspired Computation
Hi-index | 0.00 |
This paper presents a novel genetic algorithm GA to address a wide range of sequencing and scheduling optimisation problems. As for the performance analysis we have applied our algorithm on travelling salesman problems TSPs and flow shop scheduling problems FSPs. Our main objective is to develop an adaptive method which is equally applicable to all kind of optimisation problems with discrete decision variables. Keeping that view in mind we present some new crossover and mutation operators to tackle TSP as well as FSP with GA with path representation. We have also used a new ring parent topology to generate offspring. A new selection procedure, trio-selection procedure is applied to avoid undesirable clustering before reaching the optima. Faster convergence is assured by applying some modified mutation schemes in finding optimal order of cities in TSP and minimising the maximum completion time i.e., makespan for blocking flow shop scheduling problems. This novel GA variant ensures much better results compared to other heuristics, which is apparent from the experimental results and comparisons with other existing algorithms provided below.