Current Proceedings on Technology

Current Proceedings on Technology

New heuristic and PSO algorithm for Tchebychev distance facility Location problems with a probabilistic line barrier in the plane

Yazarlar: F. Mahmood- Soltani, N. Soltani

Cilt 4 , Sayı - , 2013 , Sayfalar -

Konular:-

Anahtar Kelimeler:PSO,Operations Research,Distance facility

Özet: One of the well established research areas within Operations Research is and has been facility location. Considering barriers in weber location problem is a relatively new research direction within location analysis that takes into account barrier’s traits and its prohibited region for finding location of new facility in the plane. we propose and design an efficient heuristic algorithm and particle swarm optimization (PSO) for solving tchebychev distance facility Location problems with a probabilistic line barrier in the plane. Finally, these algorithms were evaluated by solving some different size of test-problem and their results were compared.

ATIFLAR
Atıf Yapan Eserler
Henüz Atıf Yapılmamıştır
KAYNAK GÖSTER
BibTex
KOPYALA
@article{2013, title={New heuristic and PSO algorithm for Tchebychev distance facility Location problems with a probabilistic line barrier in the plane}, volume={4}, number={0}, publisher={Current Proceedings on Technology }, author={F. Mahmood- Soltani, N. Soltani}, year={2013} }
APA
KOPYALA
F. Mahmood- Soltani, N. Soltani. (2013). New heuristic and PSO algorithm for Tchebychev distance facility Location problems with a probabilistic line barrier in the plane (Vol. 4). Vol. 4. Current Proceedings on Technology .
MLA
KOPYALA
F. Mahmood- Soltani, N. Soltani. New Heuristic and PSO Algorithm for Tchebychev Distance Facility Location Problems with a Probabilistic Line Barrier in the Plane. no. 0, Current Proceedings on Technology , 2013.
Atıf Görüntüle
PDF Görüntüle
Kaynak Görüntüle
Paylaş
Dergi Bilgileri