Log in

Relevant bibliographies by topics / Heuristic problem / Dissertations / Theses

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

Dissertations / Theses on the topic 'Heuristic problem'

Author: Grafiati

Published: 28 May 2022

Last updated: 30 July 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 'Heuristic 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

Liogys, Mindaugas. "Heuristic Algorithms for Nurse Rostering Problem." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2013. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130930_092436-21259.

Full text

Abstract:

In the dissertation the nurse rostering problem is investigated. The formulation of the problem is based on real-world data of one of the largest healthcare centers in Lithuania. Most recent publications that tackle the nurse rostering problem and the methods for solving the nurse rostering problem are reviewed, the mathematical formulation of the single objective and the multi-objective nurse rostering problem is presented, the requirements for the roster are described and a new method for solving the single objective and the multi-objective nurse rostering problem is proposed in this dissert

APA, Harvard, Vancouver, ISO, and other styles

2

Keuthen, Ralf. "Heuristic approaches for routing optimisation." Thesis, University of Nottingham, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275960.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chan, Evelyn Yu-San. "Heuristic optimisation for the minimum distance problem." Thesis, Nottingham Trent University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.324569.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hariri, Ahmad. "Heuristic algorithms for the travelling deliveryman problem." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amslaurea.unibo.it/6803/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

McCluskey, T. L. "Experience-driven heuristic acquisition in general problem solvers." Thesis, City University London, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.234449.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kadhem, Dhia. "Heuristic solution approaches to the solid assignment problem." Thesis, University of Essex, 2017. http://repository.essex.ac.uk/20907/.

Full text

Abstract:

The 3-dimensional assignment problem, also known as the Solid Assignment Problem (SAP), is a challenging problem in combinatorial optimisation. While the ordinary or 2-dimensional assignment problem is in the P-class, SAP which is an extension of it, is NP-hard. SAP is the problem of allocating n jobs to n machines in n factories such that exactly one job is allocated to one machine in one factory. The objective is to minimise the total cost of getting these n jobs done. The problem is commonly solved using exact methods of integer programming such as Branch-and-Bound B&B. As it is intractable

APA, Harvard, Vancouver, ISO, and other styles

7

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

8

Buckley, Mark C. "Extroversion and a comparison of two problem-solving heuristics." Virtual Press, 1995. http://liblink.bsu.edu/uhtbin/catkey/941716.

Full text

Abstract:

The purpose of this experiment was to explore the relationship between the "Big Five" personality dimensions, training and problem-solving effectiveness. The second purpose of this study was to explore the effects of training upon the quantity and self-reported quality of solutions generated to ill-structured problems. Subjects generated solutions to a problem and then were trained in either brainstorming or the hierarchical method. Then they were asked to generate additional solutions and rate their solutions. Subjects returned after a month and completed the NEO-FFI and then generated soluti

APA, Harvard, Vancouver, ISO, and other styles

9

Samson, Duncan Alistair. "The heuristic significance of enacted visualisation." Thesis, Rhodes University, 2012. http://hdl.handle.net/10962/d1003434.

Full text

Abstract:

This study is centred on an analysis of pupils' lived experience while engaged in the generalisation of linear sequences/progressions presented in a pictorial context. The study is oriented within the conceptual framework of qualitative research, and is anchored within an interpretive paradigm. A case study methodological strategy was adopted, the research participants being the members of a mixed gender, high ability Grade 9 class of 23 pupils at an independent school in South Africa. The analytical framework is structured around a combination of complementary multiple perspectives provided b

APA, Harvard, Vancouver, ISO, and other styles

10

Bingol, Levent. "A Lagrangian Heuristic for solving a network interdiction problem." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2001. http://handle.dtic.mil/100.2/ADA401595.

Full text

Abstract:

Thesis (M.S. in Operations Research) Naval Postgraduate School, December 2001.<br>Thesis Advisor(s): Wood, R. Kevin. "December 2001." Includes bibliographical references (p. 35-36). Also Available online.

APA, Harvard, Vancouver, ISO, and other styles

11

Sariklis, Dimitrios. "Open Vehicle Routing Problem : description, formulations and heuristic methods." Thesis, London School of Economics and Political Science (University of London), 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265252.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Hussin, Naimah Mohd. "Tabu search based hyper-heuristic for examination timetabling problem." Thesis, University of Nottingham, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423286.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

