The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
type: Item
instance of: scholarly article
title: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
zbMATH Open document ID: 1163.90816
author: Hanne L. Petersen
author: Oli B. G. Madsen
published in: European Journal of Operational Research
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5571501
zbMATH Keywords: routing
zbMATH Keywords: packing
zbMATH Keywords: metaheuristics
zbMATH Keywords: TSP variants
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.08.009
OpenAlex ID: W2020737022
cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
cites work: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
cites work: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
cites work: Q4532231
cites work: Metaheuristics for the vehicle routing problem with loading constraints
cites work: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
cites work: Q4532228
cites work: Q4845366
cites work: An algorithm for the traveling salesman problem with pickup and delivery customers
cites work: Q4452900
cites work: Variable neighborhood search
cites work: The General Pickup and Delivery Problem
cites work: The vehicle routing problem
DOI: 10.1016/J.EJOR.2008.08.009
description: scientific article; zbMATH DE number 5571501