Abstract Grey Wolf Optimizer (GWO) is a recently developed population-based metaheuristic
algorithm which imitates the behaviour of grey wolves for survival. Initially, GWO was …

This work presents a Discrete Komodo Algorithm (DKA) to solve the traveling salesman
problem (TSP). Inspired by the Komodo Mlipir Algorithm, a swarm intelligence algorithm …

Abstract Multi-objective Euclidian TSP (ETSP) has several practical applications such as
mobile computing and maritime surveillance. This problem has complexity not only in terms …

This paper addresses the well-known NP-hard problem, the Symmetric Travelling Salesman
Problem (STSP), which has numerous applications in logistics and graph theory. To solve …

The Traveling Salesman Problem is the problem of identifying a route that will enable a
salesman to visit all the cities only once in the list where the cities are located, to start and to …

This research aims to study a real-world example of the unrelated parallel machine
scheduling problem (UPMSP), considering job-splitting, inventories, shortage, and resource …

Drilling holes on a Printed Circuit Board is a complicated task and it is usually ensured via a
Computer Numerical Control (CNC) machine using a drilling robot arm. Commonly, to …

This paper carries out a performance analysis of major Nature-inspired Algorithms in solving
the benchmark symmetric and asymmetric Traveling Salesman's Problems (TSP) …

Gezgin Satıcı Problemi (GSP), bir satıcının bütün şehirleri sadece bir defa ziyaret ederek
başlangıç noktasına dönmesini sağlayan en kısa rotanın belirlendiği problemdir. GSP, araç …

Solving the vehicle routing problem (VRP) is one of the best-known optimization issues in
the TLS (transport, logistic, spedition) branch market. Various variants of the VRP problem …