Pages that link to "Item:Q2815449"
From MaRDI portal
The following pages link to A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem (Q2815449):
Displaying 16 items.
- An ant colony system for responsive dynamic vehicle routing (Q319660) (← links)
- Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem (Q2433528) (← links)
- Routing by ranking: a link analysis method for the constrained dial-a-ride problem (Q2450754) (← links)
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082) (← links)
- Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
- Scheduling issues in vehicle routing (Q5963106) (← links)
- Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed (Q6048503) (← links)
- Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems (Q6065891) (← links)
- Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system (Q6069239) (← links)
- Graph representation of the fixed route dial-a-ride problem (Q6090221) (← links)
- A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs (Q6106965) (← links)
- The Synchronized Dynamic Vehicle Dispatching Problem (Q6160388) (← links)
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP) (Q6551139) (← links)
- New optimization guidance for dynamic dial-a-ride problems (Q6606681) (← links)
