On solving the time window assignment vehicle routing problem via iterated local search

DOI10.1007/978-3-030-63072-0_18zbMath1479.90031OpenAlexW3135065614MaRDI QIDQ2056911

Mayron César O. Moreira, Giorgio Zucchi, Manuel Iori, Lucas Burahem Martins

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-63072-0_18

zbMATH Keywords

mathematical modelvehicle routing problemiterated local searchtime window assignment

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• The discrete time window assignment vehicle routing problem
• A rich vehicle routing problem dealing with perishable food: a case study
• An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
• A branch-and-cut algorithm for the time window assignment vehicle routing problem
• A hybrid iterated local search heuristic for the maximum weight independent set problem
• A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• A unified solution framework for multi-attribute vehicle routing problems
• Vehicle Routing
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A unified tabu search heuristic for vehicle routing problems with time windows

This page was built for publication: On solving the time window assignment vehicle routing problem via iterated local search