Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Abmscore: A Heuristic Algorithm For Forming Strategic Coalitions In Agent-Based Simulation, Andrew J. Collins, Gayane Grigoryan
Abmscore: A Heuristic Algorithm For Forming Strategic Coalitions In Agent-Based Simulation, Andrew J. Collins, Gayane Grigoryan
Engineering Management & Systems Engineering Faculty Publications
Integrating human behavior into agent-based models has been challenging due to its diversity. An example is strategic coalition formation, which occurs when an individual decides to collaborate with others because it strategically benefits them, thereby increasing the expected utility of the situation. An algorithm called ABMSCORE was developed to help model strategic coalition formation in agent-based models. The ABMSCORE algorithm employs hedonic games from cooperative game theory and has been applied to various situations, including refugee egress and smallholder farming cooperatives. This paper discusses ABMSCORE, including its mechanism, requirements, limitations, and application. To demonstrate the potential of ABMSCORE, a new …
Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau
Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we discuss the problem of route planning and scheduling by a group of agents. Each agent is responsible for designing a route plan and schedule over a geographical network, and the goal is to obtain a conflict-free plan/schedule that optimizes a global objective. We present a hybrid conflict resolution method that involves coalition formation and distributed constraint satisfaction depending on the level of coupling between agents. We show how this approach can be effectively applied to solve a distributed convoy movement planning problem.