Abstract

In this paper, we introduce a new expanded search mechanism, which pays attention to updating the group of solutions searched by same search point rather than just a solution. After confirming the affinities to “Hierarchical Interpretation of Solution Space which is also proposed by our research group, we adapt the expanded search mechanism to the search tactics based on the structure above. This assembly allows us to search solutions by expanding the explored area in the combinatorial optimization problem solution space, rather than searching in a route. In addition, remained issues in previous tactics can also be solved. To verify the basic performance of the expanded search mechanism, we propose a new combinatorial optimization method with previous strategies, and compare it with previous method by numerical experiment. Finally, the new mechanism’s potentials are discussed.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call