An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services

DOI10.1007/S10951-006-0324-6zbMath1154.90482OpenAlexW2137456292MaRDI QIDQ880577

Kurt Palmer, Maged M. Dessouky, Luca Quadrifoglio

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-006-0324-6

zbMATH Keywords

HybridScheduling HeuristicTransit

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Vehicle routing and scheduling of flex-route transit under a dynamic operating environment ⋮ Public transport for smart cities: recent innovations and future challenges ⋮ Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints ⋮ Designing the master schedule for demand-adaptive transit systems

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• Pickup and Delivery of Partial Loads with “Soft” Time Windows
• Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• The General Pickup and Delivery Problem

This page was built for publication: An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services