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:(iterated local search). Showing records 1 – 13 of 13 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


George Mason University

1. Olson, Brian. Local Minima Hopping along the Protein Energy Surface .

Degree: 2012, George Mason University

 Modeling of protein molecules in silico for the purpose of elucidating the three-dimensional structure where the protein is biologically active employs the knowledge that the… (more)

Subjects/Keywords: Native Structure; Near-Native Conformations; Local Minimum; Iterated Local Search; Fragment-Based Assembly

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Olson, B. (2012). Local Minima Hopping along the Protein Energy Surface . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/7479

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):

Olson, Brian. “Local Minima Hopping along the Protein Energy Surface .” 2012. Thesis, George Mason University. Accessed March 09, 2021. http://hdl.handle.net/1920/7479.

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

MLA Handbook (7th Edition):

Olson, Brian. “Local Minima Hopping along the Protein Energy Surface .” 2012. Web. 09 Mar 2021.

Vancouver:

Olson B. Local Minima Hopping along the Protein Energy Surface . [Internet] [Thesis]. George Mason University; 2012. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1920/7479.

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

Council of Science Editors:

Olson B. Local Minima Hopping along the Protein Energy Surface . [Thesis]. George Mason University; 2012. Available from: http://hdl.handle.net/1920/7479

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

2. Melo, Everton Luiz de. Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total.

Degree: PhD, Engenharia de Produção, 2014, University of São Paulo

O ambiente de produção abordado neste trabalho é o Job Shop Flexível (JSF), uma generalização do Job Shop (JS). O problema de programação de tarefas,… (more)

Subjects/Keywords: Artificial Bee Colony; Artificial Bee Colony; Atraso total; Busca Local; Constructive heuristic; Flexible Job shop; GRASP; GRASP; Heurística construtiva; Iterated Local Search; Iterated Local Search; Job shop flexível; Local search; Meta-heurística; Metaheuristic; Mixed Integer Linear Programming; Programação de tarefas; Programação Linear Inteira Mista; Scheduling; Total tardiness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Melo, E. L. d. (2014). Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3136/tde-15122014-002717/ ;

Chicago Manual of Style (16th Edition):

Melo, Everton Luiz de. “Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total.” 2014. Doctoral Dissertation, University of São Paulo. Accessed March 09, 2021. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-15122014-002717/ ;.

MLA Handbook (7th Edition):

Melo, Everton Luiz de. “Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total.” 2014. Web. 09 Mar 2021.

Vancouver:

Melo ELd. Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total. [Internet] [Doctoral dissertation]. University of São Paulo; 2014. [cited 2021 Mar 09]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3136/tde-15122014-002717/ ;.

Council of Science Editors:

Melo ELd. Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total. [Doctoral Dissertation]. University of São Paulo; 2014. Available from: http://www.teses.usp.br/teses/disponiveis/3/3136/tde-15122014-002717/ ;


UNIVERSIDADE FEDERAL DE OURO PRETO

3. Matheus Nohra Haddad. ALGORITMOS HEURÃSTICOS HÃBRIDOS PARA O PROBLEMA DE SEQUENCIAMENTO EM MÃQUINAS PARALELAS NÃO-RELACIONADAS COM TEMPOS DE PREPARAÃÃO DEPENDENTES DA SEQUÃNCIA.

Degree: 2012, UNIVERSIDADE FEDERAL DE OURO PRETO

Este trabalho aborda o problema de sequenciamento em mÃquinas paralelas nÃorelacionadas com tempos de preparaÃÃo dependentes da sequÃncia, do inglÃs Unrelated Parallel Machine Scheduling Problem… (more)

