Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...

In this paper, we explore the application of Opt-AiNet, an immune network approach for search and optimisation problems, to learning qualitative models in the form of qualitative differential equations. The Opt-AiNet algorithm is adapted to qualitative model learning problems, resulting in the proposed system QML-AiNet. The potential of QML-AiNet to address the scalability and multimodal search...

We consider the two-bar charts packing problem generalizing strongly NP-hard bin problem. prove that remains even if each chart has at least one bar higher than 1/2. If first (or second) of is 1/2, we show O(n2)-time greedy algorithm with lexicographic ordering constructs a length most OPT+1, where OPT optimum, and present an O(n2.5)-time 4/3 ・ OPT+2/3 in case

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

Finding the coordinate-wise maxima and the convex hull of a planar point set are probably the most classic problems in computational geometry. We consider these problems in the selfimproving setting. Here, we have n distributions D1, . . . ,Dn of planar points. An input point set (p1, . . . , pn) is generated by taking an independent sample pi from each Di, so the input is distributed according...

We prove that the Bounded Occurrence Ordering k-CSP Problem is not approximation resistant. We give a very simple local search algorithm that always performs better than the random assignment algorithm (unless, the number of satisfied constraints does not depend on the ordering). Specifically, the expected value of the solution returned by the algorithm is at least Alg ≥ Avg+ α(B, k)(Opt −Avg),...

v

In this work, a new hybrid Symbiotic Organisms Search (SOS) algorithm introduced to design and optimize spatial and planar structures under structural constraints. The SOS algorithm is inspired by the interactive behavior between organisms to propagate in nature. But one of the disadvantages of the SOS algorithm is that due to its vast search space and a large number of organisms, it may trap i...

WalkSAT is a highly successful local search algorithm for the Satissability problem. We show that for 2-SAT, it is complete in that it can reach a solution (if one exists) from any starting point. We leave open the more important case of 3-SAT. WalkSAT is a highly successful local search algorithm for the Satissability problem 2]. The algorithm has been shown to work well on random 3-SAT formul...

In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...