Solving Traveling Salesman Problem with Time Windows Using Hybrid Pointer Networks with Time Features
This paper introduces a time efficient deep learning-based solution to the traveling salesman problem with time window (TSPTW). Our goal is to reduce the total tour length traveled by -*the agent without violating any time limitations. This will aid in decreasing the time required to supply any type...
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
MDPI AG
2021
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/aa734ea2fec849eaab75df411fadffd1 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Soyez le premier à ajouter un commentaire!