A crossover-based multi-objective discrete particle swarm optimization model for solving multi-modal routing problems

Abstract

Passengers must use a set of modes and vehicles to reach their destination in complicated urban structures. Choosing an optimal route is a complicated optimization problem for these passengers. This study proposes a multi-objective optimization algorithm to solve the routing problem in the urban multi-modal network. The multi-modal network problem considered in this study is a transportation network with subway, Bus Rapid Transit (BRT), taxi, and walking modes. The objective functions determine the optimized route by considering route length, traffic, comfort, and safety. We develop a Crossover-Based Multi-Objective Discrete Particle Swarm Optimization (CBMODPSO) to solve the problem. CBMODPSO has been improved using mutation and crossover operators. Multi-Objective Artificial Bee Colony (MOABC), Multi-Objective Ant Colony Optimization (MOACO), Multi-Objective Biogeography-Based Optimization (MOBBO), Multi-Objective Gray Wolf Optimization (MOGWO), and Non-dominated Sorting Genetic Algorithm-II (NSGA-II) algorithms are used to evaluate and compare the results from the CBMODPSO algorithm. In addition, CBMODPSO results are compared with previous research results. We show the improved algorithm is more repeatable than other algorithms. The CBMODPSO algorithm has a faster convergence rate and is able to get to an optimal solution in a smaller generation number and much less time. The CBMODPSO algorithm is implemented in about one-thirties of the MOBBO duration. Meanwhile, it has a reproducibility of almost twice the MOGWO algorithm.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 21 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.