Transport and Telecommunication, 2023 Travelling salesman problem (TSP) is a well known combinatorial optimization problem which has drawn colossal attention due to its eclectic range of applications.
Halder Swapna +5 more
doaj +1 more source
A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem
Journal of King Saud University: Computer and Information Sciences, 2022 Capacitated Vehicle routing problem is NP-hard scheduling problem in which the main concern is to find the best routes with minimum cost for a number of vehicles serving a number of scattered customers under some vehicle capacity constraint.
Lamees Mohammad Dalbah +3 more
doaj +1 more source
On the high multiplicity traveling salesman problem
Discrete Optimization, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grigoriev, A., van de Klundert, J.
openaire +3 more sources
Solving the Multiple Traveling Salesman Problem Using Memetic Algorithm
Artificial Intelligence Evolution, 2022 The Multiple Traveling Salesman Problem (MTSP) is considered as an NP-complete problem due to the difficulty of finding the shortest tour between different cities with a set of constraints such as visiting each city once by one salesman. The solution tour represents the sum of all tours' costs performed by n salesmen.
Ahmad T. Al- Taani, Lubna M. Al-Afifi
openaire +2 more sources
Formalization of the Problem of Optimization of Base Places and Routes of the UAV Group
Кібернетика та комп'ютерні технології, 2021 Introduction. The problem of planning the mission of a set of heterogeneous unmanned aerial vehicles (UAVs)is considered, which is to survey and/or service a given set of targets in the field.
Leonid Hulianytskyi, Oleg Rybalchenko
doaj +1 more source
An effective method for solving multiple travelling salesman problem based on NSGA-II
Systems Science & Control Engineering, 2019 In this paper, an effective multi-objective evolutionary algorithm is proposed to solve the multiple travelling salesman problem. In order to obtain minimum total visited distance and minimum range between all salesmen, some novel representation ...
Yang Shuai, Shao Yunfeng, Zhang Kai
doaj +1 more source
Prostorska razpršitev namestitvenih enot kot pomemben dejavnik vpliva na stroške dolgotrajne oskrbe [PDF]
Urbani Izziv, 2017 Več kot 90 % starostnikov bi se rado postaralo tam, kjer živijo. To idejo podpirajo tudi strateški načrti Evropskega semestra za dolgotrajno oskrbo (ang.
Norina Szander +2 more
doaj +1 more source
A Multi-Objective Tri-Level Algorithm for Hub-and-Spoke Network in Short Sea Shipping Transportation
Algorithms, 2023 Hub-and-Spoke (H&S) network modeling is a form of transport topology optimization in which network joins are connected through intermediate hub nodes. The Short Sea Shipping (SSS) problem aims to efficiently disperse passenger flows involving multiple ...
Panagiotis Farmakis +2 more
doaj +1 more source
Spatial dispersion of housing units as an important factor influencing long-term care operational costs [PDF]
Urbani Izziv, 2017 Over 90% of seniors prefer to age in place, which is an idea supported by the European Semesters on Long-Term Care strategic plans for member states, but they do not have the necessary innovation to improve the living of the elderly in a properly built ...
Norina Szander +2 more
doaj +1 more source
Genetic algorithm to the bi-objective multiple travelling salesman problem
Alexandria Engineering JournalThe travelling salesman problem (TSP) and its variants have been studied extensively due to its wide range of real-world applications, yet there are challenges in providing efficient algorithms to deal with some of its variants.
Shayathri Linganathan +1 more
doaj +1 more source