Heuristic Algorithm for Location-Allocation Problem Based on Random Analysis in Integrated Logistics Distribution
A reliable model for Location-Allocation (LA) is proposed based on 0-1 mixed integer programming model presented by Baumol-Wolfe. A heuristic algorithm (HA) based on wavelet analysis is used to solve LA problem, which incorporates different customers demands into a minimum wrap-net. It indicates that customers are allocated to one facility or one cluster if they satisfy that the distance is nearest to the facility. The model in the method involves the respective distance and demand of the different customers, which can solve real planar LA. A case study using computer simulation shows that the HA system achieves significant improvement compared to a recent LA solution. Lastly the reliable parameter is defined with stationary probabilities. And the practical prove is given by random analysis for regional distribution.
Location-Allocation (LA) wavelet analysis heuristic search minimum wrap-net method logistics systematic optimization random analysis
QIAN ZHANG LIRONG CUI
School of Economics and Finance, HuaQiao University, Quanzhou, FuJian, 362021, P.R. China School of Management & Economics, Beijing Institute of Technology,Beijing, 100081, P.R. China
国际会议
北京
英文
447-454
2011-06-20（万方平台首次上网日期，不代表论文的发表时间）