Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "assignment" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-13 z 13
    Tytuł:
    Optimization on permutations: related structures, problems interrelation, heuristic compositions, applications
    Autorzy:
    Miatselski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/298118.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Warmińsko-Mazurski w Olsztynie
    Tematy:
    heuristic algorithm
    heuristics composition
    optimization on permutations
    assignment problem
    quadratic assignment problem
    Opis:
    A heuristics based approach to practical solving theoretically intractable combinatory and network problems is discussed. Compound heuristics (heuristics compositions) are suggested to be more efficient procedures for real size problem instances. Some aspects of the heuristics compositions topic are illustrated by optimum permutation problems. We describe a uniform presentation of the chief types of the problems and their interrelations, including the relation “to be a special case of a problem”. We consider a number of algebraic structures and combinatory constructions on permutation sets and present an inclusion chain of these constructions. The chain enables us to establish and clarify many interrelations for the minimum permutation problems, with algorithmic and complexity aspects taken into account. We also concern the applications of some problems as well.
    Źródło:
    Technical Sciences / University of Warmia and Mazury in Olsztyn; 2018, 21(1); 37-47
    1505-4675
    2083-4527
    Pojawia się w:
    Technical Sciences / University of Warmia and Mazury in Olsztyn
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Some Aspects of the Application of Genetic Algorithm for Solving the Assignment Problem of Tasks to Resources in a Transport Company
    Autorzy:
    Izdebski, Mariusz
    Jacyna, Marianna
    Powiązania:
    https://bibliotekanauki.pl/articles/504281.pdf
    Data publikacji:
    2014
    Wydawca:
    Międzynarodowa Wyższa Szkoła Logistyki i Transportu
    Tematy:
    assignment problem
    genetic algorithm
    optimization
    Opis:
    The article defines the assignment problem of tasks to resources in a transport company. The paper describes mathematical model of a transport system taking into account the assignment of vehicles to the tasks. It also provides stages of creation of the genetic algorithm for solving the assignment problem in the transport company.
    Źródło:
    Logistics and Transport; 2014, 21, 1; 13-20
    1734-2015
    Pojawia się w:
    Logistics and Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Ant algorithm for AP-N aimed at optimization of complex systems
    Autorzy:
    Mikulik, J.
    Zajdel, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/375987.pdf
    Data publikacji:
    2010
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    assignment problem
    ant algorithm
    optimization
    Opis:
    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.
    Źródło:
    Decision Making in Manufacturing and Services; 2010, 4, 1-2; 29-36
    1896-8325
    2300-7087
    Pojawia się w:
    Decision Making in Manufacturing and Services
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The SEKO assignment : efficient and fair assignment of students to multiple seminars
    Autorzy:
    Hoßfeld, Tobias
    Powiązania:
    https://bibliotekanauki.pl/articles/27315331.pdf
    Data publikacji:
    2023
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    assignment problem
    limited capacity
    utilization
    at least on seminar ratio
    ALOS ratio
    fairness
    integer linear programming
    ILP
    first-in first-out assignment
    FIFO assignment
    random selection using key objectives
    SEKO
    Opis:
    Seminars are offered to students for education in various disciplines. The seminars may be limited in terms of the maximum number of participants, e.g., to have lively interactions. Due to capacity limitations, those seminars are often offered several times to serve the students’ demands. Still, some seminars are more popular than others and it may not be possible to grant access to all interested students due to capacity limitations. In this paper, a simple, but efficient random selection using key objectives (SEKO) assignment strategy is proposed which achieves the following goals: (i) efficiency by utilizing all available seminar places, (ii) satisfying all students by trying to assign at least one seminar to each student, and (iii) fairness by considering the number of assigned seminars per student. We formulate various theoretical optimization models using integer linear programming (ILP) and compare their solutions to the SEKO assignment based on a real-world data set. The real-world data set is also used as the basis for generating large data sets to investigate the scalability in terms of demand and number of seminars. Furthermore, the first-in first-out (FIFO) assignment, as a typical implementation of fair assignments in practice, is compared to SEKO in terms of utilization and fairness. The results show that the FIFO assignment suffers in realworld situations regarding fairness, while the SEKO assignment is close to the optimum and scales regarding computational time in contrast to the ILP.
    Źródło:
    Operations Research and Decisions; 2023, 33, 3; 1--25
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The application of genetic algorithm in the assignment problems in the transportation company
    Autorzy:
    Izdebski, M.
    Jacyna, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/247149.pdf
    Data publikacji:
    2018
    Wydawca:
    Instytut Techniczny Wojsk Lotniczych
    Tematy:
    assignment problem
    genetic algorithm
    multi-criterion optimization
    transportation company
    Opis:
    The article presents the problem of the task assignment of the vehicles for the transportation company, which deals with the transport of the cargo in the full truckload system. The presented problem is a complex decision making issue which has not been analysed in the literature before. There must be passed through two stages in order to solve the task assignment problem of the vehicles for the transportation company. The first stage is to designate the tasks, the other one is to determine the number of the vehicles that perform these tasks. The task in the analysed problem is defined as transporting the cargo from the suppliers to the recipients. The transportation routes of the cargo must be determined. In order to solve the task assignment problem of the vehicles, the genetic algorithm has been developed. The construction stages of this algorithm are presented. The algorithm has been developed to solve the multi-criteria decision problem. What is more, the algorithm is verified by the use of the real input data.
    Źródło:
    Journal of KONES; 2018, 25, 4; 133-140
    1231-4005
    2354-0133
    Pojawia się w:
    Journal of KONES
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Factors affecting the result of matches in the one day format of cricket
    Autorzy:
    Bandulasiri, A.
    Brown, T.
    Wickramasinghe, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/406522.pdf
    Data publikacji:
    2016
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    victory in a cricket match
    efficient bowling
    assignment problem
    team sport
    Opis:
    Factors contributing to winning games are imperative, as the ultimate objective in a game is victory. The aim of this study was to identify the factors that characterize the game of cricket, and to investigate the factors that truly influence the result of a game using the data collected from the Champions Trophy cricket tournament. According to the results, this cricket tournament can be characterized using the factors of batting, bowling, and decision-making. Further investigation suggests that the rank of the team and the number of runs they score have the most significant influence on the result of games. As far as the effectiveness of assigning bowlers is concerned, the Australian team has done a fabulous job compared to the rest of the teams.
    Źródło:
    Operations Research and Decisions; 2016, 26, 4; 21-32
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Target assignment problem for air raid
    Autorzy:
    Chudy, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/205571.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    problem przyporządkowania adresów
    air raid planning
    assignment problem
    branch-and-bound method
    Opis:
    The article deals with two formulations of the target assignment problem. The first one concerns a homogeneous collection of air raid means (different types of aircrafts and missiles). We propose a method for solving a subclass of the problem. The approach consists of two parts. First, an equivalent assignment-type problem is constructed, then a modified branch-and-bound method is used to solve the problem. The other formulation concerns a heterogencous collection of means. To describe this problem a new algebra is introduced
    Źródło:
    Control and Cybernetics; 1999, 28, 1; 101-113
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optymalizacja przypisania zadania za pomocą liniowego narzędzia programującego PESBAT
    Autorzy:
    Yanch, Uladzislau
    Wiechetek, Łukasz
    Powiązania:
    https://bibliotekanauki.pl/articles/610511.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    task assignment
    assignment problem
    process optimization
    workload balancing
    optimizing in Excel
    Solver
    linear programming
    przydział zadań
    problem przypisania
    optymalizacja procesu
    równoważenie obciążenia
    optymalizacja w Excelu
    programowanie liniowe
    Opis:
    The article presents task assignment problem and the role that modern linear programming tools may play in its solving. Task assignment problem is a case of the assignment problem, which is one of the fundamental combinatorial optimization problems. Its specific formulations can be found in logistics (e.g. driver assignment problem), computer science (e.g. memory management) and other fields of science and business. Various methods and algorithms have been created or adapted to solve the assignment problem, and modern linear programming and optimization tools like Microsoft Excel Solver, which contain implementations of these algorithms, provide a possibility to solve diverse cases of the assignment problem with minimum effort and time.The article addresses widely known task assignment problem in business, its sources and ways of solving or reducing its negative impact on business processes effectiveness. The paper contains also a general overview of modern linear programming tools that can be used for task assignment and describes Microsoft Excel Solver Add-in as a tool for business process optimization.The main part of the article is a presentation of VBA based optimization tool called PESBAT developed by the authors and the case of task assignment process optimization in the enterprise that offers photoanalytical services. Pilot use of a PESBAT tool showed that it allows reducing the time needed for task assignment, gives more balanced workload for employees but also indicated the optimization possibilities of other areas of described company, like route optimization and reports preparation.
    W artykule przedstawiono problem przypisywania zadań oraz rolę, jaką mogą odegrać w ich rozwiązywaniu nowoczesne narzędzia programowania liniowego. Problem przydziału zadań jest przypadkiem problemu przypisania, będącym jednym z podstawowych problemów optymalizacji kombinatorycznej. Jego specyficzne sformułowania można znaleźć w logistyce (np. problem przypisywania sterowników), informatyce (np. w zarządzaniu pamięcią) oraz innych dziedzinach nauki i biznesu. Opracowano lub zaadaptowano różne metody i algorytmy, aby rozwiązać problem przydziału, a nowoczesne narzędzia do programowania i optymalizacji liniowej, takie jak Microsoft Excel Solver, które zawierają implementację tych algorytmów, zapewniają możliwość rozwiązywania różnorodnych przypadków problemu przydziału przy minimalnym wysiłku i czasie.W opracowaniu szeroko omówiono znany problem przypisywania zadań w biznesie, jego źródła i sposoby rozwiązywania lub ograniczania jego negatywnego wpływu na efektywność procesów biznesowych. Praca zawiera również ogólny przegląd nowoczesnych narzędzi programowania liniowego, które można wykorzystać do przypisania zadań. Ponadto autorzy opisali dodatek Microsoft Solver Add-in jako narzędzie do optymalizacji procesów biznesowych.Główną częścią artykułu jest prezentacja opracowanego przez autorów narzędzia optymalizacyjnego VBA o nazwie PESBAT oraz przypadku optymalizacji procesu przydzielania zleceń w przedsiębiorstwie, które oferuje usługi fotoanalityczne. Pilotażowe wykorzystanie narzędzia PESBAT pokazało, że pozwala ono na skrócenie czasu potrzebnego na przypisanie zadań, zapewnia bardziej zrównoważony nakład pracy dla pracowników, ale także wskazało możliwości optymalizacji innych obszarów opisywanej firmy, takie jak optymalizacja trasy i przygotowanie raportów.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska, sectio H – Oeconomia; 2018, 52, 2
    0459-9586
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska, sectio H – Oeconomia
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A reference point method to triple-objective assignment of supporting services in a healthcare institution
    Autorzy:
    Sawik, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/375985.pdf
    Data publikacji:
    2010
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    reference point method
    assignment problem
    mixed-integer programming
    services operations management
    healthcare planning
    Opis:
    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.
    Źródło:
    Decision Making in Manufacturing and Services; 2010, 4, 1-2; 37-46
    1896-8325
    2300-7087
    Pojawia się w:
    Decision Making in Manufacturing and Services
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Clustering heuristic for time-dependent periodic routing problems with complex constraints
    Autorzy:
    Śliwiński, Tomasz
    Powiązania:
    https://bibliotekanauki.pl/articles/2037446.pdf
    Data publikacji:
    2020
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    periodic vehicle routing
    time windows
    assignment problem
    okresowe wyznaczanie tras pojazdów
    okna czasowe
    problem przydziału
    Opis:
    Periodic routing and scheduling is of utmost importance in many industries with mobile personnel working in the field: sales representatives, service technicians, suppliers, etc. The resulting optimization problems are of large scale and complexity, mostly due to discrete, combinatorial nature of the systems and due to complicated, nonuniform constraints. In many cases the long-term stability of the customer to personnel allocation is required, leading to the decomposition of the major problem into single employee subproblems. The paper deals with building clusters of customers visited by a single salesperson. The procedure takes into account diverse system requirements and constraints, possible traveling schedules and expected operational costs. The difficulty of the problem lies in its large scale and constraints complexity as well as in troublesome objective evaluation for the given solution. The general solution concept is presented. Its usefulness is supported by the results of the computational experiments.
    Źródło:
    Decision Making in Manufacturing and Services; 2020, 14, 2; 181-192
    1896-8325
    2300-7087
    Pojawia się w:
    Decision Making in Manufacturing and Services
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Minimization of bus stop number on a bus station
    Minimalizacja liczby platform na stacji autobusowej
    Autorzy:
    Palúch, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/375351.pdf
    Data publikacji:
    2013
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    bus station
    bus stop
    minimization
    graph coloring
    assignment problem
    stacja autobusowa
    platforma
    minimalizacja
    kolorowanie grafów
    algorytm przydziału
    Opis:
    A bus station contains several bus stops. Only one bus can occupy a single bus stop at a time. Buses of many trips arrive to the bus station during the day (or during another considered period) and every bus occupies a bus stop for a certain time interval. The set of available bus stops is limited. This paper studies a problem how to assign a bus stop to every bus trip in order to minimize the number of assigned bus stops and in order to comply several additional conditions. Several approaches to this problem are presented. These approaches differ according to considered additional conditions.
    Na stacji autobusowej może znajdować się kilka platform. W tym samym czasie przy jednej platformie może znajdować się tylko jeden autobus. W ciągu dnia na stację autobusową przyjeżdżają autobusy z różnych połączeń i każdy z nich zajmuje platformę przez określony czas. Ten artykuł ma na celu pokazanie problemu przyporządkowania platform do wszystkich połączeń i jednoczesnej minimalizacji liczby platform przy spełnieniu określonych warunków. Prezentowane są różne sposoby rozwiązania problemu. Każdy ze sposobów różni się w zależności od dalszych warunków.
    Źródło:
    Transport Problems; 2013, 8, 1; 113-118
    1896-0596
    2300-861X
    Pojawia się w:
    Transport Problems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Safety factor in the sustainable fleet management model
    Autorzy:
    Rudyk, Tomasz
    Szczepański, Emilian
    Jacyna, Marianna
    Powiązania:
    https://bibliotekanauki.pl/articles/223624.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    fleet management
    assignment problem
    sustainable model
    mathematical modelling
    safety
    zarządzanie flotą
    problem przydziału
    model zrównoważony
    modelowanie matematyczne
    bezpieczeństwo
    Opis:
    In the era of rapidly changing market and consumer needs, there are dynamic changes in the services offered. This also applies to the car fleet market. Currently, the approach to owning a vehicle is changing to other forms such as rental or subscription. Different types of funding are conducive to changes in the fleet management industry. More and more sophis-ticated services are offered for corporate clients, but also private customers. In the context of these changes, the approach to different aspects of vehicle use is also clarified, including what has been noticeable in recent years, increased interest in road safety, environmental issues and most importantly costs of use and possession of the vehicle. This puts high demands on fleet managers who sustainably need to match the structure of their fleets to the needs and capabilities of their customers while taking into account safety and ecology issues. This is a complicated task that requires decision-making assistance. This article addresses the support of the fleet manager decision, taking into account the sustainable management model. The article aimed to develop a model that takes into account the aspects of safety and ecology from the operator-financier the point of view. The result of the article is to provide a decision-making tool for the selection of vehicles and drivers, taking into account their characteristics to accomplish their tasks. The work presents the problem of fleet management, shows the characteristics of different forms of financing and the impact of market trends on the current approach to these problems. The analysis of safety aspects to the possibility of using different methods affecting its level was then presented. Another element of the article is a mathematical model of the problem of resources assignment for tasks. The developed model is universal and can be used for evaluation and optimisation. To this end, the function of the criterion has been formulated, taking into account the aspects of safety, ecology and financial aspects. It also takes into account the randomness of adverse events and the duration of the remaining appropriations in the out-of-order state. This Model can be used for the risk assessment of the driving staff. The developed model was implemented in the Flexsim environment for a computational example for a trading company. Computational experiments have indicated the correctness of the model and its high application potential, as well as further directions of model development to support complex management processes carried out by fleet managers.
    Źródło:
    Archives of Transport; 2019, 49, 1; 103-114
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Problem przydziału pracowników do stanowisk pracy z losowością i rotacją alokacji
    Problem of employees assignment to workplaces with randomness and rotation of allocation
    Autorzy:
    Klimek, Marcin
    Powiązania:
    https://bibliotekanauki.pl/articles/1384820.pdf
    Data publikacji:
    2019
    Wydawca:
    Polskie Wydawnictwo Ekonomiczne
    Tematy:
    problem przydziału
    stanowisko pracy
    alokacja stanowisk
    rotacja stanowisk
    priorytetowy algorytm alokacji
    odprawa celna
    assignment problem
    random allocation with rotation of workplaces
    priority allocation algorithm
    customs clearence
    Opis:
    W artykule opisane jest zagadnienie przydziału pracowników do stanowisk pracy w systemie odpraw celnych. Ze względu na specyfikę problemu, w związku z występowaniem ryzyka zachowań korupcyjnych, obsada stanowisk pracy powinna być generowana w sposób losowy. Zalecane jest także uwzględnienie rotacji stanowisk dla pracowników, którzy np. zbyt często pełnili służbę w uciążliwym miejscu pracy. Sformułowany jest model matematyczny dla tego zagadnienia. Następnie zaprezentowany jest proponowany szybki algorytm znajdujący rozwiązanie dedykowane dla zdefiniowanego problemu.
    The article discusses the assignment problem of employees to workplaces in the customs clearance system. Due to the specific nature of the problem, due to the risk of corruption, staffing should be generated randomly. It is also advisable to include rotation of positions for employees who, for example, have too often served in a cumber some workplace. The mathematical model for this problem is formulated. Then the proposed fast algorithm mispresented, which is dedicated to the defined problem.
    Źródło:
    Gospodarka Materiałowa i Logistyka; 2019, 9; 2-8
    1231-2037
    Pojawia się w:
    Gospodarka Materiałowa i Logistyka
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-13 z 13

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies