The flexible and real-time commute trip sharing problems

DOI10.1007/S10601-020-09310-5zbMATH Open1479.90092OpenAlexW3075613216MaRDI QIDQ823767FDOQ823767

Authors: 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

Recommendations

• Modeling and solving the multimodal car- and ride-sharing problem
• Approximate ridesharing of personal vehicles problem
• Algorithmic Analysis for Ridesharing of Personal Vehicles
• Efficient algorithms for ridesharing of personal vehicles
• Algorithmic analysis for ridesharing of personal vehicles

zbMATH Keywords

vehicle routing problemrobust planningride sharingscenario sampling

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Real-time ride-sharing substitution service in multi-modal public transport using buckets
• Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach
• Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration

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

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