BOOK-CHAPTER

Improved discrete queuing search algorithm for traveling salesman problem

Gülmez, Burak

Year: 2023 Zenodo (CERN European Organization for Nuclear Research)   Publisher: European Organization for Nuclear Research

Abstract

Improved discrete queuing search algorithm for traveling salesman problem

Keywords:
Travelling salesman problem Bottleneck traveling salesman problem 2-opt Queueing theory Traveling purchaser problem Christofides algorithm Search algorithm

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.69
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Scheduling and Timetabling Solutions
Social Sciences →  Decision Sciences →  Management Science and Operations Research
Scheduling and Optimization Algorithms
Physical Sciences →  Engineering →  Industrial and Manufacturing Engineering
Advanced Manufacturing and Logistics Optimization
Physical Sciences →  Engineering →  Industrial and Manufacturing Engineering

Related Documents

BOOK-CHAPTER

Improved discrete queuing search algorithm for traveling salesman problem

Gülmez, Burak

Zenodo (CERN European Organization for Nuclear Research) Year: 2023
JOURNAL ARTICLE

Discrete sparrow search algorithm for symmetric traveling salesman problem

Zhen ZhangYang Han

Journal:   Applied Soft Computing Year: 2022 Vol: 118 Pages: 108469-108469
BOOK-CHAPTER

An Improved Discrete Firefly Algorithm Used for Traveling Salesman Problem

Jie LiuLin TengShoulin Yin

Lecture notes in computer science Year: 2017 Pages: 593-600
JOURNAL ARTICLE

Combining 3‐Opt and Improved Discrete Cuckoo Search Algorithm for the Traveling Salesman Problem

Ahmet SarucanM. F. Berkaya

Journal:   Discrete Dynamics in Nature and Society Year: 2024 Vol: 2024 (1)
JOURNAL ARTICLE

An Improved Discrete Firefly Algorithm for the Traveling Salesman Problem

Lingyun ZhouLixin DingXiaoli QiangYihan Luo

Journal:   Journal of Computational and Theoretical Nanoscience Year: 2015 Vol: 12 (7)Pages: 1184-1189
© 2026 ScienceGate Book Chapters — All rights reserved.