Feature Article—Genetic Algorithms for the Operations Researcher
From MaRDI portal
Recommendations
Cited in
(54)- Allocation search methods for a generalized class of location-allocation problems
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
- A genetic algorithm for solving linear fractional bilevel problems
- Improving Benders decomposition using a genetic algorithm
- Genetic local search in combinatorial optimization
- Genetic search with dynamic operating disciplines
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- Heuristics for cardinality constrained portfolio optimization
- Scheduling electric vehicles and locating charging stations on a path
- An improved genetic algorithm for single-machine inverse scheduling problem
- An evolutionary heuristic for the index tracking problem.
- A population heuristic for constrained two-dimensional non-guillotine cutting
- Genetic algorithms for solving mixed-discrete optimization problems
- Combined strip and discharge delivery of containers in heterogeneous fleets with time windows
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
- One-dimensional vehicle scheduling with a front-end depot and non-crossing constraints
- Converging marriage in honey-bees optimization and application to stochastic dynamic programming
- Choquet integral for criteria aggregation in the flexible job-shop scheduling problems
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
- A new approach for solving linear bilevel problems using genetic algorithms
- An investigation of the use of three selection-based genetic algorithm families when minimizing the production cost of hollow core slabs
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- Genetic algorithms in logic tree decision modeling
- On genetic operators for unconstrained optimization problems
- Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
- Cooperative twin-crane scheduling
- A genetic algorithm for the linear transportation problem
- Scheduling parallel-machine batch operations to maximize on-time delivery performance
- A comparative study of some evolutionary algorithms
- Optimizing production smoothing decisions via batch selection for mixed-model just-in-time manufacturing systems with arbitrary setup and processing times
- GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS
- Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem
- How to park freight trains on rail-rail transshipment yards: the train location problem
- Genetic Algorithms
- Genetic Algorithms-a Tool for OR?
- scientific article; zbMATH DE number 2086836 (Why is no real title available?)
- scientific article; zbMATH DE number 1870070 (Why is no real title available?)
- Improving the genetic algorithm through new composing of migration and parent centric selection
- Unrelated parallel machine scheduling -- perspectives and progress
- New genetic algorithms based approaches to continuous \(p\)-median problem
- Algorithmes génétiques hybrides pour l'optimisation combinatoire
- Application of genetic algorithms in production and operations management: a review
- Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization
- Complexity and heuristic algorithms for speed scaling scheduling of parallel jobs with energy constraint
- An adaptive genetic algorithm with optimal recombination for scheduling problems with energy resource
- Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions
- Global and local search algorithms for concave cost transshipment problems
- A genetic algorithm approach for regrouping service sites
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- The container transshipment problem: searching representation landscapes with metaheuristic algorithms
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
This page was built for publication: Feature Article—Genetic Algorithms for the Operations Researcher
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366461)
