Abstract

The service system design problem aims to select the location and capacity of service facilities, and the assignment of customers to them in order to minimize the setup, access, and waiting time costs. We address the case when there is uncertainty about the demand for service, considering a service system that can be modeled as an independent network of M/M/1 queues. Robust optimization, with both budget and ball uncertainty sets, is used when the demand rate is unknown, but the arrival pattern can still be reasonably approximated as a Poisson process. Furthermore, we use distributionally robust optimization with a Wasserstein ambiguity set to address the case when the demand distribution is estimated from a limited sample. We are able to reformulate both the robust and distributionally robust problems as mixed-integer second-order cone programs that can be solved directly on commercial solvers. Extensive numerical experiments on benchmark test instances are conducted to compare the proposed approaches and to investigate the effect of problem size and parameters.

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.