subject:(iterated local search)

George Mason University

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

Degree: 2012, George Mason University

URL: http://hdl.handle.net/1920/7479

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.teses.usp.br/teses/disponiveis/3/3136/tde-15122014-002717/ ;

►

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)

▼

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, ou jobs, no ambiente JS é classificado por Garey; Johnson e Sethi (1976) como NP-Difícil e o JSF é, no mínimo, tão difícil quanto o JS. O JSF é composto por um conjunto de jobs, cada qual constituído por operações. Cada operação deve ser processada individualmente, sem interrupção, em uma única máquina de um subconjunto de máquinas habilitadas. O principal critério de desempenho considerado é a minimização dos atrasos dos jobs. São apresentados modelos de Programação Linear Inteira Mista (PLIM) para minimizar o atraso total e o instante de término da última operação, o makespan. São propostas novas regras de prioridade dos jobs, além de adaptações de regras da literatura. Tais regras são utilizadas por heurísticas construtivas e são aliadas a estratégias cujo objetivo é explorar características específicas do JSF. Visando aprimorar as soluções inicialmente obtidas, são propostas buscas locais e outros mecanismos de melhoria utilizados no desenvolvimento de três meta-heurísticas de diferentes categorias. Essas meta-heurísticas são: Iterated Local Search (ILS), classificada como meta-heurística de trajetória; Greedy Randomized Adaptive Search (GRASP), meta-heurística construtiva; e Artificial Bee Colony (ABC), meta-heurística populacional recentemente proposta. Esses métodos foram selecionados por alcançarem bons resultados para diversos problemas de otimização da literatura. São realizados experimentos computacionais com 600 instâncias do JSF, permitindo comparações entre os métodos de resolução. Os resultados mostram que explorar as características do problema permite que uma das regras de prioridade propostas supere a melhor regra da literatura em 81% das instâncias. As meta-heurísticas ILS, GRASP e ABC chegam a conseguir mais de 31% de melhoria sobre as soluções iniciais e a obter atrasos, em média, somente 2,24% superiores aos das soluções ótimas. Também são propostas modificações nas meta-heurísticas que permitem obter melhorias ainda mais expressivas sem aumento do tempo de execução. Adicionalmente é estudada uma versão do JSF com operações de Montagem e Desmontagem (JSFMD) e os experimentos realizados com um conjunto de 150 instâncias também indicam o bom desempenho dos métodos desenvolvidos.

The production environment addressed herein is the Flexible Job Shop (FJS), a generalization of the Job Shop (JS). In the JS environment, the jobs scheduling problem is classified by Garey; Johnson and Sethi (1976) as NP-Hard and the FJS is at least as difficult as the JS. FJS is composed of a set of jobs, each consisting of operations. Each operation must be processed individually, without interruption, in a single machine of a subset of enabled machines. The main performance criterion is minimizing the jobs tardiness. Mixed Integer Linear Programming (MILP) models are presented. These models minimize the total tardiness and the completion time of the last operation,…

Advisors/Committee Members: search?q=%2Bpublisher%3A%22University%20of%20S%26%23227%3Bo%20Paulo%22%20%2Bcontributor%3A%28%22Ronconi%2C%20D%C3%83%C2%A9bora%20Pretti%22%29&pagesize-30">Ronconi, Débora Pretti.

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=978

►

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)

