Search Results (89)

Urban freight generates a disproportionate share of urban externalities, yet the large-scale integration of eco-friendly vehicles (EFVs) remains limited. Barriers include high capital costs, inadequate charging/refuelling infrastructure, and fragmented governance frameworks. This article examines how regulatory structures and stakeholder alignment shape EFV adoption in Rome, analysing two pilot solutions: (i) a shared hub for electric and hydrogen freight vehicles, and (ii) a cargo-bike programme combining service-trip separation with reverse logistics. The methodological approach integrates a structured review of recent scholarship—organised in line with PRISMA guidance and enriched with bibliometric analysis—with empirical insights from five Living Lab workshops involving logistics providers, energy firms, technology suppliers, and industry associations. The findings highlight that progress depends less on technological capability than on policy mixes matched to stakeholder incentives. For the hub, decisive factors include siting, governance, and scale, while for cargo-bikes, reliability of dispatch, remuneration models, and certified training are critical. The study concludes that Rome’s path to freight decarbonisation requires regulatory and financial packages continuously tailored to actors’ operational priorities and behavioural responses. Full article

As the intelligent transformation of manufacturing accelerates, Unmanned Aerial Vehicles are increasingly being deployed for workshop operations, making efficient obstacle avoidance path planning a critical requirement. This paper introduces a parameter-optimized path planning method for the Unmanned Aerial Vehicle, termed the Artificial Potential Field A* algorithm, which enhances the standard A* approach through the integration of an artificial potential field and a variable step size strategy. The variable step size mechanism allows dynamic adjustment of the search step size, while potential field values from the artificial potential field are embedded into the cost function to improve planning accuracy. Key parameters of the hybrid algorithm are subsequently optimized using response surface methodology, with a regression model built to analyze parameter interactions and determine the optimal configuration. Simulation results across multiple performance indicators confirm that the proposed Artificial Potential Field A* algorithm delivers superior outcomes in path length, attitude angle variation, and flight altitude stability. This approach provides an effective solution for enhancing Unmanned Aerial Vehicle operational efficiency in production workshops. Full article

This study tackles the complex challenge of dynamic multi-objective vehicle routing optimization in large-scale equipment manufacturing, where routing operations significantly impact both economic performance and environmental sustainability. We develop an innovative Dynamic Multi-Objective Vehicle Routing Problem (DMOVRP) model that uniquely integrates three competing objectives: environmental impact reduction, delivery timeliness, and operational robustness. The proposed algorithm combines a dynamic event handler with the NSACOWDRL algorithm—an adaptive multi-objective optimization algorithm with dynamic event handling capability. The proposed system features adaptive mechanisms for handling real-time disruptions through specialized event classification and dynamic rescheduling protocols. Extensive computational experiments demonstrate the algorithm’s superior performance with statistically significant improvements using the Wilcoxon signed-rank test (p < 0.05, n = 30 runs per instance), achieving average relative gains of 15.2% in HV, 12.8% in IGD, and 8.9% in GD metrics compared to established methods. This research makes theoretical contributions through its feasibility quantification metric and practical advancements in routing schedule systems. By successfully reconciling traditionally conflicting objectives through dynamic JIT adjustments and robustness-aware optimization, this work provides manufacturers with a versatile decision-support tool that adapts to unpredictable workshop conditions while maintaining sustainable operations. Full article

Establishing secure vehicular communication is essential for the development of autonomous driving capabilities and to make new functionalities possible, such as smart traffic management, or systems aimed at avoiding or mitigating traffic accidents. In this scenario, where the deployment of a Public Key Infrastructure (PKI) may be difficult, the use of identity-based cryptography is proposed as a good alternative, because this approach simplifies encryption by enabling dynamic key generation and secure communication, without requiring prior key exchanges, making it highly scalable and efficient. In this way, this paper proposes a communication protocol applicable to V2V (vehicle-to-vehicle) and V2X (vehicle-to-all) communications, replacing schemes based on PKI with identity-based cryptographic schemes using the VIN (Vehicle Identification Number) as an unequivocal vehicle identifier. This paper also describes a prototype implementation in a conventional vehicle and the performance metrics of the system. Through a defined proof of concept, we obtained various quantitative results, demonstrating the importance of the processors used for the encryption and decryption operations required. The proposed system provides secure and flexible vehicle identification, with multiple practical applications. It can enables digital authentication, support toll payments without extra hardware, and facilitate V2X communication via the VIN for improved traffic management and safety. Additionally, it can streamline processes in repair workshops and optimize fuel payment and tracking at service stations. Full article

