• Title/Summary/Keyword: minimax algorithm

Search Result 32, Processing Time 0.017 seconds

Fuzzy Group Decision Making for Multiple Decision Maker-Multiple Objective Programming Problems

  • Yano, Hitoshi
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.380-383
    • /
    • 2003
  • In this paper, we propose a fuzzy group decision making method for multiple decision maker-multiple objective programming problems to obtain the agreeable solution. In the proposed method, considering the vague nature of human subjective judgement it is assumed that each of multiple decision makers has a fuzzy goal for each of his/her own objective functions. After eliciting the membership functions from the decision makers for their fuzzy goals, total M-Pareto optimal solution concept is defined in membership spaces in order to deal with multiple decision maker-multiple objective programming problems. For generating a candidate of the agreeable solution which is total M-Pareto optimal, the extended weighted minimax problem is formulated and solved for some weighting vector which is specified by the decision makers in their subjective manner, Given the total M-Pareto optimal solution, each of the derision makers must either be satisfied with the current values of the membership functions, or update his/her weighting vector, However, in general, it seems to be very difficult to find the agreeable solution with which all of the decision makers are satisfied perfectly because of the conflicts between their membership functions. In the proposed method, each of the decision makers is requested to estimate the degree of satisfaction for the candidate of the agreeable solution. Using the estimated values or satisfaction of each of the decision makers, the core concept is desnfied, which is a set of undominated candidates. The interactive algorithm is developed to obtain the agreeable solution which satisfies core conditions.

  • PDF

Development of Optimal Bus Scheduling Algorithm with Multi-constraints (다중제약을 고려한 최적 버스운행계획 알고리즘 개발)

  • Lee, Ho-Sang;Park, Jong-Heon;Jo, Seong-Hun;Yun, Byeong-Jo
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.7 s.93
    • /
    • pp.129-138
    • /
    • 2006
  • After Seoul has introduced semi-public bus management system(public management-private operation), the Seoul Metro Government needs a scientific management tool for optimal scheduling for bus routes, to reduce unnecessary operations and provide demand responsive service. As a product of this effort, this paper proposes a heuristic model that could minimize total passenger waiting time under the constraints, such as number of vehicles, working conditions, max load point, minimax headway. etc. For verifying the validity of the proposed model, it is applied to an existing bus route. It results that headways in rush hours become decreased and the passenger waiting time could be decreased. In conclusion. it is thought that the Proposed model contributes to efficiency of bus operation.