How do I use an integer programmed mathematical modelling of TSP (travelling salesman problem)?












0












$begingroup$


Okay, so I just finished my mathematical modelling of TSP using integer programming.



Now, how do I use it?



enter image description here



Now, I just want to know to use this model to solve a simple 5 vertices large graph.



You don't have to use any mathematical symbols, just answer in simple plain English.



This is what I suppose I have to do:





Go through all combinations, and for each combination check whether it violates any constraints, if it doesn't note down the value, if the value is less than the previous noted value, then this is our new lowest route value, else we simply move on, because the former route was less than our current one.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Don't forget that all $x_{ij} in {0,1}$. You should be able to use any integer linear programming solver.
    $endgroup$
    – Robert Israel
    Dec 9 '18 at 17:32










  • $begingroup$
    I would like to do it by hand, that is why the it's a simple graph consisting of 5 vertices. By the way, what integer linear pogramming solver is suitable for my need?
    $endgroup$
    – purrp son
    Dec 9 '18 at 17:47












  • $begingroup$
    BTW you don't want to include $S = V$.
    $endgroup$
    – Robert Israel
    Dec 9 '18 at 17:56










  • $begingroup$
    @RobertIsrael What do you mean? Where did I do that?
    $endgroup$
    – purrp son
    Dec 9 '18 at 17:58












  • $begingroup$
    Depends on convention. $S subset V$ sometimes includes $S=V$, sometimes not. In this case it should be not.
    $endgroup$
    – Robert Israel
    Dec 10 '18 at 2:56
















0












$begingroup$


Okay, so I just finished my mathematical modelling of TSP using integer programming.



Now, how do I use it?



enter image description here



Now, I just want to know to use this model to solve a simple 5 vertices large graph.



You don't have to use any mathematical symbols, just answer in simple plain English.



This is what I suppose I have to do:





Go through all combinations, and for each combination check whether it violates any constraints, if it doesn't note down the value, if the value is less than the previous noted value, then this is our new lowest route value, else we simply move on, because the former route was less than our current one.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Don't forget that all $x_{ij} in {0,1}$. You should be able to use any integer linear programming solver.
    $endgroup$
    – Robert Israel
    Dec 9 '18 at 17:32










  • $begingroup$
    I would like to do it by hand, that is why the it's a simple graph consisting of 5 vertices. By the way, what integer linear pogramming solver is suitable for my need?
    $endgroup$
    – purrp son
    Dec 9 '18 at 17:47












  • $begingroup$
    BTW you don't want to include $S = V$.
    $endgroup$
    – Robert Israel
    Dec 9 '18 at 17:56










  • $begingroup$
    @RobertIsrael What do you mean? Where did I do that?
    $endgroup$
    – purrp son
    Dec 9 '18 at 17:58












  • $begingroup$
    Depends on convention. $S subset V$ sometimes includes $S=V$, sometimes not. In this case it should be not.
    $endgroup$
    – Robert Israel
    Dec 10 '18 at 2:56














0












0








0





$begingroup$


Okay, so I just finished my mathematical modelling of TSP using integer programming.



Now, how do I use it?



enter image description here



Now, I just want to know to use this model to solve a simple 5 vertices large graph.



You don't have to use any mathematical symbols, just answer in simple plain English.



This is what I suppose I have to do:





Go through all combinations, and for each combination check whether it violates any constraints, if it doesn't note down the value, if the value is less than the previous noted value, then this is our new lowest route value, else we simply move on, because the former route was less than our current one.










share|cite|improve this question











$endgroup$




Okay, so I just finished my mathematical modelling of TSP using integer programming.



Now, how do I use it?



enter image description here



Now, I just want to know to use this model to solve a simple 5 vertices large graph.



You don't have to use any mathematical symbols, just answer in simple plain English.



This is what I suppose I have to do:





Go through all combinations, and for each combination check whether it violates any constraints, if it doesn't note down the value, if the value is less than the previous noted value, then this is our new lowest route value, else we simply move on, because the former route was less than our current one.







notation mathematical-modeling integer-programming






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 9 '18 at 17:56







purrp son

















