TY - GEN
T1 - A dynamic multicommodity network flow problem for logistics networks
AU - Raggl, Sebastian Josef
AU - Scagnetti, Judith
AU - Beham, Andreas
N1 - Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.
PY - 2015
Y1 - 2015
N2 - We present a dynamic multicommodity minimum cost network flow problem with storage at the nodes and optimal supply for modeling operations within a logistics network. The model can be used to evaluate critical business decisions such as the amount of required resources for storage transportation as well as optimal supply policies. A generator for test instances was written in order to evaluate the performance of the different solution strategies. Using a number of differently sized randomly generated problem instances we compare the execution time and the memory demand of two methods for solving the problem. The first is solving the whole problem formulation directly using general purpose linear programming solvers implemented in IBM Ilog CPLEX. In the second approach we attempt to split the model into two parts and link them together in an optimization network. We analyze the quality of the link and propose possibilities to improve the two step approach through input parameter variation.
AB - We present a dynamic multicommodity minimum cost network flow problem with storage at the nodes and optimal supply for modeling operations within a logistics network. The model can be used to evaluate critical business decisions such as the amount of required resources for storage transportation as well as optimal supply policies. A generator for test instances was written in order to evaluate the performance of the different solution strategies. Using a number of differently sized randomly generated problem instances we compare the execution time and the memory demand of two methods for solving the problem. The first is solving the whole problem formulation directly using general purpose linear programming solvers implemented in IBM Ilog CPLEX. In the second approach we attempt to split the model into two parts and link them together in an optimization network. We analyze the quality of the link and propose possibilities to improve the two step approach through input parameter variation.
KW - Dynamic Lot Sizing Problem
KW - Dynamic networks
KW - Minimum cost flow problem
KW - Multicommodity flows
UR - http://www.scopus.com/inward/record.url?scp=84949484919&partnerID=8YFLogxK
M3 - Conference contribution
T3 - 27th European Modeling and Simulation Symposium, EMSS 2015
SP - 301
EP - 306
BT - 27th European Modeling and Simulation Symposium, EMSS 2015
A2 - Affenzeller, Michael
A2 - Longo, Francesco
A2 - Zhang, Lin
A2 - Bruzzone, Agostino G.
A2 - Merkuryev, Yuri
A2 - Jimenez, Emilio
PB - DIME UNIVERSITY OF GENOA
T2 - 27th European Modeling and Simulation Symposium, EMSS 2015
Y2 - 21 September 2015 through 23 September 2015
ER -