A branch-and-cut algorithm for a realistic dial-a-ride problem

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Transportation Research Part B-methodological

• Publication date

  2015-11-01

• Fields of study

  Mathematics, Engineering

• Identifiers
  DOI 10.1016/J.TRB.2015.05.009
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals

  2017cited by this paper
• Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem

  2015cited by this paper
• A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity

  2015cited by this paper
• A memetic algorithm for the patient transportation problem

  2015cited by this paper
• Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots

  2014cited by this paper
• The heterogeneous pickup and delivery problem with configurable vehicle capacity

  2013cited by this paper
• A Granular Tabu Search algorithm for the Dial-a-Ride Problem

  2013cited by this paper
• Combining multicriteria analysis and tabu search for dial-a-ride problems

  2013cited by this paper
• A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration

  2013cited by this paper
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints

  2012cited by this paper
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows

  2011cited by this paper
• Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem

  2011cited by this paper
• Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows

  2009cited by this paper
• A survey on pickup and delivery problems

  2008cited by this paper
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

  2008cited by this paper
• A dial-a-ride problem for client transportation in a health-care organization

  2007cited by this paper
• A rejected-reinsertion heuristic for the static Dial-A-Ride Problem

  2007cited by this paper
• Metaheuristics for the vehicle routing problem with loading constraints

  2007cited by this paper
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

  2006cited by this paper
• An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

  2006cited by this paper
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem

  2006cited by this paper
• A Branch and Cut method for the Capacitated Location-Routing Problem

  2006cited by this paper
• Reachability cuts for the vehicle routing problem with time windows

  2006cited by this paper
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints

  2006cited by this paper
• The dial-a-ride problem: models and algorithms

  2006cited by this paper
• A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows

  2005cited by this paper
• Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem

  2004cited by this paper
• A new branch-and-cut algorithm for the capacitated vehicle routing problem

  2004cited by this paper
• A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows

  2004cited by this paper
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows

  2003cited by this paper
• The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms

  2003cited by this paper
• Hybrid scheduling methods for paratransit operations

  2003cited by this paper
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows

  2002cited by this paper
• A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem

  2002cited by this paper
• A metaheuristic for the pickup and delivery problem with time windows

  2001cited by this paper
• Modelling and optimizing dynamical dial-a-ride problems

  2001cited by this paper
• Solving the pickup and delivery problem with time windows using reactive tabu search

  2000cited by this paper
• Genetic Algorithm for a Pickup and Delivery Problem with Time Windows

  2000cited by this paper
• Separating capacity constraints in the CVRP using tabu search

  1998cited by this paper
• Drive: Dynamic Routing of Independent Vehicles

  1998cited by this paper
• The pickup and delivery problem: Faces and branch-and-cut algorithm

  1997cited by this paper
• Heuristic Algorithms for the Handicapped Persons Transportation Problem

  1997cited by this paper
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows

  1997cited by this paper
• Fast Local Search Algorithms for the Handicapped Persons Transportation Problem

  1996cited by this paper
• The precedence-constrained asymmetric traveling salesman polytope

  1995cited by this paper
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives

  1995cited by this paper
• The General Pickup and Delivery Problem

  1995cited by this paper
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

  1991cited by this paper
• The Pickup and Delivery Problem with Time Windows

  1989cited by this paper
• A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows

  1986cited by this paper
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows

  1984cited by this paper
• An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows

  1983cited by this paper
• A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem

  1980cited by this paper

• On-demand DAR system considering traffic dynamics and network partitioning

  2026cites this paper
• Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem

  2025cites this paper
• Dynamic electric vehicle fleets management problem for multi-service platforms with integrated ride-hailing, on-time delivery, and vehicle-to-grid services

  2025cites this paper
• Joint optimization of multi-trip vehicle scheduling, passenger assignment, and timetable for on-demand customized bus services

  2025cites this paper
• Enhancing shared mobility via connected vehicle-driven dispatch and dynamic pricing

  2025cites this paper
• Solving the equity-aware dial-a-ride problem using an exact branch-cut-and-price algorithm

  2025cites this paper
• Optimizing Asia-Europe container network: The Suez Canal and Cape of Good Hope routes in a changing world

  2025cites this paper
• On-demand transport service evaluation considering the impact of traffic congestion: a real case study

  2025cites this paper
