42 search results - page 7 / 9 » The Traveling Salesman Problem for Cubic Graphs |
WOB
2004
13 years 8 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
HEURISTICS
2008
13 years 7 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
TAMC
2009
Springer
13 years 12 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
GIS
2007
ACM
13 years 11 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
KES
2007
Springer
14 years 1 months ago
2007
Springer
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...