Stochastic Set-Based Particle Swarm Optimization Based on Local Exploration for Solving the Carpool Service Problem

• Published in: IEEE transactions on cybernetics Vol. 46; no. 8; pp. 1771 - 1783
• Main Authors: Chou, Sheng-Kai, Jiau, Ming-Kai, Huang, Shih-Chia
• Format: Journal Article
• Language: English
• Published: United States IEEE 01.08.2016; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Artificial intelligence; Car pools; Carpool service problem (CSP); Computer simulation; Encoding; Exploration; Genetic algorithms; intelligent carpool system (ICS); Mobile handsets; Optimization; Particle swarm optimization; set-based particle swarm optimization (S-PSO); Stochasticity; Swarm intelligence; Vehicles
• ISSN: 2168-2267; 2168-2275; 2168-2275
• DOI: 10.1109/TCYB.2016.2522471

The growing ubiquity of vehicles has led to increased concerns about environmental issues. These concerns can be mitigated by implementing an effective carpool service. In an intelligent carpool system, an automated service process assists carpool participants in determining routes and matches. It is a discrete optimization problem that involves a system-wide condition as well as participants' expectations. In this paper, we solve the carpool service problem (CSP) to provide satisfactory ride matches. To this end, we developed a particle swarm carpool algorithm based on stochastic set-based particle swarm optimization (PSO). Our method introduces stochastic coding to augment traditional particles, and uses three terminologies to represent a particle: 1) particle position; 2) particle view; and 3) particle velocity. In this way, the set-based PSO (S-PSO) can be realized by local exploration. In the simulation and experiments, two kind of discrete PSOs-S-PSO and binary PSO (BPSO)-and a genetic algorithm (GA) are compared and examined using tested benchmarks that simulate a real-world metropolis. We observed that the S-PSO outperformed the BPSO and the GA thoroughly. Moreover, our method yielded the best result in a statistical test and successfully obtained numerical results for meeting the optimization objectives of the CSP.