Uslu, Mustafa Orçun

Profile Picture
Profile URL
https://gcris.yasar.edu.tr/handle/123456789/13091
Name Variants
Job Title
Araş.Gör.
Email Address
Main Affiliation
01.01.12.03. Yönetim Bilişim Sistemleri Bölümü
Status
Former Staff
Website
ORCID ID
0000-0001-7140-6989
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

1

Articles

0

Views / Downloads

0/0

Supervised MSc Theses

1

Supervised PhD Theses

0

WoS Citation Count

0

Scopus Citation Count

0

Patents

0

Projects

0

WoS Citations per Publication

0.00

Scopus Citations per Publication

0.00

Open Access Source

0

Supervised Theses

1

Journals data is not available

Scopus Quartile Distribution

Quartile distribution chart data is not available

Competency Cloud

GCRIS Competency Cloud

Filters

20241
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Master Thesis
    Solution of Traveling Salesman Problem on Traffic Congestion with Ant Colony Optimization and Beam Ant Colony Optimization Algorithms
    (2024) Uslu, Mustafa Orçun; Erdoğdu, Kazım
    The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem that has various implications in a variety of industries. Even the purest formulation of TSP has applications from logistics routes to microchip manufacturing. Also, it can be used on DNA sequencing with slight modification as a sub-problem. In this thesis, two versions of TSP were studied, a classical TSP and the TSP containing traffic congestion data. Two state-of-the-art solution methods were used, Ant Colony Optimization (ACO) and Beam-ACO. These algorithms were hybridized with 2-Opt local search and their performances compared on the same benchmark instances. The experimental results show the efficiency of Beam-ACO compared to ACO.