Long queues of arrival trucks are a common problem in seaports, and thus, carbon emissions generated from trucks in the queue cause environmental pollution. In order to relieve gate congestion and reduce carbon emissions, this paper proposes a lane allocation framework combining the truck appointment system (TAS) for four types of trucks. Based on the distribution of arrival times obtained from the TAS, lane allocation decisions in each appointment period are determined in order to minimize the total cost, including the operation cost and carbon emissions cost. The resultant optimization model is a non-linear fractional integer program. This model was firstly transformed to an equivalent integer program with bilinear constraints. Then, an improved branch-and-bound algorithm was designed, which includes further transforming the program into a linear program using the McCormick approximation method and iteratively generating a tighter outer approximation along the branch-and-bound procedure. Numerical studies confirmed the validity of the proposed model and algorithm, while demonstrating that the lane allocation decisions could significantly reduce carbon emissions and operation costs.
24 November 2022 in Journal of Engineering Research
Improving the accuracy of box office revenue forecasts is conducive to stimulating the creation, market investment, infrastructure construction, and rational allocation of public resources in the film market, as well as promoting social welfare and cultural prosperity. Since the existing box office revenue prediction algorithm does not consider film industry structure, the prediction accuracy is not satisfying. This paper firstly builds a two-stage human-machine collaborative feature processing framework. In the first stage, based on the box office data, the regression decision tree algorithm is used to process all the box office features preliminarily and delete the unimportant features automatically. In the second stage, feature processing is coupled with the built Artificial Neural Network (ANN). In this stage, the features processed by the machine are manually classified, and multiple, incompatible feature sets are divided. After designing the incompatible set network pruning algorithm, the neural network is pruned. We construct the data set with a total of 7098 movies crawled online on four platforms. Numerical experimental results show that the Mean Absolute Error (MAE) of the two-stage algorithm is significantly better than the baseline model, which can effectively reduce the noise caused by encoding between incompatible features directly, improve the prediction accuracy of ANN, accelerate the forward inference speed of ANN and reduce the consumption of computing resources.