2021/04/08 更新

写真a

ニシ タツシ
西 竜志
NISHI Tatsushi
所属
自然科学学域 教授
職名
教授
外部リンク
 

論文

  • A Genetic Algorithm for Multi-Period Location Problem with Modular Emergency Facilities and Back-up Services 査読

    Alizadeh Roghayyeh, Tatsushi Nishi

      32   370 - 377   2019年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • Government Regulations on Closed-Loop Supply Chain with Evolutionarily Stable Strategy 査読

    Ziang Liu, Tatsushi Nishi

    Sustainability   2019年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • A GRASP Approach for Solving the Blocks Relocation Problem with Stowage Plan 査読

    Raka Jovanovic, Shunji Tanaka, Tatsushi Nishi, Stefan Voss

    Flexible Services and Manufacturing Journal31   702 - 729   2019年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Springer  

    researchmap

  • Dynamic p+q Maximal Hub Location Problem for Freight Transportation Planning with Rational Markets 査読

    Roghayyeh Alizadeh, Tatsushi Nishi

    Advance in Mechanical Engineering11   1 - 13   2019年2月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    DOI: 10.1177/1687814018822934

    researchmap

  • An Efficient Deadlock Prevention Policy for Noncyclic Scheduling of Multi-Cluster Tools 査読

    Tatsushi Nishi, Yushin Watanabe, Masaru Sakai

    IEEE Transactions on Automation Science and Engineering15 ( 4 ) 1677 - 1691   2018年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • Analysis of Leadership Structures for Two-Echelon Supply Chains Involving Multiple Risky Suppliers 査読

    Takuya Tsuboi, Tatsushi Nishi

    Journal of Advanced Mechanical Design, Systems and Manufacturing   2018年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • Design of a Petri Net Supervisor for Multi-Cluster Tools to Improve Scheduling Performance 査読

    Masaru Sakai, Tatsushi Nishi

    Journal of Advanced Mechanical Design, Systems and Manufacturing   2018年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • Two-Level Decomposition-Based Matheuristic for Airline Crew Rostering Problems with Fair Working Time 査読

    Tsubasa Doi, Tatsushi Nishi, Stefan Voss

    European Journal of Operational Research267 ( 2 ) 428 - 438   2018年2月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • A dynamic programming-based matheuristic for the dynamic berth allocation problem 査読

    Tatsushi Nishi, Tatsuya Okura, Eduardo Lalla-Ruiz, Stefan Voß

    Annals of Operations Research   1 - 20   2017年11月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Springer New York LLC  

    The increasing maritime traffic forces terminal operators to efficiently reduce the container ships’ service time in order to maintain or increase their market share. This situation gives rise to the well-known berth allocation problem. Its goal is to determine the allocation and the berthing time of container ships arriving to the port with the aim of minimizing the total service time. For tackling this problem, we propose a dynamic programming-based matheuristic that allows to derive lower and upper bounds, and therefore, evaluate the optimality of the provided solutions. Its behavior is assessed on realistic problem instances from the related literature as well as on a new set of larger instances with 150 ships and 15 berths. The results indicate that our proposed approach shows a competitive performance.

    DOI: 10.1007/s10479-017-2715-9

    Scopus

    researchmap

  • Petri net representation and reachability analysis of 0-1 integer linear programming problems

    Akito Kodama, Tatsushi Nishi

    INFORMATION SCIENCES400   157 - 172   2017年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ELSEVIER SCIENCE INC  

    In this paper, we investigate a general algorithm for converting the 0-1 integer linear programming problem (0-1IP) into an optimal transition firing sequence problem (OFSP) of a Petri net (PN). The general 0-1IP can be visualized graphically and then analyzed using the PN theory after application of our proposed conversion algorithm. The proposed algorithm is applied to a traveling salesman problem, a vehicle routing problem and an automated guided vehicles (AGV) routing problem. A PN reduction technique is employed to reduce the size of the PN. Valid inequalities are derived using reachability analysis of the converted PN model. These inequalities are imposed on the original 0-1IP. Computational results show that the total computational time for solving an AGVRP with the valid inequalities derived using the reachability analysis is significantly reduced. (C) 2017 Elsevier Inc. All rights reserved.

    DOI: 10.1016/j.ins.2017.03.014

    Web of Science

    researchmap

  • A Combined column generation and heuristics for railway short-term rolling stock planning with regular inspection constraints 査読

    Tatsushi Nishi, Akiyoshi Ohno, Masahiro Inuiguchi, Satoru Takahashi, Kenji Ueda

    COMPUTERS & OPERATIONS RESEARCH81   14 - 25   2017年5月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:PERGAMON-ELSEVIER SCIENCE LTD  

    The aim of railway rolling stock planning problem is to find an optimal allocation of train-sets for a given set of trips in the train timetable in order to minimize the total cost. We propose a column generation and Lagrangian relaxation heuristics for short-term rolling stock planning problems with regular inspection constraints. The problem is formulated as a subtour traveling salesman problem to find a set of elementary shortest cycles that cover all trips in the timetable. In the proposed method, a tight lower bound is obtained from the continuous relaxation of Dantzig Wolfe reformulation by column generation. The pricing problem can be formulated as an elementary shortest cycle problem with resource constraints. A labeling algorithm is applied to solve the pricing problem. In order to reduce the computational effort, we apply a general state space augmenting algorithm to solve the pricing problems. Computational results show that the proposed column generation and Lagrangian relaxation heuristics can find good lower and upper bounds for 300 trips within reasonable computing time. (C) 2016 Elsevier Ltd. All rights reserved.

    DOI: 10.1016/j.cor.2016.11.025

    Web of Science

    researchmap

  • A Heuristic Approach for Dividing Graphs into Bi-connected Components with a Size Constraint 査読

    Raka Jovanovic, Tatsushi Nishi, Stefan Voss

    Journal of Heuristics   2017年4月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • An integrated strategy for a production planning and warehouse layout problem: Modeling and solution approaches 査読

    Zhang G, Nishi T, Turner S, Oga K, Li X

    Omega (United Kingdom)68   85 - 94   2017年4月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    © 2016 Elsevier Ltd We study a real-world production warehousing case, where the company always faces the challenge to find available space for its products and to manage the items in the warehouse. To resolve the problem, an integrated strategy that combines warehouse layout with the capacitated lot-sizing problem is presented, which have been traditionally treated separately in the existing literature. We develop a mixed integer linear programming model to formulate the integrated optimization problem with the objective of minimizing the total cost of production and warehouse operations. The problem with real data is a large-scale instance that is beyond the capability of optimization solvers. A novel Lagrangian relax-and-fix heuristic approach and its variants are proposed to solve the large-scale problem. The preliminary numerical results from the heuristic approaches are reported.

    DOI: 10.1016/j.omega.2016.06.005

    researchmap

  • Noncyclic Scheduling of Dual-Armed Cluster Tools for Minimization of Wafer Residency Time and Makespan 査読

    Masaru Sakai, Tatsushi Nishi

    Advance in Mechanical Engineering   2017年4月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • Optimization of Multi-Period Bilevel Supply Chain Planning for Single Supplier and Single Retailer under Demand Uncertainty 査読

    Okihiro Yoshida, Tatsushi Nishi

    Transaction of the Institute of Systems and Control Engineers30 ( 3 ) 73 - 80   2017年3月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    DOI: 10.5687/iscie.30.73

    researchmap

  • Production planning problem with market impact under demand uncertainty 査読

    Takuya Aoyama, Tatsushi Nishi, Guoqing Zhang

    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING11 ( 2 )   2017年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JAPAN SOC MECHANICAL ENGINEERS  

    In this paper, we consider the production planning problem for a single manufacturer with the investment to improve the market impact under demand uncertainty. In the mathematical model, the average demand increases if the investment of market impact is increased for each product. The objective is to maximize the total profit with a piecewise linear investment cost and a budget constraint. The problem is formulated as a mixed integer nonlinear programming problem. A solution procedure based on Lagrangian relaxation is developed to solve the problem efficiently. In the proposed method, an analytical solution of the newsboy problem is effectively used to derive the lower and upper bounds. The condition of the concavity of the profit function is derived. The effectiveness of the proposed method is confirmed through computational experiments.

    DOI: 10.1299/jamdsm.2017jamdsm0019

    Web of Science

    researchmap

  • Replacement of Leader-Follower Relation in Multi-Period Supply Chain Planning under Demand Uncertainty 査読

    Okihiro Yoshida, Tatsushi Nishi

    Proceedings of International Symposium on Flexible Automation 2016   1016 - 1020   2016年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Game Theoretic Approach for Coordination of Telecommunication Supply Chain under Network Externality 査読

    Jun Wu, Xu Cui, Tatsushi Nishi, Jian Li

    International Journal of Innovative Computing, Information and Control   2016年6月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • A game theoretic model for coordination of single manufacturer and multiple suppliers with quality variations under uncertain demands 査読

    Sisi Yin, Tatsushi Nishi, Guoqing Zhang

      3 ( 2 ) 79 - 91   2016年3月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • Application of two-phase decomposition algorithm to practical airline crew rostering problem for fair working time 査読

    Tsubasa Doi, Tatsushi Nishi

    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING10 ( 3 )   2016年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JAPAN SOC MECHANICAL ENGINEERS  

    We propose an application of a two-phase decomposition algorithm for a practical airline crew rostering problem for fair working time. The problem is to find an optimal assignment of duties to individual crew members such that various hard constraints such as rest days, rules and regulations are satisfied. The objective is to minimize the total deviation of the average working time from the standard working time for crew members. A two-phase decomposition algorithm is successfully applied to solve the problem. The proposed method decomposes the original problem into the master problem and the subproblem. The master problem is solved by an exact algorithm with a generalized set partitioning formulation if all possible rosters are enumerated by an efficient enumeration algorithm. The upper bound is improved by a metaheuristic algorithm. The effectiveness of the proposed method for a large scale rostering problem is shown from computational experiments.

    DOI: 10.1299/jamdsm.2016jamdsm0036

    Web of Science

    researchmap

  • Optimization of Multi-period Bilevel Supply Chains under Demand Uncertainty 査読

    Tatsushi Nishi, Okihiro Yoshida

    RESEARCH AND INNOVATION IN MANUFACTURING: KEY ENABLING TECHNOLOGIES FOR THE FACTORIES OF THE FUTURE - PROCEEDINGS OF THE 48TH CIRP CONFERENCE ON MANUFACTURING SYSTEMS41   508 - 513   2016年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:ELSEVIER SCIENCE BV  

    Due to advance of global manufacturing, the decentralized optimization of multi-tier supply chains for multiple retailers and manufacturers becomes more and more important. Conventional works on game theoretical model for supply chain planning problems concentrates on single period models. However, the situations for decision making in decentralized supply chains are subject to change with respect to time periods. In this paper, we address the optimization of multi-period bilevel supply chains under demand uncertainty. The decentralized supply chain planning problem is modelled as a multi-period non-cooperative game. The problem is formulated as a stochastic multi-period bilevel optimization problem under demand uncertainty. The optimization algorithm to derive a Stackelberg equilibrium for multi-period bilevel supply chain planning problem is developed. The effectiveness of the proposed method is validated by comparing it with the single period models. (C) 2015 The Authors. Published by Elsevier B.V.

    DOI: 10.1016/j.procir.2015.12.112

    Web of Science

    researchmap

  • A Solution Procedure based on Lagrangian Relaxation for Supply Chain Planning Problem with CSR Investment 査読

    Takuya Aoyama, Tatsushi Nishi

    Proceedings of IEEE International Conference on Industrial Engineering and Engineering Management 2015   2015年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/IEEM.2015.7385918

    researchmap

  • Combinatorial Auction Algorithm with Price-Adjustment Mechanism for Airline Crew Scheduling Problems 査読

    Daiki Sasaki, Tatsushi Nishi

    Proceedings of IEEE International Conference on Industrial Engineering and Engineering Management 2015   2015年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/IEEM.2015.7385834

    researchmap

  • Application of two-level decomposition algorithm to airline crew rostering problems 査読

    Tsubasa Doi, Tatsushi Nishi, Kenji Ueda, Naohiko Suzuki, Kenji Ojima

    Proceedings of International Symposium on Scheduling 2015   2015年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • A solution algorithm for leader-follower multi-period supply chain planning under demand uncertainty 査読

    Okihiro Yoshida, Tatsushi Nishi

    Proceedings of International Symposium on Scheduling 2015   15 - 18   2015年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Application of two-level decomposition algorithm to airline crew rostering problems 査読

    Tsubasa Doi, Tatsushi Nishi, Kenji Ueda, Naohiko Suzuki, Kenji Ojima

        2015年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Petri net representation and analysis of 0-1 integer programming problems: Application to routing problems for automated guided vehicles 査読

    Akito Kodama, Tatsushi Nishi

        2015年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/IEEM.2014.7058734

    researchmap

  • Lagrangian Relaxation and Fix Heuristic for Integrated Production Planning and Warehouse Storage Allocation Problem under Demand Uncertainty 査読

    Keisuke Oga, Tatsushi Nishi, Guoqing Zhang

    Transactions of ISCIE28 ( 3 ) 91 - 98   2015年3月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    DOI: 10.5687/iscie.28.91

    researchmap

  • Optimal quantity discount coordination for supply chain optimization with one manufacturer and multiple suppliers under demand uncertainty 査読

    Sisi Yin, Tatsushi Nishi, Ignacio E. Grossmann

    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY76 ( 5-8 ) 1173 - 1184   2015年2月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:SPRINGER LONDON LTD  

    In this paper, a coordination strategy is developed to integrate business decisions and manufacturing planning in supply chain management. We consider one manufacturer and multiple suppliers to determine production, prices, and inventory simultaneously with uncertain demands. This paper aims at providing an optimal discount policy derived from Stackelberg equilibrium to coordinate a manufacturer and multiple suppliers. The optimal discount coordination mechanism helps the manufacturer to select suppliers in order to maintain long-term relationship with the contracted suppliers under demand uncertainty. Noncooperative game is applied in order to resolve decision-making in order to determine quantities of components, price, production, and selection of suppliers simultaneously. Computational experiments are conducted to demonstrate the effectiveness and efficiency of the proposed approach.

    DOI: 10.1007/s00170-014-6298-1

    Web of Science

    researchmap

  • Petri Net Decomposition Approach to Deadlock-Free and Non-Cyclic Scheduling of Dual-Armed Cluster Tools 査読

    Tatsushi Nishi, Izuru Matsumoto

    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING12 ( 1 ) 281 - 294   2015年1月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC  

    Semiconductor cluster tools are the integrated equipment to process a variety of silicon wafers for the fabrication of microelectronic components. The cluster tool system consists of several loadlock modules, processing chambers, and material handling armed robots for transferring wafers between them. Most scheduling problems for dual-armed cluster tools adopt cyclic scheduling with the assumption of swap sequence of the robot arm. A deadlock-free and non-cyclic scheduling is highly required to improve total throughput of cluster tools for various types of wafer flow patterns and various changes of equipment configurations. In this paper, we propose a Petri net decomposition approach to derive a near-optimal solution of deadlock-free and non-cyclic scheduling of dual-armed cluster tools to reduce the computational complexity. A timed Petri net model is introduced to represent a non-cyclic scheduling model for dual-armed cluster tools. In order to obtain a deadlock-free and non-cyclic schedule efficiently, we propose a deadlock avoidance control policy that restricts the markings to prevent unmarked siphons. Deadlock condition for the dual-armed cluster tools is characterized by the structure of Petri net model. The performance of the non-cyclic scheduling model by the proposed method is compared with that of the cyclic scheduling model. Computational results show the effectiveness of the non-cyclic scheduling model compared with the cyclic scheduling model for multiple wafer flow patterns.
    Note to Practitioners-The scheduling of dual-armed cluster tools has been attracted by many researchers recently with growing semiconductor manufacturing. Most of the conventional studies have been concentrated on cyclic scheduling to minimize the cycle time with the swap strategy for robot arm operations. The swap strategy has been widely used to analyze the steady-state operation with cyclic schedules in order to simplify the model with less computational complexity. However, dual-armed cluster tool operations for the swap strategy are restricted because possible states are limited. Non-swap strategy outperforms the swap strategy in the transport-bound region. In order to deal with lot switching, frequent wafer flow pattern changes, periodic maintenance, and processing time variations, a deadlock-free and non-cyclic scheduling without swap strategy is highly required. In this paper, we propose a Petri net decomposition approach with a deadlock avoidance policy that can derive a near-optimal solution for much larger size of non-cyclic scheduling problems of dual-armed cluster tools. A timed Petri net model for non-cyclic scheduling is developed for the dual-armed cluster tools with different flow pattern without assuming the swap strategy. Deadlock is analyzed with minimal siphons of the proposed model and the deadlock-free conditions are derived. Computational experiments show the effectiveness of the non-cyclic scheduling solution derived by the proposed method for multiple wafer flow patterns.

    DOI: 10.1109/TASE.2013.2292572

    Web of Science

    researchmap

  • An Optimization Approach for Congestion Management for Traffic Signal Control Systems via First-Order Hybrid Petri Nets 査読

    Ryotaro Yamazaki, Tatsushi Nishi

    2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM)   1252 - 1256   2015年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    In this paper, we study an optimization approach for congestion management for traffic signal control systems via first-order hybrid Petri nets. The traffic signal control problem is represented by the optimal firingsequence problem for the first-order hybrid Petri net (FOHPN). In order to solve large scaleproblems, the Petri net decomposition approach for FOHPN is developed. The computational results show thatthe computation time can be reduced by the proposed approach and the outcome of the FOHPN decomposition approach for congestion management.

    DOI: 10.1109/IEEM.2015.7385848

    Web of Science

    researchmap

  • Analysis of Quantity Discounts for Multi-Period Production Planning for Single Supplier and Retailer under Uncertain Demands 査読

    Okihiro Yoshida, Tatsushi Nishi, Guoqing Zhang

    Proceedings of IEEE International Conference on Industrial Engineering and Engineering Management 2014   2014年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/IEEM.2014.7058765

    researchmap

  • Petri Net Representation for 0-1 Integer Programming Problems 査読

    Akito Kodama, Tatsushi Nishi

    Proceedings of 2014 IEEE International Conference on Industrial Engineering and Engineering Management   2014年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/IEEM.2014.7058734

    researchmap

  • Lagrangian relax and fix heuristics for integrated production planning and warehouse layout problem 査読

    K. Ohga, T. Nishi, G. Zhang, S. Turner

    IEEE International Conference on Industrial Engineering and Engineering Management   1233 - 1237   2014年11月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE Computer Society  

    We present a real world production warehousing case, where the company always faces the challenges to find available space for their products and to manage the items in the warehouse. We develop a decomposition algorithm to solve a mixed integer programming formulation of warehouse layout with capacitated lot sizing problem. The problem with real data is a large scale instance that is beyond the capability of optimization solvers. We propose a Lagrangian relax and fix heuristics to solve the problem efficiently. Computational results demonstrate the effectiveness of the proposed method by comparing the performance of the proposed method and branch and bound method.

    DOI: 10.1109/IEEM.2013.6962608

    Scopus

    researchmap

  • A New Deadlock Prevention Policy for Multi-Cluster Tools with Dual Path 査読

    Yushin Watanabe, Tatsushi Nishi

    Proceedings of IEEE International Conference on Systems, Man and Cybernetics 2014   2014年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/SMC.2014.6974099

    researchmap

  • Two-level Decomposition Algorithm for Shift Scheduling Problems 査読

    Tsubasa Doi, Tatsushi Nishi

    Proceedings of IEEE International Conference on Systems, Man and Cybernetics 2014   2014年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/SMC.2014.6974518

    researchmap

  • Two-level decomposition algorithm for crew rostering problems with fair working condition 査読

    Tatsushi Nishi, Taichi Sugiyama, Masahiro Inuiguchi

    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH237 ( 2 ) 465 - 473   2014年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ELSEVIER SCIENCE BV  

    A typical railway crew scheduling problem consists of two phases: a crew pairing problem to determine a set of crew duties and a crew rostering problem. The crew rostering problem aims to find a set of rosters that forms workforce assignment of crew duties and rest periods satisfying several working regulations. In this paper, we present a two-level decomposition approach to solve railway crew rostering problem with the objective of fair working condition. To reduce computational efforts, the original problem is decomposed into the upper-level master problem and the lower-level subproblem. The subproblem can be further decomposed into several subproblems for each roster. These problems are iteratively solved by incorporating cuts into the master problem. We show that the relaxed problem of the master problem can be formulated as a uniform parallel machine scheduling problem to minimize makespan, which is NP-hard. An efficient branch-and-bound algorithm is applied to solve the master problem. Effective valid cuts are developed to reduce feasible search space to tighten the duality gap. Using data provided by the railway company, we demonstrate the effectiveness of the proposed method compared with that of constraint programming techniques for large-scale problems through computational experiments. (C) 2014 Elsevier B.V. All rights reserved.

    DOI: 10.1016/j.ejor.2014.02.010

    Web of Science

    researchmap

  • Two-level decomposition algorithm for crew rostering problems with fair working condition 査読

    Tatsushi Nishi, Taichi Sugiyama, Masahiro Inuiguchi

    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH237 ( 2 ) 465 - 473   2014年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ELSEVIER SCIENCE BV  

    A typical railway crew scheduling problem consists of two phases: a crew pairing problem to determine a set of crew duties and a crew rostering problem. The crew rostering problem aims to find a set of rosters that forms workforce assignment of crew duties and rest periods satisfying several working regulations. In this paper, we present a two-level decomposition approach to solve railway crew rostering problem with the objective of fair working condition. To reduce computational efforts, the original problem is decomposed into the upper-level master problem and the lower-level subproblem. The subproblem can be further decomposed into several subproblems for each roster. These problems are iteratively solved by incorporating cuts into the master problem. We show that the relaxed problem of the master problem can be formulated as a uniform parallel machine scheduling problem to minimize makespan, which is NP-hard. An efficient branch-and-bound algorithm is applied to solve the master problem. Effective valid cuts are developed to reduce feasible search space to tighten the duality gap. Using data provided by the railway company, we demonstrate the effectiveness of the proposed method compared with that of constraint programming techniques for large-scale problems through computational experiments. (C) 2014 Elsevier B.V. All rights reserved.

    DOI: 10.1016/j.ejor.2014.02.010

    Web of Science

    researchmap

  • Lagrangian Relax and Fix Heuristics for Integrated Production Planning and Warehouse Layout Problem under Demand Uncertainty 査読

    Keisuke Oga, Tatsushi Nishi, Guoqing Zhang

    Proceedings of International Symposium on Flexible Automation 2014   2014年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:ASME  

    DOI: 10.1109/IEEM.2013.6962608

    researchmap

  • Decomposition of timed automata for solving scheduling problems 査読

    Tatsushi Nishi, Masato Wakatake

    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE45 ( 3 ) 472 - 486   2014年3月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:TAYLOR & FRANCIS LTD  

    A decomposition algorithm for scheduling problems based on timed automata (TA) model is proposed. The problem is represented as an optimal state transition problem for TA. The model comprises of the parallel composition of submodels such as jobs and resources. The procedure of the proposed methodology can be divided into two steps. The first step is to decompose the TA model into several submodels by using decomposable condition. The second step is to combine individual solution of subproblems for the decomposed submodels by the penalty function method. A feasible solution for the entire model is derived through the iterated computation of solving the subproblem for each submodel. The proposed methodology is applied to solve flowshop and jobshop scheduling problems. Computational experiments demonstrate the effectiveness of the proposed algorithm compared with a conventional TA scheduling algorithm without decomposition.

    DOI: 10.1080/00207721.2012.724099

    Web of Science

    researchmap

  • Column generation heuristics for ship routing and scheduling problems in crude oil transportation with split deliveries 査読

    Tatsushi Nishi, Tsukasa Izuno

    COMPUTERS & CHEMICAL ENGINEERING60 ( 10 ) 329 - 338   2014年1月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:PERGAMON-ELSEVIER SCIENCE LTD  

    We propose a column generation based heuristic algorithm to solve a ship routing and scheduling problem for crude oil transportation with split deliveries. The problem is to find an optimal assignment and sequence and loading volume of demand simultaneously in order to minimize the total distance satisfying the capacity of tankers. The problem can be considered as a multi-product heterogeneous fleet split pickup ship routing problem with finite capacity and loading constraints. An efficient heuristic algorithm based on the column generation method is developed to generate a feasible solution taking into account of practical constraints. The performance of the proposed method is compared with the branch and bound algorithm and that of human operators. Computational results demonstrate the effectiveness of the proposed algorithm for a real case. (C) 2013 Elsevier Ltd. All rights reserved.

    DOI: 10.1016/j.compchemeng.2013.09.019

    Web of Science

    researchmap

  • Column generation heuristics for ship routing and scheduling problems in crude oil transportation with split deliveries 査読

    Tatsushi Nishi, Tsukasa Izuno

    COMPUTERS & CHEMICAL ENGINEERING60 ( 10 ) 329 - 338   2014年1月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:PERGAMON-ELSEVIER SCIENCE LTD  

    We propose a column generation based heuristic algorithm to solve a ship routing and scheduling problem for crude oil transportation with split deliveries. The problem is to find an optimal assignment and sequence and loading volume of demand simultaneously in order to minimize the total distance satisfying the capacity of tankers. The problem can be considered as a multi-product heterogeneous fleet split pickup ship routing problem with finite capacity and loading constraints. An efficient heuristic algorithm based on the column generation method is developed to generate a feasible solution taking into account of practical constraints. The performance of the proposed method is compared with the branch and bound algorithm and that of human operators. Computational results demonstrate the effectiveness of the proposed algorithm for a real case. (C) 2013 Elsevier Ltd. All rights reserved.

    DOI: 10.1016/j.compchemeng.2013.09.019

    Web of Science

    researchmap

  • A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty 査読

    Sisi Yin, Tatsushi Nishi

    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE45 ( 11 ) 2354 - 2365   2014年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:TAYLOR & FRANCIS LTD  

    Quantity discount policy is decision-making for trade-off prices between suppliers and manufacturers while production is changeable due to demand fluctuations in a real market. In this paper, quantity discount models which consider selection of contract suppliers, production quantity and inventory simultaneously are addressed. The supply chain planning problem with quantity discounts under demand uncertainty is formulated as a mixed-integer nonlinear programming problem (MINLP) with integral terms. We apply an outer-approximation method to solve MINLP problems. In order to improve the efficiency of the proposed method, the problem is reformulated as a stochastic model replacing the integral terms by using a normalisation technique. We present numerical examples to demonstrate the efficiency of the proposed method.

    DOI: 10.1080/00207721.2013.769645

    Web of Science

    researchmap

  • A Supply Chain Planning Model with Supplier Selection under Uncertain Demands and Asymmetric Information 査読

    Sisi Yin, Tatsushi Nishi

    VARIETY MANAGEMENT IN MANUFACTURING: PROCEEDINGS OF THE 47TH CIRP CONFERENCE ON MANUFACTURING SYSTEMS17   639 - 644   2014年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:ELSEVIER SCIENCE BV  

    In this paper, a supply chain planning model including a manufacturer, a retailer and multiple suppliers under demand uncertainty with asymmetric information is considered. The manufacturer determines production, estimated quantity of defective components and the selection of suppliers. Quantities and quality of components are decided by the selected suppliers. The negotiation between the manufacturer and the retailer is based on buyback contracts. Due to asymmetric information, the quality information of components purchased from suppliers is unknown for the manufacturer. Thus, two scenarios are investigated for the manufacturer to estimate uncertainty of risk. The problem is analysed by a Stackelberg game where the manufacturer is a leader and the suppliers are followers. An optimization approach is proposed to solve the problem under demand uncertainty. A Stackelberg equilibrium is obtained by the proposed solution approach. Computational experiments are conducted to illustrate the features of the proposed models with different parameters. The results show the validity of the proposed model. (C) 2014 Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/3.0/).

    DOI: 10.1016/j.procir.2014.01.109

    Web of Science

    researchmap

  • A practical model of routing problems for automated guided vehicles with acceleration and deceleration 査読

    Tatsushi Nishi, Susumu Matsushita, Takeshi Hisano, Masahi Morikawa

    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING8 ( 5 )   2014年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JAPAN SOC MECHANICAL ENGINEERS  

    We consider an optimization of conflict-free routing problems for automated guided vehicles (AGV) with acceleration and deceleration. A continuous time model is developed to represent the dynamics of vehicles. In the proposed model, the transportation model is discretized into several regions. A network model is created by taking into account the acceleration and deceleration motions. The acceleration and deceleration are represented at curve locations. Column generation heuristic is used to find a near-optimal solution. In this algorithm, we construct a heuristic rule to generate a feasible solution with acceleration and deceleration of vehicles after the column generation. The pricing problem is represented by a resource constrained shortest path problem, which is effectively solved by a labeling algorithm The dominance relation for acceleration and deceleration is addressed. In the proposed model, the dynamics of real speed AGV model are reflected into the routing problems. By comparing the performance of the conventional method, the effectiveness of the proposed method is demonstrated.

    DOI: 10.1299/jamdsm.2014jamdsm0067

    Web of Science

    researchmap

  • Modeling and Solution of Practical Airline Crew Scheduling Problems 査読

    Yu Iijima, Tatsushi Nishi, Masahiro Inuiguchi, Satoru Takahashi, Kenji Ueda, Keiji Ojima

    Proceedings of 2013 IEEE International Conference on Industrial Engineering and Engineering Management   2013年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/IEEM.2013.6962386

    researchmap

  • Deadlock Avoidance Policy for Dual-armed Multi-cluster Tools with Multi-flow 査読

    Yushin Watanabe, Tatsushi Nishi

    Proceedings of 2013 IEEE International Conference on Industrial Engineering and Engineering Management   2013年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/IEEM.2013.6962484

    researchmap

  • Bilevel Decomposition Approach for Cyclic Staff Scheduling Problems 査読

    Tatsushi Nishi, Taichi Sugiyama

    Proceedings of Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA2013)   2013年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Lagrangian Relaxation and Cut Generation for Sequence Dependent Setup Time Flowshop Problems 査読

    Tatsushi Nishi, Yuichiro Hiranaka

    International Journal of Production Research   2013年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • Column Generation Heuristics to Route Planning Problems for Automated Guided Vehicles with Acceleration and Deceleration 査読

    Susumu Matsushita, Tatsushi Nish, Satomi Kataoka, Takeshi Hisano, Katsuhiko Matsumura

    Proceedings of International Symposium on Scheduling 2013   2013年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • A Game Theoretic Approach to Three-Echelon Supply Chains with Asymmetric Quality Information 査読

    Sisi Yin, Tatsushi Nishi, Guoqing Zhang

    Proceedings of International Symposium on Scheduling 2013   2013年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • A Game Theoretic Model to Manufacturing Planning with Single Manufacturer and Multiple Suppliers with Asymmetric Quality Information 査読

    Sisi Yin, Tatsushi Nishi

    Proceedings of 46th CIRP Conference on Manufacturing Systems 2013   2013年5月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • ペトリネットの分解アプローチによるデュアルアームクラスタツールのデッドロック回避スケジューリング 査読

    松本出, 西竜志, 乾口雅弘

    計測自動制御学会論文集   2013年4月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)  

    DOI: 10.9746/sicetr.49.479

    researchmap

  • グローバルサプライチェーンに関する研究動向

    西 竜志

    システム/制御/情報   2013年3月

     詳細を見る

    記述言語:日本語  

    DOI: 10.11509/isciesci.57.3_108

    researchmap

  • A Continuous Time Model of Multi-vehicle Routing Problems: A Column Generation Approach 査読

    Susumu Matsushita, Tatsushi Nishi, Masashi Morikawa, Takeshi Hisano

    2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013)   397 - 402   2013年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    In this paper, we propose a column generation heuristics to a continuous time model of conflict-free pickup and delivery vehicle routing problems. The transportation system is divided into several regions with regular intervals. A network model of conflict-free multi-vehicle routing problem with acceleration and deceleration motions is developed. A column generation heuristics is used to find a near-optimal solution. The pricing problem for each vehicle routing problem is formulated as a resource constrained shortest path problem, which is effectively solved by a labeling algorithm. Computational results demonstrate the effectiveness of the proposed method.

    DOI: 10.1109/SMC.2013.74

    Web of Science

    researchmap

  • A New Lagrangian Decomposition and Coordination Approach for Energy Portfolio and Production Planning for Multiple Companies 査読

    Eiji Sekiya, Tatsushi Nishi, Masahiro Inuiguchi

    Proceedings of International Conference on Industrial Engineering and Engineering Management   2012年12月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/IEEM.2012.6837966

    researchmap

  • A New Lagrangian Decomposition and Coordination Approach for Energy Portfolio and Production Planning for Multiple Companies 査読

    Eiji Sekiya, Tatsushi Nishi, Masahiro Inuiguchi

    Proceedings of International Conference on Industrial Engineering and Engineering Management 2012   2012年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/IEEM.2012.6837966

    researchmap

  • 労働条件の公平化を目的とした鉄道乗務割交番作成問題に対する分解法 査読

    杉山泰智, 西竜志, 乾口雅弘, 高橋理, 上田健詞

    システム制御情報学会論文誌   2012年10月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ISCIE  

    DOI: 10.5687/iscie.25.272

    researchmap

  • Petri Net Decomposition Approach for Dispatching and Conflict-Free Routing of Bidirectional Automated Guided Vehicle Systems 査読

    Tatsushi Nishi, Yuki Tanaka

    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS42 ( 5 ) 1230 - 1243   2012年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC  

    In this paper, we address a Petri net decomposition approach for simultaneous dispatching and conflict-free routing for bidirectional automated guided vehicle (AGV) systems in dynamic environments. To solve the dynamic problem, static problems for finding near-optimal dispatching and conflict-free routing are solved each time when transportation requests are given. The static problem is converted to an optimal firing sequence problem for a timed Petri net. A Petri net decomposition approach is applied to solve the problem efficiently. In the algorithm, the entire Petri net is decomposed into task and AGV subnets. The penalty function method is used to derive a solution for all subnets. A deadlock avoidance method is embedded in the proposed methodology to ensure the feasibility and the quality of the solution. Computational results show that the proposed method with a deadlock avoidance algorithm efficiently maximizes the throughput for dynamic situations.

    DOI: 10.1109/TSMCA.2012.2183353

    Web of Science

    researchmap

  • 鉄道交通における最適化技術の応用 査読

    高橋理, 西竜志

    システム/制御/情報   2012年8月

     詳細を見る

    記述言語:日本語   出版者・発行元:ISCIE  

    DOI: 10.11509/isciesci.56.8_454

    researchmap

  • Column Generation for Split Pickup and Delivery Vehicle Routing Problem for Crude Oil Transportation 査読

    Tsukasa Izuno, Tatsushi Nishi, Sisi Yin

    Proceedings of International Symposium on Flexible Automation   2012年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:ASME  

    DOI: 10.1115/ISFA2012-7169

    researchmap

  • A Heuristic Approach for International Crude Oil Transportation Scheduling Problems 査読

    Sisi Yin, Tatsushi Nishi, Tsukasa Izuno

    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING6 ( 5 ) 687 - 702   2012年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JAPAN SOC MECHANICAL ENGINEERS  

    In this paper, we propose a heuristic algorithm to solve a practical ship scheduling problem for international crude oil transportation. The problem is considered as a vehicle routing problem with split deliveries. The objective of this paper is to find an optimal assignment of tankers, a sequence of visiting and loading volume simultaneously in order to minimize the total distance satisfying the capacity of tankers. A savings-based meta-heuristic algorithm with lot sizing parameters and volume assignment heuristic is developed. The proposed method is applied to solve a case study with real data. Computational results demonstrate the effectiveness of the heuristic algorithm compared with that of human operators.

    DOI: 10.1299/jamdsm.6.687

    Web of Science

    researchmap

  • Game Theoretic Approach for Global Manufacturing Planning Under Risk and Uncertainty 査読

    S. Yin, T. Nishi

    45TH CIRP CONFERENCE ON MANUFACTURING SYSTEMS 20123   251 - 256   2012年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:ELSEVIER SCIENCE BV  

    In this paper, we present a game theoretic model in which one manufacturer and its suppliers are coordinated. Quality levels of products from suppliers are considered. Due to fluctuation of demand resulting from varying quality levels, manufacturers are subject to demand-side risks. The objective of the research is to help decision making between manufacturers and suppliers in order to improve level of quality. Stackelberg game is applied to coordinate the manufacturer and suppliers Then, Pareto efficient solutions are utilized to generate supplier's optimal response functions. Computational experiments are conducted to demonstrate the effectiveness of the proposed method. (c) 2012 The Authors. Published by Elsevier B.V. Selection and/or peer-review under responsibility of Professor D. Mourtzis and Professor G. Chryssolouris.

    DOI: 10.1016/j.procir.2012.07.044

    Web of Science

    researchmap

  • Distributed Optimization of Energy Portfolio and Production Planning for Multiple Companies Under Resource Constraints 査読

    T. Nishi, E. Sekiya, S. Yin

    45TH CIRP CONFERENCE ON MANUFACTURING SYSTEMS 20123   275 - 280   2012年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:ELSEVIER SCIENCE BV  

    In this paper, we propose a distributed optimization approach to energy portfolio and production planning for multiple companies. The production planning problem for multiple companies with the selection of electricity procurement contracts under energy resource constraints is formulated as a mixed integer nonlinear programming problem. A Lagrangian decomposition and coordination technique is applied to solve the problem. The original problem is decomposed into several subproblems. Heuristics are applied to generate a feasible solution. Computational results show the proposed method can solve the problem effectively within a reasonable computation time. (c) 2012 The Authors. Published by Elsevier B.V. Selection and/or peer-review under responsibility of Professor D. Mourtzis and Professor G. Chryssolouris.

    DOI: 10.1016/j.procir.2012.07.048

    Web of Science

    researchmap

  • Petri net decomposition approach to deadlock-free scheduling for dual-armed cluster tools 査読

    Izuru Matsumoto, Tatsushi Nishi

    IEEE International Conference on Automation Science and Engineering   194 - 199   2012年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    Semiconductor cluster tools are used to process a variety of silicon wafers for the fabrication of microelectronic components. The cluster tool system consists of several loadlock modules, processing devices, and material handling armed robots for transferring wafers between them. In order to improve total throughput of cluster tools, a deadlock-free scheduling is highly required for various types of wafer flow patterns or various equipment configurations. In this paper, we propose a Petri net decomposition approach to the optimization of scheduling of dual-armed cluster tools for semiconductor manufacturing. A timed Petri net model is introduced to represent scheduling problems for dual-armed cluster tools. In order to obtain a deadlock-free schedule, we develop a deadlock avoidance control policy that restricts the marking to prevent unmarked siphons. The developed control policy is combined with the Petri net decomposition approach to generate a feasible solution. Computational results show the effectiveness of the proposed method combined with deadlock avoidance policy. © 2012 IEEE.

    DOI: 10.1109/CoASE.2012.6386362

    Scopus

    researchmap

  • A bilevel decomposition approach to railway crew rostering problems for fair labor condition 査読

    Taichi Sugiyama, Tatsushi Nishi, Masahiro Inuiguchi, Satoru Takahashi, Kenji Ueda

    IEEE International Conference on Automation Science and Engineering   383 - 389   2012年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    The railway crew rostering problem is a scheduling problem to find a set of rosters that is feasible assignment of crew duties satisfying several labor conditions. We propose a novel decomposition approach to solve railway crew rostering problems with the objective of fair labor condition in order to reduce the computational effort. The upper level master problem determines an assignment of crew duties to the set of rosters and the lower level subproblem generates a feasible sequence of rosters including several labor conditions. The effective cuts are proposed to reduce feasible search space to tighten the duality gap between solutions of two level problems. Computational results demonstrate the effectiveness of the proposed method compared with that of the constraint programming technique. © 2012 IEEE.

    DOI: 10.1109/CoASE.2012.6386407

    Scopus

    researchmap

  • Petri Net Decomposition Approach for Bi-Objective Routing for AGV Systems Minimizing Total Traveling Time and Equalizing Delivery Time 査読

    Shuhei Eda, Tatsushi Nishi, Toshisada Mariyama, Satomi Kataoka, Kazuya Shoda, Katsuhiko Matsumura

    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING6 ( 5 ) 672 - 686   2012年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JAPAN SOC MECHANICAL ENGINEERS  

    In this paper, we propose Petri net decomposition approach for bi-objective optimization of conflict-free routing for AGV systems. The objective is minimizing total traveling time and equalizing delivery time simultaneously. The dispatching and conflict-free routing problem for AGVs is represented as a bi-objective optimal firing sequence problem for Petri Net. A Petri net decomposition approach is proposed to solve the bi-objective optimization problem efficiently. The convergence of the proposed algorithm is improved reducing search region by the proposed coordination method. The effectiveness of the proposed method is compared with that of a nearest neighborhood dispatching method. Computational results are provided to show the effectiveness of the proposed method.

    DOI: 10.1299/jamdsm.6.672

    Web of Science

    researchmap

  • Game Theoretic Approach for Global Manufacturing Planning 査読

    Sisi Yin, Tatsushi Nishi

    Proceedings of the 2011 International Conference on Advances in Supply Chain and Manufacturing Management   2011年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • An integrated column generation and Lagrangian relaxation for solving flowshop problems to minimize the total weighted tardiness, International Journal of Innovative Computing , Information and Control 査読

    Tatsushi Nishi, Yukinori Isoya, Masahiro Inuiguchi

    International Journal of Innovative Computing , Information and Control   2011年11月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ICIC International  

    researchmap

  • Petri Net Decomposition Approach for Bi-objective Conflict-free Routing for AGV Systems 査読

    Shuhei Eda, Tatsushi Nishi, Toshisada Mariyama, Satomi Kataoka, Kazuya Shoda, Katsuhiko Matsumura

    Proceedings of 2011 IEEE International Conference on Systems, Man and Cybernetics   2011年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/ICSMC.2011.6083754

    researchmap

  • Column Generation for Sequence Dependent Flowshop Scheduling to Minimize the Total Weighted Tardiness 査読

    Tatsushi Nishi, Yukinori Isoya, Masahiro Inuiguchi

    Proceedings of 2011 IEEE International Conference on Systems, Man and Cybernetics   2011年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/ICSMC.2011.6083859

    researchmap

  • Facility Location and Distribution Planning with Multiple Transport Alternatives 査読

    Yosuke Takano, Tatsushi Nishi, Masahiro Inuiguchi

    Proceedings of SICE Annual Conference 2011   2011年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)   出版者・発行元:SICE  

    researchmap

  • Column Generation for the Train-set Scheduling Problem with Regular Maintenance Constraints 査読

    Akiyoshi Ohno, Tatsushi Nishi, Masahiro Inuiguchi

    Proceedings of the International Symposium on Scheduling, pp. 231-234   2011年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:JSME  

    researchmap

  • 離散事象システムの分解と調整による大規模システムの最適化 招待 査読

    西 竜志

    計測と制御   2011年7月

     詳細を見る

    記述言語:日本語  

    researchmap

  • Heuristics for Mathematical Programming Based Railway Crew Scheduling 査読

    Kenji Ueda, Satoru Takahashi, Tatsushi Nishi

    Proceedings of the International Symosium on Scheduling 2011, pp. 213-218   2011年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:JSME  

    researchmap

  • Petri Net Decomposition Approach for AGV Systems to Minimize the Deviation of Delivery Time and Total Transportation Time 査読

    Shuhei Eda, Tatsushi Nishi, Toshisada Mariyama, Satomi Kataoka, Kazuya Shoda, Katsuihiko Matsumura

    Proceedings of the International Symposium on Scheduling 2011, pp. 155-160   2011年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:JSME  

    researchmap

  • A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles 査読

    Tatsushi Nishi, Yuichiro Hiranaka, Ignacio E. Grossmann

    COMPUTERS & OPERATIONS RESEARCH38 ( 5 ) 876 - 888   2011年5月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:PERGAMON-ELSEVIER SCIENCE LTD  

    We address a bilevel decomposition algorithm for solving the simultaneous scheduling and conflict-free routing problems for automated guided vehicles. The overall objective is to minimize the total weighted tardiness of the set of jobs related to these tasks. A mixed integer formulation is decomposed into two levels: the upper level master problem of task assignment and scheduling; and the lower level routing subproblem. The master problem is solved by using Lagrangian relaxation and a lower bound is obtained. Either the solution turns out to be feasible for the lower level or a feasible solution for the problem is constructed, and an upper bound is obtained. If the convergence is not satisfied, cuts are generated to exclude previous feasible solutions before solving the master problem again. Two types of cuts are proposed to reduce the duality gap. The effectiveness of the proposed method is investigated from computational experiments. (C) 2010 Elsevier Ltd. All rights reserved.

    DOI: 10.1016/j.cor.2010.08.012

    Web of Science

    researchmap

  • Supply Chain Coordination under Demand Uncertainty with Quantity Discount Contract 査読

    Sisi Yin, Tatsushi Nishi

    CAPD Annual Meeting 2011   2011年3月

     詳細を見る

    記述言語:英語  

    researchmap

  • Column generation with dual inequalities for railway crew scheduling problems

    Tatsushi Nishi, Yuki Muroi, Masahiro Inuiguchi

    Public Transport3 ( 1 ) 25 - 42   2011年2月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    The railway crew scheduling problem is to determine an optimal crew assignment for the railway timetable data by minimizing the required number of crew members in order to satisfy the set covering constraints. Column generation is one of the optimization methods that can solve the problem efficiently. In order to improve the convergence of column generation, we propose dual inequalities for a Dantzig-Wolfe decomposition of railway crew scheduling problems to reduce the number of replications in the column generation procedure. The dual inequalities are generated from the characteristic of the given railway timetable data. Computational results demonstrate the effectiveness of the proposed method compared with the conventional column generation for an actual railway timetable data. © 2011 Springer-Verlag.

    DOI: 10.1007/s12469-011-0037-x

    Scopus

    researchmap

  • Mathematical Programming and Heuristics Approach for Railway Crew Scheduling Problems 査読

    Kenji Ueda, Satoru Takahashi, Tatsushi Nishi

    Proceedings of the RailRome 2011   2011年1月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)  

    researchmap

  • Column generation approach to ship scheduling problems for international crude oil transportation 査読

    Tatsushi Nishi, Sisi Yin, Tsukasa Izuno

    IEEE International Conference on Automation Science and Engineering   468 - 473   2011年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    Nowadays, the new trend of global economy has driven the business strategy from the local to the global supply chain optimization. The comprehensive logistics solutions are critical to integrate supply chain management in the global landscape. We propose a column generation algorithm to solve the ship scheduling problem for international crude oil distribution. The problem is to find an optimal assignment and sequence and loading volume of demand simultaneously in order to minimize the total distance satisfying the capacity of the tankers. The problem can be generalized as split delivery routing problem. In this paper, an efficient algorithm by using the column generation is developed to generate a feasible solution taking into account for several practical constraints. The performance of the proposed method is compared with a heuristic algorithm and that of human operators. Computational results demonstrate the effectiveness of the proposed algorithm for a real case study. © 2011 IEEE.

    DOI: 10.1109/CASE.2011.6042414

    Scopus

    researchmap

  • 実乗務制約を有する鉄道乗務員運用計画問題に対する列生成法の適用 査読

    西竜志, 室井裕喜, 乾口雅弘, 高橋理, 片岡健司

    電気学会論文誌C131 ( 6 ) 1199 - 1208   2011年

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:電気学会  

    DOI: 10.1541/ieejeiss.131.1199

    Scopus

    researchmap

  • 数量割引を考慮した不確定需要下におけるサプライチェーン計画問題の解法 査読

    西竜志, 殷思思, 山崎修平

    日本機械学会論文誌C77 ( 784 ) 4325 - 4338   2011年

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JSME  

    DOI: 10.1299/kikaic.77.4325

    Scopus

    researchmap

  • Petri Net Decomposition for Deadlock Avoidance Routing for Bi-directional AGV Systems 査読

    Tatsushi Nishi, Yuki Tanaka, Yukinori Isoya

    Proceedings of the IEEE International Conference on Systems, Man and Cybernetics 2010   2010年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)   出版者・発行元:IEEE  

    DOI: 10.1109/ICSMC.2010.5641942

    researchmap

  • Petri Net Decomposition Approach to Optimization of Route Planning Problems for AGV Systems 査読

    Tatsushi Nishi, Ryota Maeno

    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING7 ( 3 ) 523 - 537   2010年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC  

    In this paper, we propose a Petri Net (PN) decomposition approach to the optimization of route planning problems for automated guided vehicles (AGVs) in semiconductor fabrication bays. An augmented PN is developed to model the concurrent dynamics for multiple AGVs. The route planning problem to minimize the total transportation time is formulated as an optimal transition firing sequence problem for the PN. The PN is decomposed into several subnets such that the subnets are made independent by removing the original shared places and creating its own set of resource places for each subnet with the appropriate connections. The partial solution derived at each subnet is not usually making a feasible solution for the entire PN. The penalty function algorithm is used to integrate the solutions derived at the decomposed subnets. The optimal solution for each subnet is repeatedly generated by using the shortest-path algorithm in polynomial time with a penalty function embedded in the objective function. The effectiveness of the proposed method is demonstrated for a practical-sized route planning problem in semiconductor fabrication bay from computational experiments.
    Note to Practitioners-For rapid growth of transportation systems for semiconductor fabrication bay, it is required to generate a collision-free route planning for multiple AGVs efficiently to minimize the total traveling time. Conventional decomposition techniques for mathematical programming need reformulation of the original problem when new constraints are added, that makes it extremely difficult to modify the optimization model. PNs can be used as a tool to integrate modeling, simulation, and optimization for designing transportation systems. This paper presents a modeling and optimization of route planning for multiple AGVs by PN. The main difficulty for optimization is the state explosion for PN. To reduce computational complexity, we propose a PN decomposition approach for solving large-scale optimization problems efficiently. The PN model is partitioned into several decomposed subnets. The local solutions of the subnets are integrated by the novel optimization algorithm. The shorter computation time by the proposed method enables us to use the proposed methodology for the rapid design and dynamic optimization for AGVs transportation systems in semiconductor manufacturing.

    DOI: 10.1109/TASE.2010.2043096

    Web of Science

    researchmap

  • A Cut and Column Generation for Flowshop Scheduling Problems to Minimize the Total Weighted Tardiness 査読

    Yukinori Isoya, Tatsushi Nishi, Masahiro Inuiguchi

    Proceedings of 2010 8th IEEE International Conference on Industrial Informatics, pp. 839-844   2010年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/INDIN.2010.5549634

    researchmap

  • Quantity Discount Supply Chain Optimization under Demand Uncertainty 査読

    Sisi Yin, Tatsushi Nishi

    Proceedings of 2010 International Symposium on Flexible Automation, JPL-2545   2010年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)   出版者・発行元:ISCIE  

    researchmap

  • On Pricing Decisions for Supply Chain with Risky Supplier 査読

    Tatsushi Nishi, Yuzo Tamanishi, Yukinori Isoya

    Proceedings of 2010 8th IEEE International Conference on Industrial Informatics   2010年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:ISCIE  

    researchmap

  • Dynamic Optimization of Simultaneous Dispatching and Conflict-free Routing for Automated Guided Vehicles - Petri Net Decomposition Approach 査読

    Yuki Tanaka, Tatsushi Nishi, Masahiro Inuiguchi

    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING4 ( 3 ) 701 - 715   2010年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JAPAN SOC MECHANICAL ENGINEERS  

    In this paper, we propose an application of Petri Net decomposition approach for the simultaneous optimization of dispatching and conflict-free routing for automated guided vehicles in the dynamic situation where transport requests are given in real time. The objective is to maximize the total throughput of the AGV transport system during the time horizon. In order to solve the dynamic problem, static problems are periodically solved when the transport requests are given to the AGV system. The dispatching and conflict-free routing are simultaneously optimized by the Petri Net decomposition approach. In the proposed method, the Petri Net is decomposed into several subnets for task subproblems and AGV subproblems that can be solved by the shortest path algorithm on the reachability graph. The local solutions for the subnets are coordinated by a penalty function algorithm. To ensure the generation of conflict-free routing, a new deadlock avoidance strategy is incorporated in the optimization algorithm. The effects of simultaneous optimization of dispatching and conflict-free routing are investigated for routing problems in dynamic environments.

    DOI: 10.1299/jamdsm.4.701

    Web of Science

    researchmap

  • 鉄道乗務員スケジューリング問題に対する列生成法の収束性改善 査読

    室井裕喜, 西竜志, 乾口雅弘

    電気学会論文誌C130 ( 2 ) 275 - 283   2010年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:電気学会  

    DOI: 10.1541/ieejeiss.130.275

    Scopus

    researchmap

  • An optimisation model and its effective beam search heuristics for floor-storage warehousing systems 査読

    T. Nishi, M. Konishi

    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH48 ( 7 ) 1947 - 1966   2010年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:TAYLOR & FRANCIS LTD  

    This paper presents an optimisation model and its effective solution technique using beam search heuristic for floor-storage warehousing systems. For a floor-storage system, storage can be accessed from the top of stacks only. The objective is to minimise the number of re-handling operations by optimally determining the storage location and by grouping products for each customer that fit a given sequence for receiving and retrieving operations. An integer programming model is formulated and an approximate solution technique based on the beam search method is proposed to solve the problem by incorporating effective heuristics to reduce the search space using future receiving and retrieving requests. The effectiveness of the proposed method is demonstrated for industrial warehousing problems in a steel plant with 58 storage areas involving more than 3000 retrieving operations. The proposed solution method is shown to be more efficient than the traditional branch-and-bound method for solving integer programming problems.

    DOI: 10.1080/00207540802603767

    Web of Science

    researchmap

  • An Integrated Column Generation and Lagrangian Relaxation for Flowshop Scheduling Problems 査読

    Tatsushi Nishi, Yukinori Isoya, Masahiro Inuiguchi

    Proceedings 2009 IEEE International Conference on Systems, Man and Cybernetics (SMC2009)   2009年10月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(その他学術会議資料等)  

    DOI: 10.1109/ICSMC.2009.5346159

    researchmap

  • A Decomposition Method for Optimal Firing Sequence Problems for First-order Hybrid Petri Nets 査読

    Tatsushi Nishi, Kenichi Shimatani, Masahiro Inuiguchi

    Proceedings 2009 IEEE International Conference on Systems, Man and Cybernetics, pp. 2854-2859   2009年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/ICSMC.2009.5345896

    researchmap

  • Lagrangian Relaxation and Cut Generation for Sequence Dependent Setup Time Flowshop Scheduling Problems 査読

    Tatsushi Nishi, Yuichiro Hiranaka

    Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory & Applications   2009年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Decomposition of Timed Automata for Solving Jobshop Scheduling Problems 査読

    Masao Wakatake, Tatsushi Nishi, Masahiro Inuiguchi

    Proceedings of ICROS-SICE International Joint Conference 2009   2009年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SICE  

    researchmap

  • Simultaneous Dispatching and Conflict-free Routing for Automated Guided Vehicles Using Petri Net Decomposition Approach 査読

    Yuki Tanaka, Tatsushi Nishi, Masahiro Inuiguchi

    Proceedings of International Symposium on Scheduling 2009   2009年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Improvement of Convergence of Column Generation for Railway Crew Scheduling Problem 査読

    Yuki Muroi, Tatsushi Nishi, Masahiro Inuiguchi

    Proceedings of International Symposium on Scheduling 2009   2009年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Column Generation with Dual Inequalities for Railway Crew Scheduling Problems 査読

    Tatsushi Nishi, Yuki Muroi, Masahiro Inuiguchi

    Proceedings of the 11th International Conference on Advanced Systems for Public Transport   2009年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • 時間オートマトンの分解と調整によるフローショップ問題の解法 査読

    若竹雅人, 西竜志, 乾口雅弘

    計測自動制御学会論文集   2009年7月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)  

    DOI: 10.9746/sicetr.45.369

    researchmap

  • ペトリネットの分解によるAGVのタスク割当てと経路計画の同時最適化 査読

    田中友貴, 西竜志, 乾口雅弘

    システム制御情報学会論文誌22 ( 5 ) 191 - 198   2009年5月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)  

    DOI: 10.5687/iscie.22.191

    researchmap

  • Decomposition of Petri nets and Lagrangian relaxation for solving routing problems for AGVs 査読

    Tatsushi Nishi, Kenichi Shimatani, Masahiro Inuiguchi

    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH47 ( 14 ) 3957 - 3977   2009年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:TAYLOR & FRANCIS LTD  

    In this paper, we propose a Lagrangian relaxation method for solving routing problems for multiple AGVs by decomposition of timed Petri nets. The AGV routing problem is represented by an optimal transition firing sequence problem for timed Petri nets. The timed Petri net is decomposed into several subnets in which the subproblem for each subnet can be easily solved by Dijkstra's algorithm. We show that each subproblem generated by each subnet is polynomially solvable. The optimality of the solution can be evaluated by the duality gap derived by the Lagrangian relaxation method. The performance of the proposed method is compared with a conventional optimisation algorithm with the penalty function method. The effectiveness of the proposed method is demonstrated.

    DOI: 10.1080/00207540701846244

    Web of Science

    researchmap

  • Decomposition of Timed Automata for Solving Scheduling Problems 査読

    Tatsushi Nishi, Masao Wakatake, Masahiro Inuiguchi

    Proceedings of 2008 IEEE International Conference on Systems, Man and Cybernetics   2008年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICSMC.2008.4811664

    researchmap

  • Petri Net Decomposition Approach for the Simultaneous Optimization for Task Assignment and Routing for Automated Guided Vehicles 査読

    Tatsushi Nishi, Yuki Tanaka, Masahiro Inuiguchi

    Proceedings of 2008 IEEE International Conference on Automation Science and Engineering   2008年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/COASE.2008.4626458

    researchmap

  • Lagrangian Relaxation Approach for Optimal Firing Sequence Problems by Decomposition of Timed Petri Nets 査読

    Tatsushi Nishi, Kenichi Shimatani, Masahiro Inuiguchi

    Proceedings of 2008 SICE Annual Conference in Chofu   2008年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/SICE.2008.4654914

    researchmap

  • Lagrangian Relaxation Technique for Solving Scheduling Problems by Decomposition of Timed Petri Nets 査読

    Tatsushi Nishi, Kenichi Shimatani, Masahiro Inuiguchi

    Preprints of IFAC 2008 World Congress   2008年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.3182/20080706-5-KR-1001.2316

    researchmap

  • A Distributed Optimization Method for Cross Docking Systems 査読

    Tatsushi Nishi

    Proceedings of 2008 International Symposium on Flexible Automation   2008年5月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • An augmented Lagrangian approach for distributed supply chain planning for multiple companies 査読

    Tatsushi Nishi, Ryuichi Shinozaki, Masarni Konishi

    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING5 ( 2 ) 259 - 274   2008年4月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC  

    Planning coordination for multiple companies has received much attention from viewpoints of global supply chain management. In practical situations, a plausible plan for multiple companies should be created by mutual negotiation and coordination without sharing such confidential information as inventory costs, setup costs, and due date penalties for each company. In this paper, we propose a framework for distributed optimization of supply chain planning using an augmented Lagrangian decomposition and coordination approach. A feature of the proposed method is that it can derive a near-optimal solution without requiring all of the information. The proposed method is applied to supply chain planning problems for a petroleum complex, and a midterm planning problem for multiple companies. Computational experiments demonstrate that the average gap between a solution derived by the proposed method and the optimal solution is within 3% of the performance index, even though only local information is used to derive a solution for each company.
    Note to Practitioners-Supply Chain Management (SCM) has received much attention with growing mass customization and global market demands. The global performance of SCM is achieved through cooperation and interaction among several organizations. For the petroleum industry, multiple companies within a chemical complex are depending on their suppliers to provide raw materials or intermediates through a pipeline connected with multiple companies to provide efficient delivery with lower costs. In most plants, production instructions are given to each production section in each company. Each company is thoroughly capable in regard to its own production planning and scheduling. Therefore, each company may have its own desirable supply and demand plan for each section. The supply and demand plan must be coordinated by mutual negotiations across the supply chain. Such coordination has been performed by the communications among human operators. However, in recent years, the decision making for each company is becoming increasingly complex with the increase of the number of alternative for the plan with a number of partner companies. Conventional planning systems has been configured to obtain a near-optimal plan using the detailed information about multiple companies. However, organizations generally have their own private coordination methods, and that accessing others' private information or intruding on their decision-making authority should be avoided. In practical situations, a plan must be created without sharing such confidential information as production costs, inventory holding costs, or price of products for competitive companies. In this paper, we propose a framework for distributed supply chain planning system without requiring all of information for multiple companies. Planning coordination can be efficiently automated by the proposed system. Computational experiments demonstrate that the performance of the solution is 3% of gap from an optimal solution with a reasonable computation time, even though only local information is used to derive a solution for each company.

    DOI: 10.1109/TASE.2007.894727

    Web of Science

    researchmap

  • Effects of Inventory Control on Bullwhip in Supply Chain Planning for Multiple Companies 査読

    Haruhiko Tominaga, Tatsushi Nishi, Masami Konishi

    International Journal of Innovative Computing, Information and Control   2008年3月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ICIC International  

    researchmap

  • Force Display for Master Slave Manipulator with Different Configurations 査読

    Satoshi Ikegami, Tatsushi Nishi, Masami Konishi

    International Journal of Innovative Computing, Information and Control   2008年3月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ICIC International  

    researchmap

  • Distributed Optimization Method for Simultaneous Production Scheduling and Transportation Routing in Semiconductor Fabrication Bays 査読

    Takahiro Furusho, Tatsushi Nishi, Masami Konishi

    International Journal of Innovative Computing, Information and Control   2008年3月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ICIC International  

    researchmap

  • Petri net solver for semiconductor manufacturing plan 査読

    Ryota Maeno, Masami Konishi, Jun Imai, Tatsushi Nishi

    Second International Conference on Innovative Computing, Information and Control, ICICIC 2007   2008年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    Petri net model is a widely used versatile tool which can represent a discrete event system such as mechanical system, communication system, and production system. The merit of this model is easiness in handling. Other merit of the model is descriptive easiness in parallel, synchronous operations. In addition, it is applicable to a wide variety of discrete event system due to its excellence in the analytical ability and the handling ability. In this paper, application of Petri net solver by decomposition to the Semiconductor Manufacturing. Numerical results showed the practicability of the proposed method. © 2007 IEEE.

    DOI: 10.1109/ICICIC.2007.451

    Scopus

    researchmap

  • An Autonomous Distributed Route Planning Method for Multiple Mobile Robots

    Masakazu ANDO, Tatsushi NISHI, Masami KONISHI, Jun IMAI

    Transactions of the Society of Instrument and Control Engineers, Volume E   2007年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    researchmap

  • ラグランジュ緩和とカット生成による生産工程と複数台搬送車の同時スケジューリング問題に対する分解法 査読

    平中雄一朗, 西竜志, 乾口雅弘

    システム制御情報学会論文誌20 ( 12 ) 465 - 474   2007年12月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ISCIE  

    DOI: 10.5687/iscie.20.465

    researchmap

  • A Decomposition Method for MIQP Problem and its Application to Supply Chain Planning 査読

    Shu Yamasaki, Tatsushi Nishi, Masahiro Inuiguchi

    Proceedings of the 7th International Conference on Optimization: Techniques and Application (ICOTA7)   2007年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Successive Lagrangian Approach for Flowshop Scheduling Problems to Minimize the Total Weighted Tardiness

    Yuichiro Hiranaka, Tatsushi Nishi, Masahiro Inuiguchi

    Proceedings of the 7th International Conference on Optimization Technique and Applications   2007年12月

     詳細を見る

    記述言語:英語  

    researchmap

  • A distributed routing method for AGVs under motion delay disturbance 査読

    Tatsushi Nishi, Shoichiro Morinaka, Masami Konishi

    ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING23 ( 5 ) 517 - 532   2007年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:PERGAMON-ELSEVIER SCIENCE LTD  

    In real transportation environments for semi-conductor manufacturing, unexpected disturbances such as motion delays and/or sudden requests for transportation may cause collisions among AGVs increasing total transportation time. It is required to generate a collision-free routing for multiple automated guided vehicles (AGVs) within a few seconds. In this paper, we propose a distributed routing method under motion delay disturbance for multiple AGVs. The proposed method features a characteristic that each AGV subsystem derives its optimal route to minimize the sum of the transportation time and the penalties with respect to collision probability with other AGVs. The penalties reflect the collision probability distribution function for motion delay disturbances. The proposed method is applied to a routing problem for transportation in the semiconductor fabrication bay with 143 nodes and 20 AGVs. The computational results show that the total transportation time obtained by the proposed method is shorter than that of the conventional method. For dynamic transportation environments, an optimal timing for re-routing multiple AGVs under motion delay disturbance is systematically determined by the tradeoff relationship between the total computation time to derive a solution and the uncertainties for re-routings. Markov chain is used to represent uncertainty distribution for re-routings. The proposed method is implemented in an experimental transportation system with 51 nodes and 5 AGVs. The experimental results demonstrate that the proposed method is applicable to real transportation environments. (C) 2006 Elsevier Ltd. All rights reserved.

    DOI: 10.1016/j.rcim.2006.10.007

    Web of Science

    researchmap

  • A distributed decision making system for integrated optimization of production scheduling and distribution for aluminum production line 査読

    Tatsushi Nishi, Masami Konishi, Masatoshi Ago

    COMPUTERS & CHEMICAL ENGINEERING31 ( 10 ) 1205 - 1221   2007年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:PERGAMON-ELSEVIER SCIENCE LTD  

    A distributed decision making system for integrated optimization of production scheduling and distribution planning is proposed. The system consists of several subsystems that individually derive the solution of its own subproblem to minimize the objective function obtained by decomposing the problem using an augmented Lagrangian decomposition and coordination technique. The proposed approach is applied to planning and scheduling for an aluminum rolling processing line. Decision variables such as arrival date of raw materials, lot-sizing, production scheduling, and allocation of products to warehouses are optimized simultaneously by repeating local optimization in material resource planning, and scheduling subsystem for each production process and warehouse planning subsystem. The effectiveness of the proposed approach is demonstrated. (c) 2006 Elsevier Ltd. All rights reserved.

    DOI: 10.1016/j.compchemeng.2006.10.006

    Web of Science

    researchmap

  • A Successive Lagrangian Relaxation Method for Solving Flowshop Scheduling Problems with Total Weighted Tardiness 査読

    Tatsushi Nishi, Yuichiro Hiranaka, Masahiro Inuiguchi

    Proceedings of the 3rd Annual Conference on Automation Science and Engineering   2007年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/COASE.2007.4341703

    researchmap

  • A Decomposition Method with Cut Generation for Simultaneous Production Scheduling and Routing for Mulple AGVs 査読

    Tatsushi Nishi, Yuichiro Hiranaka, Masahiro Inuiguchi, Ignacio Grossmann

    Proceedings of the 3rd Annual Conference on Automation Science and Engineering   2007年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/COASE.2007.4341680

    researchmap

  • A Study on the Decomposition of Transition Firing Sequence Problems for Petri Nets 査読

    Shun Yoshie, Tatsushi Nishi, Masahiro Inuiguchi

    Proceedings of SICE Annual Conference 2007   2007年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SICE  

    DOI: 10.1109/SICE.2007.4421043

    researchmap

  • General Decomposition Technique for Solving Scheduling Problems

    Tatsushi Nishi

    Proceedings of 22nd European Conference on Operational Research   2007年7月

     詳細を見る

    記述言語:英語  

    researchmap

  • 時間ペトリネットの分解と調整によるスケジューリング問題の解法 査読

    西 竜志, 前野 良太

    計測自動制御学会論文集43 ( 4 ) 338 - 345   2007年4月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:SICE  

    DOI: 10.9746/ve.sicetr1965.43.338

    researchmap

  • Decomposition of timed Petri Nets for Solving Scheduling Problems with Multiple Entities 査読

    Tatsushi Nishi

    Proceedings of the 8th International Symposium on Autonomous Decentralized Systems   2007年3月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ISADS.2007.28

    researchmap

  • 単一工程生産システムのサプライチェーンを対象とした不確定需要に対する在庫管理手法 査読

    西 竜志, 冨永晴彦, 小西正躬

    システム制御情報学会論文誌   2007年1月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ISCIE  

    DOI: 10.5687/iscie.20.1

    researchmap

  • Petri Net Modeling and Decomposition Method for Solving Production Scheduling Problems 査読

    Tatsushi Nishi, Ryota Maeno

    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING1 ( 2 ) 262 - 271   2007年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JAPAN SOC MECHANICAL ENGINEERS  

    Considering the need to develop general scheduling problem solver, the recent integration of Petri Nets as modeling tools into effective optimization methods for scheduling problems is very promising. The paper addresses a Petri Net modeling and decomposition method for solving a wide variety of scheduling problems. The scheduling problems are represented as the optimal transition firing sequence problems for timed Petri Nets. The Petri Net is decomposed into several subnets in which each subproblem can be easily solved by Dijkstra' algorithm. The approach is applied to a flowshop scheduling problem. The performance of the proposed algorithm is compared with that of a simulated annealing method.

    DOI: 10.1299/jamdsm.1.262

    Web of Science

    researchmap

  • Simultaneous Optimization of Storage Allocation and Routing Problems for Belt-conveyor Transportation 査読

    Masatoshi Ago, Tatsushi Nishi, Masami Konishi

    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING1 ( 2 ) 250 - 261   2007年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JAPAN SOC MECHANICAL ENGINEERS  

    Raw materials for industrial steel-making plants need to be stored in material yards in order to satisfy various production requirements. The stored materials are supplied to production plants by belt-conveyors with multiple alternative transportation routes. The simultaneous optimization of the storage allocation and transportation routing for the raw materials yard is required for achieving production that is flexible to changes in demand. In this paper, we propose a Lagrangian decomposition and coordination approach for storage allocation and routing for a belt-conveyor transportation system to handle demand changes. The overall problem is decomposed into an allocation planning subproblem and a transportation routing subproblem. A near-optimal solution for allocation planning and transportation routing is derived by repeating each optimization of subproblems and multiplier updates. The effectiveness of the proposed approach is confirmed in numerical experiments.

    DOI: 10.1299/jamdsm.1.250

    Web of Science

    researchmap

  • Simultaneous Optimization of Storage Allocation and Routing Problems for Belt-conveyor Transportation 査読

    Masatoshi Ago, Tatsushi Nishi, Masami Konishi

    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING1 ( 2 ) 250 - 261   2007年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JAPAN SOC MECHANICAL ENGINEERS  

    Raw materials for industrial steel-making plants need to be stored in material yards in order to satisfy various production requirements. The stored materials are supplied to production plants by belt-conveyors with multiple alternative transportation routes. The simultaneous optimization of the storage allocation and transportation routing for the raw materials yard is required for achieving production that is flexible to changes in demand. In this paper, we propose a Lagrangian decomposition and coordination approach for storage allocation and routing for a belt-conveyor transportation system to handle demand changes. The overall problem is decomposed into an allocation planning subproblem and a transportation routing subproblem. A near-optimal solution for allocation planning and transportation routing is derived by repeating each optimization of subproblems and multiplier updates. The effectiveness of the proposed approach is confirmed in numerical experiments.

    DOI: 10.1299/jamdsm.1.250

    Web of Science

    researchmap

  • ラグランジュ緩和と自律分散? 招待

    西 竜志

    システム/制御/情報   2006年12月

     詳細を見る

    記述言語:日本語  

    researchmap

  • ペトリネットを用いたAGV経路計画問題の分解法による最適化 査読

    前野良太, 西竜志, 小西正躬

    システム制御情報学会論文誌   2006年11月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ISCIE  

    DOI: 10.5687/iscie.19.426

    researchmap

  • Decomposition of Petri Nets for Optimization of Routing Problem for AGVs in Semiconductor Fabrication Bays 査読

    Tatsushi Nishi, Ryota Maeno

    Proc. of IEEE International Conference on Automation Science and Engineering   2006年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/COASE.2006.326886

    researchmap

  • 遅延外乱による衝突回避を目的とした複数台AGVの分散型経路計画法 査読

    森中翔一郎, 西竜志, 小西正躬

    計測自動制御学会論文誌42 ( 9 ) 1042 - 1050   2006年9月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:SICE  

    DOI: 10.9746/sicetr1965.42.1042

    researchmap

  • Force Display for Master Slave Manipulator with Different Configurations 査読

    Satoshi Ikegami, Masami Konishi, Tatsushi Nishi

    Proc. 2006 International Symposium on Flexible Automation   2006年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:ISCIE  

    researchmap

  • Simultaneous Optimization of Production Schedule and Transportation by a Distributed Optimization System 査読

    Takahiro Furusho, Tatsushi Nishi, Masami Konishi, Jun Imai

    Proc. 2006 International Symposium on Flexible Automation   2006年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:ISCIE  

    researchmap

  • Effects of Inventory Control Method on Bullwhip in Supply Chain Planning for Multiple Companies 査読

    Haruhiko Tominaga, Tatsushi Nishi, Masami Konishi, Jun Imai

    Proc. 2006 International Symposium on Flexible Automation   2006年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:ISCIE  

    researchmap

  • アルミ工場を対象とした自律分散型スケジューリング手法によるロット編成とスケジュールの最適化 査読

    深山 隆幸, 西 竜志, 小西 正躬

    電気学会論文誌C部門誌126 ( 6 ) 771 - 779   2006年6月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:電気学会  

    DOI: 10.1541/ieejeiss.126.771

    researchmap

  • Decomposition of Petri Nets for Solving General Scheduling Problems 査読

    Tatsushi Nishi, Ryota Maeno, Masami Konishi

    Proc. International Symposium on Scheduling 2006   2006年6月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:JSME  

    researchmap

  • Experimental studies on a local rescheduling procedure for dynamic routing of autonomous decentralized AGV systems 査読

    T Nishi, M Ando, M Konishi

    ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING22 ( 2 ) 154 - 165   2006年4月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:PERGAMON-ELSEVIER SCIENCE LTD  

    This paper addresses a local rescheduling procedure for a distributed routing system of multiple Automated Guilided Vehicles in dynamic environments where the requests for transportation are given in real time. The effectiveness of the proposed method is investigated for a transportation system of 143 nodes and 10 30 AGV systems in a semi-conductor fabricating bay, A distributed and parallel routing system (DPRS) is implemented and tested on an experimental five mobile robot system, The results demonstrate that the proposed method can reduce the total computation time by 39% compared with the conventional method without lowering the performance level. It is also experimentally verified that the rescheduling procedure can deal with disturbances in a significantly short computation time. (c) 2005 Elsevier Ltd. All rights reserved.

    DOI: 10.1016/j.rcim.2005.02.010

    Web of Science

    researchmap

  • Distributed route planning for multiple mobile robots using an augmented Lagrangian decomposition and coordination technique 査読

    T Nishi, M Ando, M Konishi

    IEEE TRANSACTIONS ON ROBOTICS21 ( 6 ) 1191 - 1200   2005年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC  

    To enable efficient transportation in semiconductor fabrication bays, it is necessary to generate route planning of multiple automated guided vehicles (AGVs) efficiently to minimize the total transportation time without collision among AGVs. In this paper, we propose a distributed route-planning method for multiple mobile robots using an augmented Lagrangian decomposition and coordination technique. The proposed method features a characteristic that each AGV individually creates a near-optimal routing plan through repetitive data exchange among the AGVs and local optimization for each AGV. Dijkstra's algorithm is used for local optimization. The optimality of the solution generated by the proposed method is evaluated by comparing the solution with an optimal solution derived by solving integer linear programming problems. A near-optimal solution, within 3% of the average gap from the optimal solution for an example transportation system consisting of 143 nodes and 14 AGVs, can be derived in less than 5 s of computation lime for 100 types of requests. The proposed method is implemented in an experimental system with three AGVs, and the routing plan is derived in the configuration space, taking the motion of the robot into account. It is experimentally demonstrated that the proposed method is effective for various problems, despite the fact that each route for an AGV is created without minimizing the entire objective function.

    DOI: 10.1109/TRO.2005.853489

    Web of Science

    researchmap

  • A Dynamic Optimization Model for Storage Yard Logistic Systems 査読

    Masatoshi Ago, Tatsushi Nishi, Masami Konishi, Jun Imai

    Proc. SICE Annual Conference in Okayama 2005   2005年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SICE  

    researchmap

  • An Asynchronous Distributed Routing System for Multi-robot Cooperative Transportation 査読

    Tatsushi Nishi, Yoshitomi Mori, Masami Konishi, Jun Imai

    Proc. of the IEEE 2005 International Conference on Intelligent Robots and Systems   2005年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/IROS.2005.1545268

    researchmap

  • A Distributed Collision-free Routing System for Multiple AGVs under Disturbances 査読

    Shoichiro Morinaka, Tatsushi Nishi, Masami Konishi, Jun Imai

    Proc. SICE Annual Conference in Okayama 2005   2005年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SICE  

    researchmap

  • Regulation of Production Loads for Plural Furnaces in Cases of Demand Change 査読

    Kazuhiro Ishimaru, Masami Konishi, Jun Imai, Tatsushi Nishi

    Proc. SICE Annual Conference in Okayama 2005   2005年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SICE  

    researchmap

  • Fault Diagnosis of Looper Height Control System by Neural Network 査読

    Takashi Torigoe, Masami Konishi, Jun Imai, Tatsushi Nishi

    Proc. SICE Annual Conference in Okayama 2005   2005年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SICE  

    researchmap

  • Cooperative Motion Control of 2-DOF Robot Arms by Recurrent Neural Network 査読

    Yingda Dai, Masami Konishi, Jun Imai, Tatsushi Nishi

    Proc. SICE Annual Conference in Okayama 2005   2005年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SICE  

    researchmap

  • A Distributed Routing Method for Multiple AGVs for Motion Delay Disturbances 査読

    Shoichiro Morinaka, Tatsushi Nishi, Masami Konishi, Jun Imai

    Proc. of the IEEE 2005 International Conference on Intelligent Robots and Systems   2005年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/IROS.2005.1545271

    researchmap

  • Application of a neural network to the generation of a robot arm trajectory 査読

    Shuya Imajo, Masami Konishi, Tatsushi Nishi, Jun Imai

    Artificial Life and Robotics9 ( 3 ) 107 - 111   2005年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    We propose a neural network model generating a robot arm trajectory. The developed neural network model is based on a recurrent-type neural network (RNN) model calculating the proper arm trajectory based on data acquired by evaluation functions of human operations as the training data. A self-learning function has been added to the RNN model. The proposed method is applied to a 2-DOF robot arm, and laboratory experiments were executed to show the effectiveness of the proposed method. Through experiments, it is verified that the proposed model can reproduce the arm trajectory generated by a human. Further, the trajectory of a robot arm is successfully modified to avoid collisions with obstacles by a self-learning function. © ISAROB 2005.

    DOI: 10.1007/s10015-004-0334-4

    Scopus

    researchmap

  • On Regulator Design for Spatial Temperature Distribution using Finite-dimensional Modeling of Heat Equation 査読

    Jun Imai, Yasuaki Ando, Masami Konishi, Tatsushi Nishi

    Proc. IFAC05 16th World Congress   2005年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SICE  

    researchmap

  • Application of a neural network to the generation of a robot arm trajectory 査読

    Shuya Imajo, Masami Konishi, Tatsushi Nishi, Jun Imai

    Artificial Life and Robotics9 ( 3 ) 107 - 111   2005年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    We propose a neural network model generating a robot arm trajectory. The developed neural network model is based on a recurrent-type neural network (RNN) model calculating the proper arm trajectory based on data acquired by evaluation functions of human operations as the training data. A self-learning function has been added to the RNN model. The proposed method is applied to a 2-DOF robot arm, and laboratory experiments were executed to show the effectiveness of the proposed method. Through experiments, it is verified that the proposed model can reproduce the arm trajectory generated by a human. Further, the trajectory of a robot arm is successfully modified to avoid collisions with obstacles by a self-learning function. © ISAROB 2005.

    DOI: 10.1007/s10015-004-0334-4

    Scopus

    researchmap

  • An Augmented Lagrangian Approach to Scheduling Problems - Application to Total Weighted Tardiness Problems 査読

    Tatsushi Nishi, Masami Konishi

    JSME International Journal   2005年6月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JSME  

    DOI: 10.1299/jsmec.48.299

    researchmap

  • An Autonomous Decentralized Supply Chain Planning System for Multi-stage Production Processes 査読

    Tatsushi Nishi, Masami Konishi, Shinji Hasebe

    Journal of Intelligent Manufacturing   2005年6月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Springer  

    DOI: 10.1007/s10845-005-7022-7

    researchmap

  • An Augmented Lagrangian Approach for Decentralized Supply Chain Planning for Multiple Companies 査読

    Tatsushi Nishi, Masami Konishi, Ryuichi Shinozaki

    Proc. IEEE Conference on Systems, Man and Cybernetics 2005   2005年1月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SICE  

    researchmap

  • Fault Diagnosis for Electro-Mechanical System by Neural Network 査読

    Takashi Torigoe, Masami Konishi, Jun Imai, Tatsushi Nishi

    Proc. 10th International Symposium on Artificial Life and Robotics   2005年1月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Application of sequential quadratic programming method to temperature distribution control in reactor furnace 査読

    K Ishimaru, M Konishi, J Imai, T Nishi

    ISIJ INTERNATIONAL45 ( 3 ) 347 - 355   2005年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IRON STEEL INST JAPAN KEIDANREN KAIKAN  

    Recently, various studies have been undertaken to examine the inner furnace phenomena of a blast furnace. These studies are limited, however, to the evaluation of furnace performance while a designed method of furnace control remains unfulfilled. This paper proposes a method of estimating temperature distribution in a reactor furnace using boundary data in order to control inner target furnace temperature distribution. Initially, a simplified furnace simulation program for the calculation of inner furnace gas flow, pressure and temperature distribution is developed. Following that, the simulator is used to estimate and control inner furnace temperature distribution. In the estimation, boundary data such as temperature and pressure, measured near a furnace wall, are used in the furnace simulation. Then, for the control of inner furnace temperature distribution, necessary values for gas blowing at the bottom of the furnace and the burden supply at the top of the furnace are used. Both for the estimation and the control of the inner furnace temperature distribution, a sequential quadratic programming method, a method of the iterative optimization, is applied. In our method, an estimation of inner furnace temperature distribution is done as preparation for the determination of furnace control variables. Through numerical experiments, the validity of our method is demonstrated, showing that the temperature distribution in a furnace can be regulated to the desired one after iterative control operations.

    DOI: 10.2355/isijinternational.45.347

    Web of Science

    researchmap

  • 熱延におけるルーパ制御ゲイン調整の人間モデルとその学習 査読

    今城周也, 小西正躬, 今井純, 西竜志

    鉄と鋼90 ( 11 ) 933 - 940   2004年11月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ISIJ  

    DOI: 10.2355/tetsutohagane1955.90.11_933

    researchmap

  • A decentralized scheduling method for flowshop problems with resource constraints 査読

    T Nishi, M Konishi, S Hasebe

    ELECTRICAL ENGINEERING IN JAPAN149 ( 1 ) 44 - 51   2004年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:SCRIPTA TECHNICA-JOHN WILEY & SONS  

    In this paper, we propose a decentralized scheduling method for flowshop scheduling problems with resource constraints using the Lagrangian decomposition and coordination approach. When a flowshop scheduling problem with resource constraints is decomposed into machine-level subproblems, the decomposed problem becomes very difficult to solve so as to obtain the optimal solution, even when the production sequence of operations is given. In this study, the decomposed subproblems are solved by a simulated annealing algorithm combined with dynamic programming. By decomposing the problem into single machine subproblems, the changeover cost can easily be incorporated in the objective function. In order to reduce the computation time, a heuristic algorithm for calculating the starting times of operations is also proposed. The performance of the proposed method is compared with that of the simulated annealing method by which the schedule of the entire machine is successively improved. Numerical results have shown that the proposed method can generate better solutions than the conventional method. (C) 2004 Wiley Periodicals, Inc.

    DOI: 10.1002/eej.10364

    Web of Science

    researchmap

  • サプライチェーンにおける分散協調型最適化技術 査読

    西竜志

    人工知能学会誌   2004年9月

     詳細を見る

    記述言語:日本語   出版者・発行元:JSAI  

    researchmap

  • Modeling of Gain Tuning Operation for Hot Strip Looper Controller by Recurrent Neral Network 査読

    Masami Konishi, Shuya Imajo, Tatsushi Nishi, Jun Imai

    Proc. IEEE 2004 International Conference on Control Applications   2004年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    researchmap

  • A Study on Inventory Control for a Single Stage Production System under Uncertain Demand 査読

    Tatsushi Nishi, Naoki Takami, Masami Konishi, Jun Imai

    Proc. SICE Annual Conference in Sapporo 2004   2004年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SICE  

    researchmap

  • Simultaneous Optimization of Task Assignment and Routing Problem of Forklifts for Distribution in a Refinary Plant 査読

    Tatsushi Nishi, Masami Konishi, Yutaka Saitoh, Takashi Taneda, Makoto Otsubo, Kengo Kasahara

    Proc. 2004 Japan-U.S.A. Symposium on Flexible Automation   2004年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • A Beam Search Method for Warehouse Storage Allocation and Assignment Planning Problems with a Heuristic Function 査読

    Tatsushi Nishi, Masami Konishi

    Proc. 2004 Japan-U.S.A. Symposium on Flexible Automation   2004年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • A Distributed Supply Chain Coordination System for Multiple Companies 査読

    Ryuichi Shinozaki, Tatsushi Nishi, Masami Konishi

    Proc. 2004 Japan-U.S.A. Sumposium on Flexible Automation   2004年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • A new Lagrangian Decomposition and Coordination Method for Single Machine Total Weighted Tardiness Problems 査読

    Tatsushi Nishi, Masami Konishi

    Proc. International Symposium on Scheduling 2004   2004年5月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • 拡張ラグランジュ分解調整法を用いた多企業間における入出荷計画問題の分散型最適化システム 査読

    西竜志, 篠崎竜一, 小西正躬

    計測自動制御学会論文集40 ( 5 ) 582 - 589   2004年5月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:SICE  

    DOI: 10.9746/sicetr1965.40.582

    researchmap

  • Distributed Supply Chain Planning System for Several Companies using a new Augmented Lagrangian Relaxation 査読

    Tatsushi Nishi, Ryuichi Shinozaki, Masami Konishi

    Proc. 2004 IEEE International Conference on Robotics and Automation   2004年4月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    researchmap

  • 分散並列型経路計画システムを用いた動的搬送問題に対する複数AGVの局所的再経路計画法 査読

    安藤昌和, 西 竜志, 小西正躬

    システム制御情報学会論文誌   2004年4月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ISCIE  

    DOI: 10.5687/iscie.17.162

    researchmap

  • An Integrated Optimization of Production Scheduling and Logistics by a Distributed Decision Making 査読

    Tatsushi Nishi, Masami Konishi

    Proc. of the 8th International Symposium on Process Systems Engineering   2004年1月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:Elsevier  

    researchmap

  • 製品移動回数と向先集約度を考慮した倉庫配置計画問題に対するビーム探索法の効率化 査読

    西竜志, 山本 慎一郎, 小西正躬

    電気学会論文誌電子・情報・システム部門誌124 ( 4 ) 1029 - 1035   2004年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:EEJ  

    DOI: 10.1541/ieejeiss.124.1029

    Scopus

    researchmap

  • 単一工程生産システムのサプライチェーン計画問題に対する分散協調型最適化法 査読

    西竜志, 小西正躬, 服部雄高, 長谷部伸治

    システム制御情報学会論文誌16 ( 12 ) 628 - 636   2003年12月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ISCIE  

    DOI: 10.5687/iscie.16.628

    researchmap

  • A Distributed Route Planning Method for Multiple Mobile Robots using Lagrangian Decomposition Technique 査読

    Tatsushi Nishi, Masakazu Ando, Masami Konishi, Jun Imai

    Proc. of the 2003 IEEE International Conference on Robotics & Automation   2003年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    researchmap

  • 複数台移動ロボットの搬送経路計画問題に対する自律分散型最適化法 査読

    安藤昌和, 西 竜志, 小西正躬, 今井純

    計測自動制御学会論文集39 ( 8 ) 759 - 766   2003年8月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:SICE  

    DOI: 10.9746/sicetr1965.39.759

    researchmap

  • An Autonomous Decentralized Route Planning Method for Dynamic Transportation 査読

    Masakazu Ando, Tatsushi Nishi, Masami Konishi, Jun Imai

    Proc. of the 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation   2003年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/CIRA.2003.1222269

    researchmap

  • 資源制約を有するフローショップ問題に対する装置を要素とした分散型スケジューリング法 査読

    西竜志, 小西正躬, 長谷部伸治

    電気学会論文誌C部門誌   2003年7月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:EEJ  

    DOI: 10.1541/ieejeiss.123.1327

    researchmap

  • An agent-based transportation route planning method for led fabricating line and its evaluation using Lagrangian relaxation 査読

    T Nishi, K Sotobayashi, M Ando, M Konishi

    JSME INTERNATIONAL JOURNAL SERIES C-MECHANICAL SYSTEMS MACHINE ELEMENTS AND MANUFACTURING46 ( 1 ) 18 - 23   2003年3月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:JAPAN SOC MECHANICAL ENGINEERS  

    In most of Light Emitting Diode (LED) semiconductor fabricating line, AGVs (Automated Guided Vehicles) are used to transport the products between the facilities in order to ensure dust-free operation in the transportation systems. It has been demanded to realize the route planning system which speedily derives a feasible transportation route so that each AGV does not interfere with other AGVs. In this paper, we applied an agent-based optimization method for the route planning problems with multiple AGVs in LED fabricating bay in which the total transportation time is minimized. In the agent-based method, each AGV agent independently searches its candidate of route. The imitated pheromone is effectively used to generate the route which avoids the collision among AGVs. In order to evaluate the performance of the proposed method, the lower bound of the original problem is obtained by using the Lagrangian relaxation technique. The performances of the proposed method are evaluated by using the value of duality gap for a large scale problem. The effectiveness of the agent-based optimization method is demonstrated.

    DOI: 10.1299/jsmec.46.18

    Web of Science

    researchmap

  • Evolutionary routing method for multi mobile robots in transportation 査読

    Masami Konishi, Tatsushi Nishi, Kengo Nakano, Ken Sotobayashi

    Proc. of the 2002 IEEE International Symposium on Intelligent Control   2002年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    researchmap

  • A Determination Method of Product Allocation Schedule for Warehouse Management

    Hisanori Takahama, Tatsushi Nishi, Masami Konishi, Jun Imai

    Proc. SICE Annual Conference 2002 in Osaka   2002年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SICE  

    researchmap

  • Autonomous Decentralized Supply Chain Optimization System for Multi-Stage Production Processes 査読

    Tatsushi Nishi, Masami Konishi, Shinji Hasebe, Iori Hashimoto

    Proc. of 2002 Japan-USA Symposium on Flexible Automation   2002年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Agent Based Routing Control for Multi Robots in Transportation 査読

    Ken Sotobayashi, Masami Konishi, Tatsushi Nishi, Jun Imai

    Proc. of 2002 Japan-USA Symposium on Flexible Automation   2002年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Evaluation of an Agent-Based Transportation Route Planning Method for LED Fabrication Line using Lagrangian Relaxation Technique 査読

    Tatsushi Nishi, Ken Sotobayashi, Masakazu Ando, Masami Konishi

    Proc. of International Symposium on Scheduling 2002   2002年6月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Machine-Oriented Decentralized Scheduling Method using Lagrangian Decomposition and Coordination Technique 査読

    Tatsushi Nishi, Masami Konishi, Shinji Hasebe, Iori Hashimoto

    Proc. of the 2002 IEEE International Conference on Robotics & Automation   2002年5月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    researchmap

  • Agent-based Transportation Control with Pheromone Communication 査読

    Ken Sotobayashi, Tatsushi Nishi, Masami Konishi, Jun Imai

    Proc. of International Conference on Control, Automation and Systems   2001年11月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • ラグランジュ緩和法によるフローショップ問題に対する装置を要素とした分散型スケジューリング法 査読

    西竜志, 長谷部伸治, 橋本伊織

    システム制御情報学会論文誌14 ( 5 ) 244 - 251   2001年5月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:ISCIE  

    DOI: 10.5687/iscie.14.244

    researchmap

  • Development of a Decentralized Supply Chain Optimization System 査読

    Tatsushi Nishi, Akihiro. Sakata, Shinji Hasebe, Iori Hashimoto

    Proc. of International Symposium on Design, Operation and Control of Next Generation Chemical Plants   2000年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • 在庫コストと納期遅れペナルティを考慮したフローショップ問題に対する自律分散型スケジューリングシステム 査読

    西竜志, 阪田明弘, 長谷部伸治, 橋本伊織

    化学工学論文集26 ( 5 ) 661 - 668   2000年9月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)   出版者・発行元:SCEJ  

    DOI: 10.1252/kakoronbunshu.26.661

    Web of Science

    researchmap

  • Autonomous Decentralized Scheduling System for Just-in-Time Production 査読

    Tatsushi Nishi, Akihiro Sakata, Shinji Hasebe, Iori Hashimoto

    Computers and Chemical Engineering   2000年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Elsevier  

    DOI: 10.1016/S0098-1354(00)00471-3

    researchmap

  • Autonomous Decentralized Scheduling System for Faster Generation of Plausible Schedules 査読

    Shinji Hasebe, Satoshi Taniguchi, Tatsushi Nishi, Iori Hashimoto

    AIChE Annual Meeting   1996年11月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(その他学術会議資料等)  

    researchmap

▼全件表示

 

担当授業科目

  • フーリエ・ラプラス変換 (2020年度) 第1学期  - 月3,月4,木1,木2

  • フーリエ・ラプラス変換 (2020年度) 第1学期  - 月3,月4,木1,木2

  • 機械システム工学演習1 (2020年度) 前期  - その他

  • 機械システム工学演習2 (2020年度) 後期  - その他

  • 知的システム計画論 (2020年度) 前期  - 火3,火4