A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location

DOI10.1002/net.22028OpenAlexW3135343775MaRDI QIDQ6065845

Unnamed Author, Unnamed Author, Unnamed Author, Miguel F. Anjos

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22028

zbMATH Keywords

heuristicsvehicle routingtime windowsbranch-and-cutfleet sizingmultiple tripssubtour elimination constraintsmultiple depots

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
• An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
• The fleet size and mix vehicle routing problem
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
• The multi-trip vehicle routing problem
• The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Finding Groups in Data
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Vehicle Routing Problem with Time Windows

This page was built for publication: A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location