An interactive approach to identify the best compromise solution for two objective shortest path problems

In recent years there has been a growing interest in multiobjective path problems. Although efficient algorithms exist for solving single objective shortest path problems, the same is not true for generating the noninferior solution set for multiobjective problems, as the number of noninferior solut...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research 1990, Vol.17 (2), p.187-198
Hauptverfasser:	Current, John R., Revelle, Charles S., Cohon, Jared L.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Decision making Decision theory Exact sciences and technology Flows in networks. Combinatorial problems Mathematical models Operational research and scientific management Operational research. Management science Operations research Utility functions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!