Log in

Relevant bibliographies by topics / Hungarian Algorithm for Assignment Problem / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Hungarian Algorithm for Assignment Problem.

Dissertations / Theses on the topic 'Hungarian Algorithm for Assignment Problem'

Author: Grafiati

Published: 3 June 2025

Last updated: 1 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Hungarian Algorithm for Assignment Problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Wikström, Anders. "Resource allocation of drones flown in a simulated environment." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-105379.

Full text

Abstract:

In this report we compare three different assignment algorithms in how they can be used to assign a set of drones to get to a set of goal locations in an as resource efficient way as possible. An experiment is set up to compare how these algorithms perform in a somewhat realistic simulated environment. The Robot Operating system (ROS) is used to create the experimental environment. We found that by introducing a threshold for the Hungarian algorithm we could reduce the total time it takes to complete the problem while only sightly increasing total distance traversed by the drones.

APA, Harvard, Vancouver, ISO, and other styles

2

HIRATA, Tomio, and Takao ONO. "An Improved Algorithm for the Net Assignment Problem." Institute of Electronics, Information and Communication Engineers, 2001. http://hdl.handle.net/2237/15062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Koller, Angela Erika. "The frequency assignment problem." Thesis, Brunel University, 2004. http://bura.brunel.ac.uk/handle/2438/4967.

Full text

Abstract:

This thesis examines a wide collection of frequency assignment problems. One of the largest topics in this thesis is that of L(2,1)-labellings of outerplanar graphs. The main result in this topic is the fact that there exists a polynomial time algorithm to determine the minimum L(2,1)-span for an outerplanar graph. This result generalises the analogous result for trees, solves a stated open problem and complements the fact that the problem is NP-complete for planar graphs. We furthermore give best possible bounds on the minimum L(2,1)-span and the cyclic-L(2,1)-span in outerplanar graphs, when

APA, Harvard, Vancouver, ISO, and other styles

4

Arslanoglu, Yilmaz. "Genetic Algorithm For Personnel Assignment Problem With Multiple Objectives." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606880/index.pdf.

Full text

Abstract:

This thesis introduces a multi-objective variation of the personnel assignment problem, by including additional hierarchical and team constraints, which put restrictions on possible matchings of the bipartite graph. Besides maximization of summation of weights that are assigned to the edges of the graph, these additional constraints are also treated as objectives which are subject to minimization. In this work, different genetic algorithm approaches to multi-objective optimization are considered to solve the problem. Weighted Sum &ndash<br>a classical approach, VEGA - a non-elitist multi-obje

APA, Harvard, Vancouver, ISO, and other styles

5

Qi, Xin, and Lan Xu. "The Application of Genetic Algorithm in Teaching Assignment Problem." Thesis, The University of Arizona, 2012. http://hdl.handle.net/10150/271938.

Full text

Abstract:

Genetic Algorithm is a search and optimization technique that is based on the principle of natural selection. In this thesis, a genetic algorithm is used to solve the teacher assignment problem. The result shows that the genetic algorithm is an efficient method to solve teacher assignment problem.

APA, Harvard, Vancouver, ISO, and other styles

6

Gulek, Mehmet. "Assignment Problem And Its Variations." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609145/index.pdf.

Full text

Abstract:

We investigate the assignment problem, which is the problem of matching two sets with each other, optimizing a given function on the possible matchings. Among different definitions, a graph theoretical definition of the linear sum assignment problem is as follows: Given a weighted complete bipartite graph, find a maximum (or minimum) one-to-one matching between the two equal-size sets of the graph, where the score of a matching is the total weight of the matched edges. We investigate extensions and variations like the incremental assignment problem, maximum subset matching problem, maximum-wei

APA, Harvard, Vancouver, ISO, and other styles

7

