One of the major disadvantages of using Branch and Bound algorithm to solve permutation bases problems by computer is the size of main memory required. The single Array Branch and Bound (SABB) method introduction here aims to overcome this deficiency, using only N memory locations as a vector of size N, and a single cell C with N bits.

Image segmentation is a fundamental step in many of image processing applications. In most cases the image’s pixels are clustered only based on the pixels’ intensity or color information and neither spatial nor neighborhood information of pixels is used in the clustering process. Considering the importance of including spatial information of pixels which improves the quality of image segmentati...

Seas and oceans are the most important sources of renewable energy in the world. The main purpose of this paper is to use an appropriate control strategy to improve the performance of point absorbers. In this scheme, considering the high uncertainty in the parameters of the power take-off system in different atmospheric conditions, a new improved black hole algorithm is introduced to tune fuzzy...

in this paper a scheduling problem in a 2-stage supply chain is discussed. suppliers are in the first stage and in the second stage, there are vehicles which carry orders to a manufacturing center. the purpose is to allocate orders to suppliers, sequence the suppliers’ production, allocate orders to transport vehicles and prioritize orders that should be carried by vehicles to minimize the tota...

This paper introduces a robust task-space control scheme for a robotic system with an adaptive observer. The proposed approach does not require the availability of the system states and an adaptive observer is developed to estimate the state variables. These estimated states are then used in the control scheme. First, the dynamic model of a robot is derived. Next, an observer-based robust contr...

K nearest neighbor algorithm is one of the most frequently used techniques in data mining for its integrity and performance. Though the KNN algorithm is highly effective in many cases, it has some essential deficiencies, which affects the classification accuracy of the algorithm. First, the effectiveness of the algorithm is affected by redundant and irrelevant features. Furthermore, this algori...

this paper studies a new multi-objective fuzzy optimization prob- lem. the objective function of this study has dierent levels. therefore, a suitable optimized solution for this problem would be an optimized solution with preemptive priority. since, the feasible domain is non-convex; the tra- ditional methods cannot be applied. we study this problem and determine some special structures related...

vehicle routing problem (vrp) is one of the major problems in the transportation and distribution planning. in the most previous studies, the objective of vrp models was distance and vehicle related costs. however in many industrial cases along with routing distance, vehicle loading amount is a factor of cost function. in this paper, we formulate a mixed integer non-linear programming (minlp) m...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...