Utilize este identificador para referenciar este registo:
http://hdl.handle.net/10071/35940Registo completo
| Campo DC | Valor | Idioma |
|---|---|---|
| dc.contributor.author | Yang, Y. | - |
| dc.contributor.author | Sun, S. | - |
| dc.contributor.author | Wu, Y. | - |
| dc.contributor.author | Feng, J. | - |
| dc.contributor.author | Lu, W. | - |
| dc.contributor.author | Wu, L. | - |
| dc.contributor.author | Postolache, O. | - |
| dc.date.accessioned | 2026-01-14T11:51:15Z | - |
| dc.date.available | 2026-01-14T11:51:15Z | - |
| dc.date.issued | 2025 | - |
| dc.identifier.citation | Yang, Y., Sun, S., Wu, Y., Feng, J., Lu, W., Wu, L., & Postolache, O. (2025). Integrating multi-equipment scheduling with accurate AGV path planning for U-shaped automated container terminals. Computers and Industrial Engineering, 209, Article 111427. https://doi.org/10.1016/j.cie.2025.111427 | - |
| dc.identifier.issn | 0360-8352 | - |
| dc.identifier.uri | http://hdl.handle.net/10071/35940 | - |
| dc.description.abstract | In the context of the continuous growth of global container transport demand, people are paying more and more attention to the operational efficiency and energy consumption of automated container terminals (ACTs). This study focuses on the scheduling and path planning of Automated Guided Vehicles (AGVs) in complex environments. It aims to address the challenges that arise from direct interaction of multiple equipment in U-shaped ACTs. In this paper, a multi-equipment cooperative scheduling method based on AGV accurate path planning is proposed for the first time, aiming to minimize the total energy consumption of all equipment. Specifically, we establish a two-layer mathematical model for multi-equipment collaborative scheduling and AGV path planning, considering turning and lane-changing. Then, an Adaptive Genetic Algorithm based on the Jaya strategy and an Accurate Path Planning Algorithm are designed to solve this model. Numerical experiments show that the proposed method can significantly improve the calculation speed and reduce the number of path nodes passed by the AGV. This study provides strong support for terminal managers’ equipment scheduling strategy and energy consumption optimization strategy. | eng |
| dc.language.iso | eng | - |
| dc.publisher | Elsevier | - |
| dc.rights | openAccess | - |
| dc.subject | Intelligent port logistics | eng |
| dc.subject | U-shaped automated container terminals | eng |
| dc.subject | AGV conflict types | eng |
| dc.subject | Accurate path planning algorithm | eng |
| dc.subject | Multi-equipment collaborative scheduling | eng |
| dc.subject | Computational intelligence techniques | eng |
| dc.title | Integrating multi-equipment scheduling with accurate AGV path planning for U-shaped automated container terminals | eng |
| dc.type | article | - |
| dc.peerreviewed | yes | - |
| dc.volume | 209 | - |
| dc.date.updated | 2026-01-14T11:49:40Z | - |
| dc.description.version | info:eu-repo/semantics/publishedVersion | - |
| dc.identifier.doi | 10.1016/j.cie.2025.111427 | - |
| dc.subject.fos | Domínio/Área Científica::Ciências Naturais::Matemáticas | por |
| dc.subject.fos | Domínio/Área Científica::Ciências Naturais::Ciências da Computação e da Informação | por |
| dc.subject.fos | Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Civil | por |
| dc.subject.fos | Domínio/Área Científica::Engenharia e Tecnologia::Outras Engenharias e Tecnologias | por |
| dc.subject.fos | Domínio/Área Científica::Ciências Sociais::Outras Ciências Sociais | por |
| iscte.identifier.ciencia | https://ciencia.iscte-iul.pt/id/ci-pub-115122 | - |
| iscte.alternateIdentifiers.wos | WOS:WOS:001554929700001 | - |
| iscte.alternateIdentifiers.scopus | 2-s2.0-105012773240 | - |
| iscte.journal | Computers and Industrial Engineering | - |
| Aparece nas coleções: | IT-RI - Artigos em revistas científicas internacionais com arbitragem científica | |
Ficheiros deste registo:
| Ficheiro | Tamanho | Formato | |
|---|---|---|---|
| article_115122.pdf | 1,76 MB | Adobe PDF | Ver/Abrir |
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.












