Searching Best Strategies Algorithm for the No Balance Assignment Problem

Mao Yan Fang; Min Le Wang; Yi Ming Bi

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

Paper Titles

Study of Milling Force in High Speed Milling Carbon Fibre Reinforced Plastics (CFRP) Using Diamond Tool
p.368

Generalized Refinable Function Vectors with Hermite Interpolating Property
p.372

A Note on q-Derivative Operator and Divided Difference
p.377

Simulation of General 3D Virtual Stochastic Road Model
p.382

Searching Best Strategies Algorithm for the No Balance Assignment Problem
p.386

Hermitian Solutions to a Quaternion Matrix Equation
p.391

Crack Pattern and Ductility of Connections Composed of CSSEUHSC Columns and SEC Beams under Cycle Loads
p.396

Kinematic/Dynamic Simulation of Gear System of Tunnel Boring Machine
p.400

Principal Component Analysis the Economy of Shanghai in 2010
p.404

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 50-51Searching Best Strategies Algorithm for the No...

Searching Best Strategies Algorithm for the No Balance Assignment Problem

Abstract:

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.

You might also be interested in these eBooks

Intelligent Structure and Vibration Control

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 50-51)

Pages:

386-390

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.50-51.386

Citation:

Cite this paper

Online since:

February 2011

Authors:

Mao Yan Fang, Min Le Wang, Yi Ming Bi

Keywords:

Assignment Problem, Cost Matrix, Overall Situation Searching

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] ZhANG Lianpeng. Two Improvements on the Hungarian Assignment Approches[J]. Journal of Xi'an Aerotechnical college, 2007(1): 64-66.

Google Scholar

[2] XIA Yong. Improved Gilmore-Lawler Bound for Quadratic Assignment Problems[J]. Chinese Journal of Engineer Mathmatics, 2007(6): 401-413.

Google Scholar

[3] QIAN Songdi. Operational Research[M]. Tsing Hua University Press, 1990: 128-134.

Google Scholar

[4] LIU Yang, FAN Zhiping. A Method for Solving The Multi-objective Assignment Problem with Multiple Format Information, 2008(5): 73-78.

Google Scholar

[5] LI Yan, GUO Qiang．Algorithm for uncertainty assignment problem．Computer Engineering and Applications, 2009(15).

Google Scholar

[6] ZHOU Kang, TONG Xiaojun, XUN Jin. Algorithm of DNA computing on optimal assignment Problems[J]. Systems Engineering and Electronics, 2007(7): 1183-1187.

Google Scholar

[7] LI Yueqiu, YANG Yaqin, LIU Wenqi. A new approach of optimalassignment proble[J]. Journal of Science of Teachers' Colege and Universit, 2008(3): 15-17.

Google Scholar

[8] CHI Jie. A Not of the Constrained Assignment Problem [J]. CoLLEGE MATHEMATICS, 2009(4): 66-69.

Google Scholar

[9] YU Yingzi, ZHANG Qiang. An Efficient Algorithm for a Class of Generalized Assignment Problem. MATHEMATICS IN PRACTICE AND THEORY, 2008(2): 86-91.

Google Scholar

[10] XU Xiaolin. Study of Multi-type Vehicle Scheduling Problem Based on Hungary Algorithm[J]. Fire Control & Command Control, 2009(2): 137-139.

Google Scholar