Compute the minimum or lower bound for required gates
$begingroup$
In the problem, we have a certain number of flights that the occupation time (in minutes) of each flight in the gate is determined and considered as a parameter (i.e. flight 1 occupies the gate for 50 minutes, flight 2 occupies the gate for 60 minutes , and ...).
The available time for the gates are 1440 minutes.
Based on occupation times of flights in a gate and available time for the gates, I want to compute the minimum required gates.
Do you know a method or article to solve this problem?
optimization
asked Jan 3 at 16:45
mahdimahdi
92
$endgroup$
add a comment |
$begingroup$
In the problem, we have a certain number of flights that the occupation time (in minutes) of each flight in the gate is determined and considered as a parameter (i.e. flight 1 occupies the gate for 50 minutes, flight 2 occupies the gate for 60 minutes , and ...).
The available time for the gates are 1440 minutes.
Based on occupation times of flights in a gate and available time for the gates, I want to compute the minimum required gates.
Do you know a method or article to solve this problem?
optimization
asked Jan 3 at 16:45
mahdimahdi
92
$endgroup$
$begingroup$
This is an NP-Hard problem ... you probably are better off using heuristics.
$endgroup$
– Don Thousand
Jan 3 at 16:50
$begingroup$
Yes, it is in NP-Hard class problem. I looked for the heuristics but I couldn't find any method. The heuristics for the similar problem can help me.
$endgroup$
– mahdi
Jan 3 at 16:54
$begingroup$
Try using the space filling heuristic for boxes. Your "space" is time.
$endgroup$
– Don Thousand
Jan 3 at 16:56
add a comment |
$begingroup$
In the problem, we have a certain number of flights that the occupation time (in minutes) of each flight in the gate is determined and considered as a parameter (i.e. flight 1 occupies the gate for 50 minutes, flight 2 occupies the gate for 60 minutes , and ...).
The available time for the gates are 1440 minutes.
Based on occupation times of flights in a gate and available time for the gates, I want to compute the minimum required gates.
Do you know a method or article to solve this problem?
optimization
asked Jan 3 at 16:45
mahdimahdi
92
$endgroup$
In the problem, we have a certain number of flights that the occupation time (in minutes) of each flight in the gate is determined and considered as a parameter (i.e. flight 1 occupies the gate for 50 minutes, flight 2 occupies the gate for 60 minutes , and ...).
The available time for the gates are 1440 minutes.
Based on occupation times of flights in a gate and available time for the gates, I want to compute the minimum required gates.
Do you know a method or article to solve this problem?
optimization
optimization
asked Jan 3 at 16:45
mahdimahdi
92
asked Jan 3 at 16:45
mahdimahdi
92
asked Jan 3 at 16:45
mahdimahdi
92
asked Jan 3 at 16:45
mahdimahdi
92
asked Jan 3 at 16:45
mahdimahdi
92
92
$begingroup$
This is an NP-Hard problem ... you probably are better off using heuristics.
$endgroup$
– Don Thousand
Jan 3 at 16:50
$begingroup$
Yes, it is in NP-Hard class problem. I looked for the heuristics but I couldn't find any method. The heuristics for the similar problem can help me.
$endgroup$
– mahdi
Jan 3 at 16:54
$begingroup$
Try using the space filling heuristic for boxes. Your "space" is time.
$endgroup$
– Don Thousand
Jan 3 at 16:56
add a comment |
$begingroup$
This is an NP-Hard problem ... you probably are better off using heuristics.
$endgroup$
– Don Thousand
Jan 3 at 16:50
$begingroup$
Yes, it is in NP-Hard class problem. I looked for the heuristics but I couldn't find any method. The heuristics for the similar problem can help me.
$endgroup$
– mahdi
Jan 3 at 16:54
$begingroup$
Try using the space filling heuristic for boxes. Your "space" is time.
$endgroup$
– Don Thousand
Jan 3 at 16:56
$begingroup$
This is an NP-Hard problem ... you probably are better off using heuristics.
$endgroup$
– Don Thousand
Jan 3 at 16:50
$begingroup$
This is an NP-Hard problem ... you probably are better off using heuristics.
$endgroup$
– Don Thousand
Jan 3 at 16:50
$begingroup$
Yes, it is in NP-Hard class problem. I looked for the heuristics but I couldn't find any method. The heuristics for the similar problem can help me.
$endgroup$
– mahdi
Jan 3 at 16:54
$begingroup$
Yes, it is in NP-Hard class problem. I looked for the heuristics but I couldn't find any method. The heuristics for the similar problem can help me.
$endgroup$
– mahdi
Jan 3 at 16:54
$begingroup$
Try using the space filling heuristic for boxes. Your "space" is time.
$endgroup$
– Don Thousand
Jan 3 at 16:56
$begingroup$
Try using the space filling heuristic for boxes. Your "space" is time.
$endgroup$
– Don Thousand
Jan 3 at 16:56
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3060757%2fcompute-the-minimum-or-lower-bound-for-required-gates%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
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3060757%2fcompute-the-minimum-or-lower-bound-for-required-gates%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
$begingroup$
This is an NP-Hard problem ... you probably are better off using heuristics.
$endgroup$
– Don Thousand
Jan 3 at 16:50
$begingroup$
Yes, it is in NP-Hard class problem. I looked for the heuristics but I couldn't find any method. The heuristics for the similar problem can help me.
$endgroup$
– mahdi
Jan 3 at 16:54
$begingroup$
Try using the space filling heuristic for boxes. Your "space" is time.
$endgroup$
– Don Thousand
Jan 3 at 16:56