Mostrar el registro sencillo del ítem
An evaluation of best compromise search in graphs
dc.contributor.author | Machuca, Enrique | |
dc.contributor.author | Mandow-Andaluz, Lorenzo | |
dc.contributor.author | Galand, Lucie | |
dc.date.accessioned | 2013-09-27T06:29:31Z | |
dc.date.available | 2013-09-27T06:29:31Z | |
dc.date.issued | 2013-09 | |
dc.identifier.citation | http://link.springer.com/chapter/10.1007/978-3-642-40643-0_1 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10630/5913 | |
dc.description.abstract | This work evaluates two different approaches for multicriteria graph search problems using compromise preferences. This approach focuses search on a single solution that represents a balanced tradeoff between objectives, rather than on the whole set of Pareto optimal solutions. We review the main concepts underlying compromise preferences, and two main approaches proposed for their solution in heuristic graph problems: naive Pareto search (NAMOA ), and a k-shortest-path approach (kA ). The performance of both approaches is evaluated on sets of standard bicriterion road map problems. The experiments reveal that the k-shortest-path approach looses effectiveness in favor of naive Pareto search as graph size increases. The reasons for this behavior are analyzed and discussed | es_ES |
dc.description.sponsorship | Partially funded by P07-TIC-03018, Cons. Innovación, Ciencia y Empresa (Junta Andalucía), and Univ. Málaga, Campus Excel. Int. Andalucía Tech | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | Springer | es_ES |
dc.relation.ispartofseries | Lecture Notes in Artificial Intelligence (LNAI);8109 | |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.subject | Informática | es_ES |
dc.subject.other | Multiobjective A* | es_ES |
dc.subject.other | k-shortest paths | es_ES |
dc.subject.other | road networks | es_ES |
dc.title | An evaluation of best compromise search in graphs | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.centro | E.T.S.I. Informática | es_ES |