Heuristic optimization for multi-depot vehicle routing problem in ATM network model

DOI10.1007/978-3-030-56534-3_9zbMath1497.90045OpenAlexW3161465705MaRDI QIDQ2087124

Saku Kukkonen, Valeria Platonova, Elena Gubar

Publication date: 26 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-56534-3_9

zbMATH Keywords

location problemheuristic optimizationevolutionary computationencashment problemMDLRPMDVRP

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Uses Software

• VRP
• CVRPSP

Cites Work

• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• The multi-depot vehicle routing problem with inter-depot routes
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
• Approximation schemes for NP-hard geometric optimization problems: a survey
• Handbook of transportation science.
• Heuristic solutions to multi-depot location-routing problems
• Efficiently solving very large-scale routing problems
• A genetic algorithm for the vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• The Truck Dispatching Problem
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Introduction to evolutionary computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Heuristic optimization for multi-depot vehicle routing problem in ATM network model