The flexible and real-time commute trip sharing problems

DOI10.1007/s10601-020-09310-5zbMath1479.90092OpenAlexW3075613216MaRDI QIDQ823767

Mohd. Hafiz Hasan, Pascal Van Hentenryck

Publication date: 16 December 2021

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-020-09310-5

zbMATH Keywords

vehicle routing problemrobust planningride sharingscenario sampling

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)

Cites Work

• A reoptimization algorithm for the shortest path problem with time windows
• The pickup and delivery problem with time windows
• Efficient feasibility testing for dial-a-ride problems
• Last-mile scheduling under uncertainty
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers

This page was built for publication: The flexible and real-time commute trip sharing problems