Approximate Memetic Algorithm for Solving Bus Terminal Location Problem
عنوان مقاله: Approximate Memetic Algorithm for Solving Bus Terminal Location Problem
شناسه ملی مقاله: ICIORS03_084
منتشر شده در سومین کنفرانس بین المللی انجمن تحقیق در عملیات ایران در سال 1388
شناسه ملی مقاله: ICIORS03_084
منتشر شده در سومین کنفرانس بین المللی انجمن تحقیق در عملیات ایران در سال 1388
مشخصات نویسندگان مقاله:
Reza Ghanbari. - Ferdowsi University of Mashhad - Department of Mathematics-
Nezam Mahdavi-Amiri - Sharif Univ. Tech. - Faculty of Mathematical Sciences
خلاصه مقاله:
Reza Ghanbari. - Ferdowsi University of Mashhad - Department of Mathematics-
Nezam Mahdavi-Amiri - Sharif Univ. Tech. - Faculty of Mathematical Sciences
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.
کلمات کلیدی: Bus terminal location problem; Memetic algorithm; Transportation; Simulated annealing
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/671001/