Deep infeasibility exploration method for vehicle routing problems

DOI10.1007/978-3-031-04148-8_5MaRDI QIDQ2163783zbMATH OpenOpenAlexFDO

Authors Piotr Beling, Piotr Cybula, Przemysław Pełka, Marek Rogalski, Piotr Sielski, 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

combinatorial optimizationmetaheuristicstransportationvehicle routing problem

Mathematics Subject Classification ID

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

Recommendations

• Deep policy dynamic programming for vehicle routing problems
• An exact solution framework for a broad class of vehicle routing problems
• A survey of vehicle routing optimization problems and solution methods
• An inverse optimization approach for a capacitated vehicle routing problem
• Parallel iterative search methods for vehicle routing problems
• Solving real-world vehicle routing problems in uncertain environments
• Vehicle routing with a sparse feasibility graph
• Applying an intensification strategy on vehicle routing problem

Cites work

• scientific article; zbMATH DE number 6676558 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 1452992 (Why is no real title available?)
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• A new tabu search algorithm for the vehicle routing problem with backhauls
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Future paths for integer programming and links to artificial intelligence
• Metaheuristics. From design to implementation.
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Review of properties of different precedence graphs for scheduling problems
• The case for strategic oscillation
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art

Describes a project that uses

Uses Software

• VRP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163783)