Fuzzy random programming models for location-allocation problem with applications

Shuya Zhong, Yizeng Chen, Jian Zhou

Research output: Contribution to journalArticlepeer-review

13 Citations (SciVal)

Abstract

Three types of fuzzy random programming models based on the mean chance for the capacitated location-allocation problem with fuzzy random demands are proposed according to different criteria, including the expected cost minimization model, the α-cost minimization model, and the chance maximization model. In order to solve the proposed models, some hybrid intelligent algorithms are designed by integrating the network simplex algorithm, fuzzy random simulation, and genetic algorithm. Finally, some numerical examples about a container freight station problem are given to illustrate the effectiveness of the devised algorithms.

Original languageEnglish
Pages (from-to)194-202
Number of pages9
JournalComputers and Industrial Engineering
Volume89
DOIs
Publication statusE-pub ahead of print - 2 Dec 2014

Bibliographical note

Funding Information:
This work was supported by grants from the National Social Science Foundation of China (No. 13CGL057 ), the National Natural Science Foundation of China (No. 71272177 ), and the Ministry of Education Funded Project for Humanities and Social Sciences Research (No. 12JDXF005 ).

Funding

This work was supported by grants from the National Social Science Foundation of China (No. 13CGL057 ), the National Natural Science Foundation of China (No. 71272177 ), and the Ministry of Education Funded Project for Humanities and Social Sciences Research (No. 12JDXF005 ).

Keywords

  • Fuzzy random programming
  • Genetic algorithm
  • Location-allocation problem
  • Simulation

ASJC Scopus subject areas

  • General Computer Science
  • General Engineering

Fingerprint

Dive into the research topics of 'Fuzzy random programming models for location-allocation problem with applications'. Together they form a unique fingerprint.

Cite this