We study some complex distribution network design problems, which involve facility location, warehousing, transportation and inventory decisions. Several realistic scenarios are investigated. Two kinds of mathematical programming formulations are proposed for all the introduced problems, together with a proof of their correctness. Some formulations extend models proposed by Perl and Daskin (1985) for some warehouse location-routing problems; other formulations are based on flow variables and constraints.
DISTRIBUTION NETWORK DESIGN: NEW PROBLEMS AND RELATED MODELS
AMBROSINO, DANIELA;
2005-01-01
Abstract
We study some complex distribution network design problems, which involve facility location, warehousing, transportation and inventory decisions. Several realistic scenarios are investigated. Two kinds of mathematical programming formulations are proposed for all the introduced problems, together with a proof of their correctness. Some formulations extend models proposed by Perl and Daskin (1985) for some warehouse location-routing problems; other formulations are based on flow variables and constraints.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
EJOR2005.pdf
accesso chiuso
Tipologia:
Documento in versione editoriale
Dimensione
335.84 kB
Formato
Adobe PDF
|
335.84 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