▼

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 with Sequence Dependent Setup Times, ou apenas UPMSPST. Neste problema hÃ um conjunto de tarefas e mÃquinas e a cada tarefa estÃ associado um tempo de processamento, que Ã diferente para cada mÃquina. Dadas duas tarefas, tambÃm existe um tempo de preparaÃÃo dependente da sequÃncia delas e da mÃquina utilizada. O objetivo considerado neste problema Ã minimizar o tempo mÃximo de conclusÃo do sequenciamento, o chamado makespan. O UPMSPST Ã muito encontrado no Ãmbito industrial e pertence Ã classe NP-difÃcil. Visando a sua resoluÃÃo, sÃo propostos trÃs algoritmos heurÃsticos hÃbridos. O primeiro, nomeado IVP, combina os procedimentos heurÃsticos Iterated Local Search (ILS), Variable Neighborhood Descent (VND) e Path Relinking (PR). O segundo, nomeado GIVP, difere do primeiro pelo fato de gerar a soluÃÃo inicial pela fase de construÃÃo Greedy Randomized Adaptive Search Procedure (GRASP), e nÃo por um procedimento guloso. O terceiro algoritmo, nomeado GIVMP, difere dos outros em trÃs estratÃgias: a fase PR utiliza a estratÃgia mixed relinking ao invÃs de backward relinking, as vizinhanÃas que formam o VND sÃo usadas em ordem aleatÃria a cada chamada e nÃo em ordem previamente denida; por m, o GIVMP inclui um mÃdulo de busca local feita pelo resolvedor CPLEX 12.1 de programaÃÃo matemÃtica. Este resolvedor Ã aplicado apenas Ã mÃquina gargalo do problema e utiliza um modelo de programaÃÃo inteira mista baseado no problema do Caixeiro Viajante AssimÃtrico. Para explorar o espaÃo de soluÃÃes sÃo utilizados movimentos de inserÃÃo e troca de tarefas entre mÃquinas. Para testar os algoritmos foram utilizados dois conjuntos de problemas-teste da literatura. Inicialmente eles foram comparados entre si em um conjunto reduzido de instÃncias, tendo-se vericado a superioridade do algoritmo GIVMP. Em seguida, este algoritmo foi comparado com outros seis da literatura, sendo dois no primeiro conjunto de problemas-teste e outros quatro no segundo. No primeiro conjunto vericou-se a superioridade absoluta do GIVMP sobre os dois algoritmos genÃticos da literatura, tendo-se encontrado desvios percentuais relativos mÃdios menores e novas melhores soluÃÃes. No segundo conjunto de problemas-teste vericou-se que o GIVMP tem desempenho inferior a um dos algoritmos, mas superior em relaÃÃo aos outros trÃs. Observa-se, no entanto, que neste segundo conjunto de problemas, nÃo foram disponibilizados os desvios percentuais relativos mÃdios dos algoritmos, mas apenas os desvios dos melhores valores encontrados, impedindo uma comparaÃÃo de robustez dos algoritmos.

This work addresses the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times, or just UPMSPST. In this problem there is a set of jobs and machines and for each job there is a processing time associated, which is dierent for each machine. Given two jobs, there is also a…

Advisors/Committee Members: search?q=%2Bpublisher%3A%22UNIVERSIDADE%20FEDERAL%20DE%20OURO%20PRETO%22%20%2Bcontributor%3A%28%22Haroldo%20Gambini%20Santos%22%29&pagesize-30">Haroldo Gambini Santos, search?q=%2Bpublisher%3A%22UNIVERSIDADE%20FEDERAL%20DE%20OURO%20PRETO%22%20%2Bcontributor%3A%28%22Jos%C3%83%C2%83%20Elias%20Claudio%20Arroyo%22%29&pagesize-30">JosÃ Elias Claudio Arroyo, search?q=%2Bpublisher%3A%22UNIVERSIDADE%20FEDERAL%20DE%20OURO%20PRETO%22%20%2Bcontributor%3A%28%22Alexandre%20Xavier%20Martins%22%29&pagesize-30">Alexandre Xavier Martins, search?q=%2Bpublisher%3A%22UNIVERSIDADE%20FEDERAL%20DE%20OURO%20PRETO%22%20%2Bcontributor%3A%28%22Frederico%20Gadelha%20Guimar%C3%83%C2%83es%22%29&pagesize-30">Frederico Gadelha GuimarÃes, search?q=%2Bpublisher%3A%22UNIVERSIDADE%20FEDERAL%20DE%20OURO%20PRETO%22%20%2Bcontributor%3A%28%22Marcone%20Jamilson%20Freitas%20Souza%22%29&pagesize-30">Marcone Jamilson Freitas Souza.

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=49124

►

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

▼

