Abstract—This paper attempt to make decision on the best way a division can allocate teams to contractors, both experience and inexperience. The contractors will consecutively be assigned to their district to handle some public Work. All of these need to be achieved at the cheapest possible way. With these in mind, graph theory was employed in designing a network flow to model the problem. The model was validated with some random cost of allocating contractors to public work. The model was solved using the Hungarian Method, an assignment problem solution algorithm. The solution was implemented with java programming language. With the solution we have another decision making tool.
Index Terms—Allocation, assignment, graph theory, minimum cost, network flow.
O. T. Arogundade is with Institute of System Science, Chinese Academy of Science, Beijing, China. Phone number: +8613521458627. E-mail: roelaw.arogundade82@gmail.com
X. Yang is with Institute of System Science, Chinese Academy of Science, Beijing, China. E-mail: xgyang@iss.ac.cn
S. Onimole, University of Agriculture, Abeokuta, P.M.B. 2240, Ogun State, Nigeria
Cite: Arogundade O. Tale, Xiaoguang Yang, and S. Onimole, "Network Flow Modeling: An Approach to Allocating Contractors to Public Works," International Journal of Computer Theory and Engineering vol. 3, no. 4, pp. 479-483, 2011.
Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.
