.png){kind=icon}
.png){kind=icon}
Return
Web Semantic-Based MOOP Algorithm for Facilitating Allocation Problems in the Supply Chain Domain
.png){kind=icon}
OA
AI
DOI：10.4018/IJSWIS.330250.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The facility allocation of the supply chain is critical since it directly influences cost efficiency, customer service, supply chain responsiveness, risk reduction, network optimization, and overall competitiveness. When enterprises deploy their facilities wisely, they may achieve operational excellence, exceed customer expectations, and obtain a competitive advantage in today's volatile business climate. Due to this reason, a multi-objective facility allocation problem is introduced in this research with cooperative-based multi-level backup coverage considering distance-based facility attractiveness. The facility of the coverage is further described as two different layers of the coverage process, where demand can be covered as full, partial, and no coverage by their respective facilities. The main objectives of this facility allocation problem are to maximize the coverage of the facility to maximize overall facility coverage in the supply chain network and simultaneously minimize the overall cost.
Keywords:
Cluster Network
Facility Allocation
Heuristic Optimization
Multi Objective Optimization Problem
Semantic Web
Supply Chain
Journal
I
IF:
5.6
Papers:
471
Citations:
914