title   
  

Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems

Muter, İbrahim and Birbil, Ş. İlker and Şahin, Güvenç (2010) Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems. Informs Journal on Computing, 22 (4). pp. 603-619. ISSN 1091-9856 (print) 1526-5528 (electronic)

This is the latest version of this item.

[img]PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
301Kb

Official URL: http://dx.doi.org/10.1287/ijoc.1090.0376

Abstract

We propose a new generic framework for solving combinatorial optimization problems that can be modeled as a set-covering problem. The proposed algorithmic framework combines meta-heuristics with exact algorithms through a guiding mechanism based on diversification and intensification decisions. After presenting this generic framework, we extensively demonstrate its application to the vehicle routing problem with time windows. We then conduct a thorough computational study on a set of well-known test problems, where we show that the proposed approach not only finds solutions that are very close to the best-known solutions reported in the literature but also improves them. We finally set up an experimental design to analyze the effects of different parameters used in the proposed algorithm.

Item Type:Article
Uncontrolled Keywords:local search; combinatorial optimization; tabu search; heuristics; vehicle routing
Subjects:T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering
T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis
ID Code:15693
Deposited By:Güvenç Şahin
Deposited On:06 Dec 2010 16:27
Last Modified:25 May 2011 14:16

Available Versions of this Item

Repository Staff Only: item control page