Heuristics for the traveling salesman problem with pickup and delivery
type: Item
instance of: scholarly article
title: Heuristics for the traveling salesman problem with pickup and delivery
zbMATH Open document ID: 0957.90069
DOI: 10.1016/S0305-0548(98)00085-9
author: Michel Gendreau
author: G. Laporte
author: Daniele Vigo
published in: Computers \& Operations Research
publication date: 1999-09-22T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1341327
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: pickup and delivery
zbMATH Keywords: heuristics
zbMATH Keywords: tabu search
MaRDI profile type: MaRDI publication profile
full work available at URL: s0305-0548(98)00085-9
OpenAlex ID: W1999750851
Recommended article: The travelling salesman problem with pick-up and delivery
Recommended article: A heuristic for the pickup and delivery traveling salesman problem
Recommended article: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
Recommended article: Q4414640
Recommended article: An algorithm for the traveling salesman problem with pickup and delivery customers
description: scientific article; zbMATH DE number 1341327