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 QIDQ6572891FDOQ6572891

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)

zbMATH Keywords

integer programmingtime-dependentvehicle routing problemmulti-tripbenders decomposition

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

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

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)