Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/702
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Nwana, V | - |
dc.contributor.author | Darby-Dowman, K | - |
dc.contributor.author | Mitra, G | - |
dc.coverage.spatial | 24 | en |
dc.date.accessioned | 2007-04-13T14:42:57Z | - |
dc.date.available | 2007-04-13T14:42:57Z | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | The European Journal of Operational Research (EJOR), 164 (1): 12-23, Jan 2004 | en |
dc.identifier.uri | http://www.elsevier.com/wps/find/journaldescription.cws_home/505543/description#description | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/702 | - |
dc.description.abstract | This paper considers the exact approach of branch and bound (B&B) and the metaheuristic known as simulated annealing (SA) for processing integer programs (IP). We extend an existing SA implementation (GPSIMAN) for pure zero–one integer programs (PZIP) to process a wider class of IP models, namely mixed zero–one integer programs (MZIP). The extensions are based on depth-first B&B searches at different points within the SA framework. We refer to the resultant SA implementation as MIPSA. Furthermore, we have exploited the use of parallel computers by designing a co-operative parallel heuristic whereby concurrent executions of B&B and MIPSA, linked through a parallel computer, exchange information in order to influence their searches. Results reported for a wide range of models taken from a library of MIP benchmarks demonstrate the effectiveness of using a parallel computing approach which combines B&B with SA. | en |
dc.format.extent | 323579 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Elsevier | en |
dc.relation.ispartofseries | The Centre for the Analysis of Risk and Optimisation Modelling Applications (CARISMA), Brunel University;Technical Reports | - |
dc.subject | Branch and bound | en |
dc.subject | Integer programming | en |
dc.subject | Metaheuristics | en |
dc.subject | Parallel computing | en |
dc.subject | Simulated annealing | en |
dc.title | A co-operative parallel heuristic for integer linear programming: Combining simulated annealing with branch & bound | en |
dc.type | Research Paper | en |
Appears in Collections: | Dept of Mathematics Research Papers Mathematical Sciences |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.