Graph representation of the fixed route dial-a-ride problem
From MaRDI portal
Recommendations
Cites work
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- A note on ``Efficient feasibility testing for dial-a-ride problems
- A reduction approach to the two-campus transport problem
- An empirical study of phase transitions in binary constraint satisfaction problems
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
- Computer-aided complexity classification of dial-a-ride problems
- Depth-first search is inherently sequential
- Efficient feasibility testing for dial-a-ride problems
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
- Introduction to algorithms.
- Parallel depth first search. I: Implementation
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
- The dial-a-ride problem: Models and algorithms
- Timing problems and algorithms: time decisions for sequences of activities
- Typology and literature review for dial-a-ride problems
Cited in
(2)
This page was built for publication: Graph representation of the fixed route dial-a-ride problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090221)