Solving multi-objectives function problem using branch and bound and local search methods | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقاله 136، دوره 13، شماره 1، خرداد 2022، صفحه 1649-1658 اصل مقاله (350.79 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2022.5780 | ||
| نویسندگان | ||
| Manal Hashim Ibrahim* ؛ Faez Hassan Ali؛ Hanan Ali Chachan | ||
| Mathematics Dept, Mustansiriyah University, College of Science/ Baghdad, Iraq | ||
| چکیده | ||
| In this paper we consider $1//\sum^n_{j=1}{(E_j+T_j+C_j+U_j+V_j)}$ problem, the discussed problem is called a Multi objectives Function (MOF) problem, As objective is to find a sequence that minimizes the multiple objective functions, the sum earliness, the tardiness, the completion time, the number of late jobs and the late work. The NP-hard nature of the problem, hence the existence of a polynomial time method for finding an optimal solution is unlikely. This complexity result leads us to use an enumeration solution approach. In this paper we propose a branch and bound method to solve this problem. Also, we use fast local search methods yielding near optimal solution. We report on computation experience; the performances of exact and local search methods are tested on large class of test problems. | ||
| کلیدواژهها | ||
| Machine Scheduling with Multi-Objective problem؛ Branch and Bound؛ Simulated Annealing؛ Genetic Algorithm. Optimization؛ Firefly algorithm | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 16,378 تعداد دریافت فایل اصل مقاله: 10,016 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 728 |
| تعداد مقالات | 10,523 |
| تعداد مشاهده مقاله | 73,666,090 |
| تعداد دریافت فایل اصل مقاله | 65,166,045 |