Agent-Based Goal Programming — Hybrid simulation-optimization with decentralized agents and multi-goal satisfaction
Also known as: ABGP, Agent-Based GP, ABM-GP, Agent-Driven Goal Programming
Agent-Based Goal Programming (ABGP) integrates agent-based simulation with goal programming optimization to model systems where multiple autonomous decision-makers pursue competing, prioritized goals. It enables researchers to study how decentralized, adaptive behavior at the agent level leads to system-level outcomes measured against predefined targets, capturing both emergence and multi-criteria satisfaction simultaneously.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use ABGP when a system involves multiple autonomous actors with heterogeneous behavioral rules and the analyst simultaneously needs to satisfy or optimize several competing targets — common in supply chain management, public policy, healthcare resource allocation, and environmental planning. It is appropriate when emergent collective behavior is central to the problem and a single monolithic optimization model would misrepresent agent autonomy. Avoid ABGP when the system is well-characterized by a single decision-maker, when computational resources are very limited (it requires many simulation runs), when goals can be reduced to a single objective without loss of validity, or when agent interactions are negligible and a pure mathematical programming model suffices.
Strengths & limitations
- Captures emergent system behavior arising from decentralized agent interactions that aggregate optimization models cannot represent.
- Handles multiple competing goals with explicit priority or weight structures, giving decision-makers transparency on trade-offs.
- Accommodates heterogeneous agents with different behavioral rules, information sets, and adaptive learning without requiring a unified utility function.
- Allows what-if policy analysis: changing agent rules or goal weights and observing system-level impacts without physical experimentation.
- Flexible enough to integrate with stochastic simulation, providing goal achievement distributions rather than point estimates.
- Computationally intensive: each evaluation requires running the full agent-based simulation, making large-scale optimization loops expensive.
- Model calibration and validation are challenging; agent behavioral parameters are often difficult to estimate from empirical data.
- Results can be sensitive to simulation design choices (time step, agent topology, initial conditions), introducing model risk.
- Goal programming requires the analyst to pre-specify aspiration levels and weights, which may be subjective or contested among stakeholders.
Frequently asked
How does ABGP differ from simply running an agent-based model and then doing goal programming separately?
In ABGP the two components are coupled in a feedback loop: goal deviation values from each simulation run inform parameter changes that feed back into the next simulation. Running them separately means the optimization cannot account for how agent behavior changes in response to policy adjustments, losing the emergent dynamics that motivate using ABM in the first place.
Is there a standard software tool for implementing ABGP?
No single dedicated tool exists. Practitioners typically build the agent-based layer in platforms like NetLogo, Repast, or Mesa, then couple it with a mathematical programming solver (e.g., CPLEX, Gurobi, PuLP) or a metaheuristic wrapper for the optimization loop. The coupling is usually custom-coded in Python or Java.
How many simulation runs are needed per design point to get reliable goal deviation estimates?
There is no universal rule, but pilot runs with variance analysis are essential. For stochastic ABMs, 30-100 replications per design point is a common starting point; systems with high behavioral variance or rare events may require several hundred. Response surface methods or common random numbers can reduce the total run count.
Can ABGP handle lexicographic (pre-emptive) priority among goals, or only weighted goals?
Both priority structures are compatible. Weighted ABGP minimizes a single aggregated deviation objective. Lexicographic ABGP optimizes goals sequentially — first minimize deviations on the highest-priority goal, then on the second with the first goal's achievement level fixed, and so on. The choice should reflect the stakeholder's actual preference structure.
When is robust or stochastic goal programming preferable to ABGP?
When agent-level heterogeneity and emergent interaction effects are not the primary drivers of uncertainty — for example, when uncertainty stems mainly from parameter distributions rather than from decentralized decision-making — stochastic or robust goal programming offers cleaner analytical tractability with lower computational cost.
Sources
- Charnes, A., Cooper, W. W., & Ferguson, R. O. (1955). Optimal estimation of executive compensation by linear programming. Management Science, 1(2), 138-151. DOI: 10.1287/mnsc.1.2.138 ↗
- Macal, C. M., & North, M. J. (2010). Tutorial on agent-based modelling and simulation. Journal of Simulation, 4(3), 151-162. DOI: 10.1057/jos.2010.3 ↗
How to cite this page
ScholarGate. (2026, June 3). Agent-Based Goal Programming — Hybrid simulation-optimization with decentralized agents and multi-goal satisfaction. ScholarGate. https://scholargate.app/en/simulation/agent-based-goal-programming
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Agent-Based ModelingSimulation↔ compare
- Agent-based multi-objective optimizationSimulation↔ compare
- GOAL-PROGRAMMINGDecision-making↔ compare
- Multi-objective goal programmingSimulation↔ compare
- Stochastic Goal ProgrammingSimulation↔ compare