Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/115314
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Industrial and Systems Engineering | - |
dc.creator | Ran, T | - |
dc.creator | Chai, Z | - |
dc.creator | Xu, M | - |
dc.date.accessioned | 2025-09-19T03:24:03Z | - |
dc.date.available | 2025-09-19T03:24:03Z | - |
dc.identifier.uri | http://hdl.handle.net/10397/115314 | - |
dc.language.iso | en | en_US |
dc.publisher | MDPI | en_US |
dc.rights | © 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/ 4.0/). | en_US |
dc.rights | The following publication Ran, T., Chai, Z., & Xu, M. (2024). Autonomous Truck Scheduling and Platooning Considering Cargo Consolidation. Mathematics, 12(23), 3835 is available at https://doi.org/10.3390/math12233835. | en_US |
dc.subject | Autonomous truck | en_US |
dc.subject | Cargo consolidation | en_US |
dc.subject | Milp model | en_US |
dc.subject | Scheduling and platooning | en_US |
dc.title | Autonomous truck scheduling and platooning considering cargo consolidation | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 12 | - |
dc.identifier.issue | 23 | - |
dc.identifier.doi | 10.3390/math12233835 | - |
dcterms.abstract | Thanks to advancements in automated driving technology, autonomous trucks (ATs) can form platoons with minimal inter-vehicle distances on highways, significantly reducing air drag and fuel consumption for fleets. Given the dispersed distribution and small quantities of cargo, fleet operators should manage ATs to enable cargo consolidation during platooning. In this way, fleet operators can enhance operational efficiency and reduce fuel consumption. This study addresses the AT scheduling and platooning problem considering cargo consolidation. The problem is the scheduling of ATs to transport cargo while consolidating cargo and forming platoons between two terminals, all while minimizing operational costs. A mixed-integer linear programming (MILP) model is formulated for the proposed problem. In addition, we conduct extensive numerical experiments to evaluate the proposed model. The results show that Gurobi can solve instances with different sizes to optimality or near-optimality. Impact analysis is also conducted to explore the influences of several factors, such as maximal platoon size and the load capacity of AT, on the system performance and to provide managerial insights. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Mathematics, 2024, v. 12, no. 23, 3835 | - |
dcterms.isPartOf | Mathematics | - |
dcterms.issued | 2024 | - |
dc.identifier.scopus | 2-s2.0-85211765726 | - |
dc.identifier.eissn | 2227-7390 | - |
dc.identifier.artn | 3835 | - |
dc.description.validate | 202509 bchy | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | CDCF_2024-2025 | en_US |
dc.description.fundingSource | RGC | en_US |
dc.description.fundingText | This work is supported by the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. PolyU 15221821). | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.