Search Results (1,358)

This research presents a comprehensive framework for optimizing Electric Vehicle (EV) charging infrastructure along the Lake Michigan circuit (LMC) in Michigan to support ecotourism, considering both slow charging at destinations and fast charging along the corridor. The framework identifies the optimum location and number of Level 2 chargers and Direct Current Fast Chargers (DCFC), using heuristic algorithms. The study evaluates infrastructure planning based on four key objectives: (1) minimizing overall charging infrastructure costs, (2) reducing grid network upgrade costs, (3) providing an acceptable level of service to long-distance travelers using DCFCs by minimizing queuing delays and deviations from their intended routes, and (4) minimizing unserved charging demand at Level 2 chargers, which reduces redirection to DCFC and consequently mitigates battery degradation. The integration of Level 2 and DCFC networks facilitates strategic investment by effectively managing charging demand, allowing unserved Level 2 demand to be accommodated at DCFC stations while adhering to budgetary constraints. The results show that increasing the budget from $15 to $20 million reduces user inconvenience by 47%, while a further increase to $25 million yields an additional 18% reduction. Additionally, increasing users’ value of time from $13 to $36 per hour results in a 50% reduction in average queuing time. Full article

Blind and visually impaired individuals face persistent challenges when navigating unfamiliar environments, where unseen obstacles compromise their safety and independence. Although many electronic travel aids have been proposed, most remain impractical for daily use—they often rely on bulky or costly hardware, require external processing, or provide unintuitive feedback. This work presents a wearable stereo-vision-based vibrotactile system for real-time obstacle detection and navigation assistance. The device combines an off-the-shelf stereo camera integrated with a simultaneous localization and mapping framework to perceive spatial geometry and detect obstacles in the user’s path. Two stereo-matching methods were implemented to estimate depth: a block-based algorithm optimized for low-latency performance and a semi-global approach providing denser depth maps. Detected obstacles are translated into distinct vibration patterns delivered through four skin-contact body-mounted actuators encoding both direction and distance. The system was evaluated with blindfolded sighted, visually impaired, and blind participants. Both stereo approaches supported reliable real-time guidance and high obstacle-avoidance rates, demonstrating robust performance on affordable, wearable hardware. These findings confirm the feasibility of real-time tactile guidance using commercially available components, marking a concrete step toward accessible navigation support that enhances safety and autonomy for blind and visually impaired individuals. Full article

Traffic signal control at urban intersections is one of the key determinants of the overall efficiency of the transportation system, given its direct impact on travel time, congestion levels, and emissions of exhaust fumes. This study proposes an integrated hybrid model that combines a metaheuristic Genetic Algorithm for generating potential signal timing plans with fuzzy multi-criteria decision-making (MCDM) for their evaluation and selection of the optimal solution. In order to determine the relative importance of criteria, the fuzzy methods F-AHP, F-FUCOM, and F-PIPRECIA were employed, thus providing stable assessments of criteria importance under conditions of uncertainty and expert subjectivity. The ranking of generated alternatives was performed by employing the F-TOPSIS, F-WASPAS, and F-ARAS methods, while the robust decision-making rule approach was employed to develop a robust decision-making rule by integrating multiple MCDM methods. The proposed model was tested using data collected from a real urban intersection. The results show that the integrated hybrid approach enables a significantly more reliable selection of the optimal signal timing plan and achieves higher traffic management efficiency compared to traditional methods. The proposed model provides a flexible and scalable framework that can be adapted to different types of intersections and traffic demand conditions, thereby significantly contributing to the development of modern intelligent traffic management systems. Full article

The Traveling Salesman Problem (TSP) is a fundamental challenge in combinatorial optimization, with wide-ranging applications in logistics, manufacturing, and network design. In addition to the classical formulation, recent years have witnessed the emergence of complex variants, such as the TSP with Drones (TSP-D), TSP with Time Windows, and Prize-Collecting TSP, that incorporate novel constraints reflecting real-world requirements like last-mile delivery and multimodal logistics. This review presents a comprehensive survey of metaheuristic approaches for solving both the classical TSP and its emerging extensions, with particular emphasis on metaheuristic, hybrid methods, and machine learning-enhanced strategies. Recent algorithmic developments, benchmark datasets, and evaluation metrics are investigated, and critical challenges in addressing drone coordination, synchronization, and uncertainty are identified, as well. Bibliometric analysis is further provided to map research trends and the evolution of the field. By synthesizing foundational techniques and state-of-the-art innovations, this review outlines current progress and proposes future directions for metaheuristic optimization in increasingly dynamic and heterogeneous routing scenarios. Full article

To reduce charging time and improve operational efficiency at integrated energy stations (IESs) for electric vehicles (EVs), this paper develops a sustainability-oriented collaborative optimization model by coupling vehicle routing behavior with charging decision-making. Firstly, a dynamic road network model is established to simulate vehicle arrivals at IESs from different network nodes. Then, considering grid peak–valley electricity prices, station electricity procurement costs and EV charging demand, a dynamic pricing strategy for IESs is proposed to guide EVs to charge at off-peak hours so as to realize peak shaving and valley filling for the power grid. Meanwhile, the NSGA-III algorithm is improved through the introduction of Good Point Set initialization and an adaptive crossover mechanism, and the Good Point Set initialization and Adaptive Crossover NSGA-III (GPS-AC-NSGA-III) algorithm is proposed to solve the scheduling optimization problem. Finally, the CRITIC-based TOPSIS method is employed to identify the optimal compromise solution from the Pareto-optimal set. Case studies further prove the effectiveness of the proposed multi-objective collaborative optimization model for EVs and IESs. Compared with scenarios without dynamic Dijkstra-based navigation and dynamic pricing, the IES daily revenue increased by 39.83%, pollutant emissions decreased by 0.4%, and the peak-to-valley load difference ratio was reduced by 4.94%. The results indicate that dynamic Dijkstra-based vehicle routing improves travel efficiency, while the proposed dynamic pricing strategy enhances station profitability and smooths grid load fluctuations. Overall, the proposed framework contributes to sustainable transportation and energy systems by reducing pollutant emissions, improving energy efficiency, and enhancing the operational stability of integrated energy infrastructure, thereby supporting the transition toward low-carbon and sustainable urban energy systems. Full article

To develop a refined traffic diversion scheme for expressway reconstruction and expansion, this study establishes generalized link impedance functions for cars and trucks, considering their differences in road travel time, time value, and toll costs. Subsequently, a traffic diversion model is constructed based on user equilibrium theory, taking the heterogeneity between cars and trucks into consideration. A path-based solution algorithm using the method of successive averages is designed to solve the model. To evaluate the environmental impact of the traffic diversion, a vehicle exhaust emission (including CO₂, CO, HC, and NO_x) estimation method based on the COPERT model is proposed. The results of a case study show that the optimized traffic diversion scheme significantly reduces the average V/C ratio while increasing the average velocity of both cars and trucks on the reconstructed links, without substantially compromising the traffic efficiency of other links. Additionally, the diversion scheme reduces the exhaust pollutant emissions, but increases the CO₂ emissions within the network. The findings justify the effectiveness of the traffic diversion approach on alleviating the traffic congestion on the reconstructed expressway and its mixed impacts on the environment. Full article

Nature-inspired metaheuristic algorithms are commonly applied to complex combinatorial optimization problems where exact methods are computationally impractical. Tourist route optimization is a representative multi-objective problem characterized by realistic constraints such as travel time, cost, opening hours, and transportation modes. Although Mushroom Reproduction Optimization is computationally efficient, it often experiences premature convergence in complex search spaces. This paper proposes a novel hybrid algorithm, Mushroom–Weed Hybrid Reproduction Optimization (MWHRO), which integrates the colony-based local search of the Mushroom Reproduction algorithm with the fitness-proportional reproduction and competitive elimination mechanisms of Invasive Weed Optimization. Hybridization enhances population diversity and global exploration while preserving fast convergence. The proposed algorithm is evaluated based on a realistic tourist route optimization problem using real-world data from Zagreb, Croatia, across multiple transportation modes and objective-weight scenarios. Performance is compared against Ant Colony Optimization, Invasive Weed Optimization, Particle Swarm Optimization, and standard Mushroom Reproduction Optimization under equal evaluation budgets. Experimental results demonstrate that the proposed MWHRO algorithm consistently achieves high-quality solutions with significantly lower execution times, particularly in constrained and multimodal scenarios. Statistical analysis confirms the robustness and practical suitability of the proposed approach for real-world route optimization. Full article

This study investigates the multi-criteria route optimization problem within complex urban expressway networks. The primary objective is to develop and evaluate a novel pathfinding approach by integrating a cost function weighted by the Delphi-Analytic Hierarchy Process (AHP) into the A* algorithm, thereby dynamically balancing operational efficiency and public safety. By employing the Delphi Technique with a panel of 17 experts, a specialized cost function was derived that incorporates twelve critical parameters, including traffic fluidity, population density, and chemical dispersion metrics modeled via Areal Location of Hazardous Atmosphere (ALOHA) This research applied the proposed model to a high-stakes Hazardous Material (HAZMAT) emergency response scenario to benchmark its performance against established baselines, specifically Dijkstra’s algorithm and Ant Colony Optimization (ACO). Simulation results demonstrate that the Delphi-weighted A* algorithm achieves an approximately 3.8% reduction in travel time relative to Dijkstra’s algorithm while enhancing expert-validated safety scores (a weighted metric of risk factors including population density and chemical dispersion) by approximately 8.6%. These findings provide a robust framework for algorithmic decision-support in time-critical logistics and infrastructure management. While numerically modest, these improvements are critical in HAZMAT scenarios, where even marginal time savings directly support the ‘Golden Hour’ principle and minor route adjustments can prevent catastrophic secondary exposure. Full article