Subjects/Keywords: Sequenciamento em mÃquinas paralelas; makespan; Iterated Local Search; Path Relinking; VND; GRASP; tempos de preparaÃÃo; unrelated parallel machine scheduling; makespan; Iterated Local Search; Path Relinking; VND; GRASP; setup times; MATEMATICA DA COMPUTACAO

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Haddad, M. N. (2012). ALGORITMOS HEURÃSTICOS HÃBRIDOS PARA O PROBLEMA DE SEQUENCIAMENTO EM MÃQUINAS PARALELAS NÃO-RELACIONADAS COM TEMPOS DE PREPARAÃÃO DEPENDENTES DA SEQUÃNCIA. (Thesis). UNIVERSIDADE FEDERAL DE OURO PRETO. Retrieved from http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=978

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):

Haddad, Matheus Nohra. “ALGORITMOS HEURÃSTICOS HÃBRIDOS PARA O PROBLEMA DE SEQUENCIAMENTO EM MÃQUINAS PARALELAS NÃO-RELACIONADAS COM TEMPOS DE PREPARAÃÃO DEPENDENTES DA SEQUÃNCIA.” 2012. Thesis, UNIVERSIDADE FEDERAL DE OURO PRETO. Accessed March 09, 2021. http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=978.

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

MLA Handbook (7th Edition):

Haddad, Matheus Nohra. “ALGORITMOS HEURÃSTICOS HÃBRIDOS PARA O PROBLEMA DE SEQUENCIAMENTO EM MÃQUINAS PARALELAS NÃO-RELACIONADAS COM TEMPOS DE PREPARAÃÃO DEPENDENTES DA SEQUÃNCIA.” 2012. Web. 09 Mar 2021.

Vancouver:

Haddad MN. ALGORITMOS HEURÃSTICOS HÃBRIDOS PARA O PROBLEMA DE SEQUENCIAMENTO EM MÃQUINAS PARALELAS NÃO-RELACIONADAS COM TEMPOS DE PREPARAÃÃO DEPENDENTES DA SEQUÃNCIA. [Internet] [Thesis]. UNIVERSIDADE FEDERAL DE OURO PRETO; 2012. [cited 2021 Mar 09]. Available from: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=978.

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

Council of Science Editors:

Haddad MN. ALGORITMOS HEURÃSTICOS HÃBRIDOS PARA O PROBLEMA DE SEQUENCIAMENTO EM MÃQUINAS PARALELAS NÃO-RELACIONADAS COM TEMPOS DE PREPARAÃÃO DEPENDENTES DA SEQUÃNCIA. [Thesis]. UNIVERSIDADE FEDERAL DE OURO PRETO; 2012. Available from: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=978

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


Pontifical Catholic University of Rio de Janeiro

4. [No author]. [en] A METAHEURISTIC FOR THE PIPE LAYING SUPPORT VESSELS SCHEDULING PROBLEM.

Degree: 2020, Pontifical Catholic University of Rio de Janeiro

[pt] Este trabalho tem como objetivo propor uma metaheurística Iterated Local Search para minimizar o tempo de término ponderado de jobs em problemas de escalonamento… (more)

Subjects/Keywords: [pt] METAHEURISTICAS; [pt] ESCALONAMENTO DE MAQUINAS PARALELAS; [pt] ITERATED LOCAL SEARCH; [pt] PLSV; [pt] OLEO E GAS; [en] METAHEURISTICS; [en] PARALLEL MACHINE SCHEDULING; [en] ITERATED LOCAL SEARCH; [en] PLSV; [en] OIL AND GAS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2020). [en] A METAHEURISTIC FOR THE PIPE LAYING SUPPORT VESSELS SCHEDULING PROBLEM. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=49124

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):

