Pages that link to "Item:Q2644373"
From MaRDI portal
The following pages link to An effective and fast heuristic for the dial-a-ride problem (Q2644373):
Displaying 28 items.
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh (Q631208) (← links)
- An optimization model and a solution algorithm for the many-to-many car pooling problem (Q763101) (← links)
- Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
- The stop number minimization problem: complexity and polyhedral analysis (Q1661860) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- Efficient feasibility testing for dial-a-ride problems (Q1866982) (← links)
- Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm (Q2029308) (← links)
- Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
- Dynamic transportation of patients in hospitals (Q2267375) (← links)
- Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking (Q2293789) (← 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 hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem (Q2632513) (← links)
- Variable neighborhood search for the dial-a-ride problem (Q2655965) (← links)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- Modeling and optimizing dynamic dial-a-ride problems (Q2767691) (← links)
- Computer-aided complexity classification of dial-a-ride problems (Q2890414) (← links)
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
- HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM (Q3351111) (← links)
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (Q3392004) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918727) (← links)
- Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
- Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed (Q6048503) (← links)
- Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
- Branch and price algorithm for route optimization on customized bus service (Q6546992) (← links)