Exact solutions for the collaborative pickup and delivery problem
From MaRDI portal
Publication:1787916
Recommendations
Cites work
- scientific article; zbMATH DE number 4070617 (Why is no real title available?)
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- An algorithm for the traveling salesman problem with pickup and delivery customers
- An exact algorithm for the pickup and delivery problem with time windows
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- Collaborating freight forwarding enterprises
- Collaborative vehicle routing: a survey
- Dynamic pickup and delivery problems
- Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions
- Lane covering with partner bounds in collaborative truckload transportation procurement
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Operational transportation planning of freight forwarding companies in horizontal coalitions
- 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
- Partitioning procedures for solving mixed-variables programming problems
- Request evaluation strategies for carriers in auction-based collaborations
- Shipper collaboration
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The multi-vehicle profitable pickup and delivery problem
- The pickup and delivery problem with time windows
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
Cited in
(10)- Advances in applied optimal control and combinatorial optimization: special issue in honor of Richard F. Hartl
- Emerging and innovative OR applications: a special issue in honor of Walter J. Gutjahr
- The single-vehicle two-echelon one-commodity pickup and delivery problem
- Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers
- The collaborative consistent vehicle routing problem with workload balance
- The prisoners' dilemma in collaborative carriers' request selection
- An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution
- Collaborative delivery on a fixed path with homogeneous energy-constrained agents
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- The shared customer collaboration vehicle routing problem
This page was built for publication: Exact solutions for the collaborative pickup and delivery problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787916)
