A combined approach to solve the pickup and delivery selection problem
From MaRDI portal
Publication:5301719
zbMATH Open1162.90342MaRDI QIDQ5301719FDOQ5301719
Authors: Jörn Schönberger, Herbert Kopfer, Dirk Christian Mattfeld
Publication date: 20 January 2009
Recommendations
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- The multi-pickup and delivery problem with time windows
- Combining heuristic and exact methods to solve the vehicle routing problem with pickups, deliveries and time windows
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
- Computational Science – ICCS 2005
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cited In (13)
- Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries
- A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route
- An a-priori parameter selection approach to enhance the performance of genetic algorithms solving pickup and delivery problems
- A general vehicle routing problem
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
- Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking
- Extension and Application of a General Pickup and Delivery Model for Evaluating the Impact of Bundling Goods in an Urban Environment
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
- A scalable anticipatory policy for the dynamic pickup and delivery problem
- The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing
- Title not available (Why is that?)
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
This page was built for publication: A combined approach to solve the pickup and delivery selection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301719)