Results 21 to 30 of about 11,269,656 (310)
Weak Label Feature Selection Method Based on Neighborhood Rough Sets and Relief [PDF]
Jisuanji kexue, 2022 In multi-label learning and classification, existing feature selection algorithms based on neighborhood rough sets will use classification margin of samples as the neighborhood radius.However, when the margin is too large, the classification may be ...
SUN Lin, HUANG Miao-miao, XU Jiu-cheng
doaj +1 more source
MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search
AAAI Conference on Artificial Intelligence, 2022 Multi-Agent Path Finding (MAPF) is the problem of planning collision-free paths for multiple agents in a shared environment. In this paper, we propose a novel algorithm MAPF-LNS2 based on large neighborhood search for solving MAPF efficiently.
Jiaoyang Li +4 more
semanticscholar +1 more source
A note on possible density and diameter of counterexamples to the Seymour's second neighborhood conjecture [PDF]
Opuscula Mathematica, 2021 Seymour's second neighborhood conjecture states that every simple digraph without loops or 2-cycles contains a vertex whose second neighborhood is at least as large as its first.
Oleksiy Zelenskiy +2 more
doaj +1 more source
Aerospace, 2023 The runway system is more likely to be a bottleneck area for airport operations because it serves as a link between the air routes and airport ground traffic.
Jiaming Su +3 more
doaj +1 more source
Large neighborhood local search for the p-median problem [PDF]
Yugoslav Journal of Operations Research, 2005 In this paper we consider the well known p-median problem. We introduce a new large neighborhood based on ideas of S.Lin and B.W. Kernighan for the graph partition problem. We study the behavior of the local improvement and Ant Colony algorithms with new
Kochetov Yuri +3 more
doaj +1 more source
Discretization-Strategy-Based Solution for Berth Allocation and Quay Crane Assignment Problem
Journal of Marine Science and Engineering, 2022 The continuous berth allocation and quay crane assignment problem considers the size of berths and ships, the number of quay cranes, the dynamic ships and non-crossing constraints of quay cranes.
Min Tang +3 more
doaj +1 more source
Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search
AAAI Conference on Artificial Intelligence, 2022 Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths for a team of agents in a common environment. MAPF is NP-hard to solve optimally and, in some cases, also bounded-suboptimally. It is thus time-consuming for (bounded-
Taoan Huang +3 more
semanticscholar +1 more source
A Single-Product Multi-Period Inventory Routing Problem under Intermittent Demand
Information, 2023 Demand fluctuations and uncertainty bring challenges to inventory management, and intermittent demand patterns increase the risk of inventory backlogs and raise inventory holding costs.
Xin Song, Daofang Chang, Tian Luo
doaj +1 more source
A Large-Scale Evaluation Of Shape-Aware Neighborhood Weights And Neighborhood Sizes
Computer-Aided Design, 2021 In this paper, we define and evaluate a weighting scheme for neighborhoods in point sets. Our weighting takes the shape of the geometry, i.e., the normal information, into account. This causes the obtained neighborhoods to be more reliable in the sense that connectivity also depends on the orientation of the point set.
Martin Skrodzki, Eric Zimmermann
openaire +4 more sources
Very large‐scale neighborhood search
International Transactions in Operational Research, 2000 AbstractNeighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult class of combinatorial optimization problems arising in many application domains including vehicle routing, telecommunications network design, parallel machine scheduling, location theory, and clustering.
R.K. Ahuja, J.B. Orlin, D. Sharma
openaire +3 more sources