A Novel Formulation for Multi-objective optimization of General Finite Single-Server Queueing Networks
- 1 July 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Abstract
A new mathematical programming formulation is proposed for an optimization problem in queueing networks. The sum of the blocking probabilities of a general service time, single server, finite, acyclic queueing network is minimized, as are the total butter sizes and the overall service rates. A multi-objective genetic algorithm (MOGA) and a particle swarm optimization (MOPSO) algorithm are combined to solve this difficult stochastic problem. The derived algorithm produces a set of efficient solutions for multiple objectives in the objective function. The implementation of the optimization algorithms is dependent on the generalized expansion method (GEM), a classical tool used to evaluate the performance of finite queueing networks. A set of computational experiments is presented to attest to the efficacy and efficiency of the proposed approach. Insights obtained from the analysis of a complex network may assist in the planning of these types of queueing networks.Keywords
This publication has 38 references indexed in Scilit:
- Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and BuffersMathematical Problems in Engineering, 2012
- Performance optimization of open zero-buffer multi-server queueing networksComputers & Operations Research, 2010
- A repairable queueing model with two-phase service, start-up times and retrial customersComputers & Operations Research, 2010
- Buffer and throughput trade-offs in M/G/1/K queueing networks: A bi-criteria approachInternational Journal of Production Economics, 2010
- Topological network design of general, finite, multi-server queueing networksEuropean Journal of Operational Research, 2010
- Buffer and server allocation in general multi‐server queueing networksInternational Transactions in Operational Research, 2010
- An analytic finite capacity queueing network model capturing the propagation of congestion and blockingEuropean Journal of Operational Research, 2009
- The buffer allocation problem for general finite buffer queueing networksIIE Transactions, 2005
- QoS issues in Web servicesIEEE Internet Computing, 2002
- The generalized expansion method for open finite queueing networksEuropean Journal of Operational Research, 1987