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:(Travelling salesman problem). Showing records 1 – 30 of 60 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Languages

▼ Search Limiters


Rochester Institute of Technology

1. Murthy, Sapna Guniguntla. Disaster recovery heuristic.

Degree: Computer Engineering, 2009, Rochester Institute of Technology

 A need exists to develop a software simulation that demonstrates the most effective methods of evacuation for disaster scenarios. In a real-world situation this heuristic… (more)

Subjects/Keywords: Heuristic; Travelling salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Murthy, S. G. (2009). Disaster recovery heuristic. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/3209

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

Murthy, Sapna Guniguntla. “Disaster recovery heuristic.” 2009. Thesis, Rochester Institute of Technology. Accessed April 03, 2020. https://scholarworks.rit.edu/theses/3209.

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

MLA Handbook (7th Edition):

Murthy, Sapna Guniguntla. “Disaster recovery heuristic.” 2009. Web. 03 Apr 2020.

Vancouver:

Murthy SG. Disaster recovery heuristic. [Internet] [Thesis]. Rochester Institute of Technology; 2009. [cited 2020 Apr 03]. Available from: https://scholarworks.rit.edu/theses/3209.

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

Council of Science Editors:

Murthy SG. Disaster recovery heuristic. [Thesis]. Rochester Institute of Technology; 2009. Available from: https://scholarworks.rit.edu/theses/3209

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


University of Illinois – Urbana-Champaign

2. Roehl, Brian. Maximum-entropy principle approach to the multiple travelling salesman problem and related problems.

Degree: MS, 0133, 2012, University of Illinois – Urbana-Champaign

 This thesis presents an investigation into the applications of the maximum-entropy principle as a heuristic for the multiple travelling salesman problem. This is a computationally… (more)

Subjects/Keywords: Maximum-Entropy Principle; Deterministic Annealing; Travelling Salesman Problem; Multiple Travelling Salesman Problem; Close Enough Travelling Salesman Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roehl, B. (2012). Maximum-entropy principle approach to the multiple travelling salesman problem and related problems. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29735

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

Roehl, Brian. “Maximum-entropy principle approach to the multiple travelling salesman problem and related problems.” 2012. Thesis, University of Illinois – Urbana-Champaign. Accessed April 03, 2020. http://hdl.handle.net/2142/29735.

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

MLA Handbook (7th Edition):

Roehl, Brian. “Maximum-entropy principle approach to the multiple travelling salesman problem and related problems.” 2012. Web. 03 Apr 2020.

Vancouver:

Roehl B. Maximum-entropy principle approach to the multiple travelling salesman problem and related problems. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/2142/29735.

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

Council of Science Editors:

Roehl B. Maximum-entropy principle approach to the multiple travelling salesman problem and related problems. [Thesis]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29735

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


Texas A&M University

3. Oberlin, Paul V. Path Planning Algorithms for Multiple Heterogeneous Vehicles.

Degree: 2010, Texas A&M University

 Unmanned aerial vehicles (UAVs) are becoming increasingly popular for surveillance in civil and military applications. Vehicles built for this purpose vary in their sensing capabilities,… (more)

Subjects/Keywords: Path Planning; Heterogenous Travelling Salesman Problem; TSP; Noon-Bean Transformation; Precedence Constrained Travelling Salesman Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oberlin, P. V. (2010). Path Planning Algorithms for Multiple Heterogeneous Vehicles. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-762

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

Oberlin, Paul V. “Path Planning Algorithms for Multiple Heterogeneous Vehicles.” 2010. Thesis, Texas A&M University. Accessed April 03, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-762.

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

MLA Handbook (7th Edition):

Oberlin, Paul V. “Path Planning Algorithms for Multiple Heterogeneous Vehicles.” 2010. Web. 03 Apr 2020.

Vancouver:

Oberlin PV. Path Planning Algorithms for Multiple Heterogeneous Vehicles. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-762.

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

Council of Science Editors:

Oberlin PV. Path Planning Algorithms for Multiple Heterogeneous Vehicles. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-762

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


University of Ottawa

4. Desjardins, Nicholas. On Applying Methods for Graph-TSP to Metric TSP .

