About: Min-conflicts algorithm is a research topic. Over the lifetime, 450 publications have been published within this topic receiving 15670 citations.
TL;DR: A new optimization algorithm based on the law of gravity and mass interactions is introduced and the obtained results confirm the high performance of the proposed method in solving various nonlinear functions.
TL;DR: The impacts of constant parameters on harmony search algorithm are discussed and a strategy for tuning these parameters is presented and the proposed algorithm can find better solutions when compared to HS and other heuristic or deterministic methods.
TL;DR: A variation of minimax lookahead search, and an analog to alpha-beta pruning that significantly improves the efficiency of the algorithm, and a new algorithm, called Real-Time-A∗, for interleaving planning and execution, which proves that the algorithm makes locally optimal decisions and is guaranteed to find a solution.
TL;DR: In this article, the min-conflicts heuristic is used to minimize the number of constraint violations after each step in a value-ordering heuristic search, which can be used with a variety of different search strategies.
TL;DR: A binary version of the gravitational search algorithm, based on the law of gravity and mass interactions, is introduced and the experimental results confirm the efficiency of the BGSA in solving various nonlinear benchmark functions.
Abstract: Gravitational search algorithm is one of the new optimization algorithms that is based on the law of gravity and mass interactions. In this algorithm, the searcher agents are a collection of masses, and their interactions are based on the Newtonian laws of gravity and motion. In this article, a binary version of the algorithm is introduced. To evaluate the performances of the proposed algorithm, several experiments are performed. The experimental results confirm the efficiency of the BGSA in solving various nonlinear benchmark functions.