Convergence of an annealing algorithm
Mathematical Programming: Series A and B
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Genetic local search in combinatorial optimization
CO89 Selected papers of the conference on Combinatorial Optimization
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
Genetic Algorithms Plus Data Structures Equals Evolution Programs
Genetic Algorithms Plus Data Structures Equals Evolution Programs
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Improved Approximation Algorithms for Capacitated Facility Location Problems
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Selected Papers from AISB Workshop on Evolutionary Computing
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Solving the uncapacitated facility location problem using tabu search
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Bus terminal assignment with the objective of maximizing public transportation service is known as bus terminal location problem (BTLP). We formulate the BTLP, a problem of concern in transportation industry, as a p-uncapacitated facility location problem (p-UFLP) with distance constraint. The p-UFLP being NP-hard (Krarup and Pruzan, 1990), we propose evolutionary algorithms for its solution. According to the No Free Lunch theorem and the good efficiency of the distinctive preserve recombination (DPX) operator, we design a new recombination operator for solving a BTLP by new evolutionary and memetic algorithms namely, genetic local search algorithms (GLS). We also define the potential objective function (POF) for the nodes and design a new mutation operator based on POF. To make the memetic algorithm faster, we estimate the variation of the objective function based on POF in the local search as part of an operator in memetic algorithms. Finally, we explore numerically the performance of nine proposed algorithms on over a thousand randomly generated problems and select the best two algorithms for further testing. The comparative studies show that our new hybrid algorithm composing the evolutionary algorithm with the GLS outperforms the multistart simulated annealing algorithm.