2008
DOI: 10.1007/978-3-540-78985-7_12
|View full text |Cite
|
Sign up to set email alerts
|

Combining Simulation and Tabu Search for Oil-derivatives Pipeline Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
25
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(25 citation statements)
references
References 9 publications
0
25
0
Order By: Relevance
“…It permits to easily find alternative detailed schedules by using different operational criterion. Several approaches were proposed to study pipeline scheduling problems, including rigorous optimization models, knowledge-based techniques (Sasikumar et al 1997), discrete-event simulation (Mori et al 2007, García-Sánchez, Arreche, andOrtega-Mier 2008), and decomposition frameworks (Hane and Ratliff 1995, Neves et al 2007, Boschetto et al 2008. Rigorous optimization methods generally consist of a single MILP (Mixed Integer Linear Programming) or MINLP (Mixed Integer Nonlinear Programming) mathematical formulations and are usually grouped into two classes: discrete and continuous, depending on the way that volume and time domains are handled.…”
Section: Pipeline Schedulingmentioning
confidence: 99%
See 1 more Smart Citation
“…It permits to easily find alternative detailed schedules by using different operational criterion. Several approaches were proposed to study pipeline scheduling problems, including rigorous optimization models, knowledge-based techniques (Sasikumar et al 1997), discrete-event simulation (Mori et al 2007, García-Sánchez, Arreche, andOrtega-Mier 2008), and decomposition frameworks (Hane and Ratliff 1995, Neves et al 2007, Boschetto et al 2008. Rigorous optimization methods generally consist of a single MILP (Mixed Integer Linear Programming) or MINLP (Mixed Integer Nonlinear Programming) mathematical formulations and are usually grouped into two classes: discrete and continuous, depending on the way that volume and time domains are handled.…”
Section: Pipeline Schedulingmentioning
confidence: 99%
“…When all unsatisfied demands q k (i,j) are null, the output schedule for run k has been generated. Previous contributions (Mori et al 2007, García-Sánchez, Arreche, andOrtega-Mier 2008) assumed that the destination for each entity was already given by the optimization package. In our approach, some capabilities have been provided to the proposed simulation model for selecting the route to be followed by every entity based on three key elements: (i) the assignment matrix Q k o (i,j) for every run k, (ii) the batch to which each entity belongs, and (iii) a set of priority rules selecting both the leaving entity and the receiving terminal, if several cut operations are eligible for execution.…”
Section: Hierarchical Solution Approachmentioning
confidence: 99%
“…An alternative to the application of mathematical programming methods in the pipeline scheduling represent for example heuristic modules [10], constraint programming [11] and also discrete-event simulation [12]. These approaches are suitable mainly in the scheduling of pipeline networks with more complex structures [13].…”
Section: Introductionmentioning
confidence: 99%
“…Some researchers proposed heuristic algorithms to optimize the scheduling of tree-structure pipeline networks with branching terminals. This method cannot derive an optimal solution but can attain satisfactory schedules quickly . Some other studies proposed mathematical formulation based on discrete or continuous time representation for a pipeline network with a branching structure. Recent studies on scheduling of pipeline networks have focused on mesh-structure pipeline networks.…”
Section: Introductionmentioning
confidence: 99%