Abstract

Linear ordering problem (LOP) is a well know optimization problem attractive for its complexity (it is a NP hard problem), rich collection of testing data and variety of real world applications. In this paper, we investigate the usage and performance of two variants of genetic algorithms - mutation only genetic algorithms and higher level chromosome genetic algorithms - on the linear ordering problem. Both methods are tested and evaluated on a collection of real world and artificial LOP instances.

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 call

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.