Pages that link to "Item:Q2499162"
From MaRDI portal
The following pages link to Heuristic shortest path algorithms for transportation applications: state of the art (Q2499162):
Displaying 15 items.
- A hybrid algorithm for constrained order packing (Q301159) (← links)
- Models and algorithms for network reduction (Q320811) (← links)
- Modeling synergies in multi-criteria supplier selection and order allocation: an application to commodity trading (Q323425) (← links)
- An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem (Q652866) (← links)
- A new bidirectional search algorithm with shortened postprocessing (Q1026755) (← links)
- Dynamic origin-to-destination routing of wirelessly connected, autonomous vehicles on a congested network (Q1620639) (← links)
- A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs (Q1665401) (← links)
- Perturbing consensus for complexity: a finite-time discrete biased min-consensus under time-delay and asynchronism (Q1679889) (← links)
- Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network (Q1717836) (← links)
- A novel chaotic particle swarm optimization algorithm for parking space guidance (Q1793252) (← links)
- Objectives and methods in multi-objective routing problems: a survey and classification scheme (Q2029300) (← links)
- Genetic algorithms in supply chain management: a critical analysis of the literature (Q2359911) (← links)
- Speeding up Martins' algorithm for multiple objective shortest path problems (Q2441362) (← links)
- A novel ant colony optimization algorithm for the shortest-path problem in traffic networks (Q5024603) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
