38 search results - page 7 / 8 » Variable neighborhood search for the dial-a-ride problem |
BMCBI
2008
13 years 7 months ago
2008
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
EVOW
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
GIS
2008
ACM
14 years 8 months ago
2008
ACM
This paper proposes a novel framework for mining regional colocation patterns with respect to sets of continuous variables in spatial datasets. The goal is to identify regions in ...
AIPS
2006
13 years 8 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...