Brown, Eric L. "A quadratic partial assignment and packing model and algorithm for the airline gate assignment problem." Thesis, This resource online, 1995. http://scholar.lib.vt.edu/theses/available/etd-07212009-040541/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Maach, Fouad. "Bi-objective multi-assignment capacitated location-allocation problem." Thesis, Virginia Tech, 2006. http://hdl.handle.net/10919/31558.

Full text

Abstract:

Optimization problems of location-assignment correspond to a wide range of real situations, such as factory network design. However most of the previous works seek in most cases at minimizing a cost function. Traffic incidents routinely impact the performance and the safety of the supply. These incidents can not be totally avoided and must be regarded. A way to consider these incidents is to design a network on which multiple assignments are performed. <p> Precisely, the problem we focus on deals with power supplying that has become a more and more complex and crucial question. Many internatio

APA, Harvard, Vancouver, ISO, and other styles

9

Macdonald, Edward A. "Multi-robot assignment and formation control." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/41200.

Full text

Abstract:

Our research focuses on one of the more fundamental issues in multi-agent, mobile robotics: the formation control problem. The idea is to create controllers that cause robots to move into a predefined formation shape. This is a well studied problem for the scenario in which the robots know in advance to which point in the formation they are assigned. In our case, we assume this information is not given in advance, but must be determined dynamically. This thesis presents an algorithm that can be used by a network of mobile robots to simultaneously determine efficient robot assignments and forma

APA, Harvard, Vancouver, ISO, and other styles

10

Karabulut, Ozlem. "Multi Resource Agent Bottleneck Generalized Assignment Problem." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12611790/index.pdf.

Full text

Abstract:

In this thesis, we consider the Multi Resource Agent Bottleneck Generalized Assignment Problem. We aim to minimize the maximum load over all agents. We study the Linear Programming (LP) relaxation of the problem. We use the optimal LP relaxation solutions in our Branch and Bound algorithm while defining lower and upper bounds and branching schemes. We find that our Branch and Bound algorithm returns optimal solutions to the problems with up to 60 jobs when the number of agents is 5, and up to 30 jobs when the number of agents is 10, in less than 20 minutes. To find approximate solutions, we

APA, Harvard, Vancouver, ISO, and other styles

11

Woodcock, Andrew John. "Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm." Thesis, Loughborough University, 2007. https://dspace.lboro.ac.uk/2134/17881.

Full text

Abstract:

The research reported in this thesis considers the classical combinatorial optimization problem known as the Generalized Assignment Problem (GAP). Since the mid 1970's researchers have been developing solution approaches for this particular type of problem due to its importance both in practical and theoretical terms. Early attempts at solving GAP tended to use exact integer programming techniques such as Branch and Bound. Although these tended to be reasonably successful on small problem instances they struggle to cope with the increase in computational effort required to solve larger instanc

APA, Harvard, Vancouver, ISO, and other styles

12

Dhamankar, Sunil Yashwant. "An efficient group-theoretic algorithm for an assignment problem with a single knapsack constraint." Case Western Reserve University School of Graduate Studies / OhioLINK, 1991. http://rave.ohiolink.edu/etdc/view?acc_num=case1055344390.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Hillblom, Jonathan. "Evaluating Different Genetic Algorithms for a State-machine Combining Assignment Problem." Thesis, Karlstads universitet, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-79019.

Full text

Abstract:

Deep packet inspection (DPI) is useful as a tool for analyzing internet traffic. Regular expressions (regexps) can be used to detect the network traffic patterns that the DPI is able to identify. These regexps can be represented as state-machines, and sometimes combining smaller state-machines into larger state-machines can result in more efficient processing. This thesis looks at how to decide which state-machines used in DPI-classes should be combined with which other state-machines in an efficient manner using genetic algorithms. The goal being to create as few resulting state-machines from

APA, Harvard, Vancouver, ISO, and other styles

14

Mahajan, Rutvij Sanjay. "Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/96725.

Full text

Abstract:

The k–server problem is of significant importance to the theoretical computer science and the operations research community. In this problem, we are given k servers, their initial locations and a sequence of n requests that arrive one at a time. All these locations are points from some metric space and the cost of serving a request is given by the distance between the location of the request and the current location of the server selected to process the request. We must immediately process the request by moving a server to the request location. The objective in this problem is to minimize the

APA, Harvard, Vancouver, ISO, and other styles

15

Rizvanoglu, Emre. "Intelligent Search And Algorithms For Optimal Assignment Of Air Force Resources In Operations." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12610154/index.pdf.

Full text

Abstract:

The growing extent and variety of present military operations forces to use the resources in hand at its best. Especially, the optimum usage and assignment of limited number of the air force resources to missions will provide a considerable advantage in the battle field. The problem of finding the feasible and optimum assignment has been known to be studied<br>yet performing the process faster is still a topic that captures researchers&rsquo<br>attention because of the computational complexity that the assignment problem involves within. In this thesis, exploring the optimal assignment of flee

APA, Harvard, Vancouver, ISO, and other styles

16

Connolly, David T. "Solution techniques for the Quadratic Assignment Problem and the development of a general purpose simulated annealing algorithm." Thesis, London School of Economics and Political Science (University of London), 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.321747.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Bin, Hussin Mohamed Saifullah. "Stochastic local search algorithms for single and bi-objective quadratic assignment problems." Doctoral thesis, Universite Libre de Bruxelles, 2015. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/222286.

Full text

Abstract:

The study of Stochastic Local Search (SLS) algorithms is becoming more pivotal these days, due to their vast number of applications in decision making. Prior to the implementation of algorithmic knowledge for decision making, many decisions were made based on manual calculation, on the fly, or even based on guts feeling. Nowadays, such an approach is more rarely seen, especially when the decisions that need to be made are high-risk, cost intensive, or time-consuming. The increasingly often used SLS algorithms are one of the options available to assist the decision making process these days.The

APA, Harvard, Vancouver, ISO, and other styles

18

Lundquist, Josefin, and Linnéa O'Hara. "An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

Full text

Abstract:

A key challenge for manufacturing companies is to store parts in an efficient way atthe lowest cost possible. As the demand of differentiated products increases, togetherwith the fact that old products are not phased out at the same pace, the need of usingstorage space as dynamically as possible becomes vital.Scania’s engine assembly manufactures engines for various automotive vehicles andmarine & industry applications. The variation in engine range in Scania’s offeringleads to the need of holding a vast, and increasing, assortment of parts in the produc-tion. As a consequence, this puts m

APA, Harvard, Vancouver, ISO, and other styles

19

Raduan, Auro Castiglia. "Roteirização parcialmente dinâmica aplicada a serviços de campo." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/3/3148/tde-13082010-160605/.

Full text

Abstract:

A Roteirização de Veículos desempenha papel fundamental nos processos modernos de distribuição de produtos e realização de serviços. A atual disseminação de recursos de tecnologia de informação e comunicação, de forma confiável e economicamente acessível, permite trabalhar com informações em tempo real e melhoram os padrões de nível de serviço associados. O presente trabalho apresenta uma solução para roteirização de veículos cujas equipes de bordo realizam serviços que justificam seu deslocamento, uma vez que as demandas estão geograficamente dispersas. Tais demandas são, em parte, conhecidas

APA, Harvard, Vancouver, ISO, and other styles

20

Klann, Dirk. "The Role of Information Technology in the Airport Business: A Retail-Weighted Resource Management Approach for Capacity-Constrained Airports." Thesis, Cranfield University, 2009. http://hdl.handle.net/1826/4474.

Full text

Abstract:

Much research has been undertaken to gain insight into business alignment of IT. This alignment basically aims to improve a firm’s performance by an improved harmonization of the business function and the IT function within a firm. The thesis discusses previous approaches and constructs an overall framework, which a potential approach needs to fit in. Being in a highly regulated industry, for airports there is little space left to increase revenues. However, the retailing business has proven to be an area that may contribute towards higher income for airport operators. Consequently, airport ma

