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 49 for “"CPLEX"”.

  1. Computational experiments for local search algorithms for binary and mixed integer optimization

    … performance. We also compare our algorithms with CPLEX on large amount of fairly large-size instances. Based on the experimental results, our binary optimization algorithm delivers performance that is strictly better than CPLEX on instances with moderately dense constraint matrices, while for …

    mit Repository record for Computational experiments for local search algorithms for binary and mixed integer optimization (opens in a new tab)

  2. 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 …

    pretoria Repository record for A Study on Integrated Transportation and Facility Location Problem (opens in a new tab)

  3. 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 …

    vt Repository record for Exterior Penalty Approaches for Solving Linear Programming Problems (opens in a new tab)

  4. Multi-period optimal network flow and pricing strategy for commodity online retailer

    … The model is built in OPL and solved by CPLEX. We then carry out some numerical analyses and tests to validate the correctness of the model and demonstrate its utility. The second one is an advanced model treating product prices and market demand as additional decision variables. The …

    mit Repository record for Multi-period optimal network flow and pricing strategy for commodity online retailer (opens in a new tab)

  5. DeepGridMCLP: A Deep Reinforcement Learning Approach to Solve the Maximal Covering Location Problem with Facilities in Continuous Regions

    … with the solutions based on a commercial solver (CPLEX) and a heuristic method (Genetic Algorithm). Results demonstrate that my DRL model effectively solves the C-MCLP; it exhibits advantages in identifying better solutions compared to the GA-based heuristic model\, and achieves faster computation …

    claremont Repository record for DeepGridMCLP: A Deep Reinforcement Learning Approach to Solve the Maximal Covering Location Problem with Facilities in Continuous Regions (opens in a new tab)

  6. Resident Scheduling Problem

    … the problem is also solved exactly via the CPLEX-MIP package. The contribution of this work is important since many hospitals are still utilizing manual techniques in preparing their own schedules, expending considerable effort and time with less scheduling flexibility.

    vt Repository record for Resident Scheduling Problem (opens in a new tab)

  7. Mixed-Integer Mathematical Programming Optimization Models and Algorithms For An Oil Tanker Routing and Scheduling Problem

    … problem. The initial formulation is solved using CPLEX 4.0 mixed integer programming capabilities for a number of relatively small-sized test cases, and pertinent results and computational difficulties are reported. The aggregate formulation is solved using CPLEX 4.0 MIP in concert with …

    vt Repository record for Mixed-Integer Mathematical Programming Optimization Models and Algorithms For An Oil Tanker Routing and Scheduling Problem (opens in a new tab)

  8. Routing algorithms for optimisation of transportation systems

    … of the proposed algorithm compared to the CPLEX solver from IBM on a wide range of generated instances. A real-world scenario is also studied to demonstrate the relevance of this method. Second, this research focuses on the way the VRP can be solved while considering an important number of …

    liverpool-jm Repository record for Routing algorithms for optimisation of transportation systems (opens in a new tab)

  9. Network design and fleet allocation model for vessel operation

    … Optimization Programming language, and solved by CPLEX. This model provides several feasible fleet allocation proposals ranked by their profits, as well as yields the output of the detail cargo assignment at each port, the revenue, cost, and profit breakdown for each proposal.

    mit Repository record for Network design and fleet allocation model for vessel operation (opens in a new tab)

  10. An approximate dynamic programming approach to discrete optimization

    … including state of art commercial packages like CPLEX. Our benchmarks for comparison are solution quality, running time and robustness (i.e., small deviations in the computational resources such as running time for varying instances of same size). In this thesis, we particularly focus on knapsack …

    mit Repository record for An approximate dynamic programming approach to discrete optimization (opens in a new tab)

  11. Generating cutting planes through inequality merging on multiple variables in knapsack problems

    … an MVMCI improved the solution time required by CPLEX, a commercial integer programming solver, by 6.3% on average.

    ksu Repository record for Generating cutting planes through inequality merging on multiple variables in knapsack problems (opens in a new tab)

  12. Gitterbasenreduktion mit Random Sampling und heuristischen Erweiterungen

    … Im Vergleich mit dem kommerziellen Programm CPLEX, das einen völlig anderen Ansatz zur Lösung von ganzzahlig-linearen Gleichungssystemen verfolgt, konnten sogar sehr gute Ergebnisse erzielt werden.

    bayreuth Repository record for Gitterbasenreduktion mit Random Sampling und heuristischen Erweiterungen (opens in a new tab)

  13. Integer optimization in data mining

    … Testing against popular heuristic methods and CPLEX 8.0's quadratic mixed-integer solver, we see that our tailored approach to these quadratic variable selection problems have significant advantages over simple heuristics and generalized solvers.

    mit Repository record for Integer optimization in data mining (opens in a new tab)

  14. Design of Prosumer Migrogrid and Virtual Power Plants for Multi-tier Manufacturing Supply Chains

    … with A Mathematical Programming Language using CPLEX solver. The feasibility of the energy solution is further examined through numerical experiments in ten US cities based on 11-year hourly meteorological data. The study shows that integrating onsite renewable energy is a key to mitigating …

    texas-state Repository record for Design of Prosumer Migrogrid and Virtual Power Plants for Multi-tier Manufacturing Supply Chains (opens in a new tab)

  15. Empty Railcar Repositioning Subject to Travel Time Uncertainty

    … SNCF¹. The resulting schedule is computed with CPLEX and minimizes moving cost, delay and unfulllment penalties. Substitutions of railcar categories are also permitted and eventually penalized. In addition, uncertainty on travel times is handled by considering the expected cost of a move …

    vt Repository record for Empty Railcar Repositioning Subject to Travel Time Uncertainty (opens in a new tab)

  16. A hybrid crow search-based method for solving the closed loop supply chain network design

    … achieves solution quality comparable to that of CPLEX while substantially reducing computation time, with average runtime dropping from 2,416 s to 158 s on two-period instances and from 3,118 s to 647 s on five-period instances. A further contribution is the extension of the framework to …

    exeter

  17. Cross-Docking: A Proven LTL Technique to Help Suppliers Minimize Products' Unit Costs Delivered to the Final Customers

    … a complement enumeration method using ILOG CPLEX software, the Tabu search (TS) algorithm with four diversification methods is employed to solve larger size problems. The efficiency of the model is examined from two perspectives by comparing the output of two scenarios including; i.e., 1) …

    mississippi Repository record for Cross-Docking: A Proven LTL Technique to Help Suppliers Minimize Products' Unit Costs Delivered to the Final Customers (opens in a new tab)

  18. Bridging Machine Learning and Operations Research: From Decision-Focused Learning to Learning to Optimize

    … in commercial solvers such as Gurobi and CPLEX, and continued improvements in computing hardware, optimization problems involving integer variables remain NP-hard and computationally intractable at scale. The massive scale and complexity of real-world systems further widen this gap, making …

    toronto-retro Repository record for Bridging Machine Learning and Operations Research: From Decision-Focused Learning to Learning to Optimize (opens in a new tab)

  19. Evolutionary Algorithms and Simulation for Intelligent Autonomous Vehicles in Container Terminals

    … (with superior results to the state-of-the-art CPLEX solver), combining the proposed evolutionary algorithm with Monte Carlo simulation to take into account uncertainties, validating results of the uncertain case with a high fidelity simulation, proposing different robustness measures, comparing …

    liverpool-jm Repository record for Evolutionary Algorithms and Simulation for Intelligent Autonomous Vehicles in Container Terminals (opens in a new tab)

  20. Safety verification and control for collision avoidance at road intersections

    … in real-time by available software such as CPLEX. Based on the solutions to the safety verification problem, we design a supervisor and prove that it ensures safety and is nonblocking, another major challenge of verification-based algorithms. We validate the supervisor using computer …

    mit Repository record for Safety verification and control for collision avoidance at road intersections (opens in a new tab)

Page 1 of 3