Abstract
The rollon–rolloff vehicle routing problem (RRVRP) arises when tractors move containers or trailers between locations generating a high volume of waste like construction sites, etc., and a disposal facility. It can be formulated as a node routing problem with asymmetric arc cost and a maximum route length. In this paper we show that a simple and flexible approach which combines standard local search and large neighborhood search moves under two parameter-free/-poor metaheuristic controls outperforms special purpose developments published in the literature. Our results are obtained by customizing a RRVRP-solver from a framework developed for solving rich vehicle routing problem variants.
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 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.
