Copyright © 2018 by author and Scientific Research Publishing Inc. This work is licensed under the Creative Commons Attribution International License (CC BY 4.0). In ...
Research Institute for ESMD Method and Its Applications, College of Science, Qingdao University of Technology, Qingdao, China. The travelling salesman problem asks the following question: “Given a ...
Keywords: Flow-shop scheduling problem, greedy, metaheuristic, hill climbing, simulated annealing, genetic. Abstract: The FLOW-SHOP problem is an NP-HARD problem derived from the optimal scheduling ...
There was an error while loading. Please reload this page. This repository contains a novel algorithm that claims to transform NP-complete problems into polynomial ...
Abstract: Recent studies have shown that Evolutionary Algorithms have had reasonable success at providing solutions to those problems that fall in NP-Complete class of algorithms. Ant Colony ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results