By Topic

A New Approach using Machine Learning and Data Fusion Techniques for Solving Hard Combinatorial Optimization Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zennaki, M. ; Comput. Sci. Dept., U.S.T.O.M.B., Oran ; Ech-cherif, A.

We investigate the possibility of using kernel clustering and data fusion techniques for solving hard combinatorial optimization problems. The proposed general paradigm aims at incorporating unsupervised kernel methods into population-based heuristics, which rely on spatial fusion of solutions, in order to learn the solution clusters from the search history. This form of extracted knowledge guides the heuristic to detect automatically promising regions of solutions. The proposed algorithm derived from this paradigm is an extension of the classical scatter search and can automatically learn during the search process by exploiting the history of solutions found. Preliminary results, with an application to the well-known vehicle routing problem (VRP) show the great interest of such paradigm and can effectively find near-optimal solutions for large problem instances.

Published in:

Information and Communication Technologies: From Theory to Applications, 2008. ICTTA 2008. 3rd International Conference on

Date of Conference:

7-11 April 2008