- Home
- Publications
- Publication Search
- Publication Details
Title
An Exact Method for a First-Mile Ridesharing Problem
Authors
Keywords
-
Journal
TRANSPORTATION SCIENCE
Volume -, Issue -, Pages -
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Online
2023-09-29
DOI
10.1287/trsc.2022.0139
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- A branch-and-price algorithm for a routing problem with inbound and outbound requests
- (2022) Maxime Agius et al. COMPUTERS & OPERATIONS RESEARCH
- Proactive shuttle dispatching in large-scale dynamic dial-a-ride systems
- (2021) Amirmahdi Tafreshian et al. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
- A New Formulation for the Dial-a-Ride Problem
- (2021) Yannik Rist et al. TRANSPORTATION SCIENCE
- Automated taxis’ dial-a-ride problem with ride-sharing considering congestion-based dynamic travel times
- (2020) Xiao Liang et al. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
- Multi-depot multi-trip vehicle routing problem with time windows and release dates
- (2020) Lu Zhen et al. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
- Trip-based graph partitioning in dynamic ridesharing
- (2020) Amirmahdi Tafreshian et al. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
- Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models
- (2020) Guy Desaulniers et al. TRANSPORTATION SCIENCE
- A Bucket Graph–Based Labeling Algorithm with Application to Vehicle Routing
- (2020) Ruslan Sadykov et al. TRANSPORTATION SCIENCE
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- (2020) Igor Malheiros et al. COMPUTERS & OPERATIONS RESEARCH
- An algorithm for integrating peer-to-peer ridesharing and schedule-based transit system for first mile/last mile access
- (2020) Pramesh Kumar et al. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
- A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates
- (2020) Weibo Yang et al. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
- Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem
- (2019) Timo Gschwind et al. TRANSPORTATION SCIENCE
- A Ride-Sharing Problem with Meeting Points and Return Restrictions
- (2019) Wenyi Chen et al. TRANSPORTATION SCIENCE
- The electric autonomous dial-a-ride problem
- (2019) Claudia Bongiovanni et al. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
- Heterogeneous vehicle pickup and delivery problems: Formulation and exact solution
- (2019) Wei Sun et al. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
- Solving the first‐mile ridesharing problem using autonomous vehicles
- (2019) Shukai Chen et al. COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING
- Exact Branch-Price-and-Cut Algorithms for Vehicle Routing
- (2019) Luciano Costa et al. TRANSPORTATION SCIENCE
- Recovery management for a dial-a-ride system with real-time disruptions
- (2019) Célia Paquay et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Peak-Hour Vehicle Routing for First-Mile Transportation: Problem Formulation and Algorithms
- (2019) Guiyuan Jiang et al. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
- (2018) Timo Gschwind et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Compensation and profit distribution for cooperative green pickup and delivery problem
- (2018) Junwei Wang et al. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
- A survey of dial-a-ride problems: Literature review and recent developments
- (2018) Sin C. Ho et al. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
- Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines
- (2018) Veaceslav Ghilas et al. TRANSPORTATION SCIENCE
- A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation
- (2018) Zhixing Luo et al. TRANSPORTATION SCIENCE
- Ride-sharing with travel time uncertainty
- (2018) Jiancheng Long et al. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
- Bi-objective green ride-sharing problem: Model and exact method
- (2018) Yang Yu et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- (2017) Christian Tilk et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
- (2017) Thibaut Vidal OPERATIONS RESEARCH
- The morning commute problem with ridesharing and dynamic parking charges
- (2017) Rui Ma et al. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
- Novel dynamic formulations for real-time ride-sharing systems
- (2017) Ali Najmi et al. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
- Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
- (2016) David R. Morrison et al. Discrete Optimization
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- (2016) Marilène Cherkesly et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Reducing carbon emission of pickup and delivery using integrated scheduling
- (2016) Yang Yu et al. TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT
- The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates
- (2016) Diego Cattaruzza et al. TRANSPORTATION SCIENCE
- Multi-period Vehicle Routing Problem with Due dates
- (2015) Claudia Archetti et al. COMPUTERS & OPERATIONS RESEARCH
- Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem
- (2015) Timo Gschwind et al. TRANSPORTATION SCIENCE
- Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading
- (2015) Marilène Cherkesly et al. TRANSPORTATION SCIENCE
- A unified solution framework for multi-attribute vehicle routing problems
- (2013) Thibaut Vidal et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Ridesharing: The state-of-the-art and future directions
- (2013) Masabumi Furuhata et al. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
- Optimization for dynamic ride-sharing: A review
- (2012) Niels Agatz et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
- (2012) Said Dabia et al. TRANSPORTATION SCIENCE
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- (2011) Roberto Baldacci et al. OPERATIONS RESEARCH
- Tabu Search, Partial Elementarity, and Generalizedk-Path Inequalities for the Vehicle Routing Problem with Time Windows
- (2008) Guy Desaulniers et al. TRANSPORTATION SCIENCE
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- (2007) Giovanni Righini et al. NETWORKS
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- (2007) Mads Jepsen et al. OPERATIONS RESEARCH
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now