مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

186
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

63
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction

Pages

  1342-1351

Abstract

 In this paper, a Combinatorial Reverse Auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’ s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria including cost and service time. So, the corresponding Winner Determination Problem of the proposed auction mechanism is formulated as a bi-objective combinatorial optimization problem. However, finding a feasible solution for the formulated problem as well as its solving is NP-complete. Since exact optimization algorithms are failed in solving this kind of problems in a reasonable time, a problem specific metaheuristic called NSGA-II that is an evolutionary algorithm for solving multi-objective optimization problems is developed to estimate the set of Pareto optimal solutions of the formulated bi-objective Winner Determination Problem. In our developed NSGA-II, two problem-specific operators are proposed for creating initial feasible solutions and converting infeasible solutions to feasible ones. Furthermore, a new method for determining the population size based on the size of problem instance is proposed. We conduct a computational experiment in which several randomly generated problem instances are solved using the proposed NSGA-II in different settings. Computational results of proposed algorithm in different settings are compared using a quality measure and statistical hypothesis tests. The results of performance comparison show that the proposed NSGA-II with a population size determined by proposed method and a different form of binary tournament method performs better in finding non-dominated solutions for different instances of formulated bi-objective optimization problem.

Multimedia

  • No record.

    • Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    Alaei, R., & SETAK, M.. (2017). Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction. INTERNATIONAL JOURNAL OF ENGINEERING, 30(9 (TRANSACTIONS C: Aspects)), 1342-1351. SID. https://sid.ir/paper/723324/en

    Vancouver: Copy

    Alaei R., SETAK M.. Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction. INTERNATIONAL JOURNAL OF ENGINEERING[Internet]. 2017;30(9 (TRANSACTIONS C: Aspects)):1342-1351. Available from: https://sid.ir/paper/723324/en

    IEEE: Copy

    R. Alaei, and M. SETAK, “Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction,” INTERNATIONAL JOURNAL OF ENGINEERING, vol. 30, no. 9 (TRANSACTIONS C: Aspects), pp. 1342–1351, 2017, [Online]. Available: https://sid.ir/paper/723324/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button