Suchergebnisse - "shortest path problem"

Computation of lower tolerances of combinatorial bottleneck problems

Autoren: Jäger, Gerold Turkensteen, Marcel

Quelle: Discrete Optimization. 56

Schlagwörter: Bottleneck objective, Bottleneck Shortest Path Problem, Combinatorial optimization, Linear Bottleneck Assignment Problem, Sensitivity analysis

Dateibeschreibung: electronic

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-238216
https://doi.org/10.1016/j.disopt.2025.100887

Floyd-Warshall ve Karınca Kolonisi Optimizasyonu Algoritmaları ile Depo Rota Planlaması

Autoren: Furkan Ulu Gülveren Tabansız Göç Fatih Çavdur

Quelle: Verimlilik Dergisi, Vol 59, Iss 2, Pp 337-354 (2025)
Volume: 59, Issue: 2337-354
Journal of Productivity
Verimlilik Dergisi

Schlagwörter: Industrial productivity, En Kısa Yol Problemi, Gezgin Satıcı Problemi (GSP), Floyd-Warshall Algoritması, Karınca Kolonisi Optimizasyonu (KKO) Algoritması, Rota Planlama, Üretim ve Endüstri Mühendisliği (Diğer), karınca kolonisi optimizasyonu (kko) algoritması, gezgin satıcı problemi (gsp), traveling salesman problem (tsp), Shortest Path Problem, Traveling Salesman Problem (TSP), Floyd-Warshall Algorithm, Ant Colony Optimization (ACO) Algorithm, Route Planning, ant colony optimization (aco) algorithm, en kısa yol problemi, floyd-warshall algoritması, rota planlama, floyd-warshall algorithm, HD56-57.5, route planning, Manufacturing and Industrial Engineering (Other), shortest path problem

Dateibeschreibung: application/pdf

Zugangs-URL: https://doaj.org/article/a41c4fffea5648bfb2bb36cff72ab28c
https://dergipark.org.tr/tr/pub/verimlilik/issue/91246/1539618

A method for finding a least-cost corridor on an ordinal-scaled raster cost surface

Autoren: Seegmiller, Lindsi Shirabe, Takeshi

Quelle: Annals of GIS. 29(2):205-225

Schlagwörter: multiobjective shortest path problem, preferred path problem, Raster cost surface, scales of measurement, wide path

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-330048
https://doi.org/10.1080/19475683.2023.2166585

Exact and approximation algorithms for routing a convoy through a graph

Autoren: Martijn van Ee Tim Oosterwijk René Sitters et al.

Weitere Verfasser: Martijn van Ee Tim Oosterwijk René Sitters et al.

Quelle: Mathematical Programming. 213:985-1008

Schlagwörter: 90C27, 90C39, Shortest path problem, Traveling salesperson problem, 0211 other engineering and technologies, 68Q25, traveling salesperson problem, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 68W25, Approximation algorithms, Convoy routing, ddc:004, approximation algorithms, convoy routing, shortest path problem

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/1871.1/cae572ff-f830-4025-82ed-460f67cd18e9
https://research.vu.nl/en/publications/cae572ff-f830-4025-82ed-460f67cd18e9
https://doi.org/10.1007/s10107-024-02159-z
https://research.vu.nl/en/publications/a7c48309-ef48-48a2-a4e3-0f60f6229aee
https://hdl.handle.net/1871.1/a7c48309-ef48-48a2-a4e3-0f60f6229aee
https://doi.org/10.4230/LIPIcs.MFCS.2023.86
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.86

Algorithm for the CSR Expansion of Max-Plus Matrices Using the Characteristic Polynomial: Algorithm for the CSR expansion of max-plus matrices using the characteristic polynomial

Autoren: Nishida, Yuki

Quelle: SIAM Journal on Discrete Mathematics. 39:575-592

Schlagwörter: algebraic eigenvalue, tropical semiring, 15A80, 93C65, Nachtigall expansion, Optimization and Control (math.OC), FOS: Mathematics, max-plus algebra, CSR expansion, Max-plus and related algebras, Discrete event control/observation systems, Mathematics - Optimization and Control, shortest path problem

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2311.03844

Penentuan rute terpendek antara dua titik di gudang menggunakan Dijkstra’s Algorithm dan Microsoft Excel

Autoren: Sanggala, Ekra Pane, Syafrial Fachri Habibi, Roni

Quelle: Jurnal Teknik Industri Terintegrasi (JUTIN); Vol. 8 No. 1 (2025): January; 125-132

Schlagwörter: Gudang, Shortest Path Problem, Dijkstra's Algorithm, Microsoft Excel, Order Picking

