Sciweavers

315 search results - page 12 / 63
» A new heuristic to solve the one-warehouse N-retailer proble...
Sort
View
HEURISTICS
2010
13 years 6 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
AAAI
2007
13 years 11 months ago
Learning to Solve QBF
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification met...
Horst Samulowitz, Roland Memisevic
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
13 years 9 months ago
Voronoi-initializated island models for solving real-coded deceptive problems
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
Santiago Muelas, José Manuel Peña, V...
ICCS
2003
Springer
14 years 1 months ago
A New Approach to Survivability of Connection Oriented Networks
Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences. In this paper we concentrat...
Krzysztof Walkowiak
COR
2004
139views more  COR 2004»
13 years 8 months ago
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle Routing Problems (VRP) arise in many real-life applications wit...
Sin C. Ho, Dag Haugland