Journal ArticleDOI
A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location–Allocation Problem
Said Salhi,M. D. H. Gamal +1 more
TLDR
A GA-based approach is introduced to address the continuous location–allocation problem and specific crossover and mutation operators that rely on the impact of the genes are proposed.Abstract:
A GA-based approach is introduced to address the continuous location–allocation problem. Selection and removal procedures based on groups of chromosomes instead of individual chromosomes are put forward and specific crossover and mutation operators that rely on the impact of the genes are proposed. A new operator that injects once in a while new chromosomes into the population is also introduced. This provides diversity within the search and attempts to avoid early convergence. This approach is tested on existing data sets using several runs to evaluate the robustness of the proposed GA approach.read more
Citations
More filters
Journal ArticleDOI
A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms
TL;DR: The proposed method is the combination of a fuzzy multi-objective programming and a genetic algorithm for the optimization of fire station locations, which has three distinguish features: considering fuzzy nature of a decision maker (DM) in the location optimization model, being more understandable and practical to DM.
A Survey of Solution Methods for the Continuous Location-Allocation Problem
TL;DR: In this paper, a survey of the use of metaheuristic rules for solving the multisource Weber problem is presented, and the new solution methods are discussed for both the well known multi-source Weber problem and its counterpart the capacitated case.
Journal ArticleDOI
New heuristic algorithms for solving the planar p-median problem
TL;DR: A new distribution based variable neighborhood search and a new genetic algorithm are developed and a hybrid algorithm that combines these two approaches is tested, which achieves the best results.
Journal ArticleDOI
Planning the City Logistics Terminal Location by Applying the Green p-Median Model and Type-2 Neurofuzzy Network
TL;DR: Green p-median problem (GMP) is presented which uses the adaptive type-2 neural network for the processing of environmental and sociological parameters including costs of logistics operators and demonstrates the influence of these parameters on planning the location for the city logistics terminal (CLT) within the discrete network.
Book ChapterDOI
Location Allocation Problem
TL;DR: The location-allocation problem is to locate a set of new facilities such that the transportation cost from facilities to customers is minimized and an optimal number of facilities have to be placed in an area of interest in order to satisfy the customer demand.
References
More filters
Journal ArticleDOI
Location-Allocation Problems
TL;DR: The calculational aspects of solving certain classes of location-allocation problems are presented in this article, where exact extremal equations and a heuristic method are presented for solving these problems, and directions for further investigation are also indicated because of the need for methods to shorten the total amount of calculation involved.
Journal ArticleDOI
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem
TL;DR: It is found that most traditional and some recent heuristics give poor results when the number of facilities to locate is large and that Variable Neighbourhood search gives consistently best results, on average, in moderate computing time.
Journal ArticleDOI
Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
TL;DR: This paper examines the application of a genetic algorithm used in conjunction with a local improvement procedure for solving the location-allocation problem, a traditional multifacility location problem, and demonstrated that the genetic algorithm provides the best solutions.
Journal ArticleDOI
Exact and approximate solutions to the multisource weber problem
TL;DR: A branch-and-bound algorithm for exact solution of the problem is developed, and computational experience with it is described.