By Topic

An algebraic approach to mechanical tabu search algorithm generation

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
$33 $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

3 Author(s)
Yujun Zheng ; Provincial Key Lab of High-Performance Computing, Jiangxi Normal University, Nanchang, China ; Haihe Shi ; Jinyun Xue

Traditional approaches to apply tabu search method typically require formulating an algorithmic structure for each individual problem. Based on algebraic specifications, the paper presents a unified and mechanical framework for implementing tabu search algorithms for combinatorial optimization problems. We define a generalized specification using high-order functions to describe search strategies, from which efficient algorithms can be generated for concrete problems by data type refinement and functional refinement. We also extend the framework for multi-objective problems by enriching specification behaviors. Our approach achieves a high level of abstraction and mechanization without losing performance.

Published in:

Progress in Informatics and Computing (PIC), 2010 IEEE International Conference on  (Volume:2 )

Date of Conference:

10-12 Dec. 2010