Allocation of a large number of resources to tasks in a complex environment is often a very challenging problem. This is primarily due to the fact that a large number of resources to be allocated results into an optimization problem that involves a large number of decision variables. Most of the optimization algorithms suffer from this issue of non-scalability. Further, the uncertainties and dynamic nature of environment make the optimization problem quite challenging. One of the techniques to overcome the issue of scalability that have been considered recently is to carry out the optimization in a distributed or decentralized manner. Such techniques make use of local information to carry out global optimization. However, such techniques tend to get stuck in local minima. Further, the connectivity graph that governs the sharing of information plays a role in the performance of algorithms in terms of time taken to obtain the solution, and quality of the solution with respect to the global solution. In this paper, we propose a distributed greedy algorithm inspired by market based concepts to optimize a cost function. This paper studies the effectiveness of the proposed distributed algorithm in obtaining global solutions and the phase transition phenomenon with regard to the connectivity metrics of the graph that underlies the network of information exchange. A case study involving resource allocation in wildland firefighting is provided to demonstrate our algorithm.
Skip Nav Destination
ASME 2009 Dynamic Systems and Control Conference
October 12–14, 2009
Hollywood, California, USA
Conference Sponsors:
- Dynamic Systems and Control Division
ISBN:
978-0-7918-4892-0
PROCEEDINGS PAPER
A Method for Distributed Optimization for Task Allocation Available to Purchase
Sheng Zhao,
Sheng Zhao
University of Cincinnati, Cincinnati, OH
Search for other works by this author on:
Baisravan HomChaudhuri,
Baisravan HomChaudhuri
University of Cincinnati, Cincinnati, OH
Search for other works by this author on:
Manish Kumar
Manish Kumar
University of Cincinnati, Cincinnati, OH
Search for other works by this author on:
Sheng Zhao
University of Cincinnati, Cincinnati, OH
Baisravan HomChaudhuri
University of Cincinnati, Cincinnati, OH
Manish Kumar
University of Cincinnati, Cincinnati, OH
Paper No:
DSCC2009-2694, pp. 105-110; 6 pages
Published Online:
September 16, 2010
Citation
Zhao, S, HomChaudhuri, B, & Kumar, M. "A Method for Distributed Optimization for Task Allocation." Proceedings of the ASME 2009 Dynamic Systems and Control Conference. ASME 2009 Dynamic Systems and Control Conference, Volume 1. Hollywood, California, USA. October 12–14, 2009. pp. 105-110. ASME. https://doi.org/10.1115/DSCC2009-2694
Download citation file:
12
Views
Related Proceedings Papers
Related Articles
Linking Optimal Design Decisions to the Theory of the Firm: The Case
of Resource Allocation
J. Mech. Des (May,2005)
Energy Management of Microgrid Considering Renewable Energy Sources and Electric Vehicles Using the Backtracking Search Optimization Algorithm
J. Energy Resour. Technol (May,2020)
Related Chapters
Virtualization of Data Centers and Optimization of Resource Allocation in It, by Extra Innovative Algorithms
International Conference on Mechanical and Electrical Technology, 3rd, (ICMET-China 2011), Volumes 1–3
Optimization Algorithms
Nonlinear Regression Modeling for Engineering Applications: Modeling, Model Validation, and Enabling Design of Experiments
Adaptive Index Bulk Deletion Based on Ant Colony
International Conference on Electronics, Information and Communication Engineering (EICE 2012)