Untitled

An Optimisation Model to Consider the NIMBY Syndrome within the Landfill Siting Problem

“…Indeed, solving the problem with exact approaches is possible only for small or simple case studies. Many metaheuristic methods are proposed in the literature [37] for solving this problem, such as genetic algorithms [38][39][40][41][42], simulated annealing [43][44][45][46][47] and Tabu search [45,[47][48][49][50][51][52][53]. Extensive literature is also available for heuristic algorithms [45,48,50,54].…”

New Genetic Algorithms Based Approaches to Continuous p-Median Problem

“…Generally binary coded solutions are used, though lately, real coded chromosomes are also being used. In Alp et al (2003), the genes of a chromosome correspond to the indices of the selected facilities. For example, (5, 7, 2, 12) is a chromosome that corresponds to a feasible solution for a 4 median problem where demand points 2, 5, 7, and 12 are selected as facility locations.…”

“…Their simplicity and minimum problem restrictions have made their use attractive in a wide variety of problem domains (Chakraborty et al 1995). Alp et al (2003) proposed a GA particularly for the discrete p-median problem. Their algorithm evolves solutions by taking the union of two solutions and dropping facilities one-at-a-time to generate a feasible solution.…”

Multi-Scenario Cooperative Evolutionary Algorithm for the β-Robust p-Median Problem with Demand Uncertainty

“…Hosage and Goodchild [3] first reported the application of the GA for the p-median problem, and showed the advantage of the GA in the generality for approaching difficult optimization problems. Alp et al [4] improved the efficiency of the GA for solving the p-median problem by integrating the greedy heuristic in the evolution process, which showed better performance than the simulated annealing algorithm proposed by Chiyoshi and Galvão [5]. Correa et al [6] employed a heuristic "hypermutation" operator in the GA to solve the capacitated p-median problem, which obtained better results from a comparison with the Tabu search algorithm.…”