scholarly journals Balanced Academic Curriculum: Looking For An Optimal Solution With Metaheuristics And Functional Programming

2021 ◽  
Vol 12 (6) ◽  
pp. 1181-1188
Author(s):  
José Miguel Rubio, Et. al.
Keyword(s):  
Programming Language ◽  
Curriculum Design ◽  
Functional Programming ◽  
Firefly Algorithm ◽  
Optimal Solution ◽  
Professional Competencies ◽  
Educational Institutions ◽  
Academic Curriculum ◽  
The Cost ◽  
Computational Solution

The curriculum design is quite a challenge in the academy, mainly because it requires an adequate distribution of content for the development of the expected professional competencies regarding the available time, the necessary academic load, and their gradual progress in the higher educational institutions. Considering the above, the main objective of this work is to present and exemplify a computational solution to minimize the cost of designing curriculum plans using bio-inspired algorithms to automate and reduce errors in such a process. Specifically, the purpose of this research focuses on solving the Curriculum Mesh Balancing (BACP) problem through metaheuristic optimization based on the behavior or algorithm of fireflies and the use of functional programming in the Haskell lang curricular meshes, rolling of curricular meshes, metaheuristics; firefly algorithm, functional programming in Haskell programming language. The firefly algorithm will be applied to a set of test instances to demonstrate its effectiveness. According to the obtained results, this proposal allows the efficient gathering of solutions to the problem under study.

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

OPTIMAL FEASIBLE SOLUTIONS TO A ROAD FREIGHT TRANSPORTATION PROBLEM

2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare
Keyword(s):  
Transportation Problem ◽  
Optimal Solution ◽  
Transportation Cost ◽  
North West ◽  
Life Problems ◽  
Basic Feasible Solutions ◽  
Feasible Solutions ◽  
Road Freight Transportation ◽  
The Cost ◽  
Cost Of Transportation

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.

Optimal Placement of FACTS Devices for Voltage Stability Improvement with Economic Consideration Using Firefly Algorithm

2019 ◽  
Vol 14 (1) ◽  
pp. 5-11
Author(s):  
S. Rajasekaran ◽  
S. Muralidharan
Keyword(s):  
Power Systems ◽  
Voltage Stability ◽  
Firefly Algorithm ◽  
Transmission System ◽  
Operating Conditions ◽  
Optimal Placement ◽  
Voltage Collapse ◽  
Facts Devices ◽  
The Cost ◽  
Bus System

Background: Increasing power demand forces the power systems to operate at their maximum operating conditions. This leads the power system into voltage instability and causes voltage collapse. To avoid this problem, FACTS devices have been used in power systems to increase system stability with much reduced economical ratings. To achieve this, the FACTS devices must be placed in exact location. This paper presents Firefly Algorithm (FA) based optimization method to locate these devices of exact rating and least cost in the transmission system. Methods: Thyristor Controlled Series Capacitor (TCSC) and Static Var Compensator (SVC) are the FACTS devices used in the proposed methodology to enhance the voltage stability of power systems. Considering two objectives of enhancing the voltage stability of the transmission system and minimizing the cost of the FACTS devices, the optimal ratings and cost were identified for the devices under consideration using Firefly algorithm as an optimization tool. Also, a model study had been done with four different cases such as normal case, line outage case, generator outage case and overloading case (140%) for IEEE 14,30,57 and 118 bus systems. Results: The optimal locations to install SVC and TCSC in IEEE 14, 30, 57 and 118 bus systems were evaluated with minimal L-indices and cost using the proposed Firefly algorithm. From the results, it could be inferred that the cost of installing TCSC in IEEE bus system is slightly higher than SVC.For showing the superiority of Firefly algorithm, the results were compared with the already published research finding where this problem was solved using Genetic algorithm and Particle Swarm Optimization. It was revealed that the proposed firefly algorithm gives better optimum solution in minimizing the L-index values for IEEE 30 Bus system. Conclusion: The optimal placement, rating and cost of installation of TCSC and SVC in standard IEEE bus systems which enhanced the voltage stability were evaluated in this work. The need of the FACTS devices was also tested during the abnormal cases such as line outage case, generator outage case and overloading case (140%) with the proposed Firefly algorithm. Outputs reveal that the recognized placement of SVC and TCSC reduces the probability of voltage collapse and cost of the devices in the transmission lines. The capability of Firefly algorithm was also ensured by comparing its results with the results of other algorithms.

scholarly journals Inclusion of Hydraulic Controls in Rehabilitation Models of Drainage Networks to Control Floods

Water ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 514
Author(s):  
Leonardo Bayas-Jiménez ◽  
F. Javier Martínez-Solano ◽  
Pedro L. Iglesias-Rey ◽  
Daniel Mora-Melia ◽  
Vicente S. Fuertes-Miquel
Keyword(s):  
Genetic Algorithm ◽  
Drainage System ◽  
Optimal Solution ◽  
Hydraulic Control ◽  
Drainage Systems ◽  
Storm Water Management Model ◽  
Drainage Networks ◽  
Extreme Rain ◽  
Rain Events ◽  
The Cost

