Search results for "Turing"

showing 10 items of 2644 documents

The facility layout problem approached using a fuzzy model and a genetic search

2005

The problem of facility layout design is discussed, taking into account the uncertainty of production scenarios and the finite production capacity of the departments. The uncertain production demand is modelled by a fuzzy number, and constrained arithmetic operators are used in order to calculate the fuzzy material handling costs. By using a ranking criterion, the layout that represents the minimum fuzzy cost is selected. A flexible bay structure is adopted as a physical model of the system while an effective genetic algorithm is implemented to search for a near optimal solution in a fuzzy contest. Constraints on the aspect ratio of the departments are taken into account using a penalty fun…

Mathematical optimizationAdaptive neuro fuzzy inference systemFitness functionFuzzy setFuzzy logicDefuzzificationIndustrial and Manufacturing EngineeringFuzzy sets genetic algorithm layout optimization robustnessFuzzy transportationArtificial IntelligenceFuzzy set operationsFuzzy numberSoftwareMathematicsJournal of Intelligent Manufacturing
researchProduct

The Multiple Multidimensional Knapsack with Family-Split Penalties

2021

Abstract The Multiple Multidimensional Knapsack Problem with Family-Split Penalties (MMdKFSP) is introduced as a new variant of both the more classical Multi-Knapsack and Multidimensional Knapsack Problems. It reckons with items categorized into families and where if an individual item is selected to maximize the profit, all the items of the same family must be selected as well. Items belonging to the same family can be assigned to different knapsacks; however, in this case, split penalties are incurred. This problem arises in resource management of distributed computing contexts and Service Oriented Architecture environments. An exact algorithm based on the exploitation of a specific combi…

Mathematical optimizationCombinatorial optimizationInformation Systems and ManagementGeneral Computer ScienceComputer scienceKnapsack Problem0211 other engineering and technologiesBenders’ cuts; Combinatorial optimization; Integer programming; Knapsack Problems; Resource assignmentResource assignment02 engineering and technologyManagement Science and Operations ResearchIndustrial and Manufacturing Engineering0502 economics and businessInteger programming050210 logistics & transportation021103 operations research05 social sciencesBenders’ cutInteger programmingSolverKnapsack ProblemsBenders’ cutsExact algorithmKnapsack problemModeling and SimulationCombinatorial optimizationEuropean Journal of Operational Research
researchProduct

Numerical model of macro-segregation during directional crystallization process

1998

Abstract In the paper the mathematical model of macro-segregation proceeding during the directional crystallization process is presented. The boundary-initial problem considered is discussed. Next the numerical approximation constructed on the basis of the boundary element method supplemented by a procedure called the artificial heat source method is described. The boundary condition on the solidification front resulting from the alloy component balance is introduced, while in finally the practical aspects of computations concerning the course of the process are discussed.

Mathematical optimizationComputationMetals and AlloysMechanicsSingular boundary methodBoundary knot methodIndustrial and Manufacturing EngineeringComputer Science ApplicationsModeling and SimulationScientific methodCeramics and CompositesBoundary value problemMacroBoundary element methodNumerical stabilityMathematicsJournal of Materials Processing Technology
researchProduct

Un procedimiento de fuerte reducción de las dimensiones del RCPS/π

2009

Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and non-renewable resources. From an applied point of view, partially renewable resources allow us to model a large variety of situations that do not fit into classical models, but can be found in real problems in timetabling and labour scheduling. When modelling real problems, the problem of project scheduling with partially renewable resources, as many other combinatorial problems, gets such large dimensions that it is quite difficult to apply solution procedures. In this paper, we describe some powerful preprocessi…

Mathematical optimizationComputer scienceGeneralizationlcsh:MathematicsMaterials Science (miscellaneous)Dimension (graph theory)Secuenciación de proyectosProject Schedulinglcsh:QA1-939Partially Renewable ResourcesIndustrial and Manufacturing EngineeringField (computer science)Variety (cybernetics)Set (abstract data type)Recursos Parcialmente RenovablesPreprocessorPoint (geometry)Business and International ManagementPreprocessingPreproceso
researchProduct

A multi-objective approach for a project scheduling problem with due dates and temporal constraints infeasibilities

2014

In this paper, we study a multi-mode resource-constrained project scheduling problem (RCPSP) which considers time and work generalised precedence relationships with minimal and maximal time lags and due dates where each activity requires only one unit of resource (e.g. a worker, a machine, etc.). To find a feasible solution for this problem is NP-hard and therefore for instances where a feasible solution has not been found, an appropriate real-life approach would consist of providing the decision-maker with a collection of quality solutions with a trade-off between due dates and temporal constraints violations. We propose a multi-objective evolutionary algorithm for the generation of an app…

Mathematical optimizationComputer scienceStrategy and Managementmedia_common.quotation_subjectTardinessEvolutionary algorithmManagement Science and Operations ResearchMulti-objective optimizationIndustrial and Manufacturing EngineeringResource (project management)Work (electrical)Genetic algorithmObjective approachQuality (business)media_commonInternational Journal of Production Research
researchProduct

A powerful route minimization heuristic for the vehicle routing problem with time windows

2009

We suggest an efficient route minimization heuristic for the vehicle routing problem with time windows. The heuristic is based on the ejection pool, powerful insertion and guided local search strategies. Experimental results on the Gehring and Homberger's benchmarks demonstrate that our algorithm outperforms previous approaches and found 18 new best-known solutions.

Mathematical optimizationComputer scienceTime windowsApplied MathematicsVehicle routing problemGuided Local SearchMinificationManagement Science and Operations ResearchHeuristicsAlgorithmIndustrial and Manufacturing EngineeringSoftwareOperations Research Letters
researchProduct

SMAA - Stochastic multiobjective acceptability analysis

1998

Stochastic multiobjective acceptability analysis (SMAA) is a multicriteria decision support technique for multiple decision makers based on exploring the weight space. Inaccurate or uncertain input data can be represented as probability distributions. In SMAA the decision makers need not express their preferences explicitly or implicitly; instead the technique analyses what kind of valuations would make each alternative the preferred one. The method produces for each alternative an acceptability index measuring the variety of different valuations that support that alternative, a central weight vector representing the typical valuations resulting in that decision, and a confidence factor mea…

Mathematical optimizationDecision support systemInformation Systems and ManagementGeneral Computer ScienceStochastic modellingDecision theoryConfidence factorWeight spaceManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringVariety (cybernetics)Modeling and SimulationProbability distributionWeightMathematical economicsMathematicsEuropean Journal of Operational Research
researchProduct

A New Numerical Method for Axisymmetrical Forming Processes

1987

Summary In this paper a numerical method for the analysis of axisymmetrical forming processes is proposed. This method represents the last development of a previous one which allows to solve forming problems in plane strain condition. The proposed model is baaed on the finite element discretization and on the linearization of the yield surface which leads to solve a LP problem. Two different examples of application, concerning the upsetting of a cylinder and of a hollow disk are reported.

Mathematical optimizationDiscretizationLinearizationYield surfaceMechanical EngineeringNumerical analysisForming processesApplied mathematicsCylinderDevelopment (differential geometry)Industrial and Manufacturing EngineeringFinite element methodMathematicsCIRP Annals
researchProduct

Applying the approximation method PAINT and the interactive method NIMBUS to the multiobjective optimization of operating a wastewater treatment plant

2014

Using an interactive multiobjective optimization method called NIMBUS and an approximation method called PAINT, preferable solutions to a five-objective problem of operating a wastewater treatment plant are found. The decision maker giving preference information is an expert in wastewater treatment plant design at the engineering company Pöyry Finland Ltd. The wastewater treatment problem is computationally expensive and requires running a simulator to evaluate the values of the objective functions. This often leads to problems with interactive methods as the decision maker may get frustrated while waiting for new solutions to be computed. Thus, a newly developed PAINT method is used to spe…

Mathematical optimizationEngineeringOR in natural resourcesControl and OptimizationSpeedupbusiness.industryApplied Mathematicsproductivity and competitivenessManagement Science and Operations ResearchsimulationDecision makerMulti-objective optimizationIndustrial and Manufacturing EngineeringComputer Science ApplicationsSet (abstract data type)Pareto optimalmultiple objective programmingSewage treatmentPlant designbusinessta218Integer (computer science)
researchProduct

A contribution on the optimization strategies based on moving least squares approximation for sheet metal forming design

2012

Computer-aided procedures to design and optimize forming processes are, nowadays, crucial research topics since industrial interest in costs and times reduction is always increasing. Many researchers have faced this research challenge with various approaches. Response surface methods (RSM) are probably the most known approaches since they proved their effectiveness in the recent years. With a peculiar attention to sheet metal forming process design, RSM should offer the possibility to reduce the number of numerical simulations which in many cases means to reduce design times and complexity. Actually, the number of direct problems (FEM simulations) to be solved in order to reach good functio…

Mathematical optimizationEngineeringOptimization problembusiness.industryMechanical EngineeringForming processesComputer aided optimizationSheet metal formingIndustrial and Manufacturing EngineeringComputer Science ApplicationsReduction (complexity)Function approximationControl and Systems Engineeringvisual_artKey (cryptography)visual_art.visual_art_mediumZoomMoving least squaresMoving least squares methodologySheet metalbusinessSettore ING-IND/16 - Tecnologie E Sistemi Di LavorazioneSoftware
researchProduct