Solving the optimal routs of packages transportation problem

Jacek Widuch

Abstract


The paper describes an algorithm for solving the problem of determining the optimal route of packages. The aigorithm is based on the algorithm for solving the bicriterion shortest path problem in a weighted graph with constant weights. The problem considered in this work is an example of bicriteria optimization. The solution to a bicriteria optimization problem is the set of non-dominated solutions. The algorithm which determines all routes which belong to the set of non-dominated solutions is shown. The result of the tests are presented.

Keywords


transportation problem; multicriteria optimization; set of nondominated solutions; bicriterion shortest path problem



DOI: http://dx.doi.org/10.21936/si2003_v24.n4.641