A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network
From MaRDI portal
(Redirected from Publication:6561217)
Cites work
- A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
- A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
- A survey of variants and extensions of the location-routing problem
- FiberSCIP—A Shared Memory Parallelization of SCIP
- General network design: a unified view of combined location and network design problems
- scientific article; zbMATH DE number 1749228 (Why is no real title available?)
- Location-routing: issues, models and methods
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- Service network design for freight transportation: a review
- Service network design in freight transportation
- Synchronization in cross-docking networks: a research classification and framework
- The Continuous-Time Service Network Design Problem
- The General Pickup and Delivery Problem
- The pickup and delivery problem with cross-docking
- The Pickup And Delivery Problem With Time Windows And Transshipment
- Using clustering analysis in a capacitated location-routing problem
- Vehicle routing with cross-docking
This page was built for publication: A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561217)
