Results 91 to 100 of about 30,647 (208)

A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem. [PDF]

Comput Intell Neurosci, 2021
Odili JB, Noraziah A, Zarina M.
europepmc   +1 more source

A sequence based genetic algorithm with local search for the travelling salesman problem [PDF]

, 2009
The standard Genetic Algorithm often suffers from slow convergence for solving combinatorial optimization problems. In this study, we present a sequence based genetic algorithm (SBGA) for the symmetric travelling salesman problem (TSP).
Arshad, S, Li, C, Yang, S
core   +2 more sources

A game theory framework for clustering [PDF]

, 2010
The Game Theory-based Multi-Agent System (GTMAS) of Toreyen and Salhi, [10] and [12], implements a loosely coupled hybrid algorithm that may involve any number of algorithms suitable, a priori, for the solution of a given optimisation problem. The system
Baeshen, M, Lausen, B, Rohmatul, F, Salhi, A, Töreyen, Ö   +4 more
core  

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  

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, Oluyinka Aderemi Adewumi, Wajiga Gregory, Baha Yusuf Benson   +3 more
doaj   +1 more source

Short Combinatorial Proof that the DFJ Polytope is contained in the MTZ Polytope for the Asymmetric Traveling Salesman Problem

, 2017
For the Asymmetric Traveling Salesman Problem (ATSP), it is known that the Dantzig-Fulkerson-Johnson (DFJ) polytope is contained in the Miller-Tucker-Zemlin (MTZ) polytope. The analytic proofs of this fact are quite long.
Velednitsky, Mark
core   +1 more source

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*, Yeni yanti, Munawir Munawir, Raihan Islamadina   +3 more
doaj   +1 more source

IMPLEMENTASI ALGORITMA BEE COLONY UNTUK OPTIMASI RUTE DISTRIBUSI CARICA NIDA FOOD WONOSOBO

Sistemasi: Jurnal Sistem Informasi, 2019
“Nida Food” merupakan UMKM produksi carica, memiliki permasalahan dalam menentukan rute minimum untuk mendistribusikan produksi carica ke semua konsumen.
Muhammad Darwis Arifin, Arif Dwi Laksito
doaj   +1 more source

Single Depot Multiple Travelling Salesman Problem Solved With Preference-Based Stepping Ahead Firefly Algorithm

IEEE Access
Firefly Algorithm (FA) mimics the flashing light characteristic of fireflies to solve optimization problems. An area where its utilization is limited is Travelling Salesman Problem (TSP).
Ravneil Nand, Kaylash Chaudhary, Bibhya Sharma   +2 more
doaj   +1 more source

Self-Organizing Structures for the Travelling Salesman Problem in a Polygonal Domain [PDF]

, 2015
Tato práce se zabývá řešením problému obchodního cestujícího v polygonální doméně samoorganizujícími se strukturami. Hlavní myšlenka spočívá v transformaci polygonální domény do metrického prostoru vyšší dimenze, což umožňuje řešit dotazy na vzdálenost ...
Sushkov Roman
core