Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 5 of 5

Full-Text Articles in Mathematics

Truckload Shipment Planning And Procurement, Neo Nguyen Dec 2014

Truckload Shipment Planning And Procurement, Neo Nguyen

Graduate Theses and Dissertations

This dissertation presents three issues encountered by a shipper in the context of truckload transportation. In all of the studies, we utilize optimization techniques to model and solve the problems. Each study is inspired from the real world and much of the data used in the experiments is real data or representative of real data.

The first topic is about the freight consolidation in truckload transportation. We integrate it with a purchase incentive program to increase truckload utilization and maximize profit. The second topic is about supporting decision making collaboration among departments of a manufacturer. It is a bi-objective optimization …


Indefinite Knapsack Separable Quadratic Programming: Methods And Applications, Jaehwan Jeong May 2014

Indefinite Knapsack Separable Quadratic Programming: Methods And Applications, Jaehwan Jeong

Doctoral Dissertations

Quadratic programming (QP) has received significant consideration due to an extensive list of applications. Although polynomial time algorithms for the convex case have been developed, the solution of large scale QPs is challenging due to the computer memory and speed limitations. Moreover, if the QP is nonconvex or includes integer variables, the problem is NP-hard. Therefore, no known algorithm can solve such QPs efficiently. Alternatively, row-aggregation and diagonalization techniques have been developed to solve QP by a sub-problem, knapsack separable QP (KSQP), which has a separable objective function and is constrained by a single knapsack linear constraint and box constraints. …


Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev Feb 2014

Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev

Dissertations, Theses, and Capstone Projects

In computer science and telecommunications, wireless sensor networks are an active research area. Each sensor in a wireless sensor network has some pre-defined or on demand tasks such as collecting or disseminating data. Network resources, such as broadcast channels, number of sensors, power, battery life, etc., are limited. Hence, a schedule is required to optimally allocate network resources so as to maximize some profit or minimize some cost. This thesis focuses on scheduling problems in the wireless sensor networks environment. In particular, we study three scheduling problems in the wireless sensor networks: broadcast scheduling, sensor scheduling for area monitoring, and …


Using Prior Knowledge And Learning From Experience In Estimation Of Distribution Algorithms, Mark Walter Hauschild Jan 2014

Using Prior Knowledge And Learning From Experience In Estimation Of Distribution Algorithms, Mark Walter Hauschild

Dissertations

Estimation of distribution algorithms (EDAs) are stochastic optimization techniques that explore the space of potential solutions by building and sampling explicit probabilistic models of promising candidate solutions. One of the primary advantages of EDAs over many other stochastic optimization techniques is that after each run they leave behind a sequence of probabilistic models describing useful decompositions of the problem. This sequence of models can be seen as a roadmap of how the EDA solves the problem. While this roadmap holds a great deal of information about the problem, until recently this information has largely been ignored. My thesis is that …


Performance Modeling And Optimization Techniques For Heterogeneous Computing, Supada Laosooksathit Jan 2014

Performance Modeling And Optimization Techniques For Heterogeneous Computing, Supada Laosooksathit

Doctoral Dissertations

Since Graphics Processing Units (CPUs) have increasingly gained popularity amoung non-graphic and computational applications, known as General-Purpose computation on GPU (GPGPU), CPUs have been deployed in many clusters, including the world's fastest supercomputer. However, to make the most efficiency from a GPU system, one should consider both performance and reliability of the system.

This dissertation makes four major contributions. First, the two-level checkpoint/restart protocol that aims to reduce the checkpoint and recovery costs with a latency hiding strategy in a system between a CPU (Central Processing Unit) and a GPU is proposed. The experimental results and analysis reveals some benefits, …