most citedBalanced dynamic multiple travelling salesmen: algorithms and continuous approximations

16 citations · 24 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2020★ 16 cited

Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations

Wolfgang Garn

Dynamic routing occurs when customers are not known in advance, e.g. for real-time routing. Two heuristics are proposed that solve the balanced dynamic multiple travelling salesmen…

math.OC2020

Dynamic lot size MIPs for multiple products and ELSPs with shortages, capacity and changeover limits

Wolfgang Garn

Scheduling multiple products with limited resources and varying demands remain a critical challenge for many industries. This work presents mixed integer programs (MIPs) that solve…

cs.DS2020★ 5 cited

Closed form distance formula for the balanced multiple travelling salesmen

Wolfgang Garn

As a first contribution the mTSP is solved using an exact method and two heuristics, where the number of nodes per route is balanced. The first heuristic uses a nearest node approa…

cs.AI2015

Conditional probability generation methods for high reliability effects-based decision making

Wolfgang Garn, Panos Louvieris

Decision making is often based on Bayesian networks. The building blocks for Bayesian networks are its conditional probability tables (CPTs). These tables are obtained by parameter…

stat.ME2015★ 3 cited

Splitting hybrid Make-To-Order and Make-To-Stock demand profiles

Wolfgang Garn, James Aitken

In this paper a demand time series is analysed to support Make-To-Stock (MTS) and Make-To-Order (MTO) production decisions. Using a purely MTS production strategy based on the give…