A dynamic multicommodity network flow problem for logistics networks

Publikation: Beitrag in Buch/Bericht/TagungsbandKonferenzbeitragBegutachtung

Abstract

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.

OriginalspracheEnglisch
Titel27th European Modeling and Simulation Symposium, EMSS 2015
Redakteure/-innenMichael Affenzeller, Francesco Longo, Lin Zhang, Agostino G. Bruzzone, Yuri Merkuryev, Emilio Jimenez
Herausgeber (Verlag)DIME UNIVERSITY OF GENOA
Seiten301-306
Seitenumfang6
ISBN (elektronisch)9788897999485
PublikationsstatusVeröffentlicht - 2015
Veranstaltung27th European Modeling and Simulation Symposium, EMSS 2015 - Bergeggi, Italien
Dauer: 21 Sep 201523 Sep 2015

Publikationsreihe

Name27th European Modeling and Simulation Symposium, EMSS 2015

Konferenz

Konferenz27th European Modeling and Simulation Symposium, EMSS 2015
Land/GebietItalien
OrtBergeggi
Zeitraum21.09.201523.09.2015

Fingerprint

Untersuchen Sie die Forschungsthemen von „A dynamic multicommodity network flow problem for logistics networks“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren