Mobile QR Code QR CODE


Nazari M., Oroojlooy A., Takáč M., Snyder L. V., 2018, Reinforcement Learning for Solving the Vehicle Routing Problem, In Proceedings of the 32nd International Conference on Neural Information Processing Systems (NIPS'18), Curran Associates Inc., Red Hook, NY, USA, pp. 9861-9871DOI
Singh A. K., Pamula R., 2021, An Efficient and Intelligent Routing Strategy for Vehicular Delay Tolerant Networks, Wireless Network, Vol. 27, pp. 383-400DOI
Geetha M, Ganesan R., 2021, CEPRAN-Cooperative Energy Efficient and Priority Based Reliable Routing Protocol with Network Coding for WBAN, Wireless Pers Commun, Vol. 117, pp. 3153-3171DOI
Liu D., Cui J., Zhang J., Yang C., Hanzo L., 2021, Deep Reinforcement Learning Aided Packet-Routing for Aeronautical Ad-Hoc Networks Formed by Passenger Planes, IEEE Transactions on Vehicular Technology, Vol. 70, No. 5, pp. 5166-5171DOI
Yao H., Mai T., Jiang C., Kuang L., Guo S., 2019, AI Routers & Network Mind: A Hybrid Machine Learning Paradigm for Packet Routing, IEEE Computational Intelligence Magazine, Vol. 14, No. 4, pp. 21-30DOI
Roig P. J., Alcaraz S., Gilly K., Bernad C., Juiz C., 2022, Arithmetic Framework to Optimize Packet Forwarding among End Devices in Generic Edge Computing Environments, Sensors, Vol. 22, No. 421DOI
Waqas A., Saeed N., Mahmood H., Almutiry M., 2022, Distributed Destination Search Routing for 5G and beyond Networks, Sensors, Vol. 22, No. 472DOI
Alhussein O., et al., 2018, Joint VNF Placement and Multicast Traffic Routing in 5G Core Networks, 2018 IEEE Global Communications Conference (GLOBECOM), pp. 1-6DOI
Celik A., Tetzner J., Sinha K., et al., 2019, 5G Device-To-Device Communication Security and Multipath Routing Solutions, Appl Netw Sci, Vol. 4, No. 102DOI
Feng L, et al., 2021, Explicit Evolutionary Multitasking for Combinatorial Optimization: A Case Study on Capacitated Vehicle Routing Problem, IEEE Transactions on Cybernetics, Vol. 51, No. 6, pp. 3143-3156DOI
Zhang J., Yang F., Weng X., 2019, An Evolutionary Scatter Search Particle Swarm Optimization Algorithm for the Vehicle Routing Problem With Time Windows, IEEE Access, Vol. 6, pp. 63468-63485DOI
Li J., Wang F., He Y., 2020, Electric Vehicle Routing Problem with Battery Swapping Considering Energy Consumption and Carbon Emissions, Sustainability, Vol. 12, No. 10537DOI
Konstantakopoulos G. D., Gayialis S. P., Kechagias E. P., Papadopoulos G. A., Tatsiopoulos I. P. A., 2020, Multiobjective Large Neighborhood Search Metaheuristic for the Vehicle Routing Problem with Time Windows, Algorithms, Vol. 13, No. 243DOI
Ngo T. G., Dao T. K., Thandapani J., Nguyen T. T., Pham D. T., Vu V. D., 2021, Analysis Urban Traffic Vehicle Routing Based on Dijkstra Algorithm Optimization, In: Sharma H., Gupta M. K., Tomar G. S., Lipo W. (eds) Communication and Intelligent Systems. Lecture Notes in Networks and Systems, Springer, Singapore, Vol. 204DOI
Zheng Y.-L., Song T.-T., Chai J.-X., Yang X.-P., Yu M.-M., Zhu Y.-C., Liu Y., Xie Y.-Y., 2021, Exploring a New Adaptive Routing Based on the Dijkstra Algorithm in Optical Networks-on-Chip, Micromachines, Vol. 12, No. 54DOI
El-Sherbeny N. A., 2010, Vehicle Routing with Time Windows: An Overview of Exact, Heuristic and Metaheuristic Methods. J. King Saud Univ. Sci., Vol. 22, pp. 123-131DOI
Neupane D., Seok J. A., 2020, Review on Deep Learning-Based Approaches for Automatic Sonar Target Recognition, Electronics, Vol. 9, No. 1972DOI
Bhandari S., Ranjan N., Khan P., Kim H., Hong Y.-S., 2021, Deep Learning-Based Content Caching in the Fog Access Points, Electronics, Vol. 10, No. 512DOI
Bhandari S., Kim H., Ranjan N., Zhao H. P., Khan P., 2020, Best Cache Resource Based on Deep Neural Network for Fog Radio Access Networks, Journal of Internet Technology, Vol. 21, No. 4, pp. 967-975URL
Lazakis I., Khan S., 2021, An Optimization Framework for Daily Route Planning and Scheduling of Maintenance Vessel Activities in Offshore Wind Farms, Ocean Engineering, Vol. 225, No. 108752DOI
Chen C., Jiang J., Lv N., Li S., 2020, An Intelligent Path Planning Scheme of Autonomous Vehicles Platoon Using Deep Reinforcement Learning on Network Edge, IEEE Access, Vol. 8, pp. 99059-99069DOI
Prianto E., Kim M., Park J.-H., Bae J.-H., Kim J.-S., 2020, Path Planning for Multi-Arm Manipulators Using Deep Reinforcement Learning: Soft Actor-Critic with Hindsight Experience Replay, Sensors, Vol. 20, No. 5911DOI
Lu E. H-C., Ya-Wen Y., 2019, A Hybrid Route Planning Approach for Logistics with Pickup and Delivery. Expert Syst, Appl, Vol. 118, pp. 482-492DOI
Tong B., Wang J., Wang X., Zhou F., Mao X., Zheng W., 2022, Best Route Planning for Truck-Drone Delivery Using Variable Neighborhood Tabu Search Algorithm, Appl. Sci., Vol. 12, No. 529DOI
Vahdanjoo M., Zhou K., Sørensen C. A. G., 2020, Route Planning for Agricultural Machines with Multiple Customers: Manure Application Case Study, Agronomy, Vol. 10, No. 1608DOI
Ranjan N., Bhandari S., Khan P., Hong Y.-S., Kim H., 2021, Large-Scale Road Network Congestion Pattern Analysis and Prediction Using Deep Convolutional Autoencoder, Sustainability, Vol. 13, No. 5108DOI
Ranjan N., Bhandari S., Zhao H. P., Kim H., Khan P., 2020, City-Wide Traffic Congestion Prediction Based on CNN, LSTM and Transpose CNN, IEEE Access, Vol. 8, pp. 81606-81620DOI
Li Z., Huang J., 2019, How to Mitigate Traffic Congestion Based on Improved Ant Colony Algorithm: A Case Study of a Congested Old Area of a Metropolis, Sustainability, Vol. 11, No. 1140DOI
Balakrishnan A., Banciu M., Glowacka K., Mirchandani P., 2013, Hierarchical Approach for Survivable Network Design, Eur. J. Oper. Res., Vol. 225, pp. 223-235DOI
Fredman M. L., Tarjan R. E., 1987, Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms, J. ACM, Vol. 34, pp. 596-615DOI
Qu T., Cai Z. A., 2015, Fast Isomap Algorithm Based on Fibonacci Heap, In International Conference in Swarm Intelligence; Springer: Cham, Switzerland, pp. 225-231DOI
Lu X., Camitz M., 2011, Finding the Shortest Paths by Node Combination, Appl. Math. Comput., Vol. 217, pp. 6401-6408DOI
Orlin J. B., Madduri K., Subramani K., Williamson M. A., 2010, Faster Algorithm for the Single Source Shortest Path Problem with Few Distinct Positive Lengths, J. Discret. Algorithms, Vol. 8, pp. 189-198DOI
Jin W., Chen S., Jiang H., 2013, Finding the K Shortest Paths in a Time-schedule Network with Constraints on Arcs, Comput. Oper. Res., Vol. 40, pp. 2975-2982DOI
Asaduzzaman M., Geok T. K., Hossain F., Sayeed S., Abdaziz A., Wong H.-Y., Tso C. P., Ahmed S., Bari M. A., 2021, An Efficient Shortest Path Algorithm: Multi-Destinations in an Indoor Environment, Symmetry, Vol. 13, No. 421DOI
Hart P. E., Nilsson N. J., Raphael B. A., 1968, Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, Vol. 4, No. 2, pp. 100-107DOI
Ben Ticha H., Absi N. A., 2017, Solution Method for the Multi-Destination Bi-Objectives Shortest Path Problem, Elsevier: Amsterdam, The NetherlandsDOI
Bast H., Funke S., Sanders P., Schultes D., 2007, Fast Routing in Road Networks with Transit Nodes, Science, Vol. 316, No. 5824:566DOI
Shen B., Cheema M. A., Harabor D. D., Stuckey P. J., 2021, Contracting and Compressing Shortest Path Databases, Proceedings of the International Conference on Automated Planning and Scheduling, Vol. 31, No. 1, pp. 322-330URL
Bentley J. L., 22-24 January, 1990, Experiments on Traveling Salesman Heuristics, In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, Vol. 91-99URL
Clarke G., Wright J. W., 1964, Scheduling of Vehicles from a Central Customer to a Number of Delivery Points, Oper. Res., Vol. 12, pp. 568-581DOI
Mele U. J., Gambardella L. M., Montemanni R., 2021, Machine Learning Approaches for the Traveling Salesman Problem: A Survey, Proceedings of the 8$^{th}$ International Conference on Industrial Engineering and Applications 2021 (Europe), pp. 182-186DOI
Zhang R., Prokhorchuk A., Dauwels J., 2020, Deep Reinforcement Learning for Traveling Salesman Problem with Time Windows and Rejections, 2020 International Joint Conference on Neural Networks (IJCNN), pp. 1-8DOI
Reinelt G., 1991, TSPLIB-A Traveling Salesman Problem Library, INFORMS Journal on Computing, Vol. 3, No. 4, pp. 376-384DOI
Usberti F. L., Franca P. M., France A. L. M., 2011, The Open Capacitated Arc Routing Problem, Computers & Operations Research, Vol. 38, No. 11, pp. 1543-1555DOI
Minieka E., 1979, The Chinese Postman Problem for Mixed Networks, Management Science, Vol. 25, No. 7, pp. 609-707DOI