irace

swMATH8008MaRDI QIDQ20023

No author found.

Related Items (only showing first 100 items - show all)

An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands ⋮ Relax-fix-optimize heuristics for time-relaxed sports timetabling ⋮ Metaheuristic Algorithms ⋮ SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers ⋮ Solution approaches for the vehicle routing problem with occasional drivers and time windows ⋮ The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm ⋮ Ants can orienteer a thief in their robbery ⋮ Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms ⋮ MineReduce: an approach based on data mining for problem size reduction ⋮ Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects ⋮ A study on the pickup and delivery problem with time windows: matheuristics and new instances ⋮ A metaheuristic based on tabu search for solving a technician routing and scheduling problem ⋮ On the impact of the performance metric on efficient algorithm configuration ⋮ A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection ⋮ A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems ⋮ Local search for constrained graph clustering in biological networks ⋮ Multi- and many-objective path-relinking: a taxonomy and decomposition approach ⋮ A computational study on ant colony optimization for the traveling salesman problem with dynamic demands ⋮ Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization ⋮ Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics ⋮ A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem ⋮ A weighted-sum method for solving the bi-objective traveling thief problem ⋮ A matheuristic for solving inventory sharing problems ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ The rainbow Steiner tree problem ⋮ Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times ⋮ The vessel swap-body routing problem ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem ⋮ Two dimensional guillotine cutting stock and scheduling problem in printing industry ⋮ aspeed: Solver scheduling via answer set programming ⋮ Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism ⋮ A Metaheuristic Approach to Compute Pure Nash Equilibria ⋮ Pitfalls and Best Practices in Algorithm Configuration ⋮ Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking ⋮ Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? ⋮ Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants ⋮ 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 novel hybrid PSO-based metaheuristic for costly portfolio selection problems ⋮ Metaheuristics ``In the large ⋮ A hybrid evolutionary search for the generalized quadratic multiple knapsack problem ⋮ Unnamed Item ⋮ Automatically improving the anytime behaviour of optimisation algorithms ⋮ Automatic algorithm design for hybrid flowshop scheduling problems ⋮ Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm ⋮ A unified ant colony optimization algorithm for continuous optimization ⋮ Handling fairness issues in time-relaxed tournaments with availability constraints ⋮ On Class Imbalance Correction for Classification Algorithms in Credit Scoring ⋮ Soft computing methods for multiobjective location of garbage accumulation points in smart cities ⋮ An Experimental Study of Operator Choices in the $$(1+(\lambda ,\lambda ))$$ Genetic Algorithm ⋮ A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing ⋮ Automatic model selection for high-dimensional survival analysis ⋮ A novel ant colony optimization algorithm for large scale QoS-based service selection problem ⋮ Modern Optimization with R ⋮ Sparse kernel deep stacking networks ⋮ Client-side Computational Optimization ⋮ Anytime algorithms for the longest common palindromic subsequence problem ⋮ Open questions on Tantrix graphs ⋮ Group-based synchronous-asynchronous grey wolf optimizer ⋮ An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization ⋮ Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms ⋮ Heuristic search to the capacitated clustering problem ⋮ A GRASP for the convex recoloring problem in graphs ⋮ A multi-agent transgenetic algorithm for the bi-objective spanning tree problem ⋮ A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ A two-stage approach to the UCITS-constrained index-tracking problem ⋮ Effect of transformations of numerical parameters in automatic algorithm configuration ⋮ Learning-driven feasible and infeasible tabu search for airport gate assignment ⋮ Environmental and social implications of incorporating carpooling service on a customized bus system ⋮ Hybrid search with neighborhood reduction for the multiple traveling salesman problem ⋮ Reinforcement learning based tabu search for the minimum load coloring problem ⋮ A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations ⋮ Scheduling unrelated additive manufacturing machines with practical constraints ⋮ Effective train routing selection for real-time traffic management: improved model and ACO parallel computing ⋮ 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 ⋮ 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 ⋮ Improved heuristic algorithms for the job sequencing and tool switching problem ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ An exact algorithm for the partition coloring problem ⋮ An iterated ``hyperplane exploration approach for the quadratic knapsack problem ⋮ An effective iterated tabu search for the maximum bisection 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 biased random-key genetic algorithm for the maximum quasi-clique problem ⋮ Hybrid method with CS and BRKGA applied to the minimization of tool switches problem ⋮ Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ A memetic algorithm for the cost-oriented robotic assembly line balancing problem ⋮ Boosting evolutionary algorithm configuration ⋮ Model-based algorithm configuration with adaptive capping and prior distributions ⋮ General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem ⋮ Efficient approaches for the flooding problem on graphs ⋮ The weighted independent domination problem: integer linear programming models and metaheuristic approaches

This page was built for software: irace