By Topic

A Quick and Efficient Algorithm to the Emergency Supplies Distribution Centers Location Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shengli Pan ; Inf. Manage. & E-Bus. Dept., Xi'an Jiaotong Univ., Xi'an, China ; Jun Tian ; Yingluo Wang

Being high restricted by the conditions of roads, places and facilities under emergency situations, the location problems of emergency supplies distribution centers are suitable to adopt scattered optimization location modeling. The paper firstly set up the objective function of the location problem of emergency supplies distribution centers based P-centre model. And for meeting the needs of quickly get the solutions under the emergency requirements, the paper proposed an optimizing location algorithm according to the principles of 0-1 programming and dynamic programming, which could simply the solving process and to get the solutions of the best number of distribution centers and the optimal supplies distributing schemes at the same time. The efficiency of the algorithm is then estimated, and it is proved to have the functions of effectively cutting down the complexity of the calculations and improving the speeds in solving this kind of problems. Finally, a calculating case is demonstrated and the practicability of the algorithm is validated.

Published in:

Intelligent Systems (GCIS), 2012 Third Global Congress on

Date of Conference:

6-8 Nov. 2012