Log in

Relevant bibliographies by topics / Solve of problem / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Solve of problem.

Dissertations / Theses on the topic 'Solve of problem'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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 'Solve of 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

Whitford, Angela Tracy. "Heuristic approaches to solve the frequency assignment problem." Thesis, Goldsmiths College (University of London), 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.321956.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Vazquez, ortiz Karla Esmeralda. "Advanced methods to solve the maximum parsimony problem." Thesis, Angers, 2016. http://www.theses.fr/2016ANGE0015/document.

Full text

Abstract:

La reconstruction phylogénétique est considérée comme un élément central de divers domaines comme l’écologie, la biologie et la physiologie moléculaire pour lesquels les relations généalogiques entre séquences d’espèces ou de gènes, représentées sous forme d’arbres, peuvent apporter des éclairages significatifs à la compréhension de phénomènes biologiques. Le problème de Maximum de Parcimonie est une approche importante pour résoudre la reconstruction phylogénétique en se basant sur un critère d’optimalité pour lequel l’arbre comprenant le moins de mutations est préféré. Dans cette thèse nous

APA, Harvard, Vancouver, ISO, and other styles

3

Venkata, Narasimha Koushik Srinath. "Ant Colony Optimization Technique to Solve Min-Max MultiDepot Vehicle Routing Problem." University of Cincinnati / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1324399082.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chio, Chou Hei. "Apply algorithm of changes to solve traveling salesman problem." Thesis, University of Macau, 2011. http://umaclib3.umac.mo/record=b2550556.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Rowley, Joel. "Using constraint programming to solve a sports scheduling problem /." Leeds : University of Leeds, School of Computer Studies, 2008. http://www.comp.leeds.ac.uk/fyproj/reports/0708/Rowley.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Archibald, Garry Alexander. "Gibraltar : attempts to solve an international problem, 1964-2002." Thesis, University of Ulster, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445229.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Balavendran, Joseph Rani Deepika. "Gamification to Solve a Mapping Problem in Electrical Engineering." Thesis, University of North Texas, 2020. https://digital.library.unt.edu/ark:/67531/metadc1703330/.

Full text

Abstract:

Coarse-Grained Reconfigurable Architectures (CGRAs) are promising in developing high performance low-power portable applications. In this research, we crowdsource a mapping problem using gamification to harnass human intelligence. A scientific puzzle game, Untangled, was developed to solve a mapping problem by encapsulating architectural characteristics. The primary motive of this research is to draw insights from the mapping solutions of players who possess innate abilities like decision-making, creative problem-solving, recognizing patterns, and learning from experience. In this dissertation

APA, Harvard, Vancouver, ISO, and other styles

8

Chavan, Harish Dnyandeo. "A Heuristic Approach to Solve Air Taxi Scheduling Problem." Thesis, Virginia Tech, 2003. http://hdl.handle.net/10919/9840.

Full text

Abstract:

All passengers travel at the hour most convenient to them. But it is not always possible to find a flight at the right time to fly them to their destination. In the case where service in any one time period is insufficient to meet air travel demanded, it may be expected that some unfilled demand passengers will either delay their flight or will advance it, thus adding to the effective demand of the adjoining time periods.The obvious alternate means of travel is a rental car. It takes a lot more time than flight, but it is readily available at any given time. This brings us to think of an airli

APA, Harvard, Vancouver, ISO, and other styles

9

Lakshmanan, Muthukumar S. "Using effective information searching skills to solve problems." Phd thesis, Australia : Macquarie University, 2009. http://hdl.handle.net/1959.14/42606.

Full text

Abstract:

"2008".<br>Thesis (PhD)--Macquarie University, Australian Centre for Educational Studies, School of Education, 2009.<br>Bibliography: p. 268-283.<br>Introduction -- Review of the literature -- Methods and procedures -- Pre-intervention qualitative data analysis & discussion of findings -- Intervention -- Post-intervention qualitative data analysis & discussions of findings -- Post-intervention quantitative data analysis & discussions of findings -- Conclusions.<br>Problem-based learning (PBL) is an instructional approach that is organized around the investigation and resolution of problems. Pr

