A Steiner Zone variable neighborhood search heuristic for the Close-Enough Traveling Salesman Problem
Year of publication: |
January 2019
|
---|---|
Authors: | Wang, Xingyin ; Golden, Bruce ; Wasil, Edward A. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 101.2019, p. 200-219
|
Subject: | Traveling salesman | Steiner zone | Variable neighborhood search | Heuristic | Heuristik | Heuristics | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Scheduling-Verfahren | Scheduling problem |
-
A dual local search framework for combinatorial optimization problems with TSP application
Ouenniche, Jamal, (2017)
-
Scheduled penalty variable neighborhood search
Thomas, Barrett W., (2014)
-
The bi-objective traveling purchaser problem with deliveries
Palomo-Martínez, Pamela J., (2019)
- More ...
-
The min-max multi-depot vehicle routing problem : heuristics and computational results
Wang, Xingyin, (2015)
-
A novel approach to solve the split delivery vehicle routing problem
Chen, Ping, (2017)
-
The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
Wang, Xingyin, (2016)
- More ...