AYAkebo Yamakami

Akebo Yamakami

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Akebo Yamakami has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Using the Life Cycle Approach for Multiobjective Optimization in the Context of the Green Supply Chain: A Case Study of Brazilian Coffee

    by Hugo Sakamoto, Larissa Thaís Bruschi, Luiz Kulay, Akebo Yamakami

    This study proposes a multiobjective optimization model (MOO) based on a green supply chain so that coffee produced in Brazil could supply the North American market with lower environmental impacts and costs. Production and distribution arrangements were established considering four coffee-producing regions, three ports of origin in Brazil, four destination ports, seven roasting plants, and fifteen consumption centers, all distributed throughout the American territory. Environmental and economic performances regarding global warming potential (GWP) and costs were determined for a life cycle approach. The results indicate that coffee cultivation has the most significant contributions to the GWP of the arrangements. The transport of the product by road also plays an essential role, especially if extensive distances are covered during the port–roaster–consumer center journey in the United States. The analysis showed differences of 2.0 kg CO2eq and US$8.00 per ton of coffee between the best and worst arrangements, which can be considered significant when projected to the Brazilian annual coffee export scale. In the environmental limit condition, the optimization can lead to non-trivial results compared to the real market. The model conceived for the MOO can be improved to reproduce more realistic conditions by incorporating producer and consumer markets, inserting uncertainties.


  • Open Access

    Algoritmo de caminho mınimo para grafos coloridos aplicado a redes de transporte multimodal

    by Juliana V. Shirabayashi, Akebo Yamakami, Ricardo C. Silva, Wesley Vagner I. Shirabayashi

    Este trabalho apresenta um algoritmo para o problema de caminho mínimo em grafos coloridos baseado no algoritmo clássico de Ford-Moore-Bellman e aplicado a redes de transporte multimodal, onde cada modo de transporte considerado é representado por uma cor, podendo ter vários arcos entre dois nós do grafo. Durante o procedimento de resolução, o método detecta se houve mudança de modo e um custo referente a esta mudança é acrescentado no caminho, ao final temos um caminho mínimo multimodal com informação de qual modo foi utilizado para percorrer cada arco do caminho. Testes computacionais foram feitos a fim de comprovar a viabilidade do algoritmo proposto.

  • Using the fuzzy sets theory in the multimodal transport network problem

    by Juliana Verga, Ricardo Coelho Silva, Akebo Yamakami, Wesley V. I. Shirabayashi

    In this work, an approach to solve multimodal transport network problems with uncertain costs in the edges is proposed. This kind of problem has been studied for several researchers who search solutions to the large numbers of problems relating on the transport systems like: traffic jam, pollution, delays, among others. In this work, the modelling of this problems is based on graph theory are presented, where each transport mode is represented by a subgraph and the whole graph is the union of all subgraphs. Besides, its mathematical formulation describes nonlinear conditions and the goal is to develop an algorithm that reaches a set of Pareto solutions, which find the best routes between origin and destination. A numerical example is used to illustrate the efficiency of the proposed approach.


  • Open Access

    Redução de Dimensionalidade Aplicada na Classificação de Spams usando Filtros Bayesianos

    by Tiago A. Almeida, Akebo Yamakami

    Redução de Dimensionalidade Aplicada na Classificação de Spams usando Filtros Bayesianos


  • A parametric convex programming approach applied to portfolio pelection problems with fuzzy costs

    by Ricardo C. Silva, Jose L. Verdegay, Akebo Yamakami

    In this work we consider the portfolio selection problems with uncertainties as a kind of multiple objective problem with fuzzy costs in the objective functions. The portfolio selection problems can be classified as convex programming problems. Although convex programming problems are a special class of nonlinear programming, they can also be defined as a general linear programming problem. These problems are of utmost importance in a variety of relevant practical fields. In addition, since ambiguity and vagueness are natural and ever-present in real-life situations requiring solutions, it makes perfect sense to attempt to address them using fuzzy convex programming technique. This work presents a novel fuzzy set based method that solves a class of convex programming problems with vagueness costs in the objective functions. This method transforms a fuzzy convex multi-objective programming problem into a parametric convex multi-objective programming one. When obtain the efficient solutions of the transformed problem, they satisfy an aspiration level defined by a decision maker. This proposed method is applied in two portfolio selection numerical examples by using Latibex data of some Brazilian securities.