Due to the rise of social and environmental concerns on global climate change, developing the low-carbon economy is a necessary strategic step to respond to greenhouse effect and incorporate sustainability. As such, there is a new trend for the cold chain industry to establish the low-carbon vehicle routing optimization model which takes costs and carbon emissions as the measurements of performance. This paper studies a low-carbon vehicle routing problem (LC-VRP) derived from a real cold chain logistics network with several practical constraints, which also takes customer satisfaction into account. A low-carbon two-echelon heterogeneous-fleet vehicle routing problem (LC-2EHVRP) model for cold chain third-party logistics servers (3PL) with mixed time window under a carbon trading policy is constructed in this paper and aims at minimizing costs, carbon emissions and maximizing total customer satisfaction simultaneously. To find the optimal solution of such a nondeterministic polynomial (NP) hard problem, we proposed an adaptive genetic algorithm (AGA) approach validated by a numerical benchmark test. Furthermore, a real cold chain case study is presented to demonstrate the influence of the mixed time window’s changing which affect customers’ final satisfaction and the carbon trading settings on LC-2EHVRP model. Experiment of LC-2EHVRP model without customer satisfaction consideration is also designed as a control group. Results show that customer satisfaction is a critical influencer for companies to plan multi-echelon vehicle routing strategy, and current modest carbon price and trading quota settings in China have only a minimal effect on emissions’ control. Several managerial suggestions are given to cold chain logistics enterprises, governments, and even consumers to help improve the development of cold chain logistics.
22 September 2023 in Advanced Engineering Informatics
We study an agent-based scheduling problem of two identical parallel machines: . The machines and tasks are regarded as agents. A new multi-agent scheduling model is proposed to achieve the optimum from the two task agents, agent A and agent B. The objective is divided into two classes. The objectives of agent A and agent B are to minimize the total tardiness time and minimize the makespan, respectively. In this article, we research two identical parallel machines in which one job category can be processed by one machine agent only or two machine agents and propose a new multi-agent model for two identical parallel machines, divided into two subsystems. For subsystem 1, the shortest processing time order is used to solve job priorities. A single distribution strategy is proposed to assign jobs to machine agents and is applied to the dynamic scheduling environment. For subsystem 2, a centralized distribution strategy is applied to the static scheduling environment. The proposed model performs more efficiently and is better able to handle complex and dynamic scheduling environments.
Text information mining is a key step to data-driven automatic/semi-automatic quality management (QM). For Chinese texts, a word segmentation algorithm is necessary for pre-processing since there are no explicit marks to define word boundaries. Because of intrinsic characteristics of QM-related texts, word segmentation algorithms for normal Chinese texts cannot be directly applied. Hence, based on the analysis of QM-related texts, we summarized six features, and proposed a hybrid Chinese word segmentation model by means of integrating transfer learning (TL), bidirectional long-short term memory (Bi-LSTM), multi-head attention (MA), and conditional random field (CRF) to construct the mTL-Bi-LSTM-MA-CRF model, considering insufficient samples of QM-related texts and excessive cutting of idioms. The mTL-Bi-LSTM-MA-CRF model is composed of two steps. Firstly, based on a word embedding space, the Bi-LSTM is introduced for context information learning, and the MA mechanism is selected to allocate attention among subspaces, and then the CRF is used to learn label sequence constraints. Secondly, a modified TL method is put forward for text feature extraction, adaptive layer weights learning, and loss function correction for selective learning. Experimental results show that the proposed model can achieve good word segmentation results with only a relatively small set of samples.
20 April 2022 in International Journal of Human–Computer Interaction
With the intensification of aging, more and more elderly people in China live alone and face the dilemma of less and less communication. However, an intrinsic requirement for the elderly to be accompanied and heard increases the demand for emotional care services. Hence, we focus on emotional care for the elderly and propose the multi-agency bi-objective elderly emotional care routing and scheduling model that considers both the travel and overtime costs of caregivers together with customers’ preferences for caregivers. We expand a single agency service mode to a multi-agency joint service mode to avoid a decline in customer satisfaction due to the fact that the single agency cannot meet all customers’ requirements in time. In addition, we design a merging method of nearby requirement points to save costs, which permits the same caregiver to provide services to customers in close geographic proximity at the same time on the premise that customers are willing to receive emotional care services with others. We add the constraint that every requirement cannot be rejected, ensuring that all requirements will be responded to. The results show that in the multi-agency joint service mode, all requirements are met without rejection. Compared with the single-agency service model, the proposed model can realize higher customer satisfaction at lower cost, which verified that the proposed multi-agency joint service mode can better meet the needs of a large number of elderly persons’ emotional care.