A Network Modeling Question

frantic_777

Junior Member
Aug 20, 2011
3
0
0
Hello Everybody
Thanks For Reading My Question
I’m writing a model for a flight network and there is one constraint that I’ve added for flow conservation. In fact I’m trying to say the number of aircraft entering a city must equal the number of aircraft exiting it. I’ve written this Constraint:

for each j : sum(i,y(i,j))=sum(i,y(j,i))

In which y(i,j) is the number of aircraft going from city i to city j.
By this constraint I mean: the number of aircrafts from cities i which enter a specific city j must be equal to the number of aircraft departing from this city j to other cities i.
Now there is the problem. There are SUBTOURS in this solution.
In fact this somehow resembles the TSP(traveling salesman problem) but the difference here is that I do not care weather a specific city is passed through for many times(in TSP each city should be passed through just once). How can I eliminate these subtours. I really appreciate if someone can help me with adding a constraint or modifying the above constraint. The constraint that is ideal for me is something that says the aircraft rotates between different cities (AND DOESN’T JUMP FROM ONE CITY TO ANOTHER) and returns to the the originating city.
 

Ken g6

Programming Moderator, Elite Member
Moderator
Dec 11, 1999
16,836
4,816
75
The constraint that is ideal for me is something that says the aircraft rotates between different cities (AND DOESN’T JUMP FROM ONE CITY TO ANOTHER) and returns to the the originating city.
Are you sure the bolded portion is necessary? Suppose the aircraft that started at A winds up at B, the one that started at B winds up at C, and the one that started at C windows up at A. Supposing the pilots wind up in their original cities (and they can ride on multiple aircraft), this shouldn't be a problem, should it?
 

frantic_777

Junior Member
Aug 20, 2011
3
0
0
Are you sure the bolded portion is necessary? Suppose the aircraft that started at A winds up at B, the one that started at B winds up at C, and the one that started at C windows up at A. Supposing the pilots wind up in their original cities (and they can ride on multiple aircraft), this shouldn't be a problem, should it?
This is about a specific aircraft
Suppose you have an airbus a320. My model gives me answers like this:
with this aircraft fly in this routes: (1-5),(5,9),(9,3),(3,1)
That's ideal for me which means that specific aircraft starts at city 1 then goes to city 5 and... and finally returns back to city 1. But there are some other sort of answers in my model which are subtours. For example the answers are like this: (1,3),(3,1),(4,7),(7,4)
It's obvious that this solution is not feasible because there is no flight between city 1 and city 4(that is what I meant by jumping from one city to another). As I mentioned this is somehow like traveling salesman problem, but the difference is that it's not important if I pass through a city several times.