scholarly journals A NEW MATHEMATICAL MODEL AND RANDOM KEY BASED METAHEURISTIC SOLUTION APPROACH FOR COURSE-ROOM-TIME ASSIGNMENT PROBLEM

2019 ◽  
Vol 27 (2) ◽  
pp. 67-76
Author(s):  
Zehra Kamışlı Öztürk ◽  
Müjgan SAĞIR
Keyword(s):  
Mathematical Model ◽  
Assignment Problem ◽  
Solution Approach ◽  
Room Time

AN AUTOMATED MULTI-OBJECTIVE INVIGILATOR-EXAM ASSIGNMENT SYSTEM

2010 ◽  
Vol 09 (02) ◽  
pp. 223-238 ◽  
Author(s):  
ZEHRA KAMISLI OZTURK ◽  
GURKAN OZTURK ◽  
MUJGAN SAGIR
Keyword(s):  
Mathematical Model ◽  
Exact Solution ◽  
User Interfaces ◽  
Assignment Problem ◽  
Real Life ◽  
Web Based ◽  
Multi Objective ◽  
The Core ◽  
Real Life Problem ◽  
The Mathematical Model

This paper is concerned with the invigilator-exam assignment problem. A web-based Automated Invigilator Assignment System (AIAS), consists of a mathematical model; a database storing the information and web-based user interfaces is constructed to solve the problem by providing an environment for a practical usage. The core of the system is the mathematical model developed for obtaining the exact solution. We conclude the paper by presenting a real-life problem solved by the proposed approach.

Weapon Target Assignment Problem Solving Based on Hungarian Algorithm

2015 ◽  
Vol 713-715 ◽  
pp. 2041-2044 ◽  
Author(s):  
Yuan Zeng Cheng ◽  
Pei Chao Zhang ◽  
Bin Qian Cao
Keyword(s):  
Mathematical Model ◽  
Problem Solving ◽  
Assignment Problem ◽  
Weapon System ◽  
Hungarian Algorithm ◽  
Target Assignment ◽  
Modern Warfare

Weapon target assignment problem is most critical in modern warfare command decision of a problem for the weapon system and a relatively small number of targets assignment problem, you can use the Hungarian algorithm. Hungarian algorithm can solve the assignment problem, but under normal circumstances, weapon target assignment problem does not have the form of a mathematical model of assignment problem, through dummy weapon system or target method, the weapon target assignment problem is transformed into a standard assignment problem, and then solved by the Hungarian algorithm.

scholarly journals Distance-constrained grid colouring

2016 ◽  
Vol 8 (1) ◽  
pp. 5-15
Author(s):  
László Aszalós ◽  
Mária Bakó
Keyword(s):  
Mathematical Model ◽  
Assignment Problem ◽  
Optimization Problem ◽  
Frequency Assignment ◽  
Frequency Assignment Problem

Abstract Distance-constrained colouring is a mathematical model of the frequency assignment problem. This colouring can be treated as an optimization problem so we can use the toolbar of the optimization to solve concrete problems. In this paper, we show performance of distance-constrained grid colouring for two methods which are good in map colouring.

scholarly journals A Mathematical Model for Tool Sharing between Workers by Exact Solution Approach

2021 ◽  
pp. 132-137
Author(s):  
Ashish Yadav ◽  
Keyword(s):  
Mathematical Model ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Exact Algorithm ◽  
System Configuration ◽  
Assembly Lines ◽  
Line System ◽  
Solution Approach ◽  
Assembly Line Balancing Problem ◽  
Tool Cost

Multi-manned assembly lines are generally used to produce large-sized volume products such as cars and trucks. This article addresses the multi-manned two sided assembly line balancing problem with the objectives sharing tool between workstations. This paper presents a mathematical model and a Lingo -16 solvers based exact algorithm for multi-manned two-sided assembly line system configuration with tool sharing between adjacent workstations for companies that need intelligent solutions to satisfy customized demands on time with existing resources. The results obtained indicate that tool shared between parallel stations of two or more parallel lines beneficial for assembly line to minimize workstations, idle time and reduce tool cost.

A Lexicographic Approach to Fuzzy Linear Assignment Problems with Different Types of Fuzzy Numbers

2020 ◽  
Vol 28 (03) ◽  
pp. 421-441 ◽  
Author(s):  
Boris Pérez-Cañedo ◽  
Eduardo R. Concepción-Morales
Keyword(s):  
Assignment Problem ◽  
Fuzzy Numbers ◽  
Multiple Criteria Decision Analysis ◽  
Assignment Problems ◽  
Solution Approach ◽  
Linear Assignment Problem ◽  
Different Types ◽  
Standard Solution ◽  
The Cost ◽  
Linear Assignment

The fuzzy linear assignment problem (FLAP) is an extension of the classical linear assignment problem (LAP) to situations in which uncertainty in the cost coefficients is represented by fuzzy numbers. FLAP applications range from the assignment of workers to tasks to multiple-criteria decision analysis in fuzzy environments and many other engineering applications. Most FLAP formulations assume that all cost coefficients are fuzzy numbers of the same type (e.g. triangular, trapezoidal). The standard solution approach is the defuzzification of the cost coefficients, thus transforming the FLAP into a crisp LAP that can be solved by classical assignment algorithms such as the Hungarian method. It is known that defuzzification methods suffer from lack of discrimination when comparing fuzzy numbers which may lead to suboptimal assignments. The solution approach proposed in this paper is based on the theory of algebraic assignment problems and total orderings in the set of all fuzzy numbers, and it allows to solve FLAPs with different types of fuzzy numbers. More specifically, the FLAP is transformed into a lexicographic linear assignment problem (LLAP) which is solved in its place. We show, both theoretically and numerically, how this transformation overcomes the limitations present in existing approaches.

Sign in / Sign up

Export Citation Format

Share Document