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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/jam/BarzinpourSMT14, #quickstatements; #temporary_batch_1731508824982
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2014/239868 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036537192 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59050426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambulance location and relocation models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage stochastic programming framework for transportation planning in disaster response / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic model applied to emergency service vehicle location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-objective robust stochastic programming model for disaster relief logistics under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact solution approach for multi-objective location-transportation problem for disaster response / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy programming and linear programming with several objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge-driven computing. Knowledge engineering and intelligent computations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling job shop problems with sequence-dependent setup times / rank
 
Normal rank
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