Search results for "Algorithm"

showing 10 items of 4887 documents

Solving a continuous periodic review inventory-location allocation problem in vendor-buyer supply chain under uncertainty

2019

In this work, a mixed-integer binary non-linear two-echelon inventory problem is formulated for a vendor-buyer supply chain network in which lead times are constant and the demands of buyers follow a normal distribution. In this formulation, the problem is a combination of an (r, Q) and periodic review policies based on which an order of size Q is placed by a buyer in each fixed period once his/her on hand inventory reaches the reorder point r in that period. The constraints are the vendors’ warehouse spaces, production restrictions, and total budget. The aim is to find the optimal order quantities of the buyers placed for each vendor in each period alongside the optimal placement of the ve…

Mathematical optimizationGeneral Computer ScienceComputer scienceVendorSupply chain0211 other engineering and technologies02 engineering and technologyTaguchi methodstoimitusketjutgeneettiset algorithmitinventory-location allocation problemGenetic algorithmgenetic algorithm0202 electrical engineering electronic engineering information engineeringta113021103 operations researchFitness functionta111General EngineeringParticle swarm optimizationmixed-integer binary non-linear programmingReorder pointstochastic demandstwo-echelon supply chain020201 artificial intelligence & image processingLocation-allocationSupply chain networkComputers & Industrial Engineering
researchProduct

A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

2002

Abstract In this paper we develop several heuristic algorithms for the two-dimensional cutting problem (TDC) in which a single stock sheet has to be cut into a set of small pieces, while maximising the value of the pieces cut. They can be considered to be general purpose algorithms because they solve the four versions of the TDC: weighted and unweighted, constrained and unconstrained. We begin by proposing two constructive procedures based on simple bounds obtained by solving one-dimensional knapsack problems. We then use these constructive algorithms as building blocks for more complex procedures. We have developed a greedy randomised adaptive search procedure (GRASP) which is very fast an…

Mathematical optimizationGeneral Computer ScienceGRASPSearch procedureManagement Science and Operations ResearchConstructiveTabu searchCutting stock problemKnapsack problemModeling and SimulationConstructive algorithmsHeuristicsAlgorithmMathematicsComputers & Operations Research
researchProduct

A branch-and-cut algorithm for the pallet loading problem

2005

We propose a branch-and-cut algorithm for the pallet loading problem. The 0-1 formulation proposed by Beasley for cutting problems is adapted to the problem, adding new constraints and new procedures for variable reduction. We then take advantage of the relationship between this problem and the maximum independent set problem to use the partial linear description of its associated polyhedron. Finally, we exploit the specific structure of our problem to define the solution graph and to develop efficient separation procedures. We present computational results for the complete sets Cover I (up to 50 boxes) and Cover II (up to 100 boxes).

Mathematical optimizationGeneral Computer ScienceManagement Science and Operations ResearchReduction (complexity)PolyhedronCover (topology)Cutting stock problemModeling and SimulationIndependent setGraph (abstract data type)PalletBranch and cutAlgorithmMathematicsComputers & Operations Research
researchProduct

A double genetic algorithm for the MRCPSP/max

2011

This paper presents a heuristic solution procedure for a very general resource-constrained project scheduling problem. Here, multiple execution modes are available for the individual activities of the project. In addition, minimum as well as maximum time lags between different activities may be given. The objective is to determine a mode and a start time for each activity such that the temporal and resource constraints are met and the project duration is minimised. Project scheduling problems of this type occur e.g. in process industries. The heuristic is a two-phased genetic algorithm with different representation, fitness, crossover operator, etc., in each of them. One of the contribution…

Mathematical optimizationGeneral Computer ScienceOperations researchHeuristicbusiness.industryComputer scienceCrossoverSchedule (project management)Management Science and Operations ResearchWork in processScheduling (computing)Modeling and SimulationGenetic algorithmResource managementProject managementbusinessComputers & Operations Research
researchProduct

On the approximability of the range assignment problem on radio networks in presence of selfish agents

2005

AbstractWe consider the range assignment problem in ad-hoc wireless networks in the context of selfish agents: A network manager aims to assigning transmission ranges to the stations in order to achieve strong connectivity of the network within a minimal overall power consumption. Station is not directly controlled by the manager and may refuse to transmit with a certain transmission range because it might be costly in terms of power consumption.We investigate the existence of payment schemes which induce the stations to follow the decisions of a network manager in computing a range assignment, that is, truthful mechanisms for the range assignment problem. We provide both positive and negat…

Mathematical optimizationGeneral Computer ScienceSettore INF/01 - Informaticabusiness.industryWireless networkApproximation algorithmContext (language use)Approximation algorithmsTheoretical Computer ScienceNetwork managementAlgorithmic mechanism design; Energy consumption in wireless networks; Approximation algorithmsEnergy consumption in wireless networksalgorithmic mechanism design; approximation algorithms; energy consumption in wireless networksbusinessTime complexityAssignment problemAlgorithmConnectivityAlgorithmic mechanism designAlgorithmic mechanism designMathematicsComputer Science(all)Theoretical Computer Science
researchProduct

Scheduling in a continuous galvanizing line

2009

In this paper we address a sequencing problem in a Continuous Galvanizing Line of a Spanish Steel Company. Production scheduling in this context is an extremely complex task which needs to take into account many constraints. We present a conceptually simple model and a Tabu Search (TS) algorithm that efficiently solves it. The TS moves are defined in order to repair non-satisfied constraints, leading to smaller and more efficient neighbourhoods. The TS co-ordinates several intensification and diversification procedures guided by an evaluation function based on a shifting penalty strategy. This function reinforces the anticycling mechanism and makes the algorithm avoid already visited soluti…

Mathematical optimizationGeneral Computer Sciencebusiness.industryComputer scienceScheduling (production processes)Management Science and Operations ResearchEvaluation functionGalvanizationTabu searchScheduling (computing)symbols.namesakeSearch algorithmProduction managerModeling and SimulationsymbolsArtificial intelligencebusinessComputers & Operations Research
researchProduct

Variable neighborhood search for the linear ordering problem

2006

Given a matrix of weights, the linear ordering problem (LOP) consists of finding a permutation of the columns and rows in order to maximize the sum of the weights in the upper triangle. This NP-complete problem can also be formulated in terms of graphs, as finding an acyclic tournament with a maximal sum of arc weights in a complete weighted graph. In this paper, we first review the previous methods for the LOP and then propose a heuristic algorithm based on the variable neighborhood search (VNS) methodology. The method combines different neighborhoods for an efficient exploration of the search space. We explore different search strategies and propose a hybrid method in which the VNS is cou…

Mathematical optimizationGeneral Computer Sciencebusiness.industryTriangulation (social science)Management Science and Operations ResearchDirected acyclic graphTabu searchRandom searchModeling and SimulationCombinatorial optimizationLocal search (optimization)businessMetaheuristicAlgorithmVariable neighborhood searchMathematicsComputers & Operations Research
researchProduct

A fast 3D dual boundary element method based on hierarchical matrices

2008

AbstractIn this paper a fast solver for three-dimensional BEM and DBEM is developed. The technique is based on the use of hierarchical matrices for the representation of the collocation matrix and uses a preconditioned GMRES for the solution of the algebraic system of equations. The preconditioner is built exploiting the hierarchical arithmetic and taking full advantage of the hierarchical format. Special algorithms are developed to deal with crack problems within the context of DBEM. The structure of DBEM matrices has been efficiently exploited and it has been demonstrated that, since the cracks form only small parts of the whole structure, the use of hierarchical matrices can be particula…

Mathematical optimizationHierarchical matricesCollocationPreconditionerDual boundary element methodApplied MathematicsMechanical EngineeringMathematicsofComputing_NUMERICALANALYSISContext (language use)SolverCondensed Matter PhysicsSystem of linear equationsLarge scale computationsGeneralized minimal residual methodMatrix (mathematics)Materials Science(all)Mechanics of MaterialsModelling and SimulationModeling and SimulationFast solversGeneral Materials ScienceSettore ING-IND/04 - Costruzioni E Strutture AerospazialiAlgorithmBoundary element methodMathematicsInternational Journal of Solids and Structures
researchProduct

A Local Selection Algorithm for Switching Function Minimization

1984

The minimization algorithms which do not require any preliminary generation of all the prime implicants (PI's) of a function are the most efficient. In this work a new algorithm is described which follows such an approach. It is based on a local selection of PI's carried out by examining a set of vertices whose number is never greater than the number of PI's of a minimum cost cover. This algorithm takes advantage of a technique which uses numerical equivalents of the function vertices as pointers. For this reason it is well suited for implementation by computer. To illustrate the features of this algorithm a few examples are reported.

Mathematical optimizationImplicantProbability density functionFunction (mathematics)Theoretical Computer ScienceSet (abstract data type)Computational Theory and MathematicsCover (topology)Hardware and ArchitectureIndependent setAlgorithm designMinificationAlgorithmSoftwareMathematicsIEEE Transactions on Computers
researchProduct

Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts

2015

Abstract This paper presents an approach for solving a new real problem in cutting and packing. At its core is an innovative mixed integer programme model that places irregular pieces and defines guillotine cuts. The two-dimensional irregular shape bin packing problem with guillotine constraints arises in the glass cutting industry, for example, the cutting of glass for conservatories. Almost all cutting and packing problems that include guillotine cuts deal with rectangles only, where all cuts are orthogonal to the edges of the stock sheet and a maximum of two angles of rotation are permitted. The literature tackling packing problems with irregular shapes largely focuses on strip packing i…

Mathematical optimizationInformation Systems and ManagementBin packing problemStrategy and ManagementManagement Science and Operations ResearchComputer Science::Computational GeometryHybrid algorithmConstructiveBinPacking problemsCutting stock problemRectangleInteger (computer science)Mathematics
researchProduct