ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Mathematics
Social Sciences
Technology
Research
Architecture and Urbanism
Languages
Literature
Physical
Pure sciences
all records (74)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
Brazil
USA
Ukraine
Spain
Canada
South Africa
Cuba
Italy
Turkey, Turkish Republic
all records (78)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
157.987  Articles
1 of 15.800 pages  |  10  records  |  more records»
The subject of this research is distance and time of several city tour problems which known as traveling salesman problem (tsp). The goal is to find out the gaps of distance and time between two types of optimization methods in traveling salesman problem:... see more

Ant Colony Optimization is one of the meta-heuristic methods used to solve combinatorial optimization problems that are quite difficult. Ant Colony Optimization algorithm is inspired by ant behavior in the real world to build the shortest path between foo... see more

Ant Colony Optimization is one of the meta-heuristic methods used to solve combinatorial optimization problems that are quite difficult. Ant Colony Optimization algorithm is inspired by ant behavior in the real world to build the shortest path between foo... see more

The traveling salesman problem (TSP) is one of the most important NP-hard Problems and probably the most famous and extensively studied problem in the field of combinatorial optimization. In this problem, a salesman is required to visit each of n given no... see more

An approximate algorithm combining P systems and active evolutionary algorithms (AEAPS) to solve traveling salesman problems (TSPs) is proposed in this paper. The novel algorithm uses the same membrane structure, subalgorithms and transporting mechanisms ... see more

A new, improved ant colony optimization (ACO) algorithm with novel pheromone correction strategy is introduced. It is implemented and tested on the traveling salesman problem (TSP). Algorithm modification is based on undesirability of some elements of the... see more

Ant colony algorithms such as Ant Colony Optimization (ACO) havebeen effectively applied to solve the Traveling Salesman problem (TSP). However,traditional ACO algorithm has some issues such as long iterative length and prone tolocal convergence. To this ... see more

Yogyakarta offers many tourist attractions, from nature based tourism, culinary tourism until cultural tourism. With so many tourist attractions offered by Yogyakarta, tourist often finds it difficult to arrange their travel schedule (from choosing which ... see more

Tujuan penelitian ini adalah mengimplementasikan metode Ant Colony untuk Traveling Salesman Problem (TSP) dengan memanfaatkan Google Maps studi kasus pada kota-kota di Jawa Tengah. Algoritma Ant System yang merupakan salah satu algoritma Ant Colony ... see more

1 of 15.800 pages  |  10  records  |  more records»