Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Local search algorithm). Showing records 1 – 25 of 25 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Georgia Tech

1. Dong, Xinjun. Finite element model updating through smooth nonconvex optimization.

Degree: PhD, Civil and Environmental Engineering, 2019, Georgia Tech

 During the past few decades, great efforts have been devoted towards finite element (FE) modeling of structures, in order to simulate the structural behavior under… (more)

Subjects/Keywords: Finite element model updating; Frequency-domain formulations; Local search optimization algorithm; Global search optimization algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dong, X. (2019). Finite element model updating through smooth nonconvex optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62625

Chicago Manual of Style (16th Edition):

Dong, Xinjun. “Finite element model updating through smooth nonconvex optimization.” 2019. Doctoral Dissertation, Georgia Tech. Accessed December 03, 2020. http://hdl.handle.net/1853/62625.

MLA Handbook (7th Edition):

Dong, Xinjun. “Finite element model updating through smooth nonconvex optimization.” 2019. Web. 03 Dec 2020.

Vancouver:

Dong X. Finite element model updating through smooth nonconvex optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1853/62625.

Council of Science Editors:

Dong X. Finite element model updating through smooth nonconvex optimization. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/62625


University of Western Ontario

2. Mallik, Arnab. Computation of Sensitive Multiple Spaced Seeds.

Degree: 2020, University of Western Ontario

 Similarity search is one of the most important problem in bioinformatics, with application in read mapping, homology search, oligonucleotide design, etc. Similarity search is time… (more)

Subjects/Keywords: Multiple Spaced Seeds; Similarity Search; Local Alignment; Heuristic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mallik, A. (2020). Computation of Sensitive Multiple Spaced Seeds. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/6977

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mallik, Arnab. “Computation of Sensitive Multiple Spaced Seeds.” 2020. Thesis, University of Western Ontario. Accessed December 03, 2020. https://ir.lib.uwo.ca/etd/6977.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mallik, Arnab. “Computation of Sensitive Multiple Spaced Seeds.” 2020. Web. 03 Dec 2020.

Vancouver:

Mallik A. Computation of Sensitive Multiple Spaced Seeds. [Internet] [Thesis]. University of Western Ontario; 2020. [cited 2020 Dec 03]. Available from: https://ir.lib.uwo.ca/etd/6977.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mallik A. Computation of Sensitive Multiple Spaced Seeds. [Thesis]. University of Western Ontario; 2020. Available from: https://ir.lib.uwo.ca/etd/6977

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universiteit Utrecht

3. Hillebrand, A. Separating a polygonal environment into a multi-layered environment.

Degree: 2012, Universiteit Utrecht

 Path planning is the field of computer science devoted to finding efficient and/or realistic methods used to navigate characters through virtual environments. The Explicit Corridor… (more)

Subjects/Keywords: Multi-layered environment; Explicit Corridor Map; Branch & Price; Local search; Genetic algorithm; MULTICUT; Graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hillebrand, A. (2012). Separating a polygonal environment into a multi-layered environment. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/259132

Chicago Manual of Style (16th Edition):

Hillebrand, A. “Separating a polygonal environment into a multi-layered environment.” 2012. Masters Thesis, Universiteit Utrecht. Accessed December 03, 2020. http://dspace.library.uu.nl:8080/handle/1874/259132.

MLA Handbook (7th Edition):

Hillebrand, A. “Separating a polygonal environment into a multi-layered environment.” 2012. Web. 03 Dec 2020.

Vancouver:

Hillebrand A. Separating a polygonal environment into a multi-layered environment. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2020 Dec 03]. Available from: http://dspace.library.uu.nl:8080/handle/1874/259132.

Council of Science Editors:

Hillebrand A. Separating a polygonal environment into a multi-layered environment. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/259132


Delft University of Technology

4. Dai, Lu (author). A machine learning approach for optimisation in railway planning.

Degree: 2018, Delft University of Technology

Planning and scheduling problem is a hard problem, especially in real life cases. The time and space complexity increase quickly along with the increase of… (more)

