Abstract
This paper presents two greedy scheduling algorithms for recovery of the damaged lifeline network. Unlike genetic algorithm or simulated annealing, the proposed algorithms do not involve random processes. One of the algorithms is for assigning multiple heterogeneous engineers and preparing schedules for repairing independent damaged components, while the other is for finding repair schedule for a single engineer considering network constraint. Both the algorithms use rate of benefit gain as an index in deciding which component should be repaired next, and by whom. The target use of these algorithms is to serve as an initial solution for a multi-agent system which includes fine grain details. With numerical experiments, it is demonstrated that the proposed algorithms can find near-optimal repair schedules and solve problems involving large number of variables.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