[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 de máquinas idênticas paralelas. O objetivo secundário do trabalho é propor uma solução prática para um problema real da companhia estudada em questão. A motivação para o trabalho consiste em uma aplicação prática na indústria de óleo e gás, onde os navios PLSV realizam operações em poços de forma ordenada e visando a antecipação dos poços de petróleo mais produtivos. As características do problema, tais quais: elegibilidade entre navio e operações, tempos de setup relativos à família de atividades, associações entre operações e poços e setups que dependem da chegada de material se adequam a modelagem baseada em escalonamento de máquinas paralelas idênticas. No trabalho uma introdução à respeito do tema é apresentada, em seguida é feita uma revisão da literatura sobre problemas de máquinas paralelas idênticas, a formulação matemática com a descrição do problema é apresentada, a metodologia contemplando representação da solução, heuristica construtiva, vizinhanças exploradas, busca local e Iterated Local Search é exposta, por fim são apresentados os resultados do método e as conclusões sobre o trabalho.

[en] This work objective is to propose an Iterated Local Search metaheuristic to minimize the weighted completion time of jobs on identical parallel machines scheduling problems. The secondary objective of this work is to propose a practical solution to the real problem of the studied company. The motivation of this work consists on a practical application in the Oil and Gas industry, where the PLSV vessels perform ordered operations in a set of wells aiming to maximize the oil production. The characteristics of the problem such as: eligibility between vessels and operations, setup times related to the family of activities, association between operations and wells and setup times depending on the material arrival fit well the identical parallel machine schedule modelling. In this work, an introduction about the theme is presented, followed by a literature review on identical parallel machine scheduling problems, the mathematical formulation with the problem description is presented, the methodology, including the solution representation, constructive heuristic, neighborhood structures, local search and Iterated Local Search is exposed, at last, the method results and conclusions of the work are summarized.

Advisors/Committee Members: search?q=%2Bpublisher%3A%22Pontifical%20Catholic%20University%20of%20Rio%20de%20Janeiro%22%20%2Bcontributor%3A%28%22RAFAEL%20MARTINELLI%20PINTO%22%29&pagesize-30">RAFAEL MARTINELLI PINTO, search?q=%2Bpublisher%3A%22Pontifical%20Catholic%20University%20of%20Rio%20de%20Janeiro%22%20%2Bcontributor%3A%28%22RAFAEL%20MARTINELLI%20PINTO%22%29&pagesize-30">RAFAEL MARTINELLI PINTO, search?q=%2Bpublisher%3A%22Pontifical%20Catholic%20University%20of%20Rio%20de%20Janeiro%22%20%2Bcontributor%3A%28%22RAFAEL%20MARTINELLI%20PINTO%22%29&pagesize-30">RAFAEL MARTINELLI PINTO, search?q=%2Bpublisher%3A%22Pontifical%20Catholic%20University%20of%20Rio%20de%20Janeiro%22%20%2Bcontributor%3A%28%22RAFAEL%20MARTINELLI%20PINTO%22%29&pagesize-30">RAFAEL MARTINELLI PINTO.

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-113268

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=1044

►

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)

▼

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 processed by a single machine, and before the execution of each job a time to prepare the machine is required, which is dened according to the sequence and the family of the job. Thus, the setup time is required only to perform two consecutive jobs belonging to dierent families. Two objectives were considered: the minimization of the makespan and the total weighted tardiness. In order to solve this problem, seven multi-objective algorithms were analyzed. The rst one is the Multi-objective Variable Neighborhood Search (MOVNS), which is a multi-objective optimization method based on Variable Neighborhood Search (VNS). The second and third ones are two variants of MOVNS found in the literature, here named MOVNS_Ottoni and MOVNS_Arroyo, which consists in adding an intensication procedure in the MOVNS. The fourth one is the Pareto Iterated Local Search (PILS), which is a multi-objective local search algorithm with similar features to the metaheuristics Iterated Local Search (ILS). The fth one is a variant of PILS proposed in this work, called PILS1, in which a new perturbation procedure is developed. The sixth and seventh ones are the Nondominated Sorting Genetic Algorithm II (NSGA-II) and the Strength Pareto Evolutionary Algorithm 2 (SPEA2), which are optimization methods based on the process of natural evolution for multi-objective problems. Among the seven algorithms, ve are based on local search: MOVNS, MOVNS_Ottoni, MOVNS_Arroyo, PILS and PILS1, and two other are populationbased: NSGA-II and SPEA2. These algorithms were compared according to cardinality, average distance, maximum distance, hypervolume dierence and epsilon metrics. The Computational results realized over test instances randomly generated show that PILS1 is statistically better than all other algorithms in relation to the cardinality, average distance, dierence of hypervolume and epsilon metrics, in terms of average results. The PILS1 produced also the best average result for the metric maximum distance; however, from the statistical analysis is not possible to arm that the dierence between it and the NSGA-II is signicant.

