Anzeige
Erschienen in:
2017 | OriginalPaper | Buchkapitel
Fast Convergence to Near Optimal Solution for Job Shop Scheduling Using Cat Swarm Optimization
verfasst von : Vivek Dani, Aparna Sarswat, Vishnu Swaroop, Shridhar Domanal, Ram Mohana Reddy Guddeti
Erschienen in: Pattern Recognition and Machine Intelligence
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Job Shop Scheduling problem has wide range of applications. However it being a NP-Hard optimization problem, always finding an optimal solution is not possible in polynomial amount of time. In this paper we propose a heuristic approach to find near optimal solution for Job Shop Scheduling Problem in predetermined amount of time using Cat Swarm Optimization. Novelty in our approach is our non-conventional way of representing position of cat in search space that ensures advantage of spatial locality is taken. Further while exploring the search space using randomization, we never explore an infeasible solution. This reduces search time. Our proposed approach outperforms some of the conventional algorithms and achieves nearly 86% accuracy, while restricting processing time to one second.