oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Search Results: 1 - 10 of 1341 matches for " Ichiro Nishizaki "
All listed articles are free for downloading (OA Articles)
Page 1 /1341
Display every page Item
Interactive Fuzzy Approaches for Solving Multiobjective Two-Person Zero-Sum Games  [PDF]
Hitoshi Yano, Ichiro Nishizaki
Applied Mathematics (AM) , 2016, DOI: 10.4236/am.2016.75036
Abstract: In this paper, we consider multiobjective two-person zero-sum games with vector payoffs and vector fuzzy payoffs. We translate such games into the corresponding multiobjective programming problems and introduce the pessimistic Pareto optimal solution concept by assuming that a player supposes the opponent adopts the most disadvantage strategy for the self. It is shown that any pessimistic Pareto optimal solution can be obtained on the basis of linear programming techniques even if the membership functions for the objective functions are nonlinear. Moreover, we propose interactive algorithms based on the bisection method to obtain a pessimistic compromise solution from among the set of all pessimistic Pareto optimal solutions. In order to show the efficiency of the proposed method, we illustrate interactive processes of an application to a vegetable shipment problem.
A Two-Level Purchase Problem for Food Retailing in Japan  [PDF]
Masatoshi Sakawa, Ichiro Nishizaki, Takeshi Matsui, Tomohiro Hayashida
American Journal of Operations Research (AJOR) , 2012, DOI: 10.4236/ajor.2012.24057
Abstract: In this paper, we deal with a purchase problem for food retailing, and formulate a two-level linear programming problem with a food retailer and a distributer. The food retailer deals with vegetables and fruits which are purchased from the distributer; the distributer buys vegetables and fruits ordered from the food retailer at the central wholesale markets in several cities, and transports them by truck from each of the central wholesaler markets to the food retailer’s storehouse. We solve the two-level linear programming problem in which the profits of the food retailer and the distributer are maximized.
Cooperative Particle Swarm Optimization in Distance-Based Clustered Groups  [PDF]
Tomohiro Hayashida, Ichiro Nishizaki, Shinya Sekizaki, Shunsuke Koto
Journal of Software Engineering and Applications (JSEA) , 2017, DOI: 10.4236/jsea.2017.102008
Abstract: TCPSO (Two-swarm Cooperative Particle Swarm Optimization) has been proposed by Sun and Li in 2014. TCPSO divides the swarms into two groups with different migration rules, and it has higher performance for high-dimensional nonlinear optimization problems than traditional PSO and other modified method of PSO. This paper proposes a particle swarm optimization by modifying TCPSO to avoid inappropriate convergence onto local optima. The quite feature of the proposed method is that two kinds of subpopulations constructed based on the scheme of TCPSO are divided into some clusters based on distance measure, k-means clustering method, to maintain both diversity and centralization of search process are maintained. This paper conducts numerical experiments using several types of functions, and the experimental results indicate that the proposed method has higher performance than the TCPSO for large-scale optimization problems.
Two-Level 0-1 Programming through Parallel Genetic Algorithms
Keiichi Niwa,Ichiro Nishizaki,Masatoshi Sakawa
Lecture Notes in Engineering and Computer Science , 2009,
Abstract:
Two-Level 0-1 programming using genetic algorithms and a sharing scheme based on cluster analysis
Keiichi Niwa,Ichiro Nishizaki,Masatoshi Sakawa
Lecture Notes in Engineering and Computer Science , 2008,
Abstract:
Stackelberg Solution to Two-Level Linear Programming Models of Food Retailers and Brokerages Problems
Takeshi Matsui,Masatoshi Sakawa,Ichiro Nishizaki,Kosuke Kato
Lecture Notes in Engineering and Computer Science , 2009,
Abstract:
A Tabu Search Based Approximate Solution Algorithm for k-minimum Spanning Tree Problems
Hideki Katagiri,Ichiro Nishizaki,Tomohiro Hayashida,Jun Ishimatsu
Lecture Notes in Engineering and Computer Science , 2009,
Abstract:
Interactive Multiobjective Fuzzy Random Programming through Level Set Optimization
Hideki Katagiri,Masatoshi Sakawa,Kosuke Kato,Ichiro Nishizaki
Lecture Notes in Engineering and Computer Science , 2008,
Abstract:
A Hybrid Algorithm Based on Memetic Algorithm and Tabu Search for k-Minimum Spanning Tree Problems
Qingqiang Guo,Hideki Katagiri,Ichiro Nishizaki,Tomohiro Hayashida
Lecture Notes in Engineering and Computer Science , 2012,
Abstract:
Secure Implementation in Queueing Problems  [PDF]
Katsuhiko Nishizaki
Theoretical Economics Letters (TEL) , 2012, DOI: 10.4236/tel.2012.25103
Abstract:

This paper studies secure implementability (T. Saijo, T. Sjostrom and T. Yamato, Secure Implementation,Theoretical Economics, Vol. 2, No. 3, 2007, pp. 203-229) in queueing problems. Our main result shows that the social choice function satisfies strategy-proofness and strong non-bossiness (Z. Ritz, Restricted Domains, Arrow-Social Welfare Functions and Noncorruptible and Non-Manipulable Social Choice Correspondences: The Case of Private Alternatives,Mathematical Social Science, Vol. 4, No. 2, 1983, pp. 155-179), both of which are necessary for secure imple- mentation, if and only if it is constant on the domains that satisfy weak indifference introduced in this paper. Weak in- difference is weaker than minimal richness (Y. Fujinaka and T. Wakayama, Secure Implementation in Economies with Indivisible Objects and Money, Economics Letters, Vol. 100, No. 1, 2008, pp. 91-95). Our main result illustrates that secure implementation is too difficult in queueing problems since many reasonable domains satisfy weak indifference, for example, convex domains.

Page 1 /1341
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.