Results 11 to 20 of about 877 (188)

The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm [PDF]

open access: yesThe Scientific World Journal, 2014
The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some prespecified clusters.
Zakir Hussain Ahmed
doaj   +2 more sources

POPMUSIC for the travelling salesman problem [PDF]

open access: yesEuropean Journal of Operational Research, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Taillard, Eric, Helsgaun, Keld
openaire   +3 more sources

An ant colony genetic fusion routing algorithm based on soft define network

open access: yesIET 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

An open close multiple travelling salesman problem with single depot [PDF]

open access: yesDecision 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

Traveling salesman problem with a center [PDF]

open access: yesPhysical Review E, 2005
We study a travelling salesman problem where the path is optimized with a cost function that includes its length $L$ as well as a certain measure $C$ of its distance from the geometrical center of the graph. Using simulated annealing (SA) we show that such a problem has a transition point that separates two phases differing in the scaling behaviour of $
Adam Lipowski, Dorota Lipowska
openaire   +3 more sources

Optimised Internet of Thing framework based hybrid meta‐heuristic algorithms for E‐healthcare monitoring

open access: yesIET 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

Traveling salesman path problems [PDF]

open access: yesMathematical Programming, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lam, F., Newman, A.
openaire   +3 more sources

On solving Travelling Salesman Problem with Vertex Requisitions [PDF]

open access: yesYugoslav Journal of Operations Research, 2017
We consider the Travelling Salesman Problem with Vertex Requisitions where, for each position of the tour, at most two possible vertices are given. It is known that the problem is strongly NP-hard.
Eremeev Anton V., Kovalenko Yulia V.
doaj   +1 more source

An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows [PDF]

open access: yesYugoslav Journal of Operations Research, 2013
General Variable Neighborhood Search (GVNS) is shown to be a powerful and robust methodology for solving travelling salesman and vehicle routing problems.
Mladenović Nenad   +2 more
doaj   +1 more source

ECOLOGICAL OPTIMIZATION OF CARGO TRANSPORTATION OF AN ENTERPRISE USING INFORMATION SYSTEMS

open access: yesФінансово-кредитна діяльність: проблеми теорії та практики, 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

Home - About - Disclaimer - Privacy