Pages that link to "Item:Q2632513"
From MaRDI portal
The following pages link to A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem (Q2632513):
Displaying 15 items.
- Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
- An adaptive large neighborhood search heuristic for the share-a-ride problem (Q342178) (← links)
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation (Q1652021) (← links)
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (Q1652211) (← links)
- A combinatorial auction for transportation matching service: formulation and adaptive large neighborhood search heuristic (Q1691664) (← links)
- Event-based MILP models for ridepooling applications (Q2140290) (← 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)
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
- Scheduling heterogeneous multi-load AGVs with battery constraints (Q2669605) (← links)
- A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints (Q5449876) (← links)
- The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment (Q6071075) (← links)