Routeing winter gritting vehicles
type: Item
instance of: scholarly article
title: Routeing winter gritting vehicles
zbMATH Open document ID: 0790.90031
DOI: 10.1016/0166-218X(92)00003-5
published in: Discrete Applied Mathematics
publication date: 1994-06-23T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 527428
zbMATH Keywords: unconstrained Chinese postman problem
zbMATH Keywords: simulated annealing
zbMATH Keywords: multiple depot locations
zbMATH Keywords: limited vehicle capacities
zbMATH Keywords: total distance travelled
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: network
author: Richard Eglese
MaRDI profile type: Publication
cites work: The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
cites work: Simulated Annealing – An Annotated Bibliography
cites work: Matching, Euler tours and the Chinese postman
cites work: Q4039765
cites work: Capacitated arc routing problems
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing
full work available at URL: 0166-218x(92)00003-5
OpenAlex ID: W1977642073
description: scientific article; zbMATH DE number 527428