In automated garment-cutting systems, idle-travel path planning becomes computationally expensive when the number of cutting pieces reaches medium-to-large scales (80–150 nodes), directly affecting production efficiency. To address the limitations of traditional heuristic methods in solution quality and runtime stability, this study proposes a cluster-based local search framework integrating K-means clustering with a Cluster-Aware Constrained Lin–Kernighan (CAC-LK) algorithm. K-means partitions entry points into compact spatial clusters to reduce the computational scale, and an adaptive depth-constrained CAC-LK procedure optimizes intra-cluster paths while maintaining a predictable runtime. Inter-cluster routes are connected using a nearest-neighbor strategy. Experiments on simulated datasets with 85 and 140 nodes show that the proposed method reduces the idle-travel distance by 4–10% compared with K-means + 3-opt while achieving a more stable runtime than unconstrained K-means + LK. The results demonstrate that the proposed framework provides an effective balance between path quality, scalability, and computational stability, showing strong applicability for real-time intelligent garment-cutting systems. Full article

The tourism industry faces increasing pressure for agile, personalized services, yet travel agencies struggle with fragmented knowledge scattered across isolated systems and legacy formats. While Large Language Models (LLMs) are widely applied in customer-facing roles, their potential to enhance internal operational efficiency remains largely underexplored. This study presents the design and evaluation of an intelligent assistant specifically for travel agency operations, built upon a Retrieval-Augmented Generation (RAG) architecture using Gemini 2.0 Flash. The system integrates heterogeneous data sources, including structured product catalogs and unstructured documentation processed via Optical Character Recognition (OCR), into a unified interface comprising work assistance, interactive training, and evaluation modules. Results demonstrate information retrieval times not greater than 45 s, ensuring its daily usability, while maintaining 95% accuracy. Furthermore, the system democratizes tacit senior expertise and accelerates new employee onboarding. This research validates RAG architectures as a powerful solution to knowledge fragmentation, shifting the strategic AI focus from customer automation to employee empowerment and operational optimization. Full article

Shared autonomous vehicle (SAV) services are gaining attention as an innovative urban transportation paradigm due to their potential to lower travel costs and improve operational efficiency. Unlike manually operated vehicles, SAVs exhibit unique behavioral dynamics, including safe passenger pick-up and drop-off processes, as well as strategic repositioning and autonomous parking to anticipate future travel demands. Consequently, effective and dynamic route planning is paramount to optimizing SAV safety and operational efficiency. This study proposes a novel traffic information, termed Autonomous Driving Stress (ADS), designed to enhance the safety and efficiency of SAV route planning by quantitatively capturing the level of driving challenge encountered during autonomous operation. To predict ADS, a machine learning framework was developed, utilizing microscopic traffic simulation data that incorporates a comprehensive set of 22 input features describing SAV driving behavior, roadway characteristics, and prevailing traffic conditions. Among five machine learning algorithms evaluated, Random Forest exhibited superior predictive performance, achieving an accuracy of 80.9%. The proposed framework enables real-time ADS level prediction by continuously integrating streaming traffic data into the trained model. The dissemination of this real-time ADS information to SAVs supports proactive, informed, and dynamic route planning decisions, thereby enhancing operational safety, traffic flow, and the sustainability of SAV operations within urban mobility systems. Full article

The rapid expansion of e-commerce and on-demand logistics has intensified the need for cost-effective and reliable urban distribution systems. This paper investigates an energy-aware routing problem for electric vehicle fleets operating from multiple depots under time-varying traffic conditions. We propose a novel multi-depot vehicle routing model that jointly incorporates time-dependent travel speeds, simultaneous pickup and delivery operations, and time window constraints. The model explicitly captures key operational realities, including battery capacity limitations, load- and speed-dependent energy consumption, synchronized pickup-delivery requirements, and soft time windows. The objective is to minimize total operational cost by simultaneously optimizing depot assignments, vehicle routes, and service schedules. Given the NP-hard nature of the problem, we develop a two-stage heuristic solution framework. In the first stage, a spatio-temporal clustering strategy is employed to assign customers to depots efficiently. In the second stage, route construction and improvement are performed using an enhanced Adaptive Large Neighborhood Search (ALNS) algorithm equipped with problem-specific destroy and repair operators. Computational experiments on adapted benchmark instances demonstrate that the proposed approach consistently produces high-quality solutions and exhibits robust convergence behavior. In addition, sensitivity analyses provide managerial insights, revealing an optimal range of vehicle energy capacity and an economically efficient speed band that balances travel time and energy consumption. Full article

