Subscribe Now Subscribe Today
Science Alert
 
FOLLOW US:     Facebook     Twitter
Blue
   
Curve Top
Journal of Applied Sciences
  Year: 2010 | Volume: 10 | Issue: 18 | Page No.: 1991-2000
DOI: 10.3923/jas.2010.1991.2000
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail
A New Machine Learning based Approach for Tuning Metaheuristics for the Solution of Hard Combinatorial Optimization Problems
M. Zennaki and A. Ech- Cherif

Abstract:
This study deals with the problem of tuning metaheuristics for the solution of hard combinatorial optimization problems using machine learning techniques. Decision rules, learned from a corpus of various solutions of randomly generated instances, are repeatedly used to predict solutions quality for a given instance of the combinatorial problem when solved by the metaheuristic. This predicted solution quality is used to fine tune and guide the metaheuristic to more promising search regions during the course of its execution. Results from extensive experimentation on a wide range of hard combinatorial optimization problems ranging from the knapsack problem to the well known Travelling Salesman Problem (TSP) show a noticeable improvement in the objective function value of the solution found by our approach as well as the execution time compared to plain metaheuristics. However, the process of building the corpus and extracting the classification rule is still time consuming but we think it is worth the effort given the fact that this corpus is built only once and also, can provide quick and quality solutions for a stream of instances of the combinatorial problem.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Nonlinearly Penalized Delays
How to cite this article:

M. Zennaki and A. Ech- Cherif, 2010. A New Machine Learning based Approach for Tuning Metaheuristics for the Solution of Hard Combinatorial Optimization Problems. Journal of Applied Sciences, 10: 1991-2000.

DOI: 10.3923/jas.2010.1991.2000

URL: https://scialert.net/abstract/?doi=jas.2010.1991.2000

 
COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

       

       

Curve Bottom