Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · International Journal of Supply Chain and Inventory Management · 2015

Solution approaches for determining user-oriented paths on dynamic networks

Luigi Di Puglia Pugliese, Francesca Guerriero

Cited by 0Abstract and details only

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.

Cite this paper

APA 7

Pugliese, L. D. P., & Guerriero, F. (2015). Solution approaches for determining user-oriented paths on dynamic networks. International Journal of Supply Chain and Inventory Management, 1(1), 6. https://doi.org/10.1504/ijscim.2015.071932

MLA 9

Pugliese, Luigi Di Puglia, and Francesca Guerriero. “Solution approaches for determining user-oriented paths on dynamic networks.” International Journal of Supply Chain and Inventory Management, vol. 1, no. 1, 2015, p. 6, https://doi.org/10.1504/ijscim.2015.071932.

Chicago

Pugliese, Luigi Di Puglia, and Francesca Guerriero. 2015. “Solution approaches for determining user-oriented paths on dynamic networks.” International Journal of Supply Chain and Inventory Management 1 (1): 6. https://doi.org/10.1504/ijscim.2015.071932.

Harvard

Pugliese, L.D.P. and Guerriero, F. (2015) ‘Solution approaches for determining user-oriented paths on dynamic networks’, International Journal of Supply Chain and Inventory Management, 1(1), p. 6. Available at: https://doi.org/10.1504/ijscim.2015.071932.

BibTeX
@article{pugliese2015solution,
  title = {{Solution approaches for determining user-oriented paths on dynamic networks}},
  author = {Pugliese, Luigi Di Puglia and Guerriero, Francesca},
  journal = {International Journal of Supply Chain and Inventory Management},
  volume = {1},
  number = {1},
  pages = {6},
  year = {2015},
  doi = {10.1504/ijscim.2015.071932}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers