scholarly journals An exact algorithm for constrained k-cardinality unbalanced assignment problem

2022 ◽  
Vol 13 (2) ◽  
pp. 267-276 ◽  
Author(s):  
A. Prakash ◽  
Uruturu Balakrishna ◽  
Jayanth Kumar Thenepalle
Keyword(s):  
Comparative Study ◽  
Real World ◽  
Assignment Problem ◽  
Search Algorithm ◽  
Exact Algorithm ◽  
Computational Results ◽  
Optimal Assignment ◽  
Single Person ◽  
Assignment Models ◽  
Solution Techniques

An assignment problem (AP) usually deals with how a set of persons/tasks can be assigned to a set of tasks/persons on a one-to-one basis in an optimal manner. It has been observed that balancing among the persons and jobs in several real-world situations is very hard, thus such scenarios can be seen as unbalanced assignment models (UAP) being a lack of workforce. The solution techniques presented in the literature for solving UAP’s depend on the assumption to allocate some of the tasks to fictitious persons; those tasks assigned to dummy persons are ignored at the end. However, some situations in which it is inevitable to assign more tasks to a single person. This paper addresses a practical variant of UAP called k-cardinality unbalanced assignment problem (k-UAP), in which only of persons are asked to perform jobs and all the persons should perform at least one and at most jobs. The k-UAP aims to determine the optimal assignment between persons and jobs. To tackle this problem optimally, an enumerative Lexi-search algorithm (LSA) is proposed. A comparative study is carried out to measure the efficiency of the proposed algorithm. The computational results indicate that the suggested LSA is having the great capability of solving the smaller and moderate instances optimally.

A comparative study of formulations for a cross-dock door assignment problem

Omega ◽  
2020 ◽  
Vol 91 ◽  
pp. 102015 ◽  
Author(s):  
Shahin Gelareh ◽  
Fred Glover ◽  
Oualid Guemri ◽  
Saïd Hanafi ◽  
Placide Nduwayo ◽  
...  
Keyword(s):  
Comparative Study ◽  
Assignment Problem

Comparative study of real-world driving cycles, energy consumption, and CO2 emissions of electric and gasoline motorcycles driving in a congested urban corridor

2019 ◽  
Vol 45 ◽  
pp. 619-627 ◽  
Author(s):  
Triluck Koossalapeerom ◽  
Thaned Satiennam ◽  
Wichuda Satiennam ◽  
Watis Leelapatra ◽  
Atthapol Seedam ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Comparative Study ◽  
Co2 Emissions ◽  
Real World ◽  
Driving Cycles ◽  
Urban Corridor

scholarly journals Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess

2017 ◽  
Vol 59 ◽  
pp. 463-494 ◽  
Author(s):  
Shaowei Cai ◽  
Jinkun Lin ◽  
Chuan Luo
Keyword(s):  
Local Search ◽  
Real World ◽  
Large Scale ◽  
Heuristic Algorithms ◽  
Search Algorithm ◽  
Vertex Cover ◽  
Search Algorithms ◽  
Theory And Practice ◽  
Sparse Graphs ◽  
Massive Graphs

The problem of finding a minimum vertex cover (MinVC) in a graph is a well known NP-hard combinatorial optimization problem of great importance in theory and practice. Due to its NP-hardness, there has been much interest in developing heuristic algorithms for finding a small vertex cover in reasonable time. Previously, heuristic algorithms for MinVC have focused on solving graphs of relatively small size, and they are not suitable for solving massive graphs as they usually have high-complexity heuristics. This paper explores techniques for solving MinVC in very large scale real-world graphs, including a construction algorithm, a local search algorithm and a preprocessing algorithm. Both the construction and search algorithms are based on low-complexity heuristics, and we combine them to develop a heuristic algorithm for MinVC called FastVC. Experimental results on a broad range of real-world massive graphs show that, our algorithms are very fast and have better performance than previous heuristic algorithms for MinVC. We also develop a preprocessing algorithm to simplify graphs for MinVC algorithms. By applying the preprocessing algorithm to local search algorithms, we obtain two efficient MinVC solvers called NuMVC2+p and FastVC2+p, which show further improvement on the massive graphs.

scholarly journals Phototransistor: The Story So Far

2020 ◽  
Vol 2 (4) ◽  
pp. 202-210
Author(s):  
Malti Bansal ◽  
Raaghav Raj Maiya
Keyword(s):  
Comparative Study ◽  
Bias Voltage ◽  
Spectral Range ◽  
Real World ◽  
Optical Gain ◽  
Research Paper ◽  
Illumination Intensity ◽  
Gain Parameter ◽  
History Of ◽  
Illumination Method

The research paper prospects the theory of phototransistor ranging from the history of the device to its application in the real world. The research paper deep dives into the characteristics of the phototransistor while discussing its dependence on bias drive, bias voltage, and illumination intensity. The research paper includes a comparative study between the various types of phototransistors based on optical gain, spectral range, and efficiency. It also concludes the best illumination method for the phototransistor based on the optical gain parameter.

Sign in / Sign up

Export Citation Format

Share Document