Browsing by Subject "assignment problem"

Now showing 1 - 5 of 5

Access status: Open Access ,
A reference point method to triple-objective assignment of supporting services in a healthcare institution
(2010) Sawik, Bartosz
This paper presents an application of mixed integer programming model for optimal allocation of workers among supporting services in a hospital. The services include logistics, inventory management, financial management, operations management, medical analysis, etc. The optimality criterion of the problem is to minimize operational costs of supporting services subject to some specific constraints. The constraints represent specific conditions for resource allocation in a hospital. The overall problem is formulated as a triple-objective assignment model, where the decision variables represent the assignment of people to various jobs. A reference point approach with the Chebyshev metric is applied for the problem solution. The results of computational experiments modeled on a real data from a hospital in Lesser Poland are reported.
Access status: Open Access ,
An assignment heuristic for time-dependent periodic routing problems with complex constraints
(AGH University of Science and Technology Press, 2020) Śliwiński, Tomasz
Periodic routing and scheduling is of the utmost importance in many industries with mobile personnel working in the field: sales representatives, service technicians, suppliers, etc. In many cases, the long-term stability of the customer to salesman assignment is required, leading to the decomposition of the major problem into single salesman subproblems. The paper addresses the assignment of customers to salesmen for the future services performed in a periodic fashion. It can be seen as the decomposition phase of the periodic vehicle routing problem PVRP into a number of Periodic Traveling Salesman Problems (PTSP). The proposed algorithm seeks the best assignment by taking into account diverse system requirements, constraints and expected operational costs including time windows, time-dependent travel times and costs, and labor laws.
Access status: Open Access ,
Ant algorithm for AP-N aimed at optimization of complex systems
(2010) Mikulik, Jerzy; Zajdel, Mirosław
Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions and a few non-deterministic methods have been proposed to solve it. This paper pays attention on new heuristic search method for the n-dimensional assignment problem, based on swarm intelligence and comparing results with those obtained by other scientists. It indicates possible direction of solutions of problems and presents a way of behaviour using ant algorithm for multidimensional optimization complex systems. Results of researches in the form of computational simulations outcomes are presented.
Access status: Open Access ,
Decision support for allocating farmed fish to customer orders using a bi-objective optimization model
(Wydawnictwa AGH, 2022) Knudseth, Sunniva Haukvik; Molland, Even; Hoff, Arild; Hvattum, Lars Magnus; Oppen, Johan
Aquaculture is an important industry in certain coastal areas. Focusing on the farming of salmon and trout, an operational planning problem arises with the goal of allocating a supply of fish to the demand that is expressed through customer orders. This paper provides a conceptual model of such a planning problem and defines a corresponding bi-objective mathematical programming model. The problem is novel with respect to the structure of fish transport and the rules for satisfying customer orders with respect to fish size, quality, certification, and health status. Computational experiments have been conducted to gain further insight into the use of the provided model to provide support for planners who are involved in operational decision-making. The results indicated that the bi-objective optimization model can be useful in situations where a supply is insufficient to cover all of the demand within a given planning horizon.
Access status: Restricted ,
Modele optymalizacyjne dla zagadnień zarządzania rynkiem
(Data obrony: 2011-07-19) Szmyd, Agata
Wydział Matematyki Stosowanej