An artificial bee colony algorithm for the maximally diverse gro

به نام خدا

Title: An artificial bee colony algorithm for the maximally diverse grouping problem

Authors: Francisco J Rodriguez , M Lozano a , C GarcaMartnez b , Jonathan D GonzlezBarrera

Abstract: In this paper, an artificial bee colony algorithm is proposed to solve the maximally diverse grouping problem. This complex optimization problem consists of forming maximally diverse groups with restricted sizes from a given set of elements. The artificial bee colony algorithm is a new swarm intelligence technique based on the intelligent foraging behavior of honeybees. The behavior of this algorithm is determined by two search strategies: an initialization scheme employed to construct initial solutions and a method for generating neighboring solutions. More specifically, the proposed approach employs a greedy constructive method to accomplish the initialization task and also employs different neighborhood operators inspired by the iterated greedy algorithm. In addition, it incorporates an improvement procedure to enhance the intensification capability. Through an analysis of the experimental results, the highly effective performance of the proposed algorithm is shown in comparison to the current state-of-the-art algorithms which address the problem.   

Publish Year: 2013

Published in: Information Sciences - Science Direct

Number of Pages: 14

موضوع: الگوریتم زنبور عسل (Bee Colony Algorithm)

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت Science Direct

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

A Survey of Ant Colony Optimization-Based Approaches to Routing

به نام خدا

Title: A Survey of Ant Colony Optimization-Based Approaches to Routing in Computer Networks

Authors: Peter Janacik Dalimir Orfanus Adrian Wilke

Abstract: Nature has provided an elegant solution for the routing problem millions of years ago, when ant colonies started to use swarm intelligence to discover food and route it reliably to their formicaries. The approach utilized by ants has several advantages that are also useful in computer networks: complete distribution, load balancing finding shortest paths with a high probability. Several routing protocols designed for the area of computer networks have made use of this approach, called ant colony optimization. This paper provides first a broad overview of ant colony optimization-based routing protocols, while focusing on four selected approaches in later sections, describing their operation and discussing their properties in detail.   

Publish Year: 2013

Published in: ISMS - IEEE

Number of Pages: 6

موضوع: الگوریتم کلونی مورچه‌ها (Ant Colony Algorithm) – مسیریابی هوشمند در شبکه‌های کامپیوتری (Routing in Computer Networks)

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت IEEE

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

 

Three-stage hybrid-flowshop model for cross-docking

به نام خدا

Title: Three-stage hybrid-flowshop model for cross-docking

Authors: Adrien Bellanger , Said Hanafl , Christophe Wilbaut

Abstract: This paper deals with the optimization of a cross-docking system. It is modeled as a three-stage hybrid flowshop, in which shipments and orders are represented as batches. The flrst stage corresponds to the receiving docks, the second stage corresponds to the sorting stations, and the third stage corresponds to the shipping docks. The objective of the problem is to flnd a schedule that minimizes the completion time of the latest batch. In order to obtain good quality feasible solutions, we have developed several heuristic schemes depending on the main stage considered, and several rules to order the batches in this stage. Then, we propose a branch-and-bound algorithm that takes into account the decomposition of the problem into three stages. To evaluate the heuristics and to reduce the tree size during the branch-and-bound computation, we also propose lower bounds. Finally, the computational experi- ments are presented to demonstrate the efflciency of our heuristics. The results show that the exact approach can solve instances containing up to 9 10 batches in each stage (i.e., up to 100 jobs). In addition, our heuristics were evaluated over instances with up to 3000 jobs, and they can provide good quality feasible solutions in a few seconds (i.e., less than 2 s per heuristic).  

Publish Year: 2013

Published in: Computers & Operations Research - Science Direct

Number of Pages: 10

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

A Secure Authentication Protocol among Mobile Phone and Wireless

به نام خدا

Title: A Secure Authentication Protocol among Mobile Phone and Wireless Sensor Networks

Authors: Ndibanje Bruce, Hoon Jae Lee

Abstract: The interaction between mobile phone and wireless sensor networks has increased these days due to the WSN emergence and its ubiquitous nature. Through cellular network, a user can access gateway of wireless sensor networks and gets the data. This paper proposes a secure authentication protocol where a user is strongly verified before accessing the data. The secure authentication proposed protocol provides many security principles to the users for instance user, mutual authentication, and secure session key establishment. Furthermore, security analysis shows .that the proposed protocol possesses many advantages against popular attacks, and achieves better efficiency at low computation cost.   

Publish Year: 2013

Published in:  ICACT - IEEE

Number of Pages: 8

موضوع: امنیت شبکه (Network Security) – احراز هویت (Authentication)

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

Graph Semantic Based Design of XML Data Warehouse: A Conceptual

به نام خدا

Title: Graph Semantic Based Design of XML Data Warehouse: A Conceptual Perspective

Authors: Anirban Sarkar Sankhayan Choudhury Narayan C Debnath

Abstract: This paper has proposed a Graph � semantic based conceptual data model for XML based Data Warehouse (DW) system called GXDW model, to conceptualize the different facets of multidimensional databases which may contain semi- structured data. The model is an extension of object oriented paradigm and defines a set of graph based formal constructs, variety of relationship types with participation constraints. It is accompanied with a rich set of graphical notations those are used to specify the conceptual level design of semi-structured data based DW system. The proposed approach facilitates modeling multidimensional data with the existence of irregular, heterogeneous, partially organized and unordered data set. Moreover, a transformation mechanism also has been proposed for guiding the transformation of GXDW model schema into the related set of XML documents.   

Publish Year: 2012

Published in: INDIN - IEEE

Number of Pages: 6

موضوع: انباره داده (Data Warehouse)

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان