Persoalan Lintasan Terpendek Objektif Ganda

Abstract

The Multiobjective Shortest Path Problem is an extension of the traditional shortest path problem and is concerned with finding a set of efficient paths with respect to two or more objectives that are usually in conflict. So it is need a way to resolve that problem- One algorithm that can be used is the SPEA (Strength Pareto Evolutionary Algorithm,) algorithm SPEA algorithm works by identifying and collecting non-dominated solutions in a Pareto-Optimal set and it will select a solution, that better represent the objectives to be achieved- A model used, in developing the SPEA algorithm. The authors would like to analyze the model used in the SPEA algorithm.