To advance energy conservation and emissions reduction in urban logistics systems, this study focuses on the green vehicle routing problems with time windows (GVRPTWs), which remains underexplored in balancing environmental and service quality objectives. We propose a comprehensive multi-objective optimization framework that addresses this gap by simultaneously minimizing total distribution costs and carbon emissions while maximizing customer satisfaction, quantified based on the vehicle’s arrival time at the customer location. The rationale for adopting this tri-objective formulation lies in its ability to reflect real-world trade-offs between economic efficiency, environmental performance, and service level, which are often considered in isolation in previous studies. To tackle this complex problem, we develop an improved Non-Dominated Sorting Genetic Algorithm III (NSGA-III) that incorporates three key enhancements: (1) an integer-encoded initialization method to enhance solution feasibility, (2) a refined selection strategy utilizing crowding distance to maintain population diversity, and (3) an embedded 2-opt local search operator to prevent premature convergence and avoid local optima. Comprehensive validation experiments using Solomon’s benchmark instances and a real-world case demonstrate that the presented algorithm consistently outperforms several state-of-the-art multi-objective optimization methods across key performance metrics. These results highlight the effectiveness and practical relevance of our approach in advancing energy-efficient, low-emission, and customer-centric urban logistics systems.

In the context of urban distribution, given the complexity of express delivery and the variability of distribution conditions, vehicle routing problems with time-dependent characteristics have received increasing attention. This study incorporates a cross-period travel time estimation method for road segments that accounts for temporal and weather-dependent variations in vehicle speed. Building upon this foundation, this study establishes an multi-objective optimization model for the green vehicle routing problem that systematically incorporates intricate constraints, including time-varing vehicle speed, fuel consumption, carbon emissions, and customer servive time windows. This model aims to achieve three primary objectives: (1) minimizing the fleet size, (2) minimizing the overall delivery expenses, which include fuel consumption and carbon emissions, and (3) maximizing the average customer satisfaction. To solve this model, we develop an improved Non-Dominated Sorting Genetic Algorithm III (INSGA-III). To effectively prevent the algorithm from becoming trapped in local optima, we propose a dual-criteria selection mechanism. Meanwhile, we introduce a destroy-and-repair variable neighborhood search strategy to enhance the algorithm’s optimization capability under complex constraints. Experimental evaluations conducted on Solomon benchmark instances as well as real-world case studies indicate that the proposed INSGA-III algorithm surpasses widely utilized multi-objective optimization methods across all assessed performance metrics. This highlights the significant potential of the presented INSGA-III algorithm for practical applications in urban delivery scenarios, which is closely linked to the sustainable development of cities.

Currently, most images captured by high-pixel devices such as mobile phones, camcorders, and drones are in RGGB format. However, image quality in extremely dark scenes often needs improvement. Traditional methods for processing these dark RGGB images typically rely on end-to-end U-Net networks and their enhancement techniques, which require substantial resources and processing time. To tackle this issue, we first converted RGGB images into RGB three-channel images by subtracting the black level and applying linear interpolation. During the training stage, we leveraged the computational efficiency of the state-space model (SSM) and developed a Mamba U-Net end-to-end model to enhance the restoration of extremely dark RGGB images. We utilized the see-in-the-dark (SID) dataset for training, assessing the effectiveness of our approach. Experimental results indicate that our method significantly reduces resource consumption compared to existing single-step training and prior multi-step training techniques, while achieving improved peak signal-to-noise ratio (PSNR) and structural similarity (SSIM) outcomes.

To address the challenge of poor separation performance exhibited by conventional magnetic separation equipment when processing coarse-grained, low-grade magnetite ore, this paper proposes a novel ore recognition method that integrates empirical mode decomposition (EMD) with a convolutional neural network (CNN). First, the original signal undergoes standardization to suppress sensor baseline drift. Then, it is decomposed by using EMD to obtain a series of intrinsic mode functions (IMFs). Subsequently, based on scaling exponents and kurtosis values, IMFs containing significant feature information are selected and fused, resulting in a reconstructed signal with substantially reduced noise. To preserve effective features, the absolute values of the reconstructed signal are taken, followed by normalization and dimensional transformation to convert it into a two-dimensional matrix format, thereby constructing training, validation, and test sets. Finally, a CNN is designed and optimized to automatically extract discriminative features from the preprocessed samples, enabling accurate classification of magnetite ore grades. Experimental results demonstrate that the proposed comprehensive identification method achieves effective and stable classification performance across different ore grades. Specifically, the implementation of standardization and EMD-based denoising has been demonstrated to enhance the accuracy of CNNs in recognizing diverse ores.