Modeling the fuzzy cold storage problem and its solution by a discrete firefly algorithm

2016 ◽  
Vol 31 (4) ◽  
pp. 2431-2440
Author(s):  
Sichao Lu ◽  
Xifu Wang
Keyword(s):  
Cold Storage ◽  
Firefly Algorithm ◽  
Discrete Firefly Algorithm ◽  
Storage Problem

scholarly journals Mathematical Modeling and Discrete Firefly Algorithm to Optimize Scheduling Problem with Release Date, Sequence-Dependent Setup Time, and Periodic Maintenance

2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Mustafa A. Qamhan ◽  
Ammar A. Qamhan ◽  
Ibrahim M. Al-Harkan ◽  
Yousef A. Alotaibi
Keyword(s):  
Firefly Algorithm ◽  
Programming Model ◽  
Setup Time ◽  
Mixed Integer ◽  
Release Date ◽  
Sequence Dependent ◽  
Sequence Dependent Setup Time ◽  
Periodic Maintenance ◽  
Discrete Firefly Algorithm ◽  
Sequence Dependent Setup

An evolutionary discrete firefly algorithm (EDFA) is presented herein to solve a real-world manufacturing system problem of scheduling a set of jobs on a single machine subject to nonzero release date, sequence-dependent setup time, and periodic maintenance with the objective of minimizing the maximum completion time “makespan.” To evaluate the performance of the proposed EDFA, a new mixed-integer linear programming model is also proposed for small-sized instances. Furthermore, the parameters of the EDFA are regulated using full factorial analysis. Finally, numerical experiments are performed to demonstrate the efficiency and capability of the EDFA in solving the abovementioned problem.

scholarly journals Delay Bound Optimization in NoC Using a Discrete Firefly Algorithm

Electronics ◽  
2019 ◽  
Vol 8 (12) ◽  
pp. 1507
Author(s):  
Gaoming Du ◽  
Chao Tian ◽  
Zhenmin Li ◽  
Duoli Zhang ◽  
Chuan Zhang ◽  
...  
Keyword(s):  
Firefly Algorithm ◽  
Optimization Method ◽  
Video Object ◽  
Worst Case ◽  
Delay Bound ◽  
Proposed Model ◽  
Discrete Firefly Algorithm ◽  
Firefly Optimization ◽  
On Chip ◽  
Bound Optimization

The delay bound in system on chips (SoC) represents the worst-case traverse time of on-chip communication. In network on chip (NoC)-based SoC, optimizing the delay bound is challenging due to two aspects: (1) the delay bound is hard to obtain by traditional methods such as simulation; (2) the delay bound changes with the different application mappings. In this paper, we propose a delay bound optimization method using discrete firefly optimization algorithms (DBFA). First, we present a formal analytical delay bound model based on network calculus for both unipath and multipath routing in NoCs. We then set every flow in the application as the target flow and calculate the delay bound using the proposed model. Finally, we adopt firefly algorithm (FA) as the optimization method for minimizing the delay bound. We used industry patterns (video object plane decoder (VOPD), multiwindow display (MWD), etc.) to verify the effectiveness of delay bound optimization method. Experiments show that the proposed method is both effective and reliable, with a maximum optimization of 42.86%.

Sign in / Sign up

Export Citation Format

Share Document