APA, Harvard, Vancouver, ISO, and other styles

10

KHAN, Muhammad Umair. "Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem." Thesis, Högskolan Dalarna, Datateknik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4910.

Full text

Abstract:

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have

APA, Harvard, Vancouver, ISO, and other styles

11

Shuaib, Mohannad Abdelrahman. "AN ALGORITHM TO SOLVE THE ASSOCIATIVE PARALLEL MACHINE SCHEDULING PROBLEM." UKnowledge, 2009. http://uknowledge.uky.edu/gradschool_theses/612.

Full text

Abstract:

Effective production scheduling is essential for improved performance. Scheduling strategies for various shop configurations and performance criteria have been widely studied. Scheduling in parallel machines (PM) is one among the many scheduling problems that has received considerable attention in the literature. An even more complex scheduling problem arises when there are several PM families and jobs are capable of being processed in more than one such family. This research addresses such a situation, which is defined as an Associative Parallel Machine scheduling (APMS) problem. This researc

APA, Harvard, Vancouver, ISO, and other styles

12

Dewaal, Nicholas. "The Importance of the Riemann-Hilbert Problem to Solve a Class of Optimal Control Problems." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1759.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Araujo, Luiz Jonatã Pires de. "A hybrid methodology to solve the container loading problem with weight distribution and cutting problems." Universidade de Fortaleza, 2011. http://dspace.unifor.br/handle/tede/88221.

Full text

Abstract:

Made available in DSpace on 2019-03-29T23:27:59Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-09-27<br>Transport of goods has represented an important role in economic development throughout the history and ship containerization brought great advantages. Its invention in mid-1950s brought down the cost of transport and reduced time for loading and unloading cargo. Consequently, it increased efficiency of port working and reduced handling cargo to hours instead of weeks, as before. However, the good use of containerization involves new and specialized logistic process, a number of t

APA, Harvard, Vancouver, ISO, and other styles

14

Biron, David. "The traveling salesman problem : deceptively easy to state; notoriously hard to solve /." Lynchburg, VA : Liberty University, 2006. http://digitalcommons.liberty.edu.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Eberle, Stefan. "A Polynomial Algorithm for a NP-hard to solve Optimization Problem." Diss., lmu, 2009. http://nbn-resolving.de/urn:nbn:de:bvb:19-99427.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Pangarad, Arm. "Applying decomposition methods to solve a stochastic available-to-promise problem." Fairfax, VA : George Mason University, 2008. http://hdl.handle.net/1920/3087.

Full text

Abstract:

Thesis (Ph.D.)--George Mason University, 2008.<br>Vita: p. 104. Thesis director: Karla L. Hoffman. Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Information Technology. Title from PDF t.p. (viewed July 7, 2008). Includes bibliographical references (p. 100-103). Also issued in print.

APA, Harvard, Vancouver, ISO, and other styles

17

Shivram, Prakruthi. "Parallelization of Genetic Algorithm to Solve MAX-3SAT Problem on GPUs." Scholar Commons, 2019. https://scholarcommons.usf.edu/etd/7916.

Full text

Abstract:

There are many combinatorial optimization problems such as flow shop scheduling, quadraticassignment problem, traveling salesman problem, that are computationally intractable. Genetic Algorithm is a heuristic algorithm used to find an answer to combinatorial optimization problems. MAX-3SAT is an example of combinatorial optimization problem which has wide range of applications as many real world problems can be translated to MAX-3SAT problem. Genetic algorithms are suitable to solve MAX-3SAT problems but usually undergo premature convergence. To prevent this convergence and maintain diversity,

APA, Harvard, Vancouver, ISO, and other styles

18

Han, You. "Spectrum Expansion to Solve the Spectrum Scarcity Problem in Vehicular Networks." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1492176091403885.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Browne, Christopher B. "Using interior point methods to solve the multicommodity network flow problem." Thesis, University of Ottawa (Canada), 1993. http://hdl.handle.net/10393/6760.

