scientific article; zbMATH DE number 2050711
From MaRDI portal
Publication:4452900
Recommendations
- Iterated local search for the quadratic assignment problem
- scientific article; zbMATH DE number 2079895
- Analysing the run-time behaviour of iterated local search for the travelling salesman problem.
- scientific article; zbMATH DE number 1082099
- Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
Cited in
(only showing first 100 items - show all)- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Finding maximin Latin hypercube designs by iterated local search heuristics
- A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands
- Scheduling projects with limited number of preemptions
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- The impact of parametrization in memetic evolutionary algorithms
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- Alternative evaluation functions for the cyclic bandwidth sum problem
- Improved heuristic algorithms for the job sequencing and tool switching problem
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- Stochastic local search with learning automaton for the swap-body vehicle routing problem
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Parallel local search algorithms for high school timetabling problems
- New heuristics for the bicluster editing problem
- Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect
- Variable neighborhood descent for solving the vehicle routing problem with time windows
- The green location-routing problem
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Efficient metaheuristics for the mixed team orienteering problem with time windows
- Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
- Methods for solving road network problems with disruptions
- A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- A comparison of three metaheuristics for the workover rig routing problem
- A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A simple and effective metaheuristic for the minimum latency problem
- Local search based heuristics for global optimization: atomic clusters and beyond
- On the use of meta-heuristic algorithms for automated test suite generation in software testing
- Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
- Metaheuristics for the online printing shop scheduling problem
- Joint generalized quantile and conditional tail expectation regression for insurance risk analysis
- On solving the time window assignment vehicle routing problem via iterated local search
- Iterated local search for the placement of wildland fire suppression resources
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations
- The parallel drone scheduling problem with multiple drones and vehicles
- Collection of different types of milk with multi-tank tankers under uncertainty: a real case study
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
- Efficient approaches for the flooding problem on graphs
- Multiple k-opt evaluation multiple k-opt moves with GPU high performance local search to large-scale traveling salesman problems
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- Double descent and intermittent color diffusion for landscape exploration
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- City-courier routing and scheduling problems
- The warehouse-inventory-transportation problem for supply chains
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
- Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
- Capacitated ring arborescence problems with profits
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
- A simheuristic approach for throughput maximization of asynchronous buffered stochastic mixed-model assembly lines
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Lifted graphical models: a survey
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
- A matheuristic for the truck and trailer routing problem
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Adaptive tabu search for course timetabling
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
- Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems
- A dynamic game with monopolist manufacturer and price-competing duopolist retailers
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Local search algorithms for finding the Hamiltonian completion number of line graphs
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- A bi-objective coordination setup problem in a two-stage production system
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- Image registration with iterated local search
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- Iterated local search for the quadratic assignment problem
- An iterated local search algorithm for the vehicle routing problem with backhauls
- A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- Metaheuristics and cooperative approaches for the bi-objective ring star problem
- Ants can orienteer a thief in their robbery
- The secure time-dependent vehicle routing problem with uncertain demands
- Extracting maximal objects from three-dimensional solid materials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452900)