Degree: 2016, University of Ottawa

 The Metric Travelling Salesman Problem, henceforth metric TSP, is a fundamental problem in combinatorial optimization which consists of finding a minimum cost Hamiltonian cycle (also… (more)

Subjects/Keywords: travelling salesman problem; integrality gap; T-joins; approximation algorithm; heuristic; metric travelling; salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Desjardins, N. (2016). On Applying Methods for Graph-TSP to Metric TSP . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/35613

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

Desjardins, Nicholas. “On Applying Methods for Graph-TSP to Metric TSP .” 2016. Thesis, University of Ottawa. Accessed April 03, 2020. http://hdl.handle.net/10393/35613.

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

MLA Handbook (7th Edition):

Desjardins, Nicholas. “On Applying Methods for Graph-TSP to Metric TSP .” 2016. Web. 03 Apr 2020.

Vancouver:

Desjardins N. On Applying Methods for Graph-TSP to Metric TSP . [Internet] [Thesis]. University of Ottawa; 2016. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/10393/35613.

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

Council of Science Editors:

Desjardins N. On Applying Methods for Graph-TSP to Metric TSP . [Thesis]. University of Ottawa; 2016. Available from: http://hdl.handle.net/10393/35613

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

5. Στυλιανού, Νικόλαος. Προσεγγίζοντας το πρόβλημα του πλανόδιου πωλητή.

Degree: 2013, University of Patras

Σ’ αυτή τη διπλωματική εργασία, παρουσιάζουμε προσεγγιστικούς αλγόριθμους για το Πρόβλημα του Πλανόδιου Πωλητή, μερικές πρακτικές εφαρμογές και κάποιες σχετικές παραλλαγές του κύριου προβλήματος. Ένας… (more)

Subjects/Keywords: Πρόβλημα πλανόδιου πωλητή; 519.64; Travelling Salesman Problem (TSP)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Στυλιανού, . (2013). Προσεγγίζοντας το πρόβλημα του πλανόδιου πωλητή. (Masters Thesis). University of Patras. Retrieved from http://hdl.handle.net/10889/6347

Chicago Manual of Style (16th Edition):

Στυλιανού, Νικόλαος. “Προσεγγίζοντας το πρόβλημα του πλανόδιου πωλητή.” 2013. Masters Thesis, University of Patras. Accessed April 03, 2020. http://hdl.handle.net/10889/6347.

MLA Handbook (7th Edition):

Στυλιανού, Νικόλαος. “Προσεγγίζοντας το πρόβλημα του πλανόδιου πωλητή.” 2013. Web. 03 Apr 2020.

Vancouver:

Στυλιανού . Προσεγγίζοντας το πρόβλημα του πλανόδιου πωλητή. [Internet] [Masters thesis]. University of Patras; 2013. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/10889/6347.

Council of Science Editors:

Στυλιανού . Προσεγγίζοντας το πρόβλημα του πλανόδιου πωλητή. [Masters Thesis]. University of Patras; 2013. Available from: http://hdl.handle.net/10889/6347


University of Adelaide

6. Thompson, Glen R. Analysis of a combinatorial approach to the travelling salesman problem.

Degree: 1968, University of Adelaide

Ch. 1. Introduction  – Ch. 2. Some results concerning p-optimality  – Ch. 3. Algorithms for the travelling salesman problem  – Ch. 4. Discussion. Advisors/Committee Members: Dept. of Mathematics (school).

Subjects/Keywords: Combinatorial analysis; Travelling-salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thompson, G. R. (1968). Analysis of a combinatorial approach to the travelling salesman problem. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/115064

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

Thompson, Glen R. “Analysis of a combinatorial approach to the travelling salesman problem.” 1968. Thesis, University of Adelaide. Accessed April 03, 2020. http://hdl.handle.net/2440/115064.

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

MLA Handbook (7th Edition):

Thompson, Glen R. “Analysis of a combinatorial approach to the travelling salesman problem.” 1968. Web. 03 Apr 2020.

Vancouver:

Thompson GR. Analysis of a combinatorial approach to the travelling salesman problem. [Internet] [Thesis]. University of Adelaide; 1968. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/2440/115064.

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

Council of Science Editors:

Thompson GR. Analysis of a combinatorial approach to the travelling salesman problem. [Thesis]. University of Adelaide; 1968. Available from: http://hdl.handle.net/2440/115064

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


Colorado State University

7. Allen, Zachariah A. Use of traveling salesman problem solvers in the construction of genetic linkage maps.

Degree: MS(M.S.), Computer Science, 2016, Colorado State University

 Construction of genetic linkage maps is an important tool for Biology. Researchers use a variety of laboratory techniques to extract genetic marker data from an… (more)

Subjects/Keywords: genetic linkage; linkage map; travelling salesman problem; TSP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Allen, Z. A. (2016). Use of traveling salesman problem solvers in the construction of genetic linkage maps. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/170397

Chicago Manual of Style (16th Edition):

Allen, Zachariah A. “Use of traveling salesman problem solvers in the construction of genetic linkage maps.” 2016. Masters Thesis, Colorado State University. Accessed April 03, 2020. http://hdl.handle.net/10217/170397.

MLA Handbook (7th Edition):

Allen, Zachariah A. “Use of traveling salesman problem solvers in the construction of genetic linkage maps.” 2016. Web. 03 Apr 2020.

Vancouver:

Allen ZA. Use of traveling salesman problem solvers in the construction of genetic linkage maps. [Internet] [Masters thesis]. Colorado State University; 2016. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/10217/170397.

Council of Science Editors:

Allen ZA. Use of traveling salesman problem solvers in the construction of genetic linkage maps. [Masters Thesis]. Colorado State University; 2016. Available from: http://hdl.handle.net/10217/170397

8. Anbuudayasankar, S P. Unified heuristics for a class of complex and practical routing problems in logistics.

Degree: 2011, Amrita Vishwa Vidyapeetham (University)

Travelling Salesmen Problem (TSP) and Vehicle Routing Problem (VRP) are areas which have been widely dealt with in the last four decades. Methodologies were developed… (more)

Subjects/Keywords: Heuristics Construction; Travelling Salesman Problem; Vehicle Routing Problem; Simulated Annealing; Genetic Algorithm; Heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Anbuudayasankar, S. P. (2011). Unified heuristics for a class of complex and practical routing problems in logistics. (Thesis). Amrita Vishwa Vidyapeetham (University). Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/2358

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

Anbuudayasankar, S P. “Unified heuristics for a class of complex and practical routing problems in logistics.” 2011. Thesis, Amrita Vishwa Vidyapeetham (University). Accessed April 03, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/2358.

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

MLA Handbook (7th Edition):

Anbuudayasankar, S P. “Unified heuristics for a class of complex and practical routing problems in logistics.” 2011. Web. 03 Apr 2020.

Vancouver:

Anbuudayasankar SP. Unified heuristics for a class of complex and practical routing problems in logistics. [Internet] [Thesis]. Amrita Vishwa Vidyapeetham (University); 2011. [cited 2020 Apr 03]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/2358.

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

Council of Science Editors:

Anbuudayasankar SP. Unified heuristics for a class of complex and practical routing problems in logistics. [Thesis]. Amrita Vishwa Vidyapeetham (University); 2011. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/2358

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


University of Edinburgh

9. Terzis, Panagiotis. Web Tourist Route Description Tool.

Degree: 2010, University of Edinburgh

 This paper presents an application built for the Gazetteer for Scotland (GfS). The application exploits the fact that the GfS has a large and reliable… (more)

Subjects/Keywords: GIS; tourism; Google maps; Buffer; Travelling Salesman Problem; Geographical Information Science; Gazetteer for Scotland

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Terzis, P. (2010). Web Tourist Route Description Tool. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/3749

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

Terzis, Panagiotis. “Web Tourist Route Description Tool.” 2010. Thesis, University of Edinburgh. Accessed April 03, 2020. http://hdl.handle.net/1842/3749.

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

MLA Handbook (7th Edition):

Terzis, Panagiotis. “Web Tourist Route Description Tool.” 2010. Web. 03 Apr 2020.

Vancouver:

Terzis P. Web Tourist Route Description Tool. [Internet] [Thesis]. University of Edinburgh; 2010. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/1842/3749.

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

Council of Science Editors:

Terzis P. Web Tourist Route Description Tool. [Thesis]. University of Edinburgh; 2010. Available from: http://hdl.handle.net/1842/3749

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


University of Cambridge

10. Pogiatzis, Thomas. Application of mixed-integer programming in chemical engineering.

Degree: PhD, 2013, University of Cambridge

 Mixed-Integer Programming has been a vital tool for the chemical engineer in the recent decades and is employed extensively in process design and control. This… (more)

Subjects/Keywords: 660; Chemical engineering; Mixed-integer programming; Travelling salesman problem; Heat exchanger; Optimisation; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pogiatzis, T. (2013). Application of mixed-integer programming in chemical engineering. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/245023 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.590228

Chicago Manual of Style (16th Edition):

Pogiatzis, Thomas. “Application of mixed-integer programming in chemical engineering.” 2013. Doctoral Dissertation, University of Cambridge. Accessed April 03, 2020. https://www.repository.cam.ac.uk/handle/1810/245023 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.590228.

MLA Handbook (7th Edition):

Pogiatzis, Thomas. “Application of mixed-integer programming in chemical engineering.” 2013. Web. 03 Apr 2020.

Vancouver:

Pogiatzis T. Application of mixed-integer programming in chemical engineering. [Internet] [Doctoral dissertation]. University of Cambridge; 2013. [cited 2020 Apr 03]. Available from: https://www.repository.cam.ac.uk/handle/1810/245023 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.590228.

Council of Science Editors:

Pogiatzis T. Application of mixed-integer programming in chemical engineering. [Doctoral Dissertation]. University of Cambridge; 2013. Available from: https://www.repository.cam.ac.uk/handle/1810/245023 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.590228


University of Cambridge

11. Pogiatzis, Thomas. Application of mixed-integer programming in chemical engineering.

Degree: PhD, 2013, University of Cambridge

 Mixed-Integer Programming has been a vital tool for the chemical engineer in the recent decades and is employed extensively in process design and control. This… (more)

Subjects/Keywords: Chemical engineering; Mixed-integer programming; Travelling salesman problem; Heat exchanger; Optimisation; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pogiatzis, T. (2013). Application of mixed-integer programming in chemical engineering. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/245023https://www.repository.cam.ac.uk/bitstream/1810/245023/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245023/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245023/6/thesis.pdf.jpg

Chicago Manual of Style (16th Edition):

Pogiatzis, Thomas. “Application of mixed-integer programming in chemical engineering.” 2013. Doctoral Dissertation, University of Cambridge. Accessed April 03, 2020. https://www.repository.cam.ac.uk/handle/1810/245023https://www.repository.cam.ac.uk/bitstream/1810/245023/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245023/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245023/6/thesis.pdf.jpg.

MLA Handbook (7th Edition):

Pogiatzis, Thomas. “Application of mixed-integer programming in chemical engineering.” 2013. Web. 03 Apr 2020.

Vancouver:

Pogiatzis T. Application of mixed-integer programming in chemical engineering. [Internet] [Doctoral dissertation]. University of Cambridge; 2013. [cited 2020 Apr 03]. Available from: https://www.repository.cam.ac.uk/handle/1810/245023https://www.repository.cam.ac.uk/bitstream/1810/245023/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245023/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245023/6/thesis.pdf.jpg.

Council of Science Editors:

Pogiatzis T. Application of mixed-integer programming in chemical engineering. [Doctoral Dissertation]. University of Cambridge; 2013. Available from: https://www.repository.cam.ac.uk/handle/1810/245023https://www.repository.cam.ac.uk/bitstream/1810/245023/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245023/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245023/6/thesis.pdf.jpg


University of Guelph

12. Radford, Dave. A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs .

Degree: 2016, University of Guelph

 Parallel programming is becoming the norm for modern computer programming. In order to utilize system resources effectively, programmers can use programming patterns to improve their… (more)

Subjects/Keywords: Parallel Patterns; Genetic Algorithms; Travelling Salesman Problem; Many-core devices; CUDA; Parallel Computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Radford, D. (2016). A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/9762

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

Radford, Dave. “A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs .” 2016. Thesis, University of Guelph. Accessed April 03, 2020. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/9762.

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

MLA Handbook (7th Edition):

Radford, Dave. “A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs .” 2016. Web. 03 Apr 2020.

Vancouver:

Radford D. A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs . [Internet] [Thesis]. University of Guelph; 2016. [cited 2020 Apr 03]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/9762.

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

Council of Science Editors:

Radford D. A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs . [Thesis]. University of Guelph; 2016. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/9762

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


NSYSU

13. Hsu, Hsin-yun. Improving the search of near-optimal solution of vehicle routine problems with parallelable modified algorithms.

Degree: Master, Applied Mathematics, 2017, NSYSU

 We consider finding the near-optimized solution of logistic's vehicle routing problem includes grouping of customers and travelling salesman problem. We try to balance the number… (more)

Subjects/Keywords: Feiring algorithm; Vehicle routing problem (VRP); MPI; Travelling salesman problem (TSP); k-mean clustering; 2-opt

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hsu, H. (2017). Improving the search of near-optimal solution of vehicle routine problems with parallelable modified algorithms. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629117-234517

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

Hsu, Hsin-yun. “Improving the search of near-optimal solution of vehicle routine problems with parallelable modified algorithms.” 2017. Thesis, NSYSU. Accessed April 03, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629117-234517.

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

MLA Handbook (7th Edition):

Hsu, Hsin-yun. “Improving the search of near-optimal solution of vehicle routine problems with parallelable modified algorithms.” 2017. Web. 03 Apr 2020.

Vancouver:

Hsu H. Improving the search of near-optimal solution of vehicle routine problems with parallelable modified algorithms. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Apr 03]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629117-234517.

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

