Abstract
A recent study has developed an integer linear program and an exact algorithm for the automated truck transportation freight problem with lane reservation. However, due to its NP-hard nature, their proposed method becomes difficult to solve large-size problems within acceptable time. In this paper, we firstly present an improved integer linear program by adding valid inequalities and identify that its several special cases are classical combinatorial optimization problems. Based on analyzed properties, a new efficient two-phase exact algorithm is developed. Computational results on benchmark and new larger-size instances with up to 700 nodes and 55 tasks show that the new algorithm outperforms very favorably the state-of-the-art one.
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 callDisclaimer: 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.
