scholarly journals Optimal mass transportation and linear assignment problems in the design of freeform refractive optical elements generating far-field irradiance distributions

2019 ◽  
Vol 27 (9) ◽  
pp. 13083 ◽  
Author(s):  
Leonid L. Doskolovich ◽  
Dmitry A. Bykov ◽  
Albert A. Mingazov ◽  
Evgeni A. Bezus
Keyword(s):  
Far Field ◽  
Mass Transportation ◽  
Assignment Problems ◽  
Optical Elements ◽  
Linear Assignment

scholarly journals Designing double freeform surfaces for collimated beam shaping with optimal mass transportation and linear assignment problems

2018 ◽  
Vol 26 (19) ◽  
pp. 24602 ◽  
Author(s):  
Leonid L. Doskolovich ◽  
Dmitry A. Bykov ◽  
Evgeniy S. Andreev ◽  
Evgeni A. Bezus ◽  
Vladimir Oliker
Keyword(s):  
Beam Shaping ◽  
Mass Transportation ◽  
Assignment Problems ◽  
Freeform Surfaces ◽  
Collimated Beam ◽  
Linear Assignment

Optimal mass transportation problem in the design of freeform optical elements generating far-field irradiance distributions for plane incident beam

2019 ◽  
Vol 58 (33) ◽  
pp. 9131 ◽  
Author(s):  
Dmitry A. Bykov ◽  
Leonid L. Doskolovich ◽  
Albert A. Mingazov ◽  
Evgeni A. Bezus
Keyword(s):  
Transportation Problem ◽  
Incident Beam ◽  
Far Field ◽  
Mass Transportation ◽  
Optical Elements

scholarly journals Linear Assignment Problems Solved by Greedy 2-Opt Heuristics on GPU

2020 ◽  
Vol 10 (5) ◽  
pp. 275-280
Author(s):  
Roberto M. Poveda Chaves et al., Roberto M. Poveda Chaves et al., ◽  
Keyword(s):  
Assignment Problems ◽  
Linear Assignment

scholarly journals Decentralizing Coordination in Open Vehicle Fleets for Scalable and Dynamic Task Allocation

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-21
Author(s):  
Marin Lujak ◽  
Stefano Giordani ◽  
Andrea Omicini ◽  
Sascha Ossowski
Keyword(s):  
Task Allocation ◽  
Assignment Problem ◽  
Individual Interest ◽  
Matching Problem ◽  
Assignment Problems ◽  
Dynamic Task ◽  
Side Constraints ◽  
Dynamic Task Allocation ◽  
Bottleneck Assignment Problem ◽  
Linear Assignment

One of the major challenges in the coordination of large, open, collaborative, and commercial vehicle fleets is dynamic task allocation. Self-concerned individually rational vehicle drivers have both local and global objectives, which require coordination using some fair and efficient task allocation method. In this paper, we review the literature on scalable and dynamic task allocation focusing on deterministic and dynamic two-dimensional linear assignment problems. We focus on multiagent system representation of open vehicle fleets where dynamically appearing vehicles are represented by software agents that should be allocated to a set of dynamically appearing tasks. We give a comparison and critical analysis of recent research results focusing on centralized, distributed, and decentralized solution approaches. Moreover, we propose mathematical models for dynamic versions of the following assignment problems well known in combinatorial optimization: the assignment problem, bottleneck assignment problem, fair matching problem, dynamic minimum deviation assignment problem, Σk-assignment problem, the semiassignment problem, the assignment problem with side constraints, and the assignment problem while recognizing agent qualification; all while considering the main aspect of open vehicle fleets: random arrival of tasks and vehicles (agents) that may become available after assisting previous tasks or by participating in the fleet at times based on individual interest.

Sign in / Sign up

Export Citation Format

Share Document