Near admissible algorithms for multiobjective search

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 490-494

  Perny, Patrice ^a   Spanjaard, Olivier ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS;

DOMINANCE RELATION; MULTIOBJECTIVE SEARCH; NONDOMINATED SOLUTIONS; PARETO OPTIMAL SOLUTIONS; PARETO-OPTIMALITY; PERFORMANCE GUARANTEES; SEARCH ALGORITHMS; SOLUTION PATH; SPACE GRAPHS; STATE-SPACE;

PARETO PRINCIPLE;

EID: 85051927925     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-490     Document Type: Conference Paper

References (14)

1. E. Angel, E. Bampis, and A. Kononov, ‘On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.’, Theor. Comput. Sci., 306(1-3), 319–338, (2003).
2. T. Erlebach, H. Kellerer, and U. Pferschy, ‘Approximating multiobjective knapsack problems’, Manag. Science, 48(12), 1603–1612, (2002).
3. K. Fujimura, ‘Path planning with multiple objectives’, IEEE Robotics and Automation Magazine, 3(1), 33–38, (1996).
4. M. Ghallab, ‘Aε: an efficient near admissible heuristic search algorithm’, in Proc. of the 8th IJCAI, pp. 789–791, (1983).
5. P. Hansen, ‘Bicriterion path problems’, in Multicriteria Decision Making, eds., G. Fandel and T. Gal, (1980).
6. P.E. Hart, N.J. Nilsson, and B. Raphael, ‘A formal basis for the heuristic determination of minimum cost paths’, IEEE Trans. Syst. and Cyb., SSC-4 (2), 100–107, (1968).
7. M. Laumanns, L. Thiele, K. Deb, and E. Zitzler, ‘Combining convergence and diversity in evolutionary multiobjective optimization’, Evolutionary Computation, 10(3), 263–282, (2002).
8. L. Mandow and J.-L. Pérez-de-la Cruz, ‘A new approach to multiobjective A* search.’, in Proc. of the 19th IJCAI, pp. 218–223, (2005).
9. S. Martello and P. Toth, ‘An upper bound for the zero-one knapsack problem and a branch and bound algorithm’, European J. of Operational Research, 1, 169–175, (1975).
10. C. H. Papadimitriou and M. Yannakakis, ‘On the approximability of trade-offs and optimal access of web sources’, in Proc. of the 41th IEEE Symp. on FOCS, pp. 86–92, (2000).
11. J. Pearl and J.H. Kim, ‘Studies in semi-admissible heuristics’, IEEE Trans. on PAMI, 4(4), 392–400, (1982).
12. B.S. Stewart and C.C. White III, ‘Multiobjective A*’, J. of the Association for Computing Machinery, 38(4), 775–814, (1991).
13. G. Tsaggouris and C. Zaroliagis, ‘Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications’, in Proc. of the 17th ISAAC, pp. 389–398, (2006).
14. A. Warburton, ‘Approximation of pareto optima in multiple-objective shortest-path problems’, Operations Research, 35(1), 70–79, (1987).