A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem

DOI10.1016/J.COR.2021.105649MaRDI QIDQ2669775zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 9 March 2022

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

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

zbMATH Keywords

Benders decompositionDantzig-Wolfe decompositiondial-a-ride problemtime discretisationtransportationvariable fixingvehicle routing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

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

Cites work

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A branch-and-price-and-check model for the vehicle routing problem with location congestion
• A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A note on ``Efficient feasibility testing for dial-a-ride problems
• Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
• Branch-and-price: Column generation for solving huge integer programs
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Dynamic transportation of patients in hospitals
• Efficient feasibility testing for dial-a-ride problems
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
• scientific article; zbMATH DE number 2084694 (Why is no real title available?)
• Industrial and tramp ship routing problems: closing the gap for real-scale instances
• Integer Programming Formulation of Traveling Salesman Problems
• Logic-based Benders decomposition
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• On the one-to-one pickup-and-delivery problem with time windows and trailers
• Partitioning procedures for solving mixed-variables programming problems
• Scheduling and routing of automated guided vehicles: A hybrid approach
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• The Continuous-Time Service Network Design Problem
• The General Pickup and Delivery Problem
• The pickup and delivery problem with time windows and handling operations

Cited in

(12)

• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
• A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs
• Design of survivable wireless backhaul networks with reliability considerations
• The dial-a-ride problem with limited pickups per trip
• Algorithms for pickup and delivery problems with hours of service constraints
• The dial-a-tour problem
• Adaptive large neighborhood search for drayage routing problems involving longer combination vehicles
• A new effective heuristic for the prisoner transportation problem
• A robust optimization approach to flow decomposition
• Fragment-based solution of two skip pickup and delivery problems

This page was built for publication: A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem

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