An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows

DOI10.1016/J.EJOR.2024.04.013MaRDI QIDQ6572891zbMATH OpenFDO

Authors Antonios Fragkogios, Yuzhuo Qiu, Georges K. Saharidis, Panos M. Pardalos

Publication date 16 July 2024

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2024.04.013

zbMATH Keywords

benders decompositioninteger programmingmulti-triptime-dependentvehicle routing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
• Accelerating Benders decomposition: multiple cuts via multiple solutions
• Accelerating Benders method using covering cut bundle generation
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem
• Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs
• Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model
• Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently
• scientific article; zbMATH DE number 3989085 (Why is no real title available?)
• scientific article; zbMATH DE number 2084694 (Why is no real title available?)
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Logic-based Benders decomposition
• Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints
• Multi-trip time-dependent vehicle routing problem with time windows
• Multicommodity Distribution System Design by Benders Decomposition
• Multicut Benders decomposition algorithm for process supply chain planning under uncertainty
• Partitioning procedures for solving mixed-variables programming problems
• Solution of a Large-Scale Traveling-Salesman Problem
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
• The Benders decomposition algorithm: a literature review
• Vehicle dispatching with time-dependent travel times

Cited in

(4)

• Logic-based benders decomposition methods for the distributed flexible job shop scheduling problem
• A two-echelon multi-trip vehicle routing problem with synchronization for an integrated water- and land-based transportation system
• Improving the efficiency of logic-based benders decomposition for p-batch scheduling problems with two-dimensional packing
• Comparing four MILP formulations for the time-dependent inventory routing problem with FIFO-compliant travel times

This page was built for publication: An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows

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