loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)
A Grid-based Parallel Approach of the Multi-Objective Branch and Bound
Naples, Italy
February 07-February 09
ISBN: 0-7695-2784-1
ASCII Text
x 
 
M. Mezmaz, N. Melab, E-G. Talbi, "A Grid-based Parallel Approach of the Multi-Objective Branch and Bound," Parallel, Distributed, and Network-Based Processing, Euromicro Conference on, pp. 23-30, 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/PDP.2007.7,
author = {M. Mezmaz and N. Melab and E-G. Talbi},
title = {A Grid-based Parallel Approach of the Multi-Objective Branch and Bound},
journal ={Parallel, Distributed, and Network-Based Processing, Euromicro Conference on},
volume = {0},
year = {2007},
issn = {1066-6192},
pages = {23-30},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDP.2007.7},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
TI - A Grid-based Parallel Approach of the Multi-Objective Branch and Bound
SN - 1066-6192
SP23
EP30
A1 - M. Mezmaz,
A1 - N. Melab,
A1 - E-G. Talbi,
PY - 2007
KW - Branch and Bound
KW - Grid Computing
KW - Multi-Objective Optimization
VL - 0
JA - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
ER -
 
M. Mezmaz, UMR CNRS 8022, INRIA Futurs - DOLPHIN Project, Cedex, France
N. Melab, UMR CNRS 8022, INRIA Futurs - DOLPHIN Project, Cedex, France
E-G. Talbi, UMR CNRS 8022, INRIA Futurs - DOLPHIN Project, Cedex, France
The Branch and Bound (B&B) algorithm is one of the most used methods to solve in an exact way combinatorial optimization problems. This article focuses on the multi-objective version of this algorithm, and proposes a new parallel approach adapted to grid computing systems. This approach addresses several issues related to the characteristics of the algorithm itself and the properties of grid computing systems. Validation is performed by experimenting the approach on a bi-objective flow-shop problem instance that has never been solved exactly. Solving this instance, after several days of computation on a grid of more than 1000 processors, belonging to 7 distinct clusters, and the obtained results prove the e?ciency of the proposed approach.
Index Terms:
Branch and Bound, Grid Computing, Multi-Objective Optimization
Citation:
M. Mezmaz, N. Melab, E-G. Talbi, "A Grid-based Parallel Approach of the Multi-Objective Branch and Bound," pdp, pp.23-30, 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.