Solving Large Aircraft Landing Problems on Multiple Runways by Applying a Constraint Programming Approach
|
|
- Julian Carson
- 5 years ago
- Views:
Transcription
1 Solving Large Aircraft Landing Problems on Multiple Runways by Applying a Constraint Programming Approach Amir Salehipour School of Mathematical and Physical Sciences, The University of Newcastle, Australia a.salehipour@newcastle.edu.au ABSTRACT 1. INTRODUCTION Aircraft Landing Problem is to assign an airport s runways to the arrival aircraft as well as to schedule the landing time of these aircraft. In this paper, due to the complexity of the problem, which is NP-hard, we develop an iterative-based heuristic by exploiting special characteristics of the problem. Computational results show the developed approach is quite competitive, and obtain optimal and near optimal solutions for instances with up to 500 aircraft in a reasonable amount of time. The algorithm outperforms the best known solutions available for the problem, while it s required computational time is at most 10% of that of the best available algorithm for the problem. KEYWORDS: Aircraft Scheduling, Mixed-Integer Programming, Iterative Heuristic The cost of air transportation is much higher than that of other transportations means. Nevertheless, a major volume of transportation is carried by aircraft. The cost associated with landing aircraft, if deviated from its target landing time, is considered to be a substantial amount. This turns minimization of this cost to be a very important saving area, and hence, has given the optimal aircraft landing schedule as one of the most important air related operational schedule. The objective of this paper is to minimize the landing cost of aircraft by appropriate scheduling. The aircraft landing problem consists of determining an optimal schedule of landing aircraft on airport s runways and also allocating the arriving aircraft to the available runaways with the objective of minimizing the total deviation of landing time from the target time (both earliness and tardiness). This problem is known to be NP-hard which makes impossible to solve large-scale instances in a reasonable amount of time. Therefore, the major contribution of this paper has been given to derive a practical solution approach to derive near-optimal, and preferably optimal solutions for problems up to 500 aircraft on multiple runways. Despite the efforts taken towards solution approaches for the problem, either exact or heuristics, there have not been a considerable progress regarding solving the problem to optimality. To the best of our knowledge, the optimal solutions have been existed for instances of up to 50 aircraft (Beasley et al., 2000; Pinol and Beasley, 2006). Recently, Salehipour et al., (2013) 1
2 extended that to instances with 100 aircraft, and report new best found solutions for instances with up to 200 aircraft. In the following we discuss the previous research on this problem by reviewing the most important research in this area. Ernst et al. (1999) developed a special purpose simplex algorithm for this problem, and obtained an optimal solution for instances with 44 aircraft and 4 runways. Beasley et al. (2000) presented a mixed-integer zero-one formulation of the problem for a single runway and extended it to multiple runways. They provided optimal solutions for instances up to 50 aircraft. Following their previous work, Beasley et al. (2004) studied the dynamic variant of the problem. Pinol and Beasly (2006) developed a scatter search meta-heuristic to solve the instances with 500 aircraft, although their research on finding optimal solution is limited to the instances up to 50 aircraft. Hansen (2004) considered a simplified variant of the problem by taking into account different assumptions, and reported results for instances with up to 20 aircraft. Bäuerle et al. (2007) developed a model for the landing aircraft based on the queuing theory concept. They solved instances with up to 75 aircraft on two runways. Soomer and Franx (2008) studied the single runway problem where airlines provide cost functions related to arrival delays for their flights. They implemented a local search heuristic to obtain reasonable solutions for instances of up to 100 aircraft. Artiouchine et al. (2008) described several special cases that can be solved in polynomial time. They provided a mixed integer programming formulation to solve special cases of the problem, and a general hybrid branch-and-cut framework to solve the problem with arbitrary time windows. Salehipour et al., (2009) considered the runway-dependent case and developed a Variable Neighborhood Descent (VND) algorithm. As these studies show, both exact and heuristic algorithms have been developed for the problem. Implementing the heuristic and meta-heuristic algorithms do not guarantee optimal solutions, nevertheless, the best found solutions to date have been reported by applying these algorithms. The paper is organized as follows. In Section 2 the problem is formulated and a mixed-integer programming formulation from the literature is discussed. Following the complexity of the problem, in Section 3 several properties of the problem are discussed. Later in the Section we show how applying these properties would result in deriving very high quality and near optimal solutions, specifically for larger instances. Section 4 is devoted to the computational results. Paper ends with the conclusion. 2. PROBLEM FORMULATION As previously stated, the aircraft landing problem is to determine an optimal allocation of aircraft to land on airport s runway, while an optimal schedule of landing is maintained. Minimizing the total cost of both early and delayed landings, with respect to the pre-specified target landing time is the objective of this problem. Both early and late landings (than target landing time) are penalized by a cost function associated with early and late landings. In most cases, these two costs are not equal and thus, to generalize these two costs we deal with different cost ratios. It is important to mention that while the target landing time can be determined before the landing is scheduled, the real landing time, i.e. landing schedule, is an operational-dependent time. This implies that an aircraft may not land on its target landing time; hence a cost penalty is incurred. Apparent from this target landing time, in reality a time window is considered for each aircraft s landing, defining earliest and latest landing times allowed for each aircraft. Besides, a safe landing requires a separation time between every two aircraft scheduled to land either on a same 2
3 runway or on different runways. In reality, this separation time is dependent on the aircraft s type (Heavy, Large, Small, Cargo, etc.), and not on the runway. Thus, the separation time for every two aircraft landing on a same runway should be different than landing on different runways. Without loss of generality, we assume the separation time for the latter case is 1 time unit. This assumption has been taken by others in the literature (Beasley et al., 2000; Pinol and Beasley, 2006; Salehipour et al., 2013). Pinol and Beasley (2006) presented an open formulation for the problem based on Beasley et al. (2000). By open, we mean different side constraints which may be applied according to the situation in hand. In fact, their mixed-integer formulation is quite simple and effective. Recently, Salehipour et al., (2013) have simplified the formulation of Beasley et al. (2000), and developed another mixed-integer programming formulation which is simpler in basis than that of Beasley et al. (2000). But neither an advantage in the computational time, nor in the reported gaps was obtained. To give a clear understanding of the problem, and the solution approach developed later, here we explain Beasely et al. s formulation (2000) together with the variables and parameters definitions. Decision Variables x i : The scheduled landing time of aircraft i (i = 1,, n). y ii : Takes 1 if aircraft i lands before aircraft j and otherwise 0. γ ii : Takes 1 if aircraft i is allocated to runway r (r = 1,, m) and otherwise 0. δ ii : Takes 1 if aircraft i and j land on a same runway and otherwise 0. a i : The delay of landing aircraft i (landing after the target time), thus a i = max (0, x i T i ). b i : The earliness of landing aircraft i (landing before the target time), thus b i = max(0, T i x i ). Parameters s ii : The separation time between two aircraft i and j when landing on a same runway. T i : The target landing time (target time) of aircraft i. E i : Earliest landing time of aircraft i. L i : Latest landing time of aircraft i. c i + : The cost of late landing of aircraft i. c i : The cost of early landing of aircraft i. The mathematical formulation is as follows. n Min z = i=1 (a i c + i + b i c i ) (1) S.t. E i x i L i i = 1,, n (2) x i T i = a i + b i i = 1,, n (3) T i x i a i T i E i i = 1,, n (4) 3
4 x i T i b i L i T i i = 1,, n (5) x j x i s ii δ ii + (1 δ ii ) My jj i, j = 1,, n, i j (6) y ii + y jj = 1 i, j = 1,, n, i j (7) δ ii γ ii + γ jj 1 i, j = 1,, n, i j, r = 1,, m (8) m r=1 γ ii = 1 i = 1,, n (9) δ ii = δ jj i, j = 1,, n, i j (10) y ii, γ ii, δ ii {0,1} i, j = 1,, n, i j, r = 1,, m (11) x i, a i, b i 0 i = 1,, n (12) Objective function (1) minimizes the total cost of landing not on target landing time. Constraints (2) ensure every aircraft lands in its time window. Coupling constraints (3), (4), and (5) link the decision variables x i and parameters T i to decision variables a i and b i. Constraints (6) impose if aircraft j lands right after aircraft i on a same runway, as least s ii time unit should be elapsed before aircraft j could be land, and otherwise 1 time unit should be elapsed. Constraints (7) ensure the feasibility of aircraft s landing. Coupling constraints (8) link the decision variables δ ii and γ ii. Assignment constraints (9) ensure allocation of each aircraft to only one runway. Constraints (10) ensure if δ ii = 1 then δ jj = 1. Constraints (11) and (12) ensure the decision variables δ ii, γ ii and y ii are binary, and the decision variables x i, a i and b i are nonnegative, respectively. Salehipour et al., (2013) applied this formulation, and implemented Cplex solver from ILOG over it. Changing parameters of Cplex enable them to report optimal solutions for instances with up to 100 aircraft and 4 runways in a short time. To date, their results are the first optimal solution for instances with 100 aircraft. However, due to the complexity behind the problem (according to Beasley et al this problem is NP-Hard), and in spite of this efficient formulation, and capability of Cplex in solving integer and mixed-integer programming, the optimal solutions for instances with more than 100 aircraft is very difficult to reach in a reasonable amount of time. Besides, no authors except Salehipour et al., (2013), and Pinol and Beasley (2006) have tried problems with more than 100 aircraft either by heuristic or by exact solution approaches. Thus, to solve larger instances we studied the problem in details and developed an iterative heuristic by introducing a set of constraints and iteratively modifying them which are capable of deriving very sharp upper bounds (UBs). The added constraints do not guarantee optimal solutions. However, these UBs are much better than the best found solutions reported by Pinol and Beasley (2006), and surprisingly by Salehipour et al., (2013). Furthermore, they could be reached much quicker, at least 9 times faster than that of Salehipour and Modarres s, and approximately 40 times faster than that of Pinol and Beasley s on a same machine. Another advantage of the proposed solution approach, is that it is purely lied on an exact solver (like Cplex from ILOG), which guarantees the robustness of the solution approach. 4
5 3. AN INTERATIVE HEURISTIC FOR AIRCRAFT LANDING PROBLEM In this section we develop a class of constraints for the aircraft landing problem. These constraints are developed according to the characteristic of the problem. We shall discuss an example to explicate more these constraints Example Assume the following aircraft landing data (Table 1) for 10 aircraft and two runways (n = 10 and m = 2). These data are of problem Airland1 from Beasley et al. (2000). Table 1. Aircraft landing data for problem of example Aircraft E i T i L i The separation times between every two aircraft landing on same runway are shown in Table 2. Table 2. The separation time for problem of example If someone would like to derive an intuitive solution for the problem, at first, aircraft should be sorted according to their target landing times (T i, i = 1,, n). This will result in Table 3. Sorted aircraft based on T i Aircraft E i T i L i
6 In this intuitive solution, aircraft 3 is the first aircraft to schedule for landing on runway 1 followed by aircraft 4. The separation time between these two aircraft (s ii ) is 8, which means aircraft 4 cannot land before time 106 on runway 1. Although this aircraft could be land not any sooner than time 99 on runway 2, of course at the cost of 7 units of deviation from its target landing time, i.e. T 4. Similarly, aircraft 5 and 6 can be scheduled to land on runway 1 on their target landing times, thus no deviation cost from their designated target landing times is considered. Aircraft 7 can be scheduled to land no sooner than time 143 on runway 1, assuming the previous aircraft land exactly on their target landing times. This would impose a cost of 5 unit delay for this aircraft. On the other hand, if we schedule this aircraft to land on runway 2 (different runway from aircraft 6), it can be scheduled to land on time 138 which leaves no delay for aircraft 7. Thus it would be beneficial to schedule aircraft 6 and 7 not to land on a same runway. We could import this into the mixed-integer programming formulation of Section 2 as γ 6r + γ 7r 1, r = 1,2. Adding a complete set of these constraints to the mixed-integer programming formulation would reduce the required computational time substantially, specifically for larger instances, as computation experiments show this. A closer look at the problem reveals that it would also be better not to land aircraft 7 and 8, and 9 and 1 on a same runway, thus γ 7r + γ 8r 1 and γ 9r + γ 1r 1 where r = 1,2. This results in a complete set of following constraints for the example: γ 6r + γ 7r 1, r = 1,2 γ 7r + γ 8r 1, r = 1,2 γ 9r + γ 1r 1, r = 1,2 Depicting the Gantt chart for this example reveals this fact (see Figure 1). Note that if we use more than two runways here, we yield a total objective function of 0, as aircraft 8 could be scheduled to land on its target time on runway 3. Runway Figure 1. The Gantt chart of aircraft landing schedule explained in the example Landing Time (not scaled) 6
7 3.2. A Constraint Programming Approach for Aircraft Landing Problem The previous example and Figure 1 carry a fundamental observation regarding the solution approach, i.e. the iterative heuristic, provided here in this paper. Observation 1. Assume r > 1 and all T i (i = 1,, n) are sorted in ascending order. Thus T i1 T i2 T in 1 T in. For each two sorted aircraft i k and i k+1, if T ik+1 < T ik + s ik i k+1 then a better schedule, not necessarily optimal, can be found, if we can schedule these two aircraft to land on different runways. Proof. Trivial. A direct implementation of the observation 1 is that it can cut the solution space which will simplify the solution process. The drawback of the new constraints is that they do not guarantee an optimal solution. This is because these constraints imposed two arbitrary aircraft to land on two different runways, while they may land on a same runway (when the cost of deviation from target landing time if landing on a same runway is less than the total deviation of these two aircraft from their target landing times if landing on two different runways). Nevertheless, the quality of solutions applied by this approach and the reported computational times are very good. Observation 2. Following Observation 1, if two aircraft j and k may not land on the same runway, a constraint of the form γ jj + γ kk 1, r can be derived. Proof. Trivial. Observation 3. Assume > 0, generating constraints via T ik+1 + λ < T ik + s ik i k+1 may result in an improved objective function value, if and only if λ = 0 does not result to optimal solution. Proof. Adding a positive value (λ) to the left of T ik+1 < T ik + s ik i k+1 limits the constraints generation process. Thus a reduced number of constraints are generated. Note that the larger the value λ the less the number of generated constraints. According to the mixed-integer programming formulation and the explanation given above, the reduced number of constraints guarantees improved objective function value, of course, at the cost of higher computational time. According to the experiments performed, adding these constraints to the mixed-integer programming formulation of Section 2 can develop a landing schedule of aircraft which has a very competitive quality. Nevertheless, if not optimal, this initial schedule could easily be improved using different values for parameter λ. Note that increasing the value of λ will increase the required computational time. Thus someone can make a trade-off between the quality of solution and the computational time. Based on the Observation 3, the outline of the developed solution approach is illustrated in Algorithm 1. Algorithm 1. The iterative heuristic for aircraft landing problem Until stopping condition is met do Step 1. Generate constraints by applying Observation 2. Step 2. Incorporate generated constraints into mixed-integer programming formulation (Section 2); Step 3. Solve the mixed-integer programming formulation. 7
8 4. COMPUTATIONAL RESULTS In this section we report the computational results of the iterative heuristic solution approach proposed in Section 3. For comparison purposes we shall report the results of Pinol and Beasley (2006), and that of Salehipour et al., (2013). The results of Pinol and Beasley (2006) were obtained by applying a Scatter Search (SS) meta-heuristic while the results of Salehipour et al., (2013) were obtained by applying a hybrid Simulated Annealing + Variable Neighborhood Search (SA+VND) with an effective construction heuristic. We have solved a set of 13 instances from the literature (Pinol and Beasley, 2006) ranging from 10 to 500 aircraft and 2 to 5 runways. We benefitted from Cplex 12.1 from ILOG to solve to optimality instances with up to 100 aircraft. All computational results have been carried out on a personal computer with 2 GHz CPU and 512 MB memory (The same PC specification as appeared in Pinol and Beasley, 2006 to carry out direct comparison). Table 4 reports the complete computational results of the first 9 instances where optimal solutions were reported by Salehipour et al., (2013). In this table, we have reported the computational results of the developed iterative heuristic procedure, and the exact optimal solution. Throughout this table, the first column is the instance name, the second and the third columns are the number of aircraft and the number of runways for each instance, respectively. The remaining columns are associated with the objective function value and the total computational time in seconds for each reported solution approaches. Those gaps in the last column are gaps from objective function of iterative heuristic approach calculated over the optimal solution. Note that except four cases where the iterative heuristic approach did not report optimal solution, it yielded optimal solutions for the all remaining 16 cases, thus on 80% of cases (out of 20 cases with up to 100 aircraft). These optimal solutions were shown in bold. This is also notable that the iterative heuristic approach is approximately 10 times faster than the optimal approach. Table 4. Results for instances with up to 100 aircraft using exact and iterative heuristic procedures (Salehipour et al., 2013) This paper Instance n m Optimal Iterative heuristic Obj T (s) Obj T (s) GAP(%) Airland Airland Airland Airland Airland Airland Airland Airland Airland Average
9 For those instances, that the iterative heuristic approach could not report optimal solution, optimal solutions can be reached by changing parameter λ (Section 3.2). These were reported in Table 5 together with the value of λ at which optimal solution is found, and the time at when this best objective function is observed for the first time. Table 5. Best found solution found by iterative heuristic approach and different values for λ Instance n m Obj T(s) λ Airland Airland Airland Airland Here, the best value of λ for each case was obtained by trial and error. Table 6. Results for instances with up to 500 aircraft using iterative heuristic approach, SA+VND and SS meta-heuristics SA+VND (Salehipour et Iterative heuristic SS (Pinol and Beasley, 2006) Instance n m al., 2013) Obj T(s) Obj T(s) Obj T(s) Airland Airland Airland Airland Average Table 6 reports the computational experiments of iterative heuristic approach, the SA+VND, and the SS meta-heuristics. Again here the first column is the instance name, the second and the third columns are the number of aircraft and the number of runways for each instance, respectively. Those remaining columns are associated with the objective function value and the total computational time in seconds for each reported solution approaches. Except from three cases where the iterative heuristic approach could not report the best found solution as either SA+VND or SS did (see Table 7 for new solutions by changing value of λ), for remaining 13 cases it reports either the best available solutions or new best found solutions (on 81.25% of cases). Apart from this capability it is almost 9 times faster than SA+VND of Salehipour et al., (2013), and 40 times faster than that of SS as Figure 2 depicts this. 9
10 Table 7. Best found solution found by iterative heuristic approach and different values for λ Instance n m Obj T(s) λ Airland Airland Airland Here, the best value of λ for each case was obtained by trial and error. CPU time in seconds Computational time of three approaches for large problems ,2 150,3 150,4 150,5 200,2 200,3 200,4 200,5 250,2 250,3 250,4 250,5 500,2 500,3 500,4 500,5 No. of Aircraft, No. of Runways Cutting Approach SA+VND SS Figure 2. A comparison of computational times of three different solution approaches According to tables 4 and 6, the performance of the iterative heuristic approach is very competitive on all instances, specifically when the size of instances increases rapidly (see tables 6 and 7 and also Figure 2 for a better understanding). This is the case where both SA+VND and SS could not reach the objective function values found by the iterative heuristic approach approximately after 20 and 75 minutes, respectively. Considering all these together, it is easy to show the superiority of the developed after approach in deriving optimal and near optimal solutions. To the best of our knowledge, and according to the published research on the problem, the reported results of this paper are the new best found solutions for most instances of the problem. For the remaining instances, reported solutions are the same as literature. 10
11 5. CONCLUSION In this paper we discussed an exact-based solution approach for the aircraft landing problem with the objective of minimizing the total deviation of landing time from the target time (both earliness and tardiness) where multiple runways are available. The proposed solution approach included a class of constraints to derive very high quality solutions for instances with up to 500 aircraft. The computational results show that this solution approach is very competitive, and can obtain very high quality solutions for instances of up to 500 aircraft in a short time, which is at least 10 times faster than the best solution approaches available for the problem. As the future directions, authors are working on improving the iterative heuristic procedure to generate constraints that without requiring changing parameter λ could find optimal solutions. REFERENCES Artiouchine, K., Baptiste, P., and Durr, C. (2008), Runway sequencing with holding patterns, European Journal of Operational Research, 189(3): Bäuerle N., Engelhardt-Funke O. and Kolonko M. (2007), On the waiting time of arriving aircraft and the capacity of airports with one or two runways, European Journal of Operational Research 177(2): Beasley J. E., Krishnamoorthy M., Sharaiha Y. M. and Abramson D. (2000), Scheduling Aircraft Landings-The Static Case, Transportation Science, 34(2): Beasley, J. E., Krishnamoorthy, M., Sharaiha, Y. M., and Abramson, D. (2004), Displacement problem and dynamically scheduling aircraft landings, Journal of the Operational Research Society, 55(1): Ernst, A. T., Krishnamoorthy, M, and Storer, R. H. (1999), Heuristic and exact algorithms for scheduling aircraft landings, Networks, 34(3): Hansen J. V. (2004), Genetic search methods in air traffic control, Computers & Operations Research 31(3): Pinol, H. and Beasley, J. E. (2006), Scatter Search and Bionomic Algorithms for the aircraft landing problem, European Journal of Operational Research 171: Salehipour, A., Modarres, M., and Naeni, Leila M. (2013), An Efficient Hybrid Meta-Heuristic for Aircraft Landing Problem, Computers & Operations Research 40(1): Salehipour, A., Naeni, Leila M., and Kazemipoor H. (2009), Scheduling Aircraft Landings by Applying a Variable Neighborhood Descent Algorithm: Runway-dependent landing time case, Journal of Applied Operational Research 1(1): Soomer, M. J., and Franx, G. J. (2008), Scheduling aircraft landings using airlines preferences, European Journal of Operational Research 190:
Solving Dynamic Single-Runway Aircraft Landing Problems With Extremal Optimisation
Proceedings of the 2007 IEEE Symposium on Computational Solving Dynamic Single-Runway Aircraft Landing Problems With Extremal Optimisation I. Moser and T. Hendtlass Abstract A dynamic implementation of
More informationOn step fixed-charge hub location problem
On step fixed-charge hub location problem Marcos Roberto Silva DEOP - Departamento de Engenharia Operacional Patrus Transportes Urgentes Ltda. 07934-000, Guarulhos, SP E-mail: marcos.roberto.silva@uol.com.br
More informationSolving the Capacitated Single Allocation Hub Location Problem Using Genetic Algorithm
Solving the Capacitated Single Allocation Hub Location Problem Using Genetic Algorithm Faculty of Mathematics University of Belgrade Studentski trg 16/IV 11 000, Belgrade, Serbia (e-mail: zoricast@matf.bg.ac.yu)
More informationSolving Dynamic Single-Runway Aircraft Landing Problems With
Solving Dynamic Single-Runway Aircraft Landing Problems With Extremal Optimisation Irene Moser and Tim Hendtlass Abstract A dynamic implementation of the single-runway aircraft landing problem was chosen
More informationGraph Coloring via Constraint Programming-based Column Generation
Graph Coloring via Constraint Programming-based Column Generation Stefano Gualandi Federico Malucelli Dipartimento di Elettronica e Informatica, Politecnico di Milano Viale Ponzio 24/A, 20133, Milan, Italy
More informationThe Heuristic (Dark) Side of MIP Solvers. Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL
The Heuristic (Dark) Side of MIP Solvers Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL 1 Table of content [Lodi], The Heuristic (Dark) Side of MIP Solvers, Hybrid Metaheuristics, 273-284,
More informationProceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 Solving Assembly Line Balancing Problem in the State of Multiple- Alternative
More informationA hard integer program made easy by lexicography
Noname manuscript No. (will be inserted by the editor) A hard integer program made easy by lexicography Egon Balas Matteo Fischetti Arrigo Zanette February 16, 2011 Abstract A small but notoriously hard
More informationVNS-based heuristic with an exponential neighborhood for the server load balancing problem
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 47 (2015) 53 60 www.elsevier.com/locate/endm VNS-based heuristic with an exponential neighborhood for the server load
More informationMerging Flows in Terminal Maneuvering Area using Time Decomposition Approach
Merging Flows in Terminal Maneuvering Area using Time Decomposition Approach Ji MA Daniel DELAHAYE, Mohammed SBIHI, Marcel MONGEAU MAIAA Laboratory in Applied Mathematics, Computer Science and Automatics
More informationVariable Neighborhood Search for Solving the Balanced Location Problem
TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Variable Neighborhood Search for Solving the Balanced Location Problem Jozef Kratica, Markus Leitner, Ivana Ljubić Forschungsbericht
More informationParallel Auction Algorithm for Linear Assignment Problem
Parallel Auction Algorithm for Linear Assignment Problem Xin Jin 1 Introduction The (linear) assignment problem is one of classic combinatorial optimization problems, first appearing in the studies on
More informationSOLVING THE TASK ASSIGNMENT PROBLEM WITH A VARIABLE NEIGHBORHOOD SEARCH. Jozef Kratica, Aleksandar Savić, Vladimir Filipović, Marija Milanović
Serdica J. Computing 4 (2010), 435 446 SOLVING THE TASK ASSIGNMENT PROBLEM WITH A VARIABLE NEIGHBORHOOD SEARCH Jozef Kratica, Aleksandar Savić, Vladimir Filipović, Marija Milanović Abstract. In this paper
More informationSurrogate Gradient Algorithm for Lagrangian Relaxation 1,2
Surrogate Gradient Algorithm for Lagrangian Relaxation 1,2 X. Zhao 3, P. B. Luh 4, and J. Wang 5 Communicated by W.B. Gong and D. D. Yao 1 This paper is dedicated to Professor Yu-Chi Ho for his 65th birthday.
More informationAn Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem
An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem Harald Feltl and Günther R. Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology, Vienna, Austria
More informationA Randomized Algorithm for Minimizing User Disturbance Due to Changes in Cellular Technology
A Randomized Algorithm for Minimizing User Disturbance Due to Changes in Cellular Technology Carlos A. S. OLIVEIRA CAO Lab, Dept. of ISE, University of Florida Gainesville, FL 32611, USA David PAOLINI
More informationME 391Q Network Flow Programming
ME 9Q Network Flow Programming Final Exam, Summer 00. ( Points) The figure below shows an undirected network. The parameters on the edges are the edge lengths. Find the shortest path tree using Dijkstra
More informationFinding an optimal seating arrangement for employees traveling to an event
Croatian Operational Research Review 419 CRORR 6(2015), 419 427 Finding an optimal seating arrangement for employees traveling to an event Ninoslav Čerkez 1, Rebeka Čorić 2, Mateja Dumić 2, and Domagoj
More informationAn Extension of the Multicut L-Shaped Method. INEN Large-Scale Stochastic Optimization Semester project. Svyatoslav Trukhanov
An Extension of the Multicut L-Shaped Method INEN 698 - Large-Scale Stochastic Optimization Semester project Svyatoslav Trukhanov December 13, 2005 1 Contents 1 Introduction and Literature Review 3 2 Formal
More informationLocal search heuristic for multiple knapsack problem
International Journal of Intelligent Information Systems 2015; 4(2): 35-39 Published online February 14, 2015 (http://www.sciencepublishinggroup.com/j/ijiis) doi: 10.11648/j.ijiis.20150402.11 ISSN: 2328-7675
More informationMASS Modified Assignment Algorithm in Facilities Layout Planning
International Journal of Tomography & Statistics (IJTS), June-July 2005, Vol. 3, No. JJ05, 19-29 ISSN 0972-9976; Copyright 2005 IJTS, ISDER MASS Modified Assignment Algorithm in Facilities Layout Planning
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationAn Efficient Heuristic Algorithm for Capacitated Lot Sizing Problem with Overtime Decisions
An Efficient Heuristic Algorithm for Capacitated Lot Sizing Problem with Overtime Decisions Cagatay Iris and Mehmet Mutlu Yenisey Department of Industrial Engineering, Istanbul Technical University, 34367,
More informationGlobal Solution of Mixed-Integer Dynamic Optimization Problems
European Symposium on Computer Arded Aided Process Engineering 15 L. Puigjaner and A. Espuña (Editors) 25 Elsevier Science B.V. All rights reserved. Global Solution of Mixed-Integer Dynamic Optimization
More informationA Row-and-Column Generation Method to a Batch Machine Scheduling Problem
The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 301 308 A Row-and-Column Generation
More informationA Column Generation Framework for Berth Scheduling at Port Terminals
A Column Generation Framework for Berth Scheduling at Port Terminals Yousra Saadaoui Nitish Umang Emma Frejinger May 2015 CIRRELT-2015-15 A Column Generation Framework for Berth Scheduling at Port Terminals
More informationParallel Machine Scheduling: A (Meta)Heuristic Computational Evaluation IRCCyN, Avril 2001, Nantes
Parallel Machine Scheduling: A (Meta)Heuristic Computational Evaluation IRCCyN, Avril 2001, Nantes Marc Sevaux, Philippe Thomin Marc.Sevaux, Philippe.Thomin @univ-valenciennes.fr. University of Valenciennes
More informationSolving Capacitated P-Median Problem by Hybrid K-Means Clustering and Fixed Neighborhood Search algorithm
Proceedings of the 2010 International Conference on Industrial Engineering and Operations Management Dhaka, Bangladesh, January 9 10, 2010 Solving Capacitated P-Median Problem by Hybrid K-Means Clustering
More informationFundamentals of Integer Programming
Fundamentals of Integer Programming Di Yuan Department of Information Technology, Uppsala University January 2018 Outline Definition of integer programming Formulating some classical problems with integer
More informationA note on an L-approach for solving the manufacturer s pallet loading problem
A note on an L-approach for solving the manufacturer s pallet loading problem Ernesto G. Birgin Reinaldo Morabito Fabio H. Nishihara November 19 th, 2004. Abstract An L-approach for packing (l, w)-rectangles
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationA simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints
A simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints Sohaib Afifi 1, Duc-Cuong Dang 1,2, and Aziz Moukrim 1 1 Université de Technologie de Compiègne
More informationComputational Complexity CSC Professor: Tom Altman. Capacitated Problem
Computational Complexity CSC 5802 Professor: Tom Altman Capacitated Problem Agenda: Definition Example Solution Techniques Implementation Capacitated VRP (CPRV) CVRP is a Vehicle Routing Problem (VRP)
More informationBranch-and-Bound Algorithms for Constrained Paths and Path Pairs and Their Application to Transparent WDM Networks
Branch-and-Bound Algorithms for Constrained Paths and Path Pairs and Their Application to Transparent WDM Networks Franz Rambach Student of the TUM Telephone: 0049 89 12308564 Email: rambach@in.tum.de
More information56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997
56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997 Answer #1 and any five of the remaining six problems! possible score 1. Multiple Choice 25 2. Traveling Salesman Problem 15 3.
More informationA Benders decomposition approach for the robust shortest path problem with interval data
A Benders decomposition approach for the robust shortest path problem with interval data R. Montemanni, L.M. Gambardella Istituto Dalle Molle di Studi sull Intelligenza Artificiale (IDSIA) Galleria 2,
More informationLecture notes on Transportation and Assignment Problem (BBE (H) QTM paper of Delhi University)
Transportation and Assignment Problems The transportation model is a special class of linear programs. It received this name because many of its applications involve determining how to optimally transport
More informationINSERTION SORT APPROACH FOR THE CAR SEQUENCING PROBLEM
195 The 5 th International Conference on Information & Communication Technology and Systems INSERTION SORT APPROACH FOR THE CAR SEQUENCING PROBLEM Bilqis Amaliah 1, Chastine Fatichah 2 1,2 Informatics
More informationVariable Neighbourhood Search for Uncapacitated Warehouse Location Problems
International Journal of Engineering and Applied Sciences (IJEAS) ISSN: 2394-3661, Volume-3, Issue-1, January 2016 Variable Neighbourhood Search for Uncapacitated Warehouse Location Problems Kemal Alaykiran,
More informationMethods and Models for Combinatorial Optimization Heuristis for Combinatorial Optimization
Methods and Models for Combinatorial Optimization Heuristis for Combinatorial Optimization L. De Giovanni 1 Introduction Solution methods for Combinatorial Optimization Problems (COPs) fall into two classes:
More informationA Note on the Separation of Subtour Elimination Constraints in Asymmetric Routing Problems
Gutenberg School of Management and Economics Discussion Paper Series A Note on the Separation of Subtour Elimination Constraints in Asymmetric Routing Problems Michael Drexl March 202 Discussion paper
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationDecision Aid Methodologies In Transportation Lecture 1: Polyhedra and Simplex method
Decision Aid Methodologies In Transportation Lecture 1: Polyhedra and Simplex method Chen Jiang Hang Transportation and Mobility Laboratory April 15, 2013 Chen Jiang Hang (Transportation and Mobility Decision
More informationAn Efficient MILP Model for the Short-Term. Scheduling of Single Stage Batch Plants
An Efficient MILP Model for the Short-Term Scheduling of Single Stage Batch Plants Pedro M. Castro *,, and Ignacio E. Grossmann Departamento de Modelação e Simulação de Processos, INETI, 1649-038 Lisboa,
More informationAn Integrated Design Algorithm for Detailed Layouts Based on the Contour Distance
An Integrated Design Algorithm for Detailed Layouts Based on the Contour Distance Jae-Gon Kim and Marc Goetschalckx School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta,
More informationCrew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007)
In the name of God Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm Spring 2009 Instructor: Dr. Masoud Yaghini Outlines Problem Definition Modeling As A Set Partitioning
More informationNP-Hardness. We start by defining types of problem, and then move on to defining the polynomial-time reductions.
CS 787: Advanced Algorithms NP-Hardness Instructor: Dieter van Melkebeek We review the concept of polynomial-time reductions, define various classes of problems including NP-complete, and show that 3-SAT
More informationPolynomial Time Algorithms for Scheduling of Arrival Aircraft
Polynomial Time Algorithms for Scheduling of Arrival Aircraft Kaushik Roy Alexandre M. Bayen Claire J. Tomlin A Mixed Integer Linear Program (MILP) formulation of an arrival traffic scheduling problem
More informationHEURISTIC ALGORITHMS FOR THE GENERALIZED MINIMUM SPANNING TREE PROBLEM
Proceedings of the International Conference on Theory and Applications of Mathematics and Informatics - ICTAMI 24, Thessaloniki, Greece HEURISTIC ALGORITHMS FOR THE GENERALIZED MINIMUM SPANNING TREE PROBLEM
More informationA Memetic Algorithm for Parallel Machine Scheduling
A Memetic Algorithm for Parallel Machine Scheduling Serafettin Alpay Eskişehir Osmangazi University, Industrial Engineering Department, Eskisehir, Turkiye Abstract - This paper focuses on the problem of
More informationA Case Study on Earliness/Tardiness Scheduling by Constraint Programming
A Case Study on Earliness/Tardiness Scheduling by Constraint Programming Jan Kelbel, Zdeněk Hanzálek Department of Control Engineering, Faculty of Electrical Engineering Czech Technical University in Prague
More informationIMPLEMENTATION OF A FIXING STRATEGY AND PARALLELIZATION IN A RECENT GLOBAL OPTIMIZATION METHOD
IMPLEMENTATION OF A FIXING STRATEGY AND PARALLELIZATION IN A RECENT GLOBAL OPTIMIZATION METHOD Figen Öztoprak, Ş.İlker Birbil Sabancı University Istanbul, Turkey figen@su.sabanciuniv.edu, sibirbil@sabanciuniv.edu
More informationThe Simplex Algorithm for LP, and an Open Problem
The Simplex Algorithm for LP, and an Open Problem Linear Programming: General Formulation Inputs: real-valued m x n matrix A, and vectors c in R n and b in R m Output: n-dimensional vector x There is one
More informationCHAPTER 3 A TIME-DEPENDENT k-shortest PATH ALGORITHM FOR ATIS APPLICATIONS
CHAPTER 3 A TIME-DEPENDENT k-shortest PATH ALGORITHM FOR ATIS APPLICATIONS 3.1. Extension of a Static k-sp Algorithm to the Time-Dependent Case Kaufman and Smith [1993] showed that under the consistency
More informationGENERALIZED ASSIGNMENT PROBLEM
Chapter 3 GENERALIZED ASSIGNMENT PROBLEM 1 1 A part of this chapter appears in International Journal of Computational and Mathematical Sciences Vol.3:8, 418-423, 2009 as A new heuristic approach for the
More informationBi-Objective Optimization for Scheduling in Heterogeneous Computing Systems
Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado
More informationAssignment 3b: The traveling salesman problem
Chalmers University of Technology MVE165 University of Gothenburg MMG631 Mathematical Sciences Linear and integer optimization Optimization with applications Emil Gustavsson Assignment information Ann-Brith
More informationA two-level metaheuristic for the All Colors Shortest Path Problem
Noname manuscript No (will be inserted by the editor) A two-level metaheuristic for the All Colors Shortest Path Problem F Carrabs R Cerulli R Pentangelo A Raiconi Received: date / Accepted: date Abstract
More informationOptimization Techniques for Design Space Exploration
0-0-7 Optimization Techniques for Design Space Exploration Zebo Peng Embedded Systems Laboratory (ESLAB) Linköping University Outline Optimization problems in ERT system design Heuristic techniques Simulated
More informationA Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Mario Ruthmair and Günther R. Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology,
More informationHeuristics in MILP. Group 1 D. Assouline, N. Molyneaux, B. Morén. Supervisors: Michel Bierlaire, Andrea Lodi. Zinal 2017 Winter School
Heuristics in MILP Group 1 D. Assouline, N. Molyneaux, B. Morén Supervisors: Michel Bierlaire, Andrea Lodi Zinal 2017 Winter School 0 / 23 Primal heuristics Original paper: Fischetti, M. and Lodi, A. (2011).
More informationBranch-price-and-cut for vehicle routing. Guy Desaulniers
Guy Desaulniers Professor, Polytechnique Montréal, Canada Director, GERAD, Canada VeRoLog PhD School 2018 Cagliari, Italy, June 2, 2018 Outline 1 VRPTW definition 2 Mathematical formulations Arc-flow formulation
More informationLOCAL SEARCH FOR THE MINIMUM FUNDAMENTAL CYCLE BASIS PROBLEM
LOCAL SEARCH FOR THE MINIMUM FUNDAMENTAL CYCLE BASIS PROBLEM Abstract E.Amaldi, L.Liberti, N.Maculan, F.Maffioli DEI, Politecnico di Milano, I-20133 Milano amaldi,liberti,maculan,maffioli @elet.polimi.it
More informationα Coverage to Extend Network Lifetime on Wireless Sensor Networks
Noname manuscript No. (will be inserted by the editor) α Coverage to Extend Network Lifetime on Wireless Sensor Networks Monica Gentili Andrea Raiconi Received: date / Accepted: date Abstract An important
More informationInstituto Nacional de Pesquisas Espaciais - INPE/LAC Av. dos Astronautas, 1758 Jd. da Granja. CEP São José dos Campos S.P.
XXXIV THE MINIMIZATION OF TOOL SWITCHES PROBLEM AS A NETWORK FLOW PROBLEM WITH SIDE CONSTRAINTS Horacio Hideki Yanasse Instituto Nacional de Pesquisas Espaciais - INPE/LAC Av. dos Astronautas, 1758 Jd.
More informationRecursive column generation for the Tactical Berth Allocation Problem
Recursive column generation for the Tactical Berth Allocation Problem Ilaria Vacca 1 Matteo Salani 2 Michel Bierlaire 1 1 Transport and Mobility Laboratory, EPFL, Lausanne, Switzerland 2 IDSIA, Lugano,
More informationSingle Machine Scheduling with Interfering Job Sets. Arizona State University PO Box Tempe, AZ
Single Machine Scheduling with Interfering Job Sets Ketan Khowala 1,3, John Fowler 1,3, Ahmet Keha 1* and Hari Balasubramanian 2 1 Department of Industrial Engineering Arizona State University PO Box 875906
More information2. Modeling AEA 2018/2019. Based on Algorithm Engineering: Bridging the Gap Between Algorithm Theory and Practice - ch. 2
2. Modeling AEA 2018/2019 Based on Algorithm Engineering: Bridging the Gap Between Algorithm Theory and Practice - ch. 2 Content Introduction Modeling phases Modeling Frameworks Graph Based Models Mixed
More informationInteger Programming Chapter 9
1 Integer Programming Chapter 9 University of Chicago Booth School of Business Kipp Martin October 30, 2017 2 Outline Branch and Bound Theory Branch and Bound Linear Programming Node Selection Strategies
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More informationTwo-Stage orders sequencing system for mixedmodel
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Two-Stage orders sequencing system for mixedmodel assembly Recent citations - Damian Krenczyk et al To cite this article: M Zemczak
More informationMetaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini
Metaheuristic Development Methodology Fall 2009 Instructor: Dr. Masoud Yaghini Phases and Steps Phases and Steps Phase 1: Understanding Problem Step 1: State the Problem Step 2: Review of Existing Solution
More informationCalculation of extended gcd by normalization
SCIREA Journal of Mathematics http://www.scirea.org/journal/mathematics August 2, 2018 Volume 3, Issue 3, June 2018 Calculation of extended gcd by normalization WOLF Marc, WOLF François, LE COZ Corentin
More informationA Development of Hybrid Cross Entropy-Tabu Search Algorithm for Travelling Repairman Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Development of Hybrid Cross Entropy-Tabu Search Algorithm for Travelling
More informationIntroduction to Optimization
Introduction to Optimization Approximation Algorithms and Heuristics November 6, 2015 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff INRIA Lille Nord Europe 2 Exercise: The Knapsack Problem
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2018 04 24 Lecture 9 Linear and integer optimization with applications
More informationSolving the p-center Problem with Tabu Search and Variable Neighborhood Search
Solving the p-center Problem with Tabu Search and Variable Neighborhood Search Nenad Mladenović Service de Mathématiques de la Gestion, Université Libre de Bruxelles, Brussels, Belgium; GERAD and HEC Montréal,
More informationBi-objective Network Flow Optimization Problem
Bi-objective Network Flow Optimization Problem Pedro Miguel Guedelha Dias Department of Engineering and Management, Instituto Superior Técnico June 2016 Abstract Network flow problems, specifically minimum
More informationDynamic Service Definition in the future mixed Surveillance environment
Dynamic Service Definition in the future mixed Surveillance environment Dr. Christos M. Rekkas Jean-Marc Duflot Pieter van der Kraan Surveillance Unit EUROCONTROL Rue de la Fusée 96, Brussels 1130, Belgium
More informationEmpirical analysis of procedures that schedule unit length jobs subject to precedence constraints forming in- and out-stars
Empirical analysis of procedures that schedule unit length jobs subject to precedence constraints forming in- and out-stars Samuel Tigistu Feder * Abstract This paper addresses the problem of scheduling
More informationA COMPUTATIONAL STUDY OF THE CONSTRAINED MAXIMUM FLOW PROBLEM
COMPUTTIONL STUDY OF THE CONSTRINED MXIMUM FLOW PROBLEM Cenk Çalışkan, Woodbury School of Business, Utah Valley University, 800 W. University Pkwy, Orem, UT 84058, (801) 863-6487, cenk.caliskan@uvu.edu
More informationA Tabu Search solution algorithm
Chapter 5 A Tabu Search solution algorithm The TS examines a trajectory sequence of solutions and moves to the best neighbor of the current solution. To avoid cycling, solutions that were recently examined
More informationComplementary Graph Coloring
International Journal of Computer (IJC) ISSN 2307-4523 (Print & Online) Global Society of Scientific Research and Researchers http://ijcjournal.org/ Complementary Graph Coloring Mohamed Al-Ibrahim a*,
More informationHeuristic Optimization Introduction and Simple Heuristics
Heuristic Optimization Introduction and Simple Heuristics José M PEÑA (jmpena@fi.upm.es) (Universidad Politécnica de Madrid) 1 Outline 1. What are optimization problems? 2. Exhaustive vs. Heuristic approaches
More informationThe simplex method and the diameter of a 0-1 polytope
The simplex method and the diameter of a 0-1 polytope Tomonari Kitahara and Shinji Mizuno May 2012 Abstract We will derive two main results related to the primal simplex method for an LP on a 0-1 polytope.
More informationParallel Machine Scheduling: A (Meta)Heuristic Computational Evaluation MIC 2001, Porto, Portugal
Parallel Machine Scheduling: A (Meta)Heuristic Computational Evaluation MIC 2001, Porto, Portugal Marc Sevaux, Philippe Thomin fmarc.sevaux, Philippe.Thoming@univ-valenciennes.fr. University of Valenciennes
More informationAn MILP Model for Short Term Scheduling. of a Special Class of Multipurpose Batch Plants
An MILP Model for hort Term cheduling of a pecial Class of Multipurpose Batch Plants ungdeuk Moon and Andrew N. Hrymak McMaster Advanced Control Consortium Department of Chemical Engineering, McMaster
More informationWireless frequency auctions: Mixed Integer Programs and Dantzig-Wolfe decomposition
Wireless frequency auctions: Mixed Integer Programs and Dantzig-Wolfe decomposition Laszlo Ladanyi (IBM T.J. Watson Research Center) joint work with Marta Eso (The Hotchkiss School) David Jensen (IBM T.J.
More informationModeling the Component Pickup and Placement Sequencing Problem with Nozzle Assignment in a Chip Mounting Machine
Modeling the Component Pickup and Placement Sequencing Problem with Nozzle Assignment in a Chip Mounting Machine Hiroaki Konishi, Hidenori Ohta and Mario Nakamori Department of Information and Computer
More information5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing. 6. Meta-heuristic Algorithms and Rectangular Packing
1. Introduction 2. Cutting and Packing Problems 3. Optimisation Techniques 4. Automated Packing Techniques 5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing 6.
More informationColumn Generation Method for an Agent Scheduling Problem
Column Generation Method for an Agent Scheduling Problem Balázs Dezső Alpár Jüttner Péter Kovács Dept. of Algorithms and Their Applications, and Dept. of Operations Research Eötvös Loránd University, Budapest,
More informationEvaluation of CDA as A Standard Terminal Airspace Operation
Partnership for AiR Transportation Noise and Emission Reduction An FAA/NASA/TC/DOD/EPA-sponsored Center of Excellence Evaluation of CDA as A Standard Terminal Airspace Operation School of Aeronautics &
More informationSPATIAL OPTIMIZATION METHODS
DELMELLE E. (2010). SPATIAL OPTIMIZATION METHODS. IN: B. WHARF (ED). ENCYCLOPEDIA OF HUMAN GEOGRAPHY: 2657-2659. SPATIAL OPTIMIZATION METHODS Spatial optimization is concerned with maximizing or minimizing
More information1. Lecture notes on bipartite matching February 4th,
1. Lecture notes on bipartite matching February 4th, 2015 6 1.1.1 Hall s Theorem Hall s theorem gives a necessary and sufficient condition for a bipartite graph to have a matching which saturates (or matches)
More informationCOMP9334: Capacity Planning of Computer Systems and Networks
COMP9334: Capacity Planning of Computer Systems and Networks Week 10: Optimisation (1) A/Prof Chun Tung Chou CSE, UNSW COMP9334, Chun Tung Chou, 2016 Three Weeks of Optimisation The lectures for these
More informationHeuristics in Commercial MIP Solvers Part I (Heuristics in IBM CPLEX)
Andrea Tramontani CPLEX Optimization, IBM CWI, Amsterdam, June 12, 2018 Heuristics in Commercial MIP Solvers Part I (Heuristics in IBM CPLEX) Agenda CPLEX Branch-and-Bound (B&B) Primal heuristics in CPLEX
More informationMetaheuristic Optimization with Evolver, Genocop and OptQuest
Metaheuristic Optimization with Evolver, Genocop and OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Last revision:
More informationDelivery Network on the Internet
Optimal erver Placement for treaming Content Delivery Network on the Internet Xiaojun Hei and Danny H.K. Tsang Department of Electronic and Computer Engineering Hong Kong University of cience and Technology
More informationComparison of Interior Point Filter Line Search Strategies for Constrained Optimization by Performance Profiles
INTERNATIONAL JOURNAL OF MATHEMATICS MODELS AND METHODS IN APPLIED SCIENCES Comparison of Interior Point Filter Line Search Strategies for Constrained Optimization by Performance Profiles M. Fernanda P.
More informationInteger Programming ISE 418. Lecture 1. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 1 Dr. Ted Ralphs ISE 418 Lecture 1 1 Reading for This Lecture N&W Sections I.1.1-I.1.4 Wolsey Chapter 1 CCZ Chapter 2 ISE 418 Lecture 1 2 Mathematical Optimization Problems
More information