Einloggen

Thematische Bibliographien / Cut-And-Solve / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Cut-And-Solve.

Zeitschriftenartikel zum Thema „Cut-And-Solve“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Cut-And-Solve" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Nicholls, Jerome J., und Chuck Prussack. „Innovative Design and Erection Methods Solve Construction of Rock Cut Bridge“. PCI Journal 42, Nr. 4 (01.07.1997): 42–55. http://dx.doi.org/10.15554/pcij.07011997.42.55.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Hayford-Acquah, Teddy, und Ben Asante. „Causes of Fiber Cut and the Recommendation to Solve the Problem“. IOSR Journal of Electronics and Communication Engineering 12, Nr. 01 (Januar 2017): 46–64. http://dx.doi.org/10.9790/2834-1201014664.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Climer, Sharlee, und Weixiong Zhang. „Cut-and-solve: An iterative search strategy for combinatorial optimization problems“. Artificial Intelligence 170, Nr. 8-9 (Juni 2006): 714–38. http://dx.doi.org/10.1016/j.artint.2006.02.005.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Ouaïl, Fatma Zohra, und Mohamed El-Amine Chergui. „A branch-and-cut technique to solve multiobjective integer quadratic programming problems“. Annals of Operations Research 267, Nr. 1-2 (30.10.2017): 431–46. http://dx.doi.org/10.1007/s10479-017-2698-6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Barnhart, Cynthia, Christopher A. Hane und Pamela H. Vance. „Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems“. Operations Research 48, Nr. 2 (April 2000): 318–26. http://dx.doi.org/10.1287/opre.48.2.318.12378.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Yang, Zhen, Feng Chu und Haoxun Chen. „A cut-and-solve based algorithm for the single-source capacitated facility location problem“. European Journal of Operational Research 221, Nr. 3 (September 2012): 521–32. http://dx.doi.org/10.1016/j.ejor.2012.03.047.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Gadegaard, Sune Lauth, Andreas Klose und Lars Relund Nielsen. „An improved cut-and-solve algorithm for the single-source capacitated facility location problem“. EURO Journal on Computational Optimization 6, Nr. 1 (05.04.2017): 1–27. http://dx.doi.org/10.1007/s13675-017-0084-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Deaconu, Adrian, und Laura Ciupala. „Inverse Minimum Cut Problem with Lower and Upper Bounds“. Mathematics 8, Nr. 9 (03.09.2020): 1494. http://dx.doi.org/10.3390/math8091494.

Der volle Inhalt der Quelle

Annotation:

The inverse minimum cut problem is one of the classical inverse optimization researches. In this paper, the inverse minimum cut with a lower and upper bounds problem is considered. The problem is to change both, the lower and upper bounds on arcs so that a given feasible cut becomes a minimum cut in the modified network and the distance between the initial vector of bounds and the modified one is minimized. A strongly polynomial algorithm to solve the problem under l1 norm is developed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Luo, D., P. Ge, D. Liu und H. Wang. „A combined lens design for an LED low-beam motorcycle headlight“. Lighting Research & Technology 50, Nr. 3 (06.03.2017): 456–66. http://dx.doi.org/10.1177/1477153517697370.

Der volle Inhalt der Quelle

Annotation:

A conventional low-beam projector headlight design for a motorcycle conventionally uses a combination of an elliptical reflector and a baffle plate. A clear cut-off line is formed by the baffle plate. Since only one freeform surface is used, the dispersion phenomena will occur with a white LED light source because the blue and yellow light is mixed unevenly. This leads to a high colour temperature. Another method uses a micro-lens array to solve the colour temperature problems. Without using the baffle plate, it is difficult to form a clear cut-off line. What’s more, the freeform surface of the lens is complex and difficult to fabricate. We propose a combined lens, which uses a double freeform surface lens combined with a single freeform surface lens. In the combined lens, the double freeform surface lens is designed to solve the colour temperature drift and the single freeform surface lens is designed to solve the problem of the cut-off line. The simulation results can meet the ECE Regulation R113 revision 2(Class B) of the motorcycle low-beam.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

De Oliveira, Willy Alves, und Maristela Oliveira dos Santos. „A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups“. TEMA (São Carlos) 18, Nr. 3 (10.01.2018): 515. http://dx.doi.org/10.5540/tema.2017.018.03.515.

Der volle Inhalt der Quelle

Annotation:

In this paper, we deal with the Capacitated Lot Sizing and Scheduling Problem with sequencedependent setup times and costs - CLSD model. More specifically, we propose a simple reformulation for the CLSD model that enables us to define a new branching rule to be used in Branch-and-Bound (or Branch-and-Cut) algorithms to solve this NP-hard problem. Our branching rule can be easily implemented in commercial solvers. Computational tests performed in 240 test instances from the literature show that our approach can significantly reduce the running time to solve this problem using a Branch-and-Cut algorithm of a commercial MIP solver.Therefore, our approach can also improve the performance of other approaches that need to solve partial sub problems of the CLSD model in each iteration, such as Lagrangian approaches and heuristics based on the mathematical formulation of the problem.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Fang, Yunfei, Feng Chu, Saïd Mammar und Ada Che. „A cut-and-solve-based algorithm for optimal lane reservation with dynamic link travel times“. International Journal of Production Research 52, Nr. 4 (15.08.2013): 1003–15. http://dx.doi.org/10.1080/00207543.2013.828169.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Rahmani, Arsalan, und Majid Yousefikhoshbakht. „An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming“. International Journal of Production Management and Engineering 5, Nr. 1 (31.01.2017): 1. http://dx.doi.org/10.4995/ijpme.2017.6512.

