TY - JFULL AU - José Maria A. Pangilinan and Gerrit K. Janssens PY - 2007/2/ TI - Evolutionary Algorithms for the Multiobjective Shortest Path Problem T2 - International Journal of Mathematical and Computational Sciences SP - 6 EP - 12 VL - 1 SN - 1307-6892 UR - https://publications.waset.org/pdf/12620 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 1, 2007 N2 - This paper presents an overview of the multiobjective shortest path problem (MSPP) and a review of essential and recent issues regarding the methods to its solution. The paper further explores a multiobjective evolutionary algorithm as applied to the MSPP and describes its behavior in terms of diversity of solutions, computational complexity, and optimality of solutions. Results show that the evolutionary algorithm can find diverse solutions to the MSPP in polynomial time (based on several network instances) and can be an alternative when other methods are trapped by the tractability problem. ER -