• On-demand transportation system for cross-state abortion travel: A dual dial-a-ride problem

  2025cites this paper
• The generator distribution problem for base stations during emergency power outage: A branch-and-price-and-cut approach

  2024cites this paper
• Empowering MetroAccess Service with Nested Decomposition and Service Type Integration

  2024cites this paper
• Effects of COVID-19 on flex route transit utilization: An interrupted time series analysis

  2024cites this paper
• An exact branch-and-price-and-cut algorithm for a practical and large-scale dial-a-ride problem

  2024cites this paper
• An iterative method for integrated hump sequencing, train makeup, and classification track assignment in railway shunting yard

  2024cites this paper
• Dynamic tugboat deployment and scheduling with stochastic and time-varying service demands

  2024cites this paper
• A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions

  2024cites this paper
• An exact algorithm for the multi-trip vehicle routing problem with time windows and multi-skilled manpower

  2024cites this paper
• Optimizing routing and scheduling of shared autonomous electric taxis considering capacity constrained parking facilities

  2024cites this paper
• A scalable combinatorial benders decomposition for the Stochastic Dial-a-Ride Problem

  2024cites this paper
• A ridesharing routing problem for airport riders with electric vehicles

  2024cites this paper
• Examining individuals’ adoption of flex route transit

  2024cites this paper
• The rich heterogeneous dial-a-ride problem with trip time prediction

  2024cites this paper
• A linearly decreasing deterministic annealing algorithm for the multi-vehicle dial-a-ride problem

  2024cites this paper
• Dial-a-Ride Problem Considering Urban Traffic Dynamics in Multi-Reservoir Systems

  2024cites this paper
• Flexible vehicle scheduling with precedence constraints for tourists

  2023cites this paper
• Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers

  2023cites this paper
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems

  2023cites this paper
• A dynamic graph-based many-to-one ride-matching approach for shared autonomous electric vehicles

  2023cites this paper
• A Survey of Machine Learning-Based Ride-Hailing Planning

  2023cites this paper
• Complexity, algorithmic, and computational aspects of a dial-a-ride type problem

  2023cites this paper
• Robust Service and Charging Plan for Dynamic Electric Demand-Responsive Transit Systems

  2023cites this paper
• Decentralized multi-agent approach based on A* algorithm for on-demand transport problem

  2023cites this paper
• A data-driven game theoretic multi-objective hybrid algorithm for the Dial-A-Ride Problem with multiple time windows

  2023cites this paper
• A Linearly Decreasing Deterministic Annealing Algorithm for the Multivehicle Dial-a-Ride Problem

  2023cites this paper
• Multi-Trip Multi-Trailer Drop-and-Pull Container Drayage Problem

  2022cites this paper
• Interrelated trips in the rural dial-a-ride problem with autonomous vehicles

  2022cites this paper
• A Data-Driven Forecasting and Solution Approach for the Dial-A-Ride Problem with Time Windows

  2022cites this paper
• Space-time clustering-based method to optimize shareability in real-time ride-sharing

  2022cites this paper
• A branch-and-price algorithm for a routing problem with inbound and outbound requests

  2022cites this paper
• Electric demand-responsive transit routing with opportunity charging strategy

  2022cites this paper
• Integration of conventional and customized bus services: An empirical study in Beijing

  2022cites this paper
• Choice-driven dial-a-ride problem for demand responsive mobility service

  2022cites this paper
• A branch-cut-and-price algorithm for a dial-a-ride problem with minimum disease-transmission risk

  2022cites this paper
• Clustering-based iterative heuristic framework for a non-emergency patients transportation problem

  2022cites this paper
• Flex-route demand response transit scheduling based on station optimization

  2022cites this paper
• Offline Vehicle Routing Problem with Online Bookings: A Novel Problem Formulation with Applications to Paratransit

  2022cites this paper
• Deep Reinforcement Learning for Crowdsourced Urban Delivery

  2021cites this paper
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm

  2021cites this paper
• The EMS vehicle patient transportation problem during a demand surge

  2021cites this paper
• Graph-based many-to-one dynamic ride-matching for shared mobility services in congested networks

  2021cites this paper
• Event-based MILP models for ride-hailing applications

  2021cites this paper
• Integrated Optimization for Commuting Customized Bus Stop Planning, Routing Design, and Timetable Development With Passenger Spatial-Temporal Accessibility

  2021cites this paper
