Record Breaking Optimization Results Using the Ruin and Recreate Principle

  title={Record Breaking Optimization Results Using the Ruin and Recreate Principle},
  author={Gerhard Schrimpf and Johannes Josef Schneider and Hermann Stamm-Wilbrandt and Gunter Dueck},
  journal={Journal of Computational Physics},
A new optimization principle is presented. Solutions of problems are partly, but significantly, ruined and rebuilt or recreated afterwards. Performing this type of change frequently, one can obtain astounding results for classical optimization problems. The new method is particularly suited for more complex optimization problems (“discontinuous” ones, problems with hard-to-find admissible solutions, problems with complex objectives or many constraints). The method is an all-purpose-heuristic… 
Ruin and Recreate Principle Based Approach for the Quadratic Assignment Problem
This paper has applied the R&R principle based algorithm for a well-known combinatorial optimization problem, the quadratic assignment problem (QAP), and tested this algorithm on a number of instances from the library of the QAP instances - QAPLIB.
A unified matheuristic for solving multi-constrained traveling salesman problems with profits
A unified solution approach based on variable neighborhood search that combines several removal and insertion routing neighborhoods and efficient constraint checking procedures to address a rich Traveling Salesman Problem with Profits encountered in several real-life cases is proposed.
In this paper, we present some new results obtained for the traveling salesman problem (TSP) by using the iterated tabu search (ITS) meta-heuristic. ITS is a promising extension to the ordinary tabu
Improving paratransit scheduling using ruin and recreate methods
Abstract In this paper we study the effects of using ruin and recreate methods in a replanning phase of a dynamic dial-a-ride problem. Several such methods are proposed, and a modeling system is used
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
A two-stage hybrid algorithm that minimizes the number of vehicles, using simulated annealing, and minimizes travel cost by using a large neighborhood search that may relocate a large number of customers is proposed.
A Two-Phase Distributed Ruin-and-Recreate Genetic Algorithm for Solving the Vehicle Routing Problem With Time Windows
This article proposes a novel systematic framework using a two-phase distributed ruin-and-recreate genetic algorithm (RRGA) designed to run in the distributed computing environment that leveraging these networked resources.
Essays on stochastic and multi-objective capacitated vehicle routing problems
A distance function of the type proposed in the Psychology literature by Tversky (1977) for the class of VRP problems is developed, which can use any attributes of the solutions, not just those defined in the optimization model.
An Evolutionary Strategy Algorithm for the Asymmetric Travelling Salesman Problem
The proposed evolutionary strategy algorithm for solving asymmetric travelling salesman problem uses ruin and recreate algorithm to generate new solutions and self-adaption allows the algorithm to learn the parameter values that produce good results and change these values according the requirements in the current state of the search.


New optimization heuristics
The quality of the computational results obtained so far by RRT and GDA shows that the new algorithms behave equally well as TA and thus a fortiori better than SA.
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
This paper presents a new optimization algorithm capable of optimally solving 100-customer problems of the vehicle routing problem with time windows VRPTW and indicates that this algorithm proved to be successful on a variety of practical sized benchmark VRPTw test problems.
Computer solutions of the traveling salesman problem
Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Probabilistic diversification and intensification in local search for vehicle routing
A probabilistic technique to diversify, intensify, and parallelize a local search adapted for solving vehicle routing problems and local searches is presented.
Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with Time Windows
A λ-interchange mechanism that moves customers between routes to generate neighborhood solutions for the VRPTW and the average performance of GenSAT is significantly better than known competing heuristics.
Local Search in Combinatorial Optimisation.
This book is an important reference volume and an invaluable source of inspiration for advanced students and researchers in discrete mathematics, computer science, operations research, industrial engineering and management science.
Bouncing towards the optimum: Improving the results of Monte Carlo optimization algorithms
This work presents an algorithm, called bouncing, which takes the final low-energy configuration of a conventional monotonically cooled annealing run as an input and subjects it to a schedule of repeatedly reheating and cooling, and provides a number of results showing the success of the bouncing method for a particularly prominent example of a combinatorial optimization problem: the traveling salesman problem.