Obálka

A parallel approach to bi-objective integer programming

Uloženo v:
Vydáno v:arXiv.org (Jan 31, 2017), p. n/a
Hlavní autor: Pettersson, William
Další autoři: Ozlen, Melih
Vydáno:
Cornell University Library, arXiv.org
Témata:
Parallel processing
Algorithms
Integer programming
Microprocessors
Tablets
Optimization
Recursive methods
Run time (computers)
On-line přístup:Citation/Abstract
Full text outside of ProQuest
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstrakt:To obtain a better understanding of the trade-offs between various objectives, Bi-Objective Integer Programming (BOIP) algorithms calculate the set of all non-dominated vectors and present these as the solution to a BOIP problem. Historically, these algorithms have been compared in terms of the number of single-objective IPs solved and total CPU time taken to produce the solution to a problem. This is equitable, as researchers can often have access to widely differing amounts of computing power. However, the real world has recently seen a large uptake of multi-core processors in computers, laptops, tablets and even mobile phones. With this in mind, we look at how to best utilise parallel processing to improve the elapsed time of optimisation algorithms. We present two methods of parallelising the recursive algorithm presented by Ozlen, Burton and MacRae. Both new methods utilise two threads and improve running times. One of the new methods, the Meeting algorithm, halves running time to achieve near-perfect parallelisation. The results are compared with the efficiency of parallelisation within the commercial IP solver IBM ILOG CPLEX, and the new methods are both shown to perform better.
ISSN:2331-8422
DOI:10.21914/anziamj.v58i0.11724
Zdroj:Engineering Database