Solving a location-allocation problem by a fuzzy self-adaptive NSGA-II
Authors
Abstract:
This paper proposes a modified non-dominated sorting genetic algorithm (NSGA-II) for a bi-objective location-allocation model. The purpose is to define the best places and capacity of the distribution centers as well as to allocate consumers, in such a way that uncertain consumers demands are satisfied. The objectives of the mixed-integer non-linear programming (MINLP) model are to (1) minimize the total cost of the network and (2) maximize the utilization of distribution centers. To solve the problem, a fuzzy modified NSGA-II with local search is proposed. To illustrate the results, computational experiments are generated and solved. The experimental results demonstrate that the performance metrics of the fuzzy modified NSGA-II is better than the original NSGA-II.
similar resources
Solving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem
It is observed that the separated design of location for depots and routing for servicing customers often reach a suboptimal solution. So, solving location and routing problem simultaneously could achieve better results. In this paper, waste collection problem is considered with regard to economic and societal objective functions. A non-dominated sorting genetic algorithm (NSGA-II) is used to l...
full textDeveloping a bi-objective optimization model for solving the availability allocation problem in repairable series–parallel systems by NSGA II
Bi-objective optimization of the availability allocation problem in a series–parallel system with repairable components is aimed in this paper. The two objectives of the problem are the availability of the system and the total cost of the system. Regarding the previous studies in series–parallel systems, the main contribution of this study is to expand the redundancy allocation problems to syst...
full textSolving a multi-depot location-routing problem with heterogeneous vehicles and fuzzy travel times by a meta-heuristic algorithm
A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...
full textExact algorithms for solving a bi-level location–allocation problem considering customer preferences
The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonlinear model presented in the literature considering customer preferences is linearized. Customer behavior ...
full textA New Hybrid Algorithm to Optimize Stochastic-fuzzy Capacitated Multi-Facility Location-allocation Problem
Facility location-allocation models are used in a widespread variety of applications to determine the number of required facility along with the relevant allocation process. In this paper, a new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customer's locations and fuzzy customer’s demands under the Hurwicz criterion is proposed. Thi...
full textSolving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm
A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...
full textMy Resources
Journal title
volume 12 issue 4
pages 18- 26
publication date 2020-01-31
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023