Der volle Inhalt der Quelle

Annotation:

<p>In this paper, a new branch-and-cut algorithm for mixed integer bi-level programming is proposed. For achieving this purpose, a historical perspective of the development of enumeration methods in the field of bi-level linear programming is considered. Then, we present some obstacles for using branch and bound method based on them, and an algorithm is developed to solve for mixed integer bi-level problem. Finally, we use a preference function to determine the choice of branching and specialized cuts in a branch and cut tree. Computational results are reported and compared favorably to those of previous methods and then implications discussed. The results show that not only the proposed algorithm can find high quality solutions for solving a number of the problems, but also it is competitive with other famous published algorithms.</p>

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Wu, Peng, Ada Che, Feng Chu und MengChu Zhou. „An Improved Exact $\varepsilon$-Constraint and Cut-and-Solve Combined Method for Biobjective Robust Lane Reservation“. IEEE Transactions on Intelligent Transportation Systems 16, Nr. 3 (Juni 2015): 1479–92. http://dx.doi.org/10.1109/tits.2014.2368594.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Ait Bouziaren, Soumaya, und Brahim Aghezzaf. „An Improved Augmented $\varepsilon$ -Constraint and Branch-and-Cut Method to Solve the TSP With Profits“. IEEE Transactions on Intelligent Transportation Systems 20, Nr. 1 (Januar 2019): 195–204. http://dx.doi.org/10.1109/tits.2018.2808179.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Fang, Yunfei, Feng Chu, Saïd Mammar und Qin Shi. „A new cut-and-solve and cutting plane combined approach for the capacitated lane reservation problem“. Computers & Industrial Engineering 80 (Februar 2015): 212–21. http://dx.doi.org/10.1016/j.cie.2014.12.014.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Chaourar, Brahim. „A Linear Time Algorithm for a Variant of the MAX CUT Problem in Series Parallel Graphs“. Advances in Operations Research 2017 (2017): 1–4. http://dx.doi.org/10.1155/2017/1267108.

Der volle Inhalt der Quelle

Annotation:

Given a graph G=V,E, a connected sides cut U,V\U or δU is the set of edges of E linking all vertices of U to all vertices of V\U such that the induced subgraphs GU and GV\U are connected. Given a positive weight function w defined on E, the maximum connected sides cut problem (MAX CS CUT) is to find a connected sides cut Ω such that wΩ is maximum. MAX CS CUT is NP-hard. In this paper, we give a linear time algorithm to solve MAX CS CUT for series parallel graphs. We deduce a linear time algorithm for the minimum cut problem in the same class of graphs without computing the maximum flow.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Konoshima, M., R. Marušák und A. Yoshimoto. „Harvest scheduling with spatial aggregation for two and three strip cut system under shelterwood management“. Journal of Forest Science 57, No. 6 (07.07.2011): 271–77. http://dx.doi.org/10.17221/48/2010-jfs.

Der volle Inhalt der Quelle

Annotation:

We propose a spatial aggregation method to solve an optimal harvest scheduling problem for strip shelterwood management. Strip shelterwood management involves either a two-cut system with a preparatory-removal cut cycle, or a three-cut system with a preparatory-establishment-removal cut cycle. In this study we consider these connected sequential cuts as one decision variable, then employ conventional adjacency constraints to seek the best combination of sequential cuts over space and time. Conventional adjacency constraints exclude any spatially-overlapped strips in the decision variables. Our results show the proposed approach can be used to analyze a strip shelterwood cutting system that requires "connectivity" of management units.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Gu, Shenshen, und Yue Yang. „A Deep Learning Algorithm for the Max-Cut Problem Based on Pointer Network Structure with Supervised Learning and Reinforcement Learning Strategies“. Mathematics 8, Nr. 2 (22.02.2020): 298. http://dx.doi.org/10.3390/math8020298.

Der volle Inhalt der Quelle

Annotation:

The Max-cut problem is a well-known combinatorial optimization problem, which has many real-world applications. However, the problem has been proven to be non-deterministic polynomial-hard (NP-hard), which means that exact solution algorithms are not suitable for large-scale situations, as it is too time-consuming to obtain a solution. Therefore, designing heuristic algorithms is a promising but challenging direction to effectively solve large-scale Max-cut problems. For this reason, we propose a unique method which combines a pointer network and two deep learning strategies (supervised learning and reinforcement learning) in this paper, in order to address this challenge. A pointer network is a sequence-to-sequence deep neural network, which can extract data features in a purely data-driven way to discover the hidden laws behind data. Combining the characteristics of the Max-cut problem, we designed the input and output mechanisms of the pointer network model, and we used supervised learning and reinforcement learning to train the model to evaluate the model performance. Through experiments, we illustrated that our model can be well applied to solve large-scale Max-cut problems. Our experimental results also revealed that the new method will further encourage broader exploration of deep neural network for large-scale combinatorial optimization problems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Deleplanque, Samuel, Martine Labbé, Diego Ponce und Justo Puerto. „A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem“. INFORMS Journal on Computing 32, Nr. 3 (Juli 2020): 582–99. http://dx.doi.org/10.1287/ijoc.2019.0915.

Der volle Inhalt der Quelle

Annotation:

