An interactive approach to identify the best compromise solution for two objective shortest path problems (Q912767): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Charles S. Re Velle / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Frada Burstein / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0305-0548(90)90042-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025640489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network optimization: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path algorithms: Taxonomy and annotation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a multicriteria shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path problem with two objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interactive Programming Method for Solving the Multiple Criteria Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective programming and planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for K shortest simple paths / rank
 
Normal rank

Latest revision as of 15:33, 20 June 2024

scientific article
Language Label Description Also known as
English
An interactive approach to identify the best compromise solution for two objective shortest path problems
scientific article

    Statements

    An interactive approach to identify the best compromise solution for two objective shortest path problems (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    The shortest path problem with respect to two objectives is considered. The objectives are in conflict and it is impossible to find a single optimal solution, but there is a set of noninferior solutions from which the best one must be selected. An interactive method for the generation of an approximation of the noninferior solution set for two objective shortest path problems is proposed. The method incorporates interaction between the decision maker and analyst to reduce the number of alternative noninferior solutions. The interaction allows the decision maker to include additional criteria, values and personal judgment in the decision making process. The described interactive procedure is based upon the noninferior set estimation (NISE) method. In the algorithm a weighting method is used to generate an approximation of the noninferior solution set. The maximum possible error for the approximation is estimated at each iteration, which then is used to generate the next step of the procedure. For the demonstration of the given technique a sample example is presented.
    0 references
    0 references
    0 references
    0 references
    0 references
    shortest path
    0 references
    two objectives
    0 references
    interactive method
    0 references
    noninferior solution set
    0 references
    decision making
    0 references
    noninferior set estimation
    0 references
    0 references