An integrated integer programming model with a simulated annealing heuristic for the carrier vehicle traveling salesman problem

Maharani Rizki Larasati, I. Lin Wang

研究成果: Conference article同行評審

4 引文 斯高帕斯(Scopus)

摘要

We investigate a carrier vehicle traveling salesman problem (CVTSP) to visit n-targets in Euclidean space. Each target is visited by a smaller vehicle (e.g., UAV) consecutively, launched from and landed to a carrier. The smaller vehicle and the carrier must synchronize during both launching and landing. We present a mixed-integer second-order cone programming model with TSP-like constraints to determine the best target visiting sequence and the associated launch and land coordinates. A simulated annealing algorithm is implemented to shorten the computational time. The computational experiments indicate the simulated annealing algorithm calculates good CVTSP solutions within a reasonable amount of time.

原文English
頁(從 - 到)301-308
頁數8
期刊Procedia Computer Science
197
DOIs
出版狀態Published - 2021
事件6th Information Systems International Conference, ISICO 2021 - Virtual, Online, Italy
持續時間: 2021 8月 72021 8月 8

All Science Journal Classification (ASJC) codes

  • 一般電腦科學

指紋

深入研究「An integrated integer programming model with a simulated annealing heuristic for the carrier vehicle traveling salesman problem」主題。共同形成了獨特的指紋。

引用此