Open AccessMulti-Objective Shortest Path Model for Optimal Route between Commercial Cities on America
Author(s) -
Mohammed Salah Ibrahim
Publication year - 2019
Publication title -
iraqi journal of science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.152
H-Index - 4
eISSN - 2312-1637
pISSN - 0067-2904
DOI - 10.24996/ijs.2019.60.6.24
Subject(s) - shortest path problem , constrained shortest path first , path (computing) , computer science , k shortest path routing , mathematical optimization , lexicographical order , yen's algorithm , operations research , dijkstra's algorithm , mathematics , computer network , theoretical computer science , graph , combinatorics
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.