Este trabalho trata do Problema de Sequenciamento de Tarefas em Uma MÃquina com Tempo de PreparaÃÃo Dependente da SequÃncia e da FamÃlia. Nesse problema, um conjunto de tarefas devem ser processadas por uma mÃquina, sendo que antes da execuÃÃo de cada tarefa Ã necessÃrio um tempo para preparar a mÃquina, o qual Ã denido de acordo com a sequÃncia e a famÃlia da tarefa. Desta forma, o tempo de preparaÃÃo da mÃquina Ã requerido, apenas, para executar duas tarefas consecutivas que pertencem a famÃlias diferentes. Consideram-se os objetivos de minimizar o makespan e o atraso total ponderado. Para resolvÃ-lo, foram analisados sete algoritmos de otimizaÃÃo multiobjetivo. O primeiro Ã o Multi-objective Variable Neighborhood Search (MOVNS), que Ã um mÃtodo de otimizaÃÃo multiobjetivo baseado na…

Advisors/Committee Members: search?q=%2Bpublisher%3A%22UNIVERSIDADE%20FEDERAL%20DE%20OURO%20PRETO%22%20%2Bcontributor%3A%28%22Jos%C3%83%C2%83%20Elias%20Claudio%20Arroyo%22%29&pagesize-30">JosÃ Elias Claudio Arroyo, search?q=%2Bpublisher%3A%22UNIVERSIDADE%20FEDERAL%20DE%20OURO%20PRETO%22%20%2Bcontributor%3A%28%22Haroldo%20Gambini%20Santos%22%29&pagesize-30">Haroldo Gambini Santos, search?q=%2Bpublisher%3A%22UNIVERSIDADE%20FEDERAL%20DE%20OURO%20PRETO%22%20%2Bcontributor%3A%28%22Marcone%20Jamilson%20Freitas%20Souza%22%29&pagesize-30">Marcone Jamilson Freitas Souza.

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.tede.ufop.br/tde_busca/arquivo.php?codArquivo=819

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/10724/22310

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/10217/26811

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=30908

►

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

▼

