Question

1. Write down the entire polynomial-size formulation for Asymmetric Travelling Salesman Problem 2. Explain the constraints...

1. Write down the entire polynomial-size formulation for Asymmetric Travelling Salesman Problem

2. Explain the constraints and the variables, and HOW the polynomially many constraints work in eliminating subtours.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Let a graph G = (V, E) be a given complete digraph, where V is a vertices V={1,…,n} is the vertex set and E={(i,j):i,j∈V} is the arc set, and let c ij be the cost associated with arc (i,j)∈E (with cii=+∞ for i∈V).

A Hamiltonian circuit (tour) of G is a circuit visiting each vertex of Vexactly once. The Asymmetric Traveling Salesman Problem (ATSP) is to find a Hamiltonian circuit G∗=(V,E∗) of G whose cost ∑(i,j)∈A∗cij is minimum..

The polynomial formulations can be directly solved by a general-purpose ILP solver.

The earliest polynomial formulation of the ATSP is owed to Miller (1960) (hereafter MTZ)

ui−uj+(n−1)xij ≤ n−2,i,j=2,…,n;

where ui,i=2,…,n,ui,i=2,…,n, is an arbitrary real number representing the order of vertex i in the optimal tour, and constraints (10) break subtours.

Add a comment
Know the answer?
Add Answer to:
1. Write down the entire polynomial-size formulation for Asymmetric Travelling Salesman Problem 2. Explain the constraints...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT