Searching Best Strategies Algorithm for the No Balance Assignment Problem

Abstract:

Article Preview

The No Balance Assignment Problem (NBAP) is mainly resolved by changing it into Balance Assignment Problem (BAP) and using classical algorithm to deal with it now. This paper proposed Searching Best strategies Algorithm (SBSA) to resolve this problem, and it needn’t to change NBAP into BAP. SBSA resolves NBAP based on searching the best answer of the cost matrix. This algorithm’s theory is simple,and it is easy to operate. The result of the research indicate that the algorithm not only can deal with NBAP, but also can deal with BAP and other problems such as translation problem.

Info:

Periodical:

Edited by:

Shaobo Zhong, Yimin Cheng and Xilong Qu

Pages:

386-390

DOI:

10.4028/www.scientific.net/AMM.50-51.386

Citation:

M. Y. Fang et al., "Searching Best Strategies Algorithm for the No Balance Assignment Problem", Applied Mechanics and Materials, Vols. 50-51, pp. 386-390, 2011

Online since:

February 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.