Subjects/Keywords: Planning & scheduling algorithms; Machine learning; Local search algorithm; Imbalanced learning; Feature extraction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dai, L. (. (2018). A machine learning approach for optimisation in railway planning. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e

Chicago Manual of Style (16th Edition):

Dai, Lu (author). “A machine learning approach for optimisation in railway planning.” 2018. Masters Thesis, Delft University of Technology. Accessed December 03, 2020. http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e.

MLA Handbook (7th Edition):

Dai, Lu (author). “A machine learning approach for optimisation in railway planning.” 2018. Web. 03 Dec 2020.

Vancouver:

Dai L(. A machine learning approach for optimisation in railway planning. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2020 Dec 03]. Available from: http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e.

Council of Science Editors:

Dai L(. A machine learning approach for optimisation in railway planning. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e


University of Cincinnati

5. Subramanian, Rishi Bharadwaj. FPGA Based Satisfiability Checking.

Degree: MS, Engineering and Applied Science: Computer Engineering, 2020, University of Cincinnati

 The Boolean satisfiability problem, abbreviated as SAT, is the backbone of manyapplications in VLSI design automation and verification. Over the years, many SATsolvers, both complete… (more)

Subjects/Keywords: Electrical Engineering; FPGA Based SAT Solver; Boolean Satisfiability; Local Search Algorithm; SAT Solver

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Subramanian, R. B. (2020). FPGA Based Satisfiability Checking. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1583154848438753

Chicago Manual of Style (16th Edition):

Subramanian, Rishi Bharadwaj. “FPGA Based Satisfiability Checking.” 2020. Masters Thesis, University of Cincinnati. Accessed December 03, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1583154848438753.

MLA Handbook (7th Edition):

Subramanian, Rishi Bharadwaj. “FPGA Based Satisfiability Checking.” 2020. Web. 03 Dec 2020.

Vancouver:

Subramanian RB. FPGA Based Satisfiability Checking. [Internet] [Masters thesis]. University of Cincinnati; 2020. [cited 2020 Dec 03]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1583154848438753.

Council of Science Editors:

Subramanian RB. FPGA Based Satisfiability Checking. [Masters Thesis]. University of Cincinnati; 2020. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1583154848438753


University of Georgia

6. Walliser, Michael Anthony. Fort Stewart shortest path analysis of debris cleanup options.

Degree: 2014, University of Georgia

 Several heuristic algorithms are developed to find the fastest set of routes in order for a fleet of cleanup crews to clear hurricane-related debris from… (more)

Subjects/Keywords: Arc routing; Hierarchical Chinese Postman Problem; Capacitated Arc Routing Problem; Path finding; Search heuristics; Local beam search; Genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Walliser, M. A. (2014). Fort Stewart shortest path analysis of debris cleanup options. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/28149

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Walliser, Michael Anthony. “Fort Stewart shortest path analysis of debris cleanup options.” 2014. Thesis, University of Georgia. Accessed December 03, 2020. http://hdl.handle.net/10724/28149.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Walliser, Michael Anthony. “Fort Stewart shortest path analysis of debris cleanup options.” 2014. Web. 03 Dec 2020.

Vancouver:

Walliser MA. Fort Stewart shortest path analysis of debris cleanup options. [Internet] [Thesis]. University of Georgia; 2014. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10724/28149.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Walliser MA. Fort Stewart shortest path analysis of debris cleanup options. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/28149

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


UNIVERSIDADE FEDERAL DE OURO PRETO

7. Marcelo Ferreira Rego. Algoritmos Multiobjetivos para o Problema de Sequenciamento de Tarefas em Uma MÃquina com Tempo de PreparaÃÃo Dependente da SequÃncia e da FamÃlia.

Degree: 2013, UNIVERSIDADE FEDERAL DE OURO PRETO

This work addresses the Single Machine Scheduling Problem with Sequence Dependent Family Setup Times. In this problem, there is a set of jobs to be… (more)

Subjects/Keywords: Otimiza ÃÃo multiobjetivo; Pareto Iterated Local Search; Nondominated Sorting Genetic Algorithm; Strength Pareto Evolutionary Algorithm; Problema de sequenciamento em Ãnica mÃquina; Multi-objective Variable Neighborhood Search; Single machine scheduling; Multi-objective optimization; Pareto Iterated Local Search; Multi-objective Variable Neighborhood Search; Nondominated Sorting Genetic Algorithm; Strength Pareto Evolutionary Algorithm; CIENCIA DA COMPUTACAO

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rego, M. F. (2013). Algoritmos Multiobjetivos para o Problema de Sequenciamento de Tarefas em Uma MÃquina com Tempo de PreparaÃÃo Dependente da SequÃncia e da FamÃlia. (Thesis). UNIVERSIDADE FEDERAL DE OURO PRETO. Retrieved from http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=1044

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rego, Marcelo Ferreira. “Algoritmos Multiobjetivos para o Problema de Sequenciamento de Tarefas em Uma MÃquina com Tempo de PreparaÃÃo Dependente da SequÃncia e da FamÃlia.” 2013. Thesis, UNIVERSIDADE FEDERAL DE OURO PRETO. Accessed December 03, 2020. http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=1044.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rego, Marcelo Ferreira. “Algoritmos Multiobjetivos para o Problema de Sequenciamento de Tarefas em Uma MÃquina com Tempo de PreparaÃÃo Dependente da SequÃncia e da FamÃlia.” 2013. Web. 03 Dec 2020.

Vancouver:

Rego MF. Algoritmos Multiobjetivos para o Problema de Sequenciamento de Tarefas em Uma MÃquina com Tempo de PreparaÃÃo Dependente da SequÃncia e da FamÃlia. [Internet] [Thesis]. UNIVERSIDADE FEDERAL DE OURO PRETO; 2013. [cited 2020 Dec 03]. Available from: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=1044.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rego MF. Algoritmos Multiobjetivos para o Problema de Sequenciamento de Tarefas em Uma MÃquina com Tempo de PreparaÃÃo Dependente da SequÃncia e da FamÃlia. [Thesis]. UNIVERSIDADE FEDERAL DE OURO PRETO; 2013. Available from: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=1044

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. WU LIPENG. Large-scale structural identification by multi-civilization genetic algorithm approach.

Degree: 2004, National University of Singapore

Subjects/Keywords: System Identification; Genetic Algorithms; Local Search; Parallel Genetic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

LIPENG, W. (2004). Large-scale structural identification by multi-civilization genetic algorithm approach. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/13876

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

LIPENG, WU. “Large-scale structural identification by multi-civilization genetic algorithm approach.” 2004. Thesis, National University of Singapore. Accessed December 03, 2020. http://scholarbank.nus.edu.sg/handle/10635/13876.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

LIPENG, WU. “Large-scale structural identification by multi-civilization genetic algorithm approach.” 2004. Web. 03 Dec 2020.

Vancouver:

LIPENG W. Large-scale structural identification by multi-civilization genetic algorithm approach. [Internet] [Thesis]. National University of Singapore; 2004. [cited 2020 Dec 03]. Available from: http://scholarbank.nus.edu.sg/handle/10635/13876.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

LIPENG W. Large-scale structural identification by multi-civilization genetic algorithm approach. [Thesis]. National University of Singapore; 2004. Available from: http://scholarbank.nus.edu.sg/handle/10635/13876

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


North Carolina State University

9. Liu, Li. Real-time Contaminant Source Characterization in Water Distribution Systems.

Degree: PhD, Civil Engineering, 2009, North Carolina State University

 Accidental/intentional contamination continues to be a major concern for the security management in water distribution systems. Once a contaminant has been initially detected, an effective… (more)

Subjects/Keywords: Non-uniqueness; Adaptive dynamic optimization technique; Evolutionary algorithm; Water distribution systems; Contaminant source characterization; Logistic regression; Local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liu, L. (2009). Real-time Contaminant Source Characterization in Water Distribution Systems. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/3319

Chicago Manual of Style (16th Edition):

Liu, Li. “Real-time Contaminant Source Characterization in Water Distribution Systems.” 2009. Doctoral Dissertation, North Carolina State University. Accessed December 03, 2020. http://www.lib.ncsu.edu/resolver/1840.16/3319.

MLA Handbook (7th Edition):

Liu, Li. “Real-time Contaminant Source Characterization in Water Distribution Systems.” 2009. Web. 03 Dec 2020.

Vancouver:

Liu L. Real-time Contaminant Source Characterization in Water Distribution Systems. [Internet] [Doctoral dissertation]. North Carolina State University; 2009. [cited 2020 Dec 03]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/3319.

Council of Science Editors:

Liu L. Real-time Contaminant Source Characterization in Water Distribution Systems. [Doctoral Dissertation]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/3319

10. Trujillo Rincon , Tomas. Aproximación Heurística al problema MRCPSP/max a través de Algoritmos Meméticos .

Degree: 2013, Universidad de los Andes

 El problema de programación de proyectos con recursos limitados, múltiples modos de ejecución y ventanas de tiempo (MRCPSP/max) hace referencia a la programación de un… (more)

Subjects/Keywords: Memetic; MAP; algorithm; MRCPSP/max; genetic; local search; mutation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Trujillo Rincon , T. (2013). Aproximación Heurística al problema MRCPSP/max a través de Algoritmos Meméticos . (Thesis). Universidad de los Andes. Retrieved from http://documentodegrado.uniandes.edu.co/documentos/MemeticosTTR25052013.docx

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Trujillo Rincon , Tomas. “Aproximación Heurística al problema MRCPSP/max a través de Algoritmos Meméticos .” 2013. Thesis, Universidad de los Andes. Accessed December 03, 2020. http://documentodegrado.uniandes.edu.co/documentos/MemeticosTTR25052013.docx.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Trujillo Rincon , Tomas. “Aproximación Heurística al problema MRCPSP/max a través de Algoritmos Meméticos .” 2013. Web. 03 Dec 2020.

Vancouver:

Trujillo Rincon T. Aproximación Heurística al problema MRCPSP/max a través de Algoritmos Meméticos . [Internet] [Thesis]. Universidad de los Andes; 2013. [cited 2020 Dec 03]. Available from: http://documentodegrado.uniandes.edu.co/documentos/MemeticosTTR25052013.docx.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Trujillo Rincon T. Aproximación Heurística al problema MRCPSP/max a través de Algoritmos Meméticos . [Thesis]. Universidad de los Andes; 2013. Available from: http://documentodegrado.uniandes.edu.co/documentos/MemeticosTTR25052013.docx

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Arizona State University

11. Li, Xiaoyan. Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization.

Degree: Industrial Engineering, 2015, Arizona State University

 This thesis presents a successful application of operations research techniques in nonprofit distribution system to improve the distribution efficiency and increase customer service quality. It… (more)

Subjects/Keywords: Industrial engineering; Operations research; Ant Colony Algorithm; Capacitated Vehicle Routing Problem with Time Windows; Local Search; Vehicle Routing Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Li, X. (2015). Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/35422

Chicago Manual of Style (16th Edition):

Li, Xiaoyan. “Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization.” 2015. Masters Thesis, Arizona State University. Accessed December 03, 2020. http://repository.asu.edu/items/35422.

MLA Handbook (7th Edition):

Li, Xiaoyan. “Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization.” 2015. Web. 03 Dec 2020.

Vancouver:

Li X. Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization. [Internet] [Masters thesis]. Arizona State University; 2015. [cited 2020 Dec 03]. Available from: http://repository.asu.edu/items/35422.

Council of Science Editors:

Li X. Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization. [Masters Thesis]. Arizona State University; 2015. Available from: http://repository.asu.edu/items/35422

12. Lee, Shane. Genetic algorithms, orthogonal arrays and diploid chromosomes.

Degree: PhD, 2002, University of South Wales

 Based on the principles of Darwinian natural selection, genetic algorithms are a wellestablished search and optimisation technique. They can be said to 'evolve' solutions to… (more)

Subjects/Keywords: Genetic algorithm; Search; local search; diploid; real encoded; orthogonal array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lee, S. (2002). Genetic algorithms, orthogonal arrays and diploid chromosomes. (Doctoral Dissertation). University of South Wales. Retrieved from https://pure.southwales.ac.uk/en/studentthesis/genetic-algorithms-orthogonal-arrays-and-diploid-chromosomes(c72580ff-5ede-446f-872e-dd82ae82c4d3).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.761244

Chicago Manual of Style (16th Edition):

Lee, Shane. “Genetic algorithms, orthogonal arrays and diploid chromosomes.” 2002. Doctoral Dissertation, University of South Wales. Accessed December 03, 2020. https://pure.southwales.ac.uk/en/studentthesis/genetic-algorithms-orthogonal-arrays-and-diploid-chromosomes(c72580ff-5ede-446f-872e-dd82ae82c4d3).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.761244.

MLA Handbook (7th Edition):

Lee, Shane. “Genetic algorithms, orthogonal arrays and diploid chromosomes.” 2002. Web. 03 Dec 2020.

Vancouver:

Lee S. Genetic algorithms, orthogonal arrays and diploid chromosomes. [Internet] [Doctoral dissertation]. University of South Wales; 2002. [cited 2020 Dec 03]. Available from: https://pure.southwales.ac.uk/en/studentthesis/genetic-algorithms-orthogonal-arrays-and-diploid-chromosomes(c72580ff-5ede-446f-872e-dd82ae82c4d3).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.761244.

Council of Science Editors:

Lee S. Genetic algorithms, orthogonal arrays and diploid chromosomes. [Doctoral Dissertation]. University of South Wales; 2002. Available from: https://pure.southwales.ac.uk/en/studentthesis/genetic-algorithms-orthogonal-arrays-and-diploid-chromosomes(c72580ff-5ede-446f-872e-dd82ae82c4d3).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.761244


Jawaharlal Nehru University

13. Balid, Ahamd. Job shop scheduling using multi agent systems; -.

Degree: Computer Science, 2010, Jawaharlal Nehru University

Abstract Include

Bibliography p.156-166

Advisors/Committee Members: Minz, Sonajharia.

Subjects/Keywords: Ant Colony System; Genetic Algorithm for JSSP; Job Shop Scheduling Problem; Local Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Balid, A. (2010). Job shop scheduling using multi agent systems; -. (Thesis). Jawaharlal Nehru University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/31167

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Balid, Ahamd. “Job shop scheduling using multi agent systems; -.” 2010. Thesis, Jawaharlal Nehru University. Accessed December 03, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/31167.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Balid, Ahamd. “Job shop scheduling using multi agent systems; -.” 2010. Web. 03 Dec 2020.

Vancouver:

Balid A. Job shop scheduling using multi agent systems; -. [Internet] [Thesis]. Jawaharlal Nehru University; 2010. [cited 2020 Dec 03]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/31167.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Balid A. Job shop scheduling using multi agent systems; -. [Thesis]. Jawaharlal Nehru University; 2010. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/31167

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

14. Kalicharan, Kishan (author). Intermodal Transport: Routing Vehicles and Scheduling Containers.

Degree: 2018, Delft University of Technology

In intermodal transport multiple types of vehicles are used to transport containers. If the routes of the vehicles are known, then the container allocation can… (more)

Subjects/Keywords: Branch and Bound; Cutting Plane; Multicommodity Flow; Intermodal Transport; Time-Space Graph; Network Design; Min Cost Flow; Column Generating; Local search algorithm; fix; fixed-charge; capacitated; Container; Barges; Reductions; ILP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kalicharan, K. (. (2018). Intermodal Transport: Routing Vehicles and Scheduling Containers. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12

Chicago Manual of Style (16th Edition):

Kalicharan, Kishan (author). “Intermodal Transport: Routing Vehicles and Scheduling Containers.” 2018. Masters Thesis, Delft University of Technology. Accessed December 03, 2020. http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12.

MLA Handbook (7th Edition):

Kalicharan, Kishan (author). “Intermodal Transport: Routing Vehicles and Scheduling Containers.” 2018. Web. 03 Dec 2020.

Vancouver:

Kalicharan K(. Intermodal Transport: Routing Vehicles and Scheduling Containers. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2020 Dec 03]. Available from: http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12.

Council of Science Editors:

Kalicharan K(. Intermodal Transport: Routing Vehicles and Scheduling Containers. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12


Brno University of Technology

15. Jelének, Marek. Optimalizace konstrukce elektrických strojů pomocí genetických algoritmů: Optimizing design of electric machines using genetic algorithms.

Degree: 2018, Brno University of Technology

This bachelor thesis deals with optimization methods usable in the construction of electrical machines. The main aim of this thesis is propose an optimization method, applied to simple example and evaluate optimized results with not optimized results. Advisors/Committee Members: Janda, Marcel (advisor), Mach, Martin (referee).

Subjects/Keywords: Optimalizace; algoritmus; funkce; elektrický stroj; extrém; globální; lokální; minimum; maximum; prohledávaný prostor; rozběhový proud; moment; Optimization; algorithm; function; electric machine; extreme; global; local; minimum; maximum; search space; starting current; torque

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jelének, M. (2018). Optimalizace konstrukce elektrických strojů pomocí genetických algoritmů: Optimizing design of electric machines using genetic algorithms. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/59043

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jelének, Marek. “Optimalizace konstrukce elektrických strojů pomocí genetických algoritmů: Optimizing design of electric machines using genetic algorithms.” 2018. Thesis, Brno University of Technology. Accessed December 03, 2020. http://hdl.handle.net/11012/59043.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jelének, Marek. “Optimalizace konstrukce elektrických strojů pomocí genetických algoritmů: Optimizing design of electric machines using genetic algorithms.” 2018. Web. 03 Dec 2020.

Vancouver:

Jelének M. Optimalizace konstrukce elektrických strojů pomocí genetických algoritmů: Optimizing design of electric machines using genetic algorithms. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/11012/59043.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jelének M. Optimalizace konstrukce elektrických strojů pomocí genetických algoritmů: Optimizing design of electric machines using genetic algorithms. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/59043

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Vienna

16. Vogl, Petra. Solution Techniques for Rich and Real-world Appointment and Staff Scheduling Problems in Health Care.

Degree: 2019, University of Vienna

Termin- und Personaleinsatzplanungsprobleme sind allgegenwärtig im Gesundheitswesen: Einerseits müssen Patiententermine innerhalb vordefinierter Zeitfenster so geplant werden, dass etwaige knappe Ressourcen möglichst effizient genutzt werden können… (more)

Subjects/Keywords: 85.99 Betriebswirtschaft: Sonstiges; 54.80 Angewandte Informatik; Terminplanung / Personaleinsatzplanung / Metaheuristik / Gesundheitswesen / Genetischer Algorithmus / Lokale Suche / Mathematische Modellierung; Appointment Scheduling / Staff Scheduling / Metaheuristic / Health Care Scheduling / Genetic Algorithm / Local Search / Mathematic Modelling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vogl, P. (2019). Solution Techniques for Rich and Real-world Appointment and Staff Scheduling Problems in Health Care. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/56588/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Vogl, Petra. “Solution Techniques for Rich and Real-world Appointment and Staff Scheduling Problems in Health Care.” 2019. Thesis, University of Vienna. Accessed December 03, 2020. http://othes.univie.ac.at/56588/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vogl, Petra. “Solution Techniques for Rich and Real-world Appointment and Staff Scheduling Problems in Health Care.” 2019. Web. 03 Dec 2020.

Vancouver:

Vogl P. Solution Techniques for Rich and Real-world Appointment and Staff Scheduling Problems in Health Care. [Internet] [Thesis]. University of Vienna; 2019. [cited 2020 Dec 03]. Available from: http://othes.univie.ac.at/56588/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vogl P. Solution Techniques for Rich and Real-world Appointment and Staff Scheduling Problems in Health Care. [Thesis]. University of Vienna; 2019. Available from: http://othes.univie.ac.at/56588/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

17. Ahmadian, Sara. Improved approximation guarantees for lower-bounded facility location problem.

Degree: 2010, University of Waterloo

 We consider the lower-bounded facility location (LBFL) problem (, also known as load-balanced facility location), which is a generalization of uncapacitated facility location (UFL) problem… (more)

Subjects/Keywords: facility location; lower-bounded facility location; capacity-discounted facility location; local-search algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ahmadian, S. (2010). Improved approximation guarantees for lower-bounded facility location problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5513

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ahmadian, Sara. “Improved approximation guarantees for lower-bounded facility location problem.” 2010. Thesis, University of Waterloo. Accessed December 03, 2020. http://hdl.handle.net/10012/5513.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ahmadian, Sara. “Improved approximation guarantees for lower-bounded facility location problem.” 2010. Web. 03 Dec 2020.

Vancouver:

Ahmadian S. Improved approximation guarantees for lower-bounded facility location problem. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10012/5513.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ahmadian S. Improved approximation guarantees for lower-bounded facility location problem. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5513

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

18. Švadlenka, Jiří. Informační systém pro školy s automatickou tvorbou rozvrhů: Information System for a School Including Automated Timetabling.

Degree: 2019, Brno University of Technology

 This thesis devote itself to use of information system for school agenda administration. Schools are forced to administer big amounts of informations, not only referred… (more)

Subjects/Keywords: Informační systém; školní agenda; generování rozvrhů; školní rozvrhování; genetické algoritmy; barvení grafu; heuristika; lokální hledání; simulované žíhání; zakázané prohledávání; grafy; XML.; Information system; automated timetabling; school timetabling; genetic algorithm; graph coloring; heuristic; local search technique; simulated annealing; tabu search; graphs; XML.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Švadlenka, J. (2019). Informační systém pro školy s automatickou tvorbou rozvrhů: Information System for a School Including Automated Timetabling. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53167

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Švadlenka, Jiří. “Informační systém pro školy s automatickou tvorbou rozvrhů: Information System for a School Including Automated Timetabling.” 2019. Thesis, Brno University of Technology. Accessed December 03, 2020. http://hdl.handle.net/11012/53167.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Švadlenka, Jiří. “Informační systém pro školy s automatickou tvorbou rozvrhů: Information System for a School Including Automated Timetabling.” 2019. Web. 03 Dec 2020.

Vancouver:

Švadlenka J. Informační systém pro školy s automatickou tvorbou rozvrhů: Information System for a School Including Automated Timetabling. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/11012/53167.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Švadlenka J. Informační systém pro školy s automatickou tvorbou rozvrhů: Information System for a School Including Automated Timetabling. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/53167

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

19. Schaeffer, Satu Elisa. Algorithms for Nonuniform Networks.

Degree: 2006, Helsinki University of Technology

In this thesis, observations on structural properties of natural networks are taken as a starting point for developing efficient algorithms for natural instances of different… (more)

Subjects/Keywords: community structure; graph algorithm; graph clustering; graph data mining; graph similarity; local search; minimum spanning tree; network model; nonuniform network; random graph; random sampling; routing; scale-free network; shortest path algorithm; small-world network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schaeffer, S. E. (2006). Algorithms for Nonuniform Networks. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2006/isbn9512281198/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Thesis, Helsinki University of Technology. Accessed December 03, 2020. http://lib.tkk.fi/Diss/2006/isbn9512281198/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Web. 03 Dec 2020.

Vancouver:

Schaeffer SE. Algorithms for Nonuniform Networks. [Internet] [Thesis]. Helsinki University of Technology; 2006. [cited 2020 Dec 03]. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schaeffer SE. Algorithms for Nonuniform Networks. [Thesis]. Helsinki University of Technology; 2006. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

20. Ahmadian, Sara. Approximation Algorithms for Clustering and Facility Location Problems.

Degree: 2017, University of Waterloo

 Facility location problems arise in a wide range of applications such as plant or warehouse location problems, cache placement problems, and network design problems, and… (more)

Subjects/Keywords: Approximation algorithms; Facility location problems; Clustering; Mobile facility location problem; Min-load k-facility location; Lower-bounded clustering with outliers; Lower-bounded clustering; Clustering with outliers; Local search algorithm; Primal-dual algorithm; Linear-programming rounding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ahmadian, S. (2017). Approximation Algorithms for Clustering and Facility Location Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11640

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ahmadian, Sara. “Approximation Algorithms for Clustering and Facility Location Problems.” 2017. Thesis, University of Waterloo. Accessed December 03, 2020. http://hdl.handle.net/10012/11640.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ahmadian, Sara. “Approximation Algorithms for Clustering and Facility Location Problems.” 2017. Web. 03 Dec 2020.

Vancouver:

Ahmadian S. Approximation Algorithms for Clustering and Facility Location Problems. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10012/11640.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ahmadian S. Approximation Algorithms for Clustering and Facility Location Problems. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11640

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

21. Terragnoli, John P. Stripmap SAR pulse interleaved scheduling.

Degree: MS, Department of Electrical and Computer Engineering, 2018, Northeastern University

 Stripmap SAR is a radar mode used to image terrain from an airborne platform; it does so by transmitting and receiving a series of electromagnetic… (more)

Subjects/Keywords: greedy algorithm; local search; pulse interleaving; scheduling; stripmap SAR; synthetic aperture radar

…considered. The four algorithms used are a greedy algorithm, a greedy algorithm with local search… …improvement, a greedy algorithm with local search using multiple task input orders, and an… …but giving sub-optimal results. 2.2.2 Greedy Algorithm with Local Search A local search… …greedy algorithm and local search improvement algorithm are used in this research as a basis… …basic greedy algorithm, a greedy algorithm with local search improvement, greedy with local… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Terragnoli, J. P. (2018). Stripmap SAR pulse interleaved scheduling. (Masters Thesis). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20292521

Chicago Manual of Style (16th Edition):

Terragnoli, John P. “Stripmap SAR pulse interleaved scheduling.” 2018. Masters Thesis, Northeastern University. Accessed December 03, 2020. http://hdl.handle.net/2047/D20292521.

MLA Handbook (7th Edition):

Terragnoli, John P. “Stripmap SAR pulse interleaved scheduling.” 2018. Web. 03 Dec 2020.

Vancouver:

Terragnoli JP. Stripmap SAR pulse interleaved scheduling. [Internet] [Masters thesis]. Northeastern University; 2018. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2047/D20292521.

Council of Science Editors:

Terragnoli JP. Stripmap SAR pulse interleaved scheduling. [Masters Thesis]. Northeastern University; 2018. Available from: http://hdl.handle.net/2047/D20292521


Université de Montréal

22. Monty, Pierre Paul. Traduction statistique par recherche locale.

Degree: 2010, Université de Montréal

Subjects/Keywords: Traduction statistique; Statistical translation; Modèle à base de segments; Phrase based model; Recherche locale; Local search; Algorithme glouton; Greedy algorithm; Applied Sciences - Artificial Intelligence / Sciences appliqués et technologie - Intelligence artificielle (UMI : 0800)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Monty, P. P. (2010). Traduction statistique par recherche locale. (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/4515

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Monty, Pierre Paul. “Traduction statistique par recherche locale.” 2010. Thesis, Université de Montréal. Accessed December 03, 2020. http://hdl.handle.net/1866/4515.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Monty, Pierre Paul. “Traduction statistique par recherche locale.” 2010. Web. 03 Dec 2020.

Vancouver:

Monty PP. Traduction statistique par recherche locale. [Internet] [Thesis]. Université de Montréal; 2010. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1866/4515.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Monty PP. Traduction statistique par recherche locale. [Thesis]. Université de Montréal; 2010. Available from: http://hdl.handle.net/1866/4515

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

23. Larabi, Mohand. Le problème de job-shop avec transport : modélisation et optimisation : Job-shop with transport : its modelling and optimisation.

Degree: Docteur es, Informatique, 2010, Université Blaise-Pascale, Clermont-Ferrand II

Dans cette thèse nous nous sommes intéressés à l’extension du problème job-shop en ajoutant la contrainte du transport des jobs entre les différentes machines. Dans… (more)

Subjects/Keywords: Job-shop; Transport; Robots; Ordonnancement; Capacité non unitaire; Heuristiques; Méta-heuristiques; Voisinage; Modélisation; Optimisation; Graphe disjonctif; Graphe conjonctif; Makespan; Recherche locale; Algorithme génétique; Algorithme mémétique; Job-shop; Transportation; Robots; Scheduling; Non-unary loading capacities; Heuristics; Metaheuristics; Neighborhood; Modeling; Optimization; Disjunctive graph; Conjunctive graph; Makespan; Local search; Genetic algorithm; Memetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Larabi, M. (2010). Le problème de job-shop avec transport : modélisation et optimisation : Job-shop with transport : its modelling and optimisation. (Doctoral Dissertation). Université Blaise-Pascale, Clermont-Ferrand II. Retrieved from http://www.theses.fr/2010CLF22092

Chicago Manual of Style (16th Edition):

Larabi, Mohand. “Le problème de job-shop avec transport : modélisation et optimisation : Job-shop with transport : its modelling and optimisation.” 2010. Doctoral Dissertation, Université Blaise-Pascale, Clermont-Ferrand II. Accessed December 03, 2020. http://www.theses.fr/2010CLF22092.

MLA Handbook (7th Edition):

Larabi, Mohand. “Le problème de job-shop avec transport : modélisation et optimisation : Job-shop with transport : its modelling and optimisation.” 2010. Web. 03 Dec 2020.

Vancouver:

Larabi M. Le problème de job-shop avec transport : modélisation et optimisation : Job-shop with transport : its modelling and optimisation. [Internet] [Doctoral dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2010. [cited 2020 Dec 03]. Available from: http://www.theses.fr/2010CLF22092.

Council of Science Editors:

Larabi M. Le problème de job-shop avec transport : modélisation et optimisation : Job-shop with transport : its modelling and optimisation. [Doctoral Dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2010. Available from: http://www.theses.fr/2010CLF22092

24. Pesek, Igor. UPORABA HIBRIDNIH METAHEVRISTIK PRI REŠEVANJU OPTIMIZACIJSKIH PROBLEMOV.

Degree: 2009, Univerza v Mariboru

V doktorski disertaciji sta predstavljena dva algoritma za reševanje težkih kombinatoričnih problemov. Prvi problem se imenuje Problem razvrščanja poslov z omejitvami virov, za katerega smo… (more)

Subjects/Keywords: hevristični algoritem; lokalno iskanje; metahevristike; optimizacijske metode; NP-težki problemi; razvrščanje poslov z omejitvami virov; načrtovanje usmerjenih omrežij; heuristic algorithm; local search; metaheuristics; optimization methods; NP-hard problems; resource constrained scheduling problem; oriented network design problem; combinatorial optimization; info:eu-repo/classification/udc/004.421.023:519.14(043.3)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pesek, I. (2009). UPORABA HIBRIDNIH METAHEVRISTIK PRI REŠEVANJU OPTIMIZACIJSKIH PROBLEMOV. (Doctoral Dissertation). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=10077 ; https://dk.um.si/Dokument.php?id=7994&dn= ; https://plus.si.cobiss.net/opac7/bib/245245696?lang=sl

Chicago Manual of Style (16th Edition):

Pesek, Igor. “UPORABA HIBRIDNIH METAHEVRISTIK PRI REŠEVANJU OPTIMIZACIJSKIH PROBLEMOV.” 2009. Doctoral Dissertation, Univerza v Mariboru. Accessed December 03, 2020. https://dk.um.si/IzpisGradiva.php?id=10077 ; https://dk.um.si/Dokument.php?id=7994&dn= ; https://plus.si.cobiss.net/opac7/bib/245245696?lang=sl.

MLA Handbook (7th Edition):

Pesek, Igor. “UPORABA HIBRIDNIH METAHEVRISTIK PRI REŠEVANJU OPTIMIZACIJSKIH PROBLEMOV.” 2009. Web. 03 Dec 2020.

Vancouver:

Pesek I. UPORABA HIBRIDNIH METAHEVRISTIK PRI REŠEVANJU OPTIMIZACIJSKIH PROBLEMOV. [Internet] [Doctoral dissertation]. Univerza v Mariboru; 2009. [cited 2020 Dec 03]. Available from: https://dk.um.si/IzpisGradiva.php?id=10077 ; https://dk.um.si/Dokument.php?id=7994&dn= ; https://plus.si.cobiss.net/opac7/bib/245245696?lang=sl.

Council of Science Editors:

Pesek I. UPORABA HIBRIDNIH METAHEVRISTIK PRI REŠEVANJU OPTIMIZACIJSKIH PROBLEMOV. [Doctoral Dissertation]. Univerza v Mariboru; 2009. Available from: https://dk.um.si/IzpisGradiva.php?id=10077 ; https://dk.um.si/Dokument.php?id=7994&dn= ; https://plus.si.cobiss.net/opac7/bib/245245696?lang=sl

25. Renato Corrêa Ribeiro Bustamante. Otimização de painéis sanduíche utilizando o método de recozimento simulado.

Degree: 2000, Instituto Nacional de Pesquisas Espaciais

A redução da massa de estruturas espaciais é importante, pois possibilita o aumento da carga útil e/ou vida útil dos veículos espaciais. Como conseqüência disso,… (more)

Subjects/Keywords: otimização; estruturas sanduíche; recomento; painel solar; panels; otimização; sabdwich structures; simulation annealing; solar panel; ENGENHARIA E TECNOLOGIA ESPACIAL; A redução da massa de estruturas espaciais é importante; pois possibilita o aumento da carga útil e/ou vida útil dos veículos espaciais. Como conseqüência disso; a utilização dos painéis sanduíche devido a sua configuração vem crescendo nos últimos anos; pois estes painéis possuem uma relação rigidez/peso elevada. O problema abordado neste trabalho é a minimização da massa das faces de um painel sanduíche. As faces desses painéis são constituídas por uma tela de fibra de material composto. A massa dessas faces é reduzida através da definição de uma distribuição não uniforme de material; considerando a primeira freqüência natural como restrição. Este problema foi anteriormente resolvido utilizando-se métodos determinísticos de otimização. Entretanto; como os problemas de otimização estrutural possuem muitos mínimos locais; os métodos determinísticos têm dificuldade em encontrar os projetos ótimos globais. Para contornar este problema; neste trabalho foi utilizado um algoritmo estocástico; baseado no método do Recozimento Simulado (RS); que possui mecanismos de busca direcionada e aleatória; capazes de atingir o mínimo global. O objetivo deste trabalho é estudar a viabilidade da utilização do RS em problemas de otimização estrutural. Os projetos são gerados aleatoriamente e o custo das mudanças (variação da função objetivo)é calculado. Os resultados obtidos são comparados com outros calculados usando um método de otimização determinístico .ABSTRACT:The mass reduction of space structures is of great importance; since it allows the payload and/or space vehicles lifetime increase. As a consequence; the use of sandwich panels has been growing in the last years; since these panels have a high stiffness/weight ratio. The problem presented in this work is about mass minimization of sandwich panels facesheets. The panel facesheets are composed of a net of composite material fiber strips. Defining a nonuniform material distribution; taking into account a lower boundary for the first natural frequency as constraint reduces the mass of these facesheets. This problem was previously solved by using deterministic methods of optimization. However; as the structural optimization problems have many local minima; the deterministic methods present difficulty to find the global optimum design. To outline this problem; a stochastic algorithm has been used in this work; based on the Simulated Annealing method (SA); which allows directional and random search and it is able to reach the global minimum. The goal of this work is to study the behavior of the SA algorithm when it s used to solve structural optimization problems. The designs are generated randomly and the change costs (variation of the objective function)is evaluated. The outputs obtained with this method are compared with results from some deterministic optimization methods; painéis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bustamante, R. C. R. (2000). Otimização de painéis sanduíche utilizando o método de recozimento simulado. (Thesis). Instituto Nacional de Pesquisas Espaciais. Retrieved from http://urlib.net/sid.inpe.br/[email protected]/2005/08.04.02.31

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bustamante, Renato Corrêa Ribeiro. “Otimização de painéis sanduíche utilizando o método de recozimento simulado.” 2000. Thesis, Instituto Nacional de Pesquisas Espaciais. Accessed December 03, 2020. http://urlib.net/sid.inpe.br/[email protected]/2005/08.04.02.31.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bustamante, Renato Corrêa Ribeiro. “Otimização de painéis sanduíche utilizando o método de recozimento simulado.” 2000. Web. 03 Dec 2020.

Vancouver:

Bustamante RCR. Otimização de painéis sanduíche utilizando o método de recozimento simulado. [Internet] [Thesis]. Instituto Nacional de Pesquisas Espaciais; 2000. [cited 2020 Dec 03]. Available from: http://urlib.net/sid.inpe.br/[email protected]/2005/08.04.02.31.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bustamante RCR. Otimização de painéis sanduíche utilizando o método de recozimento simulado. [Thesis]. Instituto Nacional de Pesquisas Espaciais; 2000. Available from: http://urlib.net/sid.inpe.br/[email protected]/2005/08.04.02.31

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.