Genetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network
Hub covering location problem, Network design, Single machine scheduling, Genetic algorithm, Shuffled frog leaping algorithm Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i...
Main Authors: | M. Mohammadi, R. Tavakkoli-Moghaddam, A. Ghodratnama, H. Rostami |
---|---|
Format: | Article |
Language: | English |
Published: |
Iran University of Science & Technology
2011-09-01
|
Series: | International Journal of Industrial Engineering and Production Research |
Subjects: | |
Online Access: | http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-176-3&slc_lang=en&sid=1 |
Similar Items
-
Shuffled Frog-Leaping Programming for Solving Regression Problems
by: M. Abdollahi, et al.
Published: (2020-07-01) -
Shuffled frog leaping algorithm based on quantum rotation angle
by: Hu Bibo
Published: (2020-01-01) -
A Modified Shuffled Frog Leaping Algorithm for the Topology Optimization of Electromagnet Devices
by: Wenjia Yang, et al.
Published: (2020-09-01) -
An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem
by: Kong Lu, et al.
Published: (2015-02-01) -
Using the Modified Shuffled Frog Leaping Algorithm for Optimal Sizing and location of Distributed Generation Resources for Reliability Improvement
by: Morteza Haydari, et al.
Published: (2013-02-01)