The development of sharing economy and new information technologies has promoted the emergence of third-party shared manufacturing platforms (TPSMPs). In the shared manufacturing context, one main challenge to TPSMPs is the matching of manufacturing enterprises with insufficient production capacity (capacity demanders) and those with overcapacity (capacity suppliers), where available capacities of capacity suppliers are within time ranges, and orders of capacity demanders can be split. In this capacity matching problem with capacity time windows and order splitting (CMPCTW-OS), each capacity demander's order needs to be delivered on time, while each capacity supplier can also match with multiple capacity demanders and fulfil orders of the capacity demanders by sequence. A mathematical model for the CMPCTW-OS is developed to maximise the total profit of the TPSMP. Then, we design a two-stage heuristic algorithm to solve this model. In the first stage, the inserting algorithm (IA) is used to obtain an initial feasible solution. In the second stage, the iterated local search (ILS) is applied to optimise and improve the initial feasible solution. Finally, in numerical simulation experiments, the effectiveness of IA-ILS has been verified by comparison with the GUROBI solver.
Read full abstract