Routing by ranking: a link analysis method for the constrained dial-a-ride problem
From MaRDI portal
Publication:2450754
DOI10.1016/j.orl.2013.09.007zbMath1287.90011OpenAlexW2029164359MaRDI QIDQ2450754
Publication date: 15 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2013.09.007
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
- A library of local search heuristics for the vehicle routing problem
- The counting complexity of a simple scheduling problem
- The pickup and delivery problem with time windows
- Efficient feasibility testing for dial-a-ride problems
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A Survey of Eigenvector Methods for Web Information Retrieval
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
- Self-Avoiding Paths and the Adjacency Matrix of a Graph
