On the public citation graph

An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes

0 signed · 105 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/s10489-019-01599-xopenalex-snapshot
An efficient strategy for using multifactorial optimization to solve the clustered shortest path tree problem
inferredcites →https://doi.org/10.1007/s42524-021-0178-9openalex-snapshot
A literature review of smart warehouse operations management
inferredcites →https://doi.org/10.1016/j.knosys.2019.05.015openalex-snapshot
New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm
inferredcites →https://doi.org/10.1051/matecconf/201824401015openalex-snapshot
Measurement of industrial robot pose repeatability
inferredcites →https://doi.org/10.1090/dimacs/074/09openalex-snapshot
Single-source shortest paths with the parallel boost graph library
inferredcites →https://doi.org/10.1093/mutage/geu078openalex-snapshot
The shortest path is not the one you know: application of biological network resources in precision oncology research
inferredcites →https://doi.org/10.1109/access.2018.2808407openalex-snapshot
IBAS: Index Based A-Star
inferredcites →https://doi.org/10.1109/access.2019.2908011openalex-snapshot
A Multi-Stage Metaheuristic Algorithm for Shortest Simple Path Problem With Must-Pass Nodes
inferredcites →https://doi.org/10.1109/access.2019.2939423openalex-snapshot
A New Algorithm of the Best Path Selection Based on Machine Learning
inferredcites →https://doi.org/10.1109/access.2019.2948958openalex-snapshot
The Shortest Path Problem and Its Critical Edge in Uncertain Environment
inferredcites →https://doi.org/10.1109/access.2020.2983047openalex-snapshot
Pareto Optimal Path Generation Algorithm in Stochastic Transportation Networks
inferredcites →https://doi.org/10.1109/access.2020.2990912openalex-snapshot
Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm
inferredcites →https://doi.org/10.1109/access.2020.3017132openalex-snapshot
Split Demand One-to-One Pickup and Delivery Problems With the Shortest-Path Transport Along Real-Life Paths
inferredcites →https://doi.org/10.1109/access.2020.3028617openalex-snapshot
Multilayer Interval Type-2 Fuzzy Controller Design for Quadcopter Unmanned Aerial Vehicles Using Jaya Algorithm
inferredcites →https://doi.org/10.1109/access.2021.3053169openalex-snapshot
A New Algorithm Based on Dijkstra for Vehicle Path Planning Considering Intersection Attribute
inferredcites →https://doi.org/10.1109/access.2021.3053295openalex-snapshot
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem
inferredcites →https://doi.org/10.1109/access.2021.3063807openalex-snapshot
Optimal Design and Control of SSSCs for TLs Considering Technical and Economic Indices Using GA and SAMPE-JAYA Algorithms
inferredcites →https://doi.org/10.1109/access.2021.3070054openalex-snapshot
Geometric A-Star Algorithm: An Improved A-Star Algorithm for AGV Path Planning in a Port Environment
inferredcites →https://doi.org/10.1109/access.2021.3102643openalex-snapshot
Electricity Theft Detection With Automatic Labeling and Enhanced RUSBoost Classification Using Differential Evolution and Jaya Algorithm
inferredcites →https://doi.org/10.1109/cc.2018.8398509openalex-snapshot
Improving centralized path calculation based on graph compression
inferredcites →https://doi.org/10.1109/ccdc.2017.7978247openalex-snapshot
Discrete Jaya algorithm for solving flexible job shop rescheduling problem
inferredcites →https://doi.org/10.1109/comst.2023.3246993openalex-snapshot
A Tutorial on Internet of Behaviors: Concept, Architecture, Technology, Applications, and Challenges
inferredcites →https://doi.org/10.1109/icarcv.2016.7838662openalex-snapshot
Discrete Jaya algorithm for flexible job shop scheduling problem with new job insertion
inferredcites →https://doi.org/10.1109/icftic54370.2021.9647205openalex-snapshot
Research on the Shortest Path for Crossing Desert Based on Floyd Algorithm
inferredcites →https://doi.org/10.1109/jas.2021.1003841openalex-snapshot
Boundary Gap Based Reactive Navigation in Unknown Environments
inferredcites →https://doi.org/10.1109/jas.2021.1004252openalex-snapshot
An Adaptive Rapidly-Exploring Random Tree
inferredcites →https://doi.org/10.1109/jestpe.2020.3036405openalex-snapshot
JAYA Algorithm Based on Lévy Flight for Global MPPT Under Partial Shading in Photovoltaic System
inferredcites →https://doi.org/10.1109/jiot.2022.3200964openalex-snapshot
Minority-Weighted Graph Neural Network for Imbalanced Node Classification in Social Networks of Internet of People
inferredcites →https://doi.org/10.1109/jiot.2022.3218780openalex-snapshot
Toward Large-Scale Graph-Based Traffic Forecasting: A Data-Driven Network Partitioning Approach
inferredcites →https://doi.org/10.1109/jsen.2020.3015134openalex-snapshot
Intelligent Hough Transform With Jaya to Detect the Diameter of Red-Hot Circular Workpiece
inferredcites →https://doi.org/10.1109/rteict52294.2021.9573832openalex-snapshot
Analysis of high speed design on a multilayer PCB substrate
inferredcites →https://doi.org/10.1109/tac.2017.2747409openalex-snapshot
Stochastic Online Shortest Path Routing: The Value of Feedback
inferredcites →https://doi.org/10.1109/tase.2020.3000946openalex-snapshot
Profit-Maximized Collaborative Computation Offloading and Resource Allocation in Distributed Cloud and Edge Computing Systems
inferredcites →https://doi.org/10.1109/tase.2021.3111888openalex-snapshot
Integrated Task Allocation and Path Coordination for Large-Scale Robot Networks With Uncertainties
inferredcites →https://doi.org/10.1109/tase.2023.3236317openalex-snapshot
Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems
inferredcites →https://doi.org/10.1109/tase.2023.3244184openalex-snapshot
A Novel Deep-Learning-Based QoS Prediction Model for Service Recommendation Utilizing Multi-Stage Multi-Scale Feature Fusion With Individual Evaluations
inferredcites →https://doi.org/10.1109/tc.2014.2366762openalex-snapshot
Finding Multi-Constrained Multiple Shortest Paths
inferredcites →https://doi.org/10.1109/tcns.2021.3117231openalex-snapshot
Opinion Shaping in Social Networks Using Reinforcement Learning
inferredcites →https://doi.org/10.1109/tcsii.2015.2505998openalex-snapshot
An FPGA Implementation for Solving the Large Single-Source-Shortest-Path Problem
inferredcites →https://doi.org/10.1109/tcss.2020.3033302openalex-snapshot
Aspect-Based Sentiment Analysis: A Survey of Deep Learning Methods
inferredcites →https://doi.org/10.1109/tcss.2023.3238042openalex-snapshot
Detecting k-Vertex Cuts in Sparse Networks via a Fast Local Search Approach
inferredcites →https://doi.org/10.1109/tcyb.2014.2371918openalex-snapshot
Colored Traveling Salesman Problem
inferredcites →https://doi.org/10.1109/tcyb.2018.2817240openalex-snapshot
Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm
inferredcites →https://doi.org/10.1109/tcyb.2022.3159367openalex-snapshot
Distributed and Time-Delayed -Winner-Take-All Network for Competitive Coordination of Multiple Robots
inferredcites →https://doi.org/10.1109/tie.2020.2978701openalex-snapshot
An Efficient RRT-Based Framework for Planning Short and Smooth Wheeled Robot Motion Under Kinodynamic Constraints
inferredcites →https://doi.org/10.1109/tii.2018.2844370openalex-snapshot
Shortest Path Planning for Energy-Constrained Mobile Platforms Navigating on Uneven Terrains
inferredcites →https://doi.org/10.1109/tits.2013.2270282openalex-snapshot
Shortest Path Finding Problem in Stochastic Time-Dependent Road Networks With Stochastic First-In-First-Out Property
inferredcites →https://doi.org/10.1109/tits.2017.2781138openalex-snapshot
MPTR: A Maximal-Marginal-Relevance-Based Personalized Trip Recommendation Method
inferredcites →https://doi.org/10.1109/tits.2018.2873790openalex-snapshot
Solving Traffic Signal Scheduling Problems in Heterogeneous Traffic Network by Using Meta-Heuristics
inferredcites →https://doi.org/10.1109/tits.2019.2892377openalex-snapshot
Non-Dominated Immune-Endocrine Short Feedback Algorithm for Multi-Robot Maritime Patrolling
inferredcites →https://doi.org/10.1109/tits.2019.2913998openalex-snapshot
A Review of Motion Planning for Highway Autonomous Driving
inferredcites →https://doi.org/10.1109/tits.2020.2972389openalex-snapshot
Delaunay-Triangulation-Based Variable Neighborhood Search to Solve Large-Scale General Colored Traveling Salesman Problems
inferredcites →https://doi.org/10.1109/tits.2020.3023695openalex-snapshot
Enabling the Wireless Charging via Bus Network: Route Scheduling for Electric Vehicles
inferredcites →https://doi.org/10.1109/tits.2021.3052834openalex-snapshot
A Pairwise Proximity Learning-Based Ant Colony Algorithm for Dynamic Vehicle Routing Problems
inferredcites →https://doi.org/10.1109/tits.2021.3086625openalex-snapshot
Bi-Objective Colored Traveling Salesman Problems
inferredcites →https://doi.org/10.1109/tits.2022.3147924openalex-snapshot
Multi-Neighborhood Simulated Annealing-Based Iterated Local Search for Colored Traveling Salesman Problems
inferredcites →https://doi.org/10.1109/tits.2022.3180288openalex-snapshot
Joint Deployment Optimization and Flight Trajectory Planning for UAV Assisted IoT Data Collection: A Bilevel Optimization Approach
inferredcites →https://doi.org/10.1109/tits.2023.3237570openalex-snapshot
PSO-Based Sparse Source Location in Large-Scale Environments With a UAV Swarm
inferredcites →https://doi.org/10.1109/tits.2023.3249403openalex-snapshot
Electric Vehicle Routing Problem With Variable Vehicle Speed and Soft Time Windows for Perishable Product Delivery
inferredcites →https://doi.org/10.1109/tkde.2017.2773492openalex-snapshot
Finding Top-k Shortest Paths with Diversity
inferredcites →https://doi.org/10.1109/tkde.2017.2777851openalex-snapshot
To Meet or Not to Meet: Finding the Shortest Paths in Road Networks
inferredcites →https://doi.org/10.1109/tkde.2022.3220789openalex-snapshot
Dual Feature Interaction-Based Graph Convolutional Network
inferredcites →https://doi.org/10.1109/tmech.2013.2252076openalex-snapshot
An $\bm{O(n\log n)}$ Shortest Path Algorithm Based on Delaunay Triangulation
inferredcites →https://doi.org/10.1109/tnet.2019.2955451openalex-snapshot
Bisection and Exact Algorithms Based on the Lagrangian Dual for a Single-Constrained Shortest Path Problem
inferredcites →https://doi.org/10.1109/tnnls.2013.2293775openalex-snapshot
A Minimum Resource Neural Network Framework for Solving Multiconstraint Shortest Path Problems
inferredcites →https://doi.org/10.1109/tnnls.2021.3105905openalex-snapshot
Solving Dynamic Traveling Salesman Problems With Deep Reinforcement Learning
inferredcites →https://doi.org/10.1109/tnsm.2018.2865204openalex-snapshot
A Constrained Shortest Path Scheme for Virtual Network Service Management
inferredcites →https://doi.org/10.1109/tqe.2020.3031085openalex-snapshot
Solving the Max-Flow Problem on a Quantum Annealing Computer
inferredcites →https://doi.org/10.1109/tro.2013.2240176openalex-snapshot
C-FOREST: Parallel Shortest Path Planning With Superlinear Speedup
inferredcites →https://doi.org/10.1109/tsmc.2016.2560418openalex-snapshot
An Exact Algorithm for the Shortest Path Problem With Position-Based Learning Effects
inferredcites →https://doi.org/10.1109/tsmc.2016.2573271openalex-snapshot
A Multiobjective Path-Planning Algorithm With Time Windows for Asset Routing in a Dynamic Weather-Impacted Environment
inferredcites →https://doi.org/10.1109/tsmc.2016.2591267openalex-snapshot
Population-Based Incremental Learning Algorithm for a Serial Colored Traveling Salesman Problem
inferredcites →https://doi.org/10.1109/tsmc.2022.3220524openalex-snapshot
Multirobot Cooperative Patrolling Strategy for Moving Objects
inferredcites →https://doi.org/10.1109/tsmcb.2005.850141openalex-snapshot
Modeling and deadlock avoidance of automated manufacturing systems with multiple automated guided vehicles
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1109/tvt.2022.3225666openalex-snapshot
Knowledge Graph Aided Network Representation and Routing Algorithm for LEO Satellite Networks
inferredcites →https://doi.org/10.1145/3570326openalex-snapshot
Scheduling of Resource Allocation Systems with Timed Petri Nets: A Survey
inferredcites →https://doi.org/10.1145/367766.368168openalex-snapshot
Algorithm 97: Shortest path
inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-snapshot
An Appraisal of Some Shortest-Path Algorithms
inferredcites →https://doi.org/10.1287/trsc.2022.1186openalex-snapshot
Bilevel Memetic Search Approach to the Soft-Clustered Vehicle Routing Problem
inferredcites →https://doi.org/10.17559/tv-20150114112458openalex-snapshot
Solutions to the characteristic equation for industrial robot’s elliptic trajectories
inferredcites →https://doi.org/10.3390/app10238467openalex-snapshot
Design of a Mechanical Part of an Automated Platform for Oblique Manipulation
inferredcites →https://doi.org/10.3390/pr10020380openalex-snapshot
Face Verification Based on Deep Learning for Person Tracking in Hazardous Goods Factories
inferredcites →https://doi.org/10.3390/pr10061213openalex-snapshot
Picking Path Planning Method of Dual Rollers Type Safflower Picking Robot Based on Improved Ant Colony Algorithm
inferredcites →https://doi.org/10.3390/pr10091675openalex-snapshot
Motion Planning of an Inchworm Robot Based on Improved Adaptive PSO
inferredcites →https://doi.org/10.3390/pr10102101openalex-snapshot
Remote Wind Farm Path Planning for Patrol Robot Based on the Hybrid Optimization Algorithm
inferredcites →https://doi.org/10.3390/pr11051561openalex-snapshot
Energy Storage Charging Pile Management Based on Internet of Things Technology for Electric Vehicles
inferredcites →https://doi.org/10.3390/pr9111955openalex-snapshot
Road Scene Recognition of Forklift AGV Equipment Based on Deep Learning
inferredcites →https://doi.org/10.3390/pr9122171openalex-snapshot
An Intelligent Optimized Route-Discovery Model for IoT-Based VANETs
inferredcites →https://doi.org/10.3390/s22010011openalex-snapshot
Personalized Route Planning System Based on Driver Preference
inferredcites →https://doi.org/10.5267/j.ijiec.2015.8.004openalex-snapshot
Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s11053-025-10455-4openalex-snapshot
Measuring and Predicting Blast-Induced Flyrock Using Unmanned Aerial Vehicles and Lévy Flight Technique-Based Jaya Optimization Algorithm Integrated with Adaptive Neuro-Fuzzy Inference System
inferred← citeshttps://doi.org/10.1016/j.cie.2024.110663openalex-snapshot
Optimizing long-term carpooling with fairness: A collaborative Jaya algorithm
inferred← citeshttps://doi.org/10.1016/j.energy.2025.137593openalex-snapshot
A Jaya-driven quasi-predictive optimization strategy with adaptive window scheduling for EV thermal management
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.125466openalex-snapshot
Sustainable optimization of balancing valve settings in urban heating systems with an enhanced Jaya algorithm
inferred← citeshttps://doi.org/10.1108/imds-04-2025-0456openalex-snapshot
An efficient MINLP approach for designing hydrogen logistics networks considering hybrid energy sources
inferred← citeshttps://doi.org/10.1109/taes.2024.3429302openalex-snapshot
Memetic Multiobjective Discrete Jaya Algorithm for Cooperative Scheduling of Multiple Agile Earth Observation Satellites
inferred← citeshttps://doi.org/10.1109/tvt.2024.3454101openalex-snapshot
A Bin-Packing-Based Method for Path Planning of Air–Ground Cooperative System
inferred← citeshttps://doi.org/10.2139/ssrn.5642422openalex-snapshot
Shortest Path Analysis of Urban Road Networks Using Dijkstra’s Algorithm: A Case Study of Pabna-Sadar, Bangladesh
inferred← citeshttps://doi.org/10.3233/atde241207openalex-snapshot
AMaze: Non-Stop Source to Destination Optimal Vehicle Scheduling
inferred← citeshttps://doi.org/10.3390/app15084162openalex-snapshot
Optimal Routing in Urban Road Networks: A Graph-Based Approach Using Dijkstra’s Algorithm
inferred← citeshttps://doi.org/10.3390/engproc2025100031openalex-snapshot
A Performance Comparison of Shortest Path Algorithms in Directed Graphs
inferred← citeshttps://doi.org/10.3390/engproc2026150078openalex-snapshot
Implementation and Evaluation of the Shortest-Path Algorithm for GIS Network Routing
inferred← citeshttps://doi.org/10.3390/math12192995openalex-snapshot
Generalized Shortest Path Problem: An Innovative Approach for Non-Additive Problems in Conditional Weighted Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.