Advanced search options

Advanced Search Options 🞨

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

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Tabu search). Showing records 1 – 30 of 197 total matches.

[1] [2] [3] [4] [5] [6] [7]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Wright State University

1. 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

 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)

Subjects/Keywords: Operations Research; Tabu Search; Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Khambhampati SS. A Tabu Search Heuristic for Multi-Period Clustering to Rationalize Delivery Operations. [Internet] [Masters thesis]. Wright State University; 2008. [cited 2019 Oct 23]. 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


Oregon State University

2. 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

 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)

Subjects/Keywords: Tabu Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

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 2019 Oct 23]. 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

3. Benjamin, Aida Mauziah. Metaheuristics for the waste collection vehicle routing problem with time windows.

Degree: PhD, 2011, Brunel University

 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)

Subjects/Keywords: 519; Disposal facilities; Driver rest period; Tabu search; Variable neighbourhood search; Variable neighbourhood Tabu search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Benjamin AM. Metaheuristics for the waste collection vehicle routing problem with time windows. [Internet] [Doctoral dissertation]. Brunel University; 2011. [cited 2019 Oct 23]. 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


University of Kansas

4. Hacker, Joseph. Computational Molecular Design Using Tabu Search.

Degree: MS, Chemical & Petroleum Engineering, 2012, University of Kansas

 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)

Subjects/Keywords: Chemical engineering; Molecular design; Tabu search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. http://hdl.handle.net/1808/9839.

MLA Handbook (7th Edition):

Hacker, Joseph. “Computational Molecular Design Using Tabu Search.” 2012. Web. 23 Oct 2019.

Vancouver:

Hacker J. Computational Molecular Design Using Tabu Search. [Internet] [Masters thesis]. University of Kansas; 2012. [cited 2019 Oct 23]. 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

5. Hällgren, Eric Caap. Rescheduling blocked Vehicles at Daimler AG.

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

  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)

Subjects/Keywords: Rescheduling mixed-model sequencing tabu search metaheuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Hällgren EC. Rescheduling blocked Vehicles at Daimler AG. [Internet] [Thesis]. Linköping UniversityLinköping University; 2012. [cited 2019 Oct 23]. 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

6. Raichandani, Jay. Tabu Search Energy Optimization of Optical Grid Networks.

Degree: MS, Computer Science, 2016, University of Windsor

 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)

Subjects/Keywords: Anycast; Energy Efficient; Optical Grid; Tabu Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. https://scholar.uwindsor.ca/etd/5761.

MLA Handbook (7th Edition):

Raichandani, Jay. “Tabu Search Energy Optimization of Optical Grid Networks.” 2016. Web. 23 Oct 2019.

Vancouver:

Raichandani J. Tabu Search Energy Optimization of Optical Grid Networks. [Internet] [Masters thesis]. University of Windsor; 2016. [cited 2019 Oct 23]. 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


Linköping University

7. 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

  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)

Subjects/Keywords: weighted k-chinese postman problem heuristic tabu search metaheuristic tabu search; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Hölscher A. A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem. [Internet] [Thesis]. Linköping University; 2018. [cited 2019 Oct 23]. 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

8. 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

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)

Subjects/Keywords: CIENCIA DA COMPUTACAO; Job Shop Scheduling; GRASP; Tabu Search; Busca Tabu; GRASP; Escalonamento de processos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

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 2019 Oct 23]. 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

9. 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á

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)

Subjects/Keywords: PESQUISA OPERACIONAL; OtimizaÃÃo combinatÃria; optimization, maintenance on field, TSP, Tabu Search; ManutenÃÃo; PCV; Busca Tabu

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

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 2019 Oct 23]. 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

10. Kairaitis, Gediminas. Tvarkaraščių sudarymo uždavinių ir jų algoritmų tyrimas.

Degree: Master, Mathematics, 2010, Kaunas University of Technology

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)

Subjects/Keywords: Tabu paieška; Atkaitinimo modeliavimas; Darbo fabrikas; Tabu search; Simulated annealing algorithm; Job shop

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

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 2019 Oct 23]. 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

11. 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

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

Subjects/Keywords: [pt] BUSCA TABU; [en] TABU SEARCH; [pt] CIRCUITOS INTEGRADOS; [pt] TESTE LOGICO

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

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 2019 Oct 23]. 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

12. Li, Yinglei. Robust Vehicle Routing in Disaster Relief and Ride-Sharing: Models and Algorithms.

