| Summary: | 碩士 === 國立中央大學 === 土木工程研究所 === 94 === Natural disasters and accidents without serious concern often lead to dread consequences. Whereas the scarceness of resources affects the rescue performances largely, appropriate rescue deployment will be a main task to the decision maker. However, the preferred objectives between managing staff and operational staff are often hierarchical and conflicting so that the problem is modeled as a binary integer mathematical bilevel programming problem (BLPP) in accordance with Stackelberg game. Managing staff, as upper level, pursues to rescue most suffered people by recovering affected area with breakage in 72 hours, and operational staff, as lower level, seeks for a way to deliver or pick up the most relief goods and medical supplies as quick as possible. In particular, emergency vehicles and rescue troops are not necessarily required to go back to the depot where they depart. Decision maker attempts to service all the requests in the disaster area by forming efficient routes, at least nominally, subject to vehicle capacity, performance, and soft time window constraints. To deal with the linear 0-1 integer bilevel model, a heuristic algorithm will be developed to solve the hierarchical relief logistics in blocked areas problem through an iteratively intermediate solution which is generated by fixing upper level binary variables in turn from inducible region and then to reach a feasible solution. Finally, the result is applied to provide analytical information to decision maker for decision-making.
|
|---|
