Skip to Main Content
This paper resents a multiobjective genetic algorithm (MOGA) to find the optimal guideway networks (GNs) of personal rapid transit (PRT). The objective of the GN design problem (GNDP) is to find the GNs that minimize the construction cost and peak-hour traffic while satisfying the connectivity constraint To solve the GNDP, we develop an MOGA by modifying an improved n on dominated sorting genetic algorithm (NSGA-II. The developed MOGA inherits the advantages of NSGA-II and adopts a GNDP-specific mutation operator, which provides better solution quality. To verify the effectiveness and efficiency of the developed MOGA, we conducted numerical experiments on the GNDPs with up to 15 stations and 210 links.