Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)

DOI10.1016/J.COR.2024.106530MaRDI QIDQ6551139

Somayeh Sohrabi, Koorush Ziarati, Morteza Keshtkaran

Publication date: 6 June 2024

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

shared mobility systemsdial-a-ride problem (DARP)eight-step procedurefeasibility checking procedurepickup and delivery problem (PDP)

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• An adaptive large neighborhood search heuristic for the share-a-ride problem
• A note on ``Efficient feasibility testing for dial-a-ride problems
• Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Typology and literature review for dial-a-ride problems
• Efficient feasibility testing for dial-a-ride problems
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
• The dial-a-ride problem: Models and algorithms
• Variable neighborhood search for the dial-a-ride problem
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
• A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Feasibility Testing for Dial-a-Ride Problems
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem

Related Items (1)

A ride time-oriented scheduling algorithm for dial-a-ride problems

This page was built for publication: Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)

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