I have working AMPL script (both mod and dat files) for a variant of multiple-traveling salesman problem. Wish to run it using ILOG CPLEX solver due to computational constraints on AMPL. is there anyway to execute the same script. Or will I have to re-write it for ILOG CPLEX?
AMPL is a front end that enables you to write almost math-like statements (essentially a high-level language) such as constraints and objective functions. It is convenient. As you have noticed however, addressing the same problem in ILOG-CPLEX may give you better access to memory and management of computer resources. Unfortunately you have to re-write the program in the more primitive statements (addressing elements of arrays etc). A good strategy is to work out the problem in AMPL and then re-write the constraints in more primitive form. It is probably going to be harder to debug in CPLEX, so best to get it right first for a small example in AMPL.
Good luck. ... this can be very tedious work!
Dear Muhammad Usman Arif,
I suggest you to see links and attached file in subject.
Dynamic generation of subtour elimination constraints in AMPL ...
https://groups.google.com/d/topic/ampl/mVsFg4mAI1c
The Travelling Salesman Problem with Integer Programming and Gurobi
examples.gurobi.com/traveling-salesman-problem/
Best regards
Hi:
did you try the NEOS server? maybe you can find there a solver that fit your needs.
Regards
David
- Badges
- Science topic