Results 11 to 20 of about 4,732 (227)
The intermittent travelling salesman problem [PDF]
International Transactions in Operational Research, 2018 AbstractIn this paper, we introduce a new variant of the travelling salesman problem, namely the intermittent travelling salesman problem (ITSP), which is inspired by real‐world drilling/texturing applications. In this problem, each vertex can be visited more than once and there is a temperature constraint enforcing a time lapse between two consecutive
Pham, Tú San +2 more
openaire +3 more sources
A hybrid genetic algorithm and inver over approach for the travelling salesman problem [PDF]
, 2010 This article posted here with permission of the IEEE - Copyright @ 2010 IEEEThis paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP).
Yang, S +5 more
core +3 more sources
An ant colony genetic fusion routing algorithm based on soft define network
IET Networks, EarlyView., 2022 Abstract Aiming at the problem that there are many paths in data forwarding in soft define network (SDN) network, and the optimal path is difficult to find, combined with the advantages of ant colony algorithm and Genetic algorithm (GA), a routing control strategy based on the ant colony genetic fusion algorithm is proposed.
Kaixin Zhao, Yong Wei, Yang Zhang
wiley +1 more source
IET Networks, EarlyView., 2022 Abstract Everything can be connected in the Internet of Things (IoTs) technology that enables efficient communication between connected objects. IoTs industry‐based meta‐heuristic and mining algorithms, which are considered an important field of Artificial Intelligence will be used to construct a healthcare application in this study for lowering costs,
Muhaned Al‐Hashimi +4 more
wiley +1 more source
An open close multiple travelling salesman problem with single depot [PDF]
Decision Science Letters, 2019 This paper introduces a novel practical variant, namely an open close multiple travelling salesmen problem with single depot (OCMTSP) that concerns the generalization of classical travelling salesman problem (TSP).
Jayanth Kumar Thenepalle +1 more
doaj +1 more source
The Attractive Traveling Salesman Problem [PDF]
European Journal of Operational Research, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Günes Erdogan +2 more
openaire +2 more sources
ECOLOGICAL OPTIMIZATION OF CARGO TRANSPORTATION OF AN ENTERPRISE USING INFORMATION SYSTEMS
Фінансово-кредитна діяльність: проблеми теорії та практики, 2022 . The aim of the article is to systematize the existing ways to decrease the environmental load at the enterprise, in the country and in the world, to identify ways of greening the enterprise by using transportation means to transport goods from ...
О. Sazonets , A. Terebii
doaj +1 more source
A d-dimensional analyst's Travelling Salesman theorem for arbitrary sets in Euclidean space [PDF]
, 2021 In this thesis, we discuss recent progress on higher dimensional analogues to the Analyst’s Travelling Salesman Theorem (TST) of Peter Jones. The TST characterizes subsets of rectifiable curves in the plane, via a multiscale sum of β-numbers.
Hyde, Matthew
core +1 more source
A Labelling Method for the Travelling Salesman Problem
Applied Sciences, 2023 The travelling salesman problem (TSP) is a problem whereby a finite number of nodes are supposed to be visited exactly once, one after the other, in such a way that the total weight of connecting arcs used to visit these nodes is minimized.
Trust Tawanda +3 more
doaj +1 more source
GENETIC ALGORITHM FOR OPTIMIZING DISTRIBUTION WITH ROUTE RESTRICTION CONSTRAINT DUE TO TRAFFIC JAMS [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 The Travelling Salesman Problem (TSP) is a classical problem in combinatorial optimization that consists of finding the shortest tour through all cities such that the salesman visits each city only one time and returns to the starting city.
N. Mouttaki, J. Benhra, G. Rguiga
doaj +1 more source