东北大学学报(自然科学版) ›› 2004, Vol. 25 ›› Issue (7): 637-640.DOI: -

• 论著 • 上一篇    下一篇

集成化物流中的定位配给问题的启发式算法

张潜;高立群;胡祥培   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;大连理工大学系统工程研究所 辽宁沈阳 110004
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2004-07-15 发布日期:2013-06-24
  • 通讯作者: Zhang, Q.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(70171040);;辽宁省教育厅科研基金资助项目(2024101179)·

Heuristic algorithm for location-allocation problem in integrated distribution

Zhang, Qian (1); Gao, Li-Qun (1); Hu, Xiang-Pei (2)   

  1. (1) Sch. of Info. Sci. and Eng., Northeastern Univ., Shenyang 110004, China; (2) Inst. of Syst. Eng., Dalian Univ. of Technol., Dalian 116023, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2004-07-15 Published:2013-06-24
  • Contact: Zhang, Q.
  • About author:-
  • Supported by:
    -

摘要: 以Baumol Wolfe提出的传统的0 1混合整数规划模型为基础,建立一类更接近物流配送实际的定位 配给模型·在已确定每个配送中心的服务范围内,根据客户群的总需求量接近或等于单车容量的整数倍为原则,提出将不同客户需求量引入最小包络法进行混合法选址的启发式算法·最小包络法即以一个配送中心为基点,分别与其他配送中心用直线连接,作这些直线的垂直平分线,以每个配送中心的内点的垂直平分线的最小包络,作为此配送中心的服务范围·该方法既考虑到不同客户之间的相对距离,又考虑到不同客户需求量,此模型有助于解决实际的定位 配给问题·计算机仿真实例证明了此方法的有效性·

关键词: 定位配给问题(LA), 运输路线安排问题(VRP), 启发式算法, 最小包络法, 定位运输路线安排问题(LRP)

Abstract: A model of location allocation was set up to approach further to the actuality of goods/service distribution, based on the conventional 0-1 mixed programming model by Baumol-Wolfe. A heuristic algorithm was proposed to combine different customers' demands into a minimum wrap-net for the location of distribution centers in accordance to the assumption that in every defined service area of a distribution center the aggregate demand of a group of customers is equal or near to the integral multiple of unit vehicle capacity. The minimum wrap is formed by taking a distribution center as a basis point and connected to other centers with straight lines as distances. Making bisectors vertical to these lines and forming a minimum wrap are envoloped, in which all the tangent points of the circles taking relevant half of such distances as radii, so that a shortest distance is available to a defined group of customers to go to a nearest center as they are within its service area. The algorithm has the advantage of taking account of not only the different distances among customers but also their different distance demands. The model will benefit the solution to actual location-allocation problem. The computer simulation proves the validity of this method.

中图分类号: