Capacitated vehicle routing problem with a zone tariff

DOI10.1002/NET.70015MaRDI QIDQ6848856zbMATH OpenFDO

Authors Niklas Tuma, Manuel Ostermeier, Alexander Hübner

Publication date 5 March 2026

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/NET.70015

zbMATH Keywords

branch-and-checkdetour limitexact approachlogistic servicesvolume discount

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Mixed integer programming (90C11)

Cites work

• A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce
• A Dynamic Programming Approach to Sequencing Problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Delivery pattern and transportation planning in grocery retailing
• Design of Zone Tariff Systems in Public Transportation
• Full-load route planning for balancing bike sharing systems by logic-based benders decomposition
• scientific article; zbMATH DE number 2084694 (Why is no real title available?)
• Optimizing routing and delivery patterns with multi-compartment vehicles
• Partitioning procedures for solving mixed-variables programming problems
• Service location grouping and pricing in transportation: application in air cargo
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• The Benders decomposition algorithm: a literature review

This page was built for publication: Capacitated vehicle routing problem with a zone tariff

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