New optimization heuristics. The great deluge algorithm and the record- to-record travel
From MaRDI portal
Publication:1208846
DOI10.1006/jcph.1993.1010zbMath0773.65042OpenAlexW2030910540MaRDI QIDQ1208846
Publication date: 16 May 1993
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcph.1993.1010
simulated annealingthreshold acceptingdiscrete optimizationgreat deluge algorithmrecord-to-record travel
Numerical mathematical programming methods (65K05) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items (only showing first 100 items - show all)
A review of hyper-heuristics for educational timetabling ⋮ Real-life curriculum-based timetabling with elective courses and course sections ⋮ État de l'art des méthodes “d'optimisation globale” ⋮ An improved heuristic for the period traveling salesman problem ⋮ A survey of search methodologies and automated system development for examination timetabling ⋮ Applying simulated annealing using different methods for the neighborhood search in forest planning problems ⋮ Real-life examination timetabling ⋮ A variable neighborhood search heuristic for periodic routing problems ⋮ A new heuristic for the period traveling salesman problem ⋮ Egonet: A Genetic Algorithm Model For The Optimisation Of Telephone Networks ⋮ An iterated local search algorithm for the team orienteering problem with variable profits ⋮ A simulated annealing approach to the nesting problem in the textile manufacturing industry ⋮ Thirty years of heterogeneous vehicle routing ⋮ Rugged and Elementary Landscapes ⋮ A two-stage solution method for the annual dairy transportation problem ⋮ The multi-depot vehicle routing problem with inter-depot routes ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ The multi-district team orienteering problem ⋮ Dynamic design of sales territories ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ An iterated tabu search for the multi-compartment vehicle routing problem ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ A cellular memetic algorithm for the examination timetabling problem ⋮ Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading ⋮ Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands ⋮ Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling ⋮ Community detection with the label propagation algorithm: a survey ⋮ A tabu search heuristic for the multi-depot vehicle routing problem ⋮ A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem ⋮ Simultaneously exploiting two formulations: an exact Benders decomposition approach ⋮ The open vehicle routing problem: algorithms, large-scale test problems, and computational results ⋮ A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions ⋮ Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics ⋮ A cutoff time strategy based on the coupon collector's problem ⋮ Hybrid Metaheuristics: An Introduction ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems ⋮ A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times ⋮ Two-stage 2D-to-3d reconstruction of realistic microstructures: implementation and numerical validation by effective properties ⋮ The Vehicle Routing Problem with Stochastic Demands and Split Deliveries ⋮ An Adaptive Flex-Deluge Approach to University Exam Timetabling ⋮ The late acceptance hill-climbing heuristic ⋮ An Investigation on Compound Neighborhoods for VRPTW ⋮ A guide-and-observe hyper-heuristic approach to the Eternity II puzzle ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Vehicle routing with compartments: applications, modelling and heuristics ⋮ Optimization of vehicle routing with pickup based on multibatch production ⋮ Simultaneous lotsizing and scheduling by combining local search with dual reoptimization ⋮ Record breaking optimization results using the ruin and recreate principle ⋮ Preprocessing and an improved MIP model for examination timetabling ⋮ On the neighborhood structure of the traveling salesman problem generated by local search moves ⋮ Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art ⋮ A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST ⋮ A guide-and-observe hyper-heuristic approach to the Eternity II puzzle ⋮ Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem ⋮ Vehicle selection for a multi-compartment vehicle routing problem ⋮ An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables ⋮ Comparison of the performance of modern heuristics for combinatorial optimization on real data ⋮ OPTIMIZATION OF COMPLEX SYSTEM RELIABILITY BY A MODIFIED GREAT DELUGE ALGORITHM ⋮ Local search for the undirected capacitated arc routing problem with profits ⋮ A survey of metaheuristic-based techniques for university timetabling problems ⋮ Managing the tabu list length using a fuzzy inference system: an application to examination timetabling ⋮ Synchronized arc routing for snow plowing operations ⋮ Kidney-inspired algorithm for optimization problems ⋮ Production Control of a Flexible Manufacturing System in a Job Shop Environment ⋮ NeuroGenetic approach for combinatorial optimization: an exploratory analysis ⋮ Fuzzy rule base generation for classification and its minimization via modified threshold accepting ⋮ The capacitated vehicle routing problem with stochastic demands and time windows ⋮ ITC2007 solver description: a hybrid approach ⋮ A library of local search heuristics for the vehicle routing problem ⋮ A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem ⋮ Design and validation of heuristic algorithms for simulation-based scheduling of a semiconductor Backend facility ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ A tabu search method for the truck and trailer routing problem ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ Optimizing routing and delivery patterns with multi-compartment vehicles ⋮ Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly ⋮ Spatial optimization of the pattern of fuel management activities and subsequent effects on simulated wildfires ⋮ A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem ⋮ A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing ⋮ Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: An application to road feeder service planning in air cargo transportation ⋮ The team orienteering problem ⋮ A fast and effective heuristic for the orienteering problem ⋮ General local search methods ⋮ Reconstruction, optimization, and design of heterogeneous materials and media: basic principles, computational algorithms, and applications ⋮ A survey of methods for constructing covering arrays ⋮ Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem ⋮ Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation ⋮ An open vehicle routing problem metaheuristic for examining wide solution neighborhoods ⋮ A computational study of smoothing heuristics for the traveling salesman problem ⋮ Computer search for small complete caps ⋮ Iterated responsive threshold search for the quadratic multiple knapsack problem ⋮ Numerical modelling of reservoir at pore scale: a comprehensive review ⋮ An efficient local search method for random 3-satisfiability ⋮ The period traveling salesman problem: A new heuristic algorithm ⋮ Global and local search algorithms for concave cost transshipment problems ⋮ Optimization of Design Parameters for Active Control of Smart Piezoelectric Structures ⋮ An efficient tabu search approach for the 0-1 multidimensional knapsack problem ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis ⋮ Metaheuristics: A Canadian Perspective
This page was built for publication: New optimization heuristics. The great deluge algorithm and the record- to-record travel