38 search results - page 8 / 8 » Variable neighborhood search for the dial-a-ride problem |
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Abstract. This paper presents two different efficiency-enhancement techniques for probabilistic model building genetic algorithms. The first technique proposes the use of a mutatio...
HM
2007
Springer
15 years 5 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
100
click to vote
ANOR
2011
14 years 6 months ago
2011
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...