You searched for subject:(tabu search).
Showing records 1 – 30 of
221 total matches.
◁ [1] [2] [3] [4] [5] [6] [7] [8] ▶
Oregon State University
1.
Boston, Kevin Donald.
Using Tabu Search to solve tactical forest planning problems with spatial wildlife habitat goals and constraints.
Degree: PhD, Forest Engineering, 1996, Oregon State University
URL: http://hdl.handle.net/1957/9390 
► A method was developed to formulate and solve a fifty-year tactical harvest scheduling problem that included spatial wildlife habitat goals and constraints for a 4800-acre…
(more)
▼ A method was developed to formulate and solve a fifty-year tactical harvest scheduling problem that included spatial wildlife habitat goals and constraints for a 4800-acre watershed in Northwestern Oregon under four scenarios. Three goals and two habitat constraints were included in each scenario. The first goal was a volume goal. The second goal was a landscape aggregation goal measured with the contagion index. The third goal was a shape goal using the ratio of the existing perimeter of closed-canopy stands with that of a circle with equivalent area. The first constraint required a minimum cluster of connected closed-canopy stands that spanned opposite edges of a map. The second constraint limited the maximum opening created in any period. The algorithm included both fixed and variable cost components for the transportation network.
Tabu Search with both short-term memory restriction and a long-term diversification strategy was used to solve this ten-period problem. The performance of the heuristic was measured by comparing the results with an estimate of the optimal value obtained from extreme value theory using a three-parameter Weibull distribution. In scenario one, the shape goal was reached in most periods and the average
contagion index was 0.35. The volume goal was met or exceeded in all periods. The heuristic found one solution within 2 percent of the estimated optimal value, while 75 percent of the solutions were within 80 percent of the estimated optimal value. In scenario two, the average contagion index was 0.40. The goal was met in over 50 percent of the periods. The volume and shape goals were met or exceeded in all periods. The heuristic found one solution within 6 percent of the estimated optimal value, while the remaining solutions were within 83 percent of the estimated optimal value. Two additional scenarios were developed to create specific wildlife habitat. Scenario three developed high quality habitat for pine marten containing a connected landscape of closed-canopy stands with minimum edge habitat. Scenario four was developed for elk. This analysis produced habitat with a mixture of open and closed-canopy stands in a dispersed pattern.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Oregon%20State%20University%22%20%2Bcontributor%3A%28%22Sessions%2C%20John%22%29&pagesize-30">Sessions, John (advisor).
Subjects/Keywords: Tabu Search
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Boston, K. D. (1996). Using Tabu Search to solve tactical forest planning problems with spatial wildlife habitat goals and constraints. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/9390
Chicago Manual of Style (16th Edition):
Boston, Kevin Donald. “Using Tabu Search to solve tactical forest planning problems with spatial wildlife habitat goals and constraints.” 1996. Doctoral Dissertation, Oregon State University. Accessed March 09, 2021.
http://hdl.handle.net/1957/9390.
MLA Handbook (7th Edition):
Boston, Kevin Donald. “Using Tabu Search to solve tactical forest planning problems with spatial wildlife habitat goals and constraints.” 1996. Web. 09 Mar 2021.
Vancouver:
Boston KD. Using Tabu Search to solve tactical forest planning problems with spatial wildlife habitat goals and constraints. [Internet] [Doctoral dissertation]. Oregon State University; 1996. [cited 2021 Mar 09].
Available from: http://hdl.handle.net/1957/9390.
Council of Science Editors:
Boston KD. Using Tabu Search to solve tactical forest planning problems with spatial wildlife habitat goals and constraints. [Doctoral Dissertation]. Oregon State University; 1996. Available from: http://hdl.handle.net/1957/9390
Brunel University
2.
Benjamin, Aida Mauziah.
Metaheuristics for the waste collection vehicle routing problem with time windows.
Degree: PhD, 2011, Brunel University
URL: http://bura.brunel.ac.uk/handle/2438/5254
;
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.535946
► In this thesis there is a set of waste disposal facilities, a set of customers at which waste is collected and an unlimited number of…
(more)
▼ In this thesis there is a set of waste disposal facilities, a set of customers at which waste is collected and an unlimited number of homogeneous vehicles based at a single depot. Empty vehicles leave the depot and collect waste from customers, emptying themselves at the waste disposal facilities as and when necessary. Vehicles return to the depot empty. We take into consideration time windows associated with customers, disposal facilities and the depot. We also have a driver rest period. The problem is solved heuristically. A neighbour set is defined for each customer as the set of customers that are close, but with compatible time windows. This thesis uses six different procedures to obtain initial solutions for the problem. Then, the initial solutions from these procedures are improved in terms of the distance travelled using our phase 1 and phase 2 procedures, whereas we reduce the number of vehicles used using our vehicle reduction (VR) procedure. In a further attempt to improve the solutions three metaheuristic algorithms are presented, namely tabu search (TS), variable neighbourhood search (VNS) and variable neighbourhood tabu search (VNTS). Moreover, we present a modified disposal facility positioning (DFP), reverse order and change tracking procedures. Using all these procedures presented in the thesis, four solution procedures are reported for the two benchmark problem sets, namely waste collection vehicle routing problems with time windows (VRPTW) and multi-depot vehicle routing problem with inter-depot routes (MDVRPI). Our solutions for the waste collection VRPTW problems are compared with the solutions from Kim et al (2006), and our solutions for the MDVRPI problems are compared with Crevier et al (2007). Computational results for the waste collection VRPTW problems indicate that our algorithms produce better quality solutions than Kim et al (2006) in terms of both distance travelled and number of vehicles used. However for the MDVRPI problems, solutions from Crevier et al (2007) outperform our solutions.
Subjects/Keywords: 519; Disposal facilities; Driver rest period; Tabu search; Variable neighbourhood search; Variable neighbourhood Tabu search
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Benjamin, A. M. (2011). Metaheuristics for the waste collection vehicle routing problem with time windows. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/5254 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.535946
Chicago Manual of Style (16th Edition):
Benjamin, Aida Mauziah. “Metaheuristics for the waste collection vehicle routing problem with time windows.” 2011. Doctoral Dissertation, Brunel University. Accessed March 09, 2021.
http://bura.brunel.ac.uk/handle/2438/5254 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.535946.
MLA Handbook (7th Edition):
Benjamin, Aida Mauziah. “Metaheuristics for the waste collection vehicle routing problem with time windows.” 2011. Web. 09 Mar 2021.
Vancouver:
Benjamin AM. Metaheuristics for the waste collection vehicle routing problem with time windows. [Internet] [Doctoral dissertation]. Brunel University; 2011. [cited 2021 Mar 09].
Available from: http://bura.brunel.ac.uk/handle/2438/5254 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.535946.
Council of Science Editors:
Benjamin AM. Metaheuristics for the waste collection vehicle routing problem with time windows. [Doctoral Dissertation]. Brunel University; 2011. Available from: http://bura.brunel.ac.uk/handle/2438/5254 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.535946
3.
Hällgren, Eric Caap.
Rescheduling blocked Vehicles at Daimler AG.
Degree: The Institute of Technology, 2012, Linköping UniversityLinköping University
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81455
► The purpose of this thesis is to develop a heuristic solution for the static problem of resequencing unblocked vehicles as a part of an…
(more)
▼ The purpose of this thesis is to develop a heuristic solution for the static problem of resequencing unblocked vehicles as a part of an ongoing research project at Daimler AG. The target client of this project is Mercedes-Benz Cars. An unblocked vehicle is defined as a vehicle that for some reason could not be processed in its given time slot but at a later point in time needs to be inserted into the production sequence. Work overload is defined as work that the worker is unable to finish prior to reaching the station border. The resequencing problem can be described as finding new positions for a set of unblocked vehicles in a sequence of previously not blocked vehicles, such that the new sequence containing the previously not blocked vehicles and the additional unblocked vehicles causes as little work overload as possible. A decision has to be made in real-time, forcing the solution method to return a solution within a cycle time. Today, Mercedes-Benz Cars uses the sequencing approach “car sequencing”. This approach relies on so called spacing constraints, which basically means, trying to distribute work intensive vehicles as evenly as possible over the planning horizon and thereby enabling a hopefully smooth production. The car sequencing approach needs limited information. The difficulty is to find spacing constraints that fits the high level of product customization characterizing a modern car manufacturer. To overcome these difficulties, a new approach is being considered, namely the mixed-model sequencing, which takes more detailed data into account than the car sequencing approach but on the other hand is more costly in terms of computation. To this end, a simple but promising tabu search scheme was developed, that for many instances was able to find the optimal solution in less than 30 seconds of computing time and that also clearly outperformed all benchmark heuristics.
Subjects/Keywords: Rescheduling mixed-model sequencing tabu search metaheuristic
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hällgren, E. C. (2012). Rescheduling blocked Vehicles at Daimler AG. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81455
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):
Hällgren, Eric Caap. “Rescheduling blocked Vehicles at Daimler AG.” 2012. Thesis, Linköping UniversityLinköping University. Accessed March 09, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81455.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Hällgren, Eric Caap. “Rescheduling blocked Vehicles at Daimler AG.” 2012. Web. 09 Mar 2021.
Vancouver:
Hällgren EC. Rescheduling blocked Vehicles at Daimler AG. [Internet] [Thesis]. Linköping UniversityLinköping University; 2012. [cited 2021 Mar 09].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81455.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Hällgren EC. Rescheduling blocked Vehicles at Daimler AG. [Thesis]. Linköping UniversityLinköping University; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81455
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Windsor
4.
Raichandani, Jay.
Tabu Search Energy Optimization of Optical Grid Networks.
Degree: MS, Computer Science, 2016, University of Windsor
URL: https://scholar.uwindsor.ca/etd/5761
► The exponential growth in the Information and Communication Technology (ICT) sector has resulted in increased power consumption and there is growing recognition of the need…
(more)
▼ The exponential growth in the Information and Communication Technology (ICT) sector has resulted in increased power consumption and there is growing recognition of the need to develop more energy efficient networks. It has been shown in the literature that energy aware routing schemes for wavelength division multiplexing (WDM) optical networks can significantly reduce the overall energy consumption on the network. Much of the recent work has concentrated on switching off the unused network components during low utilization periods. In this thesis, we present a comprehensive heuristic algorithm that performs routing and wavelength assignment (RWA) and minimizes the overall energy consumption of a set of static lightpath demands, using
Tabu search principle. We consider both unicast and anycast traffic models and investigate whether the additional flexibility of anycast routing can be exploited to further reduce network energy consumption.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22University%20of%20Windsor%22%20%2Bcontributor%3A%28%22Jaekel%2C%20Arunita%22%29&pagesize-30">Jaekel, Arunita.
Subjects/Keywords: Anycast; Energy Efficient; Optical Grid; Tabu Search
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Raichandani, J. (2016). Tabu Search Energy Optimization of Optical Grid Networks. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5761
Chicago Manual of Style (16th Edition):
Raichandani, Jay. “Tabu Search Energy Optimization of Optical Grid Networks.” 2016. Masters Thesis, University of Windsor. Accessed March 09, 2021.
https://scholar.uwindsor.ca/etd/5761.
MLA Handbook (7th Edition):
Raichandani, Jay. “Tabu Search Energy Optimization of Optical Grid Networks.” 2016. Web. 09 Mar 2021.
Vancouver:
Raichandani J. Tabu Search Energy Optimization of Optical Grid Networks. [Internet] [Masters thesis]. University of Windsor; 2016. [cited 2021 Mar 09].
Available from: https://scholar.uwindsor.ca/etd/5761.
Council of Science Editors:
Raichandani J. Tabu Search Energy Optimization of Optical Grid Networks. [Masters Thesis]. University of Windsor; 2016. Available from: https://scholar.uwindsor.ca/etd/5761
University of Kansas
5.
Hacker, Joseph.
Computational Molecular Design Using Tabu Search.
Degree: MS, Chemical & Petroleum Engineering, 2012, University of Kansas
URL: http://hdl.handle.net/1808/9839
► The focus of this project is the use of computational molecular design (CMD) in the design of novel crosslinked polymers. A design example was completed…
(more)
▼ The focus of this project is the use of computational molecular design (CMD) in the design of novel crosslinked polymers. A design example was completed for a dimethacrylate as part of a comonomer used in dental restoration, with the goal to create a dental adhesive with a longer clinical lifetime than those already on the market. The CMD methodology begins with the calculation of molecular descriptors that describe the crosslinked polymer structure. Connectivity index are used as the primary set of descriptors, and have been used successfully in other CMD projects. Quantitative structure property relationships (QSPRs) were developed relating the structural descriptors to the experimentally collected property data. Models were chosen using Mallows' Cp with correlation coefficient significance. Desirable target property values were chosen which lead to an improved clinical lifetime. Structural constraints were defined to increase stability and ease of synthesis. The
Tabu Search optimization algorithm was used to design polymers with desirable properties. Finally, a prediction interval was calculated for each candidate to represent the possible error in the predicted properties. The described methodology provides a list of candidate monomers with predicted properties near the desired target values, which are selected such that the adhesives will show improved propertoes relative to the standard HEMA/BisGMA formulation. The methodology can be easily altered to allow for additional property calculations and structural constraints. This methodology can also be used for molecular design projects beyond crosslinked polymers.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22University%20of%20Kansas%22%20%2Bcontributor%3A%28%22Camarda%2C%20Kyle%22%29&pagesize-30">Camarda, Kyle (advisor),
search?q=%2Bpublisher%3A%22University%20of%20Kansas%22%20%2Bcontributor%3A%28%22Gehrke%2C%20Stevin%22%29&pagesize-30">Gehrke, Stevin (cmtemember),
search?q=%2Bpublisher%3A%22University%20of%20Kansas%22%20%2Bcontributor%3A%28%22Kieweg%2C%20Sarah%22%29&pagesize-30">Kieweg, Sarah (cmtemember).
Subjects/Keywords: Chemical engineering; Molecular design; Tabu search
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hacker, J. (2012). Computational Molecular Design Using Tabu Search. (Masters Thesis). University of Kansas. Retrieved from http://hdl.handle.net/1808/9839
Chicago Manual of Style (16th Edition):
Hacker, Joseph. “Computational Molecular Design Using Tabu Search.” 2012. Masters Thesis, University of Kansas. Accessed March 09, 2021.
http://hdl.handle.net/1808/9839.
MLA Handbook (7th Edition):
Hacker, Joseph. “Computational Molecular Design Using Tabu Search.” 2012. Web. 09 Mar 2021.
Vancouver:
Hacker J. Computational Molecular Design Using Tabu Search. [Internet] [Masters thesis]. University of Kansas; 2012. [cited 2021 Mar 09].
Available from: http://hdl.handle.net/1808/9839.
Council of Science Editors:
Hacker J. Computational Molecular Design Using Tabu Search. [Masters Thesis]. University of Kansas; 2012. Available from: http://hdl.handle.net/1808/9839
Linköping University
6.
Hölscher, Anton.
A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem.
Degree: Artificial Intelligence and Integrated Computer Systems, 2018, Linköping University
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153631
► This study aims to answer whether a heuristic that trades cycles between the tours in a solution would show good results when trying to…
(more)
▼ This study aims to answer whether a heuristic that trades cycles between the tours in a solution would show good results when trying to solve the Weighted k-Chinese Postman Problem for undirected graphs, of varying size, representing neighbourhoods in Sweden.A tabu search heuristic was implemented with each iteration consisting of giving a cycle from the most expensive tour to the cheapest. The heuristic performed increasingly well for graphs of increasing size, although the solution quality decreased when increasing the number of tours to be used in the solution. It is suspected that the cause for this behavior is due to the heuristic only giving cycles from the most expensive tour, not considering trading cycles from other tours in the solution. It is believed that a heuristic considering more than only the most expensive tour when trading cycles would produce even better solutions.
Subjects/Keywords: weighted k-chinese postman problem heuristic tabu search metaheuristic tabu search; Computer Sciences; Datavetenskap (datalogi)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hölscher, A. (2018). A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153631
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):
Hölscher, Anton. “A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem.” 2018. Thesis, Linköping University. Accessed March 09, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153631.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Hölscher, Anton. “A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem.” 2018. Web. 09 Mar 2021.
Vancouver:
Hölscher A. A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem. [Internet] [Thesis]. Linköping University; 2018. [cited 2021 Mar 09].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153631.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Hölscher A. A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem. [Thesis]. Linköping University; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153631
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
7.
Cláudia Rossana Cunha.
Metaheurística Híbrida GRASP e Busca Tabu Aplicada ao Problema de Escalonamento de Tarefas.
Degree: 2010, Universidade Federal da Paraíba
URL: http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=2026
► This work approaches the problem of the tasks scheduling (Job Shop Scheduling) through the combination of the GRASP and Tabu Search metaheuristics. The study consists…
(more)
▼ This work approaches the problem of the tasks scheduling (Job Shop Scheduling) through the combination of the GRASP and Tabu Search metaheuristics. The study consists of using the GRASP (Greedy Randomized Adaptive Search Procedure) in the construction phase of the initial solution, suggesting for that, a specific procedure based on Coffman Gramah algorithm. However, such procedure was the great differential in this study, since it offers an initial solution qualitatively better, what allows the reduction of the local search time, where it was utilized the Tabu Search metaheuristic in the local search phase, which provided best results when it was compared with other metaheuristics that have the same structural base. The combination GRASP and Tabu Search were evaluated under two differentiated implementations, being one with Tabu Search in its form more simplified and another one with Tabu Search developing a process of optimized search, using an aditional mathematical model, which demonstrated great advancements in relation at processing time and the obtained results. The computational results, when compared with the existing ones in literature, they had shown that GRASP and Tabu Search combination are capable to produce good solutions.
Este trabalho aborda o problema de escalonamento de tarefas (Job Shop Scheduling) através da combinação das metaheurísticas GRASP e Busca Tabu. O estudo consiste em utilizar o GRASP na fase de construção da solução inicial, sugerindo, para tanto, um procedimento específico baseado no algoritmo de Coffman Gramah. Tal procedimento foi o grande diferencial deste trabalho, visto que oferece uma solução inicial qualitativamente superior, permitindo a redução do tempo de busca local, onde foi utilizada a metaheurística Busca Tabu, a qual demonstrou proporcionar melhores resultados, comparando-se com outras metaheurísticas que seguem a mesma base estrutural. A combinação GRASP e Busca Tabu foi avaliada sob duas implementações diferenciadas, sendo uma com a Busca Tabu em sua forma mais simplificada e outra com a Busca Tabu desenvolvendo um processo de busca otimizada com o auxílio de um modelo matemático , a qual demonstrou grandes progressos quanto ao tempo de processamento e a obtenção de resultados. Os resultados computacionais obtidos, quando comparados com os existentes na literatura, mostraram que a combinação GRASP e Busca Tabu é capaz de produzir boas soluções.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Universidade%20Federal%20da%20Para%C3%83%C2%ADba%22%20%2Bcontributor%3A%28%22Luc%C3%83%C2%ADdio%20dos%20Anjos%20Formiga%20Cabral%22%29&pagesize-30">Lucídio dos Anjos Formiga Cabral.
Subjects/Keywords: CIENCIA DA COMPUTACAO; Job Shop Scheduling; GRASP; Tabu Search; Busca Tabu; GRASP; Escalonamento de processos
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Cunha, C. R. (2010). Metaheurística Híbrida GRASP e Busca Tabu Aplicada ao Problema de Escalonamento de Tarefas. (Thesis). Universidade Federal da Paraíba. Retrieved from http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=2026
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, Cláudia Rossana. “Metaheurística Híbrida GRASP e Busca Tabu Aplicada ao Problema de Escalonamento de Tarefas.” 2010. Thesis, Universidade Federal da Paraíba. Accessed March 09, 2021.
http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=2026.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Cunha, Cláudia Rossana. “Metaheurística Híbrida GRASP e Busca Tabu Aplicada ao Problema de Escalonamento de Tarefas.” 2010. Web. 09 Mar 2021.
Vancouver:
Cunha CR. Metaheurística Híbrida GRASP e Busca Tabu Aplicada ao Problema de Escalonamento de Tarefas. [Internet] [Thesis]. Universidade Federal da Paraíba; 2010. [cited 2021 Mar 09].
Available from: http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=2026.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Cunha CR. Metaheurística Híbrida GRASP e Busca Tabu Aplicada ao Problema de Escalonamento de Tarefas. [Thesis]. Universidade Federal da Paraíba; 2010. Available from: http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=2026
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
8.
Rodrigo Frank de Souza Gomes.
AplicaÃÃo da metaheurÃstica tabu search na otimizaÃÃo de rotas de manutenÃÃo preventiva em campo.
Degree: Master, 2011, Universidade Federal do Ceará
URL: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7175
;
► O objetivo deste trabalho foi propor uma aplicaÃÃo baseada na metaheurÃstica Busca Tabu (TS) para ser utilizada em serviÃos de manutenÃÃo preventiva em campo (FPMS)…
(more)
▼ O objetivo deste trabalho foi propor uma aplicaÃÃo baseada na metaheurÃstica Busca Tabu (TS) para ser utilizada em serviÃos de manutenÃÃo preventiva em campo (FPMS) a fim de obter maior eficiÃncia logÃstica, atravÃs do roteamento de setores de manutenÃÃo. Ao contrÃrio dos serviÃos realizados na indÃstria, onde todos os sistemas, mÃquinas e equipamentos estÃo localizados praticamente no mesmo local, serviÃos de manutenÃÃo em campo requerem um componente adicional diretamente relacionado ao custo, que se refere exatamente a diferenÃa entre a unidade de base e local de trabalho. ServiÃos em campo podem ser considerados uma variaÃÃo do Problema do Caixeiro Viajante (PCV) e suas diferentes abordagens, como o Problema DinÃmico do Reparador Viajante (DTRP - Dynamic Travelling Repairman Problem) proposto por Bertsimas e Van Ryzin. Em situaÃÃes prÃticas do dia-a-dia existe uma enorme demanda por serviÃos de manutenÃÃo a serem realizados em campo, demonstrando sua relevÃncia: elevadores, escadas rolantes, aparelhos seguranÃa eletrÃnica residencial, suporte de TI Ã hardwares, entre outros. O mÃtodo foi implementado e testado em problemas da biblioteca TSP-LIBRARY variando de 17 a 280 pontos. Boas soluÃÃes foram encontradas em um tempo de processamento aceitÃvel. O input do problema leva em consideraÃÃo duas formas: coordenadas geogrÃficas ou coordenadas cartesianas. Para uma aplicaÃÃo prÃtica do mundo real, foi considerada uma empresa de manutenÃÃo em elevadores e os resultados tambÃm foram eficientes, reduzindo bastante os custos de transporte e a logÃstica empregada na operaÃÃo.
The aim of this paper was to propose an application based on the Metaheuristic Tabu Search (TS) to be used on FIELD PREVENTIVE MAINTENANCE SERVICES (FPMS) in order to get more logistics efficiency by routing maintenance sectors. Unlike services performed in industry, where all systems, machines and equipment are located practically in the same location, maintenance services in the field require an additional component directly related to cost, which refers to exactly offset between the base unit and jobsite. Services in the field can be considered a variation of the Travelling Salesman Problem (TSP) and its different approaches, like the DTRP (Dynamic Travelling Repairman Problem) proposed by Bertsimas and Van Ryzin. There is a huge demand for maintenance in the field, demonstrating its relevance: elevators, escalators, electronic devices for home-security, IT hardware support and others. The method was designed, implemented and tested in problems of the TSP-LIBRARY ranging from 17 up to 280 points. Good solutions were found in a acceptable processing time. The input data can be made by geographical coordinates or 2D-coordinates. For a real-world application, it was considered an Elevator Company and the results were also efficient, greatly reducing transportation cost and logistics used in the operation.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Universidade%20Federal%20do%20Cear%26%23225%22%20%2Bcontributor%3A%28%22Jos%C3%83%C2%83%20Lassance%20de%20Castro%20Silva%22%29&pagesize-30">Josà Lassance de Castro Silva.
Subjects/Keywords: PESQUISA OPERACIONAL; OtimizaÃÃo combinatÃria; optimization, maintenance on field, TSP, Tabu Search; ManutenÃÃo; PCV; Busca Tabu
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Gomes, R. F. d. S. (2011). AplicaÃÃo da metaheurÃstica tabu search na otimizaÃÃo de rotas de manutenÃÃo preventiva em campo. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7175 ;
Chicago Manual of Style (16th Edition):
Gomes, Rodrigo Frank de Souza. “AplicaÃÃo da metaheurÃstica tabu search na otimizaÃÃo de rotas de manutenÃÃo preventiva em campo.” 2011. Masters Thesis, Universidade Federal do Ceará. Accessed March 09, 2021.
http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7175 ;.
MLA Handbook (7th Edition):
Gomes, Rodrigo Frank de Souza. “AplicaÃÃo da metaheurÃstica tabu search na otimizaÃÃo de rotas de manutenÃÃo preventiva em campo.” 2011. Web. 09 Mar 2021.
Vancouver:
Gomes RFdS. AplicaÃÃo da metaheurÃstica tabu search na otimizaÃÃo de rotas de manutenÃÃo preventiva em campo. [Internet] [Masters thesis]. Universidade Federal do Ceará 2011. [cited 2021 Mar 09].
Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7175 ;.
Council of Science Editors:
Gomes RFdS. AplicaÃÃo da metaheurÃstica tabu search na otimizaÃÃo de rotas de manutenÃÃo preventiva em campo. [Masters Thesis]. Universidade Federal do Ceará 2011. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7175 ;
Kaunas University of Technology
9.
Kairaitis,
Gediminas.
Tvarkaraščių sudarymo uždavinių ir jų algoritmų
tyrimas.
Degree: Master, Mathematics, 2010, Kaunas University of Technology
URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100825_101713-01675
;
► Tvarkaraščių sudarymo uždaviniai – viena iš sunkiau sprendžiamų problemų, kylančių įvairiose gamybinėse struktūrose, grupė. Darbo pradžioje supažindinama su bendrais tvarkaraščių sudarymo uždavinių bruožais ir jų…
(more)
▼ Tvarkaraščių sudarymo uždaviniai – viena iš
sunkiau sprendžiamų problemų, kylančių įvairiose gamybinėse
struktūrose, grupė. Darbo pradžioje supažindinama su bendrais
tvarkaraščių sudarymo uždavinių bruožais ir jų sprendimo
algoritmais. Detaliau nagrinėti šiame darbe parenkamas vienas
sunkiausių gamybinių tvarkaraščių ir apskritai kombinatorinių
optimizavimo uždavinių – darbo fabriko uždavinys (angl. job shop
scheduling problem), kuris be abejo nėra tiksliai sprendžiamas per
polinominį sprendimo laiką. Šio uždavinio pradiniai duomenys yra
duotos darbų ir įrenginių aibės. Kiekvienas darbas apdorojamas
specifine įrenginių tvarka. Uždavinio tikslas – minimizuoti visų
darbų atlikimo laiką. Šiam uždaviniui spręsti pristatėme du
apytikslius tabu – atkaitinimo modeliavimo bei paieškos kintamose
aplinkose algoritmus, priklausančius metaeuristinių metodų šeimai.
Iš tabu – atkaitinimo modeliavimo galima nesunkiai gauti paprastą
tabu paiešką, tad prie dviejų minėtų algoritmų galima pridėti ir
paprastąją tabu paiešką. Šiame darbe atlikta minėtų algoritmų
programinė realizacija. Pristatytų algoritmų efektyvumui įvertinti
ir algoritmų parametrų parinkimo rekomendacijoms pateikti, buvo
pasirinkti gerai literatūroje žinomi bei sunkiau sprendžiami
etaloniniai darbo fabriko uždavinių pavyzdžiai. Darbo pabaigoje
pateikiamos minėtų algoritmų parametrų parinkimo rekomendacijos ir
aptariamas algoritmų efektyvumas, kuris nagrinėtuose uždaviniuose
nebuvo pastovus minėtų trijų algoritmų atvejais, t.y.... [toliau
žr. visą tekstą]
At the beginning of this work we introduce
to the combinatorial optimization, scheduling problems and methods
used to solve them. In computer science scheduling problems is
considered strongly NP-complete. The combinatorial optimization
problem considered in this paper is a static job shop problem
scheduling arising in the manufacturing processes. In the static
job shop scheduling problem, a finite number of jobs are to be
processed by a finite number of machines. Each job consists of a
prederminated sequence of task operations, each of which needs to
be processed without preemption for a given period of time on a
given machine. Tasks of the same job cannot be processed
concurrently and each job must visit each machine exactly once. A
schedule is an assignment of operation to time slots on a machine.
The makespan is the maximum completion time of the jobs and the
objective of the job shop scheduling problem is to find a schedule
that minimizes the makespan. When the size of problem increases,
the computational time of the exact methods grows exponentially.
Therefore, the recent research on job shop and other scheduling
problems is focused on heuristic algorithms. We also presented some
meta-heuristic algorithms such as Tabu search – Simulated annealing
(TS/SA), Tabu Search (TS), Variable Neighborhood Search (VNS) and
showed their results on some job shop instances. At the end of this
work we tell recommendations about choosing suitable
parameters.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Kaunas%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Saulis%2C%20Leonas%22%29&pagesize-30">Saulis, Leonas (Master’s degree committee chair),
search?q=%2Bpublisher%3A%22Kaunas%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Valakevi%C3%84%C2%8Dius%2C%20Eimutis%22%29&pagesize-30">Valakevičius, Eimutis (Master’s degree session secretary),
search?q=%2Bpublisher%3A%22Kaunas%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Aksomaitis%2C%20Algimantas%20Jonas%22%29&pagesize-30">Aksomaitis, Algimantas Jonas (Master’s degree committee member),
search?q=%2Bpublisher%3A%22Kaunas%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Janilionis%2C%20Vytautas%22%29&pagesize-30">Janilionis, Vytautas (Master’s degree committee member),
search?q=%2Bpublisher%3A%22Kaunas%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Pekarskas%2C%20Vidmantas%20Povilas%22%29&pagesize-30">Pekarskas, Vidmantas Povilas (Master’s degree committee member),
search?q=%2Bpublisher%3A%22Kaunas%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Rudzkis%2C%20Rimantas%22%29&pagesize-30">Rudzkis, Rimantas (Master’s degree committee member),
search?q=%2Bpublisher%3A%22Kaunas%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Navickas%2C%20Zenonas%22%29&pagesize-30">Navickas, Zenonas (Master’s degree committee member),
search?q=%2Bpublisher%3A%22Kaunas%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Listopadskis%2C%20Narimantas%22%29&pagesize-30">Listopadskis, Narimantas (Master’s thesis supervisor),
search?q=%2Bpublisher%3A%22Kaunas%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Barauskas%2C%20Ar%C3%85%C2%ABnas%22%29&pagesize-30">Barauskas, Arūnas (Master’s degree committee member),
search?q=%2Bpublisher%3A%22Kaunas%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Rubliauskas%2C%20Dalius%22%29&pagesize-30">Rubliauskas, Dalius (Master’s thesis reviewer).
Subjects/Keywords: Tabu paieška; Atkaitinimo
modeliavimas; Darbo
fabrikas; Tabu search; Simulated annealing
algorithm; Job shop
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kairaitis,
Gediminas. (2010). Tvarkaraščių sudarymo uždavinių ir jų algoritmų
tyrimas. (Masters Thesis). Kaunas University of Technology. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100825_101713-01675 ;
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
Kairaitis,
Gediminas. “Tvarkaraščių sudarymo uždavinių ir jų algoritmų
tyrimas.” 2010. Masters Thesis, Kaunas University of Technology. Accessed March 09, 2021.
http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100825_101713-01675 ;.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
Kairaitis,
Gediminas. “Tvarkaraščių sudarymo uždavinių ir jų algoritmų
tyrimas.” 2010. Web. 09 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
Kairaitis,
Gediminas. Tvarkaraščių sudarymo uždavinių ir jų algoritmų
tyrimas. [Internet] [Masters thesis]. Kaunas University of Technology; 2010. [cited 2021 Mar 09].
Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100825_101713-01675 ;.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
Kairaitis,
Gediminas. Tvarkaraščių sudarymo uždavinių ir jų algoritmų
tyrimas. [Masters Thesis]. Kaunas University of Technology; 2010. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100825_101713-01675 ;
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Pontifical Catholic University of Rio de Janeiro
10.
ALEXANDRE ALBINO ANDREATTA.
[en] A GRAPH PARTITIONING HEURISTIC FOR THE PARALLEL
PSEUDO-EXHAUSTIVE LOGICAL TEST OF VLSI COMBINATIONAL
CIRCUITS.
Degree: 2009, Pontifical Catholic University of Rio de Janeiro
URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14096
► [pt] O teste lógico de circuitos integrados VLSI é parte indispensável de sua fabricação e projeto. O enfoque pseudo-exaustivo para o teste lógico de circuitos…
(more)
▼ [pt] O teste lógico de circuitos integrados VLSI é
parte indispensável de sua fabricação e projeto. O enfoque
pseudo-exaustivo para o teste lógico de circuitos integrados
consiste em particionar o circuito original a ser testado em
subcircuitos com um reduzido número de entradas, que são então
testados em paralelo de forma exaustiva. Neste trabalho
apresenta-se um algoritmo aproximado para o problema de
particionamento de circuitos integrados combinacionais, baseado na
metaheurística de busca tabu. O algoritmo proposto apresenta
diversas características originais, tais como: o conceito de
vizinhança reduzida, obtida por movimentos envolvendo apenas um
subconjunto de nós de fronteira; movimentos complexos que induzem
diversos movimentos resultantes, embora as variações na função de
custo sejam facilmente calculáveis; uma função objetivo bi-critério
combinando o número de circuitos e o número de cortes, que
simultaneamente adiciona uma estratégia de diversificação à busca;
e o uso de uma heurística de empacotamento como passo de
pós-otimização. O desempenho do algoritmo proposto foi avaliado
através de sua aplicação a um conjunto de circuitos computacionais
ISCAS padronizados. Os resultados computacionais foram comparados
com aqueles fornecidos pelos algoritmos conhecidos na literatura,
obtendo-se melhorias significativas. As taxas de médias de redução
foram da ordem de 30% para o número de subcircuitos na partição e
de 40% para o número de cortes.
[en] The logical test of integrated VLSI circuits is
one of the main phases of their design and fabrication. The
pseudo-exhaustive approach for the logical test of integrated
circuits consists in partitioning the original circuit to be tested
into non-overlapping subcircuits with a small, bounded number of
subcircuits, which are then exhaustively tested in parallel. In
this work we present an approximate algorithm for the problem of
partitioning integrated combinational circuits, based on the tabu
search metaheuristic. The proposed algorithm presents several
original features, such as: the use of a reduced neighborhood,
obtained from moves involving only a subset of boundary nodes;
complex moves which entail several resulting moves, although the
variations in the cost function are very easily computable; a
bi-criteria cost function combining the number of subcircuits and
the number of cuts, which simultaneously adds a diversification
strategy to the search; and the use of a bin-packing heuristic as a
post-optimization step. The behavior of the proposed algorithm was
evaluated through its application to a set of benchmark ISCAS
combinational circuits. The computational results have been
compared with those obtained by the other algorithms in the
literature, with significant improvements. The average reduction
rates have been of the order of 30% in the number of subcircuits in
the partition, and of the order of 40% in the number of
cuts.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Pontifical%20Catholic%20University%20of%20Rio%20de%20Janeiro%22%20%2Bcontributor%3A%28%22CELSO%20DA%20CRUZ%20CARNEIRO%20RIBEIRO%22%29&pagesize-30">CELSO DA CRUZ CARNEIRO RIBEIRO,
search?q=%2Bpublisher%3A%22Pontifical%20Catholic%20University%20of%20Rio%20de%20Janeiro%22%20%2Bcontributor%3A%28%22CELSO%20DA%20CRUZ%20CARNEIRO%20RIBEIRO%22%29&pagesize-30">CELSO DA CRUZ CARNEIRO RIBEIRO.
Subjects/Keywords: [pt] BUSCA TABU; [en] TABU SEARCH; [pt] CIRCUITOS INTEGRADOS; [pt] TESTE LOGICO
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
ANDREATTA, A. A. (2009). [en] A GRAPH PARTITIONING HEURISTIC FOR THE PARALLEL
PSEUDO-EXHAUSTIVE LOGICAL TEST OF VLSI COMBINATIONAL
CIRCUITS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14096
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):
ANDREATTA, ALEXANDRE ALBINO. “[en] A GRAPH PARTITIONING HEURISTIC FOR THE PARALLEL
PSEUDO-EXHAUSTIVE LOGICAL TEST OF VLSI COMBINATIONAL
CIRCUITS.” 2009. 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=14096.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
ANDREATTA, ALEXANDRE ALBINO. “[en] A GRAPH PARTITIONING HEURISTIC FOR THE PARALLEL
PSEUDO-EXHAUSTIVE LOGICAL TEST OF VLSI COMBINATIONAL
CIRCUITS.” 2009. Web. 09 Mar 2021.
Vancouver:
ANDREATTA AA. [en] A GRAPH PARTITIONING HEURISTIC FOR THE PARALLEL
PSEUDO-EXHAUSTIVE LOGICAL TEST OF VLSI COMBINATIONAL
CIRCUITS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2009. [cited 2021 Mar 09].
Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14096.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
ANDREATTA AA. [en] A GRAPH PARTITIONING HEURISTIC FOR THE PARALLEL
PSEUDO-EXHAUSTIVE LOGICAL TEST OF VLSI COMBINATIONAL
CIRCUITS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2009. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14096
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
11.
Li, Yinglei.
Robust Vehicle Routing in Disaster Relief and Ride-Sharing: Models and Algorithms.
Degree: PhD, Systems Science and Industrial Engineering, 2017, Binghamton University
URL: https://orb.binghamton.edu/dissertation_and_theses/49
► In this dissertation, the variants of vehicle routing problems (VRPs) are specifically considered in two applications: disaster relief routing and ride-sharing. In disaster relief…
(more)
▼ In this dissertation, the variants of vehicle routing problems (VRPs) are specifically considered in two applications: disaster relief routing and ride-sharing. In disaster relief operations, VRPs are important, especially in the immediate response phase, as vehicles are an essential part of the supply chain for delivering critical supplies. This dissertation addresses the capacitated vehicle routing problem (CVRP) and the split delivery vehicle routing problem (SDVRP) with uncertain travel times and demands when planning vehicle routes for delivering critical supplies to the affected population in need after a disaster. A robust optimization approach is used for the CVRP and the SDVRP considering the five objective functions: minimization of the total number of vehicles deployed (minV), the total travel time/travel cost (minT), the summation of arrival times (minS), the summation of demand-weighted arrival times (minD), and the latest arrival time (minL), out of which we claim that minS, minD, and minL are critical for deliveries to be fast and fair for relief efforts, while minV and minT are common cost-based objective functions in the traditional VRP. In ride-sharing problem, the participants' information is provided in a short notice, for which driver-rider matching and associated routes need to be decided quickly. The uncertain travel time is considered explicitly when matching and route decisions are made, and a robust optimization approach is proposed to handle it properly. To achieve computational tractability, a new two-stage heuristic method that combines the extended insertion algorithm and
tabu search (TS) is proposed to solve the models for large-scale problems. In addition, a new hybrid algorithm named scoring
tabu search with variable neighborhood (STSVN) is proposed to solve the models and compared with TS. The solutions of the CVRP and the SDVRP are compared for different examples using five different metrics in which the results show that the latter is not only capable of accommodating the demand greater than the vehicle capacity but also is quite effective to mitigate demand and travel time uncertainty, thereby outperforms CVRP in the disaster relief routing perspective. The results of ride-sharing problem show the influence of parameters and uncertain travel time on the solutions. The performance of TS and STSVN are compared in terms of solving the models for disaster relief routing and ride-sharing problems and the results show that STSVN outperforms TS in searching the near-optimal/optimal solutions within the same CPU time.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Binghamton%20University%22%20%2Bcontributor%3A%28%22Sung%20Hoon%20Chung%22%29&pagesize-30">Sung Hoon Chung.
Subjects/Keywords: Applied sciences; Insertion algorithm; Robust optimization; Scoring tabu search with variable neighborhood; Tabu search; Vehicle routing problems; Engineering; Industrial Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, Y. (2017). Robust Vehicle Routing in Disaster Relief and Ride-Sharing: Models and Algorithms. (Doctoral Dissertation). Binghamton University. Retrieved from https://orb.binghamton.edu/dissertation_and_theses/49
Chicago Manual of Style (16th Edition):
Li, Yinglei. “Robust Vehicle Routing in Disaster Relief and Ride-Sharing: Models and Algorithms.” 2017. Doctoral Dissertation, Binghamton University. Accessed March 09, 2021.
https://orb.binghamton.edu/dissertation_and_theses/49.
MLA Handbook (7th Edition):
Li, Yinglei. “Robust Vehicle Routing in Disaster Relief and Ride-Sharing: Models and Algorithms.” 2017. Web. 09 Mar 2021.
Vancouver:
Li Y. Robust Vehicle Routing in Disaster Relief and Ride-Sharing: Models and Algorithms. [Internet] [Doctoral dissertation]. Binghamton University; 2017. [cited 2021 Mar 09].
Available from: https://orb.binghamton.edu/dissertation_and_theses/49.
Council of Science Editors:
Li Y. Robust Vehicle Routing in Disaster Relief and Ride-Sharing: Models and Algorithms. [Doctoral Dissertation]. Binghamton University; 2017. Available from: https://orb.binghamton.edu/dissertation_and_theses/49
Anna University
12.
Manavalasundaram V K.
Efficient scheduling in decentralized grid
environment;.
Degree: Efficient scheduling in decentralized grid
environment, 2014, Anna University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/22911
► The grid computing enables wide area resource sharing and collaboration It is a fast emerging distributed technology Based on scheduling of computational jobs for different…
(more)
▼ The grid computing enables wide area resource
sharing and collaboration It is a fast emerging distributed
technology Based on scheduling of computational jobs for different
resources the computational grid can be classified into two type s
namely centralized grid and decentralized market like grid Both the
types involve sharing and newlinecollaboration among different
resource providers and consumers with centralized or decentralized
scheduling schemes newlineThe key difference between the two
schemes lies in scheduling newlinedecision In the centralized grid
the grid system makes decisions as follows newline Which job is to
be executed newline When is it to be executed newline Which
resource can be utilized newlineIn the decentralized market like
grid such decisions are made by concerned resource provider
consumer to share the data among different participants efficiently
with less unit price This work which is based on decentralized
market like grid comprises of an association of jobs and resources
a development of Economic Demand Model with reasonable pricing
scheme and an Optimistic Heuristic Model The association of global
local jobs and resources in this work allows the grid to
communicate each other effectively by exchanging the jobs and
resources newline newline
References p.150-157
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Anna%20University%22%20%2Bcontributor%3A%28%22Duraiswamy%20K%22%29&pagesize-30">Duraiswamy K.
Subjects/Keywords: Grid computing; Heuristic Local Search; Heuristic Simulated Annealing; Heuristic Tabu Search; Information and communication engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
K, M. V. (2014). Efficient scheduling in decentralized grid
environment;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/22911
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):
K, Manavalasundaram V. “Efficient scheduling in decentralized grid
environment;.” 2014. Thesis, Anna University. Accessed March 09, 2021.
http://shodhganga.inflibnet.ac.in/handle/10603/22911.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
K, Manavalasundaram V. “Efficient scheduling in decentralized grid
environment;.” 2014. Web. 09 Mar 2021.
Vancouver:
K MV. Efficient scheduling in decentralized grid
environment;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Mar 09].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22911.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
K MV. Efficient scheduling in decentralized grid
environment;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22911
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Rochester Institute of Technology
13.
Zhang, Lifan.
Route-based transportation network design.
Degree: Industrial and Systems Engineering, 2013, Rochester Institute of Technology
URL: https://scholarworks.rit.edu/theses/5693
► Given shipment demand and driving regulations, a consolidation carrier has to make decisions on how to route both shipments and drivers at minimal cost. The…
(more)
▼ Given shipment demand and driving regulations, a consolidation carrier has to make decisions on how to route both shipments and drivers at minimal cost. The traditional way to formulate and solve these problems is through the use of two-step models. This thesis presents a heuristic algorithm to solve an integrated model that can provide superior solutions. The algorithm combines a slope scaling initialization phase and
tabu search to find high-quality solutions. The performance of the proposed heuristic is benchmarked against a commercial solver and these results indicate that the proposed method is able to produce better quality solutions for the similar solution time.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Rochester%20Institute%20of%20Technology%22%20%2Bcontributor%3A%28%22Hewitt%2C%20Mike%22%29&pagesize-30">Hewitt, Mike.
Subjects/Keywords: Heuristics; Less-than-truckload; Tabu search; Vehicle routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zhang, L. (2013). Route-based transportation network design. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/5693
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):
Zhang, Lifan. “Route-based transportation network design.” 2013. Thesis, Rochester Institute of Technology. Accessed March 09, 2021.
https://scholarworks.rit.edu/theses/5693.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhang, Lifan. “Route-based transportation network design.” 2013. Web. 09 Mar 2021.
Vancouver:
Zhang L. Route-based transportation network design. [Internet] [Thesis]. Rochester Institute of Technology; 2013. [cited 2021 Mar 09].
Available from: https://scholarworks.rit.edu/theses/5693.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhang L. Route-based transportation network design. [Thesis]. Rochester Institute of Technology; 2013. Available from: https://scholarworks.rit.edu/theses/5693
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Mississippi State University
14.
Jain, Pramod.
APPROXIMATE METHODS FOR SOLVING FLOWSHOP PROBLEMS.
Degree: MS, Industrial Engineering, 2005, Mississippi State University
URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11072005-155525/
;
► The flow shop scheduling problem is a classical combinatorial problem being studied for years. The focus of this research is to study two variants of…
(more)
Subjects/Keywords: tabu search; heuristics; scheduling; flowshop
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jain, P. (2005). APPROXIMATE METHODS FOR SOLVING FLOWSHOP PROBLEMS. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-11072005-155525/ ;
Chicago Manual of Style (16th Edition):
Jain, Pramod. “APPROXIMATE METHODS FOR SOLVING FLOWSHOP PROBLEMS.” 2005. Masters Thesis, Mississippi State University. Accessed March 09, 2021.
http://sun.library.msstate.edu/ETD-db/theses/available/etd-11072005-155525/ ;.
MLA Handbook (7th Edition):
Jain, Pramod. “APPROXIMATE METHODS FOR SOLVING FLOWSHOP PROBLEMS.” 2005. Web. 09 Mar 2021.
Vancouver:
Jain P. APPROXIMATE METHODS FOR SOLVING FLOWSHOP PROBLEMS. [Internet] [Masters thesis]. Mississippi State University; 2005. [cited 2021 Mar 09].
Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11072005-155525/ ;.
Council of Science Editors:
Jain P. APPROXIMATE METHODS FOR SOLVING FLOWSHOP PROBLEMS. [Masters Thesis]. Mississippi State University; 2005. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11072005-155525/ ;
North Carolina State University
15.
Lightner, Carin Ann.
A Tabu Search Approach to Multiple Sequence Alignment.
Degree: PhD, Operations Research, 2008, North Carolina State University
URL: http://www.lib.ncsu.edu/resolver/1840.16/3575
Subjects/Keywords: sequence alignment; tabu search
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lightner, C. A. (2008). A Tabu Search Approach to Multiple Sequence Alignment. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/3575
Chicago Manual of Style (16th Edition):
Lightner, Carin Ann. “A Tabu Search Approach to Multiple Sequence Alignment.” 2008. Doctoral Dissertation, North Carolina State University. Accessed March 09, 2021.
http://www.lib.ncsu.edu/resolver/1840.16/3575.
MLA Handbook (7th Edition):
Lightner, Carin Ann. “A Tabu Search Approach to Multiple Sequence Alignment.” 2008. Web. 09 Mar 2021.
Vancouver:
Lightner CA. A Tabu Search Approach to Multiple Sequence Alignment. [Internet] [Doctoral dissertation]. North Carolina State University; 2008. [cited 2021 Mar 09].
Available from: http://www.lib.ncsu.edu/resolver/1840.16/3575.
Council of Science Editors:
Lightner CA. A Tabu Search Approach to Multiple Sequence Alignment. [Doctoral Dissertation]. North Carolina State University; 2008. Available from: http://www.lib.ncsu.edu/resolver/1840.16/3575
Queensland University of Technology
16.
Reeves, Claire Elspeth.
Integrated scheduling for ambulances and ambulance crews.
Degree: 2015, Queensland University of Technology
URL: https://eprints.qut.edu.au/86516/
► This project developed three mathematical models for scheduling ambulances and ambulance crews and proceeded to solve each model for test scenarios based on real data.…
(more)
▼ This project developed three mathematical models for scheduling ambulances and ambulance crews and proceeded to solve each model for test scenarios based on real data. Results from these models can serve as decision aids for dispatching or relocating ambulances; and for strategic decisions on the ambulance crews needed each shift. This thesis used Flexible Flow Shop Scheduling techniques to formulate strategic, dynamic and real time models. Metaheuristic solutions techniques were applied for a case study with realistic data. These models are suitable for ambulance planners and dispatchers.
Subjects/Keywords: ambulance; scheduling; tabu search; ant colony optimisation; flexible flow shop
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Reeves, C. E. (2015). Integrated scheduling for ambulances and ambulance crews. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/86516/
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):
Reeves, Claire Elspeth. “Integrated scheduling for ambulances and ambulance crews.” 2015. Thesis, Queensland University of Technology. Accessed March 09, 2021.
https://eprints.qut.edu.au/86516/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Reeves, Claire Elspeth. “Integrated scheduling for ambulances and ambulance crews.” 2015. Web. 09 Mar 2021.
Vancouver:
Reeves CE. Integrated scheduling for ambulances and ambulance crews. [Internet] [Thesis]. Queensland University of Technology; 2015. [cited 2021 Mar 09].
Available from: https://eprints.qut.edu.au/86516/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Reeves CE. Integrated scheduling for ambulances and ambulance crews. [Thesis]. Queensland University of Technology; 2015. Available from: https://eprints.qut.edu.au/86516/
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
17.
Shahnawaz, Sanjana.
Optimization of patients appointments in chemotherapy treatment unit: heuristic and metaheuristic approaches.
Degree: Mechanical and Manufacturing Engineering, 2012, University of Manitoba
URL: http://hdl.handle.net/1993/8876
► This research aims to improve the performance of the service of a Chemotherapy Treatment Unit by reducing the waiting time of patients within the unit.…
(more)
▼ This research aims to improve the performance of the service of a Chemotherapy Treatment Unit by reducing the waiting time of patients within the unit. In order to fulfill the objective, initially, the chemotherapy treatment unit is deduced as an identical parallel machines scheduling problem with unequal release time and single resource. A mathematical model is developed to generate the optimum schedule. Afterwards, a
Tabu search (TS) algorithm is developed. The performance of the TS algorithm is evaluated by comparing results with the mathematical model and the best results of benchmark problems reported in the literature. Later on, an additional resource is considered which converted the problem into a dual resources scheduling problem. Three approaches are proposed to solve this problem; namely, heuristics, a
Tabu search algorithm with heuristic (TSHu), and
Tabu search algorithm for dual resources (TSD).
Advisors/Committee Members: search?q=%2Bpublisher%3A%22University%20of%20Manitoba%22%20%2Bcontributor%3A%28%22ElMekkawy%2C%20Tarek%20%28Mechanical%20and%20Manufacturing%20Engineering%29%20Peng%2CQingjin%20%28Mechanical%20and%20Manufacturing%20Engineering%29%22%29&pagesize-30">ElMekkawy, Tarek (Mechanical and Manufacturing Engineering) Peng,Qingjin (Mechanical and Manufacturing Engineering) (supervisor),
search?q=%2Bpublisher%3A%22University%20of%20Manitoba%22%20%2Bcontributor%3A%28%22Malcolm%2CXing%20%28Mechanical%20and%20Manufacturing%20Engineering%29%20%20Srimantoorao%20S.%20Appadoo%20%28Asper%20school%20of%20Business%29%22%29&pagesize-30">Malcolm,Xing (Mechanical and Manufacturing Engineering) Srimantoorao S. Appadoo (Asper school of Business) (examiningcommittee).
Subjects/Keywords: Tabu search algorithm; Metaheuristic
…Processing Time
TL
Tabu List
TS
Tabu Search algorithm
TSD
Tabu Search algorithm for Dual… …resources
TSHu
Tabu Search Heuristic algorithm
TS+I
Tabu Search algorithm with Intensification… …equal. This study proposes an efficient algorithm using a metaheuristic approach:
Tabu search… …resource is included as a constraint. Tabu search algorithm with heuristic
(TSHu) and… …Tabu search algorithm for dual resources (TSD) are developed to deal with
the dual…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Shahnawaz, S. (2012). Optimization of patients appointments in chemotherapy treatment unit: heuristic and metaheuristic approaches. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/8876
Chicago Manual of Style (16th Edition):
Shahnawaz, Sanjana. “Optimization of patients appointments in chemotherapy treatment unit: heuristic and metaheuristic approaches.” 2012. Masters Thesis, University of Manitoba. Accessed March 09, 2021.
http://hdl.handle.net/1993/8876.
MLA Handbook (7th Edition):
Shahnawaz, Sanjana. “Optimization of patients appointments in chemotherapy treatment unit: heuristic and metaheuristic approaches.” 2012. Web. 09 Mar 2021.
Vancouver:
Shahnawaz S. Optimization of patients appointments in chemotherapy treatment unit: heuristic and metaheuristic approaches. [Internet] [Masters thesis]. University of Manitoba; 2012. [cited 2021 Mar 09].
Available from: http://hdl.handle.net/1993/8876.
Council of Science Editors:
Shahnawaz S. Optimization of patients appointments in chemotherapy treatment unit: heuristic and metaheuristic approaches. [Masters Thesis]. University of Manitoba; 2012. Available from: http://hdl.handle.net/1993/8876
University of Illinois – Chicago
18.
Kafle, Nabin.
Advancing the Urban Parcel Delivery System Using Crowdshipping.
Degree: 2017, University of Illinois – Chicago
URL: http://hdl.handle.net/10027/21889
► This research presents a methodological investigation on the design, modeling, and evaluation of two types of crowdsourcee-enabled urban parcel delivery systems. The first system couples…
(more)
▼ This research presents a methodological investigation on the design, modeling, and evaluation of two types of crowdsourcee-enabled urban parcel delivery systems. The first system couples the existing truck-delivery practice with the locally available crowdsourcees to minimize the cost of last mile delivery. The second system considers the delivery of parcels without the use of any intermediate relay point i.e. crowdsourcees are solely responsible for the pickup of parcels and delivering it to customers’ doorsteps.
For the first system, we consider cyclists and pedestrians as crowdsourcees who are close to customers and interested in relaying parcels with a truck carrier and undertaking jobs for the last-leg parcel delivery and the first-leg parcel pickup. The crowdsourcees express their interests in doing so by submitting bids to the truck carrier. The truck carrier then selects bids and coordinates crowdsourcees’ last-leg delivery (first-leg pickup) with its truck operations. The truck carrier’s problem is formulated as a mixed integer non-linear program which simultaneously i) selects crowdsourcees to complete the last-leg delivery (first-leg pickup) between customers and selected points for crowdsourcee-truck relay; and ii) determines the relay points and truck routes and schedule. To solve the truck carrier problem, we first decompose the problem into a winner determination problem and a simultaneous pickup and delivery problem with soft time windows, and propose a
Tabu Search based algorithm to iteratively solve the two subproblems. Numerical results show that this solution approach is able to yield close-to-optimum solutions with much less time than using off-the-shelf solvers. By adopting this new system, truck vehicle miles traveled (VMT) and total cost can be reduced compared to pure-truck delivery. The advantage of the system over pure-truck delivery is sensitive to factors such as penalty for servicing outside customers’ desired time windows, truck unit operating cost, time value of crowdsourcees, and the crowdsourcee mode.
For the second system, a new mechanism design based model is proposed in which a Delivery Service Provider (DSP) solicits ordinary individuals, i.e., crowdsourcees, who walk, bike, or drive to do delivery in urban areas. As an essential part of the model, the DSP collects private information such as one’s willingness-to-do-crowdshipping (WTDC) and available time window from crowdsourcees in order to assign shipments with the minimum cost. The mechanisms embedded in the crowdshipping model recognize that crowdsourcees may strategically misreport their private information to gain self-interest, and devises a joint shipment assignment-payment scheme that aligns the self-interest of the crowdsourcees with the objective of the DSP. Both static and dynamic cases are investigated. Numerical results demonstrate that the proposed mechanisms will lead to reduced shipping cost compared to the state-of-the-practice crowdshipping. A case study of North Chicago is also presented to further…
Advisors/Committee Members: search?q=%2Bpublisher%3A%22University%20of%20Illinois%26%23160%3B%26%238211%3B%20Chicago%22%20%2Bcontributor%3A%28%22Zou%2C%20Bo%22%29&pagesize-30">Zou, Bo (advisor),
search?q=%2Bpublisher%3A%22University%20of%20Illinois%26%23160%3B%26%238211%3B%20Chicago%22%20%2Bcontributor%3A%28%22Lin%2C%20Jane%22%29&pagesize-30">Lin, Jane (committee member),
search?q=%2Bpublisher%3A%22University%20of%20Illinois%26%23160%3B%26%238211%3B%20Chicago%22%20%2Bcontributor%3A%28%22Mohammadian%2C%20Abolfazl%22%29&pagesize-30">Mohammadian, Abolfazl (committee member),
search?q=%2Bpublisher%3A%22University%20of%20Illinois%26%23160%3B%26%238211%3B%20Chicago%22%20%2Bcontributor%3A%28%22Derrible%2C%20Sybil%22%29&pagesize-30">Derrible, Sybil (committee member),
search?q=%2Bpublisher%3A%22University%20of%20Illinois%26%23160%3B%26%238211%3B%20Chicago%22%20%2Bcontributor%3A%28%22Kawamura%2C%20Kazuya%22%29&pagesize-30">Kawamura, Kazuya (committee member),
search?q=%2Bpublisher%3A%22University%20of%20Illinois%26%23160%3B%26%238211%3B%20Chicago%22%20%2Bcontributor%3A%28%22Zou%2C%20Bo%22%29&pagesize-30">Zou, Bo (chair).
Subjects/Keywords: Crowdshipping; Vehicle-routing problem; Tabu search heuristics; Mechanism design
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kafle, N. (2017). Advancing the Urban Parcel Delivery System Using Crowdshipping. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21889
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):
Kafle, Nabin. “Advancing the Urban Parcel Delivery System Using Crowdshipping.” 2017. Thesis, University of Illinois – Chicago. Accessed March 09, 2021.
http://hdl.handle.net/10027/21889.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kafle, Nabin. “Advancing the Urban Parcel Delivery System Using Crowdshipping.” 2017. Web. 09 Mar 2021.
Vancouver:
Kafle N. Advancing the Urban Parcel Delivery System Using Crowdshipping. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2021 Mar 09].
Available from: http://hdl.handle.net/10027/21889.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kafle N. Advancing the Urban Parcel Delivery System Using Crowdshipping. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/21889
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Brunel University
19.
Woodside-Oriakhi, Maria.
Portfolio optimisation with transaction cost.
Degree: PhD, 2011, Brunel University
URL: http://bura.brunel.ac.uk/handle/2438/5839
;
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924
► Portfolio selection is an example of decision making under conditions of uncertainty. In the face of an unknown future, fund managers make complex financial choices…
(more)
▼ Portfolio selection is an example of decision making under conditions of uncertainty. In the face of an unknown future, fund managers make complex financial choices based on the investors perceptions and preferences towards risk and return. Since the seminal work of Markowitz, many studies have been published using his mean-variance (MV) model as a basis. These mathematical models of investor attitudes and asset return dynamics aid in the portfolio selection process. In this thesis we extend the MV model to include the cardinality constraints which limit the number of assets held in the portfolio and bounds on the proportion of an asset held (if any is held). We present our formulation based on the Markowitz MV model for rebalancing an existing portfolio subject to both fixed and variable transaction cost (the fee associated with trading). We determine and demonstrate the differences that arise in the shape of the trading portfolio and efficient frontiers when subject to non-cardinality and cardinality constrained transaction cost models. We apply our flexible heuristic algorithms of genetic algorithm, tabu search and simulated annealing to both the cardinality constrained and transaction cost models to solve problems using data from seven real world market indices. We show that by incorporating optimization into the generation of valid portfolios leads to good quality solutions in acceptable computational time. We illustrate this on problems from literature as well as on our own larger data sets.
Subjects/Keywords: Heuristic algorithms; Genetic algorithm; Tabu search; Simulated anealing; Optimal solutions
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Woodside-Oriakhi, M. (2011). Portfolio optimisation with transaction cost. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924
Chicago Manual of Style (16th Edition):
Woodside-Oriakhi, Maria. “Portfolio optimisation with transaction cost.” 2011. Doctoral Dissertation, Brunel University. Accessed March 09, 2021.
http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924.
MLA Handbook (7th Edition):
Woodside-Oriakhi, Maria. “Portfolio optimisation with transaction cost.” 2011. Web. 09 Mar 2021.
Vancouver:
Woodside-Oriakhi M. Portfolio optimisation with transaction cost. [Internet] [Doctoral dissertation]. Brunel University; 2011. [cited 2021 Mar 09].
Available from: http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924.
Council of Science Editors:
Woodside-Oriakhi M. Portfolio optimisation with transaction cost. [Doctoral Dissertation]. Brunel University; 2011. Available from: http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924
University of Toronto
20.
Shateri, Mahsa.
Resource Allocation and Risk Analysis of Dialysis Centres.
Degree: PhD, 2015, University of Toronto
URL: http://hdl.handle.net/1807/71616
► The number of hemodialysis patients is growing every year. The majority of these patients visit centres at least three times a week for their treatment.…
(more)
▼ The number of hemodialysis patients is growing every year. The majority of these patients visit centres at least three times a week for their treatment. Two types of nurses perform general dialysis procedures on the patients. These are registered nurses (RNs) and registered practical nurses (RPNs). Hemodialysis patients may experience complications during their treatment. When complications occur, patients need the assistance of RNs. The time RNs spend with patients increases the duration of their treatment. It is essential for all centres to hire enough nurses to maintain the quality of service for the growing number of patients while minimizing nursing cost. However, facilities have different nurse-to-patient ratio because they are unique in terms of the combination of patients and the workload policies regulating their nurses. Moreover, since there are no generally accepted guidelines, the staffing decisions at each centre are highly subjective. As a result, it is very difficult for the decision makers to create consistent guidelines to determine the number of nurses required in each centre.
In this research, we assume that the centre has a given list of specific patients, each of which is defined by patient type. Two approaches are used to help dialysis units schedule their patients and minimize nursing cost while having enough nurses to maintain quality of service. In the first approach, an MIP model and a heuristic algorithm are developed separately to minimize the number of nurses (RPNs or RNs) to set up, monitor, and disconnect patients from dialysis machines. The methods find the start time of the dialysis session for each patient. An M/M/s queuing equation is then used to find the number of RNs needed to attend to any potential complications of scheduled patients. In the second approach, the methodologies are merged into a non-linear model to find patient schedules that minimize the number of RNs and RPNs.
Tabu Search is used to solve the non-linear model. Further, the models and results presented in this study can be treated as benchmarks for decision makers to find the approximate number of nurses needed for each unit as well as a forecasting tool to estimate the average number of nurses needed for any patient size population based on their historical data.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22University%20of%20Toronto%22%20%2Bcontributor%3A%28%22Carter%2C%20Michael%20W.%22%29&pagesize-30">Carter, Michael W.,
search?q=%2Bpublisher%3A%22University%20of%20Toronto%22%20%2Bcontributor%3A%28%22Mechanical%20and%20Industrial%20Engineering%22%29&pagesize-30">Mechanical and Industrial Engineering.
Subjects/Keywords: Heuristic; Mixed Integer Programming; Optimization; Risk Analysis; Scheduling; Tabu Search; 0537
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Shateri, M. (2015). Resource Allocation and Risk Analysis of Dialysis Centres. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/71616
Chicago Manual of Style (16th Edition):
Shateri, Mahsa. “Resource Allocation and Risk Analysis of Dialysis Centres.” 2015. Doctoral Dissertation, University of Toronto. Accessed March 09, 2021.
http://hdl.handle.net/1807/71616.
MLA Handbook (7th Edition):
Shateri, Mahsa. “Resource Allocation and Risk Analysis of Dialysis Centres.” 2015. Web. 09 Mar 2021.
Vancouver:
Shateri M. Resource Allocation and Risk Analysis of Dialysis Centres. [Internet] [Doctoral dissertation]. University of Toronto; 2015. [cited 2021 Mar 09].
Available from: http://hdl.handle.net/1807/71616.
Council of Science Editors:
Shateri M. Resource Allocation and Risk Analysis of Dialysis Centres. [Doctoral Dissertation]. University of Toronto; 2015. Available from: http://hdl.handle.net/1807/71616
21.
Huang, Jun.
Feature selection in credit scoring- a quadratic programming approach solving with bisection method based on Tabu search.
Degree: 2015, Texas A&M International University
URL: http://hdl.handle.net/2152.4/51
► Credit risk is one of the most important topics in the risk management. Meanwhile, it is the major risk of banks and financial institutions encountered…
(more)
▼ Credit risk is one of the most important topics in the risk management. Meanwhile, it is the major risk of banks and financial institutions encountered as claimed by the Basel capital accord. As a form of credit risk measurement, credit scoring is the credit evaluation process to reduce the current and expected risk of a customer being bad credit. The credit scoring models usually use a set of features to predict the credit status, good credit (unlikely to default) and bad credit (more likely to default), of the applicants. However, with the fast growth in the credit industry and facilitation of collecting and storing information due to the new technologies, a huge amount of information on customer is available. Feature selection or subset selection is therefore essential to handle irrelevant, redundant or misleading features in order to improve predictive (classification) accuracy and reduce high complexity, intensive computation, and instability for most credit scoring models.
In this study, a hybrid model is developed for credit scoring problems to predict the classification accuracy based on selected subsets by first establishing a correlation coefficient based binary quadratic programming model for feature selection. The model is then solved with the bisection method based on
Tabu search algorithm (BMTS) and provides optional subsets of features in different sizes from which the satisfactory subsets for credit scoring models are selected based on both the size and overall classification accuracy rate (OCAR). The results of this proposed BMTS+SVM method, tested on two benchmark credit datasets, shed light on the improvement of the existing credit scoring systems with flexibility and robustness.
This validated method is then used in an international business context to test the data on the U.S. and Chinese companies in order to find out the subsets of features that act as key factors in distinguishing good credit companies from bad credit companies in these two countries. Finally, The performance of classification models, using different classifiers, in terms of OCAR and misclassification cost is evaluated based on the U.S. and Chinese datasets. Cutoff values which give highest OCAR and minimum misclassification cost is also discussed.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Texas%20A%26M%20International%20University%22%20%2Bcontributor%3A%28%22Wang%2C%20Haibo%22%29&pagesize-30">Wang, Haibo (advisor).
Subjects/Keywords: Feature selection; Credit scoring; Quadratic programming; Bisection method; Tabu search
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Huang, J. (2015). Feature selection in credit scoring- a quadratic programming approach solving with bisection method based on Tabu search. (Thesis). Texas A&M International University. Retrieved from http://hdl.handle.net/2152.4/51
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):
Huang, Jun. “Feature selection in credit scoring- a quadratic programming approach solving with bisection method based on Tabu search.” 2015. Thesis, Texas A&M International University. Accessed March 09, 2021.
http://hdl.handle.net/2152.4/51.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Huang, Jun. “Feature selection in credit scoring- a quadratic programming approach solving with bisection method based on Tabu search.” 2015. Web. 09 Mar 2021.
Vancouver:
Huang J. Feature selection in credit scoring- a quadratic programming approach solving with bisection method based on Tabu search. [Internet] [Thesis]. Texas A&M International University; 2015. [cited 2021 Mar 09].
Available from: http://hdl.handle.net/2152.4/51.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Huang J. Feature selection in credit scoring- a quadratic programming approach solving with bisection method based on Tabu search. [Thesis]. Texas A&M International University; 2015. Available from: http://hdl.handle.net/2152.4/51
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Southern California
22.
Wang, Chen.
New approaches for routing courier delivery services.
Degree: PhD, Industrial and Systems Engineering, 2012, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/110992/rec/4395
► Courier delivery services deal with the problem of routing a fleet of vehicles from a depot to service a set of customers that are geographically…
(more)
▼ Courier delivery services deal with the problem of
routing a fleet of vehicles from a depot to service a set of
customers that are geographically dispersed. In many cases, in
addition to a regular uncertain demand, the industry is faced with
sporadic, tightly constrained, urgent requests. An example of such
an application is the transportation of medical specimens, where
timely, efficient, and accurate delivery is crucial in providing
high quality and affordable patient services. ❧ In the first part
of this study, we propose to develop better vehicle routing
solutions that can efficiently satisfy random demand over time and
rapidly adjust to satisfy these sporadic, tightly constrained,
urgent requests. We formulate a multi-trip vehicle routing problem
using mixed integer programming. We use stochastic programming with
recourse for daily plans to address the uncertainty in customer
occurrence. The recourse action considers a multi-objective
function that maximizes demand coverage, maximizes the quality of
delivery service, and minimizes travel cost. Because of the
computational difficulty for large size problems, we devise an
insertion based heuristic in the first phase, and then use
Tabu
Search to find an efficient solution to the problem. Simulations
have been done on randomly generated data and on a real data set
provided by a leading healthcare provider in Southern California.
Our approach has shown significant improvement in travel costs as
well as in quality of service as measured by route similarity than
existing methods. ❧ In the second part of this thesis, we study a
method to cluster the customers into groups without generating the
actual routes. There is uncertainty in customer occurrence in the
problem studied; we therefore develop a new objective function
based on expected distance that includes the occurring probability
of customers. We show the appropriateness of the new objective, and
propose a mixed integer programming formulation for customer
clustering based on it. A
Tabu search based heuristic approach is
developed for solving the problem, and we conduct experiments on
randomly generated data. The new approach shows improvement in
expected distance of routes over a clustering method based on
building routes for instances where the depot is in a
corner.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22University%20of%20Southern%20California%22%20%2Bcontributor%3A%28%22Dessouky%2C%20Maged%20M.Ordonez%2C%20FernandoOrd%C3%83%C2%B3%C3%83%C2%B1ez%2C%20Fernando%22%29&pagesize-30">Dessouky, Maged M.Ordonez, FernandoOrdóñez, Fernando (Committee Chair),
search?q=%2Bpublisher%3A%22University%20of%20Southern%20California%22%20%2Bcontributor%3A%28%22Petros%2C%20Ioannou%22%29&pagesize-30">Petros, Ioannou (Committee Member).
Subjects/Keywords: stochastic vehicle routing; multi-trip; time window; tabu search; clustering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wang, C. (2012). New approaches for routing courier delivery services. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/110992/rec/4395
Chicago Manual of Style (16th Edition):
Wang, Chen. “New approaches for routing courier delivery services.” 2012. Doctoral Dissertation, University of Southern California. Accessed March 09, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/110992/rec/4395.
MLA Handbook (7th Edition):
Wang, Chen. “New approaches for routing courier delivery services.” 2012. Web. 09 Mar 2021.
Vancouver:
Wang C. New approaches for routing courier delivery services. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2021 Mar 09].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/110992/rec/4395.
Council of Science Editors:
Wang C. New approaches for routing courier delivery services. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/110992/rec/4395
Clemson University
23.
Chanta, Sunarin.
IMPROVING QUALITY OF SERVICE IN EMS SYSTEMS BY REDUCING DISPARITIES BETWEEN SERVICE ZONES.
Degree: PhD, Industrial Engineering, 2011, Clemson University
URL: https://tigerprints.clemson.edu/all_dissertations/808
► Emergency medical service (EMS) systems respond to emergency or urgent calls so as to provide immediate care, such as pre-hospital care and/or transportation, to hospitals.…
(more)
▼ Emergency medical service (EMS) systems respond to emergency or urgent calls so as to provide immediate care, such as pre-hospital care and/or transportation, to hospitals. Care must be provided in a timely manner; in fact quality of service is usually directly associated with response time. To reduce the response time, the number and location of vehicles within the service area are important variables. However with limited capacity, increasing the number of vehicles is often an infeasible alternative. Therefore, a critical design goal is to decide at which facilities stations should be located in order to serve as much demand as possible in a reasonable time, and at the same time maintain equitable service between customers. This study aims to focus on locating ambulances which respond to 911 calls in EMS systems. The goals are to find the optimal base station location for vehicles so that the number of calls or customers served is maximized while disparity between those customers is minimized, to consider the survival rate of patients directly in the model, and develop appropriate meta-heuristics for solving problems which cannot be solved optimally.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Clemson%20University%22%20%2Bcontributor%3A%28%22Mayorga%2C%20Maria%20E.%22%29&pagesize-30">Mayorga, Maria E.,
search?q=%2Bpublisher%3A%22Clemson%20University%22%20%2Bcontributor%3A%28%22Wiecek%20%2C%20Margaret%20M.%22%29&pagesize-30">Wiecek , Margaret M.,
search?q=%2Bpublisher%3A%22Clemson%20University%22%20%2Bcontributor%3A%28%22Kurz%20%2C%20Mary%20E.%22%29&pagesize-30">Kurz , Mary E.,
search?q=%2Bpublisher%3A%22Clemson%20University%22%20%2Bcontributor%3A%28%22Ferrell%20%2C%20William%20G.%22%29&pagesize-30">Ferrell , William G..
Subjects/Keywords: emergency medical service; equity; facility location; tabu search; Industrial Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chanta, S. (2011). IMPROVING QUALITY OF SERVICE IN EMS SYSTEMS BY REDUCING DISPARITIES BETWEEN SERVICE ZONES. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/808
Chicago Manual of Style (16th Edition):
Chanta, Sunarin. “IMPROVING QUALITY OF SERVICE IN EMS SYSTEMS BY REDUCING DISPARITIES BETWEEN SERVICE ZONES.” 2011. Doctoral Dissertation, Clemson University. Accessed March 09, 2021.
https://tigerprints.clemson.edu/all_dissertations/808.
MLA Handbook (7th Edition):
Chanta, Sunarin. “IMPROVING QUALITY OF SERVICE IN EMS SYSTEMS BY REDUCING DISPARITIES BETWEEN SERVICE ZONES.” 2011. Web. 09 Mar 2021.
Vancouver:
Chanta S. IMPROVING QUALITY OF SERVICE IN EMS SYSTEMS BY REDUCING DISPARITIES BETWEEN SERVICE ZONES. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2021 Mar 09].
Available from: https://tigerprints.clemson.edu/all_dissertations/808.
Council of Science Editors:
Chanta S. IMPROVING QUALITY OF SERVICE IN EMS SYSTEMS BY REDUCING DISPARITIES BETWEEN SERVICE ZONES. [Doctoral Dissertation]. Clemson University; 2011. Available from: https://tigerprints.clemson.edu/all_dissertations/808
Clemson University
24.
Sangsawang, Ornurai.
METAHEURISTICS FOR HUB LOCATION MODELS.
Degree: PhD, Industrial Engineering, 2011, Clemson University
URL: https://tigerprints.clemson.edu/all_dissertations/804
► In this research, we propose metaheuristics for solving two p-hub median problems.. The first p-hub median problem, which is NP-hard, is the uncapacitated single p-hub…
(more)
▼ In this research, we propose metaheuristics for solving two p-hub median problems.. The first p-hub median problem, which is NP-hard, is the uncapacitated single p-hub median problem (USApHMP). In this problem, metaheuristics such as genetic algorithms, simulated annealing and
tabu search, are applied in different types of representations. Caching is also applied to speed up computational time of the algorithms. The results clearly demonstrate that
tabu search with a permutation solution representation, augmented with caching is the highest performing method, both in terms of solution quality and computational time among these algorithms for the USApHMP. We also investigate the performance of hybrid metaheuristics, formed by path-relinking augmentation of the three base algorithms (genetic algorithms, simulated annealing and
tabu search). The results indicate that hybridrization with path-relinking improvees the performance of base algorithms except
tabu search since a good base metaheuristic does not require path-relinking. For the second p-hub median problem, the NP-hard uncapacitated multiple p-hub median problem (UMApHMP), we proposed Multiple TS. We identify multiple nodes using the convex hull and methods derived from the
tabu search for the USApMHP. We find optimal allocations using the Single Reallocation Exchange procedure, developed for the USApHMP. The results show that implementing
tabu search with a geometric interpretation allows nearly all optimal solutions to be found.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Clemson%20University%22%20%2Bcontributor%3A%28%22Kurz%2C%20Mary%20E%22%29&pagesize-30">Kurz, Mary E,
search?q=%2Bpublisher%3A%22Clemson%20University%22%20%2Bcontributor%3A%28%22Cho%20%2C%20Byung%20R%22%29&pagesize-30">Cho , Byung R,
search?q=%2Bpublisher%3A%22Clemson%20University%22%20%2Bcontributor%3A%28%22Ferrell%20%2C%20William%20G%22%29&pagesize-30">Ferrell , William G,
search?q=%2Bpublisher%3A%22Clemson%20University%22%20%2Bcontributor%3A%28%22Mason%20%2C%20Scott%20J%22%29&pagesize-30">Mason , Scott J.
Subjects/Keywords: hub location; metaheuristics; path relinking; tabu search; UMApHMP; USApHMP; Industrial Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sangsawang, O. (2011). METAHEURISTICS FOR HUB LOCATION MODELS. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/804
Chicago Manual of Style (16th Edition):
Sangsawang, Ornurai. “METAHEURISTICS FOR HUB LOCATION MODELS.” 2011. Doctoral Dissertation, Clemson University. Accessed March 09, 2021.
https://tigerprints.clemson.edu/all_dissertations/804.
MLA Handbook (7th Edition):
Sangsawang, Ornurai. “METAHEURISTICS FOR HUB LOCATION MODELS.” 2011. Web. 09 Mar 2021.
Vancouver:
Sangsawang O. METAHEURISTICS FOR HUB LOCATION MODELS. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2021 Mar 09].
Available from: https://tigerprints.clemson.edu/all_dissertations/804.
Council of Science Editors:
Sangsawang O. METAHEURISTICS FOR HUB LOCATION MODELS. [Doctoral Dissertation]. Clemson University; 2011. Available from: https://tigerprints.clemson.edu/all_dissertations/804
University of Texas – Austin
25.
Yu, Yao, Ph. D.
Using real time traveler demand data to optimize commuter rail feeder systems.
Degree: PhD, Civil Engineering, 2012, University of Texas – Austin
URL: http://hdl.handle.net/2152/ETD-UT-2012-08-6026
► Commuter rail systems, operating on unused or under-used railroad rights-of-way, are being introduced into many urban transportation systems. Since locations of available rail rights-of-way were…
(more)
▼ Commuter rail systems, operating on unused or under-used railroad rights-of-way, are being introduced into many urban transportation systems. Since locations of available rail rights-of-way were typically chosen long ago to serve the needs of rail freight customers, these locations are not optimal for commuter rail users. The majority of commuter rail users do not live or work within walking distance of potential commuter rail stations, so provision of quick, convenient access to and from stations is a critical part of overall commuter decisions to use commuter rail.
Minimizing access time to rail stations and final destinations is crucial if commuter rail is to be a viable option for commuters. Well-designed feeder routes or circulator systems are regarded as potential solutions to provide train station to ultimate destination access. Transit planning for main line or feeder routes relies upon static demand estimates describing a typical day. Daily and peak-hour demands change in response to the state of the transport system, as influenced by weather, incidents, holiday schedules and many other factors.
Recent marketing successes of “smart phones” might provide an innovative means of obtaining real time data that could be used to identify optimal paths and stop locations for commuter rail circulator systems. Such advanced technology could allow commuter rail users to provide real-time final destination information that would enable real time optimization of feeder routes.
This dissertation focuses on real time optimization of the Commuter Rail Circulator Route Network Design Problem (CRCNDP). The route configuration of the circulator system – where to stop and the route among the stops – is determined on a real-time basis by employing adaptive
Tabu Search to timely solve an MIP problem with an objective to minimize total cost incurred to both transit users and transit operators. Numerical experiments are executed to find the threshold for the minimum fraction of travelers that would need to report their destinations via smart phone to guarantee the practical value of optimization based on real-time collected demand against a base case defined as the average performance of all possible routes. The adaptive
Tabu Search Algorithm is also applied to three real-size networks abstracted from the Martin Luther King (MLK) station of the new MetroRail system in Austin, Texas.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22University%20of%20Texas%26%23160%3B%26%238211%3B%20Austin%22%20%2Bcontributor%3A%28%22Machemehl%2C%20Randy%20B.%22%29&pagesize-30">Machemehl, Randy B. (advisor),
search?q=%2Bpublisher%3A%22University%20of%20Texas%26%23160%3B%26%238211%3B%20Austin%22%20%2Bcontributor%3A%28%22Leite%2C%20Fernanda%22%29&pagesize-30">Leite, Fernanda (committee member),
search?q=%2Bpublisher%3A%22University%20of%20Texas%26%23160%3B%26%238211%3B%20Austin%22%20%2Bcontributor%3A%28%22Kendrick%2C%20David%20A.%22%29&pagesize-30">Kendrick, David A. (committee member),
search?q=%2Bpublisher%3A%22University%20of%20Texas%26%23160%3B%26%238211%3B%20Austin%22%20%2Bcontributor%3A%28%22Boyles%2C%20Steve%22%29&pagesize-30">Boyles, Steve (committee member),
search?q=%2Bpublisher%3A%22University%20of%20Texas%26%23160%3B%26%238211%3B%20Austin%22%20%2Bcontributor%3A%28%22Zhang%2C%20Zhanmin%22%29&pagesize-30">Zhang, Zhanmin (committee member).
Subjects/Keywords: Commuter rail; Circulator; Real-time operation; Route design; Adaptive Tabu Search
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yu, Yao, P. D. (2012). Using real time traveler demand data to optimize commuter rail feeder systems. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2012-08-6026
Chicago Manual of Style (16th Edition):
Yu, Yao, Ph D. “Using real time traveler demand data to optimize commuter rail feeder systems.” 2012. Doctoral Dissertation, University of Texas – Austin. Accessed March 09, 2021.
http://hdl.handle.net/2152/ETD-UT-2012-08-6026.
MLA Handbook (7th Edition):
Yu, Yao, Ph D. “Using real time traveler demand data to optimize commuter rail feeder systems.” 2012. Web. 09 Mar 2021.
Vancouver:
Yu, Yao PD. Using real time traveler demand data to optimize commuter rail feeder systems. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2012. [cited 2021 Mar 09].
Available from: http://hdl.handle.net/2152/ETD-UT-2012-08-6026.
Council of Science Editors:
Yu, Yao PD. Using real time traveler demand data to optimize commuter rail feeder systems. [Doctoral Dissertation]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/ETD-UT-2012-08-6026
Purdue University
26.
Eun, Joonyup.
MODELS AND OPTIMIZATION FOR ELECTIVE SURGERY SCHEDULING UNDER UNCERTAINTY CONSIDERING PATIENT HEALTH CONDITION.
Degree: PhD, Industrial Engineering, 2016, Purdue University
URL: https://docs.lib.purdue.edu/open_access_dissertations/1383
► The managerial aspects to run a healthcare system are becoming increasingly important for patient safety. More than one patients are competing each other to be…
(more)
▼ The managerial aspects to run a healthcare system are becoming increasingly important for patient safety. More than one patients are competing each other to be treated using limited medical resources in a healthcare system. The limited medical resources include surgeons, physicians, anesthesiologists, nurses, operating rooms, wards, etc. Therefore, patient safety is related to how to run a healthcare system with the limited resources.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Purdue%20University%22%20%2Bcontributor%3A%28%22Yuehwern%20Yih%22%29&pagesize-30">Yuehwern Yih,
search?q=%2Bpublisher%3A%22Purdue%20University%22%20%2Bcontributor%3A%28%22Seokcheon%20Lee%22%29&pagesize-30">Seokcheon Lee,
search?q=%2Bpublisher%3A%22Purdue%20University%22%20%2Bcontributor%3A%28%22Andrew%20Lu%20Liu%22%29&pagesize-30">Andrew Lu Liu,
search?q=%2Bpublisher%3A%22Purdue%20University%22%20%2Bcontributor%3A%28%22Masha%20Shunko%22%29&pagesize-30">Masha Shunko.
Subjects/Keywords: Elective Surgery Scheduling; Patient Health Condition; Sample Average Approximation; Tabu Search
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Eun, J. (2016). MODELS AND OPTIMIZATION FOR ELECTIVE SURGERY SCHEDULING UNDER UNCERTAINTY CONSIDERING PATIENT HEALTH CONDITION. (Doctoral Dissertation). Purdue University. Retrieved from https://docs.lib.purdue.edu/open_access_dissertations/1383
Chicago Manual of Style (16th Edition):
Eun, Joonyup. “MODELS AND OPTIMIZATION FOR ELECTIVE SURGERY SCHEDULING UNDER UNCERTAINTY CONSIDERING PATIENT HEALTH CONDITION.” 2016. Doctoral Dissertation, Purdue University. Accessed March 09, 2021.
https://docs.lib.purdue.edu/open_access_dissertations/1383.
MLA Handbook (7th Edition):
Eun, Joonyup. “MODELS AND OPTIMIZATION FOR ELECTIVE SURGERY SCHEDULING UNDER UNCERTAINTY CONSIDERING PATIENT HEALTH CONDITION.” 2016. Web. 09 Mar 2021.
Vancouver:
Eun J. MODELS AND OPTIMIZATION FOR ELECTIVE SURGERY SCHEDULING UNDER UNCERTAINTY CONSIDERING PATIENT HEALTH CONDITION. [Internet] [Doctoral dissertation]. Purdue University; 2016. [cited 2021 Mar 09].
Available from: https://docs.lib.purdue.edu/open_access_dissertations/1383.
Council of Science Editors:
Eun J. MODELS AND OPTIMIZATION FOR ELECTIVE SURGERY SCHEDULING UNDER UNCERTAINTY CONSIDERING PATIENT HEALTH CONDITION. [Doctoral Dissertation]. Purdue University; 2016. Available from: https://docs.lib.purdue.edu/open_access_dissertations/1383
Wright State University
27.
Khambhampati, Surya Sudha.
A Tabu Search Heuristic for Multi-Period Clustering to
Rationalize Delivery Operations.
Degree: MSEgr, Industrial and Human Factors Engineering, 2008, Wright State University
URL: http://rave.ohiolink.edu/etdc/view?acc_num=wright1210959864
► Delivery operations use centralized warehouses to serve geographically distributed customers. Resources (e.g. personnel, trucks, stock, and equipment) are scheduled from the warehouses to distributed locations…
(more)
▼ Delivery operations use centralized warehouses to
serve geographically distributed customers. Resources (e.g.
personnel, trucks, stock, and equipment) are scheduled from the
warehouses to distributed locations with the aim of: (a) meeting
customer demands and, (b) rationalizing delivery operation costs.
My thesis investigates the problem of clustering customers based on
their geographical vicinity and their multi-period demands, while
optimally scheduling resources. The problem addresses
with-and-without capacity constraints of vehicles at the warehouse.
This problem is proven to be NP-Hard. Hence, solutions using
state-of-the-art exact methods such as branch and bound are not
pertinent due to the computation complexity involved. We develop a
K-means clustering algorithm for the initial solution and a
tabu
search heuristic that combines three advanced neighborhood
search
algorithms: (i) shift move, (ii) shift move with supernodes, and
(iii) ejection chain with supernodes, to accelerate
convergence.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Wright%20State%20University%22%20%2Bcontributor%3A%28%22Zhang%2C%20Xinhui%22%29&pagesize-30">Zhang, Xinhui (Advisor).
Subjects/Keywords: Operations Research; Tabu Search; Clustering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Khambhampati, S. S. (2008). A Tabu Search Heuristic for Multi-Period Clustering to
Rationalize Delivery Operations. (Masters Thesis). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1210959864
Chicago Manual of Style (16th Edition):
Khambhampati, Surya Sudha. “A Tabu Search Heuristic for Multi-Period Clustering to
Rationalize Delivery Operations.” 2008. Masters Thesis, Wright State University. Accessed March 09, 2021.
http://rave.ohiolink.edu/etdc/view?acc_num=wright1210959864.
MLA Handbook (7th Edition):
Khambhampati, Surya Sudha. “A Tabu Search Heuristic for Multi-Period Clustering to
Rationalize Delivery Operations.” 2008. Web. 09 Mar 2021.
Vancouver:
Khambhampati SS. A Tabu Search Heuristic for Multi-Period Clustering to
Rationalize Delivery Operations. [Internet] [Masters thesis]. Wright State University; 2008. [cited 2021 Mar 09].
Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1210959864.
Council of Science Editors:
Khambhampati SS. A Tabu Search Heuristic for Multi-Period Clustering to
Rationalize Delivery Operations. [Masters Thesis]. Wright State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1210959864
Colorado State University
28.
Kadappan, Karthik.
Element rearrangement for action classification on product manifolds.
Degree: MS(M.S.), Electrical and Computer Engineering, 2013, Colorado State University
URL: http://hdl.handle.net/10217/80250
► Conventional tensor-based classification algorithms unfold tensors into matrices using the standard mode-k unfoldings and perform classification using established machine learning algorithms. These methods assume that…
(more)
▼ Conventional tensor-based classification algorithms unfold tensors into matrices using the standard mode-k unfoldings and perform classification using established machine learning algorithms. These methods assume that the standard mode-k unfolded matrices are the best 2-dimensional representations of N-dimensional structures. In this thesis, we ask the question: "Is there a better way to unfold a tensor?" To address this question, we design a method to create unfoldings of a tensor by rearranging elements in the original tensor and then applying the standard mode-k unfoldings. The rearrangement of elements in a tensor is formulated as a combinatorial optimization problem and
tabu search is adapted in this work to solve it. We study this element rearrangement problem in the context of tensor-based action classification on product manifolds. We assess the proposed methods using a publicly available video data set, namely Cambridge-Gesture data set. We design several neighborhood structures and
search strategies for
tabu search and analyze their performance. Results reveal that the proposed element rearrangement algorithm developed in this thesis can be employed as a preprocessing step to increase classification accuracy in the context of action classification on product manifolds method.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Colorado%20State%20University%22%20%2Bcontributor%3A%28%22Beveridge%2C%20J.%20Ross%22%29&pagesize-30">Beveridge, J. Ross (advisor),
search?q=%2Bpublisher%3A%22Colorado%20State%20University%22%20%2Bcontributor%3A%28%22Maciejewski%2C%20Anthony%20A.%22%29&pagesize-30">Maciejewski, Anthony A. (committee member),
search?q=%2Bpublisher%3A%22Colorado%20State%20University%22%20%2Bcontributor%3A%28%22Peterson%2C%20Chris%22%29&pagesize-30">Peterson, Chris (committee member),
search?q=%2Bpublisher%3A%22Colorado%20State%20University%22%20%2Bcontributor%3A%28%22Rajopadhye%2C%20Sanjay%22%29&pagesize-30">Rajopadhye, Sanjay (committee member).
Subjects/Keywords: action classification; computer vision; element rearrangement; manifolds; Tabu search; tensor
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kadappan, K. (2013). Element rearrangement for action classification on product manifolds. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/80250
Chicago Manual of Style (16th Edition):
Kadappan, Karthik. “Element rearrangement for action classification on product manifolds.” 2013. Masters Thesis, Colorado State University. Accessed March 09, 2021.
http://hdl.handle.net/10217/80250.
MLA Handbook (7th Edition):
Kadappan, Karthik. “Element rearrangement for action classification on product manifolds.” 2013. Web. 09 Mar 2021.
Vancouver:
Kadappan K. Element rearrangement for action classification on product manifolds. [Internet] [Masters thesis]. Colorado State University; 2013. [cited 2021 Mar 09].
Available from: http://hdl.handle.net/10217/80250.
Council of Science Editors:
Kadappan K. Element rearrangement for action classification on product manifolds. [Masters Thesis]. Colorado State University; 2013. Available from: http://hdl.handle.net/10217/80250
Colorado State University
29.
Long, Kim Chenming.
Tabu search evolutionary algorithm for multiobjective optimization: application to a bi-criterion aircraft structural reliability problem, A.
Degree: PhD, Mechanical Engineering, 2015, Colorado State University
URL: http://hdl.handle.net/10217/167203
► Real-world engineering optimization problems often require the consideration of multiple conflicting and noncommensurate objectives, subject to nonconvex constraint regions in a high-dimensional decision space. Further…
(more)
▼ Real-world engineering optimization problems often require the consideration of multiple conflicting and noncommensurate objectives,
subject to nonconvex constraint regions in a high-dimensional decision space. Further challenges occur for combinatorial multiobjective problems in which the decision variables are not continuous. Traditional multiobjective optimization methods of operations research, such as weighting and epsilon constraint methods, are ill-suited to solving these complex, multiobjective problems. This has given rise to the application of a wide range of metaheuristic optimization algorithms, such as evolutionary, particle swarm, simulated annealing, and ant colony methods, to multiobjective optimization. Several multiobjective evolutionary algorithms have been developed, including the strength Pareto evolutionary algorithm (SPEA) and the non-dominated sorting genetic algorithm (NSGA), for determining the Pareto-optimal set of non-dominated solutions. Although numerous researchers have developed a wide range of multiobjective optimization algorithms, there is a continuing need to construct computationally efficient algorithms with an improved ability to converge to globally non-dominated solutions along the Pareto-optimal front for complex, large-scale, multiobjective engineering optimization problems. This is particularly important when the multiple objective functions and constraints of the real-world system cannot be expressed in explicit mathematical representations. This research presents a novel metaheuristic evolutionary algorithm for complex multiobjective optimization problems, which combines the metaheuristic
tabu search algorithm with the evolutionary algorithm (TSEA), as embodied in genetic algorithms. TSEA is successfully applied to bicriteria (i.e., structural reliability and retrofit cost) optimization of the aircraft tail structure fatigue life, which increases its reliability by prolonging fatigue life. A comparison for this application of the proposed algorithm, TSEA, with several state-of-the-art multiobjective optimization algorithms reveals that TSEA outperforms these algorithms by providing retrofit solutions with greater reliability for the same costs (i.e., closer to the Pareto-optimal front) after the algorithms are executed for the same number of generations. This research also demonstrates that TSEA competes with and, in some situations, outperforms state-of-the-art multiobjective optimization algorithms such as NSGA II and SPEA 2 when applied to classic bicriteria test problems in the technical literature and other complex, sizable real-world applications. The successful implementation of TSEA contributes to the safety of aeronautical structures by providing a systematic way to guide aircraft structural retrofitting efforts, as well as a potentially useful algorithm for a wide range of multiobjective optimization problems in engineering and other fields.
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Colorado%20State%20University%22%20%2Bcontributor%3A%28%22Duff%2C%20William%20S.%22%29&pagesize-30">Duff, William S. (advisor),
search?q=%2Bpublisher%3A%22Colorado%20State%20University%22%20%2Bcontributor%3A%28%22Labadie%2C%20John%20W.%22%29&pagesize-30">Labadie, John W. (advisor),
search?q=%2Bpublisher%3A%22Colorado%20State%20University%22%20%2Bcontributor%3A%28%22Stansloski%2C%20Mitchell%22%29&pagesize-30">Stansloski, Mitchell (committee member),
search?q=%2Bpublisher%3A%22Colorado%20State%20University%22%20%2Bcontributor%3A%28%22Chong%2C%20Edwin%20K.%20P.%22%29&pagesize-30">Chong, Edwin K. P. (committee member),
search?q=%2Bpublisher%3A%22Colorado%20State%20University%22%20%2Bcontributor%3A%28%22Sampath%2C%20Walajabad%20S.%22%29&pagesize-30">Sampath, Walajabad S. (committee member).
Subjects/Keywords: fatigue life; multiobjective optimization; tabu search; meta-heuristic; evolutionary algorithms; reliability
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Long, K. C. (2015). Tabu search evolutionary algorithm for multiobjective optimization: application to a bi-criterion aircraft structural reliability problem, A. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/167203
Chicago Manual of Style (16th Edition):
Long, Kim Chenming. “Tabu search evolutionary algorithm for multiobjective optimization: application to a bi-criterion aircraft structural reliability problem, A.” 2015. Doctoral Dissertation, Colorado State University. Accessed March 09, 2021.
http://hdl.handle.net/10217/167203.
MLA Handbook (7th Edition):
Long, Kim Chenming. “Tabu search evolutionary algorithm for multiobjective optimization: application to a bi-criterion aircraft structural reliability problem, A.” 2015. Web. 09 Mar 2021.
Vancouver:
Long KC. Tabu search evolutionary algorithm for multiobjective optimization: application to a bi-criterion aircraft structural reliability problem, A. [Internet] [Doctoral dissertation]. Colorado State University; 2015. [cited 2021 Mar 09].
Available from: http://hdl.handle.net/10217/167203.
Council of Science Editors:
Long KC. Tabu search evolutionary algorithm for multiobjective optimization: application to a bi-criterion aircraft structural reliability problem, A. [Doctoral Dissertation]. Colorado State University; 2015. Available from: http://hdl.handle.net/10217/167203
Delft University of Technology
30.
Hultermans, Thomas (author).
A Multi-Objective Optimization Model for the Buildup Allocation at KLM Cargo: Using a local search heuristic in a data driven application.
Degree: 2021, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:592876d6-3387-40ac-8204-d0dcedf16a3e
► The buildup phase at KLM Cargo requires cumbersome planning actions because of a slow data handover at the warehouse and an uncertain initial state of…
(more)
▼ The buildup phase at KLM Cargo requires cumbersome planning actions because of a slow data handover at the warehouse and an uncertain initial state of the buildup process at the beginning of the shift. This study presents a model to improve scheduling of future buildup shifts according to flight departure times of KLM. The most important objectives are to minimize the delays and equally distribute the workload. For this purpose, a MILP model has been created. The problem is modeled as a scheduling problem with time windows. Next to the branch-and-bound method, an adapted tabu search is implemented as an alternative optimization technique. Both methods show adequate performance in terms of computation time and model convergence. With the help of a real-time data architecture, scheduling can now be standardized, take less time, incorporate more detailed information and in addition, bottlenecks can be identified early.
Aerospace Engineering
Advisors/Committee Members: search?q=%2Bpublisher%3A%22Delft%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Roling%2C%20P.C.%22%29&pagesize-30">Roling, P.C. (mentor),
search?q=%2Bpublisher%3A%22Delft%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Bombelli%2C%20A.%22%29&pagesize-30">Bombelli, A. (graduation committee),
search?q=%2Bpublisher%3A%22Delft%20University%20of%20Technology%22%20%2Bcontributor%3A%28%22Delft%20University%20of%20Technology%22%29&pagesize-30">Delft University of Technology (degree granting institution).
Subjects/Keywords: Operations Research; Scheduling problem; Time Windows; tabu search
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hultermans, T. (. (2021). A Multi-Objective Optimization Model for the Buildup Allocation at KLM Cargo: Using a local search heuristic in a data driven application. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:592876d6-3387-40ac-8204-d0dcedf16a3e
Chicago Manual of Style (16th Edition):
Hultermans, Thomas (author). “A Multi-Objective Optimization Model for the Buildup Allocation at KLM Cargo: Using a local search heuristic in a data driven application.” 2021. Masters Thesis, Delft University of Technology. Accessed March 09, 2021.
http://resolver.tudelft.nl/uuid:592876d6-3387-40ac-8204-d0dcedf16a3e.
MLA Handbook (7th Edition):
Hultermans, Thomas (author). “A Multi-Objective Optimization Model for the Buildup Allocation at KLM Cargo: Using a local search heuristic in a data driven application.” 2021. Web. 09 Mar 2021.
Vancouver:
Hultermans T(. A Multi-Objective Optimization Model for the Buildup Allocation at KLM Cargo: Using a local search heuristic in a data driven application. [Internet] [Masters thesis]. Delft University of Technology; 2021. [cited 2021 Mar 09].
Available from: http://resolver.tudelft.nl/uuid:592876d6-3387-40ac-8204-d0dcedf16a3e.
Council of Science Editors:
Hultermans T(. A Multi-Objective Optimization Model for the Buildup Allocation at KLM Cargo: Using a local search heuristic in a data driven application. [Masters Thesis]. Delft University of Technology; 2021. Available from: http://resolver.tudelft.nl/uuid:592876d6-3387-40ac-8204-d0dcedf16a3e
◁ [1] [2] [3] [4] [5] [6] [7] [8] ▶
. 
Open Access Theses and Dissertations