author], [No. “[en] A METAHEURISTIC FOR THE PIPE LAYING SUPPORT VESSELS SCHEDULING PROBLEM.” 2020. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed March 09, 2021. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=49124.

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

MLA Handbook (7th Edition):

author], [No. “[en] A METAHEURISTIC FOR THE PIPE LAYING SUPPORT VESSELS SCHEDULING PROBLEM.” 2020. Web. 09 Mar 2021.

Vancouver:

author] [. [en] A METAHEURISTIC FOR THE PIPE LAYING SUPPORT VESSELS SCHEDULING PROBLEM. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2020. [cited 2021 Mar 09]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=49124.

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

Council of Science Editors:

author] [. [en] A METAHEURISTIC FOR THE PIPE LAYING SUPPORT VESSELS SCHEDULING PROBLEM. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2020. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=49124

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

5. Thalén, Björn. Manpower planning for airline pilots : A tabu search approach.

Degree: The Institute of Technology, 2010, Linköping UniversityLinköping University

  The airline industry faces some of the largest and most complicated optimization problems among all industries today. A large part of their costs iscrew… (more)

Subjects/Keywords: Optimization; Tabu search; Meta-heuristics; Manpower planning; Airline; Pilot; Iterated Local Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thalén, B. (2010). Manpower planning for airline pilots : A tabu search approach. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-113268

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):

Thalén, Björn. “Manpower planning for airline pilots : A tabu search approach.” 2010. Thesis, Linköping UniversityLinköping University. Accessed March 09, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-113268.

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

MLA Handbook (7th Edition):

Thalén, Björn. “Manpower planning for airline pilots : A tabu search approach.” 2010. Web. 09 Mar 2021.

Vancouver:

Thalén B. Manpower planning for airline pilots : A tabu search approach. [Internet] [Thesis]. Linköping UniversityLinköping University; 2010. [cited 2021 Mar 09]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-113268.

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

Council of Science Editors:

Thalén B. Manpower planning for airline pilots : A tabu search approach. [Thesis]. Linköping UniversityLinköping University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-113268

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


UNIVERSIDADE FEDERAL DE OURO PRETO

6. 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 March 09, 2021. 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. 09 Mar 2021.

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 2021 Mar 09]. 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


UNIVERSIDADE FEDERAL DE OURO PRETO

7. Thaís Cotta Barbosa da Silva. GENILS-TS-CL-PR:Um algoritmo heurístico para resolução do Problema de Roteamento de Veículos com Coleta e Entrega Simultânea.

Degree: 2012, UNIVERSIDADE FEDERAL DE OURO PRETO

 Este trabalho tem seu foco no Problema de Roteamento de Veículos com Coleta e Entrega Simultânea (PRVCES). Dada a dificuldade de solução deste problema, é… (more)

Subjects/Keywords: Problema de Roteamento de Veículos com Coleta e Entrega Simultânea; Iterated Local Search; Descida em Vizinhança Variável; GENIUS; Inserção Mais Barata; Busca Tabu.; MATEMATICA DA COMPUTACAO

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silva, T. C. B. d. (2012). GENILS-TS-CL-PR:Um algoritmo heurístico para resolução do Problema de Roteamento de Veículos com Coleta e Entrega Simultânea. (Thesis). UNIVERSIDADE FEDERAL DE OURO PRETO. Retrieved from http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=819

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):

Silva, Thaís Cotta Barbosa da. “GENILS-TS-CL-PR:Um algoritmo heurístico para resolução do Problema de Roteamento de Veículos com Coleta e Entrega Simultânea.” 2012. Thesis, UNIVERSIDADE FEDERAL DE OURO PRETO. Accessed March 09, 2021. http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=819.

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

MLA Handbook (7th Edition):

Silva, Thaís Cotta Barbosa da. “GENILS-TS-CL-PR:Um algoritmo heurístico para resolução do Problema de Roteamento de Veículos com Coleta e Entrega Simultânea.” 2012. Web. 09 Mar 2021.

Vancouver:

Silva TCBd. GENILS-TS-CL-PR:Um algoritmo heurístico para resolução do Problema de Roteamento de Veículos com Coleta e Entrega Simultânea. [Internet] [Thesis]. UNIVERSIDADE FEDERAL DE OURO PRETO; 2012. [cited 2021 Mar 09]. Available from: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=819.

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

Council of Science Editors:

Silva TCBd. GENILS-TS-CL-PR:Um algoritmo heurístico para resolução do Problema de Roteamento de Veículos com Coleta e Entrega Simultânea. [Thesis]. UNIVERSIDADE FEDERAL DE OURO PRETO; 2012. Available from: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=819

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


University of Georgia

8. Brown, William Joshua. An iterated local search with adaptive memory applied to the snake in the box problem.

Degree: 2014, University of Georgia

 A snake-in-the box code, first described in [Kautzl, ope1958]n p, atih s ian n aa chordahypercube. Finding bounds for the longest snake aptr oveeacn h… (more)

Subjects/Keywords: snake-in-the-box; snake; coil; Gray code; error correcting code; circuit code; hypercube; iterated local search; ILS; adaptive memory; AMP; heuristic; metaheuristic; graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brown, W. J. (2014). An iterated local search with adaptive memory applied to the snake in the box problem. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/22310

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):

Brown, William Joshua. “An iterated local search with adaptive memory applied to the snake in the box problem.” 2014. Thesis, University of Georgia. Accessed March 09, 2021. http://hdl.handle.net/10724/22310.

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

MLA Handbook (7th Edition):

Brown, William Joshua. “An iterated local search with adaptive memory applied to the snake in the box problem.” 2014. Web. 09 Mar 2021.

Vancouver:

Brown WJ. An iterated local search with adaptive memory applied to the snake in the box problem. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10724/22310.

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

Council of Science Editors:

Brown WJ. An iterated local search with adaptive memory applied to the snake in the box problem. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/22310

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


Colorado State University

9. Watson, Jean-Paul. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem.

Degree: PhD, Computer Science, 2003, Colorado State University

Local search algorithms are among the most effective approaches for locating high-quality solutions to a wide range of combinatorial optimization problems. However, our theoretical understanding… (more)

Subjects/Keywords: random walk; tabu search; job-shop scheduling problem; empirical methods; local search algorithms; iterated local search; simulated annealing; Production scheduling  – Computer simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Watson, J. (2003). Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/26811

Chicago Manual of Style (16th Edition):

Watson, Jean-Paul. “Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem.” 2003. Doctoral Dissertation, Colorado State University. Accessed March 09, 2021. http://hdl.handle.net/10217/26811.

MLA Handbook (7th Edition):

Watson, Jean-Paul. “Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem.” 2003. Web. 09 Mar 2021.

Vancouver:

Watson J. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. [Internet] [Doctoral dissertation]. Colorado State University; 2003. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10217/26811.

Council of Science Editors:

Watson J. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. [Doctoral Dissertation]. Colorado State University; 2003. Available from: http://hdl.handle.net/10217/26811


Pontifical Catholic University of Rio de Janeiro

10. VICTOR ABU-MARRUL CARNEIRO DA CUNHA. [en] RESCHEDULING OF OIL EXPLORATION SUPPORT VESSELS WITHIN A METAHEURISTIC APPROACH.

Degree: 2017, Pontifical Catholic University of Rio de Janeiro

[pt] A dissertação aborda um problema real de reprogramação de uma frota de embarcações do tipo PLSV (Pipe Laying Support Vessel), responsáveis pelas interligações de… (more)

Subjects/Keywords: [pt] PROGRAMACAO DE NAVIOS; [en] PROGRAMMING OF SHIPS; [pt] LOGISTICA PETROLIFERA; [en] OIL LOGISTICS; [pt] PLSV; [en] PLSV; [pt] PROGRAMACAO DE MAQUINAS PARALELAS IDENTICAS; [en] IDENTICAL PARALLEL MACHINE SCHEDULING; [pt] METAHEURISTICA ILS; [en] METAHEURISTIC ITERATED LOCAL SEARCH; [pt] REPROGRAMACAO; [en] RESCHEDULING

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

CUNHA, V. A. C. D. (2017). [en] RESCHEDULING OF OIL EXPLORATION SUPPORT VESSELS WITHIN A METAHEURISTIC APPROACH. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=30908

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):