In current intelligent manufacturing workshops, multi-automated guided vehicle (AGV) systems often face issues such as uneven task allocation, path conflicts, and idle travel, which significantly affect scheduling efficiency. To address these problems, this paper proposes an improved ant colony algorithm that collaboratively optimizes task allocation and path planning by integrating path costs and AGV task execution capabilities. The algorithm utilizes shortest-path planning results to optimize task allocation priorities, achieving synchronized optimization of task scheduling and path planning. Based on this, a multi-objective scheduling model is constructed with the goal of minimizing task completion time, idle travel distance, and total travel distance. The results show that the method effectively shortens task completion time and significantly improves scheduling efficiency, verifying its feasibility for application in intelligent manufacturing workshops. Full article

Power batteries are one of the important components of electric vehicles, but the manufacturing process of vehicle power batteries is complex and diverse. Traditional scheduling methods face challenges such as low production efficiency and inadequate quality control in complex production environments. To address these issues, a multi-objective optimization model with makespan, total machine load, and processing quality as the established objectives, and a Multi-objective Particle Swarm Energy Valley Optimization (MPSEVO) is proposed to solve the problem. MPSEVO integrates the advantages of Multi-objective Particle Swarm Optimization (MOPSO) and Energy Valley Optimization (EVO). In this algorithm, the particle stability level is combined in MOPSO, and different update strategies are used for particles of different stability to enhance both the convergence and diversity of the solutions. Furthermore, a local search strategy is designed to further enhance the algorithm to avoid the local optimal solutions. The Hypervolume ($HV$) and Inverted Generational Distance ($IGD$) indicators are often used to evaluate the convergence and diversity of multi-objective algorithms. The experimental results show that MPSEVO’s $HV$ and $IGD$ indicators are better than other algorithms in 10 computational experiments, which verifies the effectiveness of the proposed strategy and algorithm. The proposed method is also applied to solve the actual battery workshop scheduling problem. Compared with MOPSO, MPSEVO reduces the total machine load by 7 units and the defect rate by 0.05%. In addition, the effectiveness of each part of the improved algorithm was analyzed by ablation experiments. This paper provides some ideas for improving the solution performance of MOPSO, and also provides a theoretical reference for enhancing the production efficiency of the vehicle power battery manufacturing workshop. Full article

As the global manufacturing industry’s transformation accelerates toward being intelligent, “unmanned”, and low-carbon, manufacturing workshops face conflicts between production schedules and transportation tasks, leading to low efficiency and resource waste. This paper presents a multi-agent collaborative scheduling optimization method based on a hybrid game–genetic framework to address issues like high AGV (Automated Guided Vehicle) idle rates, excessive energy consumption, and uncoordinated equipment scheduling. The method establishes a trinity system integrating distributed decision-making, dynamic coordination, and environment awareness. In this system, the multi-agent decision-making and collaboration process exhibits significant symmetry characteristics. All agents (machine agents, mobile agents, etc.) follow unified optimization criteria and interaction rules, forming a dynamically balanced symmetric scheduling framework in resource competition and collaboration, which ensures fairness and consistency among different agents in task allocation, path planning, and other links. An improved best-response dynamic algorithm is employed in the decision-making layer to solve the multi-agent Nash equilibrium, while the genetic optimization layer enhances the global search capability by encoding scheduling schemes and adjusting crossover/mutation probabilities using dynamic competition factors. The coordination pivot layer updates constraints in real time based on environmental sensing, forming a closed-loop optimization mechanism. Experimental results show that, compared with the traditional genetic algorithm (TGA) and particle swarm optimization (PSO), the proposed method reduces the maximum completion time by 54.5% and 44.4% in simple scenarios and 57.1% in complex scenarios, the AGV idling rate by 68.3% in simple scenarios and 67.5%/77.6% in complex scenarios, and total energy consumption by 15.7%/10.9% in simple scenarios and 25%/18.2% in complex scenarios. This validates the method’s effectiveness in improving resource utilization and energy efficiency, providing a new technical path for intelligent scheduling in manufacturing workshops. Meanwhile, its symmetric multi-agent collaborative framework also offers a reference for the application of symmetry in complex manufacturing system optimization. Full article

