94 search results - page 5 / 19 » Competitive Memetic Algorithms for Arc Routing Problems |
107
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
EOR
2007
14 years 11 months ago
2007
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routin...
COR
2007
14 years 11 months ago
2007
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
ORL
2007
14 years 11 months ago
2007
We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of...
AAAI
2008
15 years 2 months ago
2008
We explore the relationship between properties of the network defined by connected agents and the global system performance. This is achieved by means of a novel class of optimiza...