Selected variants of a Memetic Algorithm for JSP – a comparative study
- 27 February 2019
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 57 (22) , 7142-7157
Abstract
The article aims to address a research gap concerning the adequate configuration of a Memetic Algorithm adapted to solve the Job-Shop Scheduling Problem. The goal was accomplished by means of conducting a comparative study of 16 variants of a Memetic Algorithm, characterised with different places of hybridisation and local search methods applied. The study involved the solution of eleven instances of JSP and the comparison of the results with the results achieved with an Evolutionary Algorithm lacking the mechanism of hybridisation and selected local search methods. The utilitarian significance of the problem also involved the use of assessment measures intended for both practical applications and research purposes.Keywords
This publication has 28 references indexed in Scilit:
- A memetic algorithm for the Capacitated Vehicle Routing Problem with Time Windows2017
- A Memetic Algorithm for the Traveling Salesman ProblemIEEE Latin America Transactions, 2015
- Hyperheuristics Based on Parametrized Metaheuristic Schemes2015
- An efficient memetic algorithm for solving the job shop scheduling problemComputers & Industrial Engineering, 2011
- Memetic algorithms for solving job-shop scheduling problemsMemetic Computing, 2008
- A Bee Colony Optimization Algorithm to Job Shop Scheduling2006
- A new value stream mapping approach for complex production systemsInternational Journal of Production Research, 2006
- Ant Colony System for JSPLecture Notes in Computer Science, 2004
- Scheduling Algorithms2001
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993