13 search results - page 2 / 3 » On Euclidean Vehicle Routing with Allocation |
108
click to vote
COR
2008
15 years 1 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
113
click to vote
HM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
128
click to vote
AIPS
2007
15 years 3 months ago
2007
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...
ACCV
2006
Springer
15 years 7 months ago
2006
Springer
This work employs a fish-eye to scan cityscapes along a street and register scenes in a compact scene tunnel image. A fish-eye has complete field of view along a route. We mount th...
SAC
2003
ACM
15 years 6 months ago
2003
ACM
In this paper, we propose a manpower allocation model with time windows which is of practical interest to serviceman scheduling operations. Specifically, this problem originates f...