Originally posted by: WangZhengxu

Hi, all

I have a question based on the model of TSP which described in the OPL model library named Traveling Salesman Problem.

If I add two dummy cities for the salesman, namely start and end, to represent the initial and final status of the salesman.

How I can achieve this using OPL?
#DecisionOptimization
#OPLusingCPOptimizer

Originally posted by: ol

Hello,
if you want to start from a city called start, and to end in a city called end, a simple way is simply adding a constraint x<end,start>==1 to force the end to be connected to the start.
Regards,
ol
#DecisionOptimization
#OPLusingCPOptimizer

Originally posted by: WangZhengxu

Thanks a lot. I think I know how to code this problem
#DecisionOptimization
#OPLusingCPOptimizer

Originally posted by: RithulKrishnan

Hi WangZhengxu,

I'm learning cplex and need to code the traditional integer programming formulation for the traveling salesman problem. I am struggling with the code using Cplex for MATLAB, I keep getting errors and do not know how to correct them, can you please help me with the code?

 

Thank You,

Regards,

Rithul

#DecisionOptimization
#OPLusingCPOptimizer