Routing by ranking: a link analysis method for the constrained dial-a-ride problem

DOI10.1016/J.ORL.2013.09.007MaRDI QIDQ2450754zbMATH OpenOpenAlexFDO

Authors Lauri Häme, Harri Hakula

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

zbMATH Keywords

dial-a-ride problemhitslink analysistopological ordering

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• An effective and fast heuristic for the dial-a-ride problem
• A matheuristic for the dial-a-ride problem
• HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

Cites work

• 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
• 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 library of local search heuristics for the vehicle routing problem
• A Survey of Eigenvector Methods for Web Information Retrieval
• 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
• Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
• Efficient feasibility testing for dial-a-ride problems
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• scientific article; zbMATH DE number 1303610 (Why is no real title available?)
• Introduction to algorithms
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Self-Avoiding Paths and the Adjacency Matrix of a Graph
• Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
• The counting complexity of a simple scheduling problem
• The pickup and delivery problem with time windows

Cited in

(1)

• Typology and literature review for dial-a-ride problems

Describes a project that uses

Uses Software

• VRPH

This page was built for publication: Routing by ranking: a link analysis method for the constrained dial-a-ride problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450754)