Pages that link to "Item:Q1866982"
From MaRDI portal
The following pages link to Efficient feasibility testing for dial-a-ride problems (Q1866982):
Displayed 18 items.
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem (Q296680) (← links)
- A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
- The dial-A-ride problem with transfers (Q336745) (← links)
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
- A note on ``Efficient feasibility testing for dial-a-ride problems'' (Q613336) (← links)
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh (Q631208) (← links)
- The flexible and real-time commute trip sharing problems (Q823767) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows (Q2433432) (← links)
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem (Q2433528) (← links)
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers (Q2450604) (← links)
- Routing by ranking: a link analysis method for the constrained dial-a-ride problem (Q2450754) (← links)
- The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082) (← links)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
- Graph representation of the fixed route dial-a-ride problem (Q6090221) (← links)