APA, Harvard, Vancouver, ISO, and other styles

21

Rodrigues, Félix Carvalho. "Smoothed analysis in Nash equilibria and the Price of Anarchy." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2012. http://hdl.handle.net/10183/54866.

Full text

Abstract:

São analisados nesta dissertação problemas em teoria dos jogos, com enfoque no efeito que perturbações acarretam em jogos. A análise suavizada (smoothed analysis) é utilizada para tal análise, e dois tipos de jogos são o foco principal desta dissertação, jogos bimatrizes e o problema de atribuição de tráfego (Traffic Assignment Problem.) O algoritmo de Lemke-Howson é um método utilizado amplamente para computar um equilíbrio Nash de jogos bimatrizes. Esse problema é PPAD-completo (Polynomial Parity Arguments on Directed graphs), e existem instâncias em que um tempo exponencial é necessário par

APA, Harvard, Vancouver, ISO, and other styles

22

Hollayová, Nela. "Optimalizace logistického a obchodního procesu firmy Bookretail s.r.o." Master's thesis, Vysoká škola ekonomická v Praze, 2013. http://www.nusl.cz/ntk/nusl-194715.

Full text

Abstract:

The subject of the thesis is the optimization of one the key processes in a book company, namely warehouse logistics. This problem consist of two parts; first part focuses on route optimization of completion of customers' orders on daily basis, second part focuses on assigning of storage subsystems and their interconnection. The proposed solution uses a traveller salesman problem implemented into intranet application. Second problem was designed as quadratic assignment problem with use of ex post data analysis. On the basis of achieved results, we presented effective procedures for solving bot

APA, Harvard, Vancouver, ISO, and other styles

23

Silva, Ana Cristina Girao e. "Busca heur?stica atrav?s de algoritmo gen?tico e mem?tico com constru??o de voc?bulos para o problema de atribui??o de localidades a an?is Sonet." Universidade Federal do Rio Grande do Norte, 2008. http://repositorio.ufrn.br:8080/jspui/handle/123456789/14914.

Full text

Abstract:

Made available in DSpace on 2014-12-17T14:52:43Z (GMT). No. of bitstreams: 1 AnaCGS.pdf: 4192359 bytes, checksum: 28eb36354363672f88a28074f9df8b42 (MD5) Previous issue date: 2008-12-23<br>Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior<br>Telecommunications play a key role in contemporary society. However, as new technologies are put into the market, it also grows the demanding for new products and services that depend on the offered infrastructure, making the problems of planning telecommunications networks, despite the advances in technology, increasingly larger and complex. Ho

APA, Harvard, Vancouver, ISO, and other styles

24

Bashir, Bushra. "Contribution to modeling and optimization of home healthcare." Thesis, Clermont-Ferrand 2, 2013. http://www.theses.fr/2013CLF22391/document.

Full text

Abstract:

Résumé indisponible<br>A healthcare network or health system consists of all organizations, actions and people who participate to promote, restore or maintain people’s health. The health care systems in many developed countries are facing increasing costs. The major reason is the changing age distribution of the population with more elderly people in need of support. Increasing healthcare costs has created new alternatives to traditional hospitalization in which one is Home Health Care (HHC). Home health care or domiciliary care is the provision of health care and assistance to people in their

APA, Harvard, Vancouver, ISO, and other styles

25

Olšarová, Nela. "Inference propojení komponent." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236505.

Full text

Abstract:

The Master Thesis deals with the design of hardware component interconnection inference algorithm that is supposed to be used in the FPGA schema editor that was integrated into educational integrated development environment VLAM IDE. The aim of the algorithm is to support user by finding an optimal interconnection of two given components. The editor and the development environment are implemented as an Eclipse plugin using GMF framework. A brief description of this technologies and the embedded systems design are followed by the design of the inference algorithm. This problem is a topic of com

