Matrices with distances between pairs of locations are essential for solving vehicle routing problems like the Capacitated Vehicle Routing Problem (CVRP), Traveling Salesman Problem (TSP) and others. This work deals with ...
Albiach, José; Sanchís Llopis, José María; Soler Fernández, David(Elsevier, 2008)
[EN] In this paper we deal with an extended version of the Asymmetric Traveling Salesman Problem with Time Windows (ATSPTW) that considers time-dependent travel times and costs, for a more accurate approximation of some ...
Anaya Fuentes, G.E.; Hernández Gress, E.S.; Seck Tuoh Mora, J.C.; Medina Marín, J.(Universitat Politècnica de València, 2016-10-10)
[ES] En este trabajo se estudia el Problema de Secuenciación de Trabajos codificado como un Problema de Agente Viajero y resuelto mediante Algoritmos Genéticos. Se propone un Algoritmo Genético en donde se comparan dos ...
The routing of vehicles on road transportation networks is an area of great importance to transportation planners within scientific literature. This field includes well known and studied problems like traveling salesman ...