Notes on the single route lateral transhipment problem
From MaRDI portal
Recommendations
- An efficient algorithm for the transshipment along a single road problem
- The single and multi-item transshipment problem with fixed transshipment costs
- An extension to the single bottleneck transportation problem
- A study of the bottleneck single source transportation problem
- scientific article; zbMATH DE number 64776
- The stochastic transportation problem with single sourcing
- The inventory-routing problem with transshipment
- A note on the quickest minimum cost transshipment problem
Cites work
- Heuristics for the multi-period orienteering problem with multiple time windows
- Network flows. Theory, algorithms, and applications.
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- The prize collecting traveling salesman problem
- The team orienteering problem
Cited in
(5)- A concise guide to existing and emerging vehicle routing problem variants
- Computing the value of transshipment flexibility in distribution networks
- The single and multi-item transshipment problem with fixed transshipment costs
- Winning the race to customers with micro-fulfillment centers: an approach for network planning in quick commerce
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
This page was built for publication: Notes on the single route lateral transhipment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276506)