The discrete ordered median problem (DOMP) is formulated as a set-partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a column generation approach to solve the continuous relaxation of this model. Then we apply a branch-price-and-cut algorithm to solve small- to large-sized instances of DOMP in competitive computational time.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Tran, Hai Ngoc. „USING OPTIMAL METHOD FOR CUTTING ROD MATERIALS“. Scientific Journal of Tra Vinh University 1, Nr. 25 (19.06.2019): 50–55. http://dx.doi.org/10.35382/18594816.1.25.2017.120.

Der volle Inhalt der Quelle

Annotation:

The article presents an optimal method to cut rod materials. By this method, the relative functions between the number of products cut from the given materials and conditions are first established. Then, the powerful computing capabilities of Mathematica software are applied to solve the problems. This method has a wide range of application and is convenient in use.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Ling, Ai-fan. „A VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section“. Mathematical Problems in Engineering 2012 (2012): 1–16. http://dx.doi.org/10.1155/2012/475018.

Der volle Inhalt der Quelle

Annotation:

A heuristic algorithm based on VNS is proposed to solve the Max 3-cut and Max 3-section problems. By establishing a neighborhood structure of the Max 3-cut problem, we propose a local search algorithm and a variable neighborhood global search algorithm with two stochastic search steps to obtain the global solution. We give some numerical results and comparisons with the well-known 0.836-approximate algorithm. Numerical results show that the proposed heuristic algorithm can obtain efficiently the high-quality solutions and has the better numerical performance than the 0.836-approximate algorithm for the NP-Hard Max 3-cut and Max 3-section problems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Ali, Tesfamichael Molla, Monika Panghal und Sandeep Prasad. „Developing a cost-effective and heuristic tool to solve cut order planning problems in the apparel industry“. International Journal of Mathematics in Operational Research 1, Nr. 1 (2020): 1. http://dx.doi.org/10.1504/ijmor.2020.10035753.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Prasad, Sandeep, Monika Panghal und Tesfamichael Molla Ali. „Developing a cost-effective and heuristic tool to solve cut order planning problems in the apparel industry“. International Journal of Mathematics in Operational Research 21, Nr. 1 (2022): 26. http://dx.doi.org/10.1504/ijmor.2022.120314.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Wang, Qian, Ying Kai Long, Gao Lin Wu und Qian Bo Xiao. „The Principle and Application of AC Voltage Withstand Test for GIS without Power Cut“. Applied Mechanics and Materials 651-653 (September 2014): 1113–16. http://dx.doi.org/10.4028/www.scientific.net/amm.651-653.1113.

Der volle Inhalt der Quelle

Annotation:

In order to check whether there are defects in GIS (gas-insulation-switchgear), it is necessary to do AC voltage withstand test before putting into operation. According to the standards, when doing AC voltage withstand test after GIS expansion or maintenance, the original neighboring parts should be power cut and grounded. For the double bus substation,it means that the whole substation should be power cut, which will decrease the power supply reliability of the grid and have a tremendous impact on the power grid To solve the problem, this paper presents a new AC voltage withstand test method for GIS without power cut, and explains principles and field applications of this method.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Munapo, Elias, Joshua Chukwuere und Trust Tawanda. „Solving Linear Integer Models with Variable Bounding“. Forecasting 5, Nr. 2 (05.05.2023): 443–52. http://dx.doi.org/10.3390/forecast5020024.

Der volle Inhalt der Quelle

Annotation:

We present a technique to solve the linear integer model with variable bounding. By using the continuous optimal solution of the linear integer model, the variable bounds for the basic variables are approximated and then used to calculate the optimal integer solution. With the variable bounds of the basic variables known, solving a linear integer model is easier by using either the branch and bound, branch and cut, branch and price, branch cut and price, or branch cut and free algorithms. Thus, the search for large numbers of subproblems, which are unnecessary and common for NP Complete linear integer models, is avoided.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

CIOABĂ, SEBASTIAN M., ANDRÉ KÜNDGEN, CRAIG M. TIMMONS und VLADISLAV V. VYSOTSKY. „Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs“. Combinatorics, Probability and Computing 20, Nr. 4 (09.02.2011): 519–27. http://dx.doi.org/10.1017/s096354831100006x.

Der volle Inhalt der Quelle

Annotation:

An r-cut of the complete r-uniform hypergraph Krn is obtained by partitioning its vertex set into r parts and taking all edges that meet every part in exactly one vertex. In other words it is the edge set of a spanning complete r-partite subhypergraph of Krn. An r-cut cover is a collection of r-cuts such that each edge of Krn is in at least one of the cuts. While in the graph case r = 2 any 2-cut cover on average covers each edge at least 2-o(1) times, when r is odd we exhibit an r-cut cover in which each edge is covered exactly once. When r is even no such decomposition can exist, but we can bound the average number of times an edge is cut in an r-cut cover between $1+\frac1{r+1}$ and $1+\frac{1+o(1)}{\log r}$. The upper bound construction can be reformulated in terms of a natural polyhedral problem or as a probability problem, and we solve the latter asymptotically.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Li, Xu, Chaoyang Zhang, Xueqi Wang, Xiaoxiao Liu, Xinliang Zhu und Ji Zhang. „Integration of Metabolome and Transcriptome Profiling Reveals the Effect of Modified Atmosphere Packaging (MAP) on the Browning of Fresh-Cut Lanzhou Lily (Lilium davidii var. unicolor) Bulbs during Storage“. Foods 12, Nr. 6 (21.03.2023): 1335. http://dx.doi.org/10.3390/foods12061335.

