Road extraction from high-resolution remote sensing images (HRSIs) provides critical support for downstream tasks such as autonomous driving path planning and urban planning. Although deep learning-based pixel-level segmentation methods have achieved significant progress, they still face challenges in handling occlusions caused by vegetation and shadows, and often exhibit limited model robustness and generalization capability. To address these limitations, this paper proposes the SAM2MS model, which leverages the powerful generalization capabilities of the foundational vision model, segment anything model 2 (SAM2). Firstly, an adapter-based fine-tuning strategy is employed to effectively transfer the capabilities of SAM2 to the HRSI road extraction task. Secondly, we subsequently designed a subtraction block (Sub) to process adjacent feature maps, effectively eliminating redundancy during the decoding phase. Multiple Subs are cascaded to form the multi-scale subtraction module (MSSM), which progressively refines local feature representations, thereby enhancing segmentation accuracy. During training, a training-free lossnet module is introduced, establishing a multi-level supervision strategy that encompasses background suppression, contour refinement, and region-of-interest consistency. Extensive experiments on three large-scale and challenging HRSI road datasets, including DeepGlobe, SpaceNet, and Massachusetts, demonstrate that SAM2MS significantly outperforms baseline methods across nearly all evaluation metrics. Furthermore, cross-dataset transfer experiments (from DeepGlobe to SpaceNet and Massachusetts) conducted without any additional training validate the model’s exceptional generalization capability and robustness.

With the rapid development of intelligent transportation systems and online ride-hailing platforms, the demand for promptly responding to passenger requests while minimizing vehicle idling and travel costs has grown substantially. This paper addresses the challenges of suboptimal vehicle path planning and partially connected pickup stations by formulating the task as a Capacitated Vehicle Routing Problem (CVRP). We propose an Improved Genetic Algorithm (IGA)-based path planning model designed to minimize total travel distance while respecting vehicle capacity constraints. To handle scenarios where certain pickup points are not directly connected, we integrate graph-theoretic techniques to ensure route continuity. The proposed model incorporates a multi-objective fitness function, a rank-based selection strategy with adjusted weights, and Dijkstra-based path estimation to enhance convergence speed and global optimization performance. Experimental evaluations on four benchmark maps from the Carla simulation platform demonstrate that the proposed approach can rapidly generate optimized multi-vehicle path planning solutions and effectively coordinate pickup tasks, achieving significant improvements in both route quality and computational efficiency compared to traditional methods.