New stochastic models for capacitated location–allocation problem

New stochastic models for capacitated location–allocation problem

0.00 Avg rating0 Votes
Article ID: iaor20033085
Country: Netherlands
Volume: 45
Issue: 1
Start Page Number: 111
End Page Number: 125
Publication Date: Jun 2003
Journal: Computers & Industrial Engineering
Authors: ,
Keywords: programming: probabilistic
Abstract:

Capacitated location–allocation problem with stochastic demands is originally formulated as expected value model, chance-constrained programming and dependent-chance programming according to different criteria. For solving these stochastic models efficiently, the network simplex algorithm, stochastic simulation and genetic algorithm are integrated to produce a hybrid intelligent algorithm. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed algorithm.

Reviews

Required fields are marked *. Your email address will not be published.