Improving Combinatorial Optimization Algorithms through Record Keeping in Constructive Multistart Search |
| |
| Authors: | Dan E Tamir Mark McKenney |
| |
| Affiliation: | Deparment of Computer Science, Texas State University, San Marcos |
| |
| Abstract: | 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. |
| |
| Keywords: | |
|
|
