ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Mathematics
Technology
Social Sciences
Computing
Research
Computing
Architecture and Urbanism
Pure sciences
Languages
all records (73)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
Brazil
USA
Ukraine
Spain
Canada
Cuba
Italy
South Africa
Poland
all records (79)

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

Filter  
 
254.288  Articles
1 of 25.430 pages  |  10  records  |  more records»
In this paper, we formulate and solve an Imprecise Covering Ring Star Problem (ICRSP), which is a generalization of the Ring Star Problem (RSP). Here the objective of this problem is to find a subset of nodes in a network to minimize the sum of routing co... see more

The traveling salesman problem (TSP) is a famous NP-hard problem in the area of combinatorial optimization. It is utilized to locate the shortest possible route that visits every city precisely once and comes back to the beginning point from a given set o... see more

The Equality-Generalized Travelling Salesman Problem (E-GTSP), which is an extension of the Travelling Salesman Problem (TSP), is stated as follows: given groups of points within a city, like banks, supermarkets, etc., find a minimum cost Hamiltonian cycl... see more

Ttraveling thief problem is a combination of the traveling salesman problem and the knapsack problem. traveling thief problem itself is an NP-Hard problem, so most of the problems are solved using a heuristic algorithm and it continues to grow over time.T... see more

Population size of classical genetic algorithm is determined constantly. Its size remains constant over the run. For more complex problems, larger population sizes need to be avoided from early convergence to produce local optimum. Objective of this resea... see more

Metaheuristics are solution methods which combine local improvement procedures and higher level strategies for solving combinatorial and nonlinear optimization problems. In general, metaheuristics require an important amount of effort focused on parameter... see more

This work presents a hybrid approach called GA-NN for solving the Capacitated Vehicle Routing Problem (CVRP) using Genetic Algorithms (GA) and Nearest Neighbor heuristic (NN). The first technique was applied to determine the groups of customers to be serv... see more

In this study, the assignment and routing problem of one of Istanbul’s winter maintenance activities, salt pouring, was scrutinized. The starting point of the study considers the high cost of winter maintenance work, a shrinking assigned budget, high numb... 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

1 of 25.430 pages  |  10  records  |  more records»