Degree: PhD, Systems Science and Industrial Engineering, 2017, Binghamton University

  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)

Subjects/Keywords: Applied sciences; Insertion algorithm; Robust optimization; Scoring tabu search with variable neighborhood; Tabu search; Vehicle routing problems; Engineering; Industrial Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Li Y. Robust Vehicle Routing in Disaster Relief and Ride-Sharing: Models and Algorithms. [Internet] [Doctoral dissertation]. Binghamton University; 2017. [cited 2019 Oct 23]. 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

13. Manavalasundaram V K. Efficient scheduling in decentralized grid environment;.

Degree: Efficient scheduling in decentralized grid environment, 2014, Anna University

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)

Subjects/Keywords: Grid computing; Heuristic Local Search; Heuristic Simulated Annealing; Heuristic Tabu Search; Information and communication engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

K MV. Efficient scheduling in decentralized grid environment;. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Oct 23]. 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

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

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

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

Thalén, Björn. “Manpower planning for airline pilots : A tabu search approach.” 2010. Web. 23 Oct 2019.

Vancouver:

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

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

Council of Science Editors:

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

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

15. Liu, Jiamin. Novel approaches to container loading : from heuristics to hybrid tabu search.

Degree: PhD, 2008, University of Bedfordshire

 This work investigates new approaches to the container loading problem which address the issue of how to load three-dimensional, rectangular items (e.g. boxes) into the… (more)

Subjects/Keywords: 658.7; G160 Engineering/Industrial Mathematics; container loading; volume utilisation; tabu search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, J. (2008). Novel approaches to container loading : from heuristics to hybrid tabu search. (Doctoral Dissertation). University of Bedfordshire. Retrieved from http://hdl.handle.net/10547/295765

Chicago Manual of Style (16th Edition):

Liu, Jiamin. “Novel approaches to container loading : from heuristics to hybrid tabu search.” 2008. Doctoral Dissertation, University of Bedfordshire. Accessed October 23, 2019. http://hdl.handle.net/10547/295765.

MLA Handbook (7th Edition):

Liu, Jiamin. “Novel approaches to container loading : from heuristics to hybrid tabu search.” 2008. Web. 23 Oct 2019.

Vancouver:

Liu J. Novel approaches to container loading : from heuristics to hybrid tabu search. [Internet] [Doctoral dissertation]. University of Bedfordshire; 2008. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/10547/295765.

Council of Science Editors:

Liu J. Novel approaches to container loading : from heuristics to hybrid tabu search. [Doctoral Dissertation]. University of Bedfordshire; 2008. Available from: http://hdl.handle.net/10547/295765


Brunel University

16. Woodside-Oriakhi, Maria. Portfolio optimisation with transaction cost.

Degree: PhD, 2011, Brunel University

 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)

Subjects/Keywords: Heuristic algorithms; Genetic algorithm; Tabu search; Simulated anealing; Optimal solutions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Woodside-Oriakhi M. Portfolio optimisation with transaction cost. [Internet] [Doctoral dissertation]. Brunel University; 2011. [cited 2019 Oct 23]. 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


Texas A&M University

17. Easwaran, Gopalakrishnan. Decomposition Based Solution Approaches for Multi-product Closed-Loop Supply Chain Network Design Models.

Degree: 2010, Texas A&M University

 Closed-loop supply chain (CLSC) management provides opportunity for cost savings through the integration of product recovery activities into traditional supply chains. Product recovery activities, such… (more)

Subjects/Keywords: Closed-loop supply chain management; logistics; Benders Decomposition; Tabu search heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Easwaran, G. (2010). Decomposition Based Solution Approaches for Multi-product Closed-Loop Supply Chain Network Design Models. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2008-08-69

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

Easwaran, Gopalakrishnan. “Decomposition Based Solution Approaches for Multi-product Closed-Loop Supply Chain Network Design Models.” 2010. Thesis, Texas A&M University. Accessed October 23, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2008-08-69.

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

MLA Handbook (7th Edition):

Easwaran, Gopalakrishnan. “Decomposition Based Solution Approaches for Multi-product Closed-Loop Supply Chain Network Design Models.” 2010. Web. 23 Oct 2019.

Vancouver:

Easwaran G. Decomposition Based Solution Approaches for Multi-product Closed-Loop Supply Chain Network Design Models. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-08-69.

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

