THE MULTICOMMODITY FLOW QUADRATIC ASSIGNMENTPROBLEM

摘要

The multicommodity flow quadratic assignment problem (MFQAP) is the task of assigning nodes to locations, andcommodity flows to arcs, such that total cost is minimized or profit is maximized. The MFQAP integrates themulticommodity flow problem (MFP) and the quadratic assignment problem (QAP). The MFQAP has applicationsin facilities design (I.e. nodes representing machines and commodities representing products), and logistics systemsdesign (I.e., nodes representing different facilities and commodities representing different products). Since theMFQAP is a generalization of the QAP, it is computational intractable. This work includes a problem definition, amathematical formulation, an illustrative problem instance example, and areas of future research.