Abstract
In Central Europe transportation accounts for an estimated 30% of the total costs of round timber and is an essential element of cost. In this paper, Tabu Search based methods for solving the Timber Transport Vehicle Routing Problem (TTVRP) are presented. The TTVRP uses solutions of preceding optimization problems as input that are obtained with standard solver software. The presented methods differ with respect to the considered neighborhood and the static or dynamic setting of their parameters. They are verified with real life data in extensive numerical studies and compared to the results obtained with the solver software Xpress. It is shown that the methods are capable to generate good solutions in reasonable computing time.
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: International Journal of Information Systems and Supply Chain Management
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.
