A reinforced hybrid genetic algorithm for the traveling salesman problem
Year of publication: |
2023
|
---|---|
Authors: | Zheng, Jiongzhi ; Zhong, Jialun ; Chen, Menglei ; He, Kun |
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. 157.2023, p. 1-15
|
Subject: | Combinatorial optimization | Traveling salesman problem | Hybrid genetic algorithm | Local search | Reinforecement learning | Evolutionärer Algorithmus | Evolutionary algorithm | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming |
-
Self-organisation migration technique for enhancing the permutation coded genetic algorithm
Dinesh, Kamala Kannan, (2021)
-
Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Umetani, Shunji, (2018)
-
The bi-objective traveling purchaser problem with deliveries
Palomo-Martínez, Pamela J., (2019)
- More ...
-
Efficient Approaches for the Single Cylindrical Packing Problem with Cylindrical Items
Moqa, Rashad, (2023)
-
An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem
Zheng, Jiongzhi, (2022)
-
PARAMETRIC EMPIRICAL BAYES CONFIDENCE INTERVALS BASED ON JAMES-STEIN ESTIMATOR
He, Kun, (1992)
- More ...