Idioma:

Efficient MILP formulations for multiproduct pipeline scheduling

Rejowski, R. ; Pinto, J.M.

Computer Aided Chemical Engineering, 2003, Vol.15, p.1002-1007 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Efficient MILP formulations for multiproduct pipeline scheduling
Autor: Rejowski, R. ; Pinto, J.M.
Assuntos: disjunctive programming ; distribution scheduling ; logistics ; mixed-integer optimization ; pipeline
É parte de: Computer Aided Chemical Engineering, 2003, Vol.15, p.1002-1007
Descrição: The system reported in this work is composed of an oil refinery, one multiproduct pipeline connected to several depots and to local consumer markets. A Mixed Integer Linear Programming (MILP) model that relies on discrete time is considered. The objective is to develop special and non-intuitive constraints, which impose that pipeline segment may be in an inoperative condition only if it contains a single derivative. Moreover, a set of integer cuts that are based on demands and inventories is included in the original formulation, thus significantly improving CPU performance. This approach was applied to a real-world system that transports four products generated in a refinery that must feed five distribution depots.
Idioma: Inglês

Voltar para lista de resultados

Resultado 1