Weighting-based Variable Neighborhood Search for Optimal Camera Placement
Authors: Zhouxing Su, Qingyun Zhang, Zhipeng Lü, Chu-Min Li, Weibo Lin, Fuda Ma12400-12408
AAAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Computational experiments on the 69 benchmark instances introduced in the GECCO 2020 Competition on OCP and USCP show that WVNS is extremely competitive comparing to the state-of-the-art methods. It outperforms or matches several best performing competitors on all instances in both the OCP and USCP tracks of the competition, and its advantage on 15 large-scale instances are over 10%. In addition, WVNS improves the previous best known results for 12 classical benchmark instances in the literature. |
| Researcher Affiliation | Collaboration | Zhouxing Su, 1 Qingyun Zhang, 1 Zhipeng L u, 1 Chu-Min Li, 2 Weibo Lin, 3 Fuda Ma3 1SMART, School of Computer Science and Technology, Huazhong University of Science and Technology, China 2MIS, University of Picardie Jules Verne, France 3Huawei Technologies Co., Ltd., China |
| Pseudocode | Yes | Algorithm 1 The main framework of the WVNS algorithm |
| Open Source Code | No | The paper does not provide an explicit statement or link for the open-sourcing of the code for their methodology. |
| Open Datasets | Yes | We conduct extensive experiments on 69 instances used in GECCO 2020 Competition on OCP and USCP... There are 32 academic instances (AC) and 37 real-world ones (RW) in the GECCO dataset1. 1http://www.mage.fst.uha.fr/brevilliers/gecco-2020-ocp-uscp-competition/ |
| Dataset Splits | No | The paper refers to using benchmark instances but does not provide specific training, validation, and test dataset splits or cross-validation details for reproducibility. |
| Hardware Specification | Yes | The experiments are run on a server equipped with 2.6GHz CPU and 128GB RAM. |
| Software Dependencies | Yes | The connected component reduction rule is implemented by running exact mixed-integer linear programming (MILP) solver Gurobi 9.0.1 (Gurobi Optimization, LLC 2019) |
| Experiment Setup | Yes | We perform four independent runs under 1,000-second time limit on a single CPU core, which is the same as adopted in Br evilliers et al. (2018). ... If the weight of any element exceeds a given threshold, the proposed algorithm will divide the weight of each element by two. Specifically, the threshold is set to 216 in WVNS. |