Transactions of the Institute of Systems, Control and Information Engineers
Online ISSN : 2185-811X
Print ISSN : 1342-5668
ISSN-L : 1342-5668
Volume 24 , Issue 4
Showing 1-3 articles out of 3 articles from the selected issue
Papers
  • Noritaka Shigei, Hiromi Miyajima, Tsukasa Osako
    2011 Volume 24 Issue 4 Pages 77-87
    Published: 2011
    Released: July 15, 2011
    JOURNALS FREE ACCESS
    The market model, which is one of the economic activity models, is modeled as an agent system, and applying the model to the resource allocation problem has been studied. For air conditioning control of building, which is one of the resource allocation problems, an effective method based on the agent system using auction has been proposed for traditional PID controller. On the other hand, it has been considered that this method is performed by decentralized control. However, its decentralization is not perfect, and its performace is not enough. In this paper, firstly, we propose a perfectly decentralized agent model and show its performance. Secondly, in order to improve the model, we propose the agent model based on small-world model. The effectiveness of the proposed model is shown by simulation.
    Download PDF (668K)
  • Kazutoshi Sakakibara, Yajie Tian, Ikuko Nishikawa
    2011 Volume 24 Issue 4 Pages 88-96
    Published: 2011
    Released: July 15, 2011
    JOURNALS FREE ACCESS
    We discuss the planning of transportation by trucks over a multi-day period. Each truck collects loads from suppliers and delivers them to assembly plants or a truck terminal. By exploiting the truck terminal as a temporal storage, we aim to increase the load ratio of each truck and to minimize the lead time for transportation. In this paper, we show a mixed integer programming model which represents each product explicitly, and discuss the decomposition of the problem into a problem of delivery and storage, and a problem of vehicle routing. Based on this model, we propose a relax-and-fix type heuristic in which decision variables are fixed one by one by mathematical programming techniques such as branch-and-bound methods.
    Download PDF (260K)
Short Paper
feedback
Top