Dateibeschreibung: application/pdf

Zugangs-URL: https://journal.universitaspahlawan.ac.id/index.php/jutin/article/view/39060

The Distributed Biased Min-Consensus Protocol Revisited: Pre-Specified Finite Time Control Strategies and Small-Gain Based Analysis: Pre-Specified Finite Time Control Strategies and Small-Gain Based Analysis

Autoren: Mo, Yuanqiu Wang, He Li, Shuai et al.

Quelle: IEEE Transactions on Automatic Control. :1-16

Schlagwörter: consensus, small-gain theorem, pre-specified finite time control, the shortest path problem, Biased min-consensus

Zugangs-URL: https://cris.vtt.fi/en/publications/42f76531-a419-4352-8cf4-3c17aa31e47e
https://doi.org/10.1109/TAC.2025.3581845

Linear Programming of the Loopwise Route Representation for the Shortest Path Problems by Introducing the Reference Link Flow

Autoren: Geunu Kim Changyeong Kim Sanghoon Park et al.

Quelle: IEEE Access, Vol 13, Pp 38856-38864 (2025)

Schlagwörter: Loop-wise route representation, vehicle routing problem, linear programming, Electrical engineering. Electronics. Nuclear engineering, reference link flow, shortest path problem, topology optimization, TK1-9971

Zugangs-URL: https://doaj.org/article/ea8c10330b3d4e2fa6983cef71686b23

Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search

Autoren: Amr Elshahed Majid Khan Bin Majahar Ali Ahmad Sufril Azlan Mohamed et al.

Quelle: IEEE Access, Vol 13, Pp 98473-98484 (2025)

Schlagwörter: heuristic algorithms, Electrical engineering. Electronics. Nuclear engineering, Path planning, shortest path problem, TK1-9971

Zugangs-URL: https://doaj.org/article/1af162fe4d2c4bf9ba2ba93702279a5b

Aspiration level-based non-dominated sorting genetic algorithm II & III to solve fuzzy multi-objective shortest path problem

Autoren: Aniket Todkar Jayesh Dhodiya

Quelle: Yugoslav Journal of Operations Research, Vol 35, Iss 1, Pp 135-162 (2025)

Schlagwörter: triangular fuzzy number, aspiration level, T58.6-58.62, multi-objective shortest path problem, α-level set, 0211 other engineering and technologies, Management information systems, 02 engineering and technology, fuzzy membership function

Zugangs-URL: https://doaj.org/article/8292b1d36dce446a974dde69845df0ce

OppIN: Optimal Path Intervention for Emergency Response Leveraging IoT and Big Data Technologies

Autoren: Yassine Gacha Takoua Abdellatif

Quelle: IEEE Open Journal of Intelligent Transportation Systems, Vol 6, Pp 484-502 (2025)

Schlagwörter: Transportation engineering, TA1001-1280, big data, multi-criteria shortest path problem (MCSP), Optimal path, fastest intervention, deep learning, crisis response, Transportation and communications, HE1-9990

Zugangs-URL: https://doaj.org/article/9f9bcf7977eb491689d19c9dc226403b

An experimental analysis of least-cost path models on ordinal-scaled raster surfaces

Autoren: Murekatete, Rachel Mundeli Shirabe, Takeshi

Quelle: International Journal of Geographical Information Science. 35(8):1545-1569

Schlagwörter: Least-cost paths, lexicographic preference, raster cost surfaces/suitability surfaces, scales of measurement, shortest path problem

Dateibeschreibung: electronic

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-285379
https://doi.org/10.1080/13658816.2020.1753204

A Fast and Simple Algorithm for the Resource Constrained Shortest Path Problem

Autoren: Ahmadi, Saman Raith, Andrea Jalili, Mahdi et al.

Weitere Verfasser: Ahmadi, Saman Raith, Andrea Jalili, Mahdi et al.

Schlagwörter: heuristic search, constrained pathfinding, ddc:004, shortest path problem

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.97

Single-Source Shortest Path Problem in Weighted Disk Graphs

Autoren: An, Shinwoo Oh, Eunjin Xue, Jie et al.

Weitere Verfasser: An, Shinwoo Oh, Eunjin Xue, Jie et al.

Schlagwörter: Disk graphs, Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, compressed quadtrees, shortest path problem

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2504.06534
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.7

Solving Shortest Energy and Time-Dependent Travel Time Path Problems on a Small-Sized Road Network

Autoren: Dominik Knez Ante Dumančić Tomislav Erdelić et al.

Quelle: 2023 International Symposium ELMAR. :33-36

Schlagwörter: Dijkstra, Fibonacci heap, Energy shortest path problem, Time-dependent shortest path problem

