The single vehicle routing problem with deliveries and selective pickups
From MaRDI portal
Publication:2475847
DOI10.1016/j.cor.2007.01.007zbMath1144.90315OpenAlexW2000702178MaRDI QIDQ2475847
Gilbert Laporte, Irina Gribkovskaia, Aliaksandr Shyshou
Publication date: 11 March 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.01.007
Related Items
The multi-vehicle profitable pickup and delivery problem, Vessel routing with pickups and deliveries: an application to the supply of offshore oil platforms, A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups, The bi-objective insular traveling salesman problem with maritime and ground transportation costs, Multiobjective vehicle routing problem with fixed delivery and optional collections, A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics, A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics, A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services, One-to-Many-to-One Single Vehicle Pickup and Delivery Problems, Feasibility recovery for the unit-capacity constrained permutation problem, Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem, The unit-capacity constrained permutation problem, A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows, Lasso solution strategies for the vehicle routing problem with pickups and deliveries, A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups
Cites Work
- Unnamed Item
- Unnamed Item
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- General solutions to the single vehicle routing problem with pickups and deliveries
- Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- The many-to-many location-routing problem
- Heuristics for the traveling salesman problem with pickup and delivery
- The travelling salesman problem with pick-up and delivery
- Future paths for integer programming and links to artificial intelligence
- Vehicle routing problems with simultaneous pick-up and delivery service.
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Solving a vehicle-routing problem arising in soft-drink distribution
- Tabu Search—Part I
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Parallel iterative search methods for vehicle routing problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- The single‐vehicle routing problem with unrestricted backhauls
- Solution of a Large-Scale Traveling-Salesman Problem
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
