@inproceedings{c0b7b420a6a843dba015e765595f74cb,
title = "Echelon stock formulation of arborescent distribution systems: an application to the Wagner-Whitin problem",
abstract = "An arborescent distribution system is a multi-level system in which each installation receives input from a unique immediate predecessor and supplies one or more immediate successors. In this paper, it is shown that a distribution system with an arborescent structure can also be modelled using an echelon stock concept where at any instant the total echelon holding cost is accumulated at the same rate as the total conventional holding cost. The computational efficiency of the echelon model is tested on the well-known Wagner-Whitin type dynamic inventory lot-sizing problem, which is an intractable combinatorial problem from both mixed-integer programming (MIP) and constraint programming (CP) standpoints. The computational experiments show that the echelon MIP formulation is computationally very efficient compared to the conventional one, whereas the echelon CP formulation remains intractable. A CP/LP hybrid yields a substantial improvement over the pure CP approach, solving all tested instances in a reasonable time.",
keywords = "Mixed integer programming, Constraint programming, Echelon formulation, Mixed integer programming solver, Implied constraint",
author = "Tarim, {S. Armagan} and Ian Miguel",
year = "2004",
month = apr,
day = "7",
doi = "10.1007/978-3-540-24664-0_21",
language = "English",
isbn = "9783540218364",
series = "Lecture notes in computer science",
publisher = "Springer-Verlag",
pages = "302--318",
editor = "Jean-Charles R{\'e}gin and Michel Rueher",
booktitle = "Integration of AI and OR techniques in constraint programming for combinatorial optimization problems",
address = "Germany",
}