Learning-based multi-objective evolutionary algorithm for batching decision problem
From MaRDI portal
Publication:2108120
DOI10.1016/j.cor.2022.106026OpenAlexW4296070370WikidataQ114671547 ScholiaQ114671547MaRDI QIDQ2108120
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106026
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- Survey of multi-objective optimization methods for engineering
- Comparison of multi-objective optimization methodologies for engineering applications
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Data driven hybrid evolutionary analytical approach for multi objective location allocation decisions: automotive green supply chain empirical evidence
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Exploration and exploitation in evolutionary algorithms
- Integrated Charge Batching and Casting Width Selection at Baosteel
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Evolutionary Algorithms for Solving Multi-Objective Problems
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Evolutionary Multi-Criterion Optimization
- On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
- Random forests
