Optimization of order policies in supply networks

S. Göttlich, M. Herty, Christian Ringhofer

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

The purpose of this paper is to develop a model which allows for the study and optimization of arbitrarily complex supply networks, including order policies and money flows. We propose a mathematical description that captures the dynamic behavior of the system by a coupled system of ordinary differential delay equations. The underlying optimization problem is solved using discretization techniques yielding a mixed-integer programming problem.

Original languageEnglish (US)
Pages (from-to)456-465
Number of pages10
JournalEuropean Journal of Operational Research
Volume202
Issue number2
DOIs
StatePublished - Apr 16 2010

Fingerprint

Differential Delay Equations
Mixed Integer Programming
Coupled System
Dynamic Behavior
Discretization
Optimization Problem
Optimization
Integer programming
Model
Money
Policy
Supply network
Optimization problem
Mixed integer programming
Money flows
Delay differential equations

Keywords

  • Combinatorial optimization
  • Network flows
  • Policy models
  • Production lines

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Modeling and Simulation
  • Information Systems and Management

Cite this

Optimization of order policies in supply networks. / Göttlich, S.; Herty, M.; Ringhofer, Christian.

In: European Journal of Operational Research, Vol. 202, No. 2, 16.04.2010, p. 456-465.

Research output: Contribution to journalArticle

@article{2dfeab1ce3c241779a1dda90e0bbfb2d,
title = "Optimization of order policies in supply networks",
abstract = "The purpose of this paper is to develop a model which allows for the study and optimization of arbitrarily complex supply networks, including order policies and money flows. We propose a mathematical description that captures the dynamic behavior of the system by a coupled system of ordinary differential delay equations. The underlying optimization problem is solved using discretization techniques yielding a mixed-integer programming problem.",
keywords = "Combinatorial optimization, Network flows, Policy models, Production lines",
author = "S. G{\"o}ttlich and M. Herty and Christian Ringhofer",
year = "2010",
month = "4",
day = "16",
doi = "10.1016/j.ejor.2009.05.028",
language = "English (US)",
volume = "202",
pages = "456--465",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Optimization of order policies in supply networks

AU - Göttlich, S.

AU - Herty, M.

AU - Ringhofer, Christian

PY - 2010/4/16

Y1 - 2010/4/16

N2 - The purpose of this paper is to develop a model which allows for the study and optimization of arbitrarily complex supply networks, including order policies and money flows. We propose a mathematical description that captures the dynamic behavior of the system by a coupled system of ordinary differential delay equations. The underlying optimization problem is solved using discretization techniques yielding a mixed-integer programming problem.

AB - The purpose of this paper is to develop a model which allows for the study and optimization of arbitrarily complex supply networks, including order policies and money flows. We propose a mathematical description that captures the dynamic behavior of the system by a coupled system of ordinary differential delay equations. The underlying optimization problem is solved using discretization techniques yielding a mixed-integer programming problem.

KW - Combinatorial optimization

KW - Network flows

KW - Policy models

KW - Production lines

UR - http://www.scopus.com/inward/record.url?scp=70349943718&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349943718&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2009.05.028

DO - 10.1016/j.ejor.2009.05.028

M3 - Article

AN - SCOPUS:70349943718

VL - 202

SP - 456

EP - 465

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -