<?xml version="1.0" encoding="UTF-8"?>
<ArticleSet xmlns="http://www.openarchives.org/OAI/2.0/">
  <Article>
    <Journal>
      <PublisherName>EDP Sciences</PublisherName>
      <JournalTitle>Acta Medica Okayama</JournalTitle>
      <Issn>0399-0559</Issn>
      <Volume>56</Volume>
      <Issue>4</Issue>
      <PubDate PubStatus="ppublish">
        <Year>2022</Year>
        <Month/>
      </PubDate>
    </Journal>
    <ArticleTitle>Collaborative bargaining solution in tandem supply chain through cooperative game theoretical approach</ArticleTitle>
    <FirstPage LZero="delete">2581</FirstPage>
    <LastPage>2593</LastPage>
    <Language>EN</Language>
    <AuthorList>
      <Author>
        <FirstName EmptyYN="N">Ikuo</FirstName>
        <LastName>Arizono</LastName>
        <Affiliation>Okayama University,</Affiliation>
      </Author>
      <Author>
        <FirstName EmptyYN="N">Yasuhiko</FirstName>
        <LastName>Takemoto</LastName>
        <Affiliation>Kindai University</Affiliation>
      </Author>
    </AuthorList>
    <PublicationType/>
    <ArticleIdList>
      <ArticleId IdType="doi"/>
    </ArticleIdList>
    <Abstract>There are many studies about negotiation procedures for contract problems in supply chains. Several recent papers have considered a new negotiation procedure for a repurchase contract problem in a supply chain consisting of a manufacturer and a retailer. There, usually, are some wholesalers between a manufacturer and a retailer. Therefore, a supply chain including some wholesalers in addition to a manufacturer and a retailer should be considered. In this study, we call the supply chain in which three or more members are arranged in series the tandem supply chain. We, firstly, address a negotiation problem for a contract about wholesale and repurchase prices in the tandem supply chain in which three members, that is, a manufacturer, a wholesaler and a retailer are arranged in series. The whole contract in the tandem supply chain is composed of two contracts dependent mutually, i.e., the contract between the manufacturer and wholesaler and the contract between the wholesaler and retailer. The collaborative bargaining solution in the tandem supply chain consisting of three members is discussed. This paper, finally, formulates the tandem supply chain including several wholesalers.</Abstract>
    <CoiStatement>No potential conflict of interest relevant to this article was reported.</CoiStatement>
    <ObjectList>
      <Object Type="keyword">
        <Param Name="value">supply chain contract</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">collaborative coordination approach</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">Nash bargaining solution</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">Hessian matrix</Param>
      </Object>
    </ObjectList>
    <ReferenceList/>
  </Article>
  <Article>
    <Journal>
      <PublisherName>Wiley</PublisherName>
      <JournalTitle>Acta Medica Okayama</JournalTitle>
      <Issn>1076-2787</Issn>
      <Volume>2021</Volume>
      <Issue/>
      <PubDate PubStatus="ppublish">
        <Year>2021</Year>
        <Month/>
      </PubDate>
    </Journal>
    <ArticleTitle>Ant Colony Optimization Using Common Social Information and Self-Memory</ArticleTitle>
    <FirstPage LZero="delete">6610670 </FirstPage>
    <LastPage/>
    <Language>EN</Language>
    <AuthorList>
      <Author>
        <FirstName EmptyYN="N">Yoshiki</FirstName>
        <LastName>Tamura</LastName>
        <Affiliation>Graduate School of Natural Science and Technology, Okayama University</Affiliation>
      </Author>
      <Author>
        <FirstName EmptyYN="N">Tomoko</FirstName>
        <LastName>Sakiyama</LastName>
        <Affiliation>Department of Information Systems Science, Faculty of Science and Engineering, Soka University</Affiliation>
      </Author>
      <Author>
        <FirstName EmptyYN="N">Ikuo</FirstName>
        <LastName>Arizono</LastName>
        <Affiliation>Graduate School of Natural Science and Technology, Okayama University</Affiliation>
      </Author>
    </AuthorList>
    <PublicationType/>
    <ArticleIdList>
      <ArticleId IdType="doi"/>
    </ArticleIdList>
    <Abstract>Ant colony optimization (ACO), which is one of the metaheuristics imitating real ant foraging behavior, is an effective method to ?nd a solution for the traveling salesman problem (TSP). The rank-based ant system (AS(rank)) has been proposed as a developed version of the fundamental model AS of ACO. In the AS(rank), since only ant agents that have found one of some excellent solutions are let to regulate the pheromone, the pheromone concentrates on a specific route. As a result, although the AS(rank) can find a relatively good solution in a short time, it has the disadvantage of being prone falling into a local solution because the pheromone concentrates on a specific route. This problem seems to come from the loss of diversity in route selection according to the rapid accumulation of pheromones to the specific routes. Some ACO models, not just the AS(rank), also suffer from this problem of loss of diversity in route selection. It can be considered that the diversity of solutions as well as the selection of solutions is an important factor in the solution system by swarm intelligence such as ACO. In this paper, to solve this problem, we introduce the ant system using individual memories (ASIM) aiming to improve the ability to solve TSP while maintaining the diversity of the behavior of each ant. We apply the existing ACO algorithms and ASIM to some TSP benchmarks and compare the ability to solve TSP.</Abstract>
    <CoiStatement>No potential conflict of interest relevant to this article was reported.</CoiStatement>
    <ObjectList/>
    <ReferenceList/>
  </Article>
</ArticleSet>
