RT Journal Article
T1 An evaluation of best compromise search in graphs
A1 Machuca, Enrique
A1 Mandow-Andaluz, Lorenzo
A1 Galand, Lucie
K1 Informática
AB This work evaluates two different approaches for multicriteria graphsearch problems using compromise preferences. This approach focuses search ona single solution that represents a balanced tradeoff between objectives, ratherthan on the whole set of Pareto optimal solutions. We review the main conceptsunderlying compromise preferences, and two main approaches proposed for theirsolution in heuristic graph problems: naive Pareto search (NAMOA ), and a k-shortest-path approach (kA ). The performance of both approaches is evaluatedon sets of standard bicriterion road map problems. The experiments reveal thatthe k-shortest-path approach looses effectiveness in favor of naive Pareto searchas graph size increases. The reasons for this behavior are analyzed and discussed
PB Springer
YR 2013
FD 2013-09
LK http://hdl.handle.net/10630/5913
UL http://hdl.handle.net/10630/5913
LA eng
NO http://link.springer.com/chapter/10.1007/978-3-642-40643-0_1
NO Partially funded by P07-TIC-03018, Cons. Innovación, Ciencia yEmpresa (Junta Andalucía), and Univ. Málaga, Campus Excel. Int. Andalucía Tech
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 24 ene 2026