Metaheuristic algorithm for solving biobjective possibility planning model of location-allocation in disaster relief logistics (Q2336252): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/jam/BarzinpourSMT14, #quickstatements; #temporary_batch_1731508824982
 
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jam/BarzinpourSMT14 / rank
 
Normal rank

Latest revision as of 16:08, 13 November 2024

scientific article
Language Label Description Also known as
English
Metaheuristic algorithm for solving biobjective possibility planning model of location-allocation in disaster relief logistics
scientific article

    Statements

    Metaheuristic algorithm for solving biobjective possibility planning model of location-allocation in disaster relief logistics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 November 2019
    0 references
    Summary: Thousands of victims and millions of affected people are hurt by natural disasters every year. Therefore, it is essential to prepare proper response programs that consider early activities of disaster management. In this paper, a multiobjective model for distribution centers which are located and allocated periodically to the damaged areas in order to distribute relief commodities is offered. The main objectives of this model are minimizing the total costs and maximizing the least rate of the satisfaction in the sense of being fair while distributing the items. The model simultaneously determines the location of relief distribution centers and the allocation of affected areas to relief distribution centers. Furthermore, an efficient solution approach based on genetic algorithm has been developed in order to solve the proposed mathematical model. The results of genetic algorithm are compared with the results provided by simulated annealing algorithm and LINGO software. The computational results show that the proposed genetic algorithm provides relatively good solutions in a reasonable time.
    0 references

    Identifiers