New challenges such as automation, connection, electrification, and sharing (ACES) have brought disruptive changes to vehicles, transportation, and mobility services, which urgently requires an ideal solution for sustainable transportation. This paper introduces the Internet as a paradigm and, for the first time, proposes the Transportation Internet (TI), inspired by the similarity between the Internet and transportation. Referring to the construction ideas of the Internet, this paper establishes the framework of TI, proposes the transportation router based on the transportation switching and routing models, and preliminarily forms a large-scale automatic transportation solution. Following the latest technologies of the Internet, this paper further presents the software-defined transportation (SDT) by separating the control plane and transport plane of the transportation router, which can enhance transportation routing and provide Internet-like capabilities such as centralized intelligent control, terminals plug-and-play, and open application ecology. The evaluation of the prototype system shows promising results. The software-defined signals (SDS) can save 36% energy compared to signal machines, and the software-defined vehicles (SDV) automatic driving can save 24% energy compared to manual driving. Overall, TI brings innovations to sustainable transportation, and provides a framework for a new generation of Intelligent Transportation Systems (ITS).

The two-dimensional strip-packing problem (2D-SPP) emerges as a notable variant of the cutting and packing (C&P) problem, aiming to optimize the arrangement of small rectangular items within unique strips with a fixed width and infinite height to minimize the usage of height. Despite extensive academic exploration, applying 2D-SPP solutions in industrial settings remains challenging. Two significant issues, often overlooked in academia yet frequently encountered in industrial contexts, are the uncertain demand for items, exacerbated by the bullwhip effect, and the need for diverse types of strips to cater to varying customer needs. Our paper addresses this academia–industry gap by proposing a robust optimization model for the uncertain 2D-SPP with variable-sized bins, aiming to manage the demand fluctuations within a box uncertainty set framework. Additionally, we employ the contiguous one-dimensional relaxation technique in conjunction with column generation to tighten the lower bound of the problem, thereby augmenting solution accuracy. Furthermore, we leverage the Karush–Kuhn–Tucker (KKT) condition to transform the model into a more tractable form, subsequently leading to an exact solution. Based on datasets from a real-life plastic-cutting company, comprehensive experiments validate the effectiveness and efficiency of our proposed relaxation method and algorithm, showcasing the potential for an improved industrial application of 2D-SPP solutions.

Vehicular Ad Hoc Network (VANET) is an important component of the Internet of Vehicles (IoV), providing a wide range of traffic safety, efficiency, and infotainment applications. These applications pose challenges to onboard computation and energy resources. To address these issues, Vehicle Edge Computing (VEC) has been introduced as a novel computing paradigm. Given the rapid and frequent changes in the topology of VANET networks due to the highspeed movement of vehicles, most VANET applications adopt broadcast communication, except for a few employing unicast communication. However, traditional task offloading models struggle to support broadcast applications. Therefore, this paper proposes a VANET broadcast task model to offload tasks from On-Board Units (OBUs) to Road-Side Units (RSUs) for the first time. To meet the requirement of low latency, an efficient polynomial-time heuristic algorithm is further proposed. Numerical results demonstrate the outstanding performance of the algorithm, with all instances being solved in less than 6ms, which significantly surpasses the performance of existing solvers. Moreover, the solutions obtained from the algorithm exhibit gaps below 1%, indicating their high acceptability and applicability in practical VANET applications. Furthermore, extensive numerical experiments provide valuable insights into the practical implementation of task offloading, suggesting an appropriate ratio of 6 between the number of OBUs and RSUs.

Understanding and predicting the evolution of across complex systems remains a fundamental challenge due to the absence of unified and computationally testable frameworks. Here we propose the Recursive Hierarchical Network(RHN), conceptualizing evolution as recursive encapsulation along a trajectory of node $\to$ module $\to$ system $\to$ new node, governed by gradual accumulation and abrupt transition. Theoretically, we formalize and prove the law of functional evolution, revealing an irreversible progression from structure-dominated to regulation-dominated to intelligence-dominated stages. Empirically, we operationalize functional levels and align life, cosmic, informational, and social systems onto this scale. The resulting trajectories are strictly monotonic and exhibit strong cross-system similarity, with high pairwise cosine similarities and robust stage resonance. We locate current system states and project future transitions. RHN provides a mathematically rigorous, multi-scale framework for reconstructing and predicting system evolution, offering theoretical guidance for designing next-generation intelligent systems.