Search

This paper presented a supplier bidding strategy model for multi-attribute reverse auction to get the optimal bidding strategy of the target supplier for the next round in the multi-attribute combinatorial bidding process. Considering the bidding strategy of competitive vendors and winner determination rules, the model combined the solving procedure of ABCA and the decision-making process of the target suppliers. It used ABCA to search the optimal strategy of the target supplier for the next round of bids with the analysis of the competitive vendors' cost function. The simulation result shows that this model can effectively find out the optimal bidding strategy of the target supplier in the dynamic bidding process. [ABSTRACT FROM AUTHOR]

This paper studied minimum ratio traveling salesman problem (MRTSP), which objective function was the ratio between the total distances and total benefits, and presented a discrete bat algorithm for solving MRTSP. In this improved bat algorithm, on the one hand, it redefined the subtraction operator of location and location, the multiplication operator of real number and location, and the addition operator of velocity and location. On the other hand, it introduced the reversing the city subsequence in order to perform the route's local search. The experimental results show that this improved bat algorithm is feasible and can effectively solve the MRTSP instances. [ABSTRACT FROM AUTHOR]

This paper proposed cellular bat algorithm to solve 0-1 programming problem, which was based on the principles of cellular automata and bat algorithm. It used cellular and its neighbor to enhance the diversity of the searching process to improve the ability of global optimization, and transformed the constrained problem into the unconstrained problem using penalty function and then described the detailed procedures of the algorithm and programmed with MATLAB software. By some 0-1 programming problem test and comparisons with other algorithms, the results show that cellular bat algorithm has fast convergence speed and better global optimization ability. It can be used as a practical approach to solve 0-1 programming problem. [ABSTRACT FROM AUTHOR]