Author
Kharbeche, M., Carlier, J., Haouari, Mohamed, Moukrim, A.
Publication Date
2010-08-01
Publication Place
-
Elsevier
Subject
Robotic cell, Mathematical formulation, GA, Branch and bound
Type
Document
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
1571-0653
Record ID
2d1a5ee2-ed6c-42f6-87de-c67e5e0b286b
Library Location
Industrial Engineering
Date
2010-08-01
Notes
Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text
This study investigates an exact method for the Robotic Cell Problem. We present an exact branch and bound algorithm which is the first exact procedure specifically designed for this strongly NP-hard problem. In this paper, we propose a new mathematical formulation and we describe a new lower bound for the RCP. In addition, we propose a genetic algorithm. We report that the branch and bound algorithm is more effective than the proposed mathematical formulation which can solve small sized problem. Also, computational study provides evidence that the genetic algorithm delivers reasonably good solutions while requiring significantly shorter CPU times to solve this problem.
DOI
10.1016/j.endm.2010.05.109
Cilt
36