asked Dec 9 '18 at 17:27









purrp sonpurrp son

112




112












  • $begingroup$
    Don't forget that all $x_{ij} in {0,1}$. You should be able to use any integer linear programming solver.
    $endgroup$
    – Robert Israel
    Dec 9 '18 at 17:32










  • $begingroup$
    I would like to do it by hand, that is why the it's a simple graph consisting of 5 vertices. By the way, what integer linear pogramming solver is suitable for my need?
    $endgroup$
    – purrp son
    Dec 9 '18 at 17:47












  • $begingroup$
    BTW you don't want to include $S = V$.
    $endgroup$
    – Robert Israel
    Dec 9 '18 at 17:56










  • $begingroup$
    @RobertIsrael What do you mean? Where did I do that?
    $endgroup$
    – purrp son
    Dec 9 '18 at 17:58












  • $begingroup$
    Depends on convention. $S subset V$ sometimes includes $S=V$, sometimes not. In this case it should be not.
    $endgroup$
    – Robert Israel
    Dec 10 '18 at 2:56


















  • $begingroup$
    Don't forget that all $x_{ij} in {0,1}$. You should be able to use any integer linear programming solver.
    $endgroup$
    – Robert Israel
    Dec 9 '18 at 17:32










  • $begingroup$
    I would like to do it by hand, that is why the it's a simple graph consisting of 5 vertices. By the way, what integer linear pogramming solver is suitable for my need?
    $endgroup$
    – purrp son
    Dec 9 '18 at 17:47












  • $begingroup$
    BTW you don't want to include $S = V$.
    $endgroup$
    – Robert Israel
    Dec 9 '18 at 17:56










  • $begingroup$
    @RobertIsrael What do you mean? Where did I do that?
    $endgroup$
    – purrp son
    Dec 9 '18 at 17:58












  • $begingroup$
    Depends on convention. $S subset V$ sometimes includes $S=V$, sometimes not. In this case it should be not.
    $endgroup$
    – Robert Israel
    Dec 10 '18 at 2:56
















$begingroup$
Don't forget that all $x_{ij} in {0,1}$. You should be able to use any integer linear programming solver.
$endgroup$
– Robert Israel
Dec 9 '18 at 17:32




$begingroup$
Don't forget that all $x_{ij} in {0,1}$. You should be able to use any integer linear programming solver.
$endgroup$
– Robert Israel
Dec 9 '18 at 17:32












$begingroup$
I would like to do it by hand, that is why the it's a simple graph consisting of 5 vertices. By the way, what integer linear pogramming solver is suitable for my need?
$endgroup$
– purrp son
Dec 9 '18 at 17:47






$begingroup$
I would like to do it by hand, that is why the it's a simple graph consisting of 5 vertices. By the way, what integer linear pogramming solver is suitable for my need?
$endgroup$
– purrp son
Dec 9 '18 at 17:47














$begingroup$
BTW you don't want to include $S = V$.
$endgroup$
– Robert Israel
Dec 9 '18 at 17:56




$begingroup$
BTW you don't want to include $S = V$.
$endgroup$
– Robert Israel
Dec 9 '18 at 17:56












$begingroup$
@RobertIsrael What do you mean? Where did I do that?
$endgroup$
– purrp son
Dec 9 '18 at 17:58






$begingroup$
@RobertIsrael What do you mean? Where did I do that?
$endgroup$
– purrp son
Dec 9 '18 at 17:58














$begingroup$
Depends on convention. $S subset V$ sometimes includes $S=V$, sometimes not. In this case it should be not.
$endgroup$
– Robert Israel
Dec 10 '18 at 2:56




$begingroup$
Depends on convention. $S subset V$ sometimes includes $S=V$, sometimes not. In this case it should be not.
$endgroup$
– Robert Israel
Dec 10 '18 at 2:56










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3032648%2fhow-do-i-use-an-integer-programmed-mathematical-modelling-of-tsp-travelling-sal%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3032648%2fhow-do-i-use-an-integer-programmed-mathematical-modelling-of-tsp-travelling-sal%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Plaza Victoria

Puebla de Zaragoza

Musa