Multi-Objective Shortest Path Model for Optimal Route between Commercial Cities on America

  • Mohammed S. Ibrahim Ministry of Higher Education and Scientific Research, Baghdad, Iraq
Keywords: shortest path problem, multi-objective optimization, multi-objective shortest path problem, lexicographic method

Abstract

The traditional shortest path problem is mainly concerned with identifying the associated paths in the transportation network that represent the shortest distance between the source and the destination in the transportation network by finding either cost or distance. As for the problem of research under study it is to find the shortest optimal path of multi-objective (cost, distance and time) at the same time has been clarified through the application of a proposed practical model of the problem of multi-objective shortest path to solve the problem of the most important 25 commercial US cities by travel in the car or plane. The proposed model was also solved using the lexicographic method through package program Win-QSB 2.0 for operational research applications.

Published
2019-06-26
How to Cite
Ibrahim, M. S. (2019). Multi-Objective Shortest Path Model for Optimal Route between Commercial Cities on America. Iraqi Journal of Science, 60(6), 1394-1403. https://doi.org/10.24996/ijs.2019.60.6.24
Section
Mathematics