TSPLIB—A Traveling Salesman Problem Library

Gerhard Reinelt

doi:10.1287/ijoc.3.4.376

journal article Nov 01, 1991

TSPLIB—A Traveling Salesman Problem Library

INFORMS Journal on Computing Vol. 3 No. 4 pp. 376-384 · Institute for Operations Research and the Management Sciences (INFORMS)

View at Publisher Save 10.1287/ijoc.3.4.376

Abstract

This paper contains the description of a traveling salesman problem library (TSPLIB) which is meant to provide researchers with a broad set of test problems from various sources and with various properties. For every problem a short description is given along with known lower and upper bounds. Several references to computational tests on some of the problems are given. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.

Topics

No keywords indexed for this article. Browse by subject →

Cited By

1,958

Towards Generalizable Meta-Deep Reinforcement Learning Algorithm for Multiobjective Traveling Salesman Problems

Xiaoyu Fu, Shenshen Gu · 2026

IEEE Transactions on Artificial Int...

Dynamic Topology-Aware Linear Attention Network for Efficient Traveling Salesman Problem Optimization

Shilong Zhao, Qianqian Duan · 2026

Mathematics

Application of Hybrid Algorithm Based on Ant Colony Optimization and Sparrow Search in UAV Path Planning

Yangyang Tian, Jiaxiang Zhang · 2024

International Journal of Computatio...

Evolutionary Multimodal Multiobjective Optimization for Traveling Salesman Problems

Yiping Liu, Liting Xu · 2024

IEEE Transactions on Evolutionary C...

Optimization of UAV Flight Paths in Multi-UAV Networks for Efficient Data Collection

Mohamed Abid, Said El Kafhali · 2024

Arabian Journal for Science and Eng...

A multioperator genetic algorithm for the traveling salesman problem with job-times

Pablo Gutiérrez-Aguirre, Carlos Contreras-Bolton · 2024

Expert Systems with Applications

A comprehensive survey on the generalized traveling salesman problem

Petrică C. Pop, Ovidiu Cosma · 2024

European Journal of Operational Res...

An efficient hybrid genetic algorithm for the traveling salesman problem with release dates

Gabriel Soares, Teobaldo Bulhões · 2024

European Journal of Operational Res...

NeuroCrossover: An intelligent genetic locus selection scheme for genetic algorithm using reinforcement learning

Haoqiang Liu, Zefang Zong · 2023

Applied Soft Computing

Finding compact and well-separated clusters: Clustering using silhouette coefficients

Adil M. Bagirov, Ramiz M. Aliguliyev · 2023

Pattern Recognition

Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming

Roberto Montemanni, Mauro Dell’Amico · 2023

Algorithms

Fast-Converging Simulated Annealing for Ising Models Based on Integral Stochastic Computing

Naoya Onizawa, Kota Katsuki · 2023

IEEE Transactions on Neural Network...

Learning Improvement Heuristics for Solving Routing Problems

Yaoxin Wu, Wen Song · 2022

IEEE Transactions on Neural Network...

Solve routing problems with a residual edge-graph attention neural network

Kun Lei, Peng Guo · 2022

Neurocomputing

Optimization of Product Switching Processes in Assembly Lines

Arif Gürsoy · 2022

Arabian Journal for Science and Eng...

An adaptive large neighborhood search heuristic for the flying sidekick traveling salesman problem with multiple drops

Setyo Tri Windras Mara, Achmad Pratama Rifai · 2022

Expert Systems with Applications

Learning 2-Opt Heuristics for Routing Problems via Deep Reinforcement Learning

Paulo da Costa, Jason Rhuggenaath · 2021

SN Computer Science

Step-Wise Deep Learning Models for Solving Routing Problems

Liang Xin, Wen Song · 2021

IEEE Transactions on Industrial Inf...

Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems

Alice Paul, Daniel Freund · 2020

Mathematics of Operations Research

Optimization for drone and drone-truck combined operations: A review of the state of the art and future directions

Sung Hoon Chung, Bhawesh Sah · 2020

Computers & Operations Research

Metrics

1,958

Citations

0

References

Details

Published: Nov 01, 1991
Vol/Issue: 3(4)
Pages: 376-384

Authors

G

Gerhard Reinelt

Institut für Mathematik, Universität, Augsburg, Universitätsstrasse 8, D-8900 Federal Republic of Germany

Cite This Article

Gerhard Reinelt (1991). TSPLIB—A Traveling Salesman Problem Library. INFORMS Journal on Computing, 3(4), 376-384. https://doi.org/10.1287/ijoc.3.4.376

TSPLIB—A Traveling Salesman Problem Library

You May Also Like