Sciweavers

835 search results - page 2 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
CEC
2007
IEEE
14 years 23 days ago
Finding trade-off solutions close to KKT points using evolutionary multi-objective optimization
— Despite having a wide-spread applicability of evolutionary optimization procedures over the past few decades, EA researchers still face criticism about the theoretical optimali...
Kalyanmoy Deb, Rahul Tewari, Mayur Dixit, Joydeep ...
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
13 years 10 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
ATAL
2008
Springer
13 years 8 months ago
Cooperative search for optimizing pipeline operations
We present an application of a multi-agent cooperative search approach to the problem of optimizing gas pipeline operations, i.e. finding control parameters for a gas transmission...
T. Mora, Abu B. Sesay, Jörg Denzinger, Hossei...
ECAI
2010
Springer
13 years 7 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
13 years 10 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand