Exact solutions for the collaborative pickup and delivery problem
From MaRDI portal
Publication:1787916
DOI10.1007/s10100-017-0503-xzbMath1397.90059OpenAlexW2768236495WikidataQ54942008 ScholiaQ54942008MaRDI QIDQ1787916
Richard F. Hartl, Philipp E. H. Salzmann, Margaretha Gansterer
Publication date: 5 October 2018
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-017-0503-x
Related Items (4)
The single-vehicle two-echelon one-commodity pickup and delivery problem ⋮ The collaborative consistent vehicle routing problem with workload balance ⋮ Emerging and innovative OR applications: a special issue in honor of Walter J. Gutjahr ⋮ The prisoners' dilemma in collaborative carriers' request selection
Uses Software
Cites Work
- Unnamed Item
- Operational transportation planning of freight forwarding companies in horizontal coalitions
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- Shipper collaboration
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- Dynamic pickup and delivery problems
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
- An algorithm for the traveling salesman problem with pickup and delivery customers
- Partitioning procedures for solving mixed-variables programming problems
- The pickup and delivery problem with time windows
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- Lane covering with partner bounds in collaborative truckload transportation procurement
- Collaborative vehicle routing: a survey
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- The multi-vehicle profitable pickup and delivery problem
- Collaborating freight forwarding enterprises
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
- Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
- Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Request evaluation strategies for carriers in auction-based collaborations
This page was built for publication: Exact solutions for the collaborative pickup and delivery problem
