The share-a-ride problem: people and parcels sharing taxis

DOI10.1016/j.ejor.2014.03.003zbMath1338.90055OpenAlexW1972731897MaRDI QIDQ296683

Tom Van Woensel, Baoxiang Li, Dmitry Krushinsky, Hajo A. Reijers

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/the-sharearide-problem--people-and-parcels-sharing-taxis(2caa2560-be3d-41b9-9b67-fc665b908d62).html

zbMATH Keywords

transportationtaxifreight insertion problemmulti-commodityshare-a-ride problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items

Collaborative urban transportation: recent advances in theory and practice, Simulated annealing heuristic for the general share-a-ride problem, Sustainable operations, The vehicle routing problem with occasional drivers, An adaptive large neighborhood search heuristic for the share-a-ride problem, Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles, A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem, A data-driven matching algorithm for ride pooling problem, Crowdsourced humanitarian relief vehicle routing problem, Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers, Smart and sustainable city logistics: design, consolidation, and regulation, Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand, An optimization model for freight transport using urban rail transit, The pickup and delivery problem with time windows and occasional drivers, Modeling and solving the multimodal car- and ride-sharing problem, Last-Mile Shared Delivery: A Discrete Sequential Packing Approach

Cites Work

• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Optimization for dynamic ride-sharing: a review
• Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints