.png){kind=icon}
Return
Fuzzy random programming models for location-allocation problem with applications
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2014.11.013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 a-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. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Fuzzy random programming
Location-allocation problem
Simulation
Genetic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
Cited Papers
Novel dual labelled nanoprobes for nanosafety studies: Quantification and imaging experiment of CuO nanoparticles in C. elegans.png)
Chemosphere
ChemosphereIF0
PREAI
ShareSaveIn Situ Determination of the Nanoscale Chemistry and Behavior of Solid-Liquid SystemsScience
ScienceIF0
PREAI
ShareSave
ShareSave
View more