Der volle Inhalt der Quelle

Annotation:

The fresh-cut bulbs of the Lanzhou lily (Lilium davidii var. unicolor) experience browning problems during storage. To solve the problem of browning in the preservation of Lanzhou lily bulbs, we first investigated the optimal storage temperature and gas ratio of modified atmosphere packaging (MAP) of Lanzhou lily bulbs. Then, we tested the browning index (BD), activity of phenylalanine ammonia lyase (PAL), polyphenol oxidase (PPO) and peroxidase (POD), the content of malonaldehyde (MDA) and other physiological activity indicators related to browning. The results showed that the storage conditions of 10% O2 + 5% CO2 + 85% N2 and 4 °C were the best. To further explore the anti-browning mechanism of MAP in fresh-cut Lanzhou lily bulbs, the integration of metabolome and transcriptome analyses showed that MAP mainly retarded the unsaturated fatty acid/saturated fatty acid ratio in the cell membrane, inhibited the lipid peroxidation of the membrane and thus maintained the integrity of the cell membrane of Lanzhou lily bulbs. In addition, MAP inhibited the oxidation of phenolic substances and provided an anti-tanning effect. This study provided a preservation scheme to solve the problem of the browning of freshly cut Lanzhou lily bulbs, and discussed the mechanism of MAP in preventing browning during the storage of the bulbs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Li, Chen, Jun Li, Xiaoyong Lian, Yongen Li, Qi Xue und Jicheng Feng. „Roof Failure Mechanism and Control Technology of Large Section Open-Off Cut in Soft Rock Strata with Thin Thickness“. Shock and Vibration 2021 (17.05.2021): 1–16. http://dx.doi.org/10.1155/2021/5533741.

Der volle Inhalt der Quelle

Annotation:

The open-off cut is used for equipment installation of working face before underground mining, and its sectional size is larger than that of the mining roadway. Therefore, the stability of open-off cut surrounding rock determines whether the panel can be put into operation. To solve the roof instability of open-off cut in the Wanli No.1 coal mine, the roof failure mechanism of open-off cut under weak composite rock strata with thin thickness was studied by field monitoring, theoretical analysis, and numerical simulation. First, the characteristics of surrounding rock and the basic law of strata behaviors were obtained by detailed field monitoring. Afterward, FLAC3D numerical simulation and mechanical analysis were used to obtain the main mechanical control parameters of surrounding rock instability, and the existence of a soft interlayer above the roof is the main cause of roof instability. Based on this, the supporting parameters of the open-off cut were optimized and adjusted. The optimized parameters were applied to the adjacent 31207 open-off cut. The engineering practice showed that the optimized supporting parameters have an ideal control effect on roof stability.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Агапов und Aleksandr Agapov. „Effect of cutting width on the optimum size of bars and boards when cutting sawlogs with sawing three bars of equal thickness and four pairs of side boards“. Forestry Engineering Journal 4, Nr. 2 (10.06.2014): 128–35. http://dx.doi.org/10.12737/4517.

Der volle Inhalt der Quelle

Annotation:

There is a task of cutting optimization of sawlogs considering the width of cut. Output of sawn timber produced after the first pass of cutting sawlogs is chosen as optimality criterion. The objective function is represented as the sum of the cross-section of bars and planks. Such a mathematical model of the objective function establishes a relationship between size of bars and planks. Constraint equations represent the relationship of sawlogs diameter with the size of bars and boards, as well as the width of the cut. To solve the mathematical model the method of Lagrange multipliers is used.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Zhao, Dongping, Xitian Tian und Junhao Geng. „A Bottleneck Detection Algorithm for Complex Product Assembly Line Based on Maximum Operation Capacity“. Mathematical Problems in Engineering 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/258173.

Der volle Inhalt der Quelle

Annotation:

Because of the complex constraints in complex product assembly line, existing algorithms not always detect bottleneck correctly and they have a low convergence rate. In order to solve this problem, a hybrid algorithm of adjacency matrix and improved genetic algorithm (GA) was proposed. First, complex assembly network model (CANM) was defined based on operation capacity of each workstation. Second, adjacency matrix was proposed to convert bottleneck detection of complex assembly network (CAN) into a combinatorial optimization problem of max-flow. Third, an improved GA was proposed to solve this max-flow problem by retaining the best chromosome. Finally, the min-cut sets of CAN were obtained after calculation, and bottleneck workstations were detected according to the analysis of min-cut sets. A case study shows that this algorithm can detect bottlenecks correctly and its convergence rate is high.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Wei, Lijun, Zhixing Luo, Roberto Baldacci und Andrew Lim. „A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems“. INFORMS Journal on Computing 32, Nr. 2 (April 2020): 428–43. http://dx.doi.org/10.1287/ijoc.2018.0867.

Der volle Inhalt der Quelle

Annotation:

In this paper, a new branch-and-price-and-cut algorithm is proposed to solve the one-dimensional bin-packing problem (1D-BPP). The 1D-BPP is one of the most fundamental problems in combinatorial optimization and has been extensively studied for decades. Recently, a set of new 500 test instances were proposed for the 1D-BPP, and the best exact algorithm proposed in the literature can optimally solve 167 of these new instances, with a time limit of 1 hour imposed on each execution of the algorithm. The exact algorithm proposed in this paper is based on the classical set-partitioning model for the 1DBPPs and the subset row inequalities. We describe an ad hoc label-setting algorithm to solve the pricing problem, dominance, and fathoming rules to speed up its computation and a new primal heuristic. The exact algorithm can easily handle some practical constraints, such as the incompatibility between the items, and therefore, we also apply it to solve the one-dimensional bin-packing problem with conflicts (1D-BPPC). The proposed method is tested on a large family of 1D-BPP and 1D-BPPC classes of instances. For the 1D-BPP, the proposed method can optimally solve 237 instances of the new set of difficult instances; the largest instance involves 1,003 items and bins of capacity 80,000. For the 1D-BPPC, the experiments show that the method is highly competitive with state-of-the-art methods and that it successfully closed several open 1D-BPPC instances.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Yu, Wen Ting, Jing Ling Wang und Long Ye. „An Improved Normalized Cut Image Segmentation Algorithm with k-Means Cluster“. Applied Mechanics and Materials 548-549 (April 2014): 1179–84. http://dx.doi.org/10.4028/www.scientific.net/amm.548-549.1179.

Der volle Inhalt der Quelle

Annotation:

Image segmentation with low computational burden has been highly regarded as important goal for researchers. One of the popular image segmentation methods is normalized cut algorithm. But it is unfavorable for high resolution image segmentation because the amount of segmentation computation is very huge [1]. To solve this problem, we propose a novel approach for high resolution image segmentation based on the Normalized Cuts. The proposed method preprocesses an image by using the normalized cut algorithm to form segmented regions, and then use k-Means clustering on the regions. The experimental results verify that the proposed algorithm behaves an improved performance comparing to the normalized cut algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Abdulaali, Haneen H., Samer M. Abdul Ahleem und Abdul Kareem J. Kadhim. „The Effect of Machining Parameters on the Temperature Distribution in Metal Cutting Operation“. International Journal of Heat and Technology 40, Nr. 5 (30.11.2022): 1234–40. http://dx.doi.org/10.18280/ijht.400515.

Der volle Inhalt der Quelle

Annotation:

This study presents numerical solution by using coupling model between computational fluid dynamic (CFD), and finite element method (FEM) to predicted the temperature distribution through cutting tool. In this study ANSYS/Explicit dynamic used to solve finite element equations in cutting zone. Machining simulations were conducted using Aluminum (AL) and High speed steel (HSS) as a workpeice and tool material respectively. Depth of cut varied from 1.5 mm to 2.5 mm and a cutting speed varied from 6m/s to 10m/s have been considered in the simulations. The CFD model solve by using ANSYS/fluent to find the temperature distribution at the tool surface by using finite volume method. The simulation explained the influence of depth of cut, and cutting speed on cutting temperature. For all simulations, the rake angle is fixed (6°). The rise or reduction in temperature as a result of the various cutting parameters was also estimated and discussed. After solving the problem, it was discovered that the temperature at the tip (tool-work piece contact area) was the highest and gradually decreased towards the surface, and that the results showed a major influence of cutting speed on the temperature generated in the machined models and a very small influence of depth of cut on the workpiece temperature.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Chen, Li Hua, Jin Xin Cao und Qing Yu Zhao. „Tandem Lift Quay Cranes and Yard Trucks Scheduling Problem at Container Terminals“. Applied Mechanics and Materials 505-506 (Januar 2014): 927–30. http://dx.doi.org/10.4028/www.scientific.net/amm.505-506.927.

Der volle Inhalt der Quelle

Annotation:

The reasonable dispatching and scheduling of the Tandem Quay Cranes and trucks is the foundation to improve the efficiency of the container terminals. Under the base of single lift quay cranes research, a research on Tandem Lift Quay Cranes and Yard Trucks scheduling is carried on in this paper. A mixed integer programming (MIP) model can be built to solve an integrated tandem lift quay crane and yard truck scheduling problem (i-TLQCYT). A Local Sequence-cut Method is applied to solve the model. Then the shortest time to complete the unloading operations can be got.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

uit het Broek, Michiel A. J., Albert H. Schrotenboer, Bolor Jargalsaikhan, Kees Jan Roodbergen und Leandro C. Coelho. „Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm“. Operations Research 69, Nr. 2 (März 2021): 380–409. http://dx.doi.org/10.1287/opre.2020.2033.

Der volle Inhalt der Quelle

Annotation:

In “Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm,” Uit het Broek, Schrotenboer, Jargalsaikhan, Roodbergen, and Coelho present a generic branch-and-cut framework to solve routing problems with multiple depots on directed graphs. They present new valid inequalities that eliminate subtours, enforce tours to be linked to the same depot, and enforce bounds on the number of customers in a vehicle tour. This is embedded in a branch-and-cut scheme that also contains generalized and adapted versions of valid inequalities that are well known for related routing problems. The authors show that the new inequalities tighten root node relaxations considerably. In combination with a simple but effective upper-bound procedure, only requiring a MIP solver and a smart reduction of the problem size, the authors show that the overall framework solves instances of considerably larger size to optimality than have been reported in the literature.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

BILU, YONATAN, und NATHAN LINIAL. „Are Stable Instances Easy?“ Combinatorics, Probability and Computing 21, Nr. 5 (26.07.2012): 643–60. http://dx.doi.org/10.1017/s0963548312000193.

Der volle Inhalt der Quelle

Annotation:

