PMMWM 문제를 해결하기 위한 새로운 접근법: FIMP-HGA
FIMP-HGA는 매칭 단계에서 KM-M 알고리즘을 사용하여 효율성을 높이고, 파티셔닝 단계에서 하이브리드 유전 알고리즘과 엘리트 전략을 통해 해의 품질을 향상시킨다.
Tensorized Ant Colony Optimization for Accelerating Large-Scale Traveling Salesman Problems
Tensorized Ant Colony Optimization (TensorACO) leverages GPU acceleration and tensor-based computational methods to significantly improve the performance of Ant Colony Optimization (ACO) in solving large-scale Traveling Salesman Problems (TSPs).
Transform then Explore: An Effective Technique for Improving Reinforcement Learning Solutions in Combinatorial Optimization Problems
Gauge transformation (GT) is a simple yet effective technique that can be seamlessly integrated into reinforcement learning (RL) models to enable continuous exploration and improvement of solutions for combinatorial optimization problems (COPs).
Efficient Rounding Algorithm for k-Edge-Connected Spanning Subgraph Problem
The algorithm computes a k-edge-connected spanning subgraph with cost no greater than the optimal (k+10)-edge-connected spanning subgraph.
Efficient Genetic Algorithms for Target Set Selection with Power-Law Parameters and Greedy Heuristics
Simple randomized parameter choices and elementary greedy heuristics can outperform complex algorithms and costly parameter tuning for the target set selection problem.
Efficient Construction of Small Connected Dominating Sets in Triangulations
Every n-vertex triangulation has a connected dominating set of size at most 10n/21.
Online Control of Adaptive Large Neighborhood Search using Deep Reinforcement Learning to Enhance Combinatorial Optimization
The proposed DR-ALNS method leverages Deep Reinforcement Learning to dynamically select operators, adjust destroy severity, and control the acceptance criterion within the Adaptive Large Neighborhood Search (ALNS) algorithm, leading to more effective solutions for combinatorial optimization problems.
Deep Reinforcement Learning Approach for Solving Traveling Purchaser Problems
The core message of this paper is that by decoupling the routing and purchasing decisions and leveraging deep reinforcement learning, the authors propose a novel approach that can efficiently construct high-quality solutions for traveling purchaser problems, significantly outperforming well-established heuristic methods.
Adversarial Combinatorial Bandits with Switching Costs: Algorithms and Lower Bounds
The core message of this paper is to study the problem of adversarial combinatorial bandits with switching costs, derive lower bounds for the minimax regret, and propose algorithms that approximately meet these lower bounds under both bandit feedback and semi-bandit feedback settings.
Solving Quadratic Assignment Problems with Two-Stage Graph Pointer Networks and Reinforcement Learning
The authors propose a two-stage graph pointer network (GPN) model that can efficiently solve large-scale quadratic assignment problems (QAP) using reinforcement learning.
© 2024 by Linnk AI