Estimating Tree Canopy Cover and Identifying Deforestation Patterns in Meghalaya (1990-2021) through ML Classifiers

This study utilizes ML classifiers to estimate canopy density based on three decades of data (1990-2021). The Support Vector Machine (SVM) classifier outperformed other classifiers, such as Random Tree and Maximum Likelihood. Satellite data from Landsat and Sentinel 2 was classified using a developed python model, providing an economical and time-saving approach. The accuracy of the classification was evaluated through a confusion matrix and area computation. The findings indicate a negative trend in the overall decadal change, with significant tree loss attributed to jhum cultivation, mining, and quarry activities. However, positive changes were observed in recent years due to the ban on illegal mining. The study highlights the dynamic nature of tree cover and emphasizes the need for biennial assessments using at least five time-series data. Micro-level analysis in Shallang, West Khasi hills, revealed a concerning trend of shortening jhum cycles. Automation in canopy change analysis is crucial for effective forest monitoring, providing timely information for law enforcement proposals and involving forest managers, stakeholders, and watchdog organizations.

Multi-objectives fuzzy optimization model for ship form demonstration based on information entropy

Selecting optimization ship form scheme is an important content in the process of concept design of ship. Multi-objective fuzzy decision-making model for ship form demonstration is set up according to the fuzzy pattern-recognition theory. Weight coefficients of each target of ship form scheme are determined by information entropy and individual subjective partiality. This model is used to select the optimal ship form scheme,the example shows that the model is exact and the result is credible. It can provide a reference for choosing the optimization scheme of ship form.

Model and algorithm for container ship stowage planning based on bin-packing problem

In a general case, container ship serves many different ports on each voyage. A stowage planning for container ship made at one port must take account of the influence on subsequent ports. So the complexity of stowage planning problem increases due to its multi-ports nature. This problem is NP-hard problem. In order to reduce the computational complexity, the problem is decomposed into two sub-problems in this paper. First, container ship stowage problem (CSSP) is regarded as 'packing problem', ship-bays on the board of vessel are regarded as bins, the number of slots at each bay are taken as capacities of bins, and containers with different characteristics (homogeneous containers group) are treated as items packed. At this stage, there are two objective functions, one is to minimize the number of bays packed by containers and the other is to minimize the number of overstows. Secondly, containers assigned to each bays at first stage are allocate to special slot, the objective functions are to minimize the metacentric height, heel and overstows.The taboo search heuristics algorithm are used to solve the subproblem. The main focus of this paper is on the first subproblem. A case certifies the feasibility of the model and algorithm.

Review of containership stowage plans for full routes

Containership stowage plans are a pivotal teaches in the system of container transportation.With the increasing containers shipping,planning containership stowage has become more and more complicated.So intelligent stowage planning for containerships is of great significance.An effective stowage plan may improve efficiency of transportation system.First,the progress of containership stowage plan at home and abroad is reviewed,including the latest developments,such as the application of various optimization methods and computer techniques to the problem.Then,the complexities of the problem are discussed and areas where investigations are still needed are pointed out.This will provide a reference for further research on the subject.

Research on the Optimization Approach for Cargo Oil Tank Design Based on the Improved Particle Swarm Optimization Algorithm

Based on the improved particle swarm optimization(PSO) algorithm,an optimization approach for the cargo oil tank design(COTD) is presented in this paper.The purpose is to design an optimal overall dimension of the cargo oil tank(COT) under various kinds of constraints in the preliminary design stage.A non-linear programming model is built to simulate the optimization design,in which the requirements and rules for COTD are used as the constraints.Considering the distance between the inner shell and hull,a fuzzy constraint is used to express the feasibility degree of the double-hull configuration.In terms of the characteristic of COTD,the PSO algorithm is improved to solve this problem.A bivariate extremum strategy is presented to deal with the fuzzy constraint,by which the maximum and minimum cargo capacities are obtained simultaneously.Finally,the simulation demonstrates the feasibility and effectiveness of the proposed approach.