We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP-hard problems are easier to solve, and in particular, whether there exist algorithms that solve in polynomial time all sufficiently stable instances of some NP-hard problem. The paper focuses on the Max-Cut problem, for which we show that this is indeed the case.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Grishchenko, V. A., S. S. Pozhitkova, V. Sh Mukhametshin und R. F. Yakupov. „Water cut forecast after downhole pumping equipment optimization based on displacement characteristics“. SOCAR Proceedings, SI2 (30.12.2021): 143–51. http://dx.doi.org/10.5510/ogp2021si200582.

Der volle Inhalt der Quelle

Annotation:

The article deals with the issue of water cut predicting when downhole pumping equipment optimizing. In practice, an expert assessment of this parameter is used as a rule, which does not take into account the degree of planned optimization relative to the current mode. The paper proposes a methodology allowing taking into account the dynamics of planned fluid withdrawals in predicting water cut based on displacement characteristics. To solve the described problem, four characteristics were selected with a certain type of statistical dependence, where, in one part of the equation, fluid withdrawals do not depend on oil withdrawals. This allows, by setting different values of fluid production, to predict oil production and water cut at any time period. On the example of deposits of one of the regions of the Ural-Volga region, the most suitable for certain geological conditions displacement characteristics were determined. Look back analysis shows a high degree of convergence between the calculated and actual water cut indicators – the average absolute deviation is 1.9%, which allows forecasting with sufficient accuracy. Keywords: oil fields development; production stimulation; displacement characteristics; water cut.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Aleksandrova, Irina, Anna Stoynova und Anatoliy Aleksandrov. „Modelling and Multi-objective Optimization of Elastic Abrasive Cutting of C45 and 42Cr4 Steels“. Strojniški vestnik – Journal of Mechanical Engineering 67, Nr. 12 (15.12.2021): 635–48. http://dx.doi.org/10.5545/sv-jme.2021.7327.

Der volle Inhalt der Quelle

Annotation:

Elastic abrasive cutting is a new high-performance method to produce workpieces made of materials of different hardness, which ensures lower wear of cut-off wheels and higher quality machined surfaces. However, the literature referring to elastic abrasive cutting is scarce; additional studies are thus needed. This paper proposes a new approach for modelling and optimizing the elastic abrasive cutting process, reflecting the specifics of its particular implementation. A generalized utility function has been chosen as an optimization parameter. It appears as a complex indicator characterizing the response variables of the elastic abrasive cutting process. The proposed approach has been applied to determine the optimum conditions of elastic abrasive cutting of С45 and 42Cr4 steels. To solve the optimization problem, a model of the generalized utility function reflecting the complex influence of the elastic abrasive cutting conditions has been developed. It is based on the findings of the complex study and modelling of the response variables of the elastic abrasive cutting process (cut-off wheel wear, time per cut, cut piece temperature, cut off wheel temperature and workpiece temperature) depending on the conditions of its implementation (compression force F exerted by the cut-off wheel on the workpiece, workpiece rotational frequency nw, cut off wheel diameter ds). By applying a genetic algorithm, the optimal conditions of elastic abrasive cutting of С45 and 42Cr4 steels: ds = 120 mm; F = 1 daN; nw = 63.7 min–1 and nw = 49.9 min–1, respectively for С45 and 42Cr4 steels, have been determined. They provide the best match between the response variables of the elastic abrasive cutting process.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Zhang, Lei, Xiang Yu und Wei Li. „Strategy Analysis of Override-Control for Drum Height of Shearers“. Advanced Materials Research 915-916 (April 2014): 422–25. http://dx.doi.org/10.4028/www.scientific.net/amr.915-916.422.

Der volle Inhalt der Quelle

Annotation:

Aiming to solve the switch problem between auto-and manual-operation of shearer memory-cut due to variation of coal seam conditions, this paper proposes a method that introduces the strategy of override control to the controlling system of shearer memory-cut. This study also improves the control of hydraulic system for lifting cylinder, and designs an override control system for lifting cylinder of shearer. The procedure for controlling the height adjustment mechanism is thus addressed to offer a new control means for reliable operation of the shearer during operations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Lee, Ju Hyung, Jin Woo Cho, Ji Nung Do und Bong Geun Park. „Evaluation of Field Applicability of Cast-in-Place Piles Using Surfactant Grout“. Key Engineering Materials 744 (Juli 2017): 207–13. http://dx.doi.org/10.4028/www.scientific.net/kem.744.207.

Der volle Inhalt der Quelle

Annotation:

In case of underground construction affected by groundwater, CIP (Cast-In-Place Pile) method is generally used to solve the geo-hydraulic problem. However, as this method has poor connectivity between piles, an auxiliary method for cut-off is required in many cases. In this study, a newly-developed cut-off wall (H-CIP) with no auxiliary method, by using surfactant grout (Hi-FA), which improves anti-washout and infiltration ability, is introduced, and the field applicability of H-CIP method is evaluated. CIP and H-CIP piles were installed with same ground conditions, and field and laboratory tests were conducted to verify the performance, respectively. As results, newly-contrived H-CIP method shows higher field performance for cut-off and strength than conventional CIP method.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Yang, Li Ping. „Analysis on Dynamic Fault Tree Based on Fuzzy Set“. Applied Mechanics and Materials 110-116 (Oktober 2011): 2416–20. http://dx.doi.org/10.4028/www.scientific.net/amm.110-116.2416.

Der volle Inhalt der Quelle

Annotation:

