摘要
给出了关于配送中心选址的0-1混合整数线性规划模型,该模型要求在一些已知的备选点中选出一定数目的地点,作为配送中心;并求出配送网络中的物流量,使配送网络总费用最小.由于这类模型属于NP难问题,为更好的求解此类问题,提出了定量化的模拟退火遗传算法与定性化的综合评价法相结合来确定配送中心地址的方法.
A linear programming model of 0 - 1 mixed integer type for the location of three - stage logistics chain network is given out, which requires the choice of a certain number of distribution centers out of optional distribution facilities, and the decision of the product flow in the logistics chain network to meet the demand with minimum cost. For the convenience of solving this kind of NP- hard problem, a comprehensive evaluation method is proposed for the choice of the distribution centers, in which the genetic algorithm combining mechanism of simulated annealing and the qualitative general evaluation solution are both used.
出处
《哈尔滨商业大学学报（自然科学版）》
CAS
2006年第1期58-61,65,共5页
Journal of Harbin University of Commerce：Natural Sciences Edition
基金
黑龙江省科技攻关项目(GB05D202-3)
黑龙江大学2005青年基金资助
关键词
物流配送中心
选址模型
遗传算法
模拟退火算法
层次分析法
logistics distribution centers
location model
genetic algorithm
simulated annealing algorithm
analytic hierarchy process
