日本フィジカルAI新聞

世界のフィジカルAIを、日本語で。

経路計画arXiv:2303.05333

優先順序制約付き巡回セールスマン問題に対する凸包最小挿入ヒューリスティック

A Convex Hull Cheapest Insertion Heuristic for Precedence Constrained Traveling Salesperson Problems or Sequential Ordering Problems

シェア:XThreadsFacebookLINEはてブBluesky

配送前に集荷が必要な問題に対し、凸包最小挿入法を優先順序制約に適応させ、最近傍法より優れることを示した。

著者: Mithun Goutham, Stephanie Stockar

分類: cs.RO, cs.SY, eess.SY, math.OC

原文アブストラクト

The convex hull cheapest insertion heuristic is a well-known method that efficiently generates good solutions to the Traveling Salesperson Problem. However, this heuristic has not been adapted to account for precedence constraints that restrict the order in which locations can be visited. Such constraints result in the precedence constrained traveling salesperson problem or the sequential ordering problem, which are commonly encountered in applications where items have to be picked up before they are delivered. In this paper, we present an adapted version of this heuristic that accounts for precedence constraints in the problem definition. This algorithm is compared with the widely used Nearest Neighbor heuristic on the TSPLIB benchmark data with added precedence constraints. It is seen that the proposed algorithm is particularly well suited to cases where delivery nodes are centrally positioned, with pickup nodes located in the periphery, outperforming the Nearest Neighbor algorithm in 97\% of the examined instances.

関連論文

  1. 1Boston Dynamics、車輪付きAtlasの研究試作機を紹介研究・技術
  2. 2GXOとApptronik、Apolloの物流現場試験を拡大 最大1,000台の展開を構想量産・展開
  3. 3newmoとKDDIが資本業務提携 2028年に堺市で自動運転タクシー商用化目指す提携・買収
  4. 4NVIDIA、CoRLでGR00T 2とIsaac Lab 3.0を発表新製品・発表
  5. 5UC BerkeleyとNVIDIAの研究者、AIエージェントでロボット制御コードを仮想環境で改善研究・技術

PR・アフィリエイト広告

OZ GAMING(GPU搭載BTOゲーミングPC)

OZ GAMING(GPU搭載BTOゲーミングPC)の公式広告バナーOZ GAMINGで完成品PCを見る ↗
PR本紙発行元 EmplifAI