The world is moving toward a new connected world in which millions of intelligent processing devices communicate with each other to provide services in transportation, telecommunication, and power grids in the future’s smart cities. Distributed computing is considered one of the efficient platforms for processing and management of massive amounts of data collected by smart devices. This can be implemented by utilizing multi-agent systems (MASs) with multiple autonomous computational entities by memory and computation capabilities and the possibility of message-passing between them. These systems provide a dynamic and self-adaptive platform for managing distributed large-scale systems, such as the Internet-of-Things (IoTs). Despite, the potential applicability of MASs in smart cities, very few practical systems have been deployed using agent-oriented systems. This research surveys the existing techniques presented in the literature that can be utilized for implementing adaptive multi-agent networks in smart cities. The related literature is categorized based on the steps of designing and controlling these adaptive systems. These steps cover the techniques required to define, monitor, plan, and evaluate the performance of an autonomous MAS. At the end, the challenges and barriers for the utilization of these systems in current smart cities, and insights and directions for future research in this domain, are presented.

Operations scheduling of mass customized products is vital in the modern make-to-order (MTO) supply chains. In these systems, order acceptance decisions should be coordinated with available capacity in different sections of the supply chain while considering their potential correlations and interactions. One of the fundamental challenges in optimization of these systems is the computation time of solving models with multiple coupling constraints between supply chain units. This paper addresses this issue by proposing a game-based framework that decomposes the related mixed integer programming mathematical model and it is coordinated and solved using integrated game-based Alternating Direction Method of Multipliers (ADMM). The proposed Stackelberg Leader-Follower game optimizes order acceptance decisions while considering the requirements in supply, production planning, maintenance, inventory, and distribution units. To validate the efficiency of the proposed framework, the model is tested with a simulated four-layer supply chain. The results of experiments proved that decompositions of the model to smaller subsections and solving it in a distributed manner not only optimizes supply chain participating units but also coordinate their movements to achieve the global optimal solution. The proposed framework offers managers a practical decision layer that preserve local autonomy of the supply chain units and reduce their data sharing and computation burdens and concerns.

The rapid growth of artificial intelligence applications and digital ecosystems, especially in industry, has highlighted the need for proposing new data centers. Data center siting requires consideration of many different factors including power grid capacity, fiber network resources, and environmental and regional considerations. This research proposes a multi-layer network optimization in which the master plan optimizes data center siting and their capacity decisions while the other lower-level layers analyze the feasibility and optimality of these decisions in terms of grid congestion and transmission network expansion, fiber routing and latency, and cooling resources. The efficiency of the proposed plan and its reliability will be evaluated by simulating different scenarios including unexpected power grid outages because of natural disasters. The results of the model highlight the importance of integrated decision making for siting data centers while considering zoning restrictions and required capacities and operation costs of water, fiber/optic, and power networks.