Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
暂无分享,去创建一个
[1] Marta M. B. Pascoal,et al. An automated reference point-like approach for multicriteria shortest path problems , 2006 .
[2] I. Murthy,et al. A parametric approach to solving bicriterion shortest path problems , 1991 .
[3] E. Martins,et al. A bicriterion shortest path algorithm , 1982 .
[4] Hokey Min,et al. Multiobjective design of transportation networks: taxonomy and annotation , 1986 .
[5] C. T. Tung,et al. A multicriteria Pareto-optimal path algorithm , 1992 .
[6] Lawrence Mandow,et al. Multiobjective shortest path problems with lexicographic goal-based preferences , 2014, Eur. J. Oper. Res..
[7] Luigi Di Puglia Pugliese,et al. Dynamic programming approaches to solve the shortest path problem with forbidden paths , 2013, Optim. Methods Softw..
[8] Francesca Guerriero,et al. The interactive analysis of the multicriteria shortest path problem by the reference point method , 2003, Eur. J. Oper. Res..
[9] Jordi Mongay Batalla,et al. Multi-criteria decision algorithms for efficient content delivery in content networks , 2013, Ann. des Télécommunications.
[10] O. Barndorfi-nielsen,et al. On the distribution of the number of admissible points in a vector , 1966 .
[11] Pierre Hansen,et al. Bicriterion Path Problems , 1980 .
[12] Xin Yao,et al. Nadir point estimation for many-objective optimization problems based on emphasized critical regions , 2017, Soft Comput..
[13] H. P. Benson,et al. Existence of efficient solutions for vector maximization problems , 1978 .
[14] A. M. Geoffrion. Proper efficiency and the theory of vector maximization , 1968 .
[15] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[16] Kaisa Miettinen,et al. Introduction to Multiobjective Optimization: Noninteractive Approaches , 2008, Multiobjective Optimization.
[17] Anna Sciomachen,et al. A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks , 1998, Eur. J. Oper. Res..
[18] Dimitri P. Bertsekas,et al. Network optimization : continuous and discrete models , 1998 .
[19] Rajan Batta,et al. Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials , 1988, Oper. Res..
[20] Matthias Ehrgott,et al. A comparison of solution strategies for biobjective shortest path problems , 2009, Comput. Oper. Res..
[21] Lawrence Mandow,et al. An Evaluation of Best Compromise Search in Graphs , 2013, CAEPIA.
[22] Arthur Warburton,et al. Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..
[23] João C. N. Clímaco,et al. An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions , 1999, Comput. Oper. Res..
[24] Christina Hallam,et al. A Multiobjective Optimal Path Algorithm , 2001, Digit. Signal Process..
[25] R. Dial. A MODEL AND ALGORITHM FOR MULTICRITERIA ROUTE-MODE CHOICE , 1979 .
[26] Luigi Di Puglia Pugliese,et al. Shortest path problem with forbidden paths: The elementary version , 2013, Eur. J. Oper. Res..
[27] Patrice Perny,et al. Choquet-based optimisation in multiobjective shortest path and spanning tree problems , 2010, Eur. J. Oper. Res..
[28] John R. Current,et al. Multiobjective transportation network design and routing problems: Taxonomy and annotation , 1993 .
[29] João C. N. Clímaco,et al. A bicriterion approach for routing problems in multimedia networks , 2003, Networks.
[30] Andrzej P. Wierzbick. Basic properties of scalarizmg functionals for multiobjective optimization , 1977 .
[31] A. A. Elimam,et al. Two engineering applications of a constrained shortest-path model , 1997 .
[32] R. Musmanno,et al. Label Correcting Methods to Solve Multicriteria Shortest Path Problems , 2001 .
[33] Kim Allan Andersen,et al. A label correcting approach for solving bicriterion shortest-path problems , 2000, Comput. Oper. Res..
[34] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .
[35] Luigi Di Puglia Pugliese,et al. A survey of resource constrained shortest path problems: Exact solution approaches , 2013, Networks.
[36] Luigi Di Puglia Pugliese,et al. A new approach for the multiobjective minimum spanning tree , 2018, Comput. Oper. Res..
[37] Włodzimierz Ogryczak,et al. On goal programming formulations of the reference point method , 2001, J. Oper. Res. Soc..
[38] Chelsea C. White,et al. A heuristic search approach for solving multiobjective non-order-preserving path selection problems , 1999, IEEE Trans. Syst. Man Cybern. Part A.
[39] Ernesto de Queirós Vieira Martins,et al. An algorithm for the quickest path problem , 1997, Oper. Res. Lett..
[40] H. T. Kung,et al. On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.
[41] Patrice Perny,et al. A preference-based approach to spanning trees and shortest paths problems**** , 2005, Eur. J. Oper. Res..
[42] Mordechai I. Henig. The domination property in multicriteria optimization , 1986 .
[43] Luigi Di Puglia Pugliese,et al. On the shortest path problem with negative cost cycles , 2016, Comput. Optim. Appl..
[44] David Pisinger,et al. Multi-objective and multi-constrained non-additive shortest path problems , 2011, Comput. Oper. Res..
[45] Andrew V. Goldberg,et al. Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.
[46] Patrice Perny,et al. Search for Compromise Solutions in Multiobjective State Space Graphs , 2006, ECAI.
[47] Jared L. Cohon,et al. An interactive approach to identify the best compromise solution for two objective shortest path problems , 1990, Comput. Oper. Res..
[48] Lawrence Mandow,et al. A heuristic search algorithm with lexicographic goals , 2001 .
[49] Panos M. Pardalos,et al. A survey of recent developments in multiobjective optimization , 2007, Ann. Oper. Res..
[50] Lakshmish Ramaswamy,et al. Research Directions for Big Data Graph Analytics , 2015, 2015 IEEE International Congress on Big Data.