Optimal design of series of pipes in sewer systems including pumping stations for flat terrains

Autoren: Saldarriaga, Juan Herrán, Juana Acevedo, Ana et al.

Weitere Verfasser: Saldarriaga, Juan Herrán, Juana Acevedo, Ana et al.

Quelle: RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Universitat Politècnica de València (UPV)

Schlagwörter: Optimization, Hydraulic design, Shortest path problem, Pumping station, MECANICA DE FLUIDOS, 0208 environmental biotechnology, Flat terrains, 0207 environmental engineering, Series of pipes, 02 engineering and technology, 6. Clean water

Dateibeschreibung: application/pdf

Zugangs-URL: https://riunet.upv.es/handle/10251/207501
https://hdl.handle.net/10251/207501
https://doi.org/10.1080/1573062x.2024.2329086

An enhanced Benders decomposition method for unique shortest path routing

Autoren: Changyong Zhang

Quelle: OPSEARCH. 61:989-1012

Schlagwörter: Shortest path problem, Decomposition method (queueing theory), Computer Networks and Communications, 0211 other engineering and technologies, Organic chemistry, 02 engineering and technology, 7. Clean energy, Graph, Optical Code Division Multiple Access, Engineering, Theoretical computer science, Optical Communication Networks and Energy Efficiency, Constrained Shortest Path First, 0502 economics and business, FOS: Electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Electrical and Electronic Engineering, Decomposition, Computer network, 05 social sciences, Mathematical optimization, Benders' decomposition, Path (computing), Discrete mathematics, Computer science, Chemistry, Networks on Chip in System-on-Chip Design, Computer Science, Physical Sciences, Routing Algorithms, K shortest path routing, Mathematics

Evaluation of Shortest Path by using Breadth-First Algorithm under Neutrosophic Environment

Autoren: Prasanta Kumar Raut Siva Prasad Behera Said Broumi et al.

Quelle: HyperSoft Set Methods in Engineering. 1:34-45

Schlagwörter: FOS: Computer and information sciences, Shortest path problem, Artificial intelligence, 7. Clean energy, Graph, Engineering, Theoretical computer science, Dijkstra's algorithm, FOS: Mathematics, Comprehensive Survey of Big Data Mining Approaches, Real-time Water Quality Monitoring and Aquaculture Management, 14. Life underwater, Smart Parking Solutions and Management, Water Science and Technology, Yen's algorithm, Building and Construction, Path (computing), 15. Life on land, Computer science, Programming language, Algorithm, Computer Science, Physical Sciences, Environmental Science, Mathematics, Information Systems

Intelligent path planning for cognitive mobile robot based on Dhouib-Matrix-SPP method

Autoren: Souhail Dhouib

Quelle: Cognitive Robotics, Vol 4, Iss, Pp 62-73 (2024)

Schlagwörter: Shortest path problem, Artificial intelligence, Path Planning, Robot, Robot Navigation, Aerospace Engineering, FOS: Mechanical engineering, Operations research, Control of Nonholonomic Mobile Robots, Simultaneous Localization and Mapping, Sampling-Based Motion Planning Algorithms, Probabilistic Roadmaps, 7. Clean energy, Mobile Robots, Engineering, Cognition, Mobile robot, Psychology, Dhouib-Matrix-SPP, Path planning, Computer network, Human–computer interaction, QA75.5-76.95, Path (computing), Computer science, Optimal Motion Planning, FOS: Psychology, Control and Systems Engineering, Electronic computers. Computer science, Computer Science, Physical Sciences, Motion planning, Computer Vision and Pattern Recognition, Neuroscience

Zugangs-URL: https://doaj.org/article/5844ae52ebce4018b71cd4433f309dbe

Efficient exact A* algorithm for the single unit hydro unit commitment problem

Autoren: Heintzmann, Alexandre Artigues, Christian Bendotti, Pascale et al.

Weitere Verfasser: Heintzmann, Alexandre Artigues, Christian Bendotti, Pascale et al.

Quelle: Annals of computer science and information systems, Vol 35, Pp 533-543 (2023)

Schlagwörter: Shortest path problem, Mixed integer linear programming, Reservoirs, Electronic computers. Computer science, Production planning, Information technology, QA75.5-76.95, T58.5-58.64, 7. Clean energy, Computer science, Hydraulic systems, Upper bound, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]

Dateibeschreibung: application/pdf

Zugangs-URL: https://doaj.org/article/56541e38f0774c63a01da75a19cd82fe
https://hal.science/hal-04112945v3
https://doi.org/10.15439/2023f5158
https://hal.science/hal-04112945v3/document