Abstract
A new method has been introduced to solve combinatorial problems so-named “local clustering organization method (LCO)”. In applying LCO to the traveling salesman problem (TSP), it is proven that LCO has good solutions with high accuracy and computation speed. A learning theory of LCO is based on Riccati type learning equation as well as self-organizing maps (SOM). However, LCO is independent of neuron synapses in learning process. LCO makes use of a criteria function instead of neuron synapses. In this study, The LCO solution is proposed in being applied to the job-shop scheduling problem (JSP) and its efficiency is investigated. Numerical experiments verify that LCO solves JSP with high accuracy and computation speed in comparison with the genetic algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Japan Society for Precision Engineering, Contributed Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