CUNHA, VICTOR ABU-MARRUL CARNEIRO DA. “[en] RESCHEDULING OF OIL EXPLORATION SUPPORT VESSELS WITHIN A METAHEURISTIC APPROACH.” 2017. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed March 09, 2021. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=30908.

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

MLA Handbook (7th Edition):

CUNHA, VICTOR ABU-MARRUL CARNEIRO DA. “[en] RESCHEDULING OF OIL EXPLORATION SUPPORT VESSELS WITHIN A METAHEURISTIC APPROACH.” 2017. Web. 09 Mar 2021.

Vancouver:

CUNHA VACD. [en] RESCHEDULING OF OIL EXPLORATION SUPPORT VESSELS WITHIN A METAHEURISTIC APPROACH. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2017. [cited 2021 Mar 09]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=30908.

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

Council of Science Editors:

CUNHA VACD. [en] RESCHEDULING OF OIL EXPLORATION SUPPORT VESSELS WITHIN A METAHEURISTIC APPROACH. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2017. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=30908

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

11. Montoya, Jose-Alejandro. Electric Vehicle Routing Problems : models and solution approaches : Problèmes de tournées de véhicules électriques : modèles et méthodes de résolution.

Degree: Docteur es, Informatique, 2016, Angers

Étant donné leur faible impact environnemental, l’utilisation des véhicules électriques dans les activités de service a beaucoup augmenté depuis quelques années. Cependant, leur déploiement est… (more)

Subjects/Keywords: Problèmes de tournées de véhicules électriques; Problèmes de tournées de techniciens; Problème de chargement sur une tournée fixée; Fonctions de chargement non linéaires; Matheuristique; Recherche locale itérative; Electric vehicle routing problems; Technician routing problems; Green vehicle routing problems; Fixed-Route vehicle charging problems; Non linear charging functions; Metaheuristic; Matheuristic; Iterated local search; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Montoya, J. (2016). Electric Vehicle Routing Problems : models and solution approaches : Problèmes de tournées de véhicules électriques : modèles et méthodes de résolution. (Doctoral Dissertation). Angers. Retrieved from http://www.theses.fr/2016ANGE0020

Chicago Manual of Style (16th Edition):

Montoya, Jose-Alejandro. “Electric Vehicle Routing Problems : models and solution approaches : Problèmes de tournées de véhicules électriques : modèles et méthodes de résolution.” 2016. Doctoral Dissertation, Angers. Accessed March 09, 2021. http://www.theses.fr/2016ANGE0020.

MLA Handbook (7th Edition):

Montoya, Jose-Alejandro. “Electric Vehicle Routing Problems : models and solution approaches : Problèmes de tournées de véhicules électriques : modèles et méthodes de résolution.” 2016. Web. 09 Mar 2021.

Vancouver:

Montoya J. Electric Vehicle Routing Problems : models and solution approaches : Problèmes de tournées de véhicules électriques : modèles et méthodes de résolution. [Internet] [Doctoral dissertation]. Angers; 2016. [cited 2021 Mar 09]. Available from: http://www.theses.fr/2016ANGE0020.

Council of Science Editors:

Montoya J. Electric Vehicle Routing Problems : models and solution approaches : Problèmes de tournées de véhicules électriques : modèles et méthodes de résolution. [Doctoral Dissertation]. Angers; 2016. Available from: http://www.theses.fr/2016ANGE0020

12. Adair, Jason. Improving the Generalisability of Brain Computer Interface Applications via Machine Learning and Search-Based Heuristics.

Degree: PhD, 2018, University of Stirling

 Brain Computer Interfaces (BCI) are a domain of hardware/software in which a user can interact with a machine without the need for motor activity, communicating… (more)

Subjects/Keywords: Machine Learning; BCI; Brain Computer Interface; Mutual Information; Iterated Local Search; Transfer Learning; Genetic Algorithms; Evolutionary Search; Heuristics; Brain Machine Interface; Brain-computer Interface; Brain-machine interfaces; Machine Learning; Computer science Mathematics

