Tourenplanung für zwei Depots bei offenen Touren
type: Item
instance of: scholarly article
title: Tourenplanung für zwei Depots bei offenen Touren
zbMATH Open document ID: 0531.90093
DOI: 10.1007/BF01721250
author: U. Eberhard
author: H.-J. Vaterrodt
author: Christoph Schneeweiss
published in: OR Spektrum
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3843523
zbMATH Keywords: modified saving method
zbMATH Keywords: open-tour-problems
zbMATH Keywords: two depots
zbMATH Keywords: travelling salesman
zbMATH Keywords: vehicle dispatching
MaRDI profile type: Publication
cites work: Algorithms for Large-scale Travelling Salesman Problems
cites work: The truck dispatching problem
cites work: Approximate Traveling Salesman Algorithms
cites work: Heuristische Lösungsverfahren für Lieferplanprobleme
cites work: Q5585875
full work available at URL: https://doi.org/10.1007/bf01721250
OpenAlex ID: W1996821033
Recommended article: Q3675892
Recommended article: On the tour planning problem
Recommended article: The two-echelon multi-depot inventory-routing problem
Recommended article: Q3476562
Recommended article: Q3737224
Recommended article: A two-stage stochastic programming approach for multi-activity tour scheduling
Recommended article: AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS
Recommended article: On finding a cyclic tour and a vehicle loading plan yielding maximum profit
description: scientific article; zbMATH DE number 3843523