Queueing Maximal Covering Location-Allocation Problem: An Extension with M/G/1 Queueing Systems | Zendy

Foroogh Moeen Moghadas | Zendy; Hossein Taghizadeh Kakhki | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Queueing Maximal Covering Location-Allocation Problem: An Extension with M/G/1 Queueing Systems

Author(s) -

Foroogh Moeen Moghadas,

Hossein Taghizadeh Kakhki

Publication year - 2011

Publication title -

advances in decision sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.178

H-Index - 13

eISSN - 2090-3367

pISSN - 2090-3359

DOI - 10.1155/2011/605629

Subject(s) - queueing theory , grasp , extension (predicate logic) , mathematical optimization , computer science , quadratic equation , layered queueing network , heuristic , decomposition , binary number , quadratic programming , mathematics , computer network , ecology , geometry , arithmetic , biology , programming language

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/G/1 queueing system. We first formulate the problem as a binary quadratic programming problem and then propose a new solution procedure based on decomposition of the problem into smaller binary quadratic sub-problems. The heuristic procedure GRASP is used to solve the sub-problems, as well as the entire model. Some computational results are also presented.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research