TAVARES, DIEGO MOAH LOBATO. "EXACT AND HEURISTIC APPROACHES FOR INVENTORY ROUTING PROBLEM VARIANTS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35787@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Esta pesquisa trata de duas variantes do conhecido Problema de Roteirização de Veículos com Estoque (do inglês Inventory Routing Problem – IRP). O problema nasce num contexto de um sistema de Vendor Managed Inventory (VMI) no qual o fornecedor é responsável pela gestão de estoques do cliente. Tal problema é a junção dos problemas de transporte e gestão de estoques, que correspondem aos maiores custos em uma operação logística. Destarte este trabalho apresenta um modelo matemát

APA, Harvard, Vancouver, ISO, and other styles

14

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

15

Sousa, Sandra Isabel Ferreira de. "Heuristic approaches for a flexible job-shop scheduling problem." Master's thesis, Universidade de Aveiro, 2016. http://hdl.handle.net/10773/17578.

Full text

Abstract:

Mestrado em Engenharia e Gestão Industrial<br>Este trabalho aborda um novo tipo de problema de escalonamento que pode ser encontrado em várias aplicações do mundo-real, principalmente na indústria transformadora. Em relação à configuração do shop floor, o problema pode ser classificado como flexible job-shop, onde os trabalhos podem ter diferentes rotas ao longo dos recursos e as suas operações têm um conjunto de recursos onde podem ser realizadas. Outras características de processamento abordadas são: datas possíveis de início, restrições de precedência (entre operações de um mesmo trabalho o

APA, Harvard, Vancouver, ISO, and other styles

16

Nowak, Maciek A. "The Pickup and Delivery Problem with Split Loads." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7223.

Full text

Abstract:

This dissertation focuses on improvements in vehicle routing that can be gained by allowing multiple vehicles to service a common load. We explore how costs can be reduced through the elimination of the constraint that a load must be serviced by only one vehicle. Specifically, we look at the problem of routing vehicles to service loads that have distinct origins and destinations, with no constraint on the amount of a load that a vehicle may service. We call this the Pickup and Delivery Problem with Split Loads (PDPSL). We model this problem as a dynamic program and introduce structural res

APA, Harvard, Vancouver, ISO, and other styles

17

Bartásková, Petra. "Metoda tvorby tras přepravní úlohy." Master's thesis, Vysoká škola ekonomická v Praze, 2010. http://www.nusl.cz/ntk/nusl-75633.

Full text

Abstract:

This thesis is focused on optimizing the routes which are implemented in our country at night. Goods are transporting between designated central cities. It deals with creating cyclic routs, along which the goods should be effectively transported, with the respect of the cost. The instruction how to create these paths represents a heuristic method for generating cyclic paths. The algorithm uses the results provided by model that is based on a search for multiple product chart. The chart contains the minimum number of vehicles that provide transport and individual amount of transported goods. Th

APA, Harvard, Vancouver, ISO, and other styles

18

Wong, Man-on. "The effect of heuristics on mathematical problem solving." [Hong Kong : University of Hong Kong], 1994. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13834265.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Plášková, Pavlína. "Strategické rozhodnutí společnosti Baťa, a.s." Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-3836.

Full text

Abstract:

In this thesis we report several of delivery problems. Here it is mostly describe Vehicle Routing Problem and Split Delivery Problem as suitable methods for the case study of the company Baťa a.s.In this thesis we used one of the most sofisticated software Roadnet Transportation Suite as effective program for distribution and planning routes.Finally we construct analysis as a support to find the optimal solution for the final strategical decision of the company Baťa a.s.

APA, Harvard, Vancouver, ISO, and other styles

20

Kaya, Melike. "A Heuristic Approach For Profit Oriented Disassembly Lot-sizing Problem." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613039/index.pdf.

Full text

Abstract:

In this thesis, we work on adisassembly lot-sizing problem for multiple products with parts commonality,i.e., general product structure. We assume that supply of discarded products is infinite. When a product (or a subassembly) is disassembled, all its immediate child items are obtained,i.e., complete disassembly case.Intermediate and leaf items obtained are demandedbyexternal suppliers or remanufacturers. The maximum possible salesfor each intermediate and leaf item are known.Sales of the intermediate and leaf items are the revenue sources. The discarded products are purchased ata unit purcha

APA, Harvard, Vancouver, ISO, and other styles

21

Eckersley, Michael D. "Explicit heuristic training as a variable in design problem-solving." Virtual Press, 1985. http://liblink.bsu.edu/uhtbin/catkey/438704.

Full text

Abstract:

Purpose of the Investigation. The purpose of this investigation was to determine whether a treatment of design-related heuristics would affect the judged value of student design products. Procedures. Subjects consisted of 38 foundation-level design students at Ball State University, Muncie, Indiana. Following five weeks of basic design instruction, a pretest, constructed to measure design problem-solving performance in relation to two problem-types (a Baseline Problem and a Conceptual Problem), was issued to two groups. Thereafter, a treatment of design-related heuristics was administered to o

APA, Harvard, Vancouver, ISO, and other styles

22

Nagy, Gabor. "Heuristic methods for the many-to-many location-routing problem." Thesis, University of Birmingham, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268969.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Clay, Paul. "The application of heuristic search to the leather-nesting problem." Thesis, Leeds Beckett University, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435609.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Herrington, Hira B. "A Heuristic Evolutionary Method for the Complementary Cell Suppression Problem." NSUWorks, 2015. http://nsuworks.nova.edu/gscis_etd/28.

Full text

Abstract:

Cell suppression is a common method for disclosure avoidance used to protect sensitive information in two-dimensional tables where row and column totals are published along with non-sensitive data. In tables with only positive cell values, cell suppression has been demonstrated to be non-deterministic NP-hard. Therefore, finding more efficient methods for producing low-cost solutions is an area of active research. Genetic algorithms (GA) have shown to be effective in finding good solutions to the cell suppression problem. However, these methods have the shortcoming that they tend to produce a

APA, Harvard, Vancouver, ISO, and other styles

25

Silvestrin, Paulo Vitor. "An efficient heuristic for the multi-compartment vehicle routing problem." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/149656.

Full text

Abstract:

Este trabalho apresenta uma variação do problema de roteamento de veículos que permite o uso de veículos com múltiplos compartimentos. A necessidade de veículos com múltiplos compartimentos surge com frequência em aplicações práticas quando uma série de produtos, que possuem diferentes qualidades ou tipo, precisam ser transportados mas não podem ser misturados. Este problema é chamado na literatura de roteamento de veículos com múltiplos compartimentos (PRVMC). Nós propomos uma heurística busca tabu implementada em uma busca local iterada para resolver este problema. Experimentos foram feitos

APA, Harvard, Vancouver, ISO, and other styles

26

Höck, Barbar Katja. "An examination of heuristic algorithms for the travelling salesman problem." Master's thesis, University of Cape Town, 1988. http://hdl.handle.net/11427/22268.

Full text

Abstract:

The role of heuristics in combinatorial optimization is discussed. Published heuristics for the Travelling Salesman Problem (TSP) were reviewed and morphological boxes were used to develop new heuristics for the TSP. New and published heuristics were programmed for symmetric TSPs where the triangle inequality holds, and were tested on micro computer. The best of the quickest heuristics was the furthest insertion heuristic, finding tours 3 to 9% above the best known solutions (2 minutes for 100 nodes). Better results were found by longer running heuristics, e.g. the cheapest angle heuristic (CC

APA, Harvard, Vancouver, ISO, and other styles

27

Tang, Jiqing. "A Lagrangian heuristic for winner determination problem in combinatorial auctions /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202004%20TANG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Kooli, Anis. "Exact and heuristic methods for resource constrained project scheduling problem." Thesis, Tours, 2012. http://www.theses.fr/2012TOUR4031/document.

Full text

Abstract:

Le problème de gestion de projet à contraintes de ressources est un des problèmesles plus étudiés dans la littérature. Il consiste à planifier des activités soumises à desrelations de précédence, et nécessitant des ressources renouvelables. L’objectif est deminimiser la durée du projet, soit le makespan. Nous étudions le problème de gestion deprojet à contraintes de ressources. Nous nous sommes intéressées à la résolution exactedu problème. Dans la première partie de la thèse, nous élaborons une série de bornesinférieures basées sur le raisonnement énergétique et des formulations mathématiques

APA, Harvard, Vancouver, ISO, and other styles

29

Van, Laarhoven Jon William. "Exact and heuristic algorithms for the Euclidean Steiner tree problem." Diss., University of Iowa, 2010. https://ir.uiowa.edu/etd/755.

Full text

Abstract:

In this thesis, we study the Euclidean Steiner tree problem (ESTP) which arises in the field of combinatorial optimization. The ESTP asks for a network of minimal total edge length spanning a set of given terminal points in Rd with the ability to add auxiliary connecting points (Steiner points) to decrease the overall length of the network. The graph theory literature contains extensive studies of exact, approximation, and heuristic algorithms for ESTP in the plane, but less is known in higher dimensions. The contributions of this thesis include a heuristic algorithm and enhancements to an exa

APA, Harvard, Vancouver, ISO, and other styles

30

Liu, Wen-Hsing. "Tabu search heuristics for the dynamic facility layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2005. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=3973.

Full text

Abstract:

Thesis (M.S.)--West Virginia University, 2005.<br>Title from document title page. Document formatted into pages; contains vii, 88 p. : ill. Includes abstract. Includes bibliographical references (p. 83-88).

APA, Harvard, Vancouver, ISO, and other styles

31

Shang, Jin. "Ant colony heuristics for the dynamic facility layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2002. http://etd.wvu.edu/templates/showETD.cfm?recnum=2579.

Full text

Abstract:

Thesis (M.S.)--West Virginia University, 2002.<br>Title from document title page. Document formatted into pages; contains vii, 76 p. : ill. Includes abstract. Includes bibliographical references (p. 72-76).

APA, Harvard, Vancouver, ISO, and other styles

32

Escobar, Velasquez John Willmer <1980&gt. "Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/5258/1/Escobar_John_tesi.pdf.

Full text

Abstract:

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot. This thesis addresses heuristics algorithms based on the well-know granular search idea introduced by Toth and Vigo (2003) to solve the CLRP and the MDVRP. Extensive computational experiments on bench

APA, Harvard, Vancouver, ISO, and other styles

33

Escobar, Velasquez John Willmer <1980&gt. "Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/5258/.

Full text

Abstract:

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot. This thesis addresses heuristics algorithms based on the well-know granular search idea introduced by Toth and Vigo (2003) to solve the CLRP and the MDVRP. Extensive computational experiments on bench

APA, Harvard, Vancouver, ISO, and other styles

34

Manyatsi, Sanele Mduduzi Innocent. "Investigating some heuristic solutions for the two-dimensional cutting stock problem / S.M. Manyatsi." Thesis, North-West University, 2010. http://hdl.handle.net/10394/4390.

Full text

Abstract:

In this study, the two-dimensional cutting stock problem (2DCSP) is considered. This is a problem that occurs in the cutting of a number of smaller rectangular pieces or items from a set of large stock rectangles. It is assumed that the set of large objects is sufficient to accommodate all the small items. A heuristic procedure is developed to solve the two-dimensional single stock-size cutting stock problem (2DSSSCSP). This is the special case where the large rectangles are all of the same size. The major objective is to minimize waste and the number of stock sheets utilized. The heuristic pr

APA, Harvard, Vancouver, ISO, and other styles

35

Mazi, Abdullah Mazi E. "Combining heuristic and exact approach for the vertex p-centre problem and other related location problems." Thesis, University of Kent, 2010. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.544027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Koo, Wai-yip. "Container loading problem by a multi-stage heuristics approach /." Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19471245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Franc, Zdeněk. "Kapacitní problém listonoše." Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-193813.

Full text

Abstract:

The Capacitated Arc Routing Problem has many applications in real life. The aim of this problem is to minimize the total cost at fulfilment of the requirements of arcs. The Capacitated Arc Routing Problem is an extension of the Chinese Postman Problem, which is a special type of the Vehicle Routing Problems. In this thesis is explained the issue of the Chinese Postman Problem and its extensions at first. Subsequently the applications of mathematical models are illustrated on a model example. However these mathematical models, which are searching the optimal solution, do not use so much in real

APA, Harvard, Vancouver, ISO, and other styles

38

Hakobyan, Artak. "Heuristics for the dynamic facility layout problem with unequal area departments." Morgantown, W. Va. : [West Virginia University Libraries], 2008. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=5699.

Full text

Abstract:

Thesis (Ph. D.)--West Virginia University, 2008.<br>Title from document title page. Document formatted into pages; contains xiii, 109 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 97-103).

APA, Harvard, Vancouver, ISO, and other styles

39

Cinel, Sertac. "Sequential And Parallel Heuristic Algorithms For The Rectilinear Steiner Tree Problem." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607896/index.pdf.

Full text

Abstract:

The Steiner Tree problem is one of the most popular graph problems and has many application areas. The rectilinear version of this problem, introduced by Hanan, has taken special attention since it addresses a fundamental matter in &ldquo<br>Physical Design&rdquo<br>phase of the Very Large Scale Integrated (VLSI) Computer Aided Design (CAD) process. The Rectilinear Steiner Tree Problem asks for a minimum length tree that interconnects a given set of points by only horizontal and vertical line segments, enabling the use of extra points. There are various exact algorithms. However the problem is

APA, Harvard, Vancouver, ISO, and other styles

40

Fowler, Christopher William. "Heuristic performance for the uncapacitated facility location problem with uncertain data." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/30760.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Han, Mengjie. "Heuristic optimization of the p-median problem and population re-distribution." Doctoral thesis, Högskolan Dalarna, Statistik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:du-13255.

Full text

Abstract:

This thesis contributes to the heuristic optimization of the p-median problem and Swedish population redistribution. The p-median model is the most representative model in the location analysis. When facilities are located to a population geographically distributed in Q demand points, the p-median model systematically considers all the demand points such that each demand point will have an effect on the decision of the location. However, a series of questions arise. How do we measure the distances? Does the number of facilities to be located have a strong impact on the result? What scale of

APA, Harvard, Vancouver, ISO, and other styles

42

Hölscher, Anton. "A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem." Thesis, Linköpings universitet, Artificiell intelligens och integrerade datorsystem, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153631.

Full text

Abstract:

This study aims to answer whether a heuristic that trades cycles between the tours in a solution would show good results when trying to solve the Weighted k-Chinese Postman Problem for undirected graphs, of varying size, representing neighbourhoods in Sweden.A tabu search heuristic was implemented with each iteration consisting of giving a cycle from the most expensive tour to the cheapest. The heuristic performed increasingly well for graphs of increasing size, although the solution quality decreased when increasing the number of tours to be used in the solution. It is suspected that the caus

APA, Harvard, Vancouver, ISO, and other styles

43

PEREZ, MIGUEL ANGEL FERNANDEZ. "A HEURISTIC METHOD FOR MULTIOBJECTIVE SCHEDULING PROBLEM IN VARIOUS MACHINE ENVIRONMENTS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2012. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=19601@1.

Full text

Abstract:

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>PROGRAMA DE SUPORTE À PÓS-GRADUAÇÃO DE INSTS. DE ENSINO<br>Um problema de programação ou escalonamento de produção tem como finalidade determinar uma seqüência factível de processamento de um conjunto de operações e de um conjunto de recursos ao longo de um intervalo de tempo, visando otimizar uma ou mais medidas de desempenho, geralmente associadas ao fator tempo ou ao balanceamento de uso dos recursos. Nesse problema, podem existir ainda restrições de precedência entre as operações e de disponibilidade de recursos por operação.

APA, Harvard, Vancouver, ISO, and other styles

44

Almutairi, Abdulwahab. "Sim-heuristic algorithms for Robust Vehicle Routing Problem with Stochastic Demand." Thesis, University of Portsmouth, 2016. https://researchportal.port.ac.uk/portal/en/theses/simheuristic-algorithms-for-robust-vehicle-routing-problem-with-stochastic-demand(c418aed0-29a5-49f5-b191-ece4796e5827).html.

Full text

Abstract:

The Vehicle Routing Problem with Stochastic Demand (VRPSD) is a fundamental problem underlying many operational challenges in the field of logistic and supply chain management. The VRPSD is a well-known NP-hard problem whereby a fleet of vehicles is located at a single depot. Each vehicle has a limited capacity and has to serve a number of customers whose actual demands are known only when the vehicle arrives at the customers’ locations. The VRPSD arises in practice whenever a company faces the problem of delivering to a set of customers, whose demands are uncertain. The solution to the VRPSD

APA, Harvard, Vancouver, ISO, and other styles

45

Liu, Hsiao-Chun, and 劉曉君. "Heuristic Approaches for Solving Hub Location Problem." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/26879423422622691286.

Full text

Abstract:

碩士<br>大葉大學<br>工業工程研究所<br>89<br>The location of hub facilities is fundamental to the design of a “hub-and-spoke network”, as it greatly affects the total transportation costs of system. Hub is a special type of facility, which is designed to act as switching point for internal flows of a network. The problem is to determine the optimal location for the hubs and the assignments of the nonhubs to hubs that minimizes the overall transportation cost. Due to its characteristics of NP-Complete, it is difficult to obtain optimal solution within an acceptable amount of time. In this stu

APA, Harvard, Vancouver, ISO, and other styles

46

Ueng, Yeong-Shan, and 翁詠山. "The Steiner problem in networks : heuristic methods." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/81930945988089688105.

Full text

Abstract:

碩士<br>國立臺灣大學<br>電機工程學系研究所<br>86<br>The problems of determining a minimum cost connected subnetwork that spans a given subset of vertices is known as the Steiner problem in networks. Since the Steiner problem in networks is NP-complete, it is practical to develop heuristics which find trees whose costs are close to optimal. The application of Steiner heuristics in networks is used to construct multicast trees. In this thesis, we survey previous heuristics of Steiner problems in networks and multicast algor

APA, Harvard, Vancouver, ISO, and other styles

47

Tien, Pang-Ting, and 田邦廷. "Heuristic Approaches for Solving Container Loading Problem." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/05881483643340835028.

Full text

Abstract:

碩士<br>大葉大學<br>工業工程研究所<br>90<br>Container loading problems are frequently encountered in industries such as manufacturing, food and logistics. A good utilization of containers can always result in cost savings. This problem hence attracts attention from practitioners and researchers. Container loading problems are of the NP-Complete type, and hence can hardly be solved within an acceptable amount of time, especially for problems with larger sizes. The primary purpose of this research is to proposed heuristic methods to solve the problems in an efficient manner. A ” bottom-back-left ”

APA, Harvard, Vancouver, ISO, and other styles

48

Huang, Wen-Shi, and 黃玟錫. "A Heuristic Approach for Solving Irregular Packing Problem." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/31567318795127472910.

Full text

Abstract:

碩士<br>大葉大學<br>工業工程研究所<br>89<br>Packing and cutting irregular objects are tasks frequently encountered by the industries, such as shoes making, textile, steel, clothing, etc. The greater saving in the wastage of materials of the above-mentioned industries, the lower the total production cost. Lots of research in the literature has been devoted to developing algorithms to find the optimal / near optimal way of cutting and packing. In this study, we propose a simulated annealing (SA) approach for packing patterns with irregular shapes in a rectangular sheet. In addition, the sh

APA, Harvard, Vancouver, ISO, and other styles

49

"Heuristic approaches for the U-line balancing problem." 1998. http://library.cuhk.edu.hk/record=b5889729.

Full text

Abstract:

Ho Kin Chuen Matthew.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1998.<br>Includes bibliographical references (leaves 153-157).<br>Abstract also in Chinese.<br>Chapter 1 --- Introduction --- p.15<br>Chapter 1.1 --- The U-line Balancing Problem --- p.15<br>Chapter 1.2 --- Configuration of an U-line --- p.17<br>Chapter 1.3 --- Feasible subsets and sequences --- p.19<br>Chapter 1.4 --- Assignment of tasks to stations --- p.21<br>Chapter 1.5 --- Costs --- p.22<br>Chapter 1.6 --- Formulation of The U-line Balancing Problem --- p.23<br>Chapter 1.7 --- Design of computational study

APA, Harvard, Vancouver, ISO, and other styles

50

Lee, Jun-ying, and 李俊穎. "Tabu Search Heuristic for Period Vehicle Routing Problem." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/fzvwh3.

Full text

Abstract:

碩士<br>大同大學<br>資訊經營學系(所)<br>93<br>The Vehicle Routing Problem (VRP) under capacity and distance restrictions involves the design of minimum cost delivery routes for a fleet of vehicles, originating and terminating at a central depot, which serves a set of customers. This thesis present Tabu search algorithm for the Period Vehicle Routing Problem, the problem not only designs vehicle routes to meet required service levels for customers but also minimize distribution costs over a given several day period of time . The VRP belongs to the class of NP-hard problems, and polynomial time algorithms fo

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!