Multiobjective, preference-based search in acyclic OR-graphs
TLDR
An algorithm is presented which is shown to terminate with a most preferred path, given an admissible heuristic set, which illustrates how Artificial Intelligence techniques can be productively employed to solve multiobjective problems.About:
This article is published in European Journal of Operational Research.The article was published on 1992-02-10 and is currently open access. It has received 29 citations till now. The article focuses on the topics: Consistent heuristic & Admissible heuristic.read more
Citations
More filters
An Annotated Bibliography of Multiobjective Combinatorial Optimization
TL;DR: This paper provides an annotated bibliography of multiple objective combinatorial optimization, MOCO, and an annotation of the existing literature in the field organized problem by problem.
Book ChapterDOI
Multiobjective Combinatorial Optimization — Theory, Methodology, and Applications
TL;DR: This chapter provides an annotated bibliography of multiple objective combinatorial optimization, M OCO, and presents a general formulation of MOCO problems, describe their main characteristics, and review the main properties and theoretical results.
Journal ArticleDOI
A preference-based approach to spanning trees and shortest paths problems****
Patrice Perny,Olivier Spanjaard +1 more
TL;DR: A generalization of the problem, where preferences take the form of a quasi-transitive binary relation defined on the solutions space, and proposes preference-based search algorithms for two classical combinatorial problems, namely the preferred spanning trees problem and the preferred paths problem.
Journal ArticleDOI
Decision making with multiple objectives using GAI networks
TL;DR: This paper presents preference-based search algorithms for multicriteria or multiagent decision making using generalized additive decomposable (GAI) utility functions modeling individual preferences or criteria and shows that GAI networks are still useful to determine the most preferred alternatives provided preferences are compatible with Pareto dominance.
Journal ArticleDOI
A general decomposition approach for multi-criteria decision trees
TL;DR: This paper proposes a new approach to solve multi-criteria decision trees without generating the set of all non-dominated solutions, which should reduce the computation time and the cardinality of the solution set.
References
More filters
Book
Decisions with Multiple Objectives: Preferences and Value Trade-Offs
TL;DR: In this article, a confused decision maker, who wishes to make a reasonable and responsible choice among alternatives, can systematically probe his true feelings in order to make those critically important, vexing trade-offs between incommensurable objectives.
Journal ArticleDOI
Proper efficiency and the theory of vector maximization
TL;DR: In this paper, the concept of proper efficiency was introduced to eliminate efficient points of a certain anomalous nature in the problem of vector maximization, which is related in spirit to the notion of "proper" efficiency introduced by Kuhn and Tucker in their celebrated paper of 1950.
Journal ArticleDOI
An Interactive Programming Method for Solving the Multiple Criteria Problem
Stanley Zionts,Jyrki Wallenius +1 more
TL;DR: In this paper, a man-machine interactive mathematical programming method is presented for solving the multiple criteria problem involving a single decision maker, where all decision-relevant criteria or objective functions are concave functions to be maximized, and the constraint set is convex.
Journal ArticleDOI
A Generalization of
TL;DR: The generalization problem is deeneed, various approaches in generalization are summarized, the credit assignment problem is identified, and the problem and some solutions in measuring generalizability are presented.
Journal ArticleDOI
Generalized dynamic programming for multicriteria optimization
TL;DR: Generalized DP avoids the potential pitfalls created by this absence of monotonicity, thereby guaranteeing optimality in a prototypical multicriteria DP problem, namely a multicritical version of the shortest path problem.