Scheduling Large-Scale Advance-Request Dial-A-Ride Systems

DOI10.1080/01966324.1986.10737199MaRDI QIDQ3771951zbMATH OpenOpenAlexWikidataFDO

Authors Harilaos N. Psaraftis

Publication date 1986

Published in American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01966324.1986.10737199

zbMATH Keywords

large-scale advance-request dial-a-ride systemstime windowvehicle routingworst-case considerations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• A matheuristic 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 SINGLE VEHICLE DIAL-A-RIDE PROBLEM
• An effective and fast heuristic for the dial-a-ride problem

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Approximate Traveling Salesman Algorithms
• k-interchange procedures for local search in a precedence-constrained routing problem
• Some Examples of Difficult Traveling Salesman Problems
• Worst-Case Analysis of Heuristic Algorithms

Cited in

(6)

• Perturbation heuristics for the pickup and delivery traveling salesman problem
• 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
• Routing problems: A bibliography
• Recovery management for a dial-a-ride system with real-time disruptions
• An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services

This page was built for publication: Scheduling Large-Scale Advance-Request Dial-A-Ride Systems

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