A random-key GRASP for combinatorial optimization
From MaRDI portal
Publication:6668154
DOI10.23952/jnva.8.2024.6.03MaRDI QIDQ6668154
Ricardo M. A. Silva, Mauricio G. C. Resende, Antônio Augusto Chaves
Publication date: 21 January 2025
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved solutions to the Steiner triple covering problem
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
- A reactive GRASP with path relinking for capacitated clustering
- Russian doll search for the Steiner triple covering problem
- Tight bounds from a path based formulation for the tree of hub location problem
- Speeding up continuous GRASP
- The tree of hubs location problem
- A probabilistic heuristic for a computationally difficult set covering problem
- An interior point algorithm to solve computationally difficult set covering problems
- Cliques and clustering: A combinatorial approach
- The node capacitated graph partitioning problem: A computational study
- Variable neighborhood search
- \(k\)-server problems with bulk requests: an application to tool switching in manufacturing
- Improved heuristic algorithms for the job sequencing and tool switching problem
- A biased random-key genetic algorithm for the tree of hubs location problem
- Greedy randomized adaptive search procedures
- Solving hard set covering problems
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- An improved Benders decomposition algorithm for the tree of hubs location problem
- A Python/C library for bound-constrained global optimization with continuous GRASP
- Global optimization by continuous grasp
- Multiple allocation tree of hubs location problem for non-complete networks
- Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem
- Optimization by GRASP
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Correspondence of projected 3-D points and lines using a continuous GRASP
- A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation
- Solution of a Large-Scale Traveling-Salesman Problem
- A Simplex Method for Function Minimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: A random-key GRASP for combinatorial optimization