Search results for: paper airplane problem
28635 A Heuristic Based Decomposition Approach for a Hierarchical Production Planning Problem
Authors: Nusrat T. Chowdhury, M. F. Baki, A. Azab
Abstract:
The production planning problem is concerned with specifying the optimal quantities to produce in order to meet the demand for a prespecified planning horizon with the least possible expenditure. Making the right decisions in production planning will affect directly the performance and productivity of a manufacturing firm, which is important for its ability to compete in the market. Therefore, developing and improving solution procedures for production planning problems is very significant. In this paper, we develop a Dantzig-Wolfe decomposition of a multi-item hierarchical production planning problem with capacity constraint and present a column generation approach to solve the problem. The original Mixed Integer Linear Programming model of the problem is decomposed item by item into a master problem and a number of subproblems. The capacity constraint is considered as the linking constraint between the master problem and the subproblems. The subproblems are solved using the dynamic programming approach. We also propose a multi-step iterative capacity allocation heuristic procedure to handle any kind of infeasibility that arises while solving the problem. We compare the computational performance of the developed solution approach against the state-of-the-art heuristic procedure available in the literature. The results show that the proposed heuristic-based decomposition approach improves the solution quality by 20% as compared to the literature.Keywords: inventory, multi-level capacitated lot-sizing, emission control, setup carryover
Procedia PDF Downloads 10428634 Optimal Dynamic Economic Load Dispatch Using Artificial Immune System
Authors: I. A. Farhat
Abstract:
The dynamic economic dispatch (DED) problem is one of the complex, constrained optimization problems that have nonlinear, con-convex and non-smooth objective functions. The purpose of the DED is to determine the optimal economic operation of the committed units while meeting the load demand. Associated to this constrained problem there exist highly nonlinear and non-convex practical constraints to be satisfied. Therefore, classical and derivative-based methods are likely not to converge to an optimal or near optimal solution to such a dynamic and large-scale problem. In this paper, an Artificial Immune System technique (AIS) is implemented and applied to solve the DED problem considering the transmission power losses and the valve-point effects in addition to the other operational constraints. To demonstrate the effectiveness of the proposed technique, two case studies are considered. The results obtained using the AIS are compared to those obtained by other methods reported in the literature and found better.Keywords: artificial immune system, dynamic economic dispatch, optimal economic operation, large-scale problem
Procedia PDF Downloads 21028633 Testing of Electronic Control Unit Communication Interface
Authors: Petr Šimek, Kamil Kostruk
Abstract:
This paper deals with the problem of testing the Electronic Control Unit (ECU) for the specified function validation. Modern ECUs have many functions which need to be tested. This process requires tracking between the test and the specification. The technique discussed in this paper explores the system for automating this process. The paper focuses in its chapter IV on the introduction to the problem in general, then it describes the proposed test system concept and its principle. It looks at how the process of the ECU interface specification file for automated interface testing and test tracking works. In the end, the future possible development of the project is discussed.Keywords: electronic control unit testing, embedded system, test generate, test automation, process automation, CAN bus, ethernet
Procedia PDF Downloads 7828632 Ubiquitous Scaffold Learning Environment Using Problem-based Learning Activities to Enhance Problem-solving Skills and Context Awareness
Authors: Noppadon Phumeechanya, Panita Wannapiroon
Abstract:
The purpose of this research is to design the ubiquitous scaffold learning environment using problem-based learning activities that enhance problem-solving skills and context awareness, and to evaluate the suitability of the ubiquitous scaffold learning environment using problem-based learning activities. We divide the research procedures into two phases. The first phase is to design the ubiquitous scaffold learning environment using problem-based learning activities, and the second is to evaluate the ubiquitous scaffold learning environment using problem-based learning activities. The sample group in this study consists of five experts selected using the purposive sampling method. We analyse data by arithmetic mean and standard deviation. The research findings are as follows; the ubiquitous scaffold learning environment using problem-based learning activities consists of three major steps, the first is preparation before learning. This prepares learners to acknowledge details and learn through u-LMS. The second is the learning process, where learning activities happen in the ubiquitous learning environment and learners learn online with scaffold systems for each step of problem solving. The third step is measurement and evaluation. The experts agree that the ubiquitous scaffold learning environment using problem-based learning activities is highly appropriate.Keywords: ubiquitous learning environment scaffolding, learning activities, problem-based learning, problem-solving skills, context awareness
Procedia PDF Downloads 47328631 Criminals not Addicts: Newspaper Framing of Gambling-Related Crimes
Authors: Cameron Brown, Jessica Vanburen, Scott Hunt
Abstract:
This study analyzed 411 international newspaper stories pertaining to gambling-related crimes from January 2013 to December 2014. These stories included accounts of crimes committed to fund gambling or pay gambling debts or that occurred at gambling establishments. Our analysis pays particular attention to those crimes that were imputed to be committed by “problem” or “addictive” gamblers, who commit crimes to fund gambling or pay gambling debts. Previous research on problem/addictive gambling has focused on its etiology or prevalence rates and has not attended to the media portrayals of this behavior and its association with crime. Using frame analysis concepts, the data demonstrate that the newspaper stories typically frame the events as “crimes” and not the result of illness or addiction. The “evidence” of motive that could have indicated psychological problems or additions were rather framed as “criminal motive.” This framing practice advances an identity of a “problem/addictive gambler” as a deviant criminal perpetrator and not a victim of addiction. The paper concludes with a discussion of how these findings can be used to advance research on social portrayals of problem/addictive gamblers. Specifically, we consider how these media frames impede an understanding of problem/addictive gambling as a public health problem.Keywords: problem gambling, addictive gambling, identity resonace, frame analysis
Procedia PDF Downloads 27028630 Parameter Estimation of False Dynamic EIV Model with Additive Uncertainty
Authors: Dalvinder Kaur Mangal
Abstract:
For the past decade, noise corrupted output measurements have been a fundamental research problem to be investigated. On the other hand, the estimation of the parameters for linear dynamic systems when also the input is affected by noise is recognized as more difficult problem which only recently has received increasing attention. Representations where errors or measurement noises/disturbances are present on both the inputs and outputs are usually called errors-in-variables (EIV) models. These disturbances may also have additive effects which are also considered in this paper. Parameter estimation of false EIV problem using equation error, output error and iterative prefiltering identification schemes with and without additive uncertainty, when only the output observation is corrupted by noise has been dealt in this paper. The comparative study of these three schemes has also been carried out.Keywords: errors-in-variable (EIV), false EIV, equation error, output error, iterative prefiltering, Gaussian noise
Procedia PDF Downloads 45828629 Online Robust Model Predictive Control for Linear Fractional Transformation Systems Using Linear Matrix Inequalities
Authors: Peyman Sindareh Esfahani, Jeffery Kurt Pieper
Abstract:
In this paper, the problem of robust model predictive control (MPC) for discrete-time linear systems in linear fractional transformation form with structured uncertainty and norm-bounded disturbance is investigated. The problem of minimization of the cost function for MPC design is converted to minimization of the worst case of the cost function. Then, this problem is reduced to minimization of an upper bound of the cost function subject to a terminal inequality satisfying the l2-norm of the closed loop system. The characteristic of the linear fractional transformation system is taken into account, and by using some mathematical tools, the robust predictive controller design problem is turned into a linear matrix inequality minimization problem. Afterwards, a formulation which includes an integrator to improve the performance of the proposed robust model predictive controller in steady state condition is studied. The validity of the approaches is illustrated through a robust control benchmark problem.Keywords: linear fractional transformation, linear matrix inequality, robust model predictive control, state feedback control
Procedia PDF Downloads 36828628 Young Children’s Use of Representations in Problem Solving
Authors: Kamariah Abu Bakar, Jennifer Way
Abstract:
This study investigated how young children (six years old) constructed and used representations in mathematics classroom; particularly in problem solving. The purpose of this study is to explore the ways children used representations in solving addition problems and to determine whether their representations can play a supportive role in understanding the problem situation and solving them correctly. Data collection includes observations, children’s artifact, photographs and conversation with children during task completion. The results revealed that children were able to construct and use various representations in solving problems. However, they have certain preferences in generating representations to support their problem solving.Keywords: young children, representations, addition, problem solving
Procedia PDF Downloads 42528627 3D Numerical Studies on External Aerodynamics of a Flying Car
Authors: Sasitharan Ambicapathy, J. Vignesh, P. Sivaraj, Godfrey Derek Sams, K. Sabarinath, V. R. Sanal Kumar
Abstract:
The external flow simulation of a flying car at take off phase is a daunting task owing to the fact that the prediction of the transient unsteady flow features during its deployment phase is very complex. In this paper 3D numerical simulations of external flow of Ferrari F430 proposed flying car with different NACA 9618 rectangular wings have been carried. Additionally, the aerodynamics characteristics have been generated for optimizing its geometry for achieving the minimum take off velocity with better overall performance in both road and air. The three-dimensional standard k-omega turbulence model has been used for capturing the intrinsic flow physics during the take off phase. In the numerical study, a fully implicit finite volume scheme of the compressible, Reynolds-Averaged, Navier-Stokes equations is employed. Through the detailed parametric analytical studies we have conjectured that Ferrari F430 flying car facilitated with high wings having three different deployment histories during the take off phase is the best choice for accomplishing its better performance for the commercial applications.Keywords: aerodynamics of flying car, air taxi, negative lift, roadable airplane
Procedia PDF Downloads 39228626 Two-Stage Approach for Solving the Multi-Objective Optimization Problem on Combinatorial Configurations
Authors: Liudmyla Koliechkina, Olena Dvirna
Abstract:
The statement of the multi-objective optimization problem on combinatorial configurations is formulated, and the approach to its solution is proposed. The problem is of interest as a combinatorial optimization one with many criteria, which is a model of many applied tasks. The approach to solving the multi-objective optimization problem on combinatorial configurations consists of two stages; the first is the reduction of the multi-objective problem to the single criterion based on existing multi-objective optimization methods, the second stage solves the directly replaced single criterion combinatorial optimization problem by the horizontal combinatorial method. This approach provides the optimal solution to the multi-objective optimization problem on combinatorial configurations, taking into account additional restrictions for a finite number of steps.Keywords: discrete set, linear combinatorial optimization, multi-objective optimization, Pareto solutions, partial permutation set, structural graph
Procedia PDF Downloads 13628625 Cars Redistribution Optimization Problem in the Free-Float Car-Sharing
Authors: Amine Ait-Ouahmed, Didier Josselin, Fen Zhou
Abstract:
Free-Float car-sharing is an one-way car-sharing service where cars are available anytime and anywhere in the streets such that no dedicated stations are needed. This means that after driving a car you can park it anywhere. This car-sharing system creates an imbalance car distribution in the cites which can be regulated by staff agents through the redistribution of cars. In this paper, we aim to solve the car-reservation and agents traveling problem so that the number of successful cars’ reservations could be maximized. Beside, we also tend to minimize the distance traveled by agents for cars redistribution. To this end, we present a mixed integer linear programming formulation for the car-sharing problem.Keywords: one-way car-sharing, vehicle redistribution, car reservation, linear programming
Procedia PDF Downloads 31528624 Indoor Localization by Pattern Matching Method Based on Extended Database
Authors: Gyumin Hwang, Jihong Lee
Abstract:
This paper studied the CSS-based indoor localization system which is easy to implement, inexpensive to compose the systems, additionally CSS-based indoor localization system covers larger area than other system. However, this system has problem which is affected by reflected distance data. This problem in localization is caused by the multi-path effect. Error caused by multi-path is difficult to be corrected because the indoor environment cannot be described. In this paper, in order to solve the problem by multi-path, we have supplemented the localization system by using pattern matching method based on extended database. Thereby, this method improves precision of estimated. Also this method is verified by experiments in gymnasium. Database was constructed by 1 m intervals, and 16 sample data were collected from random position inside the region of DB points. As a result, this paper shows higher accuracy than existing method through graph and table.Keywords: chirp spread spectrum, indoor localization, pattern-matching, time of arrival, multi-path, mahalanobis distance, reception rate, simultaneous localization and mapping, laser range finder
Procedia PDF Downloads 21728623 A Study of Using Multiple Subproblems in Dantzig-Wolfe Decomposition of Linear Programming
Authors: William Chung
Abstract:
This paper is to study the use of multiple subproblems in Dantzig-Wolfe decomposition of linear programming (DW-LP). Traditionally, the decomposed LP consists of one LP master problem and one LP subproblem. The master problem and the subproblem is solved alternatively by exchanging the dual prices of the master problem and the proposals of the subproblem until the LP is solved. It is well known that convergence is slow with a long tail of near-optimal solutions (asymptotic convergence). Hence, the performance of DW-LP highly depends upon the number of decomposition steps. If the decomposition steps can be greatly reduced, the performance of DW-LP can be improved significantly. To reduce the number of decomposition steps, one of the methods is to increase the number of proposals from the subproblem to the master problem. To do so, we propose to add a quadratic approximation function to the LP subproblem in order to develop a set of approximate-LP subproblems (multiple subproblems). Consequently, in each decomposition step, multiple subproblems are solved for providing multiple proposals to the master problem. The number of decomposition steps can be reduced greatly. Note that each approximate-LP subproblem is nonlinear programming, and solving the LP subproblem must faster than solving the nonlinear multiple subproblems. Hence, using multiple subproblems in DW-LP is the tradeoff between the number of approximate-LP subproblems being formed and the decomposition steps. In this paper, we derive the corresponding algorithms and provide some simple computational results. Some properties of the resulting algorithms are also given.Keywords: approximate subproblem, Dantzig-Wolfe decomposition, large-scale models, multiple subproblems
Procedia PDF Downloads 13228622 On Optimum Stratification
Authors: M. G. M. Khan, V. D. Prasad, D. K. Rao
Abstract:
In this manuscript, we discuss the problem of determining the optimum stratification of a study (or main) variable based on the auxiliary variable that follows a uniform distribution. If the stratification of survey variable is made using the auxiliary variable it may lead to substantial gains in precision of the estimates. This problem is formulated as a Nonlinear Programming Problem (NLPP), which turn out to multistage decision problem and is solved using dynamic programming technique.Keywords: auxiliary variable, dynamic programming technique, nonlinear programming problem, optimum stratification, uniform distribution
Procedia PDF Downloads 30128621 Multiple Positive Solutions for Boundary Value Problem of Nonlinear Fractional Differential Equation
Authors: A. Guezane-Lakoud, S. Bensebaa
Abstract:
In this paper, we study a boundary value problem of nonlinear fractional differential equation. Existence and positivity results of solutions are obtained.Keywords: positive solution, fractional caputo derivative, Banach contraction principle, Avery and Peterson fixed point theorem
Procedia PDF Downloads 38228620 Solving Optimal Control of Semilinear Elliptic Variational Inequalities Obstacle Problems using Smoothing Functions
Authors: El Hassene Osmani, Mounir Haddou, Naceurdine Bensalem
Abstract:
In this paper, we investigate optimal control problems governed by semilinear elliptic variational inequalities involving constraints on the state, and more precisely, the obstacle problem. We present a relaxed formulation for the problem using smoothing functions. Since we adopt a numerical point of view, we first relax the feasible domain of the problem, then using both mathematical programming methods and penalization methods, we get optimality conditions with smooth Lagrange multipliers. Some numerical experiments using IPOPT algorithm (Interior Point Optimizer) are presented to verify the efficiency of our approach.Keywords: complementarity problem, IPOPT, Lagrange multipliers, mathematical programming, optimal control, smoothing methods, variationally inequalities
Procedia PDF Downloads 14028619 Evaluation of the exIWO Algorithm Based on the Traveling Salesman Problem
Authors: Daniel Kostrzewa, Henryk Josiński
Abstract:
The expanded Invasive Weed Optimization algorithm (exIWO) is an optimization metaheuristic modelled on the original IWO version created by the researchers from the University of Tehran. The authors of the present paper have extended the exIWO algorithm introducing a set of both deterministic and non-deterministic strategies of individuals’ selection. The goal of the project was to evaluate the exIWO by testing its usefulness for solving some test instances of the traveling salesman problem (TSP) taken from the TSPLIB collection which allows comparing the experimental results with optimal values.Keywords: expanded invasive weed optimization algorithm (exIWO), traveling salesman problem (TSP), heuristic approach, inversion operator
Procedia PDF Downloads 80428618 Multi-Objective Optimization of Combined System Reliability and Redundancy Allocation Problem
Authors: Vijaya K. Srivastava, Davide Spinello
Abstract:
This paper presents established 3n enumeration procedure for mixed integer optimization problems for solving multi-objective reliability and redundancy allocation problem subject to design constraints. The formulated problem is to find the optimum level of unit reliability and the number of units for each subsystem. A number of illustrative examples are provided and compared to indicate the application of the superiority of the proposed method.Keywords: integer programming, mixed integer programming, multi-objective optimization, Reliability Redundancy Allocation
Procedia PDF Downloads 13828617 Simulation Model of Induction Heating in COMSOL Multiphysics
Authors: K. Djellabi, M. E. H. Latreche
Abstract:
The induction heating phenomenon depends on various factors, making the problem highly nonlinear. The mathematical analysis of this problem in most cases is very difficult and it is reduced to simple cases. Another knowledge of induction heating systems is generated in production environments, but these trial-error procedures are long and expensive. The numerical models of induction heating problem are another approach to reduce abovementioned drawbacks. This paper deals with the simulation model of induction heating problem. The simulation model of induction heating system in COMSOL Multiphysics is created. In this work we present results of numerical simulations of induction heating process in pieces of cylindrical shapes, in an inductor with four coils. The modeling of the inducting heating process was made with the software COMSOL Multiphysics Version 4.2a, for the study we present the temperature charts.Keywords: induction heating, electromagnetic field, inductor, numerical simulation, finite element
Procedia PDF Downloads 28528616 Genetic Algorithm for Solving the Flexible Job-Shop Scheduling Problem
Authors: Guilherme Baldo Carlos
Abstract:
The flexible job-shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which can be applied to model several applications in a wide array of industries. This problem will have its importance increase due to the shift in the production mode that modern society is going through. The demands are increasing and for products personalized and customized. This work aims to apply a meta-heuristic called a genetic algorithm (GA) to solve this problem. A GA is a meta-heuristic inspired by the natural selection of Charles Darwin; it produces a population of individuals (solutions) and selects, mutates, and mates the individuals through generations in order to find a good solution for the problem. The results found indicate that the GA is suitable for FJSP solving.Keywords: genetic algorithm, evolutionary algorithm, scheduling, flexible job-shop scheduling
Procedia PDF Downloads 11728615 Efficient Filtering of Graph Based Data Using Graph Partitioning
Authors: Nileshkumar Vaishnav, Aditya Tatu
Abstract:
An algebraic framework for processing graph signals axiomatically designates the graph adjacency matrix as the shift operator. In this setup, we often encounter a problem wherein we know the filtered output and the filter coefficients, and need to find out the input graph signal. Solution to this problem using direct approach requires O(N3) operations, where N is the number of vertices in graph. In this paper, we adapt the spectral graph partitioning method for partitioning of graphs and use it to reduce the computational cost of the filtering problem. We use the example of denoising of the temperature data to illustrate the efficacy of the approach.Keywords: graph signal processing, graph partitioning, inverse filtering on graphs, algebraic signal processing
Procedia PDF Downloads 27928614 Incorporating Polya’s Problem Solving Process: A Polytechnic Mathematics Module Case Study
Authors: Pei Chin Lim
Abstract:
School of Mathematics and Science of Singapore Polytechnic offers a Basic Mathematics module to students who did not pass GCE O-Level Additional Mathematics. These students are weaker in Mathematics. In particular, they struggle with word problems and tend to leave them blank in tests and examinations. In order to improve students’ problem-solving skills, the school redesigned the Basic Mathematics module to incorporate Polya’s problem-solving methodology. During tutorial lessons, students have to work through learning activities designed to raise their metacognitive awareness by following Polya’s problem-solving process. To assess the effectiveness of the redesign, students’ working for a challenging word problem in the mid-semester test were analyzed. Sixty-five percent of students attempted to understand the problem by making sketches. Twenty-eight percent of students went on to devise a plan and implement it. Only five percent of the students still left the question blank. These preliminary results suggest that with regular exposure to an explicit and systematic problem-solving approach, weak students’ problem-solving skills can potentially be improved.Keywords: mathematics education, metacognition, problem solving, weak students
Procedia PDF Downloads 13428613 Optimizing Network Latency with Fast Path Assignment for Incoming Flows
Abstract:
Various flows in the network require to go through different types of middlebox. The improper placement of network middlebox and path assignment for flows could greatly increase the network latency and also decrease the performance of network. Minimizing the total end to end latency of all the ows requires to assign path for the incoming flows. In this paper, the flow path assignment problem in regard to the placement of various kinds of middlebox is studied. The flow path assignment problem is formulated to a linear programming problem, which is very time consuming. On the other hand, a naive greedy algorithm is studied. Which is very fast but causes much more latency than the linear programming algorithm. At last, the paper presents a heuristic algorithm named FPA, which takes bottleneck link information and estimated bandwidth occupancy into consideration, and achieves near optimal latency in much less time. Evaluation results validate the effectiveness of the proposed algorithm.Keywords: flow path, latency, middlebox, network
Procedia PDF Downloads 17928612 A Heuristic for the Integrated Production and Distribution Scheduling Problem
Authors: Christian Meinecke, Bernd Scholz-Reiter
Abstract:
The integrated problem of production and distribution scheduling is relevant in many industrial applications. Thus, many heuristics to solve this integrated problem have been developed in the last decade. Most of these heuristics use a sequential working principal or a single decomposition and integration approach to separate and solve sub-problems. A heuristic using a multi-step decomposition and integration approach is presented in this paper and evaluated in a case study. The result show significant improved results compared with sequential scheduling heuristics.Keywords: production and outbound distribution, integrated planning, heuristic, decomposition, integration
Procedia PDF Downloads 39428611 An Optimization Model for Maximum Clique Problem Based on Semidefinite Programming
Authors: Derkaoui Orkia, Lehireche Ahmed
Abstract:
The topic of this article is to exploring the potentialities of a powerful optimization technique, namely Semidefinite Programming, for solving NP-hard problems. This approach provides tight relaxations of combinatorial and quadratic problems. In this work, we solve the maximum clique problem using this relaxation. The clique problem is the computational problem of finding cliques in a graph. It is widely acknowledged for its many applications in real-world problems. The numerical results show that it is possible to find a maximum clique in polynomial time, using an algorithm based on semidefinite programming. We implement a primal-dual interior points algorithm to solve this problem based on semidefinite programming. The semidefinite relaxation of this problem can be solved in polynomial time.Keywords: semidefinite programming, maximum clique problem, primal-dual interior point method, relaxation
Procedia PDF Downloads 19228610 Teaching and Learning Physics via GPS and WikiS
Authors: Hashini E. Mohottala
Abstract:
We report the combine use of Wikispaces (WikiS) and Group Problem Solving (GPS) sessions conducted in the introductory level physics classes. As a part of this new teaching tool, some essay type problems were posted on the WikiS in weekly basis and students were encouraged to participate in problem solving without providing numerical final answers but the steps. Wikispace is used as a platform for students to meet online and create discussions. Each week students were further evaluated on problem solving skills opening up more opportunity for peer interaction through GPS. Each group was given a different problem to solve and the answers were graded. Students developed a set of skills in decision-making, problem solving, communication, negotiation, critical and independent thinking and teamwork through the combination of WikiS and GPS.Keywords: group problem solving (GPS), wikispace (WikiS), physics education, learning
Procedia PDF Downloads 38728609 Flight Safety Hazard: An Investigation into Bird Strike Prevention in the Vicinity of Suvarnabhumi Airport, Thailand
Authors: Chantarat Manvichien
Abstract:
The purpose of this research paper was aimed to examine the bird strike prevention in the vicinity of Suvarnabhumi Airport, Thailand. A bird strike event occurs when a bird or a flock of birds collide with an operating airplane and results in flight interruption. This is the reason why International Civil Aviation Organization (ICAO), a part of the United Nations, has an assumption that birds, including other wildlife, are a serious hazard to aircraft and attempts should be accomplished to overcome this hazard. ICAO requires all airports worldwide to set up proactive countermeasures in order to reduce the risk from bird strike and wildlife hazard. In Thailand, the Airports of Thailand Public Company Limited which manages Suvarnabhumi Airport, also known as Bangkok International Airport, responds to the requirements and spends a lot of effort to ensure this hazard is manageable. An intensive study on the countermeasures to prevent aircraft accident from bird strike and other wildlife have been continuously executed since the early construction of the Airport until nowadays.Keywords: bird strike, flight safety, wildlife hazard, Suvarnabhumi airport
Procedia PDF Downloads 33928608 The Menu Planning Problem: A Systematic Literature Review
Authors: Dorra Kallel, Ines Kanoun, Diala Dhouib
Abstract:
This paper elaborates a Systematic Literature Review SLR) to select the most outstanding studies that address the Menu Planning Problem (MPP) and to classify them according to the to the three following criteria: the used methods, types of patients and the required constraints. At first, a set of 4165 studies was selected. After applying the SLR’s guidelines, this collection was filtered to 13 studies using specific inclusion and exclusion criteria as well as an accurate analysis of each study. Second, the selected papers were invested to answer the proposed research questions. Finally, data synthesis and new perspectives for future works are incorporated in the closing section.Keywords: Menu Planning Problem (MPP), Systematic Literature Review (SLR), classification, exact and approaches methods
Procedia PDF Downloads 23628607 Optimizing Approach for Sifting Process to Solve a Common Type of Empirical Mode Decomposition Mode Mixing
Authors: Saad Al-Baddai, Karema Al-Subari, Elmar Lang, Bernd Ludwig
Abstract:
Empirical mode decomposition (EMD), a new data-driven of time-series decomposition, has the advantage of supposing that a time series is non-linear or non-stationary, as is implicitly achieved in Fourier decomposition. However, the EMD suffers of mode mixing problem in some cases. The aim of this paper is to present a solution for a common type of signals causing of EMD mode mixing problem, in case a signal suffers of an intermittency. By an artificial example, the solution shows superior performance in terms of cope EMD mode mixing problem comparing with the conventional EMD and Ensemble Empirical Mode decomposition (EEMD). Furthermore, the over-sifting problem is also completely avoided; and computation load is reduced roughly six times compared with EEMD, an ensemble number of 50.Keywords: empirical mode decomposition (EMD), mode mixing, sifting process, over-sifting
Procedia PDF Downloads 36228606 Optimization of Maritime Platform Transport Problem of Solid, Special and Dangerous Waste
Authors: Ocotlán Díaz-Parra, Jorge A. Ruiz-Vanoye, Alejandro Fuentes-Penna, Beatriz Bernabe-Loranca, Patricia Ambrocio-Cruz, José J. Hernández-Flores
Abstract:
The Maritime Platform Transport Problem of Solid, Special and Dangerous Waste consist of to minimize the monetary value of carry different types of waste from one location to another location using ships. We offer a novel mathematical, the characterization of the problem and the use CPLEX to find the optimal values to solve the Solid, Special and Hazardous Waste Transportation Problem of offshore platforms instances of Mexican state-owned petroleum company (PEMEX). The set of instances used are WTPLib real instances and the tool CPLEX solver to solve the MPTPSSDW problem.Keywords: oil platform, transport problem, waste, solid waste
Procedia PDF Downloads 441