Published papers

Solution method for routing problems called "dial-a-ride problems" (DARP) can be applied to the creation of service plans for on-demand buses. This study suggests that it may be possible to formulate more efficient operating routes that improve on the existing best solution for DARP, by using a solution method devised by the authors. The effectiveness of adopting this method was estimated by looking at the Nakamura-machi Bus, and the observed effect was a roughly 10% reduction in operating routes. This result shows that the proposed method is likely to be effective for reducing costs when used for on-demand bus service planning.

A new capacitated arc routing solution associated with the actual delivery operations is developed. The method is characterized by a primitive data modelling and a simple optimization procedure based on the simulated annealing. The data structure of the method, that is, travelling routes of a number of vehicles, is expressed as a string. The solutions generated by the proposed method are compared with the solutions given by other methods by conducting a computational experiment utilizing the bench-mark capacitated arc routing problems. It is shown that the proposed method is adaptable to additional constraints and objectives.

都市の物流問題への対処法としての情報技術の適用を提案した．

情報技術を活用した配車・配送計画アルゴリズムの提案

A practical heuristic approach to Node Edge Arc Routing Problem (NEARP or MCGRP) and an aplication to a newspaper delivery problem is proposed. In this approach, the creation of neighborhood based on one dimensional data model and heuristic optimization technique using Simulated Annealing (SA) are adopted. The rates of adopting rules in producing neighbors and the values of parameters in the SA procedure are revised from them used in the method which was developed in the authors’ previous study. Computational experiments are examined on a set of benchmark NEARP problems (CBMix series). In two problems over twenty-three benchmark problems, the proposed method overcomes the best-known solutions in smaller computing time. A newspaper delivery problem in a district in Japan is modeled as NEARP and solved by the proposed method. Computational results on the problem are presented and the effectiveness of the proposed practical approach is demonstrated.

Electric Vehicle (EV) is coming up as an eco-friendly next-generation vehicle. A lot of companies release plans to sell EV, and then it is expected that EV becomes a means of transportation in daily life in the near future. This study aims to pose an optimal routing problem of EV considering gradients (slopes) of roads. An optimal routing problem of EV differs from that of conventional cars, because electricity consumption and cruising rangEVary with inner states (battery performance and weight) of EV and the use of regenerative brake. In this study, a calculation model of electricity consumption of EV considering gradients is proposed. The influence of road gradient on an optimal routing of EV is also EValuated by using elEVation data collected during an experimental run.

A new practical solution of the general routing problems with nodes, edges, and arcs (NEARP) has been developed. The method is characterized by a primitive data modeling and a simple optimization procedure based on simulated annealing. The data structure of the method, that is traveling routes of a number of vehicles, is expressed as a string. The solutions generated by the proposed method are compared with those of another method by conducting computational experiments on instances of the NEARP. Moreover, it is shown that the proposed method is adaptable to additional conditions.

人工知能技術を現実的な難解な配送問題に適用して，配送効率の向上を図る方法を提案した。

教科「情報」で電子教材を効果的に活用する方法および授業方法を考察した．

新教科「情報」の先取りをした授業への電子教材の活用を試みた．

人工知能技術を現実的な様々な配送問題に適用した．

慶應義塾女子高校における情報教育の実施を解説し，新教科「情報」の展望を述べた

集荷を含めた配送問題の近似解法。

新しい人工知能技術を配送計画に適用した．

人工知能技術を数学教育に応用した.