Record breaking optimization results using the ruin and recreate principle
type: Item
instance of: scholarly article
title: Record breaking optimization results using the ruin and recreate principle
zbMATH Open document ID: 0997.90105
author: Gerhard Schrimpf
author: Hermann Stamm-Wilbrandt
author: Gunter Dueck
author: Johannes Schneider
published in: Journal of Computational Physics
publication date: 2000-11-23T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1443366
zbMATH Keywords: ruin and recreate implementation
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: Monte Carlo
zbMATH Keywords: theshold accepting
zbMATH Keywords: global optimization
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: network optimization
describes a project that uses: TSPLIB
MaRDI profile type: Publication
OpenAlex ID: W2162423772
cites work: Solution of large-scale symmetric travelling salesman problems
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel
cites work: Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Optimization by Simulated Annealing
cites work: Monte Carlo simulation in statistical physics. An introduction.
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Full characterization of a strange attractor. Chaotic dynamics in low- dimensional replicator systems
cites work: Q4339078
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Q4299723
cites work: The traveling salesman. Computational solutions for RSP applications
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
DOI: 10.1006/JCPH.1999.6413
description: scientific article; zbMATH DE number 1443366