Results 21 to 30 of about 794,304 (306)
Guarding terrains via local search
Journal of Computational Geometry, 2014 We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of Chan and Har-Peled (SoCG 2009) and
Erik Krohn +3 more
doaj +1 more source
2009 21st IEEE International Conference on Tools with Artificial Intelligence, 2009 In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning (CDCL) scheme to local search. First an extended implica- tion graph for complete assignments of the set of variables is proposed.
Audemard, Gilles +3 more
openaire +2 more sources
International Journal of Computational Intelligence Systems, 2021 This paper proposes a hybrid approach for solving data clustering problems. This hybrid approach used one of the swarm intelligence algorithms (SIAs): grasshopper optimization algorithm (GOA) due to its robustness and effectiveness in solving ...
M. A. El-Shorbagy, A. Y. Ayoub
doaj +1 more source
Promet (Zagreb), 2019 Providing a satisfying delivery service is an important way to maintain the customers’ loyalty and further expand profits for manufacturers and logistics providers.
Manman Li, Jian Lu, Wenxin Ma
doaj +1 more source
Metaheuristic for Solving Multi-Objective Job Shop Scheduling Problem in a Robotic Cell
IEEE Access, 2020 This paper deals with the multi-objective job shop scheduling problem in a robotic cell (MOJRCSP). All the jobs are processed according to their operations order on workstations.
Xiaohui Li +4 more
doaj +1 more source
The communication complexity of local search [PDF]
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019 We study the following communication variant of local search. There is some fixed, commonly known graph $G$. Alice holds $f_A$ and Bob holds $f_B$, both are functions that specify a value for each vertex. The goal is to find a local maximum of $f_A+f_B$ with respect to $G$, i.e., a vertex $v$ for which $(f_A+f_B)(v)\geq (f_A+f_B)(u)$ for every neighbor
Yakov Babichenko +2 more
openaire +2 more sources
Adaptive search techniques for problems in vehicle routing, part II: A numerical comparison [PDF]
Yugoslav Journal of Operations Research, 2015 Research in the field of vehicle routing often focused on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. Early studies introduce static tailor-made strategies, but trends show
Kritzinger Stefanie +3 more
doaj +1 more source
Bayesian Optimization with Local Search [PDF]
, 2020 Global optimization finds applications in a wide range of real world problems. The multi-start methods are a popular class of global optimization techniques, which are based on the ideas of conducting local searches at multiple starting points. In this work we propose a new multi-start algorithm where the starting points are determined in a Bayesian ...
Yuzhou Gao, Tengchao Yu, Jinglai Li
openaire +2 more sources
Discrete Optimization, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LANCIA, Giuseppe +2 more
openaire +1 more source