回転を考慮したMin-Max型運搬経路問題の近似最適解法(新任教員の研究紹介)

スポンサーリンク

概要

• 論文の詳細を見る

• The vehicle routing problem is one of the basic problems in physical distribution systems, and this problem has wide applications such as the delivery of commodities to retail stores and so on. Therefore, numerous studies on this problem have been submitted. In most of these studies, it is implicitly supposed that each vehicle must travel just one route in a working day. However, actually, one vehicle often travels two or more routes in one day. Moreover, in most of the previous studies, the objective is to minimize the total distance traveled by vehicles. However, it is often important to minimize the maximum operating time of any vehicle. We propose a near-optimal solution for the min-max vehicle routing problem with multiple use of vehicles on the basis of Lagrangian heuristics.

• 東海大学の論文

著者

• 小村 和彦

  東海大学情報理工学部経営システム工学科

関連論文

• 回転を考慮したMin-Max型運搬経路問題の近似最適解法(新任教員の研究紹介)

スポンサーリンク