Handling the hub location problem without limit capacity

Due to my limited abilities, I would like to use MATLAB programming and genetic algorithm code to solve the model I have established. I would greatly appreciate it if someone capable could provide specific code to implement the solution for this model. The specific data involved in the model can be temporarily left blank, with a notation indicating where to input the data. Thank you very much!

[Torsten]

I replaced your attached document (which was empty or flawed) by the one that you used in your former question in this forum. If parts of your problem formulation have changed, you will need to replace the document from above by the most recent one.

[马清]

The following file is the newset about describing of the HLP.

[马清]

If the above file isn't still opened, you  can check the following three pictures which are the details about the HLP file.

[Torsten]

I don't understand what (1) and (2) mean in your problem description. (1) is the objective and means that your want to minimize. And what is (2) ?

[马清]

The objective function (2) is to maximize satisfaction of the nodes served by the hubs they are linked to.

[Torsten]

(1) and (2) look like objective functions. Usually, there is only one of them. That's why I wrote that I don't understand (1) and (2) of your problem description. Your comment doesn't help in this respect.