Results 21 to 30 of about 9,166,026 (293)
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
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
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 +4 more sources
A fast, effective local search for scheduling independent jobs in heterogeneous computing environments [PDF]
, 2003 The efficient scheduling of independent computational jobs in a heterogeneous computing (HC) environment is an important problem in domains such as grid computing.
Levine, J., Ritchie, G.
core +3 more sources
Formulation space search approach for the teacher/class timetabling problem [PDF]
Yugoslav Journal of Operations Research, 2008 We consider the well known NP-hard teacher/class timetabling problem. Variable neighborhood search and tabu search heuristics are developed based on idea of the Formulation Space Search approach.
Kochetov Yuri +2 more
doaj +1 more source
Anytime Pareto local search [PDF]
European Journal of Operational Research, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jérémie Dubois-Lacoste +2 more
openaire +4 more sources
Heuristics for NP-hard optimization problems - simpler is better!?
Logistics & Sustainable Transport, 2015 We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at
Žerovnik Janez
doaj +1 more source
Which Local Search Operator Works Best for the Open-Loop TSP?
Applied Sciences, 2019 The traveling salesman problem (TSP) has been widely studied for the classical closed-loop variant. However, very little attention has been paid to the open-loop variant.
Lahari Sengupta +2 more
doaj +1 more source