Full text

Abstract:

This thesis explores applications of Interior Point methods as popularized by Karmarkar (36) for solving Multicommodity Network Flow problems (MCNF). In these problems, several commodities must be shipped between various nodes of a network. The goal is to satisfy the shipping requirements at a minimum cost, while respecting processing capacities on the joint flow of commodities. The thesis presents a unified view of current methods for multicommodity networks, from the early formulations to current work that has involved nonlinear and interior point methods. It compares and contrasts some Inte

APA, Harvard, Vancouver, ISO, and other styles

20

Mahmoud, Mafaz. "“Get a Problem, Solve a Problem”: Vulnerability, Precarity and Vigilantism in Lee Child’s Jack Reacher Novels." Thesis, Malmö universitet, Fakulteten för kultur och samhälle (KS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-23253.

Full text

Abstract:

This paper analyzes how vulnerability is represented in the Jack Reacher series, by drawing onwork by Bryan Turner and Judith Butler. The purpose of the research is to investigate the reasonReacher’s acts of vigilantism are needed. I look at examples of vulnerability and precarity foundin the books Killing Floor and Die Trying, and argue that state neglect is the cause of economicand social vulnerability in the towns Margrave and Yorke, leading to precarity expressed ascriminal money and community subjugation controlling the towns. I conclude that the solutionpresented, through vigilantism, is

APA, Harvard, Vancouver, ISO, and other styles

21

Shaw-Hones, Gayle E. Haslam Elizabeth L. "Learning to solve problems within a pharmaceutical organization : designing problem and story-based constructivist e-learning environments /." Philadelphia, Pa. : Drexel University, 2008. http://hdl.handle.net/1860/2827.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Menna, Luigi. "HOW TO SOLVE IT." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-80655.

Full text

Abstract:

This work is a reflection on the results of an experimentation carried out on secondary school students of between 16 and 18 from various classes. The experimentation aims at identifying the implicit ideas they use when asked to solve a certain mathematical problem. In particular, in giving them these problems an heuristic approach was suggested, and the differences between this and a purely deductive approach were measured. Analyzing the different approaches used by the students and the difficulties they had in distinguishing between argumentative and demonstrative operations has given rise t

APA, Harvard, Vancouver, ISO, and other styles

23

Bauer, Andreas, Bernd Bullnheimer, Richard F. Hartl, and Christine Strauß. "Applying ant colony optimization to solve the single machine total tardiness problem." SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 1999. http://epub.wu.ac.at/1368/1/document.pdf.

Full text

Abstract:

Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem. The paper introduces an Ant Colony Optimization approach to solve the problem of determining a job-sequence that minimizes the overall tardiness for a given set of jobs to be processed on a single, continuously available machine, the Single Machine Total Tardiness Problem. We experiment with various heuristic information as well as with varian

APA, Harvard, Vancouver, ISO, and other styles

24

Sanchez, Miguel Angel. "A fuzzy approach to solve the stereo correspondence problem using phase correlation." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2008. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

MOREIRA, NARA TORRES. "A MIP-BASED APPROACH TO SOLVE A REAL-WORLD SCHOOL TIMETABLING PROBLEM." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2015. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=27073@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>PROGRAMA DE EXCELENCIA ACADEMICA<br>Problemas de geração de grades horárias visam agendar eventos a fim de satisfazer demandas, ao mesmo tempo que satisfazem restrições adicionais. Uma solução é boa se todas as grades horárias resultantes são aceitáveis para todas as pessoas e recursos envolvidos. Para a geração de grades horárias escolares, um número conhecido de aulas, envolvendo estudantes, professores e salas de aula, deve ser agendado ao longo da semana, enquanto limitaçõe

APA, Harvard, Vancouver, ISO, and other styles

26

Poullet, Julie(Julie M. ). "Leveraging machine learning to solve The vehicle Routing Problem with Time Windows." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/127285.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, May, 2020<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 111-125).<br>The Vehicle Routing Problem with Time Windows (VRPTW) has been widely studied in the Operations Research (OR) literature given its increasingly widespread applications, ranging from school bus scheduling to packages delivery. In the last decades, and in large part due to the surge in e-commerce and shortened promised lead times, the scale of the highly constrained VRPTW instance

