4.7 Article

Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach

期刊

COMPUTERS & INDUSTRIAL ENGINEERING
卷 43, 期 1-2, 页码 299-314

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0360-8352(02)00076-1

关键词

logistics; supply chain management; genetic algorithm; production/distribution system

向作者/读者索取更多资源

In recent years, many of the developments in logistics are connected to the need of information of efficient supply chain flow. An important issue in the logistics system is to find the network strategy that can give the least cost of the physical distribution flow. In this paper, we consider the logistic chain network problem formulated by 0-1 mixed integer linear programming model. The design tasks of this problem involve the choice of the facilities (plants and distribution centers) to be opened and the distribution network design to satisfy the demand with minimum cost. As the solution method, we propose the spanning tree-based genetic algorithm by using Prufer number representation. We design the feasibility criteria and develop the repairing procedure for the infeasible Prufer number, so that it can work for relatively large size problems. The efficacy and the efficiency of this method are demonstrated by comparing its numerical experiment results with those of traditional matrix-based genetic algorithm and professional software package LINDO. (C) 2002 Elsevier Science Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据