Hybrid Cell Selection-based Heuristic for capacitated multi-facility Weber problem with continuous fixed costs
نویسندگان
چکیده
Location-allocation problem (LAP) has attracted much attention in facility location field. The LAP continuous plane is well-known as Weber problem. This paper assessed this by considering capacity constraints and fixed costs each different setup cost limit to serve customers. Previous studies considered profitable areas dividing space into a discrete number of equal cells identify optimal locations from smaller set promising locations. Unfortunately, it may lead avoid choosing good because unprofitable are still while locating the facilities. Hence, allows significant increment transportation costs. Thus, intelligently selected area through hybridization enhanced Cell Selection-based Heuristic (CSBH) Furthest Distance Rule (FDR) minimize total CSBH divides customer distribution increase possibility finding better locations, FDR aims forbid new facilities be close previously Numerical experiments tested on benchmark datasets showed that results hybrid heuristic outperformed single FDR, producing competitive when compared with published results, apart significantly improving cost. simple yet effective solving LAP.
منابع مشابه
A Cross Entropy-based heuristic for the capacitated multi-source Weber problem with facility fixed cost
This paper investigates a capacitated planar location-allocation problem with facility fixed cost. A zonebased fixed cost which consists of production and installation costs is considered. A nonlinear and mixed integer formulation is first presented. A powerful three stage Cross Entropy meta-heuristic with novel density functions is proposed. In the first stage a covering location problem provi...
متن کاملA Beam Search Heuristic for the Multi- commodity Capacitated Multi-facility Weber Problem
The Multi-Commodity Capacitated Multi-facility Weber Problem (MCMWP) is concerned with locating I capacitated facilities in the plane to satisfy the demand of J customers for K commodities with the minimum total transportation cost. The MCMWP is a non-convex optimization problem. Customer locations, demands and capacities for each commodity are known a priori. The transportation costs, which de...
متن کاملA perturbation-based heuristic for the capacitated multisource Weber problem
This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. This procedure is based on an effective use of borderline customers. Several implementations are considered and the two most appropriate are then computationally enhanced by using a reduced neighbourhood when solving the transportation problem. Computational results are presented using data sets fr...
متن کاملA continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
We propose a primal-dual continuation approach for the capacitated multifacilityWeber problem (CMFWP) based on its nonlinear second-order cone program (SOCP) reformulation. The main idea of the approach is to reformulate the CMFWP as a nonlinear SOCP with a nonconvex objective function, and then introduce a logarithmic barrier term and a quadratic proximal term into the objective to construct a...
متن کاملEfficient Heuristics for Single-source Capacitated Multi- Facility Weber Problems
In this paper, a single-source capacitated multifacility location problem with rectilinear distance under unbalanced transportation constraints is studied. The problem is formulated as a mixed integer linear programming problem of which the objective function is the sum of nonlinear functions. An algorithm under decomposition approach combining with logic based techniques is developed. Using th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2021
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2021077