Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic programming”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 415 records · Page 23

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗

Protecting Customer Privacy Through Distributed Energy Resource Anonymization

Due to their stochastic nature, the increase of Renewable Energy Resources (RERs) as a primary source of energy for power grids creates challenges regarding the reliability and resilience of the system. In order to combat these obstacles, expansion of Distributed Energy Resources (DERs) and their participation in Demand Response (DR) programs is necessary. Widespread participation requires prioritizing customer privacy and addressing concerns that may arise regarding communication between DERs and the Grid Service Provider (GSP). This paper discusses the use of flow reservation resources to split the operating cycles of DER load profiles into unique phases. The splitting of phases increases anonymization of the DERs by making it more difficult to determine the individual characteristics of the device. We discuss an example of this using simulated DER load profile data and examine the resulting effectiveness by using a machine learning algorithm for classification, called Support Vector Machine (SVM).

Distributed Energy Resource, Anonymization, Renewa↗

On Parallelizing Single Dynamic Simulation Using HPC Techniques and APIs of Commercial Software

Time-domain simulations are heavily used in today’s planning and operation practices to assess power system transient stability and post-transient voltage/frequency profiles following severe contingencies to comply with industry standards. Because of the increased modeling complexity, it is several times slower than real time for state-of-the-art commercial packages to complete a dynamic simulation for a large-scale model. With the growing stochastic behavior introduced by emerging technologies, power industry has seen a growing need for performing security assessment in real time. This paper presents a parallel implementation framework to speed up a single dynamic simulation by leveraging the existing stability model library in commercial tools through their application programming interfaces (APIs). Several high performance computing (HPC) techniques are explored such as parallelizing the calculation of generator current injection, identifying fast linear solvers for network solution, and parallelizing data outputs when interacting with APIs in the commercial package, TSAT. The proposed method has been tested on a WECC planning base case with detailed synchronous generator models and exhibits outstanding scalable performance with sufficient accuracy.

Diao, Ruisheng↗

Stochastic Optimization for Grid Resilience. FY18 Final Technical Report

The optimal restoration problem lies at the foundation of the evaluation and improvement of resilience in power systems. In this report we present a scalable decomposition algorithm for solving this problem for realistic power systems. The algorithm has been developed in three major research threads, corresponding to the chapters in the present report. Chapter 1 studies mixed-integer programming (MIP) formulations for the requirement that each electrical island that appears after a recon guration must have at least one energized generator. We provide three alternative MIP formulations for this restriction, show their equivalence, and prove that two of them are stronger in terms of their linear programming relaxation than the formulation most commonly used in the power systems literature. Since the time to solve MIPs can vary signi cantly between equivalent formulations, we also present computational experiments on IEEE test systems for the Intentional Controlled Islanding (ICI) and the Black Start Allocation (BSA) problems. We observe that a polynomially separable, exponential in size, strong formulation yields the best performance for the BSA problem and exhibits a comparable performance to a linear in size, weak formulation for the ICI problem. Chapter 2 presents a methodology to generate mixed-integer linear approximations of the AC power ow equations governing lines, transformers (including tap regulators and phase shifters), shunt and series compensators, and consumption responsive to voltage. Our approximations are capable of capturing limitations for power grids under abnormal or uncommon operating conditions where common assumptions used in power ow relaxations may not hold. Particularly, the approximation captures overvoltages under almost no load, which is a major concern when energizing lines after a blackout. The method constructs piecewise linear approximations of the non-linear power ow equations by minimizing the squared approximation error over a subset of the feasible domain. We test the method using a realistic database for the Chilean system (1548 buses, 1114 lines, 564 transformers). The resulting approximations yield root mean square errors in the order of 0.05pu and are successfully applied to solve a transmission switching instance for the Chilean system. Chapter 3 presents our algorithm for optimal restoration. The algorithm works by partitioning the problem into a master problem and a slave problem. The master problem optimizes over energization sequences of generators, buses and branches, for the entire restoration horizon, while respecting the energization requiments studied in Chapter 1. The slave problem veri es that there exist power ow solutions supporting the energization sequences proposed by the master problem, adding cuts to the master if an infeasible sequence is detected.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DAKOTA Design Analysis Kit for Optimization and Terascale

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes (computational models) and iterative analysis methods. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and analysis of computational models on high performance computers.A user provides a set of DAKOTA commands in an input file and launches DAKOTA. DAKOTA invokes instances of the computational models, collects their results, and performs systems analyses. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, polynomial chaos, stochastic collocation, and epistemic methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as hybrid optimization, surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. Services for parallel computing, simulation interfacing, approximation modeling, fault tolerance, restart, and graphics are also included.

SciDAC↗

Multiscale Modeling and Uncertainty Quantification for Nuclear Fuel Performance

In this project, we will address the challenges associated with constructing high fidelity multiscale models of nuclear fuel performance. We (*) propose a novel approach for coupling mesoscale and macroscale models, (*) devise efficient numerical methods for simulating the coupled system, and (*) devise and analyze effective numerical approaches for error and uncertainty quantification for the coupled multiscale system. As an integral part of the project, we will carry out analysis of the effects of upscaling and downscaling, investigate efficient methods for stochastic sensitivity analysis of the individual macroscale and mesoscale models, and carry out a posteriori error analysis for computed results. We will pursue development and implementation of solutions in software used at Idaho National Laboratories on models of interest to the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Genetic monitoring of steelhead in the Klickitat River to estimate productivity, straying, and migration timing

Abstract Objective Salmonids with a complex life history variation present challenges for conservation management, but genetic approaches alongside fisheries monitoring can address questions regarding the viability of the natural populations. Methods We genotyped adult (n = 3108) and juvenile (n = 2624) samples of steelhead Oncorhynchus mykiss that were collected in the Klickitat River, Washington, USA at traps in the lower drainage to examine tributary level productivity, straying from outside sources, and variation in adult migration timing. Result Genetic assignment of steelhead from this system indicated that the majority were produced within or near tributaries of the middle Klickitat River (juvenile mean = 72.8%; adult mean = 87.3%). Analyses with parentage-based tagging identified that most hatchery-origin adults were assigned to the Skamania Hatchery (80.8%), as expected, since this has been the release stock for decades within the Klickitat River drainage. Hatchery-origin adults were also identified from programs operating outside the Klickitat River, which were primarily strays from Snake River hatcheries. Most natural-origin steelhead were assigned to the Klickitat River, but there were also natural-origin fish identified as strays from other regions of the Columbia River (22.3% of natural returns). We also examined genes known to be associated with migration timing in adult steelhead observed at the trap and observed a strong relationship between migration date and alleles for early and late migration, but individual outliers were detected across seasons. Conclusion Our results indicate that genetic variation of steelhead in the Klickitat River has been influenced by hatchery programs as well as natural-origin straying from other subbasins, but genetic diversity remains high throughout the subbasin, and both early and late migration alleles are maintained. The genetic diversity present in Klickitat River steelhead may enable this Endangered Species Act listed (threatened) species to better adapt to stochastic environmental conditions compared to less diverse populations.

Collins, Erin E. (ORCID:0000000260978479)↗

Communication: Programmable self-assembly of thin-shell mesostructures

For this article, we study numerically the possibility of programmable self-assembly of various thin-shell architectures. They include clusters isomorphic to fullerenes C 20 and C 60 , finite and infinite sheets, tube-shaped and toroidal mesostructures. Our approach is based on the recently introduced directionally functionalized nanoparticle platform, for which we employ a hybrid technique of Brownian dynamics with stochastic bond formation. By combining a number of strategies, we were able to achieve a near-perfect yield of the desired structures with a reduced “alphabet” of building blocks. Among those strategies are the following: the use of bending rigidity of the interparticle bond as a control parameter, programming the morphology with a seed architecture, use of chirality-preserving symmetries for reduction of the particle alphabet, and the hierarchic approach.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Zgoubi Users' Guide

The computer code zgoubi calculates trajectories of charged particles in magnetic and electric fields. At the origin specially adapted to the definition and adjustment of beam lines and magnetic spectrometers, it has so evolved that it allows the study of systems including complex sequences of optical elements such as dipoles, quadrupoles, arbitrary multipoles, FFAG magnets and other magnetic or electric devices, and is able as well to handle periodic structures. Compared to other codes, it presents several peculiarities, as follows - a non-exhaustive list : • a numerical method for integrating the Lorentz equation, based on Taylor series, which optimizes computing time and provides high accuracy and strong symplecticity, • spin tracking, using the same numerical method as for the Lorentz equation, • account of stochastic photon emission, and its effects on particle dynamics, • calculation of the synchrotron radiation electric field and spectra in arbitrary magnetic fields, from the ray-tracing outcomes, • the possibility of using a mesh, which allows ray-tracing from simulated or measured (1-D, 2-D or 3-D) electric and magnetic field maps, • a number Monte Carlo procedures : unlimited number of trajectories, in-flight decay, stochastic radiation, etc., • built-in fitting procedures allowing arbitrary variables and a large variety of constraints, easily expandable, • multi-turn tracking in circular accelerators including features proper to machine parameter calculation and survey, • simulation of time-varying power supplies, and • simulation of arbitrary radio-frequency programs. The initial version of zgoubi was dedicated to ray-tracing in magnetic elements, beam lines, spectrometers. It was perfected for the purpose of studying, and operating, the four spectrometers SPES I, II, III, IV at the Laboratoire National SATURNE (CEA-Saclay, France), and, later, SPEG at GANIL (Caen, France). Developments regarding spin tracking and ray-tracing in combined electric and magnetic fields were implemented, in the late 1980s and early 1990s respectively. In the mid-1990s, the computation of synchrotron radiation electromagnetic impulse and spectra was introduced, for the purpose of synchrotron radiation diagnostic R&D at LEP, and further applied to the design of the SR diagnostics installations at LHC in the early 2000s. In the mean time, several new optical elements were added, such as electro-magnetic and other electrostatic lenses. Used since several years for special studies in periodic machines (e.g., SATURNE at Saclay, COSY at Julich, LEP and LHC at CERN), zgoubi has also undergone extensive developments regarding storage ring related features. Many developments have been accomplished since the early 2000s in the frame of a number of project design and beam dynamics studies, as the neutrino factory, lepton and hadron colliders, spin studies at AGS and RHIC, etc. As a consequence the list of optical elements and the compendium of numerical methods, so-called “Glossary of Keywords” list, pp. 7 and 169, has stretched with new simulation and computing procedures, ranging from fitting (FIT2 procedure ; additional constraints) to overlapping magnetic field capabilities (DIPOLES, FFAG), spin manipulation (SPINR), optical elements (BEAMBEAM), radiation damping tools (SRLOSS) and many others (FAISTORE, MAP2D-E, OPTICS, PICKUPS, TWISS, etc.). The graphic interface to zgoubi (zpop, Part D) has undergone extensive developments, making it a convenient companion tool to the use of zgoubi.

43 PARTICLE ACCELERATORS↗

Stochastic Simulation of Complex Fluid Flows (Progress Report for period 07/01/2016 - 06/30/2018)

At a microscopic scale, fluids are composed of molecules whose positions and velocities are random. This gives rise to thermal fluctuations that span the whole range of scales from the microscopic through the mesoscopic, and even the macroscopic. The inclusion of thermal fluctuations is crucial in multi-scale models, which are an important theme in the research program of the DOE Office of Science, and in particular the ASCR Applied Mathematics program's priority focus area on modeling of complex systems involving processes that span vastly different time and/or length scales. In this five-year Early Career project, the PI Aleksandar Donev and collaborators developed computational algorithms for modeling complex fluid mixtures at small scales using a formulation based on fluctuating hydrodynamics. Novel computational methods were developed to model complex fluids with increasing physical complexity, starting from binary miscible and immiscible mixtures, going through multispecies non-reactive and reactive mixtures, and culminating with reactive electrolytes mixtures of neutral molecules and ions. In close collaboration with the group of John Bell at Lawrence Berkeley National Laboratory, the methods were implemented in a scalable computational framework suitable for modern parallel supercomputers, and made publicly available on github. A number of physical examples in which giant nonequilibrium fluctuations are improtant were studied, with a special focus on instabilities at a liquid-liquid interface driven by gravity, diffusion, reactions, and/or electric fields. The methods and codes developed in this project are expected to enable other novel applications in the DOE Basic Energy Sciences program, and engineering sciences more broadly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

FORCE-DISPATCHES Integration - Initial Demonstration

Integrated energy systems (IES) combine, in mutually beneficial ways, power from variable renewable energy sources and nuclear power plants (NPP) to improve economic viability under uncertain market and weather conditions. The open-source Framework for Optimization of Resources and Economics (FORCE) tool suite, developed at Idaho National Laboratory (INL), has enabled comprehensive modeling and simulation of IES. The capabilities within FORCE include grid portfolio optimization through the Holistic Energy Resource Optimization Network (HERON) and the transient process model analysis library HYBRID, among others. Continuous efforts and investments from the IES programs have been made to expand and improve the versatility of the FORCE toolset in fiscal year 2022. Code-coupling and cross-tool communication have been important methods for improving this versatility. This report focuses on an additional workflow in the HERON tool for capacity and dispatch stochastic optimization through integration with the external tool Design Integration and Synthesis Platform to Advance Tightly Coupled Hybrid Energy Systems (DISPATCHES). DISPATCHES was primarily developed by the National Energy Technology Laboratory, in collaboration with other national laboratories, which included INL, universities, and industry partners. It is coupled to a library of algebraic models for specific plant components, and to a framework for stochastic optimization different from that provided in the current Risk Analysis Virtual Environment (RAVEN)-running-RAVEN algorithm in HERON. HERON currently conducts stochastic optimization via an outer-inner loop: it optimizes over variable capacity on the outer loop, and at each step within the capacity parameter space, conducts an inner optimization over scenarios (of market signals, demand, and/or weather patterns) and hourly dispatch throughout a user-specified number of years. On the other hand, DISPATCHES conducts stochastic optimization via an “all-at-once” strategy in which capacity variables are optimized at the same level as dispatch variables, as all scenarios are considered at once. The latter method works especially well for projects of limited size and project length, as the necessary computational power and memory increases with the number of variables and scenarios. The new capability to use the DISPATCHES workflow in HERON enhances standalone simulations by leveraging FORCE tools—namely, the economic metrics from the Tool for Economic Analysis (TEAL) and reduced-order model (ROM) sampling from RAVEN. The initial demonstration of the DISPATCHES workflow simulates an existing nuclear-case flowsheet within the DISPATCHES repository—this models a NPP with a secondary revenue stream for hydrogen production. Electrical output from the plant is converted to hydrogen via a proton-exchange membrane (PEM) electrolyzer, hydrogen tanks are used for storage, and an additional turbine is added for hydrogen combustion. Continued work regarding this FORCE-DISPATCHES integration will include automatic generation of DISPATCHES models from HERON inputs, offering analysts the option of using either the RAVEN-runsRAVEN or DISPATCHES workflow to solve technoeconomic optimization problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multifunctional electrochemical memory stabilized by phase coexistence

Our growing computing needs, especially in applications that heavily rely on artificial intelligence (AI), motivate a search for new components that could substantially augment the performance of general-purpose digital computers. Beyond ON/OFF switching, new components with linear multistate analog resistive tuning, nonlinear volatile switching, spiking, oscillatory, stochastic and other complex functionalities could enable highly efficient neuromorphic computing schemes for AI information processing. Compared to the extreme multifunctionality of biological neurons, realizing all the above characteristics in a single, scalable analog component remains a grand challenge. Here we investigate electrochemical gating combined with localized thermal activation to program and switch a single, vertically integrated and dimensionally scaled electrothermal chemical random access memory (ETCRAM) with a channel and reservoir composed of phase-separated vanadium oxide. Closely related to electrochemical RAM (ECRAM), ETCRAM uses an integrated gate-heater electrode to overcome kinetic barriers that help retain states at ambient temperatures. In addition to synapse-like stable and programmable analog resistance states arising from redox-tunable phase coexistence, a single component exhibits neuron-like nonlinear conductance switching with a tunable threshold and self-driven dynamics owing to the thermally driven metal-insulator phase transition in vanadium dioxide. More broadly, we demonstrate that electrochemically stabilized phase coexistence could unlock analog electronics with novel functionality, stability, reconfigurability, and scalability.

Oh, Sangheon [Sandia National Lab. (SNL-CA), Liver↗

Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures

Here, we investigate how to port the standard interior-point method to new exascale architectures for block-structured nonlinear programs with state equations. Computationally, we decompose the interior-point algorithm into two successive operations: the evaluation of the derivatives and the solution of the associated Karush-Kuhn-Tucker (KKT) linear system. Our method accelerates both operations using two levels of parallelism. First, we distribute the computations on multiple processes using coarse parallelism. Second, each process uses SIMD/GPU accelerators locally to accelerate the operations using fine-grained parallelism. The KKT system is reduced by eliminating the inequalities and the state variables from the corresponding equations. We demonstrate our method's capability on the supercomputer Polaris, a testbed for the future exascale Aurora system. Each node is equipped with four GPUs, a setup amenable to our two-level approach. Our experiments on the stochastic optimal power flow problem show that the reduction method is 50x faster than the sparse linear solver HSL MA57 running in serial on the CPU, and 6x faster than Pardiso running in parallel on CPU on the same number of processes.

97 MATHEMATICS AND COMPUTING↗

HFIRCON Version 1.0.5 User Guide

The High Flux Isotope Reactor (HFIR) Controller (HFIRCON) code is a collection of python routines and C plugins that automate the workflow for fuel and single- or multicycle target depletion analyses for HFIR at Oak Ridge National Laboratory (ORNL). This code calls the LAVAMINT (LAVA Model Interrogator) parallel (MCNP) Monte Carlo N-Particle model interrogator to stochastically calculate cell volumes and bounding boxes, the ADVANTG (Automatic Variance Reduction Generation) code package for all variance reduction and source biasing calculations, the ORNL-Transformative Neutronics/MCNP5 transport solver for all transport solutions, and the MSX_DEPLETE module to perform all depletion calculations via the ORIGEN (Oak Ridge Isotope Generation) application programming interface. It also performs a robust set of postprocessing functions to automatically provide summaries of several key metrics that are common to a wide variety of typical HFIR design and safety-basis analyses.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Assessment of the mechanical performance of the Westinghouse BWR control rod CR 99 at high depletion levels

A long-term program assessing the mechanical performance of the Westinghouse BWR control rod CR 99 at high depletion levels has been performed. The scope of the program has mainly been based on the operation of four CR 99 Generation 2 control rods in demanding positions during 6 and 7 cycles in the Leibstadt Nuclear Power Plant (KKL) and on the detailed visual inspections and blade wing thickness measurements that were performed after the rods were discharged. By correlating statistically the blade wing thickness measurements to the appearance of irradiation-assisted stress corrosion cracking (IASCC), the probability of IASCC appearance as function of the blade wing swelling was estimated. In order to correlate the IASCC probability of a CR 99 to its depletion, the {sup 10}B depletion of the studied rods was calculated in detail on a local level with the stochastic Monte Carlo code MCNP in combination with the Westinghouse nodal code system PHOENIX4/POLCA7. Using this information coupled to the blade wing measurement data, a finite element model describing the blade wing swelling of an arbitrary CR 99 design as function of {sup 10}B depletion could then be generated. In the final step, these relationships were used to quantify the probability of IASCC appearance as function of the {sup 10}B depletion of the CR 99 Generations 2 and 3. Applying this detailed mapping of the CR 99 behavior at high depletion levels and using an on-line core monitoring system with explicit {sup 10}B depletion tracking capabilities will enable a reliable prediction of the probability for IASCC appearance, thus enhancing the optimized design and the sound operation of the CR 99 control rod. Another important outcome of the program was that it was clearly shown that no significant amount of boron leakage did occur through any of the detected IASCC cracks, despite the very high depletion levels achieved. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Optimization using pathwise algorithmic derivatives of electromagnetic shower simulations

Among the well-known methods to approximate derivatives of expectancies computed by Monte-Carlo simulations, averages of pathwise derivatives are often the easiest one to apply. Computing them via algorithmic differentiation typically does not require major manual analysis and rewriting of the code, even for very complex programs like simulations of particle-detector interactions in high-energy physics. However, the pathwise derivative estimator can be biased if there are discontinuities in the program, which may diminish its value for applications. This work integrates algorithmic differentiation into the electromagnetic shower simulation code HepEmShow based on G4HepEm, allowing us to study how well pathwise derivatives approximate derivatives of energy depositions in a sampling calorimeter with respect to parameters of the beam and geometry. We found that when multiple scattering is disabled in the simulation, means of pathwise derivatives converge quickly to their expected values, and these are close to the actual derivatives of the energy deposition. Additionally, we demonstrate the applicability of this novel gradient estimator for stochastic gradient-based optimization in a model example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable and Memory-Efficient Algorithms for Controlling Networked Epidemic Processes Using Multiplicative Weights Update Method

We study the problem of designing scalable algorithms to find effective intervention strategies for controlling stochastic epidemic processes on networks. This is a common problem arising in agent based models for epidemic spread. Previous approaches to this problem focus on either heuristics with no guarantees or approximation algorithms that scale only to networks corresponding to county-sized populations, typically, with less than a million nodes. In particular, the mathematical-programming based approaches need to solve the Linear Program (LP) relaxation of the problem using an LP solver, which restricts the scalability of this approach. In this work, we overcome this restriction by designing an algorithm that adapts the multiplicative weights update (MWU) framework, along with the sample average approximation (SAA) technique, to approximately solve the linear program (LP) relaxation for the problem. To scale this approach further, we provide a memory-efficient algorithm that enables scaling to large networks, corresponding to country-size populations, with over 300 million nodes and 30 billion edges. Furthermore, we show that this approach provides near-optimal solutions to the LP in practice.

Sambaturu, Prathyush↗

Model for Collaboration among Carriers to Reduce Empty Container Truck Trips

In recent years, intermodal transport has become an increasingly attractive alternative to freight shippers. However, the current intermodal freight transport is not as efficient as it could be. Oftentimes an empty container needs to be transported from the empty container depot to the shipper, and conversely, an empty container needs to be transported from the receiver to the empty container depot. These empty container movements decrease the freight carrier’s profit, as well as increase traffic congestion, decrease roadway safety, and add unnecessary emissions to the environment. To this end, our study evaluates a potential collaboration strategy to be used by carriers for domestic intermodal freight transport based on an optimization approach to reduce the number of empty container trips. A binary integer-linear programming model is developed to determine each freight carrier’s optimal schedule while minimizing its operating cost. The model ensures that the cost for each carrier with collaboration is less than or equal to its cost without collaboration. It also ensures that average savings from the collaboration are shared equally among all participating carriers. Additionally, two stochastic models are provided to account for uncertainty in truck travel times. The proposed collaboration strategy is tested using empirical data and is demonstrated to be effective in meeting all of the shipment constraints.

42 ENGINEERING↗