Deep Reinforcement Learning Algorithm Based on Graph Weight Multi-Pointer Network for Solving Multiobjective Traveling Salesman Problem

Deep Reinforcement Learning Algorithm Based on Graph Weight Multi-Pointer Network for Solving Multiobjective Traveling Salesman Problem

The multiobjective traveling salesman problem (MOTSP) is a class of classical multiobjective combinatorial optimization problems (MOCOPs), attracting significant interest across various disciplines. Due to the NP-Hard nature, traditional algorithms struggle to find feasible solutions in a short peri...

Full description

Saved in:
Bibliographic Details
Main Authors: Xiaoyu Fu, Shenshen Gu
Format: Article
Language:English
Published: IEEE 2024-01-01
Series:IEEE Access
Subjects:
Combinatorial optimization problem
multiobjective traveling salesman problem
deep reinforcement learning
graph neural network
pointer network
Online Access:https://ieeexplore.ieee.org/document/10766498/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://ieeexplore.ieee.org/document/10766498/

Similar Items