Results 91 to 100 of about 4,258 (228)
, 2000 In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K., Congram, R.K.
core
The Railway Traveling Salesman Problem [PDF]
, 2007 We consider theRailwayTraveling SalesmanProblem(RTSP) in which a salesman using the railway network wishes to visit a certain number of cities to carry out his/her business, starting and ending at the same city, and having as goal to minimize the overall time of the journey. RTSP is an NP-hard problem.
Georgia Hadjicharalambous +4 more
openaire +1 more source
Complexity indices for the travelling salesman problem and data mining [PDF]
Transactions on Combinatorics, 2012 In this survey paper we extend our previous work on complexity indices for the travelling salesman problem (TSP), summarized in cite{CvCK3}, using graph spectral techniques of data mining. A complexity index is an invariant of an instance $I$ by which we
Dragos Cvetković
doaj
, 2016 Travelling Salesman Problem (TSP) is one of the most researched combinatorial problems in mathematics. This chapter incorporates chaotic maps in evolutionary algorithms as random number generators and applies it to the TSP.
Zelinka, Ivan +3 more
core
Directed travelling salesman problem
, 1986 Considers an exactly soluble directed travelling salesman problem, where the salesman is forbidden to move, during its visit to the cities, opposite to a particular direction.
Chakrabarti, B. K.
core +1 more source
MAPSOFT: A Multi-Agent based Particle Swarm Optimization Framework for Travelling Salesman Problem
Journal of Intelligent Systems, 2020 This paper proposes a Multi-Agent based Particle Swarm Optimization (PSO) Framework for the Traveling salesman problem (MAPSOFT). The framework is a deployment of the recently proposed intelligent multi-agent based PSO model by the authors.
Blamah Nachamada Vachaku +3 more
doaj +1 more source
On Labeled Traveling Salesman Problems [PDF]
, 2008 We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum (or minimum) number of colors. We derive results regarding hardness of approximation, and analyze approximation algorithms for both versions of the problem.
Basile Couëtoux +3 more
openaire +1 more source
Different approaches to Travelling Salesman Problem [PDF]
, 2022 Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Eloi Sans Gispert[en] This thesis is a comparison of some to solve the Travelling Salesman Problem.
Nogales Giné, Roger
core
Analisis Hibridisasi Pencarian Lokal Dengan Populasi Dalam Travelling Salesman Problem (TSP)
Jurnal Serambi Engineering, 2018 Traveling Salesman Problem (TSP) merupakan sebuah permasalah optimasi yang dapat diterapkan pada berbagai kegiatan seperti pendistribusian barang, pengambilan tagihan listirk dan pedagang keliling.
Erdiwansyah Erdiwansyah* +3 more
doaj +1 more source
An iterative solution for the travelling salesman problem
, 2006 The travelling salesman problem (TSP) is a typical NP-hard problem. In this paper, a well implied enumeration method for TSP is presented where the solution of the TSP is obtained by an iterative process.
Nie YY(聂义勇), Su LJ(苏丽杰)
core