Solving Traveling Salesman Problem with Time Windows Using Hybrid Pointer Networks with Time Features

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Majed G. Alharbi, Ahmed Stohy, Mohammed Elhenawy, Mahmoud Masoud, Hamiden Abd El-Wahed Khalifa
Format: article
Language:EN
Published: MDPI AG 2021
Subjects:
traveling salesman problem with time window
deep neural network
reinforcement learning
Environmental effects of industries and plants
TD194-195
Renewable energy sources
TJ807-830
Environmental sciences
GE1-350
Online Access:https://doaj.org/article/aa734ea2fec849eaab75df411fadffd1
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://doaj.org/article/aa734ea2fec849eaab75df411fadffd1

Similar Items