Disaster Response Project Scheduling Problem: A Resolution Method based on a Game-Theoretical Model
Abstract
We present a particular disaster response project scheduling problem (DRPSP) motivated by Fukushima's nuclear accident of Japan in 2011. We describe the problem as MPS; R, N vertical bar pr ec, d(n)vertical bar Sigma c(k)f(r(k)(S)) by using Hartmann and Briskorn scheme and formulate a mixed integer linear programming (MILP) model. Due to the NP-hardness of the problem, we propose a resolution method based on game theory. This method associates the DRPSP to a non-cooperative game model, such that game solution is a feasible solution of the problem. In order to explore the potential of the proposed model and the performance of the resolution method, computational experiments are carried out. The results of resolution method show on average, that the method finds a feasible solution with a difference of 15.44% with respect to optimal solution within one percent of the time required by the MILP over GAMS 22.7.2/CPLEX 11.0.
Más información
Título según WOS: | Disaster Response Project Scheduling Problem: A Resolution Method based on a Game-Theoretical Model |
Título según SCOPUS: | Disaster response project scheduling problem: A resolution method based on a game-theoretical model |
Título de la Revista: | INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS CONTROL |
Volumen: | 8 |
Número: | 2 |
Editorial: | CCC PUBL-AGORA UNIV |
Fecha de publicación: | 2013 |
Página de inicio: | 334 |
Página final: | 345 |
Idioma: | English |
Notas: | ISI, SCOPUS |