599 search results - page 67 / 120 » The traveling salesman problem |
CCCG
2007
13 years 9 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
JAL
2006
13 years 8 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
OR
2005
Springer
14 years 1 months ago
2005
Springer
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...
EOR
2007
13 years 8 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...