A problem for drainage systems managers is the increase in extreme rain events that are increasing in various parts of the world. Their occurrence produces hydraulic overload in the drainage system and consequently floods. Adapting the existing infrastructure to be able to receive extreme rains without generating consequences for cities’ inhabitants has become a necessity. This research shows a new way to improve drainage systems with minimal investment costs, using for this purpose a novel methodology that considers the inclusion of hydraulic control elements in the network, the installation of storm tanks and the replacement of pipes. The presented methodology uses the Storm Water Management Model for the hydraulic analysis of the network and a modified Genetic Algorithm to optimize the network. In this algorithm, called the Pseudo-Genetic Algorithm, the coding of the chromosomes is integral and has been used in previous studies of hydraulic optimization. This work evaluates the cost of the required infrastructure and the damage caused by floods to find the optimal solution. The main conclusion of this study is that the inclusion of hydraulic controls can reduce the cost of network rehabilitation and decrease flood levels.

scholarly journals Carbon Emission Reduction of Apparel Material Distribution Based on Multi-Objective Genetic Algorithm (NSGA-II)

2019 ◽  
Vol 11 (9) ◽  
pp. 2571
Author(s):  
Xujing Zhang ◽  
Lichuan Wang ◽  
Yan Chen
Keyword(s):  
Genetic Algorithm ◽  
Carbon Emissions ◽  
Optimal Solution ◽  
Material Distribution ◽  
Low Carbon ◽  
Nsga Ii ◽  
Management Objectives ◽  
Multi Objective Genetic Algorithm ◽  
Distribution Process ◽  
The Cost

Low-carbon production has become one of the top management objectives for every industry. In garment manufacturing, the material distribution process always generates high carbon emissions. In order to reduce carbon emissions and the number of operators to meet enterprises’ requirements to control the cost of production and protect the environment, the paths of material distribution were analyzed to find the optimal solution. In this paper, the model of material distribution to obtain minimum carbon emissions and vehicles (operators) was established to optimize the multi-target management in three different production lines (multi-line, U-shape two-line, and U-shape three-line), while the workstations were organized in three ways: in the order of processes, in the type of machines, and in the components of garment. The NSGA-II algorithm (non-dominated sorting genetic algorithm-II) was applied to obtain the results of this model. The feasibility of the model and algorithm was verified by the practice of men’s shirts manufacture. It could be found that material distribution of multi-line layout produced the least carbon emissions when the machines were arranged in the group of type.

Spreadsheet functional programming

2007 ◽  
Vol 17 (1) ◽  
pp. 131-143 ◽  
Author(s):  
DAVID WAKELING
Keyword(s):  
Programming Language ◽  
Functional Programming ◽  
Functional Programming Language

AbstractThe functional programming community has shown some interest in spreadsheets, but surprisingly no one seems to have considered making a standard spreadsheet, such as Excel, work with a standard functional programming language, such as Haskell. In this paper, we show one way that this can be done. Our hope is that by doing so, we might get spreadsheet programmers to give functional programming a try.

An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem

2022 ◽  
Vol 0 (0) ◽  
Author(s):  
Fouzia Amir ◽  
Ali Farajzadeh ◽  
Jehad Alzabut
Keyword(s):  
Multiobjective Optimization ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Convergence Result ◽  
Proximal Method ◽  
Pareto Solution ◽  
Multiobjective Optimization Problems ◽  
Locally Lipschitz ◽  
The Cost ◽  
Constrained Multiobjective Optimization

Abstract Multiobjective optimization is the optimization with several conflicting objective functions. However, it is generally tough to find an optimal solution that satisfies all objectives from a mathematical frame of reference. The main objective of this article is to present an improved proximal method involving quasi-distance for constrained multiobjective optimization problems under the locally Lipschitz condition of the cost function. An instigation to study the proximal method with quasi distances is due to its widespread applications of the quasi distances in computer theory. To study the convergence result, Fritz John’s necessary optimality condition for weak Pareto solution is used. The suitable conditions to guarantee that the cluster points of the generated sequences are Pareto–Clarke critical points are provided.

scholarly journals Managing cost uncertainties in transportation and assignment problems

1998 ◽  
Vol 2 (1) ◽  
pp. 65-104 ◽  
Author(s):  
V. Adlakha ◽  
H. Arsham
Keyword(s):  
Time Lag ◽  
Real Life ◽  
Optimal Solution ◽  
Global Market ◽  
Solution Algorithm ◽  
Assignment Problems ◽  
The Stability ◽  
Order Assignment ◽  
Cost Parameters ◽  
The Cost

In a fast changing global market, a manager is concerned with cost uncertainties of the cost matrix in transportation problems (TP) and assignment problems (AP).A time lag between the development and application of the model could cause cost parameters to assume different values when an optimal assignment is implemented. The manager might wish to determine the responsiveness of the current optimal solution to such uncertainties. A desirable tool is to construct a perturbation set (PS) of cost coeffcients which ensures the stability of an optimal solution under such uncertainties.The widely-used methods of solving the TP and AP are the stepping-stone (SS) method and the Hungarian method, respectively. Both methods fail to provide direct information to construct the needed PS. An added difficulty is that these problems might be highly pivotal degenerate. Therefore, the sensitivity results obtained via the available linear programming (LP) software might be misleading.We propose a unified pivotal solution algorithm for both TP and AP. The algorithm is free of pivotal degeneracy, which may cause cycling, and does not require any extra variables such as slack, surplus, or artificial variables used in dual and primal simplex. The algorithm permits higher-order assignment problems and side-constraints. Computational results comparing the proposed algorithm to the closely-related pivotal solution algorithm, the simplex, via the widely-used pack-age Lindo, are provided. The proposed algorithm has the advantage of being computationally practical, being easy to understand, and providing useful information for managers. The results empower the manager to assess and monitor various types of cost uncertainties encountered in real-life situations. Some illustrative numerical examples are also presented.

Sign in / Sign up

Export Citation Format

Share Document