The single-vehicle two-echelon one-commodity pickup and delivery problem
From MaRDI portal
Publication:2027019
DOI10.1016/j.cor.2020.105152OpenAlexW3109585003MaRDI QIDQ2027019
Mercedes Landete, Hipólito Hernández-Pérez, Inmaculada Rodríguez-Martín
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105152
Related Items (1)
Cites Work
- The multiple vehicle pickup and delivery problem with LIFO constraints
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- Projections of the capacitated network loading problem
- Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- Exact solutions for the collaborative pickup and delivery problem
- Locating median cycles in networks
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- Facility location problems with user cooperation
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
This page was built for publication: The single-vehicle two-echelon one-commodity pickup and delivery problem
