A hybrid algorithm Tabu Search – GRASP for wounded evacuation in disaster response

Abstract

Natural and triggered-disasters, have devastating and profound negative effects on human lives that require a speedy declaration of an emergency in order to minimize their severe consequences. Hence, a prompt disaster response, in addition to effective measures such as informed decision making, organized evacuation plan, right hospital selection, proper rescue vehicles, efficient resources assignment and timely vehicle scheduling are critical actions needed to organize successful secured operations that could, if well prepared, save many injured bodies and lessen the human distress. To reach this ultimate goal, a complicated procedure should be in place and any failure can potentially increase the number of causalities, thus a complete alertness and full caution should be exercised. In this paper, we treat the Integrated Problem of Ambulance Scheduling and Resource Assignment (IPASRA) in the case of a sudden disaster. The main resources to be assigned are the ambulances and the hospitals. While, the hospitals serving capacities might be considered or not according to the extent of disaster and particularly to the wounded bodies’ total number. We formulate the (IPASRA) as a linear model, furthermore a novel hybrid algorithm based on Tabu Search (TS) and Greedy Randomized Adaptive Search Procedure (GRASP) is offered to tackle this complex problem. Simulation tests are also presented to prove the efficiency of our modelling and resolution approaches.

Designing a new medicine supply chain network considering production technology policy using two novel heuristic algorithms

“…It has been proven that MSCN models are NP-hard [7,12,[15][16][17]27,36,37,46]. Hence, the literature review has seen several meta-heuristic algorithms that were suggested to solve these NP-hard problems [16,17].…”

Assignment model with multi-objective linear programming for allocating choice ranking using recurrent neural network

“…The linear assignment model is a binary programming model and is used widely in solving assignment problems. Generally, assignment problem is a certain kind of transportation problem and it was formulated as a binary integer linear programming; see [18]. The main application of the standard assignment problem is solving the problem of assigning 𝑛 jobs to 𝑛 peoples in an optimum manner so that the minimum cost or maximum profit is obtained.…”