Log in

Relevant bibliographies by topics / Cut-And-Solve / Journal articles

To see the other types of publications on this topic, follow the link: Cut-And-Solve.

Journal articles on the topic 'Cut-And-Solve'

Author: Grafiati

Published: 25 May 2024

Last updated: 19 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Cut-And-Solve.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sawaluddin and Maharani Beruh. "Analysis Of Branch And Cut And Branch And Bound Methods To Solve Mixed Integer Linear Programming Problems." Journal of Mathematics Technology and Education 3, no. 4 (2024): 401–11. https://doi.org/10.32734/jomte.v3i4.12499.

Full text

Abstract:

Mixed integer linear programming is a combinatorial optimization problem that is difficult to solve efficiently. One method that can be used to solve mixed integer linear programming problems is the branch and bound and branch and cut methods. The Branch and Bound method is a working procedure that takes a long time to find the optimal solution that is achieved. This method uses the results of the simplex method which does not have an integer value so that branching and limitations are carried out on the variable with the largest fractional value. The branch and cut method is a combination of

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Deaconu, Adrian, and Laura Ciupala. "Inverse Minimum Cut Problem with Lower and Upper Bounds." Mathematics 8, no. 9 (2020): 1494. http://dx.doi.org/10.3390/math8091494.

Full text

Abstract:

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, and other styles

8

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

Abstract:

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 th

APA, Harvard, Vancouver, ISO, and other styles

11

De Oliveira, Willy Alves, and 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, no. 3 (2018): 515. http://dx.doi.org/10.5540/tema.2017.018.03.515.

Full text

Abstract:

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 a

APA, Harvard, Vancouver, ISO, and other styles

12

Fadavi, Niloofar, Yasin Gharehmohammadlou, and Sina Akbari. "Multi-Cut Implementation of Hub-and-Spoke Problem with Congestion Consideration." Applied Economics and Finance 12, no. 2 (2025): 22. https://doi.org/10.11114/aef.v12i2.7667.

Full text

Abstract:

In this study, we examine a p-hub location problem where the objective function encompasses regular transportation costs, fixed expenses, and congestion costs associated with hubs. We demonstrate that the model for this problem is a convex mixed integer programming problem. To solve the problem, we introduce a multi-cut cutting-plane method and compare its performance to the existing single cut version method. Our findings show that the multi-cut method outperforms the single-cut method in terms of the time required to reach a solution. The results of numerical experiments conducted to support

APA, Harvard, Vancouver, ISO, and other styles

13

Rahmani, Arsalan, and 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, no. 1 (2017): 1. http://dx.doi.org/10.4995/ijpme.2017.6512.

Full text

Abstract:

<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

APA, Harvard, Vancouver, ISO, and other styles

14

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.

Full text

Abstract:

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, and other styles

15

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Wu, Peng, Ada Che, Feng Chu, and 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, no. 3 (2015): 1479–92. http://dx.doi.org/10.1109/tits.2014.2368594.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Ait Bouziaren, Soumaya, and 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, no. 1 (2019): 195–204. http://dx.doi.org/10.1109/tits.2018.2808179.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Apkhudov, Timur, Lyudmila Shekikhacheva, Inal Makuashev, Bela Khazhmetova, and Kantemir Khazhmetov. "Justification of the design and technological scheme of a machine for selecting and chopping cut branches of fruit plants in terrace gardening." АгроЭкоИнфо 3, no. 63 (2024): 13. http://dx.doi.org/10.51419/202143313.

Full text

Abstract:

The experience of using machines for selecting and chopping cut branches in lowland intensive gardening has shown that chopping cut branches with embedding the resulting chips into the soil and scattering them on the soil surface can increase the fertility of the soil cover in the rows of the garden. However, the most rational technology for waste disposal in terrace gardening is the selection and chopping of cut branches with transportation of the crushed biomass of the branches to the trunk strips of fruit plantings. To solve this problem, a new design and technological scheme of the machine

APA, Harvard, Vancouver, ISO, and other styles

20

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

21

Gu, Shenshen, and 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, no. 2 (2020): 298. http://dx.doi.org/10.3390/math8020298.

Full text

Abstract:

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 learni

APA, Harvard, Vancouver, ISO, and other styles

22

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

Full text

Abstract:

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, and other styles

23

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

Full text

Abstract:

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, and other styles

24

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.

Full text

Abstract:

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 algorith

APA, Harvard, Vancouver, ISO, and other styles

25

Wang, Qian, Ying Kai Long, Gao Lin Wu, and 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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

26

Munapo, Elias, Joshua Chukwuere, and Trust Tawanda. "Solving Linear Integer Models with Variable Bounding." Forecasting 5, no. 2 (2023): 443–52. http://dx.doi.org/10.3390/forecast5020024.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

27

Ali, Tesfamichael Molla, Monika Panghal, and 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, no. 1 (2020): 1. http://dx.doi.org/10.1504/ijmor.2020.10035753.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Prasad, Sandeep, Monika Panghal, and 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, no. 1 (2022): 26. http://dx.doi.org/10.1504/ijmor.2022.120314.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

