25 June 2008 in Journal of the ACM
JCJosé. Luis Pérez De La Cruz
José. Luis Pérez De La Cruz
The article describes and analyzes NAMOA * , an algorithm for multiobjective heuristic graph search problems. The algorithm is presented as an extension of A * , an admissible scalar shortest path algorithm. Under consistent heuristics A * is known to improve its efficiency with more informed heuristics, and to be optimal over the class of admissible algorithms in terms of the set of expanded nodes and the number of node expansions. Equivalent beneficial properties are shown to prevail in the new algorithm.
1 April 2013 in Advanced Engineering Informatics
1 June 2012 in Expert Systems with Applications
1 November 2014 in European Journal of Operational Research
1 November 2014 in Computer-Aided Design
1 February 2012 in European Journal of Operational Research