scholarly journals A Mathematical Model for Reduction of Trim Loss in Cutting Reels at a Make-to-Order Paper Mill

2020 ◽  
Vol 10 (15) ◽  
pp. 5274
Author(s):  
Razaullah Khan ◽  
Catalin Iulian Pruncu ◽  
Abdul Salam Khan ◽  
Khawar Naeem ◽  
Muhammad Abas ◽  
...  
Keyword(s):  
Programming Model ◽  
Optimization Procedure ◽  
Paper Mill ◽  
Simplex Algorithm ◽  
Cutting Stock ◽  
Environmental Damage ◽  
Constraint Matrix ◽  
Make To Order ◽  
Proposed Model ◽  
Trim Loss

One of the main issues in a paper mill is the minimization of trim loss when cutting master reels and stocked reels into reels of smaller required widths. The losses produced in trimming at a paper mill are reprocessed by using different chemicals which contributes to significant discharge of effluent to surface water and causes environmental damage. This paper presents a real-world industrial problem of production planning and cutting optimization of reels at a paper mill and differs from other cutting stock problems by considering production and cutting of master reels of flexible widths and cutting already stocked over-produced and useable leftover reels of smaller widths. The cutting process of reels is performed with a limited number of cutting knives at the winder. The problem is formulated as a linear programming model where the generation of all feasible cutting patterns determines the columns of the constraint matrix. The model is solved optimally using simplex algorithm with the objective of trim loss minimization while satisfying a set of constraints. The solution obtained is rounded in a post-optimization procedure in order to satisfy integer constraints. When tested on data from the paper mill, the results of the proposed model showed a significant reduction in trim loss and outperformed traditional exact approaches. The cutting optimization resulted in minimum losses in paper trimming and a lesser amount of paper is reprocessed to make new reels which reduced the discharge of effluent to the environment.

A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem

2019 ◽  
Vol 6 (2) ◽  
pp. 1-19 ◽  
Author(s):  
Hesham K. Alfares ◽  
Omar G. Alsawafy
Keyword(s):  
Real Life ◽  
Cutting Stock Problem ◽  
Cutting Stock ◽  
Benchmark Problems ◽  
Standard Size ◽  
One Dimensional ◽  
Small Item ◽  
Proposed Model ◽  
Trim Loss ◽  
Industrial Problem

This article presents a new model and an efficient solution algorithm for a bi-objective one-dimensional cutting-stock problem. In the cutting-stock—or trim-loss—problem, customer orders of different smaller item sizes are satisfied by cutting a number of larger standard-size objects. After cutting larger objects to satisfy orders for smaller items, the remaining parts are considered as useless or wasted material, which is called “trim-loss.” The two objectives of the proposed model, in the order of priority, are to minimize the total trim loss, and the number of partially cut large objects. To produce near-optimum solutions, a two-stage least-loss algorithm (LLA) is used to determine the combinations of small item sizes that minimize the trim loss quantity. Solving a real-life industrial problem as well as several benchmark problems from the literature, the algorithm demonstrated considerable effectiveness in terms of both objectives, in addition to high computational efficiency.

scholarly journals Flexible Stock Allocation and Trim Loss Control for Cutting Problem in the Industrial-Use Paper Production

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Fu-Kwun Wang ◽  
Feng-Tai Liu
Keyword(s):  
Real Data ◽  
Cutting Stock Problem ◽  
Cutting Stock ◽  
Paper Production ◽  
Proposed Model ◽  
Trim Loss ◽  
Production Quantity ◽  
Industrial Use ◽  
Stock Allocation ◽  
Loss Control

We consider a one-dimensional cutting stock problem (CSP) in which the stock widths are not used to fulfill the order but kept for use in the future for the industrial-use paper production. We present a new model based on the flexible stock allocation and trim loss control to determine the production quantity. We evaluate our approach using a real data and show that we are able to solve industrial-size problems, while also addressing common cutting considerations such as aggregation of orders, multiple stock widths, and cutting different patterns on the same machine. In addition, we compare our model with others, including trim loss minimization problem (TLMP) and cutting stock problem (CSP). The results show that the proposed model outperforms the other two models regarding total flexibility and trim loss ratio.

scholarly journals Wind Farm Cable Connection Layout Optimization with Several Substations

Energies ◽  
2021 ◽  
Vol 14 (12) ◽  
pp. 3615
Author(s):  
Adelaide Cerveira ◽  
Eduardo J. Solteiro Pires ◽  
José Baptista
Keyword(s):  
Energy Production ◽  
Wind Farm ◽  
Programming Model ◽  
Optimal Solution ◽  
Wind Farms ◽  
Green Energy ◽  
Fossil Energy ◽  
Proposed Model ◽  
Short Time ◽  
Cable Connection

Green energy has become a media issue due to climate changes, and consequently, the population has become more aware of pollution. Wind farms are an essential energy production alternative to fossil energy. The incentive to produce wind energy was a government policy some decades ago to decrease carbon emissions. In recent decades, wind farms were formed by a substation and a couple of turbines. Nowadays, wind farms are designed with hundreds of turbines requiring more than one substation. This paper formulates an integer linear programming model to design wind farms’ cable layout with several turbines. The proposed model obtains the optimal solution considering different cable types, infrastructure costs, and energy losses. An additional constraint was considered to limit the number of cables that cross a walkway, i.e., the number of connections between a set of wind turbines and the remaining wind farm. Furthermore, considering a discrete set of possible turbine locations, the model allows identifying those that should be present in the optimal solution, thereby addressing the optimal location of the substation(s) in the wind farm. The paper illustrates solutions and the associated costs of two wind farms, with up to 102 turbines and three substations in the optimal solution, selected among sixteen possible places. The optimal solutions are obtained in a short time.

scholarly journals Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area

2021 ◽  
Vol 13 (3) ◽  
pp. 1190
Author(s):  
Gang Ren ◽  
Xiaohan Wang ◽  
Jiaxin Cai ◽  
Shujuan Guo
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Simultaneous Optimization ◽  
Mixed Integer ◽  
Gantry Crane ◽  
Optimization Scheme ◽  
Long Distance ◽  
Proposed Model ◽  
Hybrid Heuristic Algorithm ◽  
Searching Ability

The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and internal trucks (ITs). A creative handling scheme is proposed to reduce the long-distance, full-loaded movement of GCs by making use of the advantages of ITs. Based on this scheme, we propose a flexible crossing crane area to balance the workload of dual-GC. Decomposing the integrated problem into four sub-problems, a multi-objective mixed-integer programming model (MIP) is developed. By analyzing the characteristic of the integrated problem, a three-layer hybrid heuristic algorithm (TLHHA) incorporating heuristic rule (HR), elite co-evolution genetic algorithm (ECEGA), greedy rule (GR), and simulated annealing (SA) is designed for solving the problem. Numerical experiments were conducted to verify the effectiveness of the proposed model and algorithm. The results show that the proposed algorithm has excellent searching ability, and the simultaneous optimization scheme could ensure the requirements for efficiency, effectiveness, and energy-saving, as well as the balance rate of dual-GC.

Cuckoo optimization algorithm in reverse logistics: A network design for COVID-19 waste management

2021 ◽  
pp. 0734242X2110039
Author(s):  
Elham Shadkam
Keyword(s):  
Waste Management ◽  
Network Design ◽  
Optimization Algorithm ◽  
Reverse Logistics ◽  
Heuristic Algorithms ◽  
Programming Model ◽  
Fixed Costs ◽  
Logistics System ◽  
Cuckoo Optimization Algorithm ◽  
Proposed Model

Today, reverse logistics (RL) is one of the main activities of supply chain management that covers all physical activities associated with return products (such as collection, recovery, recycling and destruction). In this regard, the designing and proper implementation of RL, in addition to increasing the level of customer satisfaction, reduces inventory and transportation costs. In this paper, in order to minimize the costs associated with fixed costs, material flow costs, and the costs of building potential centres, a complex integer linear programming model for an integrated direct logistics and RL network design is presented. Due to the outbreak of the ongoing global coronavirus pandemic (COVID-19) at the beginning of 2020 and the consequent increase in medical waste, the need for an inverse logistics system to manage waste is strongly felt. Also, due to the worldwide vaccination in the near future, this waste will increase even more and careful management must be done in this regard. For this purpose, the proposed RL model in the field of COVID-19 waste management and especially vaccine waste has been designed. The network consists of three parts – factory, consumers’ and recycling centres – each of which has different sub-parts. Finally, the proposed model is solved using the cuckoo optimization algorithm, which is one of the newest and most powerful meta-heuristic algorithms, and the computational results are presented along with its sensitivity analysis.

A Multi-Period Evacuation Vehicle Routing Problem Model

