Exact method for robotic cell problem

Name: Exact method for robotic cell problem
Author: Kharbeche, M., Carlier, J., Haouari, Mohamed, Moukrim, A.

İsim	Exact method for robotic cell problem
Yazar	Kharbeche, M., Carlier, J., Haouari, Mohamed, Moukrim, A.
Basım Tarihi:	2010-08-01
Basım Yeri	- Elsevier
Konu	Robotic cell, Mathematical formulation, GA, Branch and bound
Tür	Belge
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1571-0653
Kayıt Numarası	2d1a5ee2-ed6c-42f6-87de-c67e5e0b286b
Lokasyon	Industrial Engineering
Tarih	2010-08-01
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	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

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Exact method for robotic cell problem

Yazar Kharbeche, M., Carlier, J., Haouari, Mohamed, Moukrim, A.

Basım Tarihi 2010-08-01

Basım Yeri - Elsevier

Konu Robotic cell, Mathematical formulation, GA, Branch and bound

Tür Belge

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1571-0653

Kayıt Numarası 2d1a5ee2-ed6c-42f6-87de-c67e5e0b286b

Lokasyon Industrial Engineering

Tarih 2010-08-01

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin 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