z-logo
Premium
Improving Combinatorial Optimization Algorithms through Record Keeping in Constructive Multistart Search
Author(s) -
King Charles R.,
Tamir Dan E.,
McKenney Mark
Publication year - 2014
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.21667
Subject(s) - travelling salesman problem , algorithm , hill climbing , mathematical optimization , combinatorial optimization , computer science , 2 opt , redundancy (engineering) , constructive , mathematics , process (computing) , operating system
Constructive multistart search algorithms are commonly used to address combinatorial optimization problems; however, constructive multistart search algorithm performance is fundamentally affected by two factors: (i) The choice of construction algorithm utilized and (ii) the rate of state space search redundancy. Construction algorithms are typically specific to a particular combinatorial optimization problem; therefore, we first investigate construction algorithms for iterative hill climbing applied to the traveling salesman problem and experimentally determine the best performing algorithms. We then investigate the more general problem of utilizing record‐keeping mechanisms to mitigate state space search redundancy. Our research shows that a good choice of construction algorithm paired with effective record keeping significantly improves the quality of traveling salesmen problem solutions in a constant number of state explorations. Particularly, we show that Bloom filters considerably improve time performance and solution quality for iterative hill climbing approaches to the traveling salesman problem.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here