2014 ◽  
Vol 931-932 ◽  
pp. 578-582
Author(s):  
Sunarin Chanta ◽  
Ornurai Sangsawang
Keyword(s):  
Vehicle Routing ◽  
Public Transportation ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
High Water ◽  
Mixed Integer ◽  
Routing Problem ◽  
Problem Model ◽  
Proposed Model ◽  
Evacuation Routing

In this paper, we proposed an optimization model that addresses the evacuation routing problem for flood disaster when evacuees trying to move from affected areas to safe places using public transportation. A focus is on the situation of evacuating during high water level when special high vehicles are needed. The objective is to minimize the total traveled distance through evacuation periods where a limited number of vehicles is given. We formulated the problem as a mixed integer programming model based on the capacitated vehicle routing problem with multiple evcuation periods where demand changing by the time. The proposed model has been tested on a real-world case study affected by the severe flooding in Thailand, 2011.

An Order Fulfillment Model for the LED Chip Manufacturing Plant

2013 ◽  
Vol 694-697 ◽  
pp. 3446-3452 ◽  
Author(s):  
Horng Huei Wu ◽  
Ming Feng Li ◽  
Tzu Fang Hsu
Keyword(s):  
Inventory Control ◽  
Real Life ◽  
Production Model ◽  
Order Fulfillment ◽  
Due Date ◽  
Make To Order ◽  
Proposed Model ◽  
General Production ◽  
Production Strategy ◽  
Production Output

The LED chip manufacturing (LED-CM) is an important process in the LED supply chain. The make-to-order production strategy is a general production model for the LED-CM plants to satisfy the variety requirement of their customers. However, the special features of the unstable production output and a product composed of the chips of different feasible Bins exist in the LED-CM plant. The production planner will confront the issue of effective inventory control and exact due-date performance under the severely competitive pressure. Therefore an effective order fulfillment procedure for production planners is a required key issue to accomplish the inventory control and exact due-date performance. An order fulfillment model for production planner is thus proposed in this paper to meet the requirement of the LED-CM plants. A real-life LED-CM case is also utilized to demonstrate and evaluate the application and effectiveness of the proposed model.

scholarly journals A Synchronous Optimization Model for Multiship Shuttle Tanker Fleet Design and Scheduling Considering Hard Time Window Constraint

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Zhenfeng Jiang ◽  
Dongxu Chen ◽  
Zhongzhen Yang
Keyword(s):  
Time Window ◽  
Programming Model ◽  
Transportation Cost ◽  
Exact Algorithm ◽  
Mixed Integer ◽  
Routing Problem ◽  
Hard Time ◽  
Proposed Model ◽  
Total Transportation Cost ◽  
Time Window Constraints

A Synchronous Optimization for Multiship Shuttle Tanker Fleet Design and Scheduling is solved in the context of development of floating production storage and offloading device (FPSO). In this paper, the shuttle tanker fleet scheduling problem is considered as a vehicle routing problem with hard time window constraints. A mixed integer programming model aiming at minimizing total transportation cost is proposed to model this problem. To solve this model, we propose an exact algorithm based on the column generation and perform numerical experiments. The experiment results show that the proposed model and algorithm can effectively solve the problem.

scholarly journals Stop Plan of Express and Local Train for Regional Rail Transit Line

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Qin Luo ◽  
Yufei Hou ◽  
Wei Li ◽  
Xiongfei Zhang
Keyword(s):  
Energy Consumption ◽  
Travel Time ◽  
Programming Model ◽  
Urban Rail Transit ◽  
Rail Transit ◽  
Long Distance ◽  
Passenger Travel ◽  
Urban Rail ◽  
Proposed Model ◽  
Rail Line

The urban rail transit line operating in the express and local train mode can solve the problem of disequilibrium passenger flow and space and meet the rapid arrival demand of long-distance passengers. In this paper, the Logit model is used to analyze the behavior of passengers choosing trains by considering the sensitivity of travel time and travel distance. Then, based on the composition of passenger travel time, an integer programming model for train stop scheme, aimed at minimizing the total passenger travel time, is proposed. Finally, combined with a certain regional rail line in Shenzhen, the plan is solved by genetic algorithm and evaluated through the time benefit, carrying capacity, and energy consumption efficiency. The simulation result shows that although the capacity is reduced by 6 trains, the optimized travel time per person is 10.34 min, and the energy consumption is saved by about 16%, which proves that the proposed model is efficient and feasible.

Sign in / Sign up

Export Citation Format

Share Document