A Metaheuristic Algorithm to Transporter Scheduling for Assembly Blocks in a Shipyard considering Precedence and Cooperating Constraints
| Autor: | Jianfeng Liu, Ning-rong Tao, Zuhua Jiang, Beixin Xia, Bai-He Li |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
021103 operations research
Article Subject Job shop scheduling Computer science lcsh:Mathematics 0211 other engineering and technologies Scheduling (production processes) 02 engineering and technology Shipyard Topological graph lcsh:QA1-939 Tabu search Time windows Modeling and Simulation Production schedule 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Algorithm Metaheuristic |
| Zdroj: | Discrete Dynamics in Nature and Society, Vol 2019 (2019) |
| ISSN: | 1607-887X 1026-0226 |
| DOI: | 10.1155/2019/2615154 |
| Popis: | Special vehicles named flat transporters are used to deliver heavy ship assembly blocks in shipyards. Because each movement of assembly blocks among workshops needs transporters and the transportations are time-consuming, the scheduling of transporters is important for maintaining the overall production schedule of assembly blocks. This paper considers an optimization transporter scheduling problem for assembly blocks. The objective is to minimize logistics time, which includes empty travel time of transporters and waiting time and delay time of block tasks. Considering time windows of ship blocks, carrying capacity of transporters, and precedence relationships of tasks, a mathematical model is proposed. A hybrid topological graph is used to denote precedence and cooperating relationships of tasks. A metaheuristic algorithm based on the hybrid topological graph and genetic algorithm and Tabu search is proposed. The performance of the algorithm was evaluated by comparing the algorithm to optimal result in small-sized instances and several strategies in large-sized instances. The results showed the efficiency and effectiveness of the proposed algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
| Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |