Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 234 for “"CPLEX"”.
-
Computerized approaches to enhance understanding of organic reaction mechanisms: CAN reaction mechanisms and CPLEX prelaboratory methodology.
… Second, computerized prelaboratory experiments (CPLEX) for organic chemistry laboratory 1 & 2 courses have been created, used, and evaluated (Chapters 2 and 3). These computerized prelabs are unique because they combine both “dry lab” actions with detailed animations of the actual chemistry …
-
Genetic algorithm framework for stochastic open pit mining optimization problems
… were compared to a MILP model solved with CPLEX and the SGA scenario was compared to a SMILP model solved with CPLEX as a means to validate and analyze the GA results. There was a 53.6% improvement in the computational time for the DGA compared to the MILP model with CPLEX in Case Study 1. …
-
A Study on Integrated Transportation and Facility Location Problem
… those obtainable from standard solvers such as CPLEX. The FCSLTP is formulated and solved using the CPLEX commercial optimization suite. A Lagrange Relaxation Heuristic (LRH) and a Hybrid Genetic Algorithm (GA) solution of the FCSLTP are presented as alternative solutions. Comparative studies …
-
Health Service Support Networks Under Antiaircraft Threat
… provided. CAT A* is shown to be superior to both CPLEX and classical A*. CPLEX is slow and cannot solve realistic sized 2-LAEP instances while classical A* frequently fails to find optimal paths. Our SA and TS based metaheuristic hybrids are shown to be superior to CPLEX inasmuch as CPLEX is …
-
A Large-Scale Neighborhood Search Algorithm for Multi-Activity Tour Scheduling Problems
… not use any closed-source commercial solver like CPLEX. Computational experiments are carried out on the industrial and randomly generated instances to evaluate the performance of the IP solved by CPLEX and the proposed algorithm. Results reveal that our method outperforms CPLEX in both solution …
-
Algorithms for an Unmanned Vehicle Path Planning Problem
… to optimality by using the Concert Technology of CPLEX. We used the results generated by CPLEX to determine the quality of the solutions produced by the heuristics. By comparing the objective values of the obtained solutions and the running times of the heuristics and CPLEX, one can conclude that …
-
Exterior Penalty Approaches for Solving Linear Programming Problems
… we also solve the test problems using CPLEX 6.0, an advanced simplex implementation. While a particular variant (ALAG2) of ALAG performed the best for randomly generated test problems, ASL2 performed the best for the NETLIB test problems. Moreover, for test problems having only equality …
-
Linear Programming Algorithms Using Least-Squares Method
… least-squares algorithm perform better than the CPLEX Primal solver, but are slower than the CPLEX Dual solver. The least-squares network flow algorithm performs as fast as the CPLEX Network solver.
-
Algoritmo relax-and-cut para o problema do conjunto independente máximo
… submitted, in that reinforced form, to solver CPLEX. The Relax-and-Cut algorithm, just by itself and restricted to dualizing only clique inequalities, was able to attain optimal primal or dual bounds for 107 of the 119 instances tested. On the other hand, the exact Relax-and-Cut-CPLEX algorithm …
-
Three-Dimensional Capacitated Vehicle Routing Problems with Loading Constraints
… vehicle loading problem and solve it by CPLEX. To deal with large-sized instances, Column Generation (CG) technique is applied. The designed method in this work outperforms the best existing techniques in the literature. The 3DVLP with allocation and capacity constraints, called 3DVLP-AC, …
-
Optimal data allocation method considering privacy enhancement using E-CARGO
… find the optimal allocation using the IBM ILOG CPLEX Optimization (CPLEX) Package. At a given scale, the allocation scheme scores based on our method improve by about 50% compared to the baseline method and the trust-based method. Moreover, we use a similar approach to analyze procurement issues …
-
A Multi-agent Reinforcement Learning Approach to the Schedule and Aircraft Recovery Problem in Airline Disruption Management
… achieved objective values within 1% of the CPLEX exact solution, while the two-stage SARL achieved a 9.14% gap, highlighting the importance of agents' collaboration in SARP. A key difference between CPLEX and MARL is that CPLEX cancelled early flights to minimise cascade disruption effects, …
-
Mathematical Models for Designing Integrated Sustainable Manufacturing Systems
… use of branch-and-bound and branch-and-cut of CPLEX. The second model is the extension of the first model by taking operation sequences, machine adjacency constraints, alternative process routings, and outsourcing option of the part demands into consideration. This mathematical model is solved …
-
Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges
… developed integer program (IP) solved using CPLEX with respect to the quality of the solution and the computational time required to solve it. Findings of these tests show that the greedy heuristic handles the test problems with only a small optimality gap to the genetic algorithm and optimal …
-
Matematisk optimering för leveransplanering av sockerbetor
… av modellen sker via en implementation i lösaren CPLEX. Modellen verifieras genom att skapa fyra stycken delproblem som löses analytiskt och numeriskt där svaren jämförs. Avslutningsvis diskuteras modellens lösning och tidskomplexitet inklusive lösningstid sett till de modelleringsval och …
-
Kombinatorické optimalizační úlohy v odpadovém hospodářství
… reálná data a porovnáním softwarů MATLAB a ILOG CPLEX. Jako poslední jsou představeny metody hierarchického shlukování a kmeans, které jsou pak aplikovány na konkrétní úlohy velkých rozměrů.
-
Branch-and-cut for piecewise linear optimization
… tests were conducted using callable libraries of CPLEX and GUROBI. Finally, we also analyzed the results of piecewise linear optimization problems with semi- continuous constraints.
-
Branch-and-price and multicommodity flows
… algorithm was more efficient than Cplex 6.6 in the sets of instances where each commodity is defined by an origin-destination pair; for some of the other sets of instances, Cplex 6.6 gave better time results. In the binary problem, all the flow of each commodity must be routed along …
-
A MULTI-AGENT FRAMEWORK APPLIED TO THE QUAY CRANE SCHEDULING PROBLEM IN CONTAINER TERMINAL PORTS
… each vessel are input parameters to the problem. CPLEX is used to solve the model to optimality for small test cases. We propose a multi-agent framework to deal with larger-sized problems. Lower bounds on the optimal vessel makespan can be obtained by ranking bay region according to the number of …
-
Underground production scheduling optimization with ventilation constraints
… The author evaluates two solution methods, the CPLEX optimization package and the OMP Solver, and compares solution time. The OMP Solver schedules are compared to manual production schedules, with and without ventilation constraints. These comparisons show that with the OMP solver, it is …
Page 1 of 12