Pages that link to "Item:Q1806861"

The following pages link to A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks (Q1806861):

Displaying 17 items.

• Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network (Q948645) (← links)
• Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms (Q976036) (← links)
• The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
• Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network (Q1630202) (← links)
• A capacity assessment approach for multi-modal transportation systems (Q1694828) (← links)
• Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms (Q1930787) (← links)
• The multiple shortest path problem with path deconfliction (Q2030451) (← links)
• Exact solutions to a carsharing pricing and relocation problem under uncertainty (Q2147083) (← links)
• Dynamic journeying under uncertainty (Q2253524) (← links)
• Object modeling and path computation for multimodal travel systems (Q2433544) (← links)
• Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) (← links)
• Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points (Q2664305) (← links)
• Time dependent multiobjective best path for multimodal urban routing (Q2883602) (← links)
• (Q4356887) (← links)
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
• Label correcting methods to solve multicriteria shortest path problems (Q5956971) (← links)
• Joint relocation and pricing in electric car-sharing systems (Q6554654) (← links)