APA, Harvard, Vancouver, ISO, and other styles

26

"Parallel asynchronous Hungarian methods for the assignment problem." Massachusetts Institute of Technology, Laboratory for Information and Decision Systems, 1990. http://hdl.handle.net/1721.1/3220.

Full text

Abstract:

by Dimitri P. Bertsekas and David A. Castañon.<br>Cover title.<br>Includes bibliographical references (p. 24-25).<br>Research supported in part by the BM/C3 Technology branch of the United States Army Strategic Defense Command.

APA, Harvard, Vancouver, ISO, and other styles

27

"An algorithm for multi-objective assignment problem." 2005. http://library.cuhk.edu.hk/record=b5892626.

Full text

Abstract:

Tse Hok Man.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2005.<br>Includes bibliographical references (leaves 68-69).<br>Abstracts in English and Chinese.<br>Abstract --- p.i<br>Acknowledgement --- p.iii<br>Chapter 1 --- Introduction --- p.1<br>Chapter 2 --- Background Study --- p.4<br>Chapter 2.1 --- Channel Assignment in Multicarrier CDMA Systems --- p.4<br>Chapter 2.1.1 --- Channel Throughput --- p.5<br>Chapter 2.1.2 --- Greedy Approach to Channel Assignment --- p.6<br>Chapter 2.2 --- Generalised Assignment Problem --- p.7<br>Chapter 2.2.1 --- Branch and Bound Approach for

APA, Harvard, Vancouver, ISO, and other styles

28

江育夫. "Applying genetic algorithm to correlated storage assignment problem." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/14769868043774171420.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Weng, Yu-Chi, and 翁毓婍. "Solving the Storage assignment problem by Genetic Algorithm." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/49c233.

Full text

Abstract:

碩士<br>淡江大學<br>資訊管理學系碩士班<br>105<br>Picking operation is one of the major operating costs of a distribution center, and the proper assignment of storages to stocks is critical to the improvement of picking efficiency.　Appropriate storage assignments can also shorten storing time, improve storage utilization, and facilitate inventory management. The purpose of this study is to propose a storage location assignment method to reduce the cost of storage operations and improve the efficiency of picking operations. The storage assignment problem can be modeled as a quadratic assignment problem（QAP）, w

APA, Harvard, Vancouver, ISO, and other styles

30

"QuickMatch--a very fast algorithm for the assignment problem." Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/2460.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

"A greedy genetic algorithm for the quadratic assignment problem." Sloan School of Management, Massachusetts Institute of Technology], 1995. http://hdl.handle.net/1721.1/2579.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Douglas, Allison M. "A modified greedy algorithm for the task assignment problem." 2007. http://etd.louisville.edu/data/UofL0344t2007.pdf.

Full text

Abstract:

Thesis (M.Eng.)--University of Louisville, 2007.<br>Title and description from thesis home page (viewed December 14, 2007). Department of Industrial Engineering. Vita. "June 2007." Includes bibliographical references (p. 35).

APA, Harvard, Vancouver, ISO, and other styles

33

pai, jia-yan, and 白佳艷. "Hybrid Genetic Heuristic Algorithm for The Generalized Assignment Problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/95455584160207097106.

Full text

Abstract:

碩士<br>明志科技大學<br>工業管理研究所<br>97<br>The Generalized Assignment Problem (GAP) combines limited resource capacity and multi-dimensional knapsack problems to construct a combinatorial optimization problem; and it has extensive application in the areas of resource scheduling, factory selection, vehicle routing problem, etc. Capacity utilization has been used as an important indicator for effective allocation of limited resources to ensure that the total cost of all possible combinations can be minimized. The GAP assumes that each job is assign to one and only one agent (machine), but each agent may s

APA, Harvard, Vancouver, ISO, and other styles

34