In case of fault tree analysis of large complex system, the probability of bottom event in dynamic fault tree is uncertain in some cases. To address the problem, the paper presented a dynamic fault tree analysis method based on fuzzy set computation. The method separates logic attributes and timing attributes of dynamic logic gates. It can convert dynamic fault tree into static fault tree not considering timing constraints and obtain minimum cut set of static fuzzy fault tree with set operations, then the concept of minimum cut set is extended to dynamical minimum cut sequence. Thus, the dynamic fault tree was analyzed in both qualitative and quantitative aspects, which solve the problem that it is difficult to assign value of event probability in previously process.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Yuan, Zhiwang, Zhiping Li, Li Yang und Yingchun Zhang. „New Waterflooding Characteristic Curves Based on Cumulative Water Injection“. Mathematical Problems in Engineering 2020 (27.04.2020): 1–12. http://dx.doi.org/10.1155/2020/7415236.

Der volle Inhalt der Quelle

Annotation:

When a conventional waterflooding characteristic curve (WFCC) is used to predict cumulative oil production at a certain stage, the curve depends on the predicted water cut at the predicted cutoff point, but forecasting the water cut is very difficult. For the reservoirs whose pressure is maintained by water injection, based on the water-oil phase seepage theory and the principle of material balance, the equations relating the cumulative oil production and cumulative water injection at the moderately high water cut stage and the ultrahigh water cut stage are derived and termed the Yuan-A and Yuan-B curves, respectively. And then, we theoretically analyze the causes of the prediction errors of cumulative oil production by the Yuan-A curve and give suggestions. In addition, at the ultrahigh water cut stage, the Yuan-B water cut prediction formula is established, which can predict the water cut according to the cumulative water injection and solve the difficult problem of water cut prediction. The application results show Yuan-A and Yuan-B curves are applied to forecast oil production based on cumulative water injection data obtained by the balance of injection and production, avoiding reliance on the water cut forecast and solving the problems of predicting the cumulative oil production of producers or reservoirs that have not yet shown the decline rule. Furthermore, the formulas are simple and convenient, providing certain guiding significance for the prediction of cumulative oil production and water cut for the same reservoir types.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Dai, Guozhong, Jiajing Xu, Shujin Li, Xiongwei Li, Guicai Shi und Weicheng Shi. „Finite element analysis on permeability of cut-off wall for landfill“. IAES International Journal of Robotics and Automation (IJRA) 10, Nr. 1 (01.03.2021): 59. http://dx.doi.org/10.11591/ijra.v10i1.pp59-67.

Der volle Inhalt der Quelle

Annotation:

<p><span>Finite element method is an efficient numerical calculation method based on information technology, which can be used to solve complex equations in various problems. At present, the finite element method is mainly used to deal with seepage problems in dams, while there is less study on seepage in landfill. In this paper, finite element method is used to analyze the seepage of cut-off wall of a landfill in Jiangsu Province, and the movement of landfill leachate in cut-off wall under different conditions is simulated. The simulation results show that The cut-off wall can effectively slow down the seepage velocity of leachate; Under different conditions, the maximum gradient of the cut-off wall are 18.68 and 13.84 respectively, which conforms to Chinese national standard. Therefore, the design of cut-off wall is safe and reasonable, and filtration erosion will not occur; This simulation method combined with information technology can provide new solutions and ideas for other projects to verify safety and rationality.</span></p>

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Thilmany, Jean. „Finding Forces“. Mechanical Engineering 131, Nr. 10 (01.10.2009): 33–36. http://dx.doi.org/10.1115/1.2009-oct-3.

Der volle Inhalt der Quelle

Annotation:

This article explains how today's analysis software are helping engineers to quickly solve for more than one physical phenomenon at a time. Today's simulation software mirror real-life behavior. Engineers can now run multiple analyses within the same application or within loosely coupled applications. Other systems allow users to solve for more than one force at the same time. The capability to solve in tandem or to work with integrated systems greatly speeds the analysis process. Analysis advances also allow engineering firms to call upon the analysis software to design complex and never-before-seen products, to test for safety quicker than before, and to cut costs by perfecting designs earlier in the development process.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Huang, Xing Hong, Xu Hua Pan, Xing Wu und Wen Guang Huang. „Research on Triaxial Linkage and Cut Point Tracking for Automotive Crankshaft Servo Grinder and its Key Technology“. Applied Mechanics and Materials 66-68 (Juli 2011): 419–23. http://dx.doi.org/10.4028/www.scientific.net/amm.66-68.419.

Der volle Inhalt der Quelle

Annotation:

Based on the principle analysis of two-axis linkage and cut point tracking crankshaft servo grinding technology, the principle of triaxial linkage and cut point tracking for crankshaft servo grinding is analyzed and researched on the technological advantages for the neck of crankshaft connecting rod and the spindle neck. Then the dynamic grinding model is established, and the high-precision liquid hydrostatic slide-way technology, high rigidity straight line drive technology and on-line measurement and error compensation technology are employed synthetically to solve the dynamic performance of moving parts for ultra-precision grinding and its influence on the machining accuracy successfully. The problem of using common corundum wheel to process the crankshaft neck and connecting rod efficiently and accurately is conquered.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Wu, Xiao Ying, Li Juan Ma, Zhao Feng Li und Shi Tao Yan. „Color Image Region Growth Segmentation Integration of Normalized Cut“. Advanced Materials Research 143-144 (Oktober 2010): 139–42. http://dx.doi.org/10.4028/www.scientific.net/amr.143-144.139.

Der volle Inhalt der Quelle

Annotation:

