Solving VRP Problem in SCM System by Genetic Algorithm

カテゴリ: 部門大会

論文No: MC7-10

グループ名: 【C】平成14年電気学会電子・情報・システム部門大会講演論文集

発行日: 2002/09/02

タイトル(英語): Solving VRP Problem in SCM System by Genetic Algorithm

著者名: アドミ シャリフ(Ashikaga Institute of Technology),Mitsuo Gen(Ashikaga Institute of Technology),Masato Sasaki(Ashikaga Institute of Technology)

著者名(英語): Admi Syarif(Ashikaga Institute of Technology),Mitsuo Gen(Ashikaga Institute of Technology),Masato Sasaki(Ashikaga Institute of Technology)

キーワード: SCM|Vehicle Routing Problem|Genetic Algorithm

要約(日本語): Recently, research on supply chain management (SCM) system has been receiving a great attention and interest of the researchers because of its great use in public distribution or logistics system. In most case, they consider an overall production strategy, inventory strategy and flow of products through some facilities in order to minimize cost and/or maximize profit.

In this paper, we concern a SCM system to solve a transportation problem and vehicle routing problem (VRP). Particularly, we consider a SCM problem that includes an extended multiple depot vehicle routing problem with time window (VRP-TW) to satisfy the customer demand in such a way that:

(1) each customer is serviced by the DC which is in the same area.

(2) each route starts and ends at the same opened depot,

(3) each customer is visited exactly once by a vehicle,

(4) the vehicle capacity of each route is equal,

(5) total customer demand for each route does not exceed the vehicle capacity,

(6) each customer is associated with a time window period for its service time.

This problem is one of NP-hard problems due to an NP-hard of VRP-TW. To solve the problem, we develop a genetic algorithm approach the problem.

PDFファイルサイズ: 4,342 Kバイト