The Multi-load Automated Guided Vehicle (M-AGV) has emerged as a key enabling technology for intelligent and sustainable workshop logistics owing to its potential to enhance transportation efficiency and reduce system costs. To address the limitations in energy optimization caused by simplified AGV speed and payload modeling in existing scheduling models, this study develops a multi-factor coupled energy consumption model—integrating vehicle speed, travel distance, and dynamic payload—to minimize the total energy consumption of M-AGV systems. To effectively solve the model, a hybrid optimization algorithm that combines the State–Action–Reward–State–Action (SARSA) learning algorithm with the Triangulation Topology Aggregation Optimizer (TTAO), complemented by a similarity-based individual generation strategy, is designed to jointly enhance the algorithm’s exploration and exploitation capabilities. Comparative experiments were conducted across task scenarios involving three different handling task scales and three levels of M-AGV fleet heterogeneity, demonstrating that the proposed SARSA-TTAO algorithm outperforms Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and the Hybrid Genetic Algorithm with Large Neighborhood Search (GA-LNS) in terms of solution accuracy and convergence performance. The study also reveals the differences between homogeneous and heterogeneous M-AGV fleets in task allocation and resource utilization under energy-optimal conditions. Full article

Public transport companies are aware that the success of their operations largely depends on the proper sizing and optimization of their processes. Among the key activities are the maintenance and repair of the vehicle fleet. This paper presents the application of mathematical optimization methods from the field of operations research to improve the efficiency of service workshops for bus maintenance and repair. Based on an analysis of collected data using queueing theory, the authors assessed the current system performance and found that the queueing system still has spare capacity and could be downsized, which aligns with the company’s management goals. Specifically, the company plans to reduce the number of bus repair service stations (servers in a queueing system). The main question is whether the system will continue to function effectively after this reduction. Three specific downsizing solutions were proposed and evaluated using queueing theory methods: extending the daily operating hours of the workshops, reducing the number of arriving buses, and increasing the productivity of a service station (server). The results show that, under high system load, only those solutions that increase the productivity of individual service stations (servers) in the queueing system provide optimal outcomes. Other solutions merely result in longer queues and associated losses due to buses waiting for service, preventing them from performing their intended function and causing financial loss to the company. Full article

Application development for the cyber-physical systems (CPS) domain is considered a quite complex procedure, since it not only requires a high level of expertise but also deep knowledge of heterogeneous domains. On the other hand, modern low-code solutions and DSLs are developed to offload domain complexity by developing models at a higher level of abstraction. In this work we propose an approach based on multiple high-level domain-specific languages (DSLs) as the vehicle to alleviate the developers from the intricacies of the CPS domain, enabling them to easily design and develop different layers (e.g., device, system or application layers) and aspects (e.g., automation processes, observation or monitoring dashboards) of a CPS. The materialized outcome of our approach is the LocSys platform, which allows the integration of DSLs, the development and management of models, and the development of pipelines of transformations between DSL models in a uniform platform, covering different aspects of complex domains. The efficacy of this approach was evaluated during a workshop that included more than 80 participants, with varying levels of expertise and experience in the field. The workshop documented the usability and acceptance of the study using SUS measurements. Preliminary findings suggest that the multi-DSL approach is highly usable (average SUS score 80.65, A− grade) and has been well received by non-domain experts. These results are promising, as they indicate that the LocSys platform can be successfully implemented to build smart environments with embedded automation processes and monitoring dashboards. Full article

This paper proposes a comprehensive Mixed-Integer Linear Programming (MILP) formulation for the simultaneous scheduling of machines and Automated Guided Vehicles (AGVs) within a partitioned Flexible Manufacturing System (FMS). The main objective is to numerically optimize the simultaneous scheduling of machines and AGVs while considering various workshop layouts and operational constraints. Three different workshop layouts are analyzed, with varying numbers of machines in partitioned workshop areas A and B, to evaluate the performance and effectiveness of the proposed model. The model is tested in multiple scenarios that combine different layouts with varying numbers of workpieces, followed by an extension to consider dynamic initial conditions in a more generalized MILP framework. Results demonstrate that the proposed MILP formulation efficiently generates globally optimal solutions and consistently outperforms a greedy algorithm enhanced by A*-inspired heuristics. Although computationally intensive for large scenarios, the MILP’s optimal results serve as an exact benchmark for evaluating faster heuristic methods. In addition, the study provides practical insight into the integration of AGVs in modern manufacturing systems, paving the way for more flexible and efficient production planning. The findings of this research are expected to contribute to the development of advanced scheduling strategies in automated manufacturing systems. Full article

