scientific article; zbMATH DE number 1488066
From MaRDI portal
Publication:4495163
zbMath0972.90004MaRDI QIDQ4495163
Maria Grazia Scutellà, Stefano Pallottino
Publication date: 21 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Ambulance location and relocation models. ⋮ Time dependent multiobjective best path for multimodal urban routing ⋮ Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem ⋮ Shortest path reoptimization vs resolution from scratch: a computational comparison ⋮ Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ An exact method for the biobjective shortest path problem for large-scale road networks ⋮ Dynamic shortest path problems with time-varying costs ⋮ Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms ⋮ A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path ⋮ Issues in the implementation of the DSD algorithm for the traffic assignment problem ⋮ Object modeling and path computation for multimodal travel systems ⋮ A comparison of heuristic best-first algorithms for bicriterion shortest path problems ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ The dial-a-ride problem: Models and algorithms ⋮ Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge ⋮ How to find good night train connections ⋮ A directed hypergraph model for random time dependent shortest paths ⋮ Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints ⋮ Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem ⋮ Optimization and sustainable development
This page was built for publication:
