A branch-and-bound approach for a vehicle routing problem with customer costs

DOI10.1016/j.ejco.2020.100003zbMath1530.90112OpenAlexW3119934472MaRDI QIDQ6114901

Andreas Fischer, Guntram Scheithauer, Franziska Theurich

Publication date: 12 July 2023

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejco.2020.100003

zbMATH Keywords

branch-and-boundvehicle routing problemcustomer costsrailway maintenance scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• The traveling salesman. Computational solutions for RSP applications
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• A generalized bin packing problem for parcel delivery in last-mile logistics
• Algorithms for the Assignment and Transportation Problems
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Report of the Session on
• Vehicle Routing with Time Windows: Two Optimization Algorithms
• Time‐dependent traveling salesman problem–the deliveryman case
• Minimum Weighted Sum Bin Packing
• The traveling-salesman problem and minimum spanning trees: Part II
• Technical Note—Bounds for the Travelling-Salesman Problem

This page was built for publication: A branch-and-bound approach for a vehicle routing problem with customer costs