Deep infeasibility exploration method for vehicle routing problems

DOI10.1007/978-3-031-04148-8_5zbMath1499.90018OpenAlexW4225805631MaRDI QIDQ2163783

Piotr Sielski, Piotr Beling, Piotr Cybula, Przemysław Pełka, Marek Rogalski, Andrzej Jaszkiewicz

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-04148-8_5

zbMATH Keywords

transportationcombinatorial optimizationmetaheuristicsvehicle routing problem

Mathematics Subject Classification ID

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

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• The case for strategic oscillation
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
• Future paths for integer programming and links to artificial intelligence
• Review of properties of different precedence graphs for scheduling problems
• A new tabu search algorithm for the vehicle routing problem with backhauls
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems

This page was built for publication: Deep infeasibility exploration method for vehicle routing problems