30

Li, Chen, Jun Li, Xiaoyong Lian, Yongen Li, Qi Xue, and 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 (May 17, 2021): 1–16. http://dx.doi.org/10.1155/2021/5533741.

Full text

Abstract:

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 strat

APA, Harvard, Vancouver, ISO, and other styles

31

Li, Xu, Chaoyang Zhang, Xueqi Wang, Xiaoxiao Liu, Xinliang Zhu, and 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, no. 6 (2023): 1335. http://dx.doi.org/10.3390/foods12061335.

Full text

Abstract:

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 conditi

APA, Harvard, Vancouver, ISO, and other styles

32

Агапов and 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, no. 2 (2014): 128–35. http://dx.doi.org/10.12737/4517.

Full text

Abstract:

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, and other styles

33

Zhao, Dongping, Xitian Tian, and 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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

34

Yu, Wen Ting, Jing Ling Wang, and 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.

Full text

Abstract:

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 experimenta

APA, Harvard, Vancouver, ISO, and other styles

35

Guozhong, Dai, Xu Shujin Li Jiajing, Li Xiongwei, Shi Guicai, and Shi Weicheng. "Finite element analysis on permeability of cut-off wall for landfill." IAES International Journal of Robotics and Automation (IJRA) 10, no. 1 (2021): 59–67. https://doi.org/10.11591/ijra.v10i1.pp59-67.

Full text

Abstract:

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 th

APA, Harvard, Vancouver, ISO, and other styles

36

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

Full text

Abstract:

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, and other styles

37

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

38

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

Full text

Abstract:

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 th

APA, Harvard, Vancouver, ISO, and other styles

39

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

Full text

Abstract:

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 relat

APA, Harvard, Vancouver, ISO, and other styles

40

BILU, YONATAN, and NATHAN LINIAL. "Are Stable Instances Easy?" Combinatorics, Probability and Computing 21, no. 5 (2012): 643–60. http://dx.doi.org/10.1017/s0963548312000193.

Full text

Abstract:

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, and other styles

41

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

Full text

Abstract:

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 withdra

APA, Harvard, Vancouver, ISO, and other styles

42

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

Full text

Abstract:

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 th

APA, Harvard, Vancouver, ISO, and other styles

43

Kelechi, Ihekoronye, Sulaiman Dodo, Adamu Bello, Usman Hassan, and Milton Zwalatha. "3-D Modelling and Simulation of a Reservoir for Surfactant-Polymer Flooding Using Eclipse Software." American Journal of Mathematical and Computer Modelling 9, no. 3 (2024): 54–67. http://dx.doi.org/10.11648/j.ajmcm.20240903.11.

Full text

Abstract:

Surfactant-polymer flooding is a tertiary enhanced oil recovery method used to recover oil that remained in the reservoir after the primary and secondary oil recovery mechanisms. Predicting the pressure in the reservoir is important for oil production as pressure changes with time. A suitable approach to achieve this task is to derive fluid flow equation based on the reservoir characteristics and solve them numerically which provide the solution to the mathematical fluid flow model (diffusivity equation). In this study, 3-D reservoir was modelled using Eclipse software. The fluid flow equation

APA, Harvard, Vancouver, ISO, and other styles

44

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

Full text

Abstract:

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 te

APA, Harvard, Vancouver, ISO, and other styles

45

Zhang, Lei, Xiang Yu, and 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.

Full text

Abstract:

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, and other styles

46

Amit, S. Closepet*1 &. K. Uma Rao2. "LOAD SCHEDULING AND SOLAR BASED ENERGY COST OPTIMIZATION FOR CONSUMERS IN DEVELOPING COUNTRIES." INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY 7, no. 2 (2018): 102–6. https://doi.org/10.5281/zenodo.1165674.

Full text

Abstract:

To solve the energy crisis in India, it is very important to develop smart algorithms to gain a mush quicker solution to the power cut problems. India, it is filled with a lot of basic essential issues that first needs to be solved such as continuous access for drinking water to all, food for all and most importantly electricity for all. This paper talks about how combining solar energy, load shifting and partial outage can benefit the consumers to tackle the power cut problems. Knowing the power cut scenario in the local areas, the step one of the algorithm calculates, the loads that can be s

APA, Harvard, Vancouver, ISO, and other styles

47

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

Full text

Abstract:

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 dynam

APA, Harvard, Vancouver, ISO, and other styles

48

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

Full text

Abstract:

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 Yu

APA, Harvard, Vancouver, ISO, and other styles

49

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

Full text

Abstract:

<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 eff

APA, Harvard, Vancouver, ISO, and other styles

50

Huang, Xing Hong, Xu Hua Pan, Xing Wu, and 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 (July 2011): 419–23. http://dx.doi.org/10.4028/www.scientific.net/amm.66-68.419.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!