APA, Harvard, Vancouver, ISO, and other styles

27

Morison, Alexander M. "Perspective Control: Technology to Solve the Multiple Feeds Problem in Sensor Systems." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1281931069.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Adhikari, Shishir Raj. "PLEXAR IMAGING: A STARTUP DETERMINED TO SOLVE THE CT DOSE VARIABILITY PROBLEM." Case Western Reserve University School of Graduate Studies / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=case1374236161.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Liu, Wei-You, and 劉瑋佑. "Using Metahuristic to Solve Vehicle Routing Problem." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/65674302828343183173.

Full text

Abstract:

碩士<br>華梵大學<br>資訊管理學系碩士班<br>98<br>The main issue of transportation route planning in logistics is to enhance efficiency and reduce overall transportation costs. This would increase the value of logistic service. Most previous studies focus on the problem of centralized dispatching network in logistic center, however, only few discuss the internal network within a single company. Furthermore, the problem of non-optimal and vacant vehicle on return trips often occurs in inter-service area cargo transportation. Thus, how to improve internal operating routes under different transportation capacity

APA, Harvard, Vancouver, ISO, and other styles

30

Chu, Cheng-Lin, and 朱政霖. "Digital cable TV's problem and the strategy to solve these problem." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/31529788556274607921.

Full text

Abstract:

碩士<br>國立交通大學<br>經營管理研究所<br>96<br>Telecom and TV industry’s digitization is the trend of global, and it’s our government policy, too. Government Information Office announced digitization project in 2002，but six years passed away, the penetration of digital cable TV is still 2.1%, it represents Taiwan’s digital process is falling behind other country and revealing that we have lots of problems on getting digitization moving. Government Information Office held a forum to discuss the digital cableTV’s problems in 2004, National Communications Commission commissioned Taiwan Institute of Economic R

APA, Harvard, Vancouver, ISO, and other styles

31

Chen), Paul Chen(Chin-Wei, and 陳今偉. "How does Physicalism Solve the Problem of Qualia?" Thesis, 2001. http://ndltd.ncl.edu.tw/handle/74129043016541780628.

Full text

Abstract:

碩士<br>國立中正大學<br>哲學研究所<br>89<br>In our actual world, is everything physical? Can a complete story of physical science explain all these facts? Among these facts, one of the most confusing things is our mental phenomena. It seems that, in our subjective conscious experience, there exists a certain phenomenal character which physical science leaves out, i.e. what it is like to experience something. But, is that true? This is a thesis about some objections to knowledge argument, which are made by physicalists to solve the problem of qualia. Through the discussion of these responses, we

APA, Harvard, Vancouver, ISO, and other styles

32

張簡城. "Using Orienteering Problem (OP) Algorithm to solve Maximum Benefit Chinese Postman Problem (MBCPP)." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/64025991659643348356.

Full text

Abstract:

碩士<br>國立交通大學<br>工業工程與管理系所<br>92<br>The Maximum Benefit Chinese Postman Problem (MBCPP) is a practical generalization of the classical Chinese Postman Problem (CPP), which has many real-world applications. The MBCPP has been shown to be more complex than the Traveling Salesman Problem (TSP), and therefore it is difficult to solve the problem exactly. In this paper, we consider the MBCPP on totally undirected networks. We first present a simple network transformation to convert the MBCPP into the Orienteering Tour Problem (OTP), a well-known network routing problem that has been investigated e

APA, Harvard, Vancouver, ISO, and other styles

33

Reddy, Kamil. "Using mobile agents to solve the distributed buying problem." Thesis, 2002. http://hdl.handle.net/10413/5046.

Full text

Abstract:

This study deals with the Distributed Buying Problem, that is, the problem faced by geographically distributed businesses when it comes to optimising buyer time and global businesses resources. It adopts a software agent-based approach to the problem. A literature survey was carried out to review the relatively new field of software agents and mobile agents in particular. The role of agents in electronic commerce was also studied. A mobile agent system was then designed and implemented to serve as a proof-ofconcept system for an agent-based solution to the problem. The design and implementatio

APA, Harvard, Vancouver, ISO, and other styles

34

Hong, Yau-Loong. "Using Triscanning Algorithm to Solve the Traveling Salesman Problem." 2005. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0006-0808200523163500.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Wu, Deren, and 武德仁. "Using P2P Technique to Solve Client-Server Overloading Problem." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/30854756273644426127.

Full text

Abstract:

碩士<br>義守大學<br>資訊工程學系碩士班<br>94<br>Since the technology of the network incessantly progressed, the Internet can supply many different Multi-media services like e-Learning, Blog, On-Line games, and becomes a part of daily life. The main architecture of the present services provided by the Internet is a kind of client-server infrastructure. It means the most services is supported by the servers. Generally, the load of each server is not the same, overloading maybe happened on some servers, especially when many users simultaneously use heavy resource consuming services. This situation will reduce t

APA, Harvard, Vancouver, ISO, and other styles

36

Wen, Kuo-Cheng, and 溫國政. "Improving Particle Swarm Optimization to Solve the Knapsack Problem." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/10473525289852572659.

Full text

Abstract:

碩士<br>中原大學<br>資訊管理研究所<br>96<br>Particle Swarm Optimization (PSO), an algorithm with the concept of swarm intelligence, also a new branch in evolutionary computing, possesses the merits of fast converging, as well as the simplification in parameter setting. Although the standard PSO algorithm and other modified algorithms has attempted to enhance the efficiency in utilizing a swarm to search global best, they still fall in avoiding particles falling into local optima. In this paper, we propose a general idea of acceleration and three kinds of strategies ,we call it Acceleration Particle Swarm O

APA, Harvard, Vancouver, ISO, and other styles

37

Chiu, Yen-Yi, and 邱彥翊. "Using TRIZ to Solve the Problem of Universal Design." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/81439545293429390302.

Full text

Abstract:

碩士<br>大同大學<br>工業設計學系(所)<br>101<br>Universal Design is a method that often assessed by industrial designers in Product Design. very important principle,and it is emphasized that will be able to use by more designers. This method used according to "Improvements PPP Authentication Type Scale Evaluation" to find user's requirement in Product Design, but it lack of some objective ways to solve user's problem. According to TRIZ principle of innovation theory, it provides 39 engineering parameters, contradiction matrix and 40 kinds of rules to study some ways of settlement which are several

APA, Harvard, Vancouver, ISO, and other styles

38

Yang, Chih-Chieh, and 楊智傑. "The Legal Models to Solve Internet Music Pirate Problem." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/06670156601829307237.

Full text

Abstract:

博士<br>國立臺灣大學<br>國家發展研究所<br>95<br>MP3 appears, in addition, P2P software prevails, cause very great impact to the industry of the music. U.S.A. adjudicated the Napster case promptly in 2001, decide against composite P2P software. Then, generally it is thinked that this problem has already been solved satisfactorily. Otherwise, various kinds of scattering type P2P software out of shape appear in succession actually. Does new-type P2P software break the law? The US Supreme Court assigns the Grokster on June 27 , 2005, new-type P2P software of the judgement will break the law equally. In Taiwan, o

APA, Harvard, Vancouver, ISO, and other styles

39

Hsu, Tung-An, and 許彤安. "Using Simulation to Solve Bike-Sharing Dynamic Reposition Problem." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/h2tkpn.

Full text

Abstract:

碩士<br>國立中央大學<br>工業管理研究所<br>102<br>With the steady urbanization and economic development, the urban transport network links tend intensive. In recent years public-bike sharing system has become internationally popular public programs. Public bike rental system with the previous difference is that membership can quickly rent and easy become membership. Similarly, Public bike rental system location is also different from the previous system in the tourist attractions, but integrated into the urban. Most important thing, public-bike sharing system will be used as people commuting, leisure, conveni

APA, Harvard, Vancouver, ISO, and other styles

40

Hong, Yau-Loong, and 康有龍. "Using Triscanning Algorithm to Solve the Traveling Salesman Problem." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/ftf3m2.

Full text

Abstract:

碩士<br>國立臺北科技大學<br>商業自動化與管理研究所<br>93<br>The Traveling Salesman Problem (TSP) is a classic combinatorial optimization NP-complete problem. The TSP problem is found in salesman routing problem and other domains, computer science, management science and operating research many researchers have tried to solve TSP problem for a long time. The symmetric TSP consists of (n-1)!/2 combination, so it is time consuming to figure out the solution by using the typical mathematic method, like integer programming and branch-and-bound. Therefore, many related algorithms are generated to solve TSP problem. The

APA, Harvard, Vancouver, ISO, and other styles

41

Wu, Po-hsien, and 吳柏賢. "A Heuristic Column Generation to Solve Crew Scheduling Problem." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/12322455538641382507.

Full text

Abstract:

碩士<br>國立中央大學<br>工業管理研究所<br>104<br>This paper is mainly discussing the use of a heuristic column generation to solve crew scheduling problem. In solving crew scheduling problem column generation will divide the problem into master problem and sub problem. The master problem is set covering problem and the sub problem is a resource constraints shortest path problem. We use simplex method to solve master problem. The sub problem is solved by a heuristic which developed on my own. The objective of this paper is preventing the curse of dimensionality. When the problem is large and solving sub probl

APA, Harvard, Vancouver, ISO, and other styles

42

YEN, KANG-WEI, and 顏綱威. "Use Tree Derivation to Solve the Minimum Covering Problem." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/71699578104229778312.

Full text

Abstract:

碩士<br>國立臺南大學<br>應用數學系碩士班<br>102<br>This workconsiders the minimum covering problem by using tree derivation. Carrent methods forsolving the covering problemuse matrix nepresentation. However, using matrix to slove the minimum covering problem needs a lot of storage space . Alternatively, the work sloves the problem by tree diagram which requires less storage space. First, this work presents some rules for simplifying the problems. Sceond,the steps of tree diagram for finding all minimum coverage are proposed. Finally,a numerical example isillustrated to demonstrate the performance.

APA, Harvard, Vancouver, ISO, and other styles

43

Aleixo, Pedro. "Sumol + Compal China – How to solve the distribution problem?" Master's thesis, 2015. http://hdl.handle.net/10362/17385.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Lin, Tzu-Chieh, and 林慈傑. "Using Genetic Algorithms to Solve Quasi-Transportation Problem Modeled Multi-plant Order Allocation Problems." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/93969320388613212985.

Full text

Abstract:

碩士<br>國立臺灣大學<br>工業工程學研究所<br>90<br>The research field of multi-plant order allocation problems are less to present in the past. When a company receives large quantity of orders, it is the important issue of satisfy the requirement under finite production resource. In this research, a model for order allocation which multi-plant can produce a various of product is developed. The objective is to minimize total cost, including operation cost、setup cost、transportation cost and the penalty cost of order delay. And the capacity load in production planning horizon of each plants is also handled. This

APA, Harvard, Vancouver, ISO, and other styles

45

Chen-Hsiang, Feng. "Using XDFA to Solve Linear XPath Expression Stream Retrieval Problem." 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0005-2306200609373400.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Lu, Hong-Ru, and 呂泓儒. "Using Modified BATA to Solve Vehicle Routing Problem with Backhauls." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/97047585815405212640.

Full text

Abstract:

碩士<br>國立交通大學<br>運輸科技與管理學系<br>97<br>Vehicle Routing Problem with Backhauls (VRPB), an extension of the classical Vehicle Routing Problem, is a very complicated NP-Hard problem. The VRPB assumes that all linehaul customers should be visited before any backhaul customer. Successful applications of the VRPB in real-world distribution will improve the performance of logistics in the related industry. Backtracking Adaptive Threshold Accepting (BATA) was first proposed by Tarantilis et al. (2001), which only considers backtracking factor b < 1. In this paper, we proposed a Modified Backtracking Adapt

APA, Harvard, Vancouver, ISO, and other styles

47

Pai, Chien-chih, and 白健志. "Using Grouping Genetic Algorithm to Solve Multi--Traveling Salesmen Problem." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/71924458730653661548.

Full text

Abstract:

碩士<br>南華大學<br>資訊管理學系碩士班<br>99<br>For most enterprises, they encounter the assignment problems for their own sales to visit different customers everyday. In addition, if the visiting sequence could be optimized, it is useful for enterprises to reduce their cost. This condition is actually the form of Multiple Traveling Salesmen Problem (mTSP), which is more complex than the Traveling Salesman Problem (TSP) . Among many approaches could solve the mTSP, this study attempts to use the grouping genetic algorithm (Grouping Genetic Algorithm, GGA) to solve this problem. Previous GGA is able to solve

APA, Harvard, Vancouver, ISO, and other styles

48

HAO, MIAO YEN, and 苗延浩. "An ant algorithm used to solve the Vehicle Routing Problem." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/14552898176838706377.

Full text

Abstract:

碩士<br>聖約翰科技大學<br>電機工程系碩士班<br>94<br>Since man invented the first satellite, searching & positioning and communication have existed around our life. From high-secret national defense industries to traffic scale control GPS (Global Positioning System) played a key role in these works. On the thoughts that how to prevent serious car accidents caused by heavy trucks and cars-stolen, to invent a monitoring system that can positioning, warning in advance, anti-stealing , protection for people and cars becomes a necessary research. In this study, we will develop full-fu

APA, Harvard, Vancouver, ISO, and other styles

49

LIN, YA-PING, and 林雅萍. "Embedding X'eory in ATN system to solve PP attachment problem." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/93210213654288555822.

Full text

Abstract:

碩士<br>國立臺灣大學<br>資訊科學研究所<br>77<br>NTUMT 系統（NATIONAL TAIWAN UNIVERSITY MACHINE TRANSLATION SYSTEM ）志於發展一英翻中自動翻譯系統；本論文是此一計劃下負責剖析英文句子的部份。藉著分析目前國三課本內所有句子，探討語言現象，進而解決目前令人深感頭痛的介系詞片語所屬問題。 ATN （加強轉換網路；AUGMENTED TRANSITION NETWORK）解釋器在英文句子剖析工作崗位上，已近廿年的歷史了；但始終未能達到完美的境地，原因便在於過去學者未能更深入再針對語言的特性，重新評估ATN 架構，進一步找到一個合乎語言現象的完整架構。Ｘ' 理論乃是描述語言特性的學說，此文法架構能有系統地描述出自然語言語法現象。藉著大量的資料分析，我們發現了許多剖析上的問題，其中最為棘手的，便是“介詞所屬問題”，更重要的是，我們發覺在詞首理論的基礎下，這些問題都可在新ATN

APA, Harvard, Vancouver, ISO, and other styles

50

Chen, Hui-Chih, and 陳慧芝. "Using Virus Optimization Algorithm to Solve Tourist Trip Design Problem." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/yey6w4.

Full text

Abstract:

碩士<br>元智大學<br>工業工程與管理學系<br>105<br>Tourist trip design problem belongs to the category of the orienteering problem with time windows. Orienteering problem, unlike the travelling salesman problem, doesn’t need to visit all nodes when considering the time constraint. Moreover, in the orienteering problem with time window, each node is assigned a time window that represents the time interval of a node able to be visited. When the scenario comes to the tour planning, how to let a group of tourists feels satisfied about the tour planned is full of challenge. Different members may have different c

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!