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:"Georgia Tech" +contributor:("Al-Khayyal, Faiz"). Showing records 1 – 2 of 2 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Georgia Tech

1. Daniel, Aang. Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks.

Degree: PhD, Industrial and Systems Engineering, 2006, Georgia Tech

This thesis introduces a new model formulation to solve routing and scheduling problems, with the main applications in answering routing and scheduling problems faced by a sea-cargo shipping company and a railroad company. For the work in sea-cargo routing and scheduling, we focus on the tramp shipping operation. Tramp shipping is a demand-driven type of shipping operation which does not have fixed schedules. The schedules are based on the pickup and download locations of profitable service requests. Given set of products distributed among a set of ports, with each product having pickup and download time windows and a destination port, the problem is to find the schedule for a fleet of ships that maximizes profit over a specified time horizon. The problem is modeled as a Mixed Integer Non-Linear Program and reformulated as an equivalent Mixed Integer Linear Program. Three heuristic methods, along with computational results, are presented. We also exploit the special structure enjoyed by our model and introduce an upper-bounding problem to the model. With a little modification, the model is readily extendable to reflect soft time windows and inter-ship cargo-transfers. The other part of our work deals with train routing and scheduling. A typical train shipment consists of a set of cars having a common origin and destination. To reduce the handling of individual shipments as they travel, shipments are grouped into blocks. The problem is that given sets of blocks to be carried from origins to destinations, construct the most cost effective train routes and schedules and determine block-to-train assignments, such that the number of block transfers (block swaps) between trains, the number of trains used, and some other cost measures are minimized. Incorporating additional precedence requirements, the modeling techniques from the shipping research are employed to formulate a mixed integer nonlinear program for this train routing and scheduling problem. Computational results are presented. Advisors/Committee Members: Al-Khayyal, Faiz (Committee Chair), Barnes, Earl (Committee Member), Johnson, Ellis (Committee Member), Karimi, IA (Committee Member), Sokol, Joel (Committee Member).

Subjects/Keywords: Scheduling; Optimal schedule; Cargo transfer model; Routing and scheduling with time windows; Bilinear constraints; Vehicle routing; Pickup and delivery problem; Train routing and scheduling; Sea cargo routing and scheduling; Sea cargo routing; VRP; Train scheduling; Soft time windows; Set packing; Optimal train schedule; Cargo ships; Optimum ship routing; Scheduling; Mathematical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Daniel, A. (2006). Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/19698

Chicago Manual of Style (16th Edition):

Daniel, Aang. “Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks.” 2006. Doctoral Dissertation, Georgia Tech. Accessed December 14, 2019. http://hdl.handle.net/1853/19698.

MLA Handbook (7th Edition):

Daniel, Aang. “Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks.” 2006. Web. 14 Dec 2019.

Vancouver:

Daniel A. Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1853/19698.

Council of Science Editors:

Daniel A. Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks. [Doctoral Dissertation]. Georgia Tech; 2006. Available from: http://hdl.handle.net/1853/19698


Georgia Tech

2. Cheon, Myun-Seok. Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming.

Degree: PhD, Industrial and Systems Engineering, 2005, Georgia Tech

Monotonic optimization consists of minimizing or maximizing a monotonic objective function over a set of constraints defined by monotonic functions. Many optimization problems in economics and engineering often have monotonicity while lacking other useful properties, such as convexity. This thesis is concerned with the development and application of global optimization algorithms for monotonic optimization problems. First, we propose enhancements to an existing outer-approximation algorithm | called the Polyblock Algorithm | for monotonic optimization problems. The enhancements are shown to significantly improve the computational performance of the algorithm while retaining the convergence properties. Next, we develop a generic branch-and-bound algorithm for monotonic optimization problems. A computational study is carried out for comparing the performance of the Polyblock Algorithm and variants of the proposed branch-and-bound scheme on a family of separable polynomial programming problems. Finally, we study an important class of monotonic optimization problems | probabilistically constrained linear programs. We develop a branch-and-bound algorithm that searches for a global solution to the problem. The basic algorithm is enhanced by domain reduction and cutting plane strategies to reduce the size of the partitions and hence tighten bounds. The proposed branch-reduce-cut algorithm exploits the monotonicity properties inherent in the problem, and requires the solution of only linear programming subproblems. We provide convergence proofs for the algorithm. Some illustrative numerical results involving problems with discrete distributions are presented. Advisors/Committee Members: Al-Khayyal, Faiz (Committee Chair), Ahmed, Shabbir (Committee Co-Chair), Barnes, Earl (Committee Member), Realff, Matthew (Committee Member), Shapiro, Alex (Committee Member).

Subjects/Keywords: Monotonic programs; Global optimization; Polyblock algorithm; Branch and bound algorithm; Polynomial programming; Stochastic programming; Probabilistically constrained linear program

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheon, M. (2005). Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/6938

Chicago Manual of Style (16th Edition):

Cheon, Myun-Seok. “Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming.” 2005. Doctoral Dissertation, Georgia Tech. Accessed December 14, 2019. http://hdl.handle.net/1853/6938.

MLA Handbook (7th Edition):

Cheon, Myun-Seok. “Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming.” 2005. Web. 14 Dec 2019.

Vancouver:

Cheon M. Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2005. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1853/6938.

Council of Science Editors:

Cheon M. Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming. [Doctoral Dissertation]. Georgia Tech; 2005. Available from: http://hdl.handle.net/1853/6938

.