Dynamic visiting coordination problem based on multi-agent for large-scale crowds' activities

Jin Li

International Journal of Industrial and Systems Engineering, 2014, vol. 17, issue 1, 115-131

Abstract: In order to reduce the phenomena of long time queuing and congestion in large-scale crowds' activities, improve the tourist's satisfaction and increase social welfare, a dynamic visiting coordination model based on multi-agent for large scale crowds' activities is proposed. Then, a visiting coordination algorithm considering comprehensively the tourist's preference, attraction's congestion and road impedance (denoted as PCI) is designed. The other two visiting coordination algorithms only considering attraction's preference or congestion are introduced respectively. Three types of these coordination algorithms are tested by computer simulation. The results indicate that the proposed coordination algorithm PCI can improve the congestion status significantly and ensure better social welfare while meeting the real-time requirements.

Keywords: large-scale crowds; crowd activities; tourists; visitor coordination; multi-agent systems; MAS; agent-based systems; systems engineering; queuing times; crowd congestion; dynamic modelling; tourist preferences; tourism; tourist atractions; simulation; social welfare; tourist visits. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=60830 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:17:y:2014:i:1:p:115-131

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().