A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm
The problem investigated in this work concerns the integration of a decision-maker preference model within an exact algorithm in multiobjective combinatorial optimization. Rather than computing the complete set of efficient solutions and choosing a solution afterwards, our aim is to efficiently compute one solution satisfying the decision maker preferences elicited a priori. The preference model is based on the Choquet integral. The reference optimization problem is the multiobjective shortest path problem, where Martins’ algorithm is used. A lower bound of the Choquet integral is proposed that aims to prune useless partial paths at the labeling stage of the algorithm. Various procedures exploiting the proposed bound are presented and evaluated on a collection of benchmarks. Numerical experiments show significant improvements compared to the exhaustive enumeration of solutions.
KeywordsChoquet integral Multiobjective optimization Shortest paths
The authors would like to thank the regional council of Pays de la Loire (France), MILES project, for their support of this research.
- J. Branke, K. Deb, K. Miettinen, and R. Slowinski. Multiobjective Optimization: Interactive and Evolutionary Approaches, volume 5252 of Lecture Notes in Computer Science. Springer, 2008. 470 p.Google Scholar
- M. Ehrgott and X. Gandibleux. A survey and annoted bibliography of multiobjective combinatorial optimization. OR Spektrum, 22:425–460, 2000.Google Scholar
- J. Figueira, S. Greco, and M. Ehrgott. Multiple Criteria Decision Analysis: State of the Art Surveys. Springer Verlag, Boston, Dordrecht, London, 2005. 1045 p.Google Scholar
- L. Galand and P. Perny. Search for Choquet-optimal paths under uncertainty. In 23rd conference on Uncertainty in Artificial Intelligence, pages 125–132, Vancouver, 7 2007. AAAI Press.Google Scholar
- L. Galand and O. Spanjaard. OWA-based search in state space graphs with multiple cost functions. In 20th International Florida Artificial Intelligence Research Society Conference, pages 86–91. AAAI Press, 2007.Google Scholar
- X. Gandibleux, F. Beugnies, and S. Randriamasy. Martins’ algorithm revisited for multi-objective shortest path problems with a maxmin cost function. 4OR: A Quarterly Journal of Operations Research, 4(1):47–59, 2006.Google Scholar
- P. Hansen. Bicriterion path problems. In G. Fandel and T. Gal, editors, Multiple Criteria Decision Making Theory and Application, volume 177 of Lecture Notes in Economics and Mathematical Systems, pages 109–127. Springer Verlag, 1979.Google Scholar
- P. Kouvelis and G. Yu. Robust Discrete Optimization and Its Applications, volume 14 of Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht, 1997. 356 p.Google Scholar
- C. Labreuche and F. Lehuédé. MYRIAD: a tool suite for MCDA. In Proceedings of EUSFLAT’05, Barcelona, September 7-9, 2005.Google Scholar
- F. Lehuédé, M. Grabisch, C. Labreuche, and P. Savéant. Integration and propagation of a multi-criteria decision making model in constraint programming. Journal of Heuristics, 12(4-5):329–346, September 2006.Google Scholar
- S. Randriamasy, X. Gandibleux, J. Figueira, and P. Thomin. Device and a method for determining routing paths in a communication network in the presence of selection attributes. Patent 11/25/04. #20040233850. Washington, DC, USA.Google Scholar