Sciweavers

14548 search results - page 124 / 2910
» The Optimal Path-Matching Problem
Sort
View
EOR
2008
78views more  EOR 2008»
13 years 10 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Haye Lau, Shoudong Huang, Gamini Dissanayake
ESCIENCE
2006
IEEE
14 years 1 months ago
A Differential Evolution Based Algorithm to Optimize the Radio Network Design Problem
In this paper we present a Differential Evolution based algorithm used to solve the Radio Network Design (RND) problem. This problem consists in determining the optimal locations ...
Silvio Priem-Mendes, Juan Antonio Gómez Pul...
IPCO
2004
144views Optimization» more  IPCO 2004»
13 years 11 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha
CEC
2007
IEEE
14 years 2 days ago
Flexibility of design variables to pareto-optimal solutions in multi objective optimization problems
Abstract— In this paper, we propose the concept of the flexibility of design variables to Pareto-optimal solutions in MultiObjective Optimization problems. In addition, we intro...
Tomoyuki Hiroyasu, Shinpei Chino, Mitsunori Miki
AEI
2004
150views more  AEI 2004»
13 years 10 months ago
Ant colony optimization techniques for the vehicle routing problem
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
John E. Bell, Patrick R. McMullen