Engineering Commons^™

Resource Allocation And Task Scheduling Optimization In Cloud-Based Content Delivery Networks With Edge Computing, Yang Peng

Operations Research and Engineering Management Theses and Dissertations

The extensive growth in adoption of mobile devices pushes global Internet protocol (IP) traffic to grow and content delivery network (CDN) will carry 72 percent of total Internet traffic by 2022, up from 56 percent in 2017. In this praxis, Interconnected Cache Edge (ICE) based on different public cloud infrastructures with multiple edge computing sites is considered to help CDN service providers (SPs) to maximize their operational profit. The problem of resource allocation and performance optimization is studied in order to maximize the cache hit ratio with available CDN capacity.

The considered problem is formulated as a multi-stage stochastic linear …

Generalized Relay Network Design And Collaborative Dispatching In Truckload Transportation, Amin Ziaeifar

Operations Research and Engineering Management Theses and Dissertations

The truckload industry faces a serious problem of high driver shortage and turnover rate which is typically around 100\%. Among the major causes of this problem are extended on-the-road times where drivers handle several truckload pickup and deliveries successively; non-regular schedules and get-home rates; and low utilization of drivers dedicated time. These are by-and-large consequences of the driver-to-load dispatching method, which is based on point-to-point dispatching or direct shipment from origin-to-destination, commonly employed in the industry. In this dissertation, we consider an alternative dispatching method that necessitates careful design of an underlying network. In this scheme, a truckload on its …

Extreme-Point Tabu Search Heuristics For Fixed-Charge Generalized Network Problems, Angelika Leskovskaya

Operations Research and Engineering Management Theses and Dissertations

While researchers have studied generalized network flow problems extensively, the powerful addition of fixed charges on arcs has received scant attention. This work describes network-simplex-based algorithms that efficiently exploit the quasi-tree basis structure of the problem relaxations, proposes heuristics that utilize a candidate list, a tabu search with short and intermediate term memories to do the local search, a diversification approach to solve fixed-charge transportation problems, as well as a dynamic linearization of objective function extension for the transshipment fixed-charge generalized problems. Computational testings for both heuristics demonstrate their effectiveness in terms of speed and quality of solutions to these …