Sugarcane Harvest Logistics in Brazil

2013 ◽  
Author(s):  
Kamal Lamsal ◽  
Barrett W. Thomas ◽  
Philip C. Jones
Keyword(s):  
Lower Bound ◽  
Feasible Solution ◽  
Valid Inequalities ◽  
Sugar Content ◽  
Capital Investments ◽  
Computational Results ◽  
Sugar Mills ◽  
Initial Feasible Solution

Sugar mills in Brazil represent significant capital investments. To maintain appropriate returns on their investment, sugar companies seek to run the mills at capacity over the entire nine months of the sugarcane harvest season. Because the sugar content of cane degrades considerably once it is cut, maintaining inventories of cut cane is undesirable. Instead, mills want to coordinate the arrival of cut cane with production. In this paper, we present a model of the sugarcane harvest logistics problem in Brazil. We introduce a series of valid inequalities for the model, introduce heuristics for finding an initial feasible solution, and for lifting the lower bound. Computational results demonstrate the effectiveness of the inequalities and heuristics. In addition, we explore the value of allowing trucks to serve multiple rather than single locations and demonstrate the value of allowing the harvest speed to vary.

Single-Machine Scheduling to Minimize Makespan with Deterioration Jobs and Multi-Maintenance Activities

2013 ◽  
Vol 690-693 ◽  
pp. 3007-3013
Author(s):  
Chou Jung Hsu ◽  
Hung Chi Chen
Keyword(s):  
Lower Bound ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Initial Condition ◽  
Computational Results ◽  
Maintenance Activity ◽  
Deterioration Jobs ◽  
Deterioration Effect ◽  
Maintenance Activities

This paper explored a single-machine scheduling deterioration jobs with multi-maintenance activities. The non-resumable case and simple linear deterioration effect were taken into account as well. We assumed that after a maintenance activity, the machine will revert to its initial condition and the deterioration effect will start anew. The objective was to minimize the makespan in the system. The problem was proven to be NP-hard in the strong sense. Therefore, a heuristic and a lower bound were introduced and tested numerically. Computational results showed that the proposed algorithm performed well.

ECONOMIC PREREQUISITES FOR THE FORMATION OF OPTIMAL SUGAR MILLS RAW ZONES OF THE OREL REGION

2020 ◽  
Vol 5 (86) ◽  
pp. 123-129
Author(s):  
E.Yu. Kalinicheva ◽  
◽  
M.N. Uvarova ◽  
L.N. Zhilina ◽  
◽  
...  
Keyword(s):  
Sugar Beet ◽  
Production Efficiency ◽  
Agricultural Sector ◽  
Raw Materials ◽  
Sugar Content ◽  
Specific Weight ◽  
Raw Material ◽  
Sugar Beets ◽  
Sugar Mills ◽  
Sown Area

The article justified the necessity of developing a strategy for the improvement of the sugar beet subcomplex of the region on the base of the determination of the close relationship between beet-growing farms, enterprises engaged in the delivery, processing and sale of manufactured products. According to the authors, the optimization of the raw material zone should include the principle of maximum loading of sugar mills, taking into account the raw materials produced in the region, optimizing transport costs for its delivery. The analysis of the sown area, productivity and gross yield of sugar beets gives us the idea that the region takes the tenth place among the largest producers of sugar beets. The yield and gross yield in 2019 in agricultural enterprises amounted to 459.6 centner / ha, 2231.9 thousand centner (an increase of 13.6% and 9.4% compared to the level of 2018).For P(F)E, the average increase is 40%, which corresponds to 481 centner / ha, 18.3 thousand tons. The average sugar content of beets during acceptance and processing ranges from 17.96 to 18.3%, the sugar yield is 15.63%, the sugar content in molasses is 1.68%, and the average daily productivity is 16.11 thousand ton / day, loss in production is 1.27%. The authors found that the production efficiency of the sugar beet industry is directly connected with the growth of labor productivity, the introduction of modern technologies, cost reduction, and thus, each farm has the opportunity to get additional profit. One of the main problems in the agricultural sector of the economy is the use of available resources to obtain the largest number of products. In our opinion, the production efficiency of sugar mills is closely interconnected with the constructed logistics routes for the transportation of raw materials with the exception of repeated shipments, the proportion of sugar beets in the sown area, and the reliability of suppliers. In our opinion, the efficiency of sugar mills production is in close connection with the built of the logistic routes for transportation of raw materials with the exception of repeated transportation, the specific weight of sugar beet in the structure of the sown area and the reliability ensuring of suppliers. The problem of the effective development of the sugar industry is relevant and priority in solving regional policies, the implementation of which will not only eliminate the emerging imbalances and reduce imports, but also support the domestic producer.