Council of Science Editors:

Easwaran G. Decomposition Based Solution Approaches for Multi-product Closed-Loop Supply Chain Network Design Models. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-08-69

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


University of Illinois – Chicago

18. Kafle, Nabin. Advancing the Urban Parcel Delivery System Using Crowdshipping.

Degree: 2017, University of Illinois – Chicago

 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)

Subjects/Keywords: Crowdshipping; Vehicle-routing problem; Tabu search heuristics; Mechanism design

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Kafle N. Advancing the Urban Parcel Delivery System Using Crowdshipping. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2019 Oct 23]. 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


Ohio University

19. Liu, Yating. Motif Selection via a Tabu Search Solution to the Set Cover Problem.

Degree: MS, Computer Science (Engineering and Technology), 2017, Ohio University

 Transcription factors (TFs) regulate gene expression through interaction with specific DNA regions, called transcription factor binding sites (TFBSs). Identifying TFBSs can help in understanding the… (more)

Subjects/Keywords: Bioinformatics; Computer Science; motif selection; tabu search; set cover problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Y. (2017). Motif Selection via a Tabu Search Solution to the Set Cover Problem. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501626790431744

Chicago Manual of Style (16th Edition):

Liu, Yating. “Motif Selection via a Tabu Search Solution to the Set Cover Problem.” 2017. Masters Thesis, Ohio University. Accessed October 23, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501626790431744.

MLA Handbook (7th Edition):

Liu, Yating. “Motif Selection via a Tabu Search Solution to the Set Cover Problem.” 2017. Web. 23 Oct 2019.

Vancouver:

Liu Y. Motif Selection via a Tabu Search Solution to the Set Cover Problem. [Internet] [Masters thesis]. Ohio University; 2017. [cited 2019 Oct 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501626790431744.

Council of Science Editors:

Liu Y. Motif Selection via a Tabu Search Solution to the Set Cover Problem. [Masters Thesis]. Ohio University; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501626790431744


University of Southern California

20. Wang, Chen. New approaches for routing courier delivery services.

Degree: PhD, Industrial and Systems Engineering, 2012, University of Southern California

 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)

Subjects/Keywords: stochastic vehicle routing; multi-trip; time window; tabu search; clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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/4388

Chicago Manual of Style (16th Edition):

Wang, Chen. “New approaches for routing courier delivery services.” 2012. Doctoral Dissertation, University of Southern California. Accessed October 23, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/110992/rec/4388.

MLA Handbook (7th Edition):

Wang, Chen. “New approaches for routing courier delivery services.” 2012. Web. 23 Oct 2019.

Vancouver:

Wang C. New approaches for routing courier delivery services. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2019 Oct 23]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/110992/rec/4388.

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/4388


Clemson University

21. Chanta, Sunarin. IMPROVING QUALITY OF SERVICE IN EMS SYSTEMS BY REDUCING DISPARITIES BETWEEN SERVICE ZONES.

Degree: PhD, Industrial Engineering, 2011, Clemson University

 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)

Subjects/Keywords: emergency medical service; equity; facility location; tabu search; Industrial Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Chanta S. IMPROVING QUALITY OF SERVICE IN EMS SYSTEMS BY REDUCING DISPARITIES BETWEEN SERVICE ZONES. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2019 Oct 23]. 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

22. Sangsawang, Ornurai. METAHEURISTICS FOR HUB LOCATION MODELS.

Degree: PhD, Industrial Engineering, 2011, Clemson University

 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)

Subjects/Keywords: hub location; metaheuristics; path relinking; tabu search; UMApHMP; USApHMP; Industrial Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. https://tigerprints.clemson.edu/all_dissertations/804.

MLA Handbook (7th Edition):

Sangsawang, Ornurai. “METAHEURISTICS FOR HUB LOCATION MODELS.” 2011. Web. 23 Oct 2019.

Vancouver:

Sangsawang O. METAHEURISTICS FOR HUB LOCATION MODELS. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2019 Oct 23]. 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


Queensland University of Technology

23. Reeves, Claire Elspeth. Integrated scheduling for ambulances and ambulance crews.

Degree: 2015, Queensland University of Technology

 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)

Subjects/Keywords: ambulance; scheduling; tabu search; ant colony optimisation; flexible flow shop

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Reeves CE. Integrated scheduling for ambulances and ambulance crews. [Internet] [Thesis]. Queensland University of Technology; 2015. [cited 2019 Oct 23]. 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


