Zobrazeno 1 - 10
of 102
pro vyhledávání: '"Rolf H. Möhring"'
Publikováno v:
Mathematical Programming. 199:937-993
This paper provides a comprehensive convergence analysis of the PoA of both pure and mixed Nash equilibria in atomic congestion games with unsplittable demands.
57 pages
57 pages
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01329122c2483e435e1ba19dc37c3afe
https://doi.org/10.1007/s10107-022-01853-0
https://doi.org/10.1007/s10107-022-01853-0
Autor:
Zijun Wu, Rolf H. Möhring
Publikováno v:
Mathematics of Operations Research.
The price of anarchy (PoA) is a standard measure to quantify the inefficiency of equilibria in nonatomic congestion games. Most publications have focused on worst-case bounds for the PoA. Only a few have analyzed the sensitivity of the PoA against ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::187c71d1204b144ef7bc0a3dbd6cc25f
https://doi.org/10.1287/moor.2022.1292
https://doi.org/10.1287/moor.2022.1292
Publikováno v:
Operations Research. 69:410-435
The price of anarchy (PoA) is a standard measure for the inefficiency of selfish routing in the static Wardrop traffic model. Empirical studies and a recent analysis reveal a surprising property that the PoA tends to one when the total demand T gets
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7136a6e643aa57afaf3455ff10b1d6c7
https://doi.org/10.1287/opre.2020.2036
https://doi.org/10.1287/opre.2020.2036
Publikováno v:
Optimization and Engineering. 21:709-722
Hard-capacitated k-means (HCKM) is one of the fundamental problems remaining open in combinatorial optimization and engineering. In HCKM, one is required to partition a given n-point set into k disjoint clusters with known capacity so as to minimize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13a974f89559d04b76edf87d3a4b3d41
https://doi.org/10.1007/s11081-020-09503-0
https://doi.org/10.1007/s11081-020-09503-0
Publikováno v:
Operations Research. 67:791-812
In “Ship Traffic Optimization for the Kiel Canal,” Lübbecke, Lübbecke, and Möhring develop graph-based models and algorithms to solve a practical traffic scheduling problem. It arises in the operational planning of bidirectional traffic where
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8fcd2493b674db7e0e0a6dc44803c16
https://doi.org/10.1287/opre.2018.1814
https://doi.org/10.1287/opre.2018.1814
Publikováno v:
Computers and Electrical Engineering. 100:107929
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b17573ed366cd1c1062460d2e13747aa
https://doi.org/10.1016/j.compeleceng.2022.107929
https://doi.org/10.1016/j.compeleceng.2022.107929
Publikováno v:
IEEE Transactions on Evolutionary Computation. 21:616-628
This paper analyzes the stochastic runtime of the cross-entropy (CE) algorithm for the well-studied standard problems OneMax and LeadingOnes. We prove that the total number of solutions the algorithm needs to evaluate before reaching the optimal solu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f8d47deeea31c34d2e9f0dbe9443e9c
https://doi.org/10.1109/tevc.2017.2667713
https://doi.org/10.1109/tevc.2017.2667713
This article analyzes the stochastic runtime of a Cross-Entropy Algorithm on two classes of traveling salesman problems. The algorithm shares main features of the famous Max-Min Ant System with iteration-best reinforcement. For simple instances that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df9387721de432fd1ba41681c959e27d
Publikováno v:
EURO Journal on Transportation and Logistics. 1:87-111
Collision-free vehicle routing occurs in many applications from robot movements via scheduling multiple cranes in steel logistics to the transport of containers by automated guided vehicles. In cooperation with the HHLA Container Terminal Altenwerder
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::efd6304e0b2a5c854316f9ba172fcdec
https://doi.org/10.1007/s13676-012-0008-7
https://doi.org/10.1007/s13676-012-0008-7
Autor:
Rolf H. Möhring
Publikováno v:
it - Information Technology. 53:302-311
Algorithm engineering consists of the design, analysis, implementation and experimental evaluation of practicable algorithms. Research in this direction can be done both in a lab environment and in a real world application. Experience shows that ther
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a2a6f7bb69585db4a50361788d8054f
https://doi.org/10.1524/itit.2011.0657
https://doi.org/10.1524/itit.2011.0657