scholarly journals Solving the four index fully fuzzy transportation problem

2020 ◽  
Vol 11 (2) ◽  
pp. 199-215
Author(s):  
Manal Hedid ◽  
Rachid Zitouni
Keyword(s):  
Numerical Analysis ◽  
Comparative Study ◽  
Transportation Problem ◽  
Fuzzy Numbers ◽  
Feasible Solution ◽  
Second Phase ◽  
Approximation Methods ◽  
Initial Feasible Solution ◽  
Fuzzy Transportation Problem ◽  
Two Phases

In this paper, we will solve the four index fully fuzzy transportation problem (\textit{FFTP$_{4}$}) with some adapted classical methods. All problem's data will be presented as fuzzy numbers. In order to defuzificate these data, we will use the ranking function procedure. Our method to solve the \textit{FFTP$_{4}$} composed of two phases; in the first one, we will use an adaptation of well-known algorithms to find an initial feasible solution, which are the least cost, Russell's approximation and Vogel's approximation methods. In the second phase, we will test the optimality of the initial solution, if it is not optimal, we will improve it. A numerical analysis of the proposed methods is performed by solving different examples of different sizes; it is determined that they are stable, robust, and efficient. A proper comparative study between the adapted methods identifies the suitable method for solving \textit{FFTP$_{4}$}.

A Note on the Connection Between the Primal-Dual and the A* Algorithm

2010 ◽  
Vol 1 (1) ◽  
pp. 73-85 ◽  
Author(s):  
Xugang Ye ◽  
Shih-Ping Han ◽  
Anhua Lin
Keyword(s):  
Network Flow ◽  
Feasible Solution ◽  
Weighted Graph ◽  
Dual Algorithm ◽  
Heuristic Function ◽  
Network Flow Problems ◽  
A Algorithm ◽  
Flow Problems ◽  
Primal Dual ◽  
Initial Feasible Solution

The primal-dual algorithm for linear programming is very effective for solving network flow problems. For the method to work, an initial feasible solution to the dual is required. In this article, we show that, for the shortest path problem in a positively weighted graph equipped with a consistent heuristic function, the primal-dual algorithm will become the well-known A* algorithm if a special initial feasible solution to the dual is chosen. We also show how the improvements of the dual objective are related to the A* iterations.

Lower and upper bounds for the linear arrangement problem on interval graphs

2018 ◽  
Vol 52 (4-5) ◽  
pp. 1123-1145
Author(s):  
Alain Quilliot ◽  
Djamal Rebaine ◽  
Hélène Toussaint
Keyword(s):  
Lower Bound ◽  
Polynomial Time ◽  
Feasible Solution ◽  
Interval Graph ◽  
Upper Bounds ◽  
Unit Interval ◽  
Lower And Upper Bounds ◽  
Linear Arrangement ◽  
Arrangement Problem ◽  
Linear Arrangement Problem

We deal here with theLinear Arrangement Problem(LAP) onintervalgraphs, any interval graph being given here together with its representation as theintersectiongraph of some collection of intervals, and so with relatedprecedenceandinclusionrelations. We first propose a lower boundLB, which happens to be tight in the case ofunit intervalgraphs. Next, we introduce the restriction PCLAP of LAP which is obtained by requiring any feasible solution of LAP to be consistent with theprecedencerelation, and prove that PCLAP can be solved in polynomial time. Finally, we show both theoretically and experimentally that PCLAP solutions are a good approximation for LAP onintervalgraphs.

scholarly journals BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS

2013 ◽  
Vol 24 (08) ◽  
pp. 1339-1354 ◽  
Author(s):  
KENYA UENO
Keyword(s):  
Integer Programming ◽  
Lower Bound ◽  
Programming Problem ◽  
Lower Bounds ◽  
Dual Problem ◽  
Feasible Solution ◽  
Integer Programming Problem ◽  
Lp Relaxation ◽  
Size Problem

Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, which gives a formula size lower bound by showing a feasible solution of the dual problem of its LP-relaxation. As extensions of the LP bound, we introduce novel general techniques proving formula size lower bounds, named a quasi-additive bound and the Sherali-Adams bound. While the Sherali-Adams bound is potentially strong enough to give a lower bound matching to the rectangle bound, we prove that the quasi-additive bound can surpass the rectangle bound. We also reveal that the quasi-additive bound is potentially strong enough to prove the matching formula size lower bound.

scholarly journals Genetic Algorithm for Biobjective Urban Transit Routing Problem

2013 ◽  
Vol 2013 ◽  
pp. 1-15 ◽  
Author(s):  
J. S. C. Chew ◽  
L. S. Lee ◽  
H. V. Seow
Keyword(s):  
Genetic Algorithm ◽  
Feasible Solution ◽  
Benchmark Problems ◽  
Computational Results ◽  
Crossover Operator ◽  
Urban Transit ◽  
Routing Problem ◽  
Genetic Algorithm Approach ◽  
Better Than

This paper considers solving a biobjective urban transit routing problem with a genetic algorithm approach. The objectives are to minimize the passengers’ and operators’ costs where the quality of the route sets is evaluated by a set of parameters. The proposed algorithm employs an adding-node procedure which helps in converting an infeasible solution to a feasible solution. A simple yet effective route crossover operator is proposed by utilizing a set of feasibility criteria to reduce the possibility of producing an infeasible network. The computational results from Mandl’s benchmark problems are compared with other published results in the literature and the computational experiments show that the proposed algorithm performs better than the previous best published results in most cases.

scholarly journals Cutting Path Optimization Using Tabu Search

2011 ◽  
Vol 473 ◽  
pp. 739-748 ◽  
Author(s):  
Reginald Dewil ◽  
Pieter Vansteenwegen ◽  
Dirk Cattrysse
Keyword(s):  
Tabu Search ◽  
Software Package ◽  
Feasible Solution ◽  
Test Cases ◽  
Finish Cutting ◽  
Initial Feasible Solution ◽  
Commercial Software Package ◽  
Cutter Head ◽  
Cutting Path ◽  
The Given

This paper deals with generating paths for cutting irregular parts nested on a metal sheet. The objective is to minimize the total non-cutting time for the cutter head starting at a known location, cutting all the required elements and returning to the known location. In contrast to most literature on this topic, a part does not have to be cut at once. If this reduces the total non-cutting time, it is possible to cut a number of elements on a given part, then cut other parts and then return later to finish cutting the given part. The problem is modeled as a generalized traveling salesperson problem with special precedence constraints. An initial feasible solution is generated and improved by local moves embedded in a tabu search framework. The proposed algorithm shows promising results in comparison with a commercial software package on a limited set of test cases.

scholarly journals PENYELESAIAN MODEL TRANSPORTASI MENGGUNAKAN METODE ASM

2020 ◽  
Vol 14 (1) ◽  
pp. 40
Author(s):  
Nurul Iftitah ◽  
Pardi Affandi ◽  
Akhmad Yusuf
Keyword(s):  
Transportation Problem ◽  
Feasible Solution ◽  
Direct Method ◽  
Optimal Solution ◽  
Transportation Model ◽  
Initial Feasible Solution ◽  
The Cost

(demand). the method that could be used for solving the transportation problem is to directly find the optimal solution. The direct method that used in this study id the ASM method for solving the balance transportation problem and revised ASM method for solving the unbalance transportation problem. This study aims to construct a transportation model using those methods and it solution. The method on this study is to identify the transportation model, construct the transportation model matrixes, construct an algorithm table using ASM method and to determine the optimal solution of the transportation problem. The obtained result from this study was the model ASM method could determine the optimum value without using initial feasible solution. On solving the unbalance transportation problem, there is an addition of dummy cell or column step. Then reducing the cost of cell and column and change the dummy cost with the biggest cost of reduced cell or column.

Sign in / Sign up

Export Citation Format

Share Document