Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search

DOI10.1007/s10100-006-0164-7zbMath1203.90169OpenAlexW2063342614MaRDI QIDQ926338

Arild Hoff, Arne Løkketangen

Publication date: 27 May 2008

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-006-0164-7

zbMATH Keywords

tabu searchtraveling salesman problempickup and deliverylasso solutions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ General solutions to the single vehicle routing problem with pickups and deliveries ⋮ The single vehicle routing problem with deliveries and selective pickups ⋮ Lasso solution strategies for the vehicle routing problem with pickups and deliveries

Uses Software

• AMPL
• VRP
• Tabu search

Cites Work

• The vehicle routing problem with backhauls
• Heuristics for the traveling salesman problem with pickup and delivery
• The travelling salesman problem with pick-up and delivery
• Adaptive memory search for Boolean optimization problems
• The traveling salesman problem with backhauls
• The Vehicle Routing Problem
• Integer Programming Formulation of Traveling Salesman Problems
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections

This page was built for publication: Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search