Case Study on Optimal Routing in Logistics Network by Priority-based Genetic Algorithm

DOI Web Site Web Site 被引用文献2件 参考文献25件
  • Wang Xiaoguang
    Waseda University, Graduate School of Information, Production and Systems
  • Lin Lin
    Waseda University, Graduate School of Information, Production and Systems
  • Gen Mitsuo
    Waseda University, Graduate School of Information, Production and Systems
  • Shiota Mitsushige
    Nippon Steel Transportation Co., Ltd.

この論文をさがす

抄録

Recently, research on logistics caught more and more attention. One of the important issues on logistics system is to find optimal delivery routes with the least cost for products delivery. Numerous models have been developed for that reason. However, due to the diversity and complexity of practical problem, the existing models are usually not very satisfying to find the solution efficiently and convinently.<br>In this paper, we treat a real-world logistics case with a company named ABC Co. ltd., in Kitakyusyu Japan. Firstly, based on the natures of this conveyance routing problem, as an extension of transportation problem (TP) and fixed charge transportation problem (fcTP) we formulate the problem as a minimum cost flow (MCF) model. Due to the complexity of fcTP, we proposed a priority-based genetic algorithm (pGA) approach to find the most acceptable solution to this problem. In this pGA approach, a two-stage path decoding method is adopted to develop delivery paths from a chromosome. We also apply the pGA approach to this problem, and compare our results with the current logistics network situation, and calculate the improvement of logistics cost to help the management to make decisions. Finally, in order to check the effectiveness of the proposed method, the results acquired are compared with those come from the two methods/ software, such as LINDO and CPLEX.

収録刊行物

被引用文献 (2)*注記

もっと見る

参考文献 (25)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