The assignment problem (AP) is one of the well-known and most studied combinatorial optimization problems. The single objective AP is an integer programming problem that can be solved with efficient algorithms such as the Hungarian or the successive shortest paths methods. On the other hand, finding and classifying all efficient assignments for a Multicriteria AP (MCAP) remains a controversial issue in Multicriteria Decision Making (MCDM) problems. In this chapter, we tackle the issue by using data envelopment analysis (DEA) models. Importantly, we focus on identifying the efficiency status of assignments using a two-phase algorithm. In phase I, a mixed-integer linear programming (MILP) based on the Free disposable Hull (FDH) model is used to determine minimal complete set (MCS) of efficient assignments. In Phase II, the DEA-BCC model is used to classify efficient assignments as supported or nonsupported. A numerical example is provided to illustrate the presented approach.
|عنوان منشور المضيف||Multi-Objective Combinatorial Optimization Problems and Solution Methods|
|رقم المعيار الدولي للكتب (الإلكتروني)||9780128237991|
|رقم المعيار الدولي للكتب (المطبوع)||9780128238004|
|المعرِّفات الرقمية للأشياء|
|حالة النشر||Published - يناير 1 2022|
ASJC Scopus subject areas