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

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.

[1]  David Levine,et al.  Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization , 2006, Interfaces.

[2]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[3]  Thomas Morris,et al.  Reinventing the Supplier Negotiation Process at Motorola , 2005, Interfaces.

[4]  Michel Gendreau,et al.  Combinatorial auctions , 2007, Ann. Oper. Res..

[5]  M. Bashiri,et al.  A Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities , 2015 .

[6]  Tobias Buer,et al.  A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction , 2012, Comput. Oper. Res..

[7]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[8]  Chefi Triki,et al.  Location-based techniques for the synergy approximation in combinatorial transportation auctions , 2016, Optim. Lett..

[9]  Chris Caplice,et al.  Combinatorial Auctions for Truckload Transportation , 2005 .

[10]  R Tavakkoli Moghaddam,et al.  SOLVING A NEW BI-OBJECTIVE MODEL FOR A CELL FORMATION PROBLEM CONSIDERING LABOR ALLOCATION BY MULTI-OBJECTIVE PARTICLE SWARM OPTIMIZATION , 2011 .

[11]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[12]  Martin Bichler,et al.  Industrial Procurement Auctions , 2005 .

[13]  Colin R. Reeves,et al.  Using Genetic Algorithms with Small Populations , 1993, ICGA.

[14]  Reza Alaei,et al.  Development of a Genetic Algorithm for Advertising Time Allocation Problems , 2011 .

[15]  Amir Hossein Azadnia,et al.  A Multi-objective Mathematical Model for Sustainable Supplier Selection and Order Lot-Sizing under Inflation , 2016 .

[16]  Martin Pesendorfer,et al.  Auctioning bus routes: the London experience , 2006 .

[17]  David Levine,et al.  Winner determination in combinatorial auction generalizations , 2002, AAMAS '02.

[18]  Bishakh Bhattacharya,et al.  Practical Applications in Constrained Evolutionary Multi-objective Optimization , 2017, Recent Advances in Evolutionary Multi-objective Optimization.

[19]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[20]  Ho Soo Lee,et al.  Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: Combinatorial and Quantity-Discount Procurement Auctions Benefit Mars, Incorporated and Its Suppliers , 2003, Interfaces.

[21]  A. Shamsai,et al.  Multi-objective Optimization , 2017, Encyclopedia of Machine Learning and Data Mining.

[22]  M. Setak,et al.  Supplier Selection and Order Allocation Models in Supply Chain Management: A Review , 2012 .

[23]  Reza Alaei,et al.  Scheduling TV commercials using genetic algorithms , 2013 .

[24]  Mostafa Setak,et al.  Selecting unique suppliers through winner determination in combinatorial reverse auction: scatter search algorithm , 2017 .

[25]  Catherine Beaudry,et al.  Agent-based simulation of multiple-round timber combinatorial auction , 2017 .

[26]  Giselher Pankratz,et al.  Solving a bi-objective winner determination problem in a transportation procurement auction , 2010, Logist. Res..

[27]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[28]  Fu-Shiung Hsieh,et al.  Combinatorial reverse auction based on revelation of Lagrangian multipliers , 2010, Decis. Support Syst..

[29]  P. Cramton,et al.  Introduction to Combinatorial Auctions , 2006 .

[30]  M. Ball,et al.  Auctions for the Safe, Efficient and Equitable Allocation of Airspace System Resources , 2003 .