Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand
From MaRDI portal
Publication:2242299
DOI10.1016/j.ejor.2021.04.002zbMath1490.90037OpenAlexW3156807906MaRDI QIDQ2242299
Nils Boysen, Stefan Schwerdfeger, Simon Emde
Publication date: 9 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.04.002
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items
Online crowdsourced truck delivery using historical information, Two-echelon collaborative routing problem with heterogeneous crowd-shippers
Cites Work
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The share-a-ride problem: people and parcels sharing taxis
- The vehicle routing problem with occasional drivers
- Orienteering problem: a survey of recent variants, solution approaches and applications
- An adaptive large neighborhood search heuristic for the share-a-ride problem
- The orienteering problem: a survey
- Transforming asymmetric into symmetric traveling salesman problems
- Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post world net
- Dynamic pickup and delivery problems
- Transforming asymmetric into symmetric traveling salesman problems: Erratum
- Partitioning procedures for solving mixed-variables programming problems
- The team orienteering problem
- Collaborative urban transportation: recent advances in theory and practice
- Solving large batches of traveling salesman problems with parallel and distributed computing
- The Benders decomposition algorithm: a literature review
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
- Workforce planning for O2O delivery systems with crowdsourced drivers
- Optimization for dynamic ride-sharing: a review
- An exact solution method for the capacitated item-sharing and crowdshipping problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- A branch‐and‐cut algorithm for the Team Orienteering Problem
