paper-with-me

Papers

A Lightweight CNN-Transformer Model for Learning Traveling Salesman Problems

2023-05-03 · Minseop Jung, Jaeseung Lee, Jibum Kim

Several studies have attempted to solve traveling salesman problems (TSPs) using various deep learning techniques. Among them, Transformer-based models show state-of-the-art performance even for large-scale Traveling Salesman Problems (TSPs). However, they are based on fully-connected attention models and suffer from large computational complexity and GPU memory usage. Our work is the first CNN-Transformer model based on a CNN embedding layer and partial self-attention for TSP. Our CNN-Transformer model is able to better learn spatial features from input data using a CNN embedding layer compared with the standard Transformer-based models. It also removes considerable redundancy in fully-connected attention models using the proposed partial self-attention. Experimental results show that the proposed CNN embedding layer and partial self-attention are very effective in improving performance and computational complexity. The proposed model exhibits the best performance in real-world datasets and outperforms other existing state-of-the-art (SOTA) Transformer-based models in various aspects. Our code is publicly available at https://github.com/cm8908/CNN_Transformer3.

📄 PDF Abstract BibTeX arXiv:2305.01883

Code (1)

cm8908/cnn_transformer3 공식 구현 pytorch

Tasks

GPU

Methods 이 논문이 사용한 방법론

Multi-Head Attention 설명 없음
Attention 설명 없음
Adam 설명 없음
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…
Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…

Similar Papers 제목 키워드 기반

Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster

2014-01-24 · Harun Rasit Er, Nadia Erdogan

Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial optimization. Given the list of cities and distances between them, the problem is to find the shortest tour possible which visi…

Combinatorial OptimizationTraveling Salesman Problem

Enhanced Self-Organizing Map Solution for the Traveling Salesman Problem

2021-12-03 · Joao P. A. Dantas, Andre N. Costa, Marcos R. O. A. Maximo, Takashi Yoneyama

Using an enhanced Self-Organizing Map method, we provided suboptimal solutions to the Traveling Salesman Problem. Besides, we employed hyperparameter tuning to identify the most critical features in the algorithm. All im…

Traveling Salesman Problem

The Transformer Network for the Traveling Salesman Problem

2021-03-04 · Xavier Bresson, Thomas Laurent

The Traveling Salesman Problem (TSP) is the most popular and most studied combinatorial problem, starting with von Neumann in 1951. It has driven the discovery of several optimization techniques such as cutting planes, b…

Traveling Salesman Problem

Efficient Bit Labeling in Factorization Machines with Annealing for Traveling Salesman Problem

2024-07-02 · Shota Koshikawa, Aruto Hosaka, Tsuyoshi Yoshida

To efficiently find an optimum parameter combination in a large-scale problem, it is a key to convert the parameters into available variables in actual machines. Specifically, quadratic unconstrained binary optimization …

Traveling Salesman Problem

Solving Dynamic Traveling Salesman Problems With Deep Reinforcement Learning

2023-04-01 · journal 2023 4 · Zizhen Zhang, Hong Liu, Mengchu Zhou, Jiahai Wang

A traveling salesman problem (TSP) is a well-known NP-complete problem. Traditional TSP presumes that the locations of customers and the traveling time among customers are fixed and constant. In real-life cases, however,…

Deep Reinforcement Learningreinforcement-learningReinforcement LearningTraveling Salesman Problem