Sciweavers

12 search results - page 1 / 3
» Pareto Paths with SHARC
Sort
View
WEA
2009
Springer
103views Algorithms» more  WEA 2009»
13 years 11 months ago
Pareto Paths with SHARC
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
Daniel Delling, Dorothea Wagner
ESA
2008
Springer
112views Algorithms» more  ESA 2008»
13 years 6 months ago
Time-Dependent SHARC-Routing
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
Daniel Delling
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
13 years 11 months ago
ICSPEA: evolutionary five-axis milling path optimisation
ICSPEA is a novel multi-objective evolutionary algorithm which integrates aspects from the powerful variation operators of the Covariance Matrix Adaptation Evolution Strategy (CMA...
Jörn Mehnen, Rajkumar Roy, Petra Kersting, To...
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
13 years 11 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
13 years 8 months ago
Uniform sampling of local pareto-optimal solution curves by pareto path following and its applications in multi-objective GA
Although multi-objective GA (MOGA) is an efficient multiobjective optimization (MOO) method, it has some limitations that need to be tackled, which include unguaranteed uniformity...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi, Isao ...