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

DOI10.1080/01966324.1986.10737199zbMath0633.90035OpenAlexW2053535761WikidataQ58295104 ScholiaQ58295104MaRDI QIDQ3771951

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

vehicle routingtime windowlarge-scale advance-request dial-a-ride systemsworst-case considerations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, Routing problems: A bibliography, An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services, Recovery management for a dial-a-ride system with real-time disruptions, Perturbation heuristics for the pickup and delivery traveling salesman problem, Efficient feasibility testing for dial-a-ride problems

Cites Work

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