The savings algorithm for the vehicle routing problem
type: Item
instance of: scholarly article
title: The savings algorithm for the vehicle routing problem
zbMATH Open document ID: 0635.90047
DOI: 10.1016/0377-2217(88)90154-3
author: H. Paessens
published in: European Journal of Operational Research
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 4035554
zbMATH Keywords: savings method
zbMATH Keywords: vehicle routing
describes a project that uses: heapsort
describes a project that uses: VRP
describes a project that uses: Algorithm 347
MaRDI profile type: Publication
full work available at URL: 0377-2217(88)90154-3
OpenAlex ID: W1986867012
cites work: The Vehicle Scheduling Problem and Monte Carlo Simulation
cites work: Q3048611
cites work: An Integer Programming Approach to the Vehicle Scheduling Problem
cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem
cites work: Implementing vehicle routing algorithms
cites work: A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: Q3875705
cites work: Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
description: scientific article; zbMATH DE number 4035554