A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
Year of publication: |
2020
|
---|---|
Authors: | Waissi, Gary R. ; Kaushal, Pragya |
Published in: |
Opsearch : journal of the Operational Research Society of India. - New Delhi : Springer India, ISSN 0975-0320, ZDB-ID 2516085-0. - Vol. 57.2020, 1, p. 73-87
|
Subject: | Traveling salesman problem | TSP | TSP algorithm | TSP heuristic | Rundreiseproblem | Travelling salesman problem | Heuristik | Heuristics | Theorie | Theory | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm |
-
Self-organisation migration technique for enhancing the permutation coded genetic algorithm
Dinesh, Kamala Kannan, (2021)
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
Equivalent cyclic polygon of a Euclidean travelling salesman problem tour and modified formulation
Herraiz, A., (2022)
- More ...
-
Automation of strategy using IDEF0 – A proof of concept
Waissi, Gary R., (2015)
-
Automation of strategy using IDEF0 : a proof of concept
Waissi, Gary R., (2015)
- More ...