Abstract
The Stacker Crane Problem consists in finding a set of minimum-cost roads starts and stops at the same location to satisfy a set of predefined transportation request assuming to have a server with a capacity one. This work deals with an extension of the stacker crane problem that impose distance and time constraints for the roads. We propose specifically an application to this extension on specific set of on-demand transportation system. We propose also an approach based on Variable Neighborhood Search and iterated greedy metaheuristics to deal with the multi-objective version of this problem. One important feature of our specific algorithm is the use of the distruction/contruction method as a shake function for the Variable Neighborhood Search algorithm. This feature combined with the multi-neighborhood Search led us to a preliminary promising results.
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.