Yeh, Wei-sin, and 葉偉欣. "A Study on Channel Assignment Problem Using Genetic Algorithm." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/37079388642355043684.

Full text

Abstract:

碩士<br>國立臺北科技大學<br>電機工程系碩士班<br>92<br>There is a large and growing demand for the many services that rely on the radio spectrum. However, the radio spectrum is a limited resource and cannot easily accommodate all these interests, so it becomes important to use radio spectrum more efficiently. There are three interferences will occur if two channels are closely geographically. Channel assignment problem is to assign as much channels as possible in several cells such that no interference occurs. Channel assignment problem can be reduced to graph coloring problem, so it means channel ass

APA, Harvard, Vancouver, ISO, and other styles

35

Chen, Yu-Chun, and 陳鈺純. "A heuristic algorithm to the general shift assignment scheduling problem." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/65p73x.

Full text

Abstract:

碩士<br>國立臺北科技大學<br>經營管理系碩士班<br>102<br>Recent financial crisis has caused business reduction of many companies substantially. In order to satisfy seasonal and cyclical demands of products and services, many companies chose to let employee work overtime to reduce labor costs. As a result, employee frequently perished from overworking. In addition, some companies allocate works by employee preference whereby the human resources were not fully utilized. This, in turn, has caused the problem of staff surplus. Therefore, it is important to properly conduct the staff scheduling to improve service and

APA, Harvard, Vancouver, ISO, and other styles

36

Hsieh, Bai-Han, and 謝百翰. "An Algorithm for Solving Fuzzy Axial Three-Dimensional Assignment Problem." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/00791446763366920557.

Full text

Abstract:

碩士<br>國立清華大學<br>工業工程與工程管理學系<br>102<br>Fuzzy axial three-dimensional assignment problem is an extension of axial three-dimensional assignment problems. In this situation, when the assignment cost is fuzzied, we cannot use the traditional algorithms for solving axial three-dimensional assignment problems to solve the variant assignment problem. In reviewing the literatures, we find out that the B&B algorithm is a suitable way to find the exact solution of this kind of problem. However, the existing B&B algorithm has low efficiency as the complete enumerational procedure. For this reason, we prop

APA, Harvard, Vancouver, ISO, and other styles

37

"The auction algorithm : a distributed relaxation method for the assignment problem." Laboratory for Information and Decision Systems, Massachusetts Institute of Technology], 1987. http://hdl.handle.net/1721.1/2982.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Wu, Jhih-Sian, and 吳志賢. "Using Multiple Trajectory Search Algorithm to Solve the Quadratic Assignment Problem." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/47771837986071183720.

Full text

Abstract:

碩士<br>國立中興大學<br>資訊科學與工程學系所<br>98<br>The quadratic assignment problem (QAP) is one of the NP-hard problems. It is a well-known combinatorial optimization problem. There are many practical problems that can be formulated as the QAP, for example, problems dealing with typewriter keyboard design, school and hospital layout design and scheduling. In this thesis, we propose a new method called the multiple trajectory search(MTS) algorithm to solve the quadratic assignment problem. Observing the weak points of some algorithms published in the literature, we developed our algorithm with followin

APA, Harvard, Vancouver, ISO, and other styles

39

Chen, Kuei-Hsien, and 陳桂嫻. "Preemptive Goal Evolutionary Algorithm on the Operations Assignment Problem for 4PL." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/85397519170332656112.

Full text

Abstract:

