1
|
An Empirical Comparison of Portuguese and Multilingual BERT Models for Auto-Classification of NCM Codes in International Trade. BIG DATA AND COGNITIVE COMPUTING 2022. [DOI: 10.3390/bdcc6010008] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
Abstract
Classification problems are common activities in many different domains and supervised learning algorithms have shown great promise in these areas. The classification of goods in international trade in Brazil represents a real challenge due to the complexity involved in assigning the correct category codes to a good, especially considering the tax penalties and legal implications of a misclassification. This work focuses on the training process of a classifier based on bidirectional encoder representations from transformers (BERT) for tax classification of goods with MCN codes which are the official classification system for import and export products in Brazil. In particular, this article presents results from using a specific Portuguese-language-pretrained BERT model, as well as results from using a multilingual-pretrained BERT model. Experimental results show that Portuguese model had a slightly better performance than the multilingual model, achieving an MCC 0.8491, and confirms that the classifiers could be used to improve specialists’ performance in the classification of goods.
Collapse
|
2
|
Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks. Symmetry (Basel) 2021. [DOI: 10.3390/sym13112082] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022] Open
Abstract
This paper studies the multi-depot joint distribution vehicle routing problem considering energy consumption with time-dependent networks (MDJDVRP-TDN). Aiming at the multi-depot joint distribution vehicle routing problem where the vehicle travel time depends on the variation characteristics of the road network speed in the distribution area, considering the influence of the road network on the vehicle speed and the relationship between vehicle load and fuel consumption, a multi-depot joint distribution vehicle routing optimization model is established to minimize the sum of vehicle fixed cost, fuel consumption cost and time window penalty cost. Traditional vehicle routing problems are modeled based on symmetric graphs. In this paper, considering the influence of time-dependent networks on routes optimization, modeling is based on asymmetric graphs, which increases the complexity of the problem. A hybrid genetic algorithm with variable neighborhood search (HGAVNS) is designed to solve the model, in which the nearest neighbor insertion method and Logistic mapping equation are used to generate the initial solution firstly, and then five neighborhood structures are designed to improve the algorithm. An adaptive neighborhood search times strategy is used to balance the diversification and depth search of the population. The effectiveness of the designed algorithm is verified through several groups of numerical instances with different scales. The research can enrich the relevant theoretical research of multi-depot vehicle routing problems and provide the theoretical basis for transportation enterprises to formulate reasonable distribution schemes.
Collapse
|
3
|
Abstract
Smart logistics is an indispensable building block in smart cities development that requires solving the challenge of efficiently serving the demands of geographically distributed customers by a fleet of vehicles. It consists of a very well-known NP-hard complex optimization problem, which is known as the capacitated vehicle routing problem (CVRP). The CVRP has widespread real-life applications such as delivery in smart logistics, the pharmaceutical distribution of vacancies, disaster relief efforts, and others. In this work, a novel giant tour best cost crossover (GTBCX) operator is proposed which works stochastically to search for the optimal solutions of the CVRP. An NSGA-II-based routing algorithm employing GTBCX is also proposed to solve the CVRP to minimize the total distance traveled as well as to minimize the longest route length. The simulated study is performed on 88 benchmark CVRP instances to validate the success of our proposed GTBCX operator against the nearest neighbor crossover (NNX) and edge assembly crossover (EAX) operators. The rigorous simulation study shows that the GTBCX is a powerful operator and helps to find results that are superior in terms of the overall distance traveled, length of the longest route, quality, and number of Pareto solutions. This work employs a multi-objective optimization algorithm to solve the capacitated vehicle routing problem (CVRP), where the CVRP is represented in the form of a two-dimensional graph. To compute the values’ objective functions, the distance between two nodes in the graph is considered symmetric. This indicates that the genetic algorithm complex optimization algorithm is employed to solve CVRP, which is a symmetry distance-based graph.
Collapse
|