Bus terminal assignment with the objective of maximizing public transportation service is known as bus terminal location problem (BTLP). According to the No Free Lunch theorem, we design new genetic operators for solving a BTLP by a new approximate memetic algorithm. We also define the potential objective function (POF) for the nodes. To make the memetic algorithm more efficient, we estimate the variation of the objective function based on POF in the local search as part of an operator in the memetic algorithm. The comparative studies show that our memetic algorithm outperforms the multi start simulated annealing algorithm.

Keywords