• A branch-and-cut algorithm for the vehicle routing problem with drones

  2021cites this paper
• Patient Transport and Mobile Health Workforce: Framework and Research Perspectives

  2021cites this paper
• A review on the electric vehicle routing problems: Variants and algorithms

  2021cites this paper
• Zonal-based flexible bus service under elastic stochastic demand

  2021cites this paper
• A generalized ride-matching approach for sustainable shared mobility

  2021cites this paper
• Diverting bus service from conventional to customized: An empirical study in Beijing

  2021cites this paper
• The vehicle routing problem with speed optimization for shared autonomous electric vehicles service

  2021cites this paper
• Design of an Urban Transport Network for the Optimal Location of Bus Stops in a Smart City Based on a Big Data Model and Spider Monkey Optimization Algorithm

  2021cites this paper
• A branch-and-cut algorithm for flexible vehicle scheduling problem in scenic areas

  2021cites this paper
• Event-based MILP models for ridepooling applications

  2021cites this paper
• An Efficient Solving Method to Vehicle and Passenger Matching Problem for Sharing Autonomous Vehicle System

  2020cites this paper
• Customized bus route design with pickup and delivery and time windows: Model, case study and comparative analysis

  2020cites this paper
• Barriers and opportunities for paratransit users to adopt on-demand micro transit

  2020cites this paper
• Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows

  2020cites this paper
• Nonprofit peer-to-peer ridesharing optimization

  2020cites this paper
• Tugboat scheduling for container ports

  2020cites this paper
• MATE: A Memory-Augmented Time-Expansion Approach for Optimal Trip-Vehicle Matching and Routing in Ride-Sharing

  2020cites this paper
• Disturbance management for vehicle routing with time window changes

  2020cites this paper
• A Dynamic Taxi Ride Sharing System Using Particle Swarm Optimization

  2020cites this paper
• A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem

  2019cites this paper
• A pricing strategy for sharing autonomous vehicle system

  2019cites this paper
• Operational Design for a Real-Time Flexible Transit System Considering Passenger Demand and Willingness to Pay

  2019cites this paper
• Solving the first‐mile ridesharing problem using autonomous vehicles

  2019cites this paper
• Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem

  2019cites this paper
• Multi-Objective Model for Dial-a-Ride Problems with Vehicle Speed Considerations

  2019cites this paper
• On the needs for MaaS platforms to handle competition in ridesharing mobility

  2019cites this paper
• A survey of models and algorithms for optimizing shared mobility

  2019cites this paper
• A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing

  2019cites this paper
• A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation

  2019cites this paper
• Real-time city-scale ridesharing via linear assignment problems

  2019cites this paper
• An Adaptive Large Neighborhood Search Heuristic for the Green Dial‐a‐Ride Problem

  2019cites this paper
• A scalable non-myopic dynamic dial-a-ride and pricing problem for competitive on-demand mobility systems

  2018cites this paper
• The dial-a-ride problem with electric vehicles and battery swapping stations

  2018cites this paper
• A survey of dial-a-ride problems: Literature review and recent developments

  2018cites this paper
• A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers

  2018cites this paper
• Smart mobility: Evaluation of demand-responsive transit systems in chiayi city

  2017cites this paper
• Contributions à la résolution du transport à la demande fondées sur les systèmes multi-agents. (Contributions to on-demand transport resolution based on multi-agent systems)

  2017cites this paper
• A data driven hybrid heuristic for the dial-a-ride problem with time windows

  2017cites this paper
• Typology and literature review for dial-a-ride problems

  2017cites this paper
• A hybrid Genetic Algorithm for the Heterogeneous Dial-A-Ride Problem

  2017cites this paper
• Heuristic Approaches to solve a Generalized Dial-a-Ride Problem Applied to Car-pooling

  2016cites this paper
• Vehicle Routing Problems with Time Windows and Convex Node Costs

  2016cites this paper
• Designing robust schedule coordination scheme for transit networks with safety control margins

  2016influential citation
• The electric vehicle touring problem

  2016cites this paper
• A multi-period dial-a-ride problem with driver consistency

  2016cites this paper
• Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem

  2016cites this paper
• Improving Public Transport Accessibility via Provision of a Dial-a-Ride Shuttle-Bus Service , Incorporating Passenger Travel-Mode Heterogeneity

  2015cites this paper