Cited in
(only showing first 100 items - show all)- Group-based synchronous-asynchronous grey wolf optimizer
- Ants can orienteer a thief in their robbery
- A unified ant colony optimization algorithm for continuous optimization
- Sparse, continuous policy representations for uniform online bin packing via regression of interpolants
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
- Pitfalls and best practices in algorithm configuration
- A beam search algorithm for the biobjective container loading problem
- Sparse kernel deep stacking networks
- Automatic algorithm design for hybrid flowshop scheduling problems
- Scheduling of maintenance work of a large-scale tramway network
- 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
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- 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
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- Exact and heuristic methods for optimizing lock-quay system in inland waterway
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
- 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
- An effective iterated tabu search for the maximum bisection problem
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem
- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- 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
- Revisiting simulated annealing: a component-based analysis
- A study on the pickup and delivery problem with time windows: matheuristics and new instances
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
- A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
- A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
- 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 memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
- Learning-driven feasible and infeasible tabu search for airport gate assignment
- Automatic model selection for high-dimensional survival analysis
- Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
- 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
- A model of anytime algorithm performance for bi-objective optimization
- Open questions on Tantrix graphs
- Heuristic search to the capacitated clustering problem
- Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when?
- 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
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
- Recent advances in selection hyper-heuristics
- Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP
- Relax-fix-optimize heuristics for time-relaxed sports timetabling
- A destroy and repair algorithm for the bike sharing rebalancing problem
- Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints
- The vehicle routing problem with arrival time diversification on a multigraph
- A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations
- Environmental and social implications of incorporating carpooling service on a customized bus system
- Effective train routing selection for real-time traffic management: improved model and ACO parallel computing
- Reinforcement learning based tabu search for the minimum load coloring problem
- Scheduling unrelated additive manufacturing machines with practical constraints
- An experimental study of operator choices in the \((1+(\lambda,\lambda))\) genetic algorithm
- 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
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- On class imbalance correction for classification algorithms in credit scoring
- A GRASP for the convex recoloring problem in graphs
- A metaheuristic approach to compute pure Nash equilibria
- Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
- A novel hybrid PSO-based metaheuristic for costly portfolio selection problems
- Metaheuristics ``In the large
- Metaheuristic algorithms
- EOlib
- GLOB
- Hyperheuristics
- iOpt
- Paramils
- GRASP
- TSPLIB
- PERL
- Visiplan
- GridSim
- PISA
- ParaDisEO
- LSSPER
- GAPS
- MOTGA
- MEMOTS
- COMET
- MDVRPTW
- EasyLocal++
- CirCut
- Knapsack
This page was built for software: irace
