Volume 21, Issue 4 (IJIEPM 2011)                   2011, 21(4): 131-139 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Jani M, Shavandi H. The Multipurpose Trip Location Problem on Network under Stochastic Environment. Journal title 2011; 21 (4) :131-139
URL: http://ijiepm.iust.ac.ir/article-1-496-en.html
, shavandi@sharif.edu
Abstract:   (7655 Views)

  In this problem, there are two types of facilities and a network of nods. Facilities can only locate in nodes. There are three types of customers, two groups of which need only one type of services in a single trip, while the third group needs both types of services in a single trip. Customers in order to distance of facilities with a specified probability that related to distance, go to facilities and eliminate their needs. In order to competitors, the objective is maximize market capture for entering facilities. We use tabu search for solve this problem .

Full-Text [PDF 572 kb]   (2321 Downloads)    

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.