Results 21 to 30 of about 657,946 (259)
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
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
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
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
An analysis of Harmony Search for solving Sudoku puzzles
Soft Computing Letters, 2021 The Harmony Search metaheuristic has been used to solve many different optimization problems. Several papers examined its effectiveness for solving Sudoku puzzles.
Rachel H. Chae, Amelia C. Regan
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
, 2022 AbstractImprovement methods constitute the backbone of most metaheuristics. These methods repeatedly perform slight, local modifications on a current solution to the problem. Hence, for any solution, a set of neighbor solutions must be defined. Clearly, the definition of this set depends on the problem modeling. However, a natural neighborhood may turn
openaire +1 more source
An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem
Algorithms, 2015 The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence
Kong Lu +5 more
doaj +1 more source
Algorithms, 2021 This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation as a
Mehrdad Amirghasemi
doaj +1 more source