Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search
type: Item
instance of: scholarly article
title: Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search
zbMATH Open document ID: 1203.90169
author: Arild Hoff
author: Arne Løkketangen
published in: CEJOR. Central European Journal of Operations Research
publication date: 2008-05-27T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5279093
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: pickup and delivery
zbMATH Keywords: tabu search
zbMATH Keywords: lasso solutions
describes a project that uses: AMPL
describes a project that uses: VRP
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: s10100-006-0164-7
OpenAlex ID: W2063342614
cites work: An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
cites work: The traveling salesman problem with backhauls
cites work: Heuristics for the traveling salesman problem with pickup and delivery
cites work: The vehicle routing problem with backhauls
cites work: Adaptive memory search for Boolean optimization problems
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: The travelling salesman problem with pick-up and delivery
cites work: The vehicle routing problem
DOI: 10.1007/S10100-006-0164-7
description: scientific article; zbMATH DE number 5279093