Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Bi-directional tests (1)
- Change point identification (1)
- Convergence analysis (1)
- Delivery optimization (1)
- Empirical recurrence rates and ratios (1)
-
- Escape-local-minima strategy (1)
- Evolutionary algorithm (1)
- Hub airport, logistics competition, Porter’s diamond model, time series model (1)
- Logistical tender (1)
- Military logistics (1)
- Operations research (1)
- Optimization (1)
- Particle swarm (1)
- Point processes (1)
- Repairable systems (1)
- Self-adaptive (1)
- Step intensities (1)
- Stochastic programming (1)
- Vehicle routing problem (1)
Articles 1 - 5 of 5
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Analysis Of Shanghai Aviation Hub Logistics Competitiveness, Tuo Chen
Analysis Of Shanghai Aviation Hub Logistics Competitiveness, Tuo Chen
World Maritime University Dissertations
No abstract provided.
Developing Optimization Techniques For Logistical Tendering Using Reverse Combinatorial Auctions, Jennifer Kiser
Developing Optimization Techniques For Logistical Tendering Using Reverse Combinatorial Auctions, Jennifer Kiser
Electronic Theses and Dissertations
In business-to-business logistical sourcing events, companies regularly use a bidding process known as tendering in the procurement of transportation services from third-party providers. Usually in the form of an auction involving a single buyer and one or more sellers, the buyer must make decisions regarding with which suppliers to partner and how to distribute the transportation lanes and volume among its suppliers; this is equivalent to solving the optimization problem commonly referred to as the Winner Determination Problem. In order to take into account the complexities inherent to the procurement problem, such as considering a supplier’s network, economies of scope, …
Bi-Directional Testing For Change Point Detection In Poisson Processes, Moinak Bhaduri
Bi-Directional Testing For Change Point Detection In Poisson Processes, Moinak Bhaduri
UNLV Theses, Dissertations, Professional Papers, and Capstones
Point processes often serve as a natural language to chronicle an event's temporal evolution, and significant changes in the flow, synonymous with non-stationarity, are usually triggered by assignable and frequently preventable causes, often heralding devastating ramifications. Examples include amplified restlessness of a volcano, increased frequencies of airplane crashes, hurricanes, mining mishaps, among others. Guessing these time points of changes, therefore, merits utmost care. Switching the way time traditionally propagates, we posit a new genre of bidirectional tests which, despite a frugal construct, prove to be exceedingly efficient in culling out non-stationarity under a wide spectrum of environments. A journey surveying …
Multi Self-Adapting Particle Swarm Optimization Algorithm (Msapso)., Gerhard Koch
Multi Self-Adapting Particle Swarm Optimization Algorithm (Msapso)., Gerhard Koch
Electronic Theses and Dissertations
The performance and stability of the Particle Swarm Optimization algorithm depends on parameters that are typically tuned manually or adapted based on knowledge from empirical parameter studies. Such parameter selection is ineffectual when faced with a broad range of problem types, which often hinders the adoption of PSO to real world problems. This dissertation develops a dynamic self-optimization approach for the respective parameters (inertia weight, social and cognition). The effects of self-adaption for the optimal balance between superior performance (convergence) and the robustness (divergence) of the algorithm with regard to both simple and complex benchmark functions is investigated. This work …
Optimal Supply Delivery Under Military Specific Constraints, Talena Fletcher
Optimal Supply Delivery Under Military Specific Constraints, Talena Fletcher
Electronic Theses and Dissertations
Through-out military history, the need to safely and effectively allocate resources to various military operations was a task of extreme importance. Satisfying the needs of multiple consumers by optimally pairing with appropriate suppliers falls into the category of vehicle routing problems (VRP), which has been intensively studied over the years. In general, finding the optimal solution to VRP is known to be NP-hard. The proposed solutions rely on mathematical programming and the size of the problems that can be optimally solved is typically limited. In military settings, balancing the needs of multiple consumers with the current operational environment has always …