Journal ArticleDOI
A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems
Lining Xing,Yingwu Chen,Peng Wang,Qingsong Zhao,Jian Xiong +4 more
- Vol. 10, Iss: 3, pp 888-896
TLDR
A Knowledge-Based Ant Colony Optimization (KBACO) algorithm is proposed in this paper for the Flexible Job Shop Scheduling Problem (FJSSP) and results indicate that the proposed KBACO algorithm outperforms some current approaches in the quality of schedules.Abstract:
A Knowledge-Based Ant Colony Optimization (KBACO) algorithm is proposed in this paper for the Flexible Job Shop Scheduling Problem (FJSSP). KBACO algorithm provides an effective integration between Ant Colony Optimization (ACO) model and knowledge model. In the KBACO algorithm, knowledge model learns some available knowledge from the optimization of ACO, and then applies the existing knowledge to guide the current heuristic searching. The performance of KBACO was evaluated by a large range of benchmark instances taken from literature and some generated by ourselves. Final experimental results indicate that the proposed KBACO algorithm outperforms some current approaches in the quality of schedules.read more
Citations
More filters
Journal ArticleDOI
Review: A survey: Ant Colony Optimization based recent research and implementation on several engineering domain
TL;DR: A modified ACO model is proposed which is applied for network routing problem and compared with existing traditional routing algorithms.
Journal ArticleDOI
Review of job shop scheduling research and its new perspectives under Industry 4.0
TL;DR: This paper explores the future research direction in SDS and discusses the new techniques for developing future new JSP scheduling models and constructing a framework on solving the JSP problem under Industry 4.0.
Journal ArticleDOI
A research survey: review of flexible job shop scheduling techniques
Imran Ali Chaudhry,Abid Ali Khan +1 more
TL;DR: The paper aims at presenting the development of flexible JSS and a consolidated survey of various techniques that have been employed since 1990 for problem resolution.
Journal ArticleDOI
A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
TL;DR: The highly effective and efficient performance of the proposed DABC algorithm is shown against the best performing algorithms from the literature.
Journal ArticleDOI
A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems
TL;DR: The mathematical model of FJSP is presented, the constraints in applications are summarized, and the encoding and decoding strategies for connecting the problem and algorithms are reviewed to give insight into future research directions.
References
More filters
Journal ArticleDOI
MAX-MIN Ant system
Thomas Stützle,Holger H. Hoos +1 more
TL;DR: Computational results on the Traveling Salesman Problem and the Quadratic Assignment Problem show that MM AS is currently among the best performing algorithms for these problems.
Journal ArticleDOI
The Complexity of Flowshop and Jobshop Scheduling
TL;DR: The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.
Journal ArticleDOI
Routing and scheduling in a flexible job shop by tabu search
TL;DR: A hierarchical algorithm for the flexible job shop scheduling problem is described, based on the tabu search metaheuristic, which allows to adapt the same basic algorithm to different objective functions.
Journal ArticleDOI
An orthogonal genetic algorithm with quantization for global numerical optimization
Yiu-Wing Leung,Yuping Wang +1 more
TL;DR: The objective is to apply methods of experimental design to enhance the genetic algorithm, so that the resulting algorithm can be more robust and statistically sound and a quantization technique is proposed to complement an experimental design method called orthogonal design.
Proceedings ArticleDOI
Memory enhanced evolutionary algorithms for changing optimization problems
TL;DR: A new way to explore the benefits of a memory while minimizing its negative side effects is derived from a number of approaches that extend the evolutionary algorithm with implicit or explicit memory.
Related Papers (5)
A genetic algorithm for the Flexible Job-shop Scheduling Problem
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
Jie Gao,Linyan Sun,Mitsuo Gen +2 more