The flexible and real-time commute trip sharing problems

DOI10.1007/S10601-020-09310-5MaRDI QIDQ823767zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• 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
• A reoptimization algorithm for the shortest path problem with time windows
• Efficient feasibility testing for dial-a-ride problems
• Last-mile scheduling under uncertainty
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• The pickup and delivery problem with time windows

Cited in

(3)

• Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach
• Real-time ride-sharing substitution service in multi-modal public transport using buckets
• 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)