Local search methods to solve multiple objective function
Other Title(s)
طرق البحث المحلية لحل دالة هدف متعددة
Joint Authors
al-Zuwayni, Muhammad Kazim
Husayn, Najah Ali
Source
al-Qadisiyah Journal for Computer Science and Mathematics
Issue
Vol. 6, Issue 1 (30 Jun. 2014), pp.57-74, 18 p.
Publisher
University of al-Qadisiyah College of computer Science and Information Technology
Publication Date
2014-06-30
Country of Publication
Iraq
No. of Pages
18
Main Subjects
Information Technology and Computer Science
Abstract EN
In this paper we considered the problem of scheduling n jobs on a single machine.
Our aim in this study is to find the near optimal solution to minimize the cost of total flow time and maximum earliness with unequal ready times.
Different local search methods: (Descent Method, Adjacent Pairwise Interchange Method, Simulated Annealing, Genetic Algorithm) are developed, compared, and tested for the problem.
We investigate the influence of the parameters variance for these local search methods, and empirically analyze their starting solutions.
Computational experience found that these local search algorithms can solve the problem up to (23000) jobs with reasonable time.
Also we found that: the Genetic algorithm is the best local search heuristic algorithm for our problem when the size is less than or equal to (1500) jobs, and for problems of large size the Simulated Annealing was recommended.
American Psychological Association (APA)
al-Zuwayni, Muhammad Kazim& Husayn, Najah Ali. 2014. Local search methods to solve multiple objective function. al-Qadisiyah Journal for Computer Science and Mathematics،Vol. 6, no. 1, pp.57-74.
https://search.emarefa.net/detail/BIM-796614
Modern Language Association (MLA)
al-Zuwayni, Muhammad Kazim& Husayn, Najah Ali. Local search methods to solve multiple objective function. al-Qadisiyah Journal for Computer Science and Mathematics Vol. 6, no. 1 (2014), pp.57-74.
https://search.emarefa.net/detail/BIM-796614
American Medical Association (AMA)
al-Zuwayni, Muhammad Kazim& Husayn, Najah Ali. Local search methods to solve multiple objective function. al-Qadisiyah Journal for Computer Science and Mathematics. 2014. Vol. 6, no. 1, pp.57-74.
https://search.emarefa.net/detail/BIM-796614
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 74
Record ID
BIM-796614