Sciweavers

161 search results - page 5 / 33
» Optimizing Multiple Spaced Seeds for Homology Search
Sort
View
AAAI
2004
14 years 11 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...
GECCO
2009
Springer
153views Optimization» more  GECCO 2009»
15 years 4 months ago
A search space analysis for the waste collection vehicle routing problem with time windows
We address a large scale waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and drivers lunch breaks. A fitness search spac...
Andrew Runka, Beatrice M. Ombuki-Berman, Mario Ven...
EPS
1998
Springer
15 years 1 months ago
Evolutionary Algorithms for Vertex Cover
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
Isaac K. Evans
HM
2009
Springer
145views Optimization» more  HM 2009»
15 years 2 months ago
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows
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...
Sandro Pirkwieser, Günther R. Raidl
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
14 years 10 months ago
Adaptive discretization on multidimensional continuous search spaces
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
Jiun-Jiue Liou, Ying-Ping Chen