Lasso solution strategies for the vehicle routing problem with pickups and deliveries
type: Item
instance of: scholarly article
title: Lasso solution strategies for the vehicle routing problem with pickups and deliveries
zbMATH Open document ID: 1157.90505
author: Arild Hoff
author: Irina Gribkovskaia
author: G. Laporte
author: Arne Løkketangen
published in: European Journal of Operational Research
publication date: 2009-04-08T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5541405
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: pickup and delivery
zbMATH Keywords: tabu search
zbMATH Keywords: lasso solutions
describes a project that uses: VRP
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.ejor.2007.10.021
OpenAlex ID: W2130819502
cites work: Q3151784
cites work: Designing and reporting on computational experiments with heuristic methods
cites work: Fast Algorithms for Geometric Traveling Salesman Problems
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
cites work: Q4656782
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Heuristics for the traveling salesman problem with pickup and delivery
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Q4354785
cites work: General solutions to the single vehicle routing problem with pickups and deliveries
cites work: One-to-Many-to-One Single Vehicle Pickup and Delivery Problems
cites work: A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms
cites work: The single vehicle routing problem with deliveries and selective pickups
cites work: Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search
cites work: Adaptive memory search for Boolean optimization problems
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: The travelling salesman problem with pick-up and delivery
cites work: The many-to-many location-routing problem
cites work: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
cites work: Solving a vehicle-routing problem arising in soft-drink distribution
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Vehicle routing problems with simultaneous pick-up and delivery service.
cites work: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
cites work: The vehicle routing problem
DOI: 10.1016/J.EJOR.2007.10.021
description: scientific article; zbMATH DE number 5541405