Abstract
Many real world problems involve several, usually conflicting, objectives. Multiobjective analysis deals with these problems locating trade-offs between different optimal solutions. Regarding graph search problems, several algorithms based on best-first and depth-first approaches have been proposed to return the set of all Pareto optimal solutions. This article presents a detailed comparison between two representatives of multiobjective depth-first algorithms, PIDMOA* and MO-DF-BnB. Both of them extend previous single-objective search algorithms with linear-space requirements to the multiobjective case. Experimental analyses on their time performance over tree-shaped search spaces are presented. The results clarify the fitness of both algorithms to parameters like the number or depth of goal nodes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Coego, J., Mandow, L., & Pérez de la Cruz, J. L. (2009). A new approach to iterative deepening multiobjective A*. In AI*IA 2009, LNCS 5883, pp. 264–273.
Galand L., Perny P., Spanjaard O. (2010) Choquet-based optimisation in multiobjective shortest path and spanning tree problems. European Journal of Operational Research 204(2): 303–315
Harikumar S., Kumar S. (1996) Iterative deepening multiobjective A*. Information Processing Letters 58: 11–15
Korf R., Zhang W., Thayer I., Hohwald H. (2005) Frontier search. JACM 52(5): 715–748
Korf R. E. (1985a) Depth first iterative deepening: An optimal admissible tree search. Artificial Intelligence 27: 97–109
Korf, R. E. (1985b). Iterative-deepening A*: An optimal admissible tree search. In Proceedings of the IX international joint conference on artificial intelligence (IJCAI 1985) (pp. 1034–1036).
Land A., Doig A. (1960) An automatic method of solving discrete programming problems. Econometrica 28: 497–520
Li X., Yalaoui F., Amodeo L. (2010) Metaheuristics and exact methods to solve a multiobjective parallel machines scheduling problem. Journal of Intelligent Manufacturing 21(1): 89– 99
Mandow, L., Pérez de la Cruz, J. L. (2008). Frontier search for bicriterion shortest path problems. In 18th European conference on artificial intelligence (ECAI 2008) (pp. 480–484).
Mandow L., Pérez de la Cruz J. L. (2010a) Multiobjective A* search with consistent heuristics. Journal of the ACM 57(5): 27–125
Mandow L., Pérez de la Cruz J. L. (2010b) Path recovery in frontier search for multiobjective shortest path problems. Journal of Intelligent Manufacturing 21: 89–99
Raith A., Ehrgott M. (2009) A comparison of solution strategies for biobjective shortest path problems. Computers & Operations Research 36(4): 1299–1331
Reinefeld A., Marsland T. (1994) Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence 16: 701–710
Rollón, E., Larrosa, J. (2009). Constraint optimization techniques for multiobjective branch and bound search. In Lecture notes in economics and mathematical systems, (Vol. 618, pp. 89–98).
Sourd F., Spanjaard O. (2008) A multiobjective branch-and-bound framework: Application to the bi-objective spanning tree problem. INFORMS Journal on Computing 20(3): 472–484
Zhang W. (1999) State-space search: Algorithms, complexity, extensions, and applications. Springer, Berlin
Zhang W., Korf R. (1995) Performance of linear-space search algorithms. Artificial Intelligence 79: 241–292
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Coego, J., Mandow, L. & Pérez de la Cruz, J.L. A comparison of multiobjective depth-first algorithms. J Intell Manuf 24, 821–829 (2013). https://doi.org/10.1007/s10845-012-0632-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-012-0632-y