Pages that link to "Item:Q3351111"
From MaRDI portal
The following pages link to HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM (Q3351111):
Displaying 11 items.
- Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- Pricing and allocation algorithm designs in dynamic ridesharing system (Q2283011) (← 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)
- An effective and fast heuristic for the dial-a-ride problem (Q2644373) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (Q3392004) (← links)
- Constrained TSP and low-power computing (Q5096929) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)