Volume 27, Number 1 (IJIEPR 2016)                   IJIEPR 2016, 27(1): 1-19 | Back to browse issues page



DOI: 10.22068/ijiepr.27.1.1

XML Print


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

Zare Mehrjerdi Y, Nadizadeh A. Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands. IJIEPR. 2016; 27 (1) :1-19
URL: http://ijiepr.iust.ac.ir/article-1-354-en.html

Yazd University , yazm2000@yahoo.com
Abstract:   (1768 Views)

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customersthat have fuzzy demands. To model the CLRP_FD, a fuzzy chance constrained program is designed, based on fuzzy credibility theory. To solve the CLRP_FD, a greedy clustering method (GCM) including the stochastic simulation is proposed. Finally, to obtain the best value of the preference index of the model and analysis its influence on the final solutions of the problem, numerical experiments are carried out. Keywords: Capacitated location routing problem, Fuzzy demand, Credibility theory, Stochastic simulation, Ant colony system.

Full-Text [PDF 428 kb]   (1089 Downloads)    
Type of Study: Research | Subject: Logistic & Apply Chain
Received: 2011/11/7 | Accepted: 2015/02/23 | Published: 2016/05/24

Add your comments about this article : Your username or email:
Write the security code in the box

Send email to the article author


© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb