Abstract
In this paper we study the integrated planning problem of determining car-sharing prices between zones of the operating area and routing employees (operators) to relocate cars in preparation for future uncertain demand. We present a novel two-stage integer stochastic programming model for this problem together with a heuristic algorithm, based on Adaptive Large Neighborhood Search (ALNS), to obtain solutions to realistically sized instances. We test the ALNS heuristic on a set of instances generated based on data from a real car-sharing organization and show that it outperforms a commercial solver.
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.