Mississippi State University

24. Jain, Pramod. APPROXIMATE METHODS FOR SOLVING FLOWSHOP PROBLEMS.

Degree: MS, Industrial Engineering, 2005, Mississippi State University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Jain P. APPROXIMATE METHODS FOR SOLVING FLOWSHOP PROBLEMS. [Internet] [Masters thesis]. Mississippi State University; 2005. [cited 2019 Oct 23]. 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/ ;


Rochester Institute of Technology

25. Zhang, Lifan. Route-based transportation network design.

Degree: Industrial and Systems Engineering, 2013, Rochester Institute of Technology

 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)

Subjects/Keywords: Heuristics; Less-than-truckload; Tabu search; Vehicle routing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Zhang L. Route-based transportation network design. [Internet] [Thesis]. Rochester Institute of Technology; 2013. [cited 2019 Oct 23]. 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


North Carolina State University

26. Lightner, Carin Ann. A Tabu Search Approach to Multiple Sequence Alignment.

Degree: PhD, Operations Research, 2008, North Carolina State University

Subjects/Keywords: sequence alignment; tabu search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Lightner CA. A Tabu Search Approach to Multiple Sequence Alignment. [Internet] [Doctoral dissertation]. North Carolina State University; 2008. [cited 2019 Oct 23]. 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

27. Shahnawaz, Sanjana. Optimization of patients appointments in chemotherapy treatment unit: heuristic and metaheuristic approaches.

Degree: Mechanical and Manufacturing Engineering, 2012, University of Manitoba

 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)

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… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Shahnawaz S. Optimization of patients appointments in chemotherapy treatment unit: heuristic and metaheuristic approaches. [Internet] [Masters thesis]. University of Manitoba; 2012. [cited 2019 Oct 23]. 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


Colorado State University

28. 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

 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)

Subjects/Keywords: fatigue life; multiobjective optimization; tabu search; meta-heuristic; evolutionary algorithms; reliability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

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 2019 Oct 23]. 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


Purdue University

29. Eun, Joonyup. MODELS AND OPTIMIZATION FOR ELECTIVE SURGERY SCHEDULING UNDER UNCERTAINTY CONSIDERING PATIENT HEALTH CONDITION.

Degree: PhD, Industrial Engineering, 2016, Purdue University

 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)

Subjects/Keywords: Elective Surgery Scheduling; Patient Health Condition; Sample Average Approximation; Tabu Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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 October 23, 2019. 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. 23 Oct 2019.

Vancouver:

Eun J. MODELS AND OPTIMIZATION FOR ELECTIVE SURGERY SCHEDULING UNDER UNCERTAINTY CONSIDERING PATIENT HEALTH CONDITION. [Internet] [Doctoral dissertation]. Purdue University; 2016. [cited 2019 Oct 23]. 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

30. Äng, Oscar. Planering av stränggjutningsproduktion : En heruistisk metod.

Degree: Faculty of Science & Engineering, 2017, Linköping UniversityLinköping University

Detta arbete syftar till att undersöka om det är möjligt att med en heuristisk metod skapa giltiga lösningar till ett problem vid planering av… (more)

Subjects/Keywords: Cast Batching Problem; Variable Neighbourhood Search; Simulated Annealing; Tabu Search; Stränggjutningsproblem; Variable Neighbourhood Search; Simulated Annealing; tabusökning; Other Mathematics; Annan matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Äng, O. (2017). Planering av stränggjutningsproduktion : En heruistisk metod. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-136271

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

Äng, Oscar. “Planering av stränggjutningsproduktion : En heruistisk metod.” 2017. Thesis, Linköping UniversityLinköping University. Accessed October 23, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-136271.

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

MLA Handbook (7th Edition):

Äng, Oscar. “Planering av stränggjutningsproduktion : En heruistisk metod.” 2017. Web. 23 Oct 2019.

Vancouver:

Äng O. Planering av stränggjutningsproduktion : En heruistisk metod. [Internet] [Thesis]. Linköping UniversityLinköping University; 2017. [cited 2019 Oct 23]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-136271.

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

Council of Science Editors:

Äng O. Planering av stränggjutningsproduktion : En heruistisk metod. [Thesis]. Linköping UniversityLinköping University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-136271

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

[1] [2] [3] [4] [5] [6] [7]

.