…102 6.2.1 Iterated Local Search . . . . . . . . . . . . . . . . . . . . . 103 x Contents… …6.2.2 Minimal Redundancy Maximal Relevance-Iterated Local Search… …Iterated Local Search (ILS) Algorithm [64]… …Figure 5.11 90 Comparison of error rates obtained by Iterated Local Search, and Iterated… …Harmony Search ICA Independent Component Analysis ILS Iterated Local Search ILS/GA… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Adair, J. (2018). Improving the Generalisability of Brain Computer Interface Applications via Machine Learning and Search-Based Heuristics. (Doctoral Dissertation). University of Stirling. Retrieved from http://hdl.handle.net/1893/29577

Chicago Manual of Style (16th Edition):

Adair, Jason. “Improving the Generalisability of Brain Computer Interface Applications via Machine Learning and Search-Based Heuristics.” 2018. Doctoral Dissertation, University of Stirling. Accessed March 09, 2021. http://hdl.handle.net/1893/29577.

MLA Handbook (7th Edition):

Adair, Jason. “Improving the Generalisability of Brain Computer Interface Applications via Machine Learning and Search-Based Heuristics.” 2018. Web. 09 Mar 2021.

Vancouver:

Adair J. Improving the Generalisability of Brain Computer Interface Applications via Machine Learning and Search-Based Heuristics. [Internet] [Doctoral dissertation]. University of Stirling; 2018. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1893/29577.

Council of Science Editors:

Adair J. Improving the Generalisability of Brain Computer Interface Applications via Machine Learning and Search-Based Heuristics. [Doctoral Dissertation]. University of Stirling; 2018. Available from: http://hdl.handle.net/1893/29577

13. Sainathuni, Bhanuteja. The Warehouse-Inventory-Transportation Problem for Multi-Echelon Supply Chains.

Degree: PhD, Engineering PhD, 2013, Wright State University

 Warehouses play a vital role in mitigating variations in supply and demand, and providing value-added services in a supply chain. However, our observation of supply… (more)

Subjects/Keywords: Operations Research; Engineering; Industrial Engineering; Warehousing; Warehouse Technology; Basic Products; Fashion Products; Iterated Local Search; Picker Blocking; Multi-Echelon; Three Phase Heuristic; Putaway Technologies; Picking Technologies; Workload Variation; Fashion Policies; Fashion Window

…develop an Iterated Local Search (ILS) based meta-heuristic optimization framework to… …the use of long term memory in the diversification process of the tabu search provides… …neighborhood search (VLNS) algorithm. The approach was tested on 50 and up to 75 customers… …II by employing a reactive tabu search algorithm with path-relinking. Their study differs… …randomized adaptive search procedure (GRASP). 2.1.4 Models on Warehouse Location, Design… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sainathuni, B. (2013). The Warehouse-Inventory-Transportation Problem for Multi-Echelon Supply Chains. (Doctoral Dissertation). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1389657641

Chicago Manual of Style (16th Edition):

Sainathuni, Bhanuteja. “The Warehouse-Inventory-Transportation Problem for Multi-Echelon Supply Chains.” 2013. Doctoral Dissertation, Wright State University. Accessed March 09, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=wright1389657641.

MLA Handbook (7th Edition):

Sainathuni, Bhanuteja. “The Warehouse-Inventory-Transportation Problem for Multi-Echelon Supply Chains.” 2013. Web. 09 Mar 2021.

Vancouver:

Sainathuni B. The Warehouse-Inventory-Transportation Problem for Multi-Echelon Supply Chains. [Internet] [Doctoral dissertation]. Wright State University; 2013. [cited 2021 Mar 09]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1389657641.

Council of Science Editors:

Sainathuni B. The Warehouse-Inventory-Transportation Problem for Multi-Echelon Supply Chains. [Doctoral Dissertation]. Wright State University; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1389657641

.