To address the challenge of autonomous process adaptation in non-standard components with continuously varying groove angles, this study proposes an intelligent decision-making framework based on Response Surface Methodology (RSM) for oscillation welding. Instead of solely identifying a single optimal parameter set, RSM is employed as a knowledge-modeling tool to reveal adaptive relationships between groove geometry and key welding parameters. A Central Composite Design (CCD) is utilized to establish predictive models for weld geometry under varying conditions: wire feed rate (8–12 m/min), travel speed (5–9 mm/s), travel angle (70–110°), oscillation amplitude (2–6 mm), dwell time (0.2–0.6 s), and groove angle (80–100°). The significance and adequacy of the models are validated through analysis of variance (ANOVA), demonstrating high predictive accuracy with all coefficients of determination (R²) exceeding 0.82. Furthermore, defect-aware physical constraints derived from the formation mechanism of bottom humping are incorporated into the optimization process, specifically restricting the travel angle to a push angle of 70–85° to ensure feasible and reliable decision outputs. Based on the established response surfaces, geometry-dependent parameter selection rules are derived to simultaneously optimize root penetration (target 8.5–10.5 mm) and sidewall fusion (>2.5 mm) for groove angles ranging from 80° to 100°. Experimental validation confirms that the proposed decision-making strategy achieves stable bead formation and defect-free fusion, demonstrating high quantitative reliability with root penetration prediction errors below 7% and bead width errors below 13%. This work bridges the gap between geometric perception and process control, providing a practical pathway toward intelligent and adaptive robotic welding of non-standard components. Full article

In practice, the emerging shared electric bicycles battery-swapping systems face weather disturbances and time-window lateness, which can reduce travel efficiency and degrade operational reliability. To facilitate the operation reliability and management robustness, this study builds a scenario-based location–routing optimization model that links station siting with replenishment routing under two weather scenarios, no rain and rain. The first stage selects sites and determines battery-swapping station construction decisions before scenario realization. The second stage reacts through scenario-dependent depot assignment and routing and scheduling decisions. The objective functions are to minimize average cost while restraining tail risk through an explicit worst-case term, yielding an adjustable efficiency–resilience balance. The modeling constraints impose a minimum service level, preserve route feasibility under scenario travel times, and prevent structural shortcuts. An improved genetic algorithm is proposed to solve the model. The algorithm adopts construction encoding and scenario-wise assignment encoding, applies feasibility repair before evaluation, and constructs executable routes during decoding with local improvement. Experiments demonstrate that the proposed method achieves better objective values than benchmark methods and exhibits stable convergence. Case study shows that rain increases transportation and lateness-related costs. The System Resilience Analysis shows that the robust penalty term reduces variable operating loss under rain by 5.33% and cuts the cost shock from no rain to rain by 32.82%, demonstrating improved resilience under adverse weather. Full article

High-speed precision positioning systems require motion profiles that achieve rapid transfer while suppressing motion-induced vibration. Conventional time-optimal trajectories often minimize travel time at the expense of residual vibration, which prolongs settling and degrades positioning accuracy. This paper proposes a systematic framework for designing optimized time-shifted sine motion profiles that explicitly incorporate vibration suppression in the frequency domain. By integrating time-domain profile construction with Laplace-domain analysis, motion profiles are derived in a unified manner from 1^st-order to generalized $n^{\mathrm{th}}$-order forms. A key theoretical result shows that the residual vibration amplitude after motion completion is proportional to the magnitude of $\left|sX\right(s\left)\right|$ evaluated at the system poles, providing a clear analytical basis for a closed-form zero placement strategy. Explicit algebraic design conditions are obtained without iterative numerical optimization. Simulation-based case studies demonstrate that the proposed approach drastically reduces transient and residual vibrations while maintaining competitive motion completion times compared with time-optimal designs. Robustness is quantitatively evaluated using insensitivity and high-frequency roll-off metrics, revealing that increasing the profile order improves uncertainty tolerance by approximately $-20$ dB/decade per order. Furthermore, a short-stroke scenario shows that lower-order sine profiles can be advantageous under moderate uncertainty. The proposed framework provides a practical guideline for vibration-aware high-speed motion control. Full article