Genetic algorithms-baes solution approach to combinatorial optimisation problems Online publication date: Tue, 29-Jul-2008
by Ali K. Kamrani, Ricardo Gonzalez
International Journal of Knowledge Management Studies (IJKMS), Vol. 2, No. 4, 2008
Abstract: This paper presents various methods and algorithms used in the solution of combinatorial optimisation problems. A definition of a combinatorial optimisation problem is first given. The definition is followed by a discussion on the depth first branch-and-bound algorithm and the local search algorithm; two approaches used for solving these kinds of problems. An introduction to Genetic Algorithms (GAs) coupled with an explanation of their role in solving combinatorial optimisation problems such as the travelling salesman problem is then presented. The discussion on genetic algorithms focuses on the advantages and disadvantages of using this technique as a tool or solving combinatorial optimisation problems. A sample instance of the Travelling Salesman Problem (TSP) is then solved using a GA. Finally, some conclusions are presented to emphasise the implications, benefits and drawbacks of using genetic algorithms in the solution of various combinatorial optimisation problems.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Management Studies (IJKMS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook