Artificial Intelligence and Robotics Commons^™

Robust Temporal Constraint Networks, Hoong Chuin Lau, Thomas Ou, Melvyn Sim

Research Collection School Of Computing and Information Systems

In this paper, we propose the Robust Temporal Constraint Network (RTCN) model for simple temporal constraint networks where activity durations are bounded by random variables. The problem is to determine whether such temporal network can be executed with failure probability less than a given 0 ≤ E ≤ 1 for each possible instantiation of the random variables, and if so. how one might find a feasible schedule with each given instantiation. The advantage of our model is that one can vary the value of ∊ to control the level of conservativeness of the solution. We present a computationally tractable and …

Two-Echelon Repairable Item Inventory System With Limited Repair Capacity Under Nonstationary Demands, Hoong Chuin Lau, Huawei Song

Research Collection School Of Computing and Information Systems

We study a repairable item inventory system under limited repair capacity and nonstationary Poisson demands, motivated by corrective maintenance of military equipment. Our goal is to minimize the cost of both spare and repair resource allocation. We propose an efficient analytical model that combines optimization modeling and queuing theory.

Corrective Maintenance Optimization In An Air Force, Hoong Chuin Lau, K. Y. Neo, W. C. Wan

Research Collection School Of Computing and Information Systems

Successful military mission planning and execution depend critically on equipment serviceability and resupply. Due to the stochastic nature of demands, the forecast of optimal spares and resources needed to guarantee the level of serviceability is a complex problem, especially in a multi-echelon setting. In this paper, we propose a decision-support concept and software tool known as Corrective Maintenance Optimizer (CMO) that helps to optimize system availability, through proper allocation of spare parts, both strategically and operationally.

Job Scheduling With Unfixed Availability Constraints, Hoong Chuin Lau, C. Zhang

Research Collection School Of Computing and Information Systems

Standard scheduling theory assumes that all machines are continuously available throughout the planning horizon. In many manufacturing and service management situations however, machines need to be maintained periodically to prevent malfunctions. During the maintenance period, a machine is not available for processing jobs. Hence, a more realistic scheduling model should take into account machine maintenance activities. In this paper, we study the problem of job scheduling with unfixed availability constraints on a single machine. We first propose a preliminary classification for the scheduling problem with unfixed availability constraints based on maintenance constraints, job characteristics and objective function. We divide our …

Logistics Network Design With Differentiated Delivery Lead Time: A Chemical Industry Case Study, Michelle Lee Fong Cheong, Rohit Bhatnagar, Stephen C. Graves

Research Collection School Of Computing and Information Systems

Most logistics network design models assume exogenous customer demand that is independent of the service time or level. This paper examines the benefits of segmenting demand according to lead-time sensitivity of customers. To capture lead-time sensitivity in the network design model, we use a facility grouping method to ensure that the different demand classes are satisfied on time. In addition, we perform a series of computational experiments to develop a set of managerial insights for the network design decision making process.

A Development Framework For Rapid Metaheuristics Hybridization, Hoong Chuin Lau, M. K. Lim, W. C. Wan, S. Halim

Research Collection School Of Computing and Information Systems

While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to specific problems. For this reason, a software tool for rapid prototyping of algorithms would save considerable resources. This work presents a generic software framework that reduces development time through abstract classes and software reuse, and more importantly, aids design with support of user-defined strategies and hybridization of meta-heuristics. Most interestingly, we propose a novel way of redefining hybridization with the use of the "request and response" metaphor, which form an abstract concept for hybridization. Different hybridization schemes can now be formed …

A Two-Level Framework For Coalition Formation Via Optimization And Agent Negotiation, Hoong Chuin Lau, Lei Zhang

Research Collection School Of Computing and Information Systems

We present a two-level coalition formation approach based on a centralized optimization model on the upper level, and a distributed agent-negotiation model on the lower level. This approach allows us to balance agent self-interests against a high joint utility. Experimental results show that the two-level coalition formation mechanism will increase not only the overall utility of the coalition, but also the individual utility of most participating agents. The results also suggest it is better for the agents to be partially cooperative rather than either fully cooperative or self-interested in our setting.

Taking Dcop To The Real World: Efficient Complete Solutions For Distributed Event Scheduling, Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Distributed Constraint Optimization (DCOP) is an elegant formalism relevant to many areas in multiagent systems, yet complete algorithms have not been pursued for real world applications due to perceived complexity. To capably capture a rich class of complex problem domains, we introduce the Distributed Multi-Event Scheduling (DiMES) framework and design congruent DCOP formulations with binary constraints which are proven to yield the optimal solution. To approach real-world efficiency requirements, we obtain immense speedups by improving communication structure and precomputing best case bounds. Heuristics for generating better communication structures and calculating bound in a distributed manner are provided and tested on …

Notes On Equilibria In Symmetric Games, Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman

Research Collection School Of Computing and Information Systems

In a symmetric game, every player is identical with respect to the game rules. We show that a symmetric 2strategy game must have a pure-strategy Nash equilibrium. We also discuss Nash’s original paper and its generalized notion of symmetry in games. As a special case of Nash’s theorem, any finite symmetric game has a symmetric Nash equilibrium. Furthermore, symmetric infinite games with compact, convex strategy spaces and continuous, quasiconcave utility functions have symmetric pure-strategy Nash equilibria. Finally, we discuss how to exploit symmetry for more efficient methods of finding Nash equilibria.

Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim

Research Collection School Of Computing and Information Systems

This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these properties, we propose a two-phase heuristics for solving the multi-dimensional problem. We also propose a novel time-based ant colony optimization algorithm. The quality of the solutions generated is verified through experiments, where we demonstrate that the computational time is superior compared with integer programming to achieve solutions that are within a small percentage of the upper bounds.

Task Allocation Via Multi-Agent Coalition Formation: Taxonomy, Algorithms And Complexity, Hoong Chuin Lau, L. Zhang

Research Collection School Of Computing and Information Systems

Coalition formation has become a key topic in multiagent research. In this paper, we propose a preliminary classification for the coalition formation problem based on three driving factors (demands, resources and profit objectives). We divide our analysis into 5 cases. For each case, we present algorithms and complexity results. We anticipate that with future research, this classification can be extended in similar fashion to the comprehensive classification for the job scheduling problem.

Multi-Agent Coalition Via Autonomous Price Negotiation In A Real-Time Web Environment, Hoong Chuin Lau, Wei Sian Lim

Research Collection School Of Computing and Information Systems

In e-marketplaces, customers specify job requests in real-time and agents form coalitions to service them. This paper proposes a protocol for self-interested agents to negotiate prices in forming successful coalitions. We propose and experiment with two negotiation schemes: one allows information sharing while the other does not.

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a welldesigned set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that is …

Integrating Local Search And Network Flow To Solve The Inventory Routing Problem, Hoong Chuin Lau, Q Liu, H. Ono

Research Collection School Of Computing and Information Systems

The inventory routing problem is one of important and practical problems in logistics. It involves the integration of inventory management and vehicle routing, both of which are known to be NP-hard. In this paper, we combine local search and network flows to solve the inventory management problem, by utilizing the minimum cost flow sub-solutions as a guiding measure for local search. We then integrate with a standard VRPTW solver to present experimental results for the overall inventory routing problem, based on instances extended from the Solomon benchmark problems.

A New Approach For Weighted Constraint Satisfaction, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We consider the Weighted Constraint Satisfaction Problem which is an important problem in Artificial Intelligence. Given a set of variables, their domains and a set of constraints between variables, our goal is to obtain an assignment of the variables to domain values such that the weighted sum of satisfied constraints is maximized. In this paper, we present a new approach based on randomized rounding of semidefinite programming relaxation. Besides having provable worst-case bounds for domain sizes 2 and 3, our algorithm is simple and efficient in practice, and produces better solutions than some other polynomial-time algorithms such as greedy and …

A Multi-Agent Framework For Supporting Intelligent Fourth-Party Logistics, Hoong Chuin Lau, G. Lo

Research Collection School Of Computing and Information Systems

A distributed intelligent agent-based framework that supports fourth-party logistics optimization under a web-based e-Commerce environment has been proposed in this paper. In the framework, customer job requests come through an e-Procurement service. These requests are consolidated and pushed to the e-Market Place service periodically. The e-Market Place then serves as a broker that allows intelligent agents to bid to serve these requests optimally in real-time by solving multiple instances of underlying logistics optimization problem. The resulting system was implemented based on the Java 2 Enterprise Edition (J2EE) platform using distributed system technology for communication between objects.

To Explore Agent Technology In E-Commerce Mighty House Agent, Thirumalai Phiyadharshini

Student Works (2000-2009)

Agent technology is becoming more popular among system designers who want their system to be more personalized, continuously running and semi-autonomous. These properties make agents useful for a wide variety of information and process management tasks. It should come as no surprise that these same qualities are particularly useful for the information-rich and process-rich environment of electronic commerce. As such agent technology in electronic commerce (e-commerce) would be essential to improve on-line shopping which is becoming more and more popular these days. It is in these roles that agent system designers have the challenge to accurately identify and the opportunity …

Intelligent Agent For Electronic Commerce Using Neural Network Approach \, Hui Sun Yap

Student Works (2000-2009)

This project is aims to developing a tool that able to collect relevant information from the World Wide Web and a tool that can be used to assists users in decision-making in the activities of e-commerce. It i been built by using the neural network of artificial intelligence approach. In more specific, the back propagation network was been used. This report contains seven chapters that uncovered the details of the project from the beginning through the end of the system evaluation and a conclusion chapter. These chapters and its contain are been arranged as the following: Chapter I - lntroduction, …

Intelligent Agent For Electronic Commerce, Siew Cheng Lai

Student Works (2000-2009)

The objective of this project is to develop a system that can assists a user to make decision in online transactions for residential houses. In order to achieve this objective, an intelligent agent will be built where it will help the user to find relevant information of the houses based on they requirement. Furthermore, a prediction tool will also be developed to predict the price of the required house on the market. Artificial neural network will be used here, where the LVQ network is used to build the system. The neural network will be implemented in the filtering module and …

Collaborative Model And Algorithms For Supporting Real-Time Distribution Logistics Systems, Hoong Chuin Lau, Qi Zhang Liu

Research Collection School Of Computing and Information Systems

We study a complex optimization problem that arises due to an emerging trend in distribution logistics. The problem involves the integration of an inventory management problem and the vehicle routing problem with time windows, both of which are known to be NP-hard. We describe a collaborative approach to solve this problem in real-time. The novelty of our approach lies in the tight algorithmic integration between two sub-problems, and suggests an elegant scheme to deal with other integrated optimization problems of the same nature. For first sub-problem, we will present two algorithms: a complete mathematical model integrating integer programming with constraint …

Intelligent Agent For E-Commerce Using Genetic Algorithm, Sun Sun Kok

Student Works (2000-2009)

This project report outlines the introduction, literature study and methodology, system analysis and design, system implementation, system testing and summary of the whole project. The major objective of this system is to develop an intelligent agent that can gather. analyze and categorize information from the Web on the printers that complying the parameters specified /identified by the web users, and to provide recommendations for online purchases for all types of printers. The recommended web sites are restricted to web pages that provide online purchase facilities and deliveries in Malaysia. The system is able to update the information from the database …

The Effectiveness Of Expert Support Technology For Decision Making: Individuals Versus Small Groups, Fiona Fui-Hoon Nah, Jiye Mao, Izak Benbasat

Research Collection School Of Computing and Information Systems

Expert support systems (ESSs) are increasingly used in organizations to support individuals and groups in decision making. Although ESSs have been shown to enhance the decision-making capabilities of individuals, their benefits in supporting group decision making are less clear. To the best of our knowledge, no empirical research has evaluated the effectiveness of the technology in the group setting or compared its usefulness for supporting individual versus group decision making. The results of this research show that ESSs benefit decision making of both individuals and groups and novices are able to gain more from ESSs than experts. The findings also …

Expert System For The Generation Of A Work Breakdown Structure, Bernard O'Callaghan

Theses

This thesis outlines research work carried out in the Mechanical & Manufacturing Department in Cork Regional Technical College, Ireland. With computers now having an increasingly dominant role in all areas of business, it was inevitable that computer-based project management packages would become more popular. To date however, these packages have concentrated on monitoring and controlling projects. The definition and brainstorming phases required to generate a project plan are still largely manual tasks. Planning a project initially involves generating a complete and organised list of all the tasks needing to be completed in order to achieve a project’s goal. This list …

Some Developments In Information Technology In The Irish Hotel And Catering Industry, Sean Connell, Elaine Sunderland, Ciaran Mcdonnell

Conference papers

This paper describes the current and potential future use of computers in the Hospitality Industry in Ireland. It briefly outlines two research projects which are being carried out in the Dublin College of Catering in the application of computers to the Industry.

Impacts Of Industrial Robotics: Potential Effects On Labor And Costs Within The Metalworking Industries, Steven M. Miller

Research Collection School Of Computing and Information Systems

According to leading expert opinion, industrial robots are among the most important innovations of recent decades. Yet there is very considerable uncertainty (and disagreement) as to the rate at which the use of robots will spread and what their effects on employment, costs, and market structure will be. As stressed in 1983 by Congress’s Office of Technology Assessment: “A central question for an analysis of the social and economic impacts of programmable automation is whether programmable automation is likely to spread especially rapidly among firms and industries, and why.” The author analyzes the job displacement effects of industrial robots, as …

Ua35/11 Wku Student Honors Research Bulletin, Wku University Honors Program

WKU Administration Documents

The Western Kentucky University Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers represent work done by students from throughout the university.

• Kesselring, Marcia. Attitudes Toward the Need for Computer Literacy
• Tuck, Janna & Karen Wiggins. Methylation and Confirmation of PGE
• Lewis, Gloria. John Donne's Attitude Toward Love
• Johnson, Linda. International Telecommunications Trade with Japan
• Sharpe, Greg. Precipitation Patterns in Bowling Green, Kentucky, 1980-1985
• Smith, Sandy. Religion and the Media: Alliance or War?
• Bell, Suzanne. Early Secret Involvement of the United States Military in Cambodia
• Scariot, Linda. Parental Divorce and Childhood Emotional Disturbances
• Daniel, Janice. …

Ua35/11 Student Honors Research Bulletin, Wku Honors Program

WKU Administration Documents

The WKU Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers are representative of work done by students from throughout the university.

• Whicker, Garth. Agriculture and the Development of Malaysia
• McGaha. Rape, Passion, Lechery, Usury, Incest, Murder and other Matters in The Ravenger's Tragedy
• Harrison, Robert. It was a Day of Very General Awakening . . : Reformation and Revival in Russellville, Kentucky
• King, Betty. An Affirmative Decision for James's Isabel Archer
• Sutton, Joyce. Sex Bias in Performance of Women
• Logsdon, Doug. Poe's Women
• Yoder, Nate. Emily Dickinson and Her Puritan Heritage
• Davis, Aleen. Jay …