配送网络流问题探讨

重庆交通大学学报（自然科学版） ›› 2007, Vol. 26 ›› Issue (增刊1): 151-153.

配送网络流问题探讨

雷挺

重庆交通大学理学院，重庆 400074

收稿日期:2006-04-14 修回日期:2006-05-12 出版日期:2007-07-15 发布日期:2015-05-18
作者简介:雷挺(1978—)，男，重庆长寿人，硕士，研究方向：组合优化.E-mail:leit0514@yaboo.com.cn

Discussion on Physical Distribution Network Flow Problem

LEI Ting

School of Science，Chongqing Jiaotong University，Chongqing 400074，China

Received:2006-04-14 Revised:2006-05-12 Online:2007-07-15 Published:2015-05-18

摘要/Abstract

摘要： 考虑物流配送中的网络流问题，即由某些供应点向各个需求点通过某种运输工具(货车、轮船等)供应货物的问题，目的是尽可能的降低配送成本．通过一个混和整数规划模型来描述该问题，利用网络单纯形法、拉格朗日松弛算法以及试探法为主要研究方法，有效地得到该问题～个近似程度较高的可行解．

关键词: 混和整数规划, 拉格朗日松弛, 网络单纯形法, 试探法

Abstract: The physical distribution network flow problem which is about transferring cargos from supplying points to deman ding points by some carrier like truck or ship etc is proposed．The goal is to decrease the distribution cost．A mixed integer programming model was used to describe the problefn．Taking network simplex method ，Lagrangian relaxation and heuristic methods as the main research method s，a approximate solution was got．

Key words: mixed integer programming, Lagrangian relaxation, network simplex method , heuristic

中图分类号:

雷挺. 配送网络流问题探讨[J]. 重庆交通大学学报（自然科学版）, 2007, 26(增刊1): 151-153.

LEI Ting. Discussion on Physical Distribution Network Flow Problem[J]. Journal of Chongqing Jiaotong University(Natural Science), 2007, 26(增刊1): 151-153.