Crowd-shipping with time windows and transshipment nodes
From MaRDI portal
Publication:2333154
DOI10.1016/j.cor.2019.104806zbMath1458.90117OpenAlexW2973520255WikidataQ114387832 ScholiaQ114387832MaRDI QIDQ2333154
Giusy Macrina, Gilbert Laporte, Luigi Di Puglia Pugliese, Francesca Guerriero
Publication date: 11 November 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.104806
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Solution approaches for the vehicle routing problem with occasional drivers and time windows ⋮ The probabilistic travelling salesman problem with crowdsourcing ⋮ Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting ⋮ A waste collection problem with service type option ⋮ Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping ⋮ Two-echelon collaborative routing problem with heterogeneous crowd-shippers ⋮ Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints ⋮ The online vehicle routing problem with occasional drivers
Cites Work
- Unnamed Item
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- The vehicle routing problem with occasional drivers
- A survey on two-echelon routing problems
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- Synchronizing vans and cargo bikes in a city distribution network
- New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
This page was built for publication: Crowd-shipping with time windows and transshipment nodes