A comparison of two meta-heuristics for the pickup and delivery problem with transshipment
From MaRDI portal
Publication:1782171
DOI10.1016/j.cor.2018.07.013zbMath1458.90076OpenAlexW2884767612WikidataQ129508296 ScholiaQ129508296MaRDI QIDQ1782171
Publication date: 18 September 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.013
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network of railway terminal ⋮ The vessel swap-body routing problem ⋮ A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments ⋮ The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation
Cites Work
- Unnamed Item
- The dial-A-ride problem with transfers
- Real-time split-delivery pickup and delivery time window problems with transfers
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
- The dial-a-ride problem: Models and algorithms
- 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)
- The Truck Dispatching Problem
- Minimum Makespan Multi-vehicle Dial-a-Ride
- The Pickup And Delivery Problem With Time Windows And Transshipment
This page was built for publication: A comparison of two meta-heuristics for the pickup and delivery problem with transshipment
