آمار
| تعداد نشریات | 50 |
| تعداد شمارهها | 2,044 |
| تعداد مقالات | 19,130 |
| تعداد مشاهده مقاله | 22,382,922 |
| تعداد دریافت فایل اصل مقاله | 20,899,025 |
Designing a Scatter Search Algorithm for Solving the Lock Scheduling Problem with Non-Identical Parallel Chambers | ||
| Journal of New Researches in Mathematics | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 18 مهر 1401 | ||
| نوع مقاله: research paper | ||
| شناسه دیجیتال (DOI): 10.30495/jnrm.2022.66880.2255 | ||
| نویسندگان | ||
Elaheh Memar-Masjed؛ Mohammad Ranjbar 
| ||
| Department of Industrial Engineering, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran | ||
| چکیده | ||
| In this paper, the scheduling problem of a set of parallel chambers of a lock in maritime transportation is considered. We develop two mixed integer linear programming models to minimize the total waiting time of ships and solve them using the ILOG CPLEX 12.6. Although the lock-based model indicates better performance rather than the time-index model, both are unable to solve large-size instances within one-hour time limit. Due to this, we develop a metaheuristic based on scatter search algorithm which includes a specific solution representation, initial population generation procedure, cross-over operator, repairing operator and local search operator. Computational performances of all developed solution approaches are compared using a set of randomly generated test set. Not only does the scatter search solve all instances in less than one minute, but it also finds the best-found solutions for more than 97% of all instances. Keywords: Lock Scheduling, Parallel Chambers, Scatter Search Algorithm. | ||
| کلیدواژهها | ||
| Lock Scheduling؛ Parallel Chambers؛ Scatter Search Algorithm | ||
|
آمار تعداد مشاهده مقاله: 36 |
||
