Abstract

The continuous single-source capacitated multi-facility Weber problem (SSCMFWP) where setup cost of opening facilities is taken into account is investigated. The aim is to locate a set of facilities on the plane, to define their respective capacities which can be linked to the configuration of the processing machines used, and to allocate customers to exactly one facility with the objective being the minimisation of the total transportation and setup costs. A new nonlinear mathematical model based on the SSCMFWP is introduced where Rectilinear and Euclidean distances are used. Efficient metaheuristic approaches based on Variable Neighbourhood Search and Simulated Annealing are also developed. The proposed metaheuristics incorporate an exact method and the commonly used Cooper’s alternate location-allocation method. We also constructed a new data set to reflect the characteristic of this particular location problem as no data set is available in the literature. Computational experiments show that the proposed metaheuristics generate interesting results for this class of continuous location problems.

Highlights

  • The continuous single-source capacitated multi-facility Weber problem (SSCMFWP) is to seek the location of p facilities on the plane and the allocation of each customer to exactly one of the open facilities so that the sum of the total transportation costs is minimised

  • The SSCMFWP is studied where the setup cost of establishing an open facility is based on the capacity which is related to the configuration of the machines used

  • The continuous single-source capacitated multi-facility Weber problem (SSCMFWP) is studied where setup cost of facilities is considered by a set of capacitated machines

Read more

Summary

Introduction

The continuous single-source capacitated multi-facility Weber problem (SSCMFWP) is to seek the location of p facilities on the plane and the allocation of each customer to exactly one of the open facilities so that the sum of the total transportation costs is minimised. The SSCMFWP is studied where the setup cost of establishing an open facility is based on the capacity which is related to the configuration of the machines used. The problem that we study differs from the recent study of Irawan et al (2017) where the authors considered each facility to require one type of machinery only This kind of applications can be found in engineering and manufacturing where the number of machine types is limited to 3 or due to high design cost and due to the limited usage. The conclusions and some highlights of future research are presented in the last section

A review on recent papers on the SSCMFWP
A brief on related continuous location problems
Mathematical formulation
Objective function:
Linearization of the model for the case of rectilinear distance
Mathematical model of the related discrete problem
Solution methods
The proposed VNS approach
Stage 1 of Algorithm 1
19: Local Search 20
A Local Search for the Discrete Problem
Stage 2 of Algorithm 1
The proposed SA approach
Computational Experiments
Computational results on the SSCMFWP-SC using the exact method
81.16 Average Ins 1-4
Computational results on the proposed solution methods
Preliminary Experiments
Experiments on the rectilinear distance
Experiments on the Euclidean distance
Findings
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.