Cart (Loading....) | Create Account
Close category search window
 

Evolutionary estimation of assignment-ordering function for CSP-modeled combinatorial optimization

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

3 Author(s)
Acan, A. ; Dept. of Comput. Eng., Eastern Mediterranean Univ., Mersin, Turkey ; Unveren, A. ; Tekol, Y.

A novel evolutionary assignment-ordering approach for combinatorial optimization using constraint satisfaction problem (CSP) modelling is presented. In assignment of values to variables, the order of assignment is determined by an ordering function combined with problem specific features. No a priori information is available on the assignment-ordering function and it is completely determined by evolutionary optimization to produce the best assignment results. Indeed, experimental evaluations show that the proposed method outperforms very well-known approaches for the solution of NP-hard combinatorial optimization problems.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:1 )

Date of Conference:

8-12 Dec. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.