The dial-a-ride problem with private fleet and common carrier

DOI10.1016/J.COR.2022.105933MaRDI QIDQ2676338zbMATH OpenOpenAlexFDO

Authors Cleder M. Schenekemberg, A. A. Chaves, Leandro C. Coelho, Thiago A. Guimarães, Gustavo G. Avelino

Publication date 27 September 2022

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

Full work available at URL https://doi.org/10.1016/j.cor.2022.105933

zbMATH Keywords

branch-and-cutBRKGAcommon carrierdial-a-ridemachine learningprivate fleet

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• The dial-A-ride problem with transfers
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem

Cites work

• A biased random-key genetic algorithm for the unequal area facility layout problem
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• A two-stage model for a day-ahead paratransit planning problem
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
• Collaborative urban transportation: recent advances in theory and practice
• Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Reachability cuts for the vehicle routing problem with time windows
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The pickup and delivery problem with time windows
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• The two-echelon inventory-routing problem with fleet management
• Variable neighborhood search for the dial-a-ride problem

Cited in

(12)

• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
• The dial-A-ride problem with transfers
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
• Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation
• Biased random-key genetic algorithms: a review
• The generator distribution problem for base stations during emergency power outage: a branch-and-price-and-cut approach
• Scheduling technicians and tasks through an adaptive multi-objective biased random-key genetic algorithm
• Beyond fifty years of vehicle routing: insights into the history and the future
• Optimizing transport operations in a hybrid mobility system for rural-urban transport

This page was built for publication: The dial-a-ride problem with private fleet and common carrier

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