This paper solves that image segmentation result is not consistent with human visual perception or too broken. First of all, based on the continuity of image features, appropriate human vision, calculated the similarity of color image pixel as Eq.2 in HSV space to grow region, then made the regional merge, using normalized-cut segmentation method as Eq.4 and Eq.5 to eliminate over-segmentation phenomenon. In this paper, experimental results shows that the segmentation can be achieved very good results as Fig.1, and parts of the method can be applied in other segmentation to solve over segmentation. This method on color images as the research object is different from other methods on gray images, the selection of seeds and achieves these automatic that differ from general algorithms, presents a new implementation to solve over-segmentation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Xiang, Jingwei, Xiaoqing Song und Jiangfeng Li. „Cropland Use Transitions and Their Driving Factors in Poverty-Stricken Counties of Western Hubei Province, China“. Sustainability 11, Nr. 7 (04.04.2019): 1997. http://dx.doi.org/10.3390/su11071997.

Der volle Inhalt der Quelle

Annotation:

Agriculture is important for economic development in most poverty-stricken areas in China, but cropland use is facing challenges due to rapid industrialization and urbanization, causing serious issues for poverty alleviation and sustainable socioeconomic development. Cropland Use Transition (CUT) is one way to alleviate poverty and develop the economy in poverty-stricken areas. This paper chose 16 typical poverty-stricken counties in Western Hubei province as the case area. A morphology index system was established to evaluate CUT, and geographic information system software was used to analyze the temporal-spatial variations in CUT. Using the Radial Basis Function Neural Network (RBFNN) model, contributions of driving factors of population, economy, and industrial structure to CUT were analyzed. The results show that: (1) cropland use morphology can be divided into functional morphology and spatial morphology; (2) the spatial distribution of CUT was high in the north and low in the south, the temporal variation of CUT from 1995 to 2013 showed fluctuations, and the coefficient of CUT changed from 0.460 to 0.649 with a growth rate of 41%; (3) for the driving factors, population factors most significantly contributed to CUT, followed by industrial structure and economic factors. The results obtained in this study are in line with the findings of previous studies. The RBFNN model is suitable for evaluating the contributions of driving factors, which can solve the deficiency in previous studies caused by ignoring the internal relationship and target orientation of driving factors. This study suggests that poverty-stricken counties should narrow the urban–rural divide, encourage balanced labor and investment flow into cropland by formulating relevant economic policies, motivate farmers’ agricultural engagement, and use science and technology to promote CUT and the growth of the agricultural economy, poverty alleviation, and to coordinate urban–rural development.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Han, Yu Qi, Shu Xin Cui, Yong Wang und Ge Gao. „Application of Ghost Body-Cell Method on Adaptively Refined Cartesian Grid in Computational Fluid Dynamics“. Applied Mechanics and Materials 300-301 (Februar 2013): 775–80. http://dx.doi.org/10.4028/www.scientific.net/amm.300-301.775.

Der volle Inhalt der Quelle

Annotation:

Least-squares fitting was employed to interpolate the reflect point, ghost body-cell method (GBCM) was applied to quadtree-based adaptively refined Cartesian grid approach, and finite volume method was employed to solve Euler equations. Shape of cut cell kept in accordance with that in the flow field which efficiently relieved the time step restriction of small cut cells. Flows around a circular cylinder and the double NACA0012 airfoils are simulated and compared with published structured grid results, which show flow field around complex geometries is adequately resolved resort to GBCM approach on adaptively refined Cartesian grid in computational fluid dynamics (CFD).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Lam, Edward, und Pierre Le Bodic. „New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding“. Proceedings of the International Conference on Automated Planning and Scheduling 30 (01.06.2020): 184–92. http://dx.doi.org/10.1609/icaps.v30i1.6660.

Der volle Inhalt der Quelle

Annotation:

BCP, a state-of-the-art algorithm for optimal Multi-agent Path Finding, uses the branch-and-cut-and-price framework to decompose the problem into (1) a master problem that selects a set of collision-free low-cost paths, (2) a pricing problem that adds lower-cost paths to the master problem, (3) separation problems that resolve various kinds of conflicts in the master problem, and (4) branching rules that split the nodes in the high-level branch-and-bound search tree. This paper focuses on the separation aspects of the decomposition by introducing five new classes of fractional conflicts and valid inequalities that remove these conflicts to tighten the linear programming relaxation in the master problem. Experimental results on 12820 instances across 16 maps indicate that including the five families of inequalities allows BCP to solve an additional 585 instances, optimize the same instances 41% faster, and solve 2068 more instances than CBSH-RM and 157 more than Lazy CBS.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Shehata, M., M. Shokry, R. A. Abd-Elmonem und I. L. El-Kalla. „New View on Nonlinear Picture Fuzzy Integral Equations“. Fractal and Fractional 7, Nr. 5 (30.04.2023): 377. http://dx.doi.org/10.3390/fractalfract7050377.

Der volle Inhalt der Quelle

Annotation:

In this article, we solve the second type of nonlinear Volterra picture fuzzy integral equation (NVPFIE) using an accelerated form of the Adomian decomposition method (ADM). Based on (α,δ,β)-cut, we convert the NVPFIE to the nonlinear Volterra integral equations in a crisp form. An accelerated version of the ADM is used to solve this transformed system, which is based on a new formula for the Adomian polynomial. The sufficient condition that guarantees a unique solution is obtained using this new Adomian polynomial, error estimates are given, and the convergence of the series solution is proven. Numerical cases are discussed to illustrate the effectiveness of this approach.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!