Council of Science Editors:

Hsu H. Improving the search of near-optimal solution of vehicle routine problems with parallelable modified algorithms. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629117-234517

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


Universidade do Minho

14. Duarte, Ana Cláudia da Silva. Análise e melhoria das rotas de distribuição numa empresa de cartonagem .

Degree: 2019, Universidade do Minho

 A presente dissertação foi desenvolvida no âmbito do Mestrado em Engenharia Industrial – Ramo de Logística e Distribuição da Universidade do Minho e, em ambiente… (more)

Subjects/Keywords: Logística; Distribuição; Problema do caixeiro viajante; Problema do roteamento de veículos; Heurísticas; Logistics; Distribution; Travelling salesman problem; Vehicle routing problem; Heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duarte, A. C. d. S. (2019). Análise e melhoria das rotas de distribuição numa empresa de cartonagem . (Masters Thesis). Universidade do Minho. Retrieved from http://hdl.handle.net/1822/62542

Chicago Manual of Style (16th Edition):

Duarte, Ana Cláudia da Silva. “Análise e melhoria das rotas de distribuição numa empresa de cartonagem .” 2019. Masters Thesis, Universidade do Minho. Accessed April 03, 2020. http://hdl.handle.net/1822/62542.

MLA Handbook (7th Edition):

Duarte, Ana Cláudia da Silva. “Análise e melhoria das rotas de distribuição numa empresa de cartonagem .” 2019. Web. 03 Apr 2020.

Vancouver:

Duarte ACdS. Análise e melhoria das rotas de distribuição numa empresa de cartonagem . [Internet] [Masters thesis]. Universidade do Minho; 2019. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/1822/62542.

Council of Science Editors:

Duarte ACdS. Análise e melhoria das rotas de distribuição numa empresa de cartonagem . [Masters Thesis]. Universidade do Minho; 2019. Available from: http://hdl.handle.net/1822/62542


Brno University of Technology

15. Votavová, Helena. Matematické modely dopravních úloh .

Degree: 2012, Brno University of Technology

 Práce se zabývá modelováním a řešením vybraných dopravních úloh. Nejprve jsou uvedeny historické postřehy, praktické poznatky a formulovány vybrané problémy. Potom se práce věnuje modelování… (more)

Subjects/Keywords: dopravní úlohy; optimalizace; teorie grafů; problém obchodního cestujícího; heuristiky; transportation problem; optimization; graph theory; travelling salesman problem; heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Votavová, H. (2012). Matematické modely dopravních úloh . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/10286

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

Votavová, Helena. “Matematické modely dopravních úloh .” 2012. Thesis, Brno University of Technology. Accessed April 03, 2020. http://hdl.handle.net/11012/10286.

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

MLA Handbook (7th Edition):

Votavová, Helena. “Matematické modely dopravních úloh .” 2012. Web. 03 Apr 2020.

Vancouver:

Votavová H. Matematické modely dopravních úloh . [Internet] [Thesis]. Brno University of Technology; 2012. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/11012/10286.

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

Council of Science Editors:

Votavová H. Matematické modely dopravních úloh . [Thesis]. Brno University of Technology; 2012. Available from: http://hdl.handle.net/11012/10286

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

16. Francisco Chagas de Lima Júnior. Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético.

Degree: 2009, Universidade Federal do Rio Grande do Norte

Técnicas de otimização conhecidas como metaheurísticas têm obtido sucesso na resolução de problemas classificados como NP - Árduos. Estes métodos utilizam abordagens não determinísticas que… (more)

Subjects/Keywords: MetaheurísticaGRASP; Algoritmos genéticos; AlgoritmoQ-learning; Problema do caixeiro viajante; ENGENHARIA ELETRICA; GRASP metaheuristic; Genetic algorithm; Q-learning algorithm; Travelling salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Júnior, F. C. d. L. (2009). Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético. (Thesis). Universidade Federal do Rio Grande do Norte. Retrieved from http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2428

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

Júnior, Francisco Chagas de Lima. “Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético.” 2009. Thesis, Universidade Federal do Rio Grande do Norte. Accessed April 03, 2020. http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2428.

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

MLA Handbook (7th Edition):

Júnior, Francisco Chagas de Lima. “Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético.” 2009. Web. 03 Apr 2020.

Vancouver:

Júnior FCdL. Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético. [Internet] [Thesis]. Universidade Federal do Rio Grande do Norte; 2009. [cited 2020 Apr 03]. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2428.

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

Council of Science Editors:

Júnior FCdL. Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético. [Thesis]. Universidade Federal do Rio Grande do Norte; 2009. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2428

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


University of Alberta

17. Navab-Kashani, Reza. Productivity Analysis of Closed Circuit Television (CCTV) Sewer Mainline Inspection.

Degree: MS, Department of Civil and Environmental Engineering, 2014, University of Alberta

 This thesis focuses on conducting productivity analysis for sewer mainline CCTV inspection through two phases: 1) developing the standard time for CCTV inspection and analyzing… (more)

Subjects/Keywords: TSP; Productivity Improvement; Rout Optimization; Travelling Salesman Problem; Productivity Factor; Temperature; Weather Condition; Sewer; CCTV; Productivity Study; Inspection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Navab-Kashani, R. (2014). Productivity Analysis of Closed Circuit Television (CCTV) Sewer Mainline Inspection. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/vq27zp063

Chicago Manual of Style (16th Edition):

Navab-Kashani, Reza. “Productivity Analysis of Closed Circuit Television (CCTV) Sewer Mainline Inspection.” 2014. Masters Thesis, University of Alberta. Accessed April 03, 2020. https://era.library.ualberta.ca/files/vq27zp063.

MLA Handbook (7th Edition):

Navab-Kashani, Reza. “Productivity Analysis of Closed Circuit Television (CCTV) Sewer Mainline Inspection.” 2014. Web. 03 Apr 2020.

Vancouver:

Navab-Kashani R. Productivity Analysis of Closed Circuit Television (CCTV) Sewer Mainline Inspection. [Internet] [Masters thesis]. University of Alberta; 2014. [cited 2020 Apr 03]. Available from: https://era.library.ualberta.ca/files/vq27zp063.

Council of Science Editors:

Navab-Kashani R. Productivity Analysis of Closed Circuit Television (CCTV) Sewer Mainline Inspection. [Masters Thesis]. University of Alberta; 2014. Available from: https://era.library.ualberta.ca/files/vq27zp063


Universidade do Rio Grande do Norte

18. Silva Neto, João Saturnino da. Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico .

Degree: 2009, Universidade do Rio Grande do Norte

 The present essay shows strategies of improvement in a well succeded evolutionary metaheuristic to solve the Asymmetric Traveling Salesman Problem. Such steps consist in a… (more)

Subjects/Keywords: Algoritmo Memético; Path-Relinking; Vocabulary Building; Problema do Caixeiro Viajante Assimétrico; Memetic Algoritm; Path-Relinking; Vocabulary Building; Asymmetric Travelling Salesman Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silva Neto, J. S. d. (2009). Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico . (Masters Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/17005

Chicago Manual of Style (16th Edition):

Silva Neto, João Saturnino da. “Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico .” 2009. Masters Thesis, Universidade do Rio Grande do Norte. Accessed April 03, 2020. http://repositorio.ufrn.br/handle/123456789/17005.

MLA Handbook (7th Edition):

Silva Neto, João Saturnino da. “Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico .” 2009. Web. 03 Apr 2020.

Vancouver:

Silva Neto JSd. Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico . [Internet] [Masters thesis]. Universidade do Rio Grande do Norte; 2009. [cited 2020 Apr 03]. Available from: http://repositorio.ufrn.br/handle/123456789/17005.

Council of Science Editors:

Silva Neto JSd. Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico . [Masters Thesis]. Universidade do Rio Grande do Norte; 2009. Available from: http://repositorio.ufrn.br/handle/123456789/17005


Universidade do Rio Grande do Norte

19. Lima Júnior, Francisco Chagas de. Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético .

Degree: 2009, Universidade do Rio Grande do Norte

 Techniques of optimization known as metaheuristics have achieved success in the resolution of many problems classified as NP-Hard. These methods use non deterministic approaches that… (more)

Subjects/Keywords: MetaheurísticaGRASP; Algoritmos genéticos; AlgoritmoQ-learning; Problema do caixeiro viajante; GRASP metaheuristic; Genetic algorithm; Q-learning algorithm; Travelling salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lima Júnior, F. C. d. (2009). Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético . (Doctoral Dissertation). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/15129

Chicago Manual of Style (16th Edition):

Lima Júnior, Francisco Chagas de. “Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético .” 2009. Doctoral Dissertation, Universidade do Rio Grande do Norte. Accessed April 03, 2020. http://repositorio.ufrn.br/handle/123456789/15129.

MLA Handbook (7th Edition):

Lima Júnior, Francisco Chagas de. “Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético .” 2009. Web. 03 Apr 2020.

Vancouver:

Lima Júnior FCd. Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético . [Internet] [Doctoral dissertation]. Universidade do Rio Grande do Norte; 2009. [cited 2020 Apr 03]. Available from: http://repositorio.ufrn.br/handle/123456789/15129.

Council of Science Editors:

Lima Júnior FCd. Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético . [Doctoral Dissertation]. Universidade do Rio Grande do Norte; 2009. Available from: http://repositorio.ufrn.br/handle/123456789/15129


Universidade do Rio Grande do Norte

20. Lima Júnior, Francisco Chagas de. Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético .

Degree: 2009, Universidade do Rio Grande do Norte

 Techniques of optimization known as metaheuristics have achieved success in the resolution of many problems classified as NP-Hard. These methods use non deterministic approaches that… (more)

Subjects/Keywords: MetaheurísticaGRASP; Algoritmos genéticos; AlgoritmoQ-learning; Problema do caixeiro viajante; GRASP metaheuristic; Genetic algorithm; Q-learning algorithm; Travelling salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lima Júnior, F. C. d. (2009). Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/15129

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

Lima Júnior, Francisco Chagas de. “Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético .” 2009. Thesis, Universidade do Rio Grande do Norte. Accessed April 03, 2020. http://repositorio.ufrn.br/handle/123456789/15129.

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

MLA Handbook (7th Edition):

Lima Júnior, Francisco Chagas de. “Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético .” 2009. Web. 03 Apr 2020.

Vancouver:

Lima Júnior FCd. Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2009. [cited 2020 Apr 03]. Available from: http://repositorio.ufrn.br/handle/123456789/15129.

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

Council of Science Editors:

Lima Júnior FCd. Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético . [Thesis]. Universidade do Rio Grande do Norte; 2009. Available from: http://repositorio.ufrn.br/handle/123456789/15129

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


Universidade do Rio Grande do Norte

21. Silva Neto, João Saturnino da. Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico .

Degree: 2009, Universidade do Rio Grande do Norte

 The present essay shows strategies of improvement in a well succeded evolutionary metaheuristic to solve the Asymmetric Traveling Salesman Problem. Such steps consist in a… (more)

Subjects/Keywords: Algoritmo Memético; Path-Relinking; Vocabulary Building; Problema do Caixeiro Viajante Assimétrico; Memetic Algoritm; Path-Relinking; Vocabulary Building; Asymmetric Travelling Salesman Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silva Neto, J. S. d. (2009). Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/17005

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

Chicago Manual of Style (16th Edition):

Silva Neto, João Saturnino da. “Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico .” 2009. Thesis, Universidade do Rio Grande do Norte. Accessed April 03, 2020. http://repositorio.ufrn.br/handle/123456789/17005.

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

MLA Handbook (7th Edition):

Silva Neto, João Saturnino da. “Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico .” 2009. Web. 03 Apr 2020.

Vancouver:

Silva Neto JSd. Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2009. [cited 2020 Apr 03]. Available from: http://repositorio.ufrn.br/handle/123456789/17005.

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

Council of Science Editors:

Silva Neto JSd. Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico . [Thesis]. Universidade do Rio Grande do Norte; 2009. Available from: http://repositorio.ufrn.br/handle/123456789/17005

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


Mississippi State University

22. Bullington, William. Modified ant colony algorithm for dynamic optimization: A case study with wildlife surveillance.

Degree: MS, Industrial and Systems Engineering, 2017, Mississippi State University

  A novel Ant Colony Optimization (ACO) framework for a dynamic environment has been proposed in this study. This algorithm was developed to solve Dynamic… (more)

Subjects/Keywords: drone routing; adaptive large neighborhood search; immigrant schemes; dynamic travelling salesman problem; Dynamic optimization; wildlife surveillance.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bullington, W. (2017). Modified ant colony algorithm for dynamic optimization: A case study with wildlife surveillance. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-03222017-161130/ ;

Chicago Manual of Style (16th Edition):

Bullington, William. “Modified ant colony algorithm for dynamic optimization: A case study with wildlife surveillance.” 2017. Masters Thesis, Mississippi State University. Accessed April 03, 2020. http://sun.library.msstate.edu/ETD-db/theses/available/etd-03222017-161130/ ;.

MLA Handbook (7th Edition):

Bullington, William. “Modified ant colony algorithm for dynamic optimization: A case study with wildlife surveillance.” 2017. Web. 03 Apr 2020.

Vancouver:

Bullington W. Modified ant colony algorithm for dynamic optimization: A case study with wildlife surveillance. [Internet] [Masters thesis]. Mississippi State University; 2017. [cited 2020 Apr 03]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03222017-161130/ ;.

Council of Science Editors:

Bullington W. Modified ant colony algorithm for dynamic optimization: A case study with wildlife surveillance. [Masters Thesis]. Mississippi State University; 2017. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03222017-161130/ ;


Brno University of Technology

23. Němec, Jan. Efektivita evolučních algoritmů .

Degree: 2016, Brno University of Technology

 Tato diplomová práce se zabývá evolučními algoritmy. Jejím úkolem je vybrat vhodný evoluční algoritmus, který bude rešit vhodný problém. V tomto případě se jedná o… (more)

Subjects/Keywords: Evoluční algoritmy; genetické algoritmy; problém obchodního cestujícího; optimalizace; JAVA; Evolutionary algoritms; genetic algoritms; travelling salesman problem; optimization; JAVA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Němec, J. (2016). Efektivita evolučních algoritmů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/59821

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

Němec, Jan. “Efektivita evolučních algoritmů .” 2016. Thesis, Brno University of Technology. Accessed April 03, 2020. http://hdl.handle.net/11012/59821.

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

MLA Handbook (7th Edition):

Němec, Jan. “Efektivita evolučních algoritmů .” 2016. Web. 03 Apr 2020.

Vancouver:

Němec J. Efektivita evolučních algoritmů . [Internet] [Thesis]. Brno University of Technology; 2016. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/11012/59821.

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

Council of Science Editors:

Němec J. Efektivita evolučních algoritmů . [Thesis]. Brno University of Technology; 2016. Available from: http://hdl.handle.net/11012/59821

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

24. Gaglani, Mansi Suryakant. A study on transportation problem, transshipment problem, assignment problem and supply chain management;  – .

Degree: Commerce, 2012, Saurashtra University

None

References p.117-122

Advisors/Committee Members: Ghosh, D K.

Subjects/Keywords: Travelling Salesman Problem; Statistics; Supply Chain Management; Transshipment Problem; commerce

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gaglani, M. S. (2012). A study on transportation problem, transshipment problem, assignment problem and supply chain management;  – . (Thesis). Saurashtra University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/3970

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

Gaglani, Mansi Suryakant. “A study on transportation problem, transshipment problem, assignment problem and supply chain management;  – .” 2012. Thesis, Saurashtra University. Accessed April 03, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/3970.

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

MLA Handbook (7th Edition):

Gaglani, Mansi Suryakant. “A study on transportation problem, transshipment problem, assignment problem and supply chain management;  – .” 2012. Web. 03 Apr 2020.

Vancouver:

Gaglani MS. A study on transportation problem, transshipment problem, assignment problem and supply chain management;  – . [Internet] [Thesis]. Saurashtra University; 2012. [cited 2020 Apr 03]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/3970.

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

Council of Science Editors:

Gaglani MS. A study on transportation problem, transshipment problem, assignment problem and supply chain management;  – . [Thesis]. Saurashtra University; 2012. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/3970

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


University of Melbourne

25. Duane, Emily Jane Eleftheria. New data generation and solution techniques for the Sequential Ordering Problem with Time Windows.

Degree: 2014, University of Melbourne

 The motivation for this thesis resulted from a study of semi-automated rail mounted gantry cranes at an Australian seaport container terminal. The Sequential Ordering Problem(more)

Subjects/Keywords: Sequential Ordering Problem with Time Windows; SOP-TW; Asymmetric Travelling Salesman Problem with Time Windows and additional Precedence Constraints; ATSP-TW-PC; crane scheduling; machine scheduling; heuristics; branch-and-bound

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duane, E. J. E. (2014). New data generation and solution techniques for the Sequential Ordering Problem with Time Windows. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/54610

Chicago Manual of Style (16th Edition):

Duane, Emily Jane Eleftheria. “New data generation and solution techniques for the Sequential Ordering Problem with Time Windows.” 2014. Doctoral Dissertation, University of Melbourne. Accessed April 03, 2020. http://hdl.handle.net/11343/54610.

MLA Handbook (7th Edition):

Duane, Emily Jane Eleftheria. “New data generation and solution techniques for the Sequential Ordering Problem with Time Windows.” 2014. Web. 03 Apr 2020.

Vancouver:

Duane EJE. New data generation and solution techniques for the Sequential Ordering Problem with Time Windows. [Internet] [Doctoral dissertation]. University of Melbourne; 2014. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/11343/54610.

Council of Science Editors:

Duane EJE. New data generation and solution techniques for the Sequential Ordering Problem with Time Windows. [Doctoral Dissertation]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/54610

26. Fábio Francisco da Costa Fontes. Algoritmo memético com infecção viral: uma aplicação ao problema do caixeiro viajante assimétrico.

Degree: 2006, Universidade Federal do Rio Grande do Norte

A Otimização Combinatória é uma área fundamental para empresas que buscam vantagens competitivas nos diversos setores produtivos, e o Problema do Caixeiro Viajante Assimétrico, o… (more)

Subjects/Keywords: Otimização combinatória; Problema do caixeiro viajante assimétrico; Algoritmo memético; Infecção viral; ENGENHARIA DE PRODUCAO; Combinatorial optimization; Assimetric travelling salesman problem; Memetic algorithms; Viral infection.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fontes, F. F. d. C. (2006). Algoritmo memético com infecção viral: uma aplicação ao problema do caixeiro viajante assimétrico. (Thesis). Universidade Federal do Rio Grande do Norte. Retrieved from http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=983

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

Fontes, Fábio Francisco da Costa. “Algoritmo memético com infecção viral: uma aplicação ao problema do caixeiro viajante assimétrico.” 2006. Thesis, Universidade Federal do Rio Grande do Norte. Accessed April 03, 2020. http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=983.

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

MLA Handbook (7th Edition):

Fontes, Fábio Francisco da Costa. “Algoritmo memético com infecção viral: uma aplicação ao problema do caixeiro viajante assimétrico.” 2006. Web. 03 Apr 2020.

Vancouver:

Fontes FFdC. Algoritmo memético com infecção viral: uma aplicação ao problema do caixeiro viajante assimétrico. [Internet] [Thesis]. Universidade Federal do Rio Grande do Norte; 2006. [cited 2020 Apr 03]. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=983.

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

Council of Science Editors:

Fontes FFdC. Algoritmo memético com infecção viral: uma aplicação ao problema do caixeiro viajante assimétrico. [Thesis]. Universidade Federal do Rio Grande do Norte; 2006. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=983

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

27. João Saturnino da Silva Neto. Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico.

Degree: 2009, Universidade Federal do Rio Grande do Norte

The present essay shows strategies of improvement in a well succeded evolutionary metaheuristic to solve the Asymmetric Traveling Salesman Problem. Such steps consist in a… (more)

Subjects/Keywords: Algoritmo Memético; Path-Relinking; Vocabulary Building; Problema do Caixeiro Viajante Assimétrico; MATEMATICA APLICADA; Memetic Algoritm; Path-Relinking; Vocabulary Building; Asymmetric Travelling Salesman Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Neto, J. S. d. S. (2009). Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico. (Thesis). Universidade Federal do Rio Grande do Norte. Retrieved from http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2865

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

Neto, João Saturnino da Silva. “Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico.” 2009. Thesis, Universidade Federal do Rio Grande do Norte. Accessed April 03, 2020. http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2865.

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

MLA Handbook (7th Edition):

Neto, João Saturnino da Silva. “Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico.” 2009. Web. 03 Apr 2020.

Vancouver:

Neto JSdS. Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico. [Internet] [Thesis]. Universidade Federal do Rio Grande do Norte; 2009. [cited 2020 Apr 03]. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2865.

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

Council of Science Editors:

Neto JSdS. Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico. [Thesis]. Universidade Federal do Rio Grande do Norte; 2009. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2865

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

28. Baltazar, Sérgio Manuel Correia. A study on the deployment of GA in a grid computing framework.

Degree: 2015, RCAAP

Dissertação de Mestrado, Engenharia Informática, Faculdade de Ciências e Tecnologia, Universidade do Algarve, 2015

Os algoritmos genéticos (AG) desempenham um papel importante na resolução de… (more)

Subjects/Keywords: Genetic algorithms; Island model; Asynchronous genetic algorithm; Grid computing; Globus toolkit; Travelling salesman problem; Domínio/Área Científica::Engenharia e Tecnologia::Outras Engenharias e Tecnologias

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baltazar, S. M. C. (2015). A study on the deployment of GA in a grid computing framework. (Thesis). RCAAP. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/8385

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

Baltazar, Sérgio Manuel Correia. “A study on the deployment of GA in a grid computing framework.” 2015. Thesis, RCAAP. Accessed April 03, 2020. http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/8385.

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

MLA Handbook (7th Edition):

Baltazar, Sérgio Manuel Correia. “A study on the deployment of GA in a grid computing framework.” 2015. Web. 03 Apr 2020.

Vancouver:

Baltazar SMC. A study on the deployment of GA in a grid computing framework. [Internet] [Thesis]. RCAAP; 2015. [cited 2020 Apr 03]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/8385.

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

Council of Science Editors:

Baltazar SMC. A study on the deployment of GA in a grid computing framework. [Thesis]. RCAAP; 2015. Available from: http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/8385

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


Queensland University of Technology

29. Kok, Jonathan. Design methodologies and architectures of hardware-based evolutionary algorithms for aerospace optimisation applications on FPGAS.

Degree: 2014, Queensland University of Technology

 This thesis is a study of new design methods for allowing evolutionary algorithms to be more effectively utilised in aerospace optimisation applications where computation needs… (more)

Subjects/Keywords: Evolutionary algorithm; Evolutionary computation; Field programmable gate array; Genetic algorithm; Heuristics; Multi-objective evolutionary algorithm; Multi-objective optimisation; Path planning; Travelling salesman problem; Unmanned aerial vehicle

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kok, J. (2014). Design methodologies and architectures of hardware-based evolutionary algorithms for aerospace optimisation applications on FPGAS. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/72904/

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

Kok, Jonathan. “Design methodologies and architectures of hardware-based evolutionary algorithms for aerospace optimisation applications on FPGAS.” 2014. Thesis, Queensland University of Technology. Accessed April 03, 2020. https://eprints.qut.edu.au/72904/.

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

MLA Handbook (7th Edition):

Kok, Jonathan. “Design methodologies and architectures of hardware-based evolutionary algorithms for aerospace optimisation applications on FPGAS.” 2014. Web. 03 Apr 2020.

Vancouver:

Kok J. Design methodologies and architectures of hardware-based evolutionary algorithms for aerospace optimisation applications on FPGAS. [Internet] [Thesis]. Queensland University of Technology; 2014. [cited 2020 Apr 03]. Available from: https://eprints.qut.edu.au/72904/.

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

Council of Science Editors:

Kok J. Design methodologies and architectures of hardware-based evolutionary algorithms for aerospace optimisation applications on FPGAS. [Thesis]. Queensland University of Technology; 2014. Available from: https://eprints.qut.edu.au/72904/

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


Brno University of Technology

30. González, Marek. Řešení optimalizačních úloh algoritmy PSO .

Degree: 2012, Brno University of Technology

 Práce se zabývá popisem algoritmu particle swarm optimization (PSO) a demonstrací jeho činnosti na vybraných optimalizačních úlohách. PSO byl převážně navržen pro spojitou optimalizaci a… (more)

Subjects/Keywords: Optimalizace rojem částic; PSO; hromadná inteligence; optimalizace; shlukování; problém obchodního cestujícího; minimalizace funkcí.; Particle swarm optimization; PSO; swarm intelligence; optimization; clustering; travelling salesman problem; function minimization.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

González, M. (2012). Řešení optimalizačních úloh algoritmy PSO . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55096

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

González, Marek. “Řešení optimalizačních úloh algoritmy PSO .” 2012. Thesis, Brno University of Technology. Accessed April 03, 2020. http://hdl.handle.net/11012/55096.

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

MLA Handbook (7th Edition):

González, Marek. “Řešení optimalizačních úloh algoritmy PSO .” 2012. Web. 03 Apr 2020.

Vancouver:

González M. Řešení optimalizačních úloh algoritmy PSO . [Internet] [Thesis]. Brno University of Technology; 2012. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/11012/55096.

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

Council of Science Editors:

González M. Řešení optimalizačních úloh algoritmy PSO . [Thesis]. Brno University of Technology; 2012. Available from: http://hdl.handle.net/11012/55096

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

[1] [2]

.