年次大会
Online ISSN : 2424-2667
ISSN-L : 2424-2667
セッションID: S1420105
会議情報
S1420105 動的計画法に基づく訪問点選択を用いたクラスタ巡回探索([S142]生産システムの新展開(応用・実践))
軽野 義行中尾 優汰
著者情報
会議録・要旨集 フリー

詳細
抄録
A cluster routing problem on graphs is considered in which the vertex set is partitioned into several clusters and each cluster must be served exactly once by a single server. The objective is to minimize the total cost, involving the traveling cost and service cost, of a service tour. The problem is one of variants known as the Generalized Traveling Salesperson Problem (GTSP) in the literature. For the NP-hard problem, a heuristic algorithm is designed which employs a genetic search based procedure to seek for a sequence of clusters, and a known dynamic programming based shortest path procedure to choose a vertex to be served in each cluster. A part of numerical results for test instances with forty vertices and ten clusters is reported.
著者関連情報
© 2014 一般社団法人 日本機械学会
前の記事 次の記事
feedback
Top