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

Maharani Rizki Larasati, I. Lin Wang

Research output: Contribution to journalConference articlepeer-review

7 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)301-308
Number of pages8
JournalProcedia Computer Science
Volume197
DOIs
Publication statusPublished - 2021
Event6th Information Systems International Conference, ISICO 2021 - Virtual, Online, Italy
Duration: 2021 Aug 72021 Aug 8

All Science Journal Classification (ASJC) codes

  • General Computer Science

Fingerprint

Dive into the research topics of 'An integrated integer programming model with a simulated annealing heuristic for the carrier vehicle traveling salesman problem'. Together they form a unique fingerprint.

Cite this