loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Authors: Francesco Carrabs ; Raffaele Cerulli ; Ciriaco D’Ambrosio and Gabriele Murano

Affiliation: Department of Mathematics, University of Salerno, Giovanni Paolo II, 132, 84084, Fisciano(SA), Italy

Keyword(s): Close-Enough, Multiple Traveling Salesman Problem, Neighborhoods, Drones.

Abstract: This paper addresses the Multiple Close-Enough Traveling Salesman Problem, a variant of the Close-Enough Traveling Salesman Problem, where multiple vehicles are used to visit a given number of points. A vehicle visits a point if it passes through the neighborhood set of that point. The goal of the problem is to minimize the longest of the defined routes. We face the problem by using a discretization schema that reduces it to the Multiple Generalized Traveling Salesman Problem for which we propose a Mixed Integer Linear Programming formulation. The use of discretization schema introduces a discretization error that makes the optimal solution value of our model an upper bound of the optimal solution value of the Multiple Close-Enough Traveling Salesman Problem. Moreover, we apply a graph reduction algorithm to remove arcs and nodes without changing the optimal solution of the problem. We provide proof of the correctness of this algorithm, and we show that it significantly reduces the s ize of the instances tested. We verified the performance of our model on the benchmark instances of Close-Enough Traveling Salesman Problem. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.137.183.125

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Carrabs, F., Cerulli, R., D’Ambrosio, C. and Murano, G. (2025). Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem. In Proceedings of the 14th International Conference on Operations Research and Enterprise Systems - ICORES; ISBN 978-989-758-732-0; ISSN 2184-4372, SciTePress, pages 186-195. DOI: 10.5220/0013377900003893

@conference{icores25,
author={Francesco Carrabs and Raffaele Cerulli and Ciriaco D’Ambrosio and Gabriele Murano},
title={Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem},
booktitle={Proceedings of the 14th International Conference on Operations Research and Enterprise Systems - ICORES},
year={2025},
pages={186-195},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0013377900003893},
isbn={978-989-758-732-0},
issn={2184-4372},
}

TY - CONF

JO - Proceedings of the 14th International Conference on Operations Research and Enterprise Systems - ICORES
TI - Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem
SN - 978-989-758-732-0
IS - 2184-4372
AU - Carrabs, F.
AU - Cerulli, R.
AU - D’Ambrosio, C.
AU - Murano, G.
PY - 2025
SP - 186
EP - 195
DO - 10.5220/0013377900003893
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic