The Covering location Problem Considering lost Demand with Genetic Algorithm in Congested Systems
On the networks existing servers and customers, each node indicates a customer demand and demand rate is estimated for them. The edges of the network indicate connective ways among the nods which is usually shown with the distance of two nods or the time of travelling. In the covering location probl...
Main Authors: | Hasan Shavandi, Mehdi Mardane Khameneh |
---|---|
Format: | Article |
Language: | fas |
Published: |
Allameh Tabataba'i University Press
2011-04-01
|
Series: | Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī |
Subjects: | |
Online Access: | https://jims.atu.ac.ir/article_4481_185bfddad7ca40e39653840fcf444d35.pdf |
Similar Items
-
Towards a Global Surveillance System for Lost Containers at Sea
by: Nicolás Molina-Padrón, et al.
Published: (2024-02-01) -
Lost Boston /
by: Kay, Jane Holtz
Published: (1980) -
Lost masterpieces /
by: Dunlop, Beth, 1947-, et al.
Published: (1999) -
Single allocation hub location problem considering zero-one uncertain demands
by: Saeed Pasbani Asl, et al.
Published: (2021-09-01) -
Location problems in the presence of queueing
by: Chiu, Samuel Shin-Wai
Published: (2010)