A capacitated bike sharing location-allocation problem under demand uncertainty using sample average approximation: A greedy Genetic-Particle Swarm Optimization algorithm
Author(s):
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.
Keywords:
Language:
English
Published:
Scientia Iranica, Volume:24 Issue: 5, 2017
Pages:
2567 to 2580
https://www.magiran.com/p1754199
سامانه نویسندگان
مقالات دیگری از این نویسنده (گان)
-
Sustainable Multi-Objective Mathematical Modeling for Selecting a Technology Transfer Method in the Automotive Battery Industry
Amirhossein Latifian, Reza Tavakkoli-Moghaddam *, Masoud Latifian, Mahdi Kashani
journal of Production and Operations Management, Summer 2025 -
Integrated Multi-Model Risk Assessment of an Aging Gas Pipeline Using Fuzzy AHP and 3D Uncertainty Matrix
Arman Gholinezhad Paji*, Ali Borozgi Amiri,
Iranian Journal Of Operations Research, Summer and Autumn 2024