A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
type: Item
instance of: scholarly article
title: A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
zbMATH Open document ID: 0947.90011
DOI: 10.1016/S0377-2217(98)00086-1
author: Paolo Toth
author: Daniele Vigo
published in: European Journal of Operational Research
publication date: 2000-11-08T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1371062
zbMATH Keywords: vehicle routing
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: local search
describes a project that uses: TSPLIB
describes a project that uses: VRP
MaRDI profile type: Publication
cites work: An O(N log N) planar travelling salesman heuristic based on spacefilling curves
cites work: An Algorithm for the Bottleneck Traveling Salesman Problem
cites work: An additive bounding procedure for the asymmetric travelling salesman problem
cites work: A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: The vehicle routing problem with backhauls
cites work: Q4365135
cites work: Q3993418
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Q4353005
cites work: An Exact Algorithm for the Vehicle Routing Problem with Backhauls
cites work: A heuristic algorithm for the asymmetric capacitated vehicle routing problem
full work available at URL: s0377-2217(98)00086-1
OpenAlex ID: W2079224263
Wikidata QID: Q127294393
description: scientific article; zbMATH DE number 1371062