Research on order acceptance of multi-node and multi-process routes with HITHS algorithm

Aiming at the order acceptance problem of nmlti-node and multi-process routes with the characteristics of earliness/tardiness, a mixed intelligent tuned harmony search algorithm (HITHS) with improved NEH heuristic algorithm, local search and intelligent tuned harmony search was proposed for resolving the problem. In this algorithm, some initial solutions in the initial solution space were generated by improved NEH heuristic algorithm. Then these initial solutions were updated with intelligent tuned harmony search. In the updating process, a series of operations such as interchange, exchange and reverse of local search were used to avoid falling into a local optimal solution, and thus the problem's approximate optimum solution was got. At last, a case of the problem was tested by the mixed algorithm. The effectiveness and efficiencies of the mixed algorithm was proved by the case's analysis and compared with harmony search.