Exact approximation algorithms of scheduling in evacuation and recovery service

Abstract

This study focuses on the evacuation and recovery problem (ERP), which is modeled by graphs. The model provides support for the design of exact and fast and practically convenient algorithms. The ERP is viewed as a constrained longest path problem in a graph whose objective is to maximize the total profit under resource and information constraints. This study develops an exact algorithm and a new fast epsilon-approximation algorithm (FPTAS), which are proved to be efficient with respect to the time complexity. Finally, some open questions are proposed for future research.