[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 poços petrolíferos submarinos. O cronograma de curto prazo dessas embarcações está sujeito à inúmeras incertezas inerentes às operações realizadas, acarretando em ociosidade nas embarcações ou postergações na produção de petróleo, que podem resultar em prejuízo de milhões de reais. Uma metaheurística ILS (Iterated Local Search) é proposta para atender a frequente demanda por reprogramações dos PLSVs. O método é composto de uma fase inicial de viabilização, para tratar potenciais inconsistências nas programações. Na sequência, iterativamente, são realizadas perturbações na solução por meio de movimentos de swap e aplicada uma busca local baseada na vizinhança insert, a fim de fugir de ótimos locais e encontrar soluções que aprimorem o cronograma. Foram feitos experimentos com diferentes parâmetros e critérios do ILS, sendo definidas duas abordagens aplicadas a dez instâncias oriundas de uma programação real de PLSVs. A partir de uma função de avaliação, capaz de medir o impacto operacional na programação, o ILS proporcionou uma melhoria média nos cronogramas acima de 91 por cento, quando comparados aos cronogramas originais. As soluções foram obtidas em um tempo computacional médio de 30 minutos, aderente ao processo da companhia. Em função dos resultados alcançados, o método provou ser uma boa base para uma ferramenta de apoio à decisão para a reprogramação dos PLSVs.

[en] This dissertation addresses a real-life rescheduling problem of a Pipe Laying Support Vessels (PLSVs) fleet, in charge of subsea oil wells interconnections. The short-term schedule of these vessels is subject to uncertainties inherent to its operations, resulting in ships idleness or delays in oil production, which may lead to losses of millions of Brazilian Reais. A method based on the ILS (Iterated Local Search) metaheuristic is proposed to meet the frequent demand of PLSVs rescheduling. The first step of this method aims to find a feasible initial solution from an incoming schedule with potencial inconsistencies. The following steps consists in, iteratively, performing a perturbation on a solution through swap movements and applying a local search based on the insertion neighborhood, in order to escape from local optimal and find better solutions. Extensive preliminary experiments were conducted considering different ILS parameters setups. The two most performing setups were selected and applied to ten instances of a real PLSV schedule. Taking into account an objective function that measures the operational impact on schedules, the ILS provided an average improvement above 91 percent in schedules when compared to the original planning. These solutions were obtained in an average computational time of 30 minutes, which fits in the company process. The obtained results showed that the proposed method might be a basis for a decision support tool for the PLSVs rescheduling problem.

Advisors/Committee Members: search?q=%2Bpublisher%3A%22Pontifical%20Catholic%20University%20of%20Rio%20de%20Janeiro%22%20%2Bcontributor%3A%28%22SILVIO%20HAMACHER%22%29&pagesize-30">SILVIO HAMACHER.

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.theses.fr/2016ANGE0020

►

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

▼

É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 freiné par des contraintes techniques telles qu’une autonomie limitée et de longs temps de charge des batteries. La prise en compte de ces contraintes a mené à l’apparition de nouveaux problèmes de tournées de véhicules pour lesquels, en plus d’organiser les tournées,il faut décider où et de combien charger les batteries. Dans cette thèse nous nous intéressons à ces problèmes au travers de quatre études. La première concerne le développement d’une métaheuristique en deux phases simple mais performante pour résoudre un problème particulier appelé "Green VRP”. Dans la seconde, nous nous concentrons sur la modélisation d’un aspect essentiel dans ces problèmes : le processus de chargement des batteries. Nous étudions différentes stratégies pour modéliser ce processus et montrons l’importance de considérer la nature non linéaire des fonctions de chargement. Dans la troisième étude nous proposons une recherche locale itérative pour résoudre des problèmes avec des fonctions de chargement non linéaires. Nous introduisons un voisinage dédié aux décisions de chargement basé sur un nouveau problème de chargement sur une tournée fixée. Dans la dernière étude, nous traitons un problème réel de tournées de techniciens avec des véhicules classiques et électriques. Ce problème est résolu par une métaheuristique qui décompose le problème en plusieurs sous-problèmes plus simples résolus en parallèle, puis qui assemble des parties des solutions trouvées pour construire la solution finale.

Electric vehicles (evs) are one of the most promising technologies to reduce the greenhouse gas emissions. For this reason, the use of evs in service operations has dramatically increased in recent years. Despite their environmental benefits, evs still face technical constraints such as short autonomy and long charging times. Taking into account these constraints when planning ev operations leads to a new breed of vehicle routing problems (vrps), known as electricVrps (evrps). In addition, to the standard routing decisions, evrps are concerned with charging decisions: where and how much to charge. In this ph. D thesis, we address evrps through 4 different studies. In the first study, we tackle the green vehicle routing problem. To solve the problem, we propose a simple, yet effective, two-phase matheuristic. In the second study, we focus a key modelling aspects in evrps: the battery charging process. We study different strategies to model this process and show the importance of considering the nonlinear nature of the battery charging functions. InThe third study, we propose an iterated local search to tackle evrp with non-linear charging functions. We introduce a particular local search operator for the charging decisions based on a new fixedroute charging problem. The fourth and last study considers a real technician routing problem with conventional and…

Advisors/Committee Members: search?q=%2Bpublisher%3A%22Angers%22%20%2Bcontributor%3A%28%22Gu%C3%83%C2%A9ret%2C%20Christelle%22%29&pagesize-30">Guéret, Christelle (thesis director), search?q=%2Bpublisher%3A%22Angers%22%20%2Bcontributor%3A%28%22Mendoza%2C%20Jorge-Ernesto%22%29&pagesize-30">Mendoza, Jorge-Ernesto (thesis director), search?q=%2Bpublisher%3A%22Angers%22%20%2Bcontributor%3A%28%22Villegas%2C%20Juan%20Guillermo%22%29&pagesize-30">Villegas, Juan Guillermo (thesis director).

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/1893/29577

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

▼ 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 instead via signals generated by the nervous system. These interfaces provide life-altering benefits to users, and refinement will both allow their application to a much wider variety of disabilities, and increase their practicality. The primary method of acquiring these signals is Electroencephalography (EEG). This technique is susceptible to a variety of different sources of noise, which compounds the inherent problems in BCI training data: large dimensionality, low numbers of samples, and non-stationarity between users and recording sessions. Feature Selection and Transfer Learning have been used to overcome these problems, but they fail to account for several characteristics of BCI. This thesis extends both of these approaches by the use of Search-based algorithms. Feature Selection techniques, known as Wrappers use ‘black box’ evaluation of feature subsets, leading to higher classification accuracies than ranking methods known as Filters. However, Wrappers are more computationally expensive, and are prone to over-fitting to training data. In this thesis, we applied Iterated Local Search (ILS) to the BCI field for the first time in literature, and demonstrated competitive results with state-of-the-art methods such as Least Absolute Shrinkage and Selection Operator and Genetic Algorithms. We then developed ILS variants with guided perturbation operators. Linkage was used to develop a multivariate metric, Intrasolution Linkage. This takes into account pair-wise dependencies of features with the label, in the context of the solution. Intrasolution Linkage was then integrated into two ILS variants. The Intrasolution Linkage Score was discovered to have a stronger correlation with the solutions predictive accuracy on unseen data than Cross Validation Error (CVE) on the training set, the typical approach to feature subset evaluation. Mutual Information was used to create Minimum Redundancy Maximum Relevance Iterated Local Search (MRMR-ILS). In this algorithm, the perturbation operator was guided using an existing Mutual Information measure, and compared with current Filter and Wrapper methods. It was found to achieve generally lower CVE rates and higher predictive accuracy on unseen data than existing algorithms. It was also noted that solutions found by the MRMR-ILS provided CVE rates that had a stronger correlation with the accuracy on unseen data than solutions found by other algorithms. We suggest that this may be due to the guided perturbation leading to solutions that are richer in Mutual Information. Feature Selection reduces computational demands and can increase the accuracy of our desired models, as evidenced in this thesis. However, limited quantities of training samples restricts these models, and greatly reduces their generalisability. For this reason, utilisation of data from a wide range of users is an ideal solution. Due to the differences in…

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…

10 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://rave.ohiolink.edu/etdc/view?acc_num=wright1389657641

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

▼ 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 chain practice reveals that warehousing decisions are not included when developing a distribution plan for the supply chain. This lack of integration has resulted in substantial variation in workload (42%-220%) at our industry partner’s warehouse costing them millions of dollars. We address this real-world challenge by investigating the interdependencies between warehouse, inventory, and transportation decisions, integrate them in a mathematical programming model, and develop managerial insights based on solutions of industry-sized problem instances. Our three contributions to research in supply chain are as follows.First, we introduce the warehouse-inventory-transportation problem (WITP), which determines the optimal distribution strategy from vendors to customers via one or more warehouses in order to minimize total distribution costs. We model WITP as a nonlinear integer programming model considering multiple vendors, stores, products, and time-periods, and one warehouse. The model also considers worker congestion at the warehouse that could affect worker productivity. Our experiments indicate that the distribution plans obtained via the WITP, as compared to a sequential approach of solving an integrated inventory-transportation problem first and then solving the warehousing problem, result in a substantial reduction in workload variance at the warehouse, while considerably reducing the total distribution cost. These plans, however, are sensitive to the aisle configuration and technology at the warehouse, and the level and productivity of temporary workers. The state-of-the-art commercial solver could only solve small problem instances.Second, to solve industry-sized problems, we developed a heuristic framework. This framework incorporates key features from the well-established Iterated Local Search (ILS) meta-heuristic. The heuristic implements three sets of neighborhood moves intended to improve warehousing, inventory, and transportation costs. It searches for a better solution in two alternating phases, a local search phase and a perturbation phase. We found that the solutions from the heuristic were close to optimal on small problem instances. Additionally, the heuristic was able to solve efficiently industry-sized problems with up to 500 stores and 1,000 products. Third, we extend the WITP to model distribution decisions for supply chains that manage the flow of products with varying life cycles. The varying demand patterns of such products (e.g., basic and fashion) require different sets of decisions with different objectives; cost-efficiency for basic products and time-effectiveness for fashion products. These differences are typically handled by supply chains separately when planning for inventory and transportation. But these decisions are not necessarily separable from a warehousing perspective as both these product classes are… Advisors/Committee Members: search?q=%2Bpublisher%3A%22Wright%20State%20University%22%20%2Bcontributor%3A%28%22Parikh%2C%20Pratik%22%29&pagesize-30">Parikh, Pratik (Advisor).

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…

7 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations