摘要
站在生产厂商的角度,以市场份额最大化为切入点,研究了在零售引力法则的基础上带预算费用限制的竞争型分销终端网点选址问题并建立了模型。讨论说明了该问题是NP-hard问题,并运用Max-Min蚂蚁算法来解决该问题。
The paper studies the competitive distribution terminals location with budget expense limitation based on retail gravitation rules and sets up a model, considers that the problem is NP-hard problem and uses Max-Min ant algorithm to solve the problem.
出处
《物流技术》
2008年第2期45-46,84,共3页
Logistics Technology
关键词
选址
竞争市场
预算费用
零售引力法则
蚂蚁算法
location
competitive market
budget expense
retail gravitation rules
ant algorithm