Solving a selective dial-a-ride problem with logic-based Benders decomposition

DOI10.1016/j.cor.2018.03.008zbMath1458.90131OpenAlexW2793040688WikidataQ130065938 ScholiaQ130065938MaRDI QIDQ1652651

Martin Georg Riedler, Günther R. Raidl

Publication date: 11 July 2018

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

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

zbMATH Keywords

transportationdial-a-ride problemlogic-based Benders decompositionbranch-and-checkcombinatorial Benders cuts

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Constraint programming and operations research ⋮ Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms ⋮ Network scheduling problem with cross-docking and loading constraints ⋮ A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem ⋮ A data-driven matching algorithm for ride pooling problem ⋮ Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling ⋮ Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition ⋮ Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems ⋮ Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems ⋮ Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Multi-warehouse package consolidation for split orders in online retailing ⋮ Logic-based Benders decomposition algorithm for contamination detection problem in water networks

Uses Software

• Gecode
• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Logic-based Benders decomposition
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
• The multi-vehicle profitable pickup and delivery problem
• The dial-a-ride problem: Models and algorithms
• Generalized Benders decomposition
• Boosting an exact logic-based Benders decomposition approach by variable neighborhood search
• An effective and fast heuristic for the dial-a-ride problem
• Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
• The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Planning and Scheduling by Logic-Based Benders Decomposition
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Solving a selective dial-a-ride problem with logic-based Benders decomposition