A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets

DOI10.1007/978-3-030-43680-3_10zbMath1486.90044OpenAlexW3015576571MaRDI QIDQ2057127

Julia Rieck, Cornelius Rüther

Publication date: 8 December 2021

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

zbMATH Keywords

rich vehicle routingcombinatorial optimization modelmulti-depot pickups and deliveries

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows ⋮ Pickup and delivery problems with autonomous vehicles on rings ⋮ An a-priori parameter selection approach to enhance the performance of genetic algorithms solving pickup and delivery problems

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Rich vehicle routing problems: from a taxonomy to a definition
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
• Collaborative vehicle routing: a survey
• A grouping genetic algorithm for the pickup and delivery problem with time windows
• The General Pickup and Delivery Problem
• Introduction to evolutionary computing

This page was built for publication: A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets