PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 28, 2026Industrial & Engineering Chemistry Research0 citationsOpen Access

Integration of Optimization and Discrete-Event Simulation in Supply Logistics of Carbon Dioxide Capture and Storage

View Full Paper
KXKaixuan XuARAnna RobertPKParveen Kumar

Key Points

  • The aim is to enhance scheduling of CO2 shipments in the carbon capture and storage maritime supply chain using multiple solution strategies.
  • Developed five solution strategies including RTN-based MILP and simplified timeslot-based MILP.
  • Implemented discrete-event simulation (DES) for complex logistic problems.
  • Integrated DES with optimization techniques to improve decision-making efficiency.
  • Reformulated the problem using discrete-time constraint programming (CP) for flexibility.
  • Used real data instances to evaluate computational expense and solutions across methodologies.
  • The integrated DES approach allowed for more efficient computation than a standard MILP optimization.
  • The CP model outperformed other discrete-time methods in finding feasible solutions quickly.
  • Overall, the methodologies provided varying levels of efficiency and optimality in CO2 shipment scheduling.

Abstract

In this paper, we describe five solution strategies for scheduling CO2 shipments in a carbon capture and storage (CCS) maritime supply chain. Specifically, we consider an RTN-based MILP, a simplified timeslot-based MILP, discrete-event simulation (DES), an integrated DES and optimization approach, and a discrete-time constraint programming (CP) model. A key innovation in our methodology is the introduction of a DES model in a complex logistic problem that cannot be solved in a reasonable CPU time with a rigorous monolithic MILP optimization approach. This unique simulation tool, which is computationally very efficient but with strong limitations in terms of achieving global optimality, allows us to explore its effective integration with more rigorous optimization techniques. The integration of these two techniques involves using the optimization model to predefine major critical decisions that will be sequentially given to the DES model. Another highlight of this paper is applying constraint programming to reformulate the problem with a discrete-time representation, which offers a rigorous and flexible formulation. Using the powerful CP-SAT solver provided by OR-Tools, it is shown that the CP model can find feasible solutions faster than other discrete-time representation models. Several instances based on real data are solved by all five methodologies to compare their computational expense and the solutions obtained.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Xu et al. (2026) studied this question.

synapsesocial.com/papers/69c771508bbfbc51511e134bhttps://doi.org/10.1021/acs.iecr.5c04890
Ask AI
Helpful
Bookmark
Share
View Full Paper