博士<br>雲林科技大學<br>工業工程博士班<br>97<br>Globalization has increased the competition many businesses face. In order to satisfy customer demand and provide high levels of service, enterprises tend to outsource their non-core business, such as logistics operations, to professional logistics service providers. Such services are called 3PL (third-party logistics). However, traditional 3PL providers only offer logistic operations related to physical transportation, and cannot effectively integrate supply chain resources. 3PL can no longer satisfy customer demand under such circumstances, and 4PL (fourth-pa

APA, Harvard, Vancouver, ISO, and other styles

40

Chan, Ping-Huang, and 詹炳煌. "A Complete Branch-and-Bound Algorithm for Task Assignment Problem with Precedence." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/98625931292097546507.

Full text

Abstract:

碩士<br>大同工學院<br>資訊工程學系<br>84<br>In a distributed processing system with the application task partitioned into a set of program modules, assignment of those modules to processors is an important aspect of study. We investigate the problem of finding an optimal assignment of task modules, whose structure can be expressed as acyclic graph and thus has precedence relationship, over processors in a distributed system. The purpose of finding an optimal assignment is to minimize the task tu

APA, Harvard, Vancouver, ISO, and other styles

41

Casanova, Lionel Francisco Gonzalez, and 雷中仁. "An Ant Colony Optimization Algorithm for the Multi-Objective Gate Assignment Problem." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/05156799773227369590.

Full text

Abstract:

碩士<br>元智大學<br>工業工程與管理學系<br>99<br>In this research, the Gate Assignment Problem (GAP) is considered with reference to two objectives. The first objective is to minimize total walking distance of passengers to departure gates, check-in counters, and connection flights. The second one is to minimize number of flights assigned to the apron. Essentially, the GAP seeks the optimal flight-to-gate assignments so that total passenger walking distances and consequent connection times are minimized. A weighted sum of two objectives to the GAP is used by adding a penalty to flights assigned to the apron.

APA, Harvard, Vancouver, ISO, and other styles

42

Lin, Meng-Jhen, and 林孟蓁. "An Efficient Assignment Sequence Algorithm for the Multi-Stage Shelf Allocation Problem." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/31221889005338801184.

Full text

Abstract:

碩士<br>元智大學<br>工業工程與管理學系<br>95<br>Shelf allocation is one of the most important issues in retailing business, because different displaying strategies can directly impact customers’ purchasing decision. In most previous researches, items are allocated into shelf space according to their item similarity only, so that items in the same categories (or sub-categories) might be assigned in very different shelf. However, in practical retailing environment, items with the same category and sub-category should be allocated into adjacent shelf space. In addition, several researchers develop different heu

APA, Harvard, Vancouver, ISO, and other styles

43

Liu, Te-yu, and 劉得佑. "Distributed Heuristic Algorithm for the Weapon Target Assignment Problem in Unreliable Networks." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/67h3e3.

Full text

Abstract:

碩士<br>國立交通大學<br>網路工程研究所<br>105<br>All the decisions on the battlefield must be very fast. To find the best decision in a short time, usually place cluster architectures in the decision center to reduce the calculation time. However, when we put the computing resources in the same place, it will be attacked easily. In order to solve the problem of being attacked easily, we distribute computing units to various weapon to form a distributed system. But when weapons were moving or communications equipment was destroyed by enemies, the communication will be very unstable. The distributed system is

APA, Harvard, Vancouver, ISO, and other styles

44

Chen, Yi-Fan, and 陳奕帆. "The Application of Genetic Algorithm for the Flowshop Worker Assignment Scheduling Problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/h7d36z.

Full text

Abstract:

碩士<br>國立虎尾科技大學<br>工業工程與管理研究所<br>97<br>Many different kinds of scheduling work are widely used both in the manufacturing and service field, the common purpose is how to effectively assign those available sources (machine, equipment, worker, etc.) to maximize the efficiency of related operations and the utilization of those resources. In this research, the focus will be put at the flowshop worker assignment scheduling problem and the purpose is to investigate how to assign the jobs that are waited for processing and those available workers to workstations to minimize the performance measure of

APA, Harvard, Vancouver, ISO, and other styles

45

MISHRA, JYOTI, and UJJWAL KAUSHIK. "AIRLINE PLANNING AND SCHEDULING." Thesis, 2023. http://dspace.dtu.ac.in:8080/jspui/handle/repository/19959.

Full text

Abstract:

Efficient crew scheduling plays a vital role in ensuring smooth operations and optimal resource utilization within the airline industry. This report presents a comprehensive analysis of crew scheduling using the Hungarian method, a powerful technique derived from operations research. The objective of this study is to develop a systematic approach for assigning crew members to flights, considering various constraints such as crew availability, qualifications, and legal regulations. The report begins by providing an overview of the crew scheduling problem, emphasizing its complexity due

APA, Harvard, Vancouver, ISO, and other styles

46

Ahuja, Ravindra K., Arvind Kumar, Krishna Jha, and James B. Orlin. "Exact and Heuristic Methods for the Weapon Target Assignment Problem." 2004. http://hdl.handle.net/1721.1/5063.

Full text

Abstract:

The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-complete. There do not exist any exact methods for the WTA problem which can solve even small size problems (for example, with 20 weapons and 20 targets). Though several heuristic methods have been proposed

APA, Harvard, Vancouver, ISO, and other styles

47

Wang, Tzu-Chia, and 王子夏. "Comparison of Genetic Algorithm and Particle Swarm Optimization for the Course Assignment Problem." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/pbaszg.

Full text

Abstract:

碩士<br>崑山科技大學<br>資訊管理研究所<br>96<br>Particle Swarm Optimization (PSO) is a popular optimize search method that inspire by the swarming of biological populations in recent years. PSO is similar to the Genetic Algorithm (GA) in the sense that both are population-based search method. Since the two methods are supposed to find a solution to given objective function but employ different procedure and computational effort, it’s appropriate to compare their implementation. The disadvantage of the GA is its expensive computational cost. This paper attempts to examine that PSO has the same efficiency as t

APA, Harvard, Vancouver, ISO, and other styles

48

張明洲. "Application of Genetic Algorithm in the storage Assignment Problem of a Distribution Center." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/59912978549368572723.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>工業管理系<br>88<br>Abstract: Order picking is one of the costly activities in the operations of a distribution center. In order to reduce the picking cost, we can assign the items to the storage locations optimally. This paper proposes a method improving the efficiency for picking operations through storage allocation planning. The target is to minimize picking distance. We get the solution by genetic algorithm, Because it can avoid trapping into local minimum.

APA, Harvard, Vancouver, ISO, and other styles

49

Hsu, Chia-Chun, and 徐嘉駿. "A Genetic Algorithm for Maximum Edge-Disjoint Paths Problem and Its Extension to Routing and Wavelength Assignment Problem." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/91113793454916747595.

Full text

Abstract:

博士<br>國立交通大學<br>運輸與物流管理學系<br>102<br>Optimization problems concerning edge-disjoint paths in a given graph have attracted considerable attention for decades. Lots of applications can be found in the areas of call admission control, real-time communication, VLSI (Very-large-scale integration) layout and reconfiguration, packing, etc. The optimization problem that seems to lie in the heart of these problems is the maximum edge-disjoint paths problem (MEDP), which is NP-hard. In this dissertation, we developed a novel genetic algorithm (GA) for handling the problem. The proposed method is compare

APA, Harvard, Vancouver, ISO, and other styles

50

Yao, Qingzhu. "Birnbaum Importance Patterns and Their Applications in the Component Assignment Problem." 2011. http://trace.tennessee.edu/utk_graddiss/1043.

Full text

Abstract:

The Birnbaum importance (BI) is a well-known measure that evaluates the relative contribution of components to system reliability. It has been successfully applied to tackling some reliability problems. This dissertation investigates two topics related to the BI in the reliability field: the patterns of component BIs and the BI-based heuristics and meta-heuristics for solving the component assignment problem (CAP).There exist certain patterns of component BIs (i.e., the relative order of the BI values to the individual components) for linear consecutive-k-out-of-n (Lin/Con/k/n) systems when al

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!