Skip to content
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Publication Details
AFRICAN RESEARCH NEXUS
SHINING A SPOTLIGHT ON AFRICAN RESEARCH
computer science
An exact solution approach for multi-objective location-transportation problem for disaster response
Computers and Operations Research, Volume 41, No. 1, Year 2014
Notification
URL copied to clipboard!
Description
This paper considers a three-objective location-transportation problem for disaster response. The location problem aims at determining the number, the position and the mission of required humanitarian aid distribution centers (HADC) within the disaster region. The transportation problem deals with the distribution of aid from HADCs to demand points. Three conflicting objectives are considered. The first objective minimizes the total transportation duration of needed products from the distribution centers to the demand points. The second objective minimizes the number of agents (first-aiders) needed to open and operate the selected distribution centers. The third objective minimizes the non-covered demand for all demand points within the affected area. We propose an epsilon-constraint method for this problem and prove that it generates the exact Pareto front. The proposed algorithm can be applied to any three-objective optimization problem provided that the problem involves at least two integer and conflicting objectives. The results obtained in our experimental study show that the computing time required by the proposed method may be large for some instances. A heuristic version of our algorithm yielded, however, good approximation of the Pareto front in relatively short computing times. © 2013 Elsevier Ltd.
Authors & Co-Authors
Abounacer, Rachida
Canada, Montreal
Centre Interuniversitaire de Recherche Sur Les Réseaux D‘entreprise, la Logistique et le Transport
Morocco, Agadir
Université Ibn Zohr
Rekik, Monia
Canada, Montreal
Centre Interuniversitaire de Recherche Sur Les Réseaux D‘entreprise, la Logistique et le Transport
Canada, Quebec
Université Laval
Renaud, Jacques
Canada, Montreal
Centre Interuniversitaire de Recherche Sur Les Réseaux D‘entreprise, la Logistique et le Transport
Canada, Quebec
Université Laval
Statistics
Citations: 215
Authors: 3
Affiliations: 3
Identifiers
Doi:
10.1016/j.cor.2013.08.001
ISSN:
03050548