2007
DOI: 10.1299/jamdsm.1.250
|View full text |Cite
|
Sign up to set email alerts
|

Simultaneous Optimization of Storage Allocation and Routing Problems for Belt-conveyor Transportation

Abstract: Raw materials for industrial steel-making plants need to be stored in material yards in order to satisfy various production requirements. The stored materials are supplied to production plants by belt-conveyors with multiple alternative transportation routes. The simultaneous optimization of the storage allocation and transportation routing for the raw materials yard is required for achieving production that is flexible to changes in demand. In this paper, we propose a Lagrangian decomposition and coordination… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
3
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(4 citation statements)
references
References 6 publications
0
3
0
Order By: Relevance
“…Several studies related to stockyard-port planning using deterministic optimization techniques have been proposed in the last decade. Ago et al [13] proposed a Mixed-Integer Linear Programming (MILP) model with Lagrangian decomposition and coordination techniques to simultaneously optimize the storage allocation and transportation routing at the raw materials yard. Servare et al [14] developed a MILP (see Table 1) model and a linear relaxation-based heuristic to minimize the energy costs of an iron ore stockyard, including the production of mines and the demands of the berth.…”
Section: Related Workmentioning
confidence: 99%
“…Several studies related to stockyard-port planning using deterministic optimization techniques have been proposed in the last decade. Ago et al [13] proposed a Mixed-Integer Linear Programming (MILP) model with Lagrangian decomposition and coordination techniques to simultaneously optimize the storage allocation and transportation routing at the raw materials yard. Servare et al [14] developed a MILP (see Table 1) model and a linear relaxation-based heuristic to minimize the energy costs of an iron ore stockyard, including the production of mines and the demands of the berth.…”
Section: Related Workmentioning
confidence: 99%
“…Most of the previous studies simplified the consideration of storage space allocation by allocating one material to one field (or so-called location), ignoring the capacity difference among the fields. Ago et al (2007) developed a Lagrangian decomposition approach to solve the storage allocation and routing problem for the stockyard in steel-making plants, aiming at allocating the materials to each stock area under the maximum capacity limit and determining the belt-conveyor transportation routes. Barros et al (2011) considered the stock level of the bulk materials in the stockyard when making the berth allocation decisions.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, given that manual picking is still the mainstream in the collection of materials and products in warehouses, further efficiency improvement by using technology is necessary due to the increase in materials and products, and the decrease in working population. This issue is addressed by extensive investigations on optimization technology to improve the efficiency of various warehouse operations (Karásek, 2013) (Ago et al, 2007).…”
Section: Introductionmentioning
confidence: 99%