Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Routing with nonlinear multiattribute cost functions
Applied Mathematics and Computation - Special issue on multicriterion decision making with engineering applications
An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions
Computers and Operations Research
Model-Based Decision Support Methodology with Environmental Applications
Model-Based Decision Support Methodology with Environmental Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Resource Constrained Shortest Paths
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Flight String Models for Aircraft Fleeting and Routing
Transportation Science
Constrained Shortest Paths and Related Problems - Constrained Network Optimization
Constrained Shortest Paths and Related Problems - Constrained Network Optimization
An algorithm for the quickest path problem
Operations Research Letters
| Hi-index | 0.00 |
The Resource Constrained Shortest Path Problem R C S P P is a variant of the classical shortest path problem and is of great practical importance. The aim is to find the shortest path between a given pair of nodes under additional constraints representing upper bounds on the consumption of resources along the path. In the scientific literature, different approaches have been defined to solve the R C S P P. In this work we propose an innovative interactive method to address the R C S P P, based on a novel search strategy of the criteria space. The performance of the proposed approach is evaluated on the basis of an extensive computational study by considering benchmark instances. A comparison with the state-of-the-art approaches developed for the R C S P P is also carried out. The computational results have shown that the developed solution strategy is competitive with the most efficient strategies known thus far.