An adaptive heuristic approach to compute upper and lower bounds for the close-enough traveling salesman problem
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Bruce Golden
| Year of publication: |
2020
|
|---|---|
| Authors: | Carrabs, Francesco ; Cerrone, Carmine ; Cerulli, Raffaele ; Golden, Bruce |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 32.2020, 4, p. 1030-1048
|
| Subject: | close-enough | traveling salesman problem | neighborhoods | carousel greedy | drones | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2020.0962 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012390181