Metaheuristic algorithm for solving biobjective possibility planning model of location-allocation in disaster relief logistics

16Citations
Citations of this article
53Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2014 Farnaz Barzinpour et al.

Cite

CITATION STYLE

APA

Barzinpour, F., Saffarian, M., Makoui, A., & Teimoury, E. (2014). Metaheuristic algorithm for solving biobjective possibility planning model of location-allocation in disaster relief logistics. Journal of Applied Mathematics, 2014. https://doi.org/10.1155/2014/239868

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free