Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Applied sciences (5)
- Adaptive sampling (1)
- Approximation algorithm (1)
- Bayesian network (1)
- Collaborative control theory (1)
-
- Complexity (1)
- Consumer service (1)
- Derivative-free (1)
- Distributed system (1)
- Dynamic speed scaling (1)
- Electricity cost (1)
- Fractional programming (1)
- Hawaii (1)
- Inference modeling (1)
- Manufacturing (1)
- Matching theory (1)
- Multi-depot (1)
- Numerical optimization (1)
- Peak power consumption (1)
- Polynomial time algorithm (1)
- Pure sciences (1)
- Scheduling (1)
- Simulated annealing (1)
- Simulation (1)
- Social sciences (1)
- Supply chain management (1)
- Systems Science (1)
- Time-of-use tariffs (1)
- Travel and tourism (1)
- Trust-region (1)
- Publication
Articles 1 - 6 of 6
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Adaptive Sampling Trust-Region Methods For Derivative-Based And Derivative-Free Simulation Optimization Problems, Sara Shashaani
Adaptive Sampling Trust-Region Methods For Derivative-Based And Derivative-Free Simulation Optimization Problems, Sara Shashaani
Open Access Dissertations
We consider unconstrained optimization problems where only “stochastic” estimates of the objective function are observable as replicates from a Monte Carlo simulation oracle. In the first study we assume that the function gradients are directly observable through the Monte Carlo simulation. We propose ASTRO, which is an adaptive sampling based trust-region optimization method where a stochastic local model is constructed, optimized, and updated iteratively. ASTRO is a derivative-based algorithm and provides almost sure convergence to a first-order critical point with good practical performance. In the second study the Monte Carlo simulation is assumed to provide no direct observations of the …
Parametric Approaches To Fractional Programs: Analytical And Empirical Study, Chong Hyun Park
Parametric Approaches To Fractional Programs: Analytical And Empirical Study, Chong Hyun Park
Open Access Dissertations
Fractional programming is used to model problems where the objective function is a ratio of functions. A parametric modeling approach provides effective technique for obtaining optimal solutions of these fractional programming problems. Although many heuristic algorithms have been proposed and assessed relative to each other, there are limited theoretical studies on the number of steps to obtain the solution. In this dissertation, I focus on the linear fractional combinatorial optimization problem, a special case of fractional programming where all functions in the objective function and constraints are linear and all variables are binary that model certain combinatorial structures. Two parametric …
Best Matching Processes In Distributed Systems, Mohsen Moghaddam
Best Matching Processes In Distributed Systems, Mohsen Moghaddam
Open Access Dissertations
The growing complexity and dynamic behavior of modern manufacturing and service industries along with competitive and globalized markets have gradually transformed traditional centralized systems into distributed networks of e- (electronic) Systems. Emerging examples include e-Factories, virtual enterprises, smart farms, automated warehouses, and intelligent transportation systems. These (and similar) distributed systems, regardless of context and application, have a property in common: They all involve certain types of interactions (collaborative, competitive, or both) among their distributed individuals—from clusters of passive sensors and machines to complex networks of computers, intelligent robots, humans, and enterprises. Having this common property, such systems may encounter common …
A Case Study Of Two-Echelon Multi-Depot Vehicle Routing Problem, Tianqi Yu
A Case Study Of Two-Echelon Multi-Depot Vehicle Routing Problem, Tianqi Yu
Open Access Theses
The Vehicle Routing Problem (VRP) is a classic combinatorial optimization problem and a topic still studied for practical applications. Current research focuses on single echelon distribution systems such as distribution centers serving customers. However, in typical distribution, goods flows among regional distribution centers, local warehouses and customers, defined as a two-echelon network. The two-echelon multiple depot VRP problem is documented and applied to two stages illustrated by a small scale computational example. In the first stage, the simulated annealing algorithm is employed to determine the routes between local warehouses and final customers. For the second stage, trial-and-error is applied to …
Application Of Bayesian Networks In Consumer Service Industry, Yuan Gao
Application Of Bayesian Networks In Consumer Service Industry, Yuan Gao
Open Access Theses
Gao, Yuan. M.S.I.E., Purdue University. December 2014. Application of Bayesian Networks in Consumer Service Industry. Major professor: Vincent G. Duffy The purpose of the present study is to explore the application of Bayesian networks in the consumer service industry to model causal relationships within complex risk factor structures using aggregate data. An analysis of the Hawaii tourism market was conducted to find out how visitor characteristics affect their behavior and experience as consumers during the trips, and influence the tourism market outcomes represented by measurable factors. Two hypotheses were proposed regarding the use of aggregate data and the influence of …
Algorithmic And Mathematical Programming Approaches To Scheduling Problems With Energy-Based Objectives, Kan Fang
Open Access Dissertations
This dissertation studies scheduling as a means to address the increasing concerns related to energy consumption and electricity cost in manufacturing enterprises. Two classes of problems are considered in this dissertation: (i) minimizing the makespan in a permutation flow shop with peak power consumption constraints (the PFSPP problem for short) and (ii) minimizing the total electricity cost on a single machine under time-of-use tariffs (the SMSEC problem for short). We incorporate the technology of dynamic speed scaling and the variable pricing of electricity into these scheduling problems to improve energy efficiency in manufacturing.The challenge in the PFSPP problem is to …