Abstract
This paper investigates an automated truck transportation problem via lane reservation strategy. The focus of the problem is to design lane reservation based paths for time-efficient transportation. The lane reservation strategy requires to select some existing general-purpose lanes from a transportation network and convert them to automated truck lanes in order to ensure the time-guaranteed transportation. However, such conversion may cause traffic impact such as increase of travel time on adjacent lanes due to the disallowing use of the automated truck lanes by the general-purpose vehicles. Thus, the problem aims at optimally designing the time-efficient truck paths while minimizing the impact on the overall network performance. The considered problem is formulated as an integer linear program and is demonstrated NP-hard. To solve it, an optimal algorithm based on the cut-and-solve method is proposed. Numerical computational results of randomly generated instances show the efficiency of the proposed algorithm compared with a referenced software package CPLEX 12.1.
Highlights
Transportation plays a significant role in our daily life, especially for a sustainable development of economy
We studied an automated truck freight transportation concept
The objective of the problem is to minimize the impact of the truck lanes on the overall network performance
Summary
Transportation plays a significant role in our daily life, especially for a sustainable development of economy. Since the truck lanes are used for freight transportation, excluding a large number of general-purpose vehicles, they can keep trucks from getting stuck in traffic and the travel time of the journey can be predictable. In the LRPTCT, some existing general-purpose lanes are optimally selected from the network and reserved for the task paths so that the reserved lanes can provide less travel time and tasks can be completed within the prescribed travel duration. The problem is to optimally design paths for automated trucks via lane reservation strategy Both of the LRPTCT and ATP are intended to optimally design time-guaranteed paths via lane reservation strategy whereas the total impact of reserved lanes is minimized. The contributions of this paper are, first of all, to propose a mathematical (quantitative) method to study an automated truck freight transportation problem via lane reservation strategy.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transportation Research Part C: Emerging Technologies
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
