Conference
International Conference on Advances in System Simulation
About: International Conference on Advances in System Simulation is an academic conference. The conference publishes majorly in the area(s): Discrete event simulation & Modeling and simulation. Over the lifetime, 2381 publications have been published by the conference receiving 39687 citations.
Topics: Discrete event simulation, Modeling and simulation, DEVS, Computer science, Network simulation
Papers published on a yearly basis
Papers
More filters
01 Feb 2001
TL;DR: A new heuristic algorithm, mimicking the improvisation of music players, has been developed and named Harmony Search (HS), which is illustrated with a traveling salesman problem (TSP), a specific academic optimization problem, and a least-cost pipe network design problem.
Abstract: Many optimization problems in various fields have been solved using diverse optimization al gorithms. Traditional optimization techniques such as linear programming (LP), non-linear programming (NL...
5,136 citations
Proceedings Article•
23 Oct 2011TL;DR: The current state of the SUMO package, an open source traffic simulation package including net import and demand modeling components, is described as well as future developments and extensions.
Abstract: SUMO is an open source traffic simulation package including net import and demand modeling components. We describe the current state of the package as well as future developments and extensions. SUMO helps to investigate several research topics e.g. route choice and traffic light algorithm or simulating vehicular communication. Therefore the framework is used in different projects to simulate automatic driving or traffic management strategies.
1,560 citations
01 Jul 2005
TL;DR: This paper describes the MASON system, its motivation, and its basic architectural design, and compares MASON to related multi-agent libraries in the public domain, and discusses six applications of the system built over the past year which suggest its breadth of utility.
Abstract: MASON is a fast, easily extensible, discrete-event multi-agent simulation toolkit in Java, designed to serve as the basis for a wide range of multi-agent simulation tasks ranging from swarm robotics to machine learning to social complexity environments. MASON carefully delineates between model and visualization, allowing models to be dynamically detached from or attached to visualizers, and to change platforms mid-run. This paper describes the MASON system, its motivation, and its basic architectural design. It then compares MASON to related multi-agent libraries in the public domain, and discusses six applications of the system built over the past year which suggest its breadth of utility.
956 citations
01 Apr 1994
TL;DR: The proposed search algorithm is realized by GAs which utilize a penalty function in the objective function to account for violation, based on systematic multi-stage assignments of weights in the penalty method as opposed to single- stage assignments in sequential unconstrained minimization.
Abstract: This paper presents an application of genetic algorithms (GAs) to nonlinear constrained optimization. GAs are general purpose optimization algorithms which apply the rules of natural genetics to explore a given search space. When GAs are applied to nonlinear constrained problems, constraint handling becomes an important issue. The proposed search algorithm is realized by GAs which utilize a penalty function in the objective function to account for violation. This extension is based on systematic multi-stage assignments of weights in the penalty method as opposed to single-stage assignments in sequential unconstrained minimization. The experimental results are satisfactory and agree well with those of the gradient type methods.
758 citations
01 Sep 2006
TL;DR: Five software platforms for scientific agent-based models (ABMs) were reviewed by implementing example models in each, finding MASON and Repast usually fastest, Swarm fastest for simple models but slowest for complex ones, and NetLogo intermediate.
Abstract: Five software platforms for scientific agent-based models (ABMs) were reviewed by implementing example models in each. NetLogo is the highest-level platform, providing a simple yet powerful programming language, built-in graphical interfaces, and comprehensive documentation. It is designed primarily for ABMs of mobile individuals with local interactions in a grid space, but not necessarily clumsy for others. NetLogo is highly recommended, even for prototyping complex models. MASON, Repast, and Swarm are "framework and library" platforms, providing a conceptual framework for organizing and designing ABMs and corresponding software libraries. MASON is least mature and designed with execution speed a high priority. The Objective-C version of Swarm is the most mature library platform and is stable and well organized. Objective-C seems more natural than Java for ABMs but weak error-handling and the lack of developer tools are drawbacks. Java Swarm allows Swarm's Objective-C libraries to be called from Java; it does not seem to combine the advantages of the two languages well. Repast provides Swarm-like functions in a Java library and is a good choice for many, but parts of its organization and design could be improved. A rough comparison of execution speed found MASON and Repast usually fastest (MASON 1-35% faster than Repast), Swarm (including Objective-C) fastest for simple models but slowest for complex ones, and NetLogo intermediate. Recommendations include completing the documentation (for all platforms except NetLogo), strengthening conceptual frameworks, providing better tools for statistical output and automating simulation experiments, simplifying common tasks, and researching technologies for understanding how simulation results arise.
741 citations