A New Algorithm for Solving a Special Matching Problem with a General Form Value Function under Constraints
- 作者: Uzhegov D.V.1, Anan’ev A.A.1, Lomovitskii P.V.1, Khlyupin A.N.1
-
隶属关系:
- MIPhT Engineering Center for Hard to Recover Minerals
- 期: 卷 80, 编号 1 (2019)
- 页面: 81-92
- 栏目: Control in Technical Systems
- URL: https://journals.rcsi.science/0005-1179/article/view/151261
- DOI: https://doi.org/10.1134/S0005117919010077
- ID: 151261
如何引用文章
详细
We consider the assignment problem with a special structure with a general form value function and constraints prohibiting certain matchings. In this case, the matching cost may be undefined until some permutation is found. We formulate the problem in terms of graph theory and reduce it to finding a minimal cost path in a graph with nonlocal edge weights. The proposed method for solving the problem is a modification of the Dijkstra’s shortest path algorithm in a weighted directed graph. This research is motivated by well drilling applications. We also show the analysis of our numerical experiments.
作者简介
D. Uzhegov
MIPhT Engineering Center for Hard to Recover Minerals
编辑信件的主要联系方式.
Email: denis.uzhegov@phystech.edu
俄罗斯联邦, Moscow
A. Anan’ev
MIPhT Engineering Center for Hard to Recover Minerals
Email: denis.uzhegov@phystech.edu
俄罗斯联邦, Moscow
P. Lomovitskii
MIPhT Engineering Center for Hard to Recover Minerals
Email: denis.uzhegov@phystech.edu
俄罗斯联邦, Moscow
A. Khlyupin
MIPhT Engineering Center for Hard to Recover Minerals
Email: denis.uzhegov@phystech.edu
俄罗斯联邦, Moscow
补充文件
