A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group

DOI10.1002/net.22178OpenAlexW4386000861MaRDI QIDQ6180040

No author found.

Publication date: 18 January 2024

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

large-scale instancesasymmetric single truck and trailer routing problem with satellite depotsgranular iterated local searchpark and looppostal deliveries

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• A survey of recent research on location-routing problems
• A survey on two-echelon routing problems
• Location-routing: issues, models and methods
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
• The doubly open park-and-loop routing problem
• A progressive filtering heuristic for the location-routing problem and variants
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• TSPLIB—A Traveling Salesman Problem Library
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Small and large neighborhood search for the park-and-loop routing problem with parking selection

This page was built for publication: A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group