Solution approaches for determining user-oriented paths on dynamic networks Online publication date: Thu, 24-Sep-2015
by Luigi Di Puglia Pugliese; Francesca Guerriero
International Journal of Supply Chain and Inventory Management (IJSCIM), Vol. 1, No. 1, 2015
Abstract: This paper addresses the time dependent multi-objective constrained shortest path problem. Solving the problem aims at providing the user a Pareto-optimal solution associated with an efficient path. The solution process takes into account information given by the user in order to obtain a path, satisfying his/her requirements. For the first time, more than two criteria are considered and the reference point methodology is used to define the aggregation function. In addition, knapsack-like constraints are introduced in the formulation in order to model budget restrictions. Dynamic-programming-based algorithms are devised and tested on randomly generated networks and on real life instances derived from US city maps. The computational results underline that the proposed algorithms are able to solve the problem in a reasonable amount of time. This is a good result since the problem considered contains features of three NP-hard problems: the multi-objective, the constrained and the time dependent shortest path problems.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Supply Chain and Inventory Management (IJSCIM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook