z-logo
Premium
Stochastic facility and transfer point covering problem with a soft capacity constraint
Author(s) -
Ebrahimi Zade Amir,
Lotfi M.M.
Publication year - 2017
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12218
Subject(s) - overtime , constraint (computer aided design) , mathematical optimization , computer science , fuzzy logic , linear programming , variance (accounting) , point (geometry) , facility location problem , decision maker , stochastic programming , operations research , service level , constraint programming , service (business) , transfer (computing) , mathematics , statistics , economics , artificial intelligence , geometry , accounting , economy , labour economics , parallel computing
Existing models for transfer point location problems (TPLPs) do not guarantee the desired service time to customers. In this paper, a facility and TPLP is formulated based on a given service time that is targeted by a decision maker. Similar to real‐world situations, transportation times and costs are assumed to be random. In general, facilities are capacitated. However, in emergency services, they are not allowed to reject the customers for out of capacity reasons. Therefore, a soft capacity constraint for the facilities and a second objective to minimize the overtime in the facility with highest assigned demand are proposed. To solve the biobjective model with random variables, a variance minimization technique and chance‐constraint programming are applied. Thereafter, using fuzzy multiple objective linear programming, the proposed biobjective model is converted to a single objective. Computational results on 30 randomly designed experimental problems confirm satisfactory performance of the proposed model in reducing the variance of solutions as well as the overtime in the busiest facility.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here