Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping

DOI10.1007/s11590-021-01833-xOpenAlexW4206522737MaRDI QIDQ6063502

Luigi Di Puglia Pugliese, Francesca Guerriero, Paola Festa, Daniele Ferone, Giusy Macrina

Publication date: 7 November 2023

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01833-x

zbMATH Keywords

vehicle routingreinforcement learningvariable neighborhood searchmachine learningcrowd-shipping

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• The vehicle routing problem with occasional drivers
• Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• Variable neighborhood search
• The vehicle routing problem with dynamic occasional drivers
• Variable neighborhood search: basics and variants
• On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs
• \({\mathcal Q}\)-learning
• The pickup and delivery problem with time windows and occasional drivers
• The online vehicle routing problem with occasional drivers
• Crowd-shipping with time windows and transshipment nodes
• Learning variable neighborhood search for a scheduling problem with time windows and rejections
• A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Extending time‐to‐target plots to multiple instances

This page was built for publication: Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping