Record breaking optimization results using the ruin and recreate principle

From MaRDI portal

Publication:1976826

Jump to:navigation, search

DOI10.1006/jcph.1999.6413zbMath0997.90105OpenAlexW2162423772MaRDI QIDQ1976826

Gunter Dueck, Hermann Stamm-Wilbrandt, Gerhard Schrimpf, Johannes J. Schneider

Publication date: 23 November 2000

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4f80e70e51e368858c3df0787f05c3aa2b9650b4

zbMATH Keywords

global optimization Monte Carlo combinatorial optimization traveling salesman problem vehicle routing problem network optimization ruin and recreate implementation theshold accepting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (80)

A unified heuristic for a large class of vehicle routing problems with backhauls ⋮ Hybrid large neighborhood search for the bus rapid transit route design problem ⋮ A priori orienteering with time windows and stochastic wait times at customers ⋮ Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling ⋮ Sequential and parallel large neighborhood search algorithms for the periodic location routing problem ⋮ A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times ⋮ A generalized model and a heuristic algorithm for the large-scale covering tour problem ⋮ A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem ⋮ An adaptive large neighborhood search for a vehicle routing problem with multiple routes ⋮ An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization ⋮ Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints ⋮ A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows ⋮ A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows ⋮ A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem ⋮ A large neighborhood search heuristic for supply chain network design ⋮ Bi-objective orienteering for personal activity scheduling ⋮ Multi-directional local search ⋮ Lower and upper bounds for the two-echelon capacitated location-routing problem ⋮ The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ A large neighbourhood based heuristic for two-echelon routing problems ⋮ Multi-machine energy-aware scheduling ⋮ Adaptive large neighborhood search for the curriculum-based course timetabling problem ⋮ A general heuristic for vehicle routing problems ⋮ Deep policy dynamic programming for vehicle routing problems ⋮ A hybrid scatter search for the probabilistic traveling salesman problem ⋮ The prisoner transportation problem ⋮ Large multiple neighborhood search for the soft-clustered vehicle-routing problem ⋮ Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach ⋮ Scheduling heterogeneous multi-load AGVs with battery constraints ⋮ Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics ⋮ Heuristic optimisation in financial modelling ⋮ Traveling salesman problem with clustering ⋮ Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ Combining an LNS-based approach and organizational mining for the resource replacement problem ⋮ The intermittent travelling salesman problem ⋮ Large neighborhood search for the bike request scheduling problem ⋮ Lower and upper bounds for the bin packing problem with fragile objects ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ Metaheuristics: A Canadian Perspective ⋮ The vehicle routing problem with time windows and flexible delivery locations ⋮ Small and large neighborhood search for the park-and-loop routing problem with parking selection ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique ⋮ Efficient GRASP solution approach for the prisoner transportation problem ⋮ Typology and literature review for dial-a-ride problems ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ An implementation of the iterated tabu search algorithm for the quadratic assignment problem ⋮ A set partitioning heuristic for the home health care routing and scheduling problem ⋮ The orienteering problem with stochastic travel and service times ⋮ Vehicle routing with compartments: applications, modelling and heuristics ⋮ An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives ⋮ A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem ⋮ On the neighborhood structure of the traveling salesman problem generated by local search moves ⋮ Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Analysis, modeling and solution of the concrete delivery problem ⋮ Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems ⋮ Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds ⋮ Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles ⋮ Large multiple neighborhood search for the clustered vehicle-routing problem ⋮ Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs ⋮ Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ Scheduling technicians and tasks in a telecommunications company ⋮ The dynamic multi-period vehicle routing problem ⋮ A comparative analysis of two matheuristics by means of merged local optima networks ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ Probabilistic time-dependent vehicle routing problem ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm ⋮ New decomposition methods for home care scheduling with predefined visits ⋮ Handling fairness issues in time-relaxed tournaments with availability constraints ⋮ A template-based adaptive large neighborhood search for the consistent vehicle routing problem ⋮ Integrated timetabling and vehicle scheduling with balanced departure times ⋮ Vehicle routing with transportable resources: using carpooling and walking for on-site services ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ Fast local search algorithms for the handicapped persons transportation problem ⋮ Neural large neighborhood search for routing problems ⋮ A heuristic algorithm for the free newspaper delivery problem

Uses Software

TSPLIB

Cites Work

This page was built for publication: Record breaking optimization results using the ruin and recreate principle

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1976826&oldid=14431051"