Two-echelon collaborative routing problem with heterogeneous crowd-shippers

DOI10.1016/j.cor.2023.106389OpenAlexW4385987993MaRDI QIDQ6068714

Ho Young Jeong, Byeongmok Kim, Seokcheon Lee

Publication date: 13 November 2023

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

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106389

zbMATH Keywords

mixed-integer linear programmingadaptive large neighborhood searchlast-mile deliverycrowd-shippingparcel transfertwo echelon routing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• The vehicle routing problem with occasional drivers
• A vehicle routing problem with flexible time windows
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
• A general heuristic for vehicle routing problems
• Approximative solutions to the bicriterion vehicle routing problem with time windows
• A generalized bin packing problem for parcel delivery in last-mile logistics
• The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
• Workforce planning for O2O delivery systems with crowdsourced drivers
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand
• An exact solution method for the capacitated item-sharing and crowdshipping problem
• Crowd-shipping with time windows and transshipment nodes
• Sustainability SI: logistics cost and environmental impact analyses of urban delivery consolidation strategies
• A Method for Solving Traveling-Salesman Problems

This page was built for publication: Two-echelon collaborative routing problem with heterogeneous crowd-shippers