GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions

Abstract

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte. Terms of use: Documents in

A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction

“…Nevertheless, the algorithmic ideas presented might prove helpful for the solution of other set covering based multiple criteria problems. This paper continues the work of [14,22,23] and proposes a new heuristic solution approach for the 2WDP-SC. Our previous approaches include epsilon branch-and-bound to solve the 2WDP-SC to optimality, a genetic algorithm, and matheuristics based on GRASP and path relinking combined with the epsilon branch-and-bound procedure.…”

“…In order to select appropriate bundle-bids (i.e., components), we propose a two-stage component selection procedure which takes multiple criteria into account and distinguishes DRC from standard GRASP as well as from the previous multi-criteria approach for the 2WDP-SC of [22].…”

“…The idea of segmenting the bundle bids into sectors is to smoothly guide the search process into certain directions of the multi criteria objective space. Thus, all variants of (non-dominated) compromise solutions are constructed and not only a variation of extreme solutions with respect to a single objective function (e.g., as in the approach of [22]). This important effect is achieved without the need to configure weights for the objective functions, only the number of sectors s has to be chosen which is, at least for the 2WDP-SC, a straight-forward task.…”

“…3. PNS is less complicated compared to [22,23], there is no post construction optimizer, no path relinking, and no branch-and-bound. 4.…”

Optimizing a Biobjective Production‐Distribution Planning Problem Using a GRASP

“…In addition to the successful use of GRASP to solve singleobjective problems, it has also been successfully applied to approximate the efficient Pareto front of different multiobjective optimization problems [63][64][65][66][67][68]. The previous cited references adapted specific components of GRASP to the corresponding problems under study.…”