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 +publisher:"North Carolina State University" +contributor:("Dr. Henry Nuttle, Committee Member"). Showing records 1 – 2 of 2 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


North Carolina State University

1. Berrings Davis, Lauren Marie. State Clustering in Markov Decisions Processes with an Application in Information Sharing.

Degree: PhD, Industrial Engineering, 2005, North Carolina State University

This research examines state clustering in Markov Decision processes, specifically addressing the problem referred to as Markov Decision process with restricted observations. The general problem is a special case of a Partially Observable Markov Decision process where the state space is partitioned into mutually exclusive sets representing the observable portion of the process. The goal is to find an optimal policy defined over the partition of the state space that minimizes (maximizes) some performance objective. Algorithms presented to solve this problem for the infinite horizon undiscounted average cost case have largely been based on enumerative procedures. A heuristic solution procedure based on Howard's (1960) policy iteration method is presented. Applications of Markov decision processes with restricted observations exist in networks of queues, retrial queues, maintenance problems and queuing networks with server control. A new application area is proposed in the field of information sharing to measure the value of information sharing in a supply chain under optimal control. This is achieved by representing a model of full information sharing as a completely observable Markov Decision process (MDP), while no information sharing is represented as an MDP with restricted observations. Solution procedures are presented for the general Markov Decision process with restricted observations. Heuristic solutions are evaluated against the optimal solution obtained via total enumeration. Both random Markov Decision processes and information sharing problems are studied. The value of sharing information in a two-stage supply chain system is studied. The influence of capacity, demand, cost and retailer policy on the value of information sharing is considered. Insight on the structure of the optimal policy with and without information sharing is provided. Advisors/Committee Members: Dr. Donald Bitzer, Committee Member (advisor), Dr. Henry Nuttle, Committee Member (advisor), Dr. Russell King, Committee Co-Chair (advisor), Dr. Thom Hodgson, Committee Co-Chair (advisor).

Subjects/Keywords: Markov Decision Process with Restricted Observati; Information Sharing; Markov Decision Process

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Berrings Davis, L. M. (2005). State Clustering in Markov Decisions Processes with an Application in Information Sharing. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/5880

Chicago Manual of Style (16th Edition):

Berrings Davis, Lauren Marie. “State Clustering in Markov Decisions Processes with an Application in Information Sharing.” 2005. Doctoral Dissertation, North Carolina State University. Accessed October 20, 2020. http://www.lib.ncsu.edu/resolver/1840.16/5880.

MLA Handbook (7th Edition):

Berrings Davis, Lauren Marie. “State Clustering in Markov Decisions Processes with an Application in Information Sharing.” 2005. Web. 20 Oct 2020.

Vancouver:

Berrings Davis LM. State Clustering in Markov Decisions Processes with an Application in Information Sharing. [Internet] [Doctoral dissertation]. North Carolina State University; 2005. [cited 2020 Oct 20]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5880.

Council of Science Editors:

Berrings Davis LM. State Clustering in Markov Decisions Processes with an Application in Information Sharing. [Doctoral Dissertation]. North Carolina State University; 2005. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5880


North Carolina State University

2. Lea, Djuana. Soft Computing Approaches to Routing and Wavelength Assignment in Wavelength-Routed Optical Networks.

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

The routing and wavelength assignment (RWA) problem is essential for achieving efficient performance in wavelength-routed optical networks. For a network without wavelength conversion capabilities, the RWA problem consists of selecting an appropriate path and wavelength for each connection request while ensuring that paths that share common links are not assigned the same wavelength. The purpose of this research is to develop efficient adaptive methods for routing and wavelength assignment in wavelength-routed optical networks with dynamic traffic. The proposed methods utilize soft computing techniques including genetic algorithms, fuzzy control theory, simulated annealing, and tabu search. All four algorithms consider the current availability of network resources before making a routing decision. Simulations for each algorithm show that each method outperforms fixed and alternate routing strategies. The fuzzy-controlled algorithm achieved the lowest blocking rates and the shortest running times in most cases. Advisors/Committee Members: Dr. Henry Nuttle, Committee Member (advisor), Dr. Elmor Peterson, Committee Member (advisor), Dr. Salah Elmaghraby, Committee Member (advisor), Dr. Shu-Cherng Fang, Committee Chair (advisor).

Subjects/Keywords: wavelength division multiplexing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lea, D. (2005). Soft Computing Approaches to Routing and Wavelength Assignment in Wavelength-Routed Optical Networks. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/5955

Chicago Manual of Style (16th Edition):

Lea, Djuana. “Soft Computing Approaches to Routing and Wavelength Assignment in Wavelength-Routed Optical Networks.” 2005. Doctoral Dissertation, North Carolina State University. Accessed October 20, 2020. http://www.lib.ncsu.edu/resolver/1840.16/5955.

MLA Handbook (7th Edition):

Lea, Djuana. “Soft Computing Approaches to Routing and Wavelength Assignment in Wavelength-Routed Optical Networks.” 2005. Web. 20 Oct 2020.

Vancouver:

Lea D. Soft Computing Approaches to Routing and Wavelength Assignment in Wavelength-Routed Optical Networks. [Internet] [Doctoral dissertation]. North Carolina State University; 2005. [cited 2020 Oct 20]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5955.

Council of Science Editors:

Lea D. Soft Computing Approaches to Routing and Wavelength Assignment in Wavelength-Routed Optical Networks. [Doctoral Dissertation]. North Carolina State University; 2005. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5955

.