In contrast with the standard and widely studied utility variant, in the ordinal Matroid Secretary Problem (MSP) candidates do not reveal numerical weights but the decision maker can still discern if a candidate is better than another. We consider three competitiveness measures for the ordinal MSP. An algorithm is α ordinal-competitive if for every weight function compatible with the ordinal in...

In this study, solutions for machinery layout with the aim of reducing transportation costs will be discussed. To do this, imperialist competitive algorithm (ICA), which is a very complicated and effective meta-heuristic algorithm is introduced. In the offered algorithm, different kinds of machinery layout are considered in single-row as country and then the best possible layout is developed ba...

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. ...

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. ...

A novel variable-rate vector quantizer (VQ) design algorithm using both fuzzy and competitive learning technique is presented. The algorithm enjoys better rate-distortion performance than that of other existing fuzzy clustering and competitive learning algorithms. In addition, the learning algorithm is less sensitive to the selection of initial reproduction vectors. Therefore, the algorithm can...

In this paper, we present a distributed algorithm for dynamic data replication of an object in a distributed system. The algorithm changes the replication scheme, i.e., number of replicas and their location in the distributed system, to optimize the amount of communication. In other words, the algorithm dynamically adapts the replication scheme of an object to the pattern of read-write requests...

The novel Imperialist Competitive Algorithm (ICA) that was recently introduced has a good performance in some optimization problems. The ICA inspired by socio-political process of imperialistic competition of human being in the real world. In this paper, a new Imperialist Competitive Algorithm with Adaptive Radius of Colonies movement (ICAR) is proposed. In the proposed algorithm, for an effect...

This paper proposes a new approach by combining the Evolutionary Algorithm and Imperialist Competitive Algorithm. This approach tries to capture several people involved in community development characteristic. People live in different type of communities: Monarchy, Republic and Autocracy. People dominion is different in each community. Research work has been undertaken to deal with curse of dim...

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...