Dynamic crowdsourcing problem in urban-rural distribution using the learning-based approach

DOI10.1016/J.COR.2025.107292MaRDI QIDQ6861970zbMATH OpenFDO

Authors Zongcheng Zhang, Maoliang Ran, Yanru Chen, M. I. M. Wahab, M. J. Gao, Yangsheng Jiang

Publication date 10 February 2026

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2025.107292

zbMATH Keywords

anticipated future gainsdynamic crowdsourcing problemheat mappickup and deliveryvalue learning

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• Algorithms for the Assignment and Transportation Problems
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Deep policy dynamic programming for vehicle routing problems
• Deep Q-learning for same-day delivery with vehicles and drones
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Policy evaluation with temporal differences: a survey and comparison
• Reinforcement learning. An introduction
• Rolling optimal scheduling for urban parcel crowdsourced delivery with new order insertion
• Same-day delivery with fair customer service
• Solving large-scale dynamic vehicle routing problems with stochastic requests
• The dynamic dispatch waves problem for same-day delivery
• The online vehicle routing problem with occasional drivers
• The pickup and delivery problem with time windows and occasional drivers
• The vehicle routing problem with occasional drivers
• Variable neighbourhood search based on Metropolis criterion for crowdsourced delivery scheduling problem in dispatch model

Cited in

(1)

• The vehicle routing problem with driver scheduling

This page was built for publication: Dynamic crowdsourcing problem in urban-rural distribution using the learning-based approach

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