Heuristic Algorithm for Location-Allocation Problem Based on Wavelet 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.