Buscar
Mostrando ítems 1-10 de 407
Traveling Salesman Problem with Optional Bonus Collection, Pickup Time and Passengers
(Instituto de Informática - Universidade Federal do Rio Grande do Sul, 2020)
The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
(Springer, 2019)
The classic Traveling Salesman Problem (TSP) only considers the costs involved in the routes and does not differentiate products or customers. Logistic companies face conflict between operational costs, customers with ...
Water cycle algorithm: implementation and analysis of solutions to the bi-bjective travelling salesman problem
(International Journal of Artificial Intelligence, 2019)
This research is an implementation of the Water Cycle Algorithm (WCA) to solve the biobjective
Travelling Salesman Problem, based on the kroAB100 problem in the TSPLIB
library, and compare its performance to an alternative ...
Prize Collecting Traveling Salesman Problem with Ridesharing
(Instituto de Informática - Universidade Federal do Rio Grande do Sul, 2020)
A new memetic algorithm for the asymmetric traveling salesman problem
(SpringerDordrechtHolanda, 2004)
The job shop scheduling problem solved with the travel salesman problem and genetic algorithms
(2013)
In this paper we proposed a solution to the JobShop Scheduling Problem using the Traveling Salesman Problem solved by Genetic Algorithms. Different tests are performed to solve the Traveling Salesman Problem with the two ...
A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem
This article addresses the one-commodity pickup and delivery traveling salesman problem (1-PDTSP), which is a generalization of the well-known traveling salesman problem. The 1-PDTSP aims to find a Hamiltonian tour in which ...
Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero
(2015-01-01)
In this paper we explore the multi-commodity flow formulation for the Asymmetric Traveling Salesman Problem (ATSP) to obtain dual bounds. The procedure employed is a variant of a relax and cut procedure proposed in the ...
Grafos hamiltonianos aplicado al turismo de Panamá
(Universidad Católica Santa María La Antigua, 2019)