irace

swMATH8008MaRDI QIDQ20023FDOQ20023

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Group-based synchronous-asynchronous grey wolf optimizer
• A unified ant colony optimization algorithm for continuous optimization
• An Experimental Study of Operator Choices in the $$(1+(\lambda ,\lambda ))$$ Genetic Algorithm
• Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
• A beam search algorithm for the biobjective container loading problem
• A Metaheuristic Approach to Compute Pure Nash Equilibria
• Sparse kernel deep stacking networks
• Automatic algorithm design for hybrid flowshop scheduling problems
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
• Scheduling of maintenance work of a large-scale tramway network
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem
• An effective iterated tabu search for the maximum bisection problem
• A memetic algorithm for the cost-oriented robotic assembly line balancing problem
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
• Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
• An iterated ``hyperplane exploration approach for the quadratic knapsack problem
• A study on the pickup and delivery problem with time windows: matheuristics and new instances
• Revisiting simulated annealing: a component-based analysis
• A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
• Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance
• A two-stage approach to the UCITS-constrained index-tracking problem
• Effect of transformations of numerical parameters in automatic algorithm configuration
• A biased random-key genetic algorithm for the maximum quasi-clique problem
• Heuristic search to the capacitated clustering problem
• Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP
• A destroy and repair algorithm for the bike sharing rebalancing problem
• An opposition-based memetic algorithm for the maximum quasi-clique problem
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• An exact algorithm for the partition coloring problem
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
• An effective heuristic algorithm for the partial shop scheduling problem
• Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
• A GRASP for the convex recoloring problem in graphs
• A novel hybrid PSO-based metaheuristic for costly portfolio selection problems
• Metaheuristics ``In the large
• aspeed: Solver scheduling via answer set programming
• Title not available (Why is that?)
• MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
• A hybrid metaheuristic approach for the capacitated arc routing problem
• A multi-agent based cooperative approach to scheduling and routing
• Local search heuristics for sectoring routing in a household waste collection context
• Large neighborhood search for multi-trip vehicle routing
• Hybrid evolutionary search for the traveling repairman problem with profits
• Tree optimization based heuristics and metaheuristics in network construction problems
• A hybrid algorithm for time-dependent vehicle routing problem with time windows
• Two dimensional guillotine cutting stock and scheduling problem in printing industry
• A survey of adaptive large neighborhood search algorithms and applications
• Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas
• Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
• Client-side Computational Optimization
• Region based memetic algorithm for real-parameter optimisation
• Integer programming model extensions for a multi-stage nurse rostering problem
• Mixed uncertainty sets for robust combinatorial optimization
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
• Pitfalls and Best Practices in Algorithm Configuration
• Improved heuristic algorithms for the job sequencing and tool switching problem
• An improved configuration checking-based algorithm for the unicost set covering problem
• Efficiently solving the traveling thief problem using hill climbing and simulated annealing
• Exploring further advantages in an alternative formulation for the set covering problem
• A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
• The configurable SAT solver challenge (CSSC)
• Two phased hybrid local search for the periodic capacitated arc routing problem
• Automatic construction of parallel portfolios via algorithm configuration
• Automatically improving the anytime behaviour of optimisation algorithms
• Heuristics for a flowshop scheduling problem with stepwise job objective function
• Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
• LS-II: an improved locust search algorithm for solving optimization problems
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
• A hybrid heuristic for the maximum dispersion problem
• A metaheuristic based on tabu search for solving a technician routing and scheduling problem
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
• Metaheuristic Algorithms
• A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
• Using machine learning for model benchmarking and forecasting of depletion-induced seismicity in the Groningen gas field
• Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs
• Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
• Exact and heuristic methods for optimizing lock-quay system in inland waterway
• A general variable neighborhood search for the cyclic antibandwidth problem
• An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model
• Modification of the method of generation of control finite-state machines with continuous actions based on training examples
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
• A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem
• Automatic model selection for high-dimensional survival analysis
• Negotiation mechanisms for the multi-agent multi-mode resource investment problem
• A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
• An integer programming approach for the physician rostering problem
• A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
• Modern Optimization with R
• Learning-driven feasible and infeasible tabu search for airport gate assignment
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
• A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
• Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants
• Open questions on Tantrix graphs
• A model of anytime algorithm performance for bi-objective optimization
• Recent advances in selection hyper-heuristics
• Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
• A comparative analysis of two matheuristics by means of merged local optima networks
• Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms

This page was built for software: irace