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 61 for “"Mixed integer linear programming (MILP)"”.

  1. A mixed-integer linear programming (MILP) model for dynamic coordinated signal optimization along a traffic corridor

    … and induced demand. We develop a dynamic Mixed-Integer Linear Programming (MILP) framework for coordinated arterial signal optimization. Our contributions include a unified optimization model that jointly determines cycle length, phase sequencing, green-time allocation, and offset …

    utc Repository record for A mixed-integer linear programming (MILP) model for dynamic coordinated signal optimization along a traffic corridor (opens in a new tab)

  2. Optimization Models for Inland Haulage Transportation of Containers

    … ContainerSizes: an efficient assignment Mixed Integer Linear Programming (MILP) model is formulated which solves large scale instances in a reasonable solution time and can be implemented on variants of the container drayage problem. • Heterogenous Container Sizes: a Mixed Integer Linear

    essex Repository record for Optimization Models for Inland Haulage Transportation of Containers (opens in a new tab)

  3. Safe and Efficient Motion Planning in Robotic Manipulation through Formal Methods

    … addresses these issues by developing (1) a mixed-integer linear programming (MILP)-based approach to plan safe paths for rigid-body objects; and (2) a learned control barrier function (CBF) tailored for manipulators with multiple degrees of freedom (DoF) and an associated framework CBF-RRT …

    mit Repository record for Safe and Efficient Motion Planning in Robotic Manipulation through Formal Methods (opens in a new tab)

  4. Optimal Implementation of Simulink Models on Multicore Architectures with Partitioned Fixed Priority Scheduling

    … two approaches to solve the problem: (a) a mixed integer linear programming (MILP) formulation; and (b) a problem specific exact algorithm that may run several magnitudes faster than MILP.

    vt Repository record for Optimal Implementation of Simulink Models on Multicore Architectures with Partitioned Fixed Priority Scheduling (opens in a new tab)

  5. A distributed embedded software architecture for multiple Unmanned Aerial Vehicles

    … multithreaded module enables concurrent onboard Mixed-Integer Linear Programming (MILP) optimization. The Mission Manager Graphical User Interface (GUI) monitors the status of each Onboard Planning Module on a team of UAVs using the onboard planning protocol. Two task assignment scenarios are …

    mit Repository record for A distributed embedded software architecture for multiple Unmanned Aerial Vehicles (opens in a new tab)

  6. Bi objective multi depot location routing problem with time window for EVs

    … for electric vehicles (EVs), modeled as a Mixed Integer Linear Programming (MILP) problem. The mathematical model integrates cost minimization with workload fairness under time windows. A custom metaheuristic algorithm, combining a hybrid Genetic Algorithm (GA) and Ant Colony Optimization …

    uoit Repository record for Bi objective multi depot location routing problem with time window for EVs (opens in a new tab)

  7. Online trajectory planning for UAVs using mixed integer linear programming

    … thesis presents a improved path planner using mixed-integer linear programming (MILP) to solve a receding horizon optimization problem for unmanned aerial vehicles (UAV's). Using MILP, hard constraints for obstacle and multi-vehicle avoidance as well as an approximation of vehicle dynamics are …

    mit Repository record for Online trajectory planning for UAVs using mixed integer linear programming (opens in a new tab)

  8. SKYAPI: structural-aware orchestration for LLM-based multi-agent systems

    … into ordered execution stages, SkyAPI employs a Mixed-Integer Linear Programming (MILP) formulation to explicitly optimize the trade-off between stage makespan and monetary cost. Furthermore, we propose a prefix-aware scheduling mechanism with Time-To-First-Token (TTFT) deferral to maximize …

    uiuc Repository record for SKYAPI: structural-aware orchestration for LLM-based multi-agent systems (opens in a new tab)

  9. Distribution networks consolidation and optimization for a large industrial conglomerate

    … collaboration with company's representatives. A Mixed Integer Linear Programming (MILP) model was developed as a tool to solve the optimization problem, which involves moving 9 product types from 21 manufacturing plants, through 22 warehouses, and to 26 destination zones,. The results from the …

    mit Repository record for Distribution networks consolidation and optimization for a large industrial conglomerate (opens in a new tab)

  10. The traveling salesman problem with multiple drones : an optimization model for last-mile delivery

    … salesman problem. The model is constructed with mixed integer linear programming (MILP) optimization and assessed with a sensitivity analysis of several key parameters. We find significant median cost savings over TSP of 30 percent in the base case, and that these effects on savings can diminish …

    mit Repository record for The traveling salesman problem with multiple drones : an optimization model for last-mile delivery (opens in a new tab)

  11. Sustainable Closed-Loop Supply Chaing Network Design

    … problem was formulated deterministically via Mixed Integer Linear Programming (MILP), and nondeterministically via Fuzzy Multi-objective Mixed Integer Linear Programming (FMOMILP) model, by considering sustainability and uncertainty. Fuzzy programming approaches were utilized to solve the …

    regina Repository record for Sustainable Closed-Loop Supply Chaing Network Design (opens in a new tab)

  12. Safe trajectory planning of autonomous vehicles

    … as a receding horizon optimization problem using mixed-integer linear programming (MILP) to incorporate kino-dynamic, obstacle avoidance and collision avoidance constraints. Agile vehicle dynamics are captured through a hybrid control architecture that combines several linear time-invariant modes …

    mit Repository record for Safe trajectory planning of autonomous vehicles (opens in a new tab)

  13. Collaborative UAV path planning with deceptive strategies

    … techniques, a recursive algorithm and a Mixed Integer Linear Programming (MILP) model, that seek a unique optimal trajectory for a team of SUAVs or agents for a given environment. We then develop a set of heuristics governing the agents' optimal strategy or policy within the formalized …

    mit Repository record for Collaborative UAV path planning with deceptive strategies (opens in a new tab)

  14. Application of exact and approximate optimization methods to novel scheduling problems

    … for completing setup operations. Firstly, a Mixed Integer Linear Programming (MILP) model suitable for tackling small instances of the problem in hand is illustrated. Then, an optimization framework based on Genetic Algorithms (GAs) is presented with the aim of effectively addressing larger …

    catania Repository record for Application of exact and approximate optimization methods to novel scheduling problems (opens in a new tab)

  15. Tunable WCET for hard real-time multicore system

    … and two-level cache partitioning. We present a mixed integer linear programming (MILP) formulation as the solution to the optimization problem of tunable WCETs. Our experimental results show that the proposed methods can significantly lower overall system utilization.

    uiuc Repository record for Tunable WCET for hard real-time multicore system (opens in a new tab)

  16. Optimization techniques for task allocation and scheduling in distributed multi-agent operations

    … well as communication delays between agents. A Mixed Integer-Linear Programming (MILP) approach is presented in the context of a multi-agent problem-solving framework that enables optimal makespans to be computed for complex classifications of scheduling problems that take many different …

    mit Repository record for Optimization techniques for task allocation and scheduling in distributed multi-agent operations (opens in a new tab)

  17. Reinforcement Learning for Energy Storage Arbitrage in the Day-Ahead and Real-Time Markets with Accurate Li-Ion Battery Dynamics Model

    … the optimal policy, as determined by an advanced mixed-integer linear programming (MILP) model, on NYISO 2013 day-ahead electricity price data. We show that accounting for reinforcement learning results in learned policies that are comparable to the behavior of MILP-determined policies with …

    mit Repository record for Reinforcement Learning for Energy Storage Arbitrage in the Day-Ahead and Real-Time Markets with Accurate Li-Ion Battery Dynamics Model (opens in a new tab)

  18. Resiliency of interdependent gas and electricity systems : the New England case

    … total power plant capacity. In this thesis, a mixed integer linear programming (MILP) model of integrated gas and electricity system is used to do contingency analysis and determine components of both systems that are critical to improve resilience. The model's main contribution is that it …

    mit Repository record for Resiliency of interdependent gas and electricity systems : the New England case (opens in a new tab)

  19. Fair and Risk-Averse Resource Allocation in Transportation Systems under Uncertainties

    … develop efficient solution algorithms. We derive mixed-integer linear programming (MILP) formulations for these models, leveraging the unique properties of each model and linearizing non-linear terms. Additionally, we strengthen these models with valid inequalities. To efficiently solve these …

    vt Repository record for Fair and Risk-Averse Resource Allocation in Transportation Systems under Uncertainties (opens in a new tab)

  20. Exact and Heuristic Algorithms for the Job Shop Scheduling Problem with Earliness and Tardiness Over a Common Due Date

    … of the JIT approach in job shops. A dynamic programming procedure is developed to solve smaller instances of the problem, and a Multi-Agent Systems approach is developed and implemented to solve the problem for larger instances since this problem is known to be NP-Hard in a strong sense. A …

    odu Repository record for Exact and Heuristic Algorithms for the Job Shop Scheduling Problem with Earliness and Tardiness Over a Common Due Date (opens in a new tab)

Page 1 of 4