Lasso solution strategies for the vehicle routing problem with pickups and deliveries
From MaRDI portal
Publication:1011218
DOI10.1016/j.ejor.2007.10.021zbMath1157.90505OpenAlexW2130819502MaRDI QIDQ1011218
Arild Hoff, Gilbert Laporte, Arne Løkketangen, Irina Gribkovskaia
Publication date: 8 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.10.021
Related Items
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Vessel routing with pickups and deliveries: an application to the supply of offshore oil platforms, Vehicle routing with backhauls: review and research perspectives, Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW, Analysis of the selective traveling salesman problem with time-dependent profits, The single vehicle routing problem with deliveries and selective pickups, Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs, A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows, A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem, A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
Uses Software
Cites Work
- Unnamed Item
- 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
- 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
- Adaptive memory search for Boolean optimization problems
- Designing and reporting on computational experiments with heuristic methods
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Vehicle routing problems with simultaneous pick-up and delivery service.
- The single vehicle routing problem with deliveries and selective pickups
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The Vehicle Routing Problem
- Solving a vehicle-routing problem arising in soft-drink distribution
- A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms
- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems
- Fast Algorithms for Geometric Traveling Salesman Problems
- New Insertion and Postoptimization Procedures 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 Tabu Search Heuristic for the Vehicle Routing Problem
- Computer Solutions of the Traveling Salesman Problem
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
