The simulated trading heuristic for solving vehicle routing problems
type: Item
instance of: scholarly article
title: The simulated trading heuristic for solving vehicle routing problems
zbMATH Open document ID: 0848.90054
DOI: 10.1016/0166-218X(95)00027-O
author: Winfried. Hochstättler
author: M. Malich
author: Achim Bachem
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 897372
zbMATH Keywords: improvement heuristic
zbMATH Keywords: vehicle routing
zbMATH Keywords: parallelization
describes a project that uses: VRP
describes a project that uses: PVM
MaRDI profile type: Publication
cites work: Q3680833
cites work: Q3048611
cites work: Q4198056
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem
cites work: Tabu Search—Part I
cites work: A GRASP for the Vehicle Routing Problem with Time Windows
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
cites work: An efficient implementation of local search algorithms for constrained routing problems
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems
cites work: Parallel iterative search methods for vehicle routing problems
full work available at URL: 0166-218x(95)00027-o
OpenAlex ID: W1990067406
description: scientific article; zbMATH DE number 897372