Sciweavers

90 search results - page 12 / 18
» Metaheuristics for the vehicle routing problem with loading ...
Sort
View
COR
2010
152views more  COR 2010»
14 years 9 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
ANTSW
2006
Springer
15 years 1 months ago
An Energy-Efficient Ant-Based Routing Algorithm for Wireless Sensor Networks
Abstract. Wireless Sensor Networks are characterized by having specific requirements such as limited energy availability, low memory and reduced processing power. On the other hand...
Tiago Camilo, Carlos Carreto, Jorge Sá Silv...
ASIAN
2004
Springer
109views Algorithms» more  ASIAN 2004»
15 years 2 months ago
Online Stochastic and Robust Optimization
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Russell Bent, Pascal Van Hentenryck
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
15 years 4 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
IPPS
2006
IEEE
15 years 3 months ago
Evaluating parallel simulated evolution strategies for VLSI cell placement
Simulated Evolution (SimE) is an evolutionary metaheuristic that has produced results comparable to well established stochastic heuristics such as SA, TS and GA, with shorter runti...
Sadiq M. Sait, Mustafa I. Ali, Ali Mustafa Zaidi