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
-
- Simulated Annealing (2)
- Agent-based Modeling (ABM) (1)
- Capacitated Team Orienteering Problem (1)
- Channel Theory (1)
- Complex Environment (1)
-
- Cyclic Inventory Routing problem (1)
- Flexible Flowshop (1)
- Information Flow (1)
- Iterated Local Search (1)
- Multiple vehicles (1)
- Orienteering Problem (1)
- Pharmaceutical Manufacturing (1)
- Relationships of Interest (1)
- Scheduling (1)
- Science Technology Engineering & Mathematics (STEM) education modeling (1)
- Simulation (1)
- Smart Manufacturing (1)
- Steepest Descent Method (1)
- Publication
- Publication Type
Articles 1 - 6 of 6
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Adaptive Randomized Rounding In The Big Parsimony Problem, Sangho Shim, Sunil Chopra, Eunseok Kim
Adaptive Randomized Rounding In The Big Parsimony Problem, Sangho Shim, Sunil Chopra, Eunseok Kim
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Identifying Relationships Of Interest In Complex Environments By Using Channel Theory, Andreas Bildstein, Junkang Feng
Identifying Relationships Of Interest In Complex Environments By Using Channel Theory, Andreas Bildstein, Junkang Feng
Communications of the IIMA
Complex environments show a high degree of dynamics caused by vital interactions between objects within those environments and alterations through which the set of objects and their characteristics within those environments go over time. Within this work, we show that we can tame the level of complexity in dynamic environments by identifying ‘relationships of interest’ between objects in such environments. To this end, we apply the theory of Information Flow, also known as Channel Theory, to the application area of smart manufacturing. We enhance the way how the Channel Theory has been applied so far by using an …
Simulated Annealing For The Multi-Vehicle Cyclic Inventory Routing Problem, Aldy Gunawan, Vincent F. Yu, Audrey Tedja Widjaja, Pieter Vansteenwegen
Simulated Annealing For The Multi-Vehicle Cyclic Inventory Routing Problem, Aldy Gunawan, Vincent F. Yu, Audrey Tedja Widjaja, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
This paper studies the Multi-Vehicle Cyclic Inventory Routing Problem (MV-CIRP) as the extension of the Single-Vehicle CIRP (SV-CIRP). The objective is to minimize both distribution and inventory costs at the customers and to maximize the collected rewards simultaneously. The problem is treated as a single objective optimization problem. A subset of customers is selected for each vehicle including the quantity to be delivered to each customer. For each vehicle, a cyclic distribution plan is developed. We construct a mathematical programming model and propose a simulated annealing (SA) metaheuristic for solving both SV-CIRP and MV-CIRP. For SV-CIRP, experimental results on benchmark …
The Capacitated Team Orienteering Problem, Aldy Gunawan, Kien Ming Ng, Vincent F. Yu, Gordy Adiprasetyo, Hoong Chuin Lau
The Capacitated Team Orienteering Problem, Aldy Gunawan, Kien Ming Ng, Vincent F. Yu, Gordy Adiprasetyo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper focuses on a recent variant of the Orienteering Problem (OP), namely the Capacitated Team OP (CTOP) which arises in the logistics industry. In this problem, each node is associated with a demand that needs to be satisfied and a score that need to be collected. Given a set of homogeneous fleet of vehicles, the objective is to find a path for each vehicle in order to maximize the total collected score, without violating the capacity and time budget. We propose an Iterated Local Search (ILS) algorithm for solving the CTOP. Two strategies, either accepting a new solution as …
Pharmaceutical Scheduling Using Simulated Annealing And Steepest Descent Method, Bryant Jamison Spencer
Pharmaceutical Scheduling Using Simulated Annealing And Steepest Descent Method, Bryant Jamison Spencer
Graduate Theses, Dissertations, and Problem Reports
In the pharmaceutical manufacturing world, a deadline could be the difference between losing a multimillion-dollar contract or extending it. This, among many other reasons, is why good scheduling methods are vital. This problem report addresses Flexible Flowshop (FF) scheduling using Simulated Annealing (SA) in conjunction with the Steepest Descent heuristic (SD).
FF is a generalized version of the flowshop problem, where each product goes through S number of stages, where each stage has M number of machines. As opposed to a normal flowshop problem, all ‘jobs’ do not have to flow in the same sequence from stage to stage. The …
Agent-Based Modeling And Simulation Approaches In Stem Education Research, Shanna R. Simpson-Singleton, Xiangdong Che
Agent-Based Modeling And Simulation Approaches In Stem Education Research, Shanna R. Simpson-Singleton, Xiangdong Che
Journal of International Technology and Information Management
The development of best practices that deliver quality STEM education to all students, while minimizing achievement gaps, have been solicited by several national agencies. ABMS is a feasible approach to provide insight into global behavior based upon the interactions amongst agents and environments. In this review, we systematically surveyed several modeling and simulation approaches and discussed their applications to the evaluation of relevant theories in STEM education. It was found that ABMS is optimal to simulate STEM education hypotheses, as ABMS will sensibly present emergent theories and causation in STEM education phenomena if the model is properly validated and calibrated.