Abstract
This paper considers a stochastic location-allocation problem for a capacitated bike sharing system (S-L&A-CBSS), in which a bike demand is uncertain. To tackle this uncertainty, a sample average approximation (SAA) method is used. Because this problem is an NP-hard problem, a hybrid greedy evolutionary algorithm based on genetic algorithm (GA) and particle swarm optimization (PSO), namely greedy GA-PSO is embedded in the SAA method in order to solve the given large-sized problems. The performance of the proposed hybrid algorithm is tested by a number of numerical examples and used for empirical test based on Tehran business zone. Furthermore, the associated results show its efficiency in comparison to an exact solution method in solving small-sized problems. Finally, the conclusion is provided.
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.