In order to address the Distributed Displacement Flow Shop Scheduling Problem (DPFSP) with uncertain processing times in real production environments, Plant Simulation is employed to construct a simulation model for the MSRDPFSP. The model conducts quantitative analyses of workshop layout, assembly line design, worker status, operating status of robotic arms and AGV vehicles, and production system failure rates. A hybrid NEH-DDQN algorithm is integrated into the simulation model via a COM interface and DLL, where the NEH algorithm ensures the model maintains optimal performance during the early training phase. Four scheduling strategies are designed for workpiece allocation across different workshops. A deep neural network replaces the traditional Q-table for greedy selection among these four scheduling strategies, using each workshop’s completion time as a simplified state variable. This approach reduces algorithm training complexity by abstracting away intricate workpiece allocation details. Experimental comparisons show that for the data of 500 workpieces, the NEH algorithm in 3 s demonstrates equivalent quality to that produced by the GA algorithm in 300 s. After 2000 iterations, the DDQN algorithm achieves a 15% reduction in makespan with only a 2.5% increase in computational time compared to random search, this joint simulation system offers an efficient and stable solution for the modeling and optimization of the MSRDPFSP issue. Full article

China’s leading development of a complete battery value chain for electric vehicles (EVs) is restructuring the global automotive sector. In contrast with the normal point of view, which emphasizes the role of industrial policy, this article argues that the competitive advantage of China’s EV battery industry lies in firms’ core competency and political economic geography. Based on first-hand empirical material and data obtained from years of fieldwork carried out at an EV battery cluster in south China, this paper identifies the Chinese EV battery industry’s core competency and details how it is built up from below. The current core competency of Chinese battery firms is their mass manufacturing capability, which allows them to supply vehicle manufacturers (OEMs) with lithium-ion batteries of stable and consistent quality at competitive prices. This competency is acquired by firms through technological learning at the workshop level while making use of the experiences they have accumulated while mass producing batteries for consumer electronics sectors. Furthermore, the rapid learning and accumulation of knowledge of battery manufacturing on a large scale is also facilitated by the local industrial cluster environment where firms are embedded. Supported and promoted by local government policies, Chinese EV battery clusters are composed of firms from different segments of a complete battery value chain. The findings have significant implications for battery and car makers in global competition as well as for national and local governments which aim to promote EV battery development. Full article

This paper discusses SESAR’s Auto-Steer Taxi at Airport (ASTAIR) project, which seeks to advance airport ground operations including engine-off taxiing to move towards sustainable airports. The ASTAIR concept integrates human–AI teaming to optimize aircraft movement from gates to runways, with the primary objectives of improving predictability, efficiency, and environmental sustainability at large airports. Building on previous initiatives such as SESAR’s AEON, ASTAIR brings high-level automation to tasks like autonomous taxiing and vehicle routing. The system assists operators by calculating conflict-free routes for vehicles and dynamically adjusting operations based on real-time data. Based on workshops with several stakeholders, we describe the operational challenges involved in implementing ASTAIR, including managing parking stand availability and adapting to unforeseen events. A significant challenge highlighted is the human–automation partnership, where AI plays a supportive role but humans retain control over critical decisions, particularly in cases of system failure. The need for clear and consistent collaboration between AI and human operators is emphasized to ensure safety, efficiency, and improved compliance with take-off schedules, which in turn facilitates in-flight optimization. Full article

The pulsating assembly line is widely used in modern manufacturing, particularly in high-precision industries such as aerospace, where it greatly enhances production efficiency. To achieve overall optimization, both product scheduling and Automated Guided Vehicle (AGV) scheduling must be simultaneously optimized. However, existing research predominantly focuses on product scheduling, with limited attention given to AGV scheduling. This paper proposes an optimized solution for the pulsating assembly line scheduling problem, incorporating multifunctional AGV scheduling. A mathematical model is developed and three AGV selection strategies and three AGV standby strategies are designed to optimize AGV scheduling and control. To improve scheduling efficiency, nine heuristic strategies are introduced, along with the Variable Neighborhood Descent (VND) algorithm as a metaheuristic method for product scheduling. The VND algorithm refines the solution through multiple neighborhood searches, enhancing both the precision and efficiency of product scheduling. Our experimental results demonstrate that the proposed strategies significantly improve the production efficiency of pulsating assembly workshops, reduce AGV scheduling costs, and optimize overall production workflows. This study offers novel methods for intelligent scheduling in pulsating assembly workshops, contributing to the advancement of manufacturing toward “multiple varieties, small batches, and customization”. Full article