The DOI matches its Crossref record; the references it cites are not checked yet.
A multi-objective optimization approach to balancing cost and traceability in bulk grain handling
Abstract
This paper proposes a multi-objective optimization model that provides an effective method for minimizing traceability effort by minimizing the food safety risk caused by lot aggregation at a grain elevator. A mathematical multi-objective mixed-integer programming (MIP) model is proposed with two objective functions that allow in calculating the minimum levels of lot aggregation and minimum total cost of blending grain. Constraints on the system include customer contract specifications, availability of grain at the elevators and the blending requirements. The solutions include quantities of grain from different storage bins to be used for blending for a shipment while using the minimum number of storage bins and minimum total cost. The numerical results are presented for a corn shipment scenario to demonstrate the application of this model. Pareto optimal front is computed for the problem for simultaneous optimization of lot aggregation and cost of blending. Sensitivity analysis is conducted to analyze the application of the model under different operating conditions.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“However, even today there are several shortcomings because many traceability systems are ineffective: frauds are still quite widespread [94], while the recall costs are often very high in the case of food scandals because the granular traceability is onerous, especially in the case of batch mixing [95].”
From A Review of Blockchain-Based Systems in Transportation (2019) · cites this paper as [95]
Citations
The citation lists haven’t been fetched yet
References 26 · Cited by 50
Research works printed but not linked: 1
- Official Journal of the European Communities, 2002. Regulation (EC) No. 178/2008 of the European Parliament and the Council of 28 January 2002.
Metadata
- Authors
- Thakur, M., Wang, L., & Hurburgh, C. R.
- Affiliations
- Iowa State University (US)
- Corresponding author
- Thakur, Maitri
- Venue
- Journal of Food Engineering
- Publisher
- Elsevier BV
- Published
- 2010-11
- Volume
- 101
- Issue
- 2
- Pages
- 193-200
- ISSN
- 0260-8774 (ISSN-L)
- OpenAlex
- W1986960697
- Cited by
- 50
- References
- 26
- Citations by year
- 2022: 2 · 2021: 5 · 2020: 3 · 2019: 4 · 2018: 4 · 2017: 2 · 2016: 4 · 2015: 4 · 2014: 3 · 2013: 6 · 2012: 6
- FWCI
- 9.31
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Journal of Food Engineering (publishedVersion)
- Topics
- Life Sciences › Agricultural and Biological Sciences › Food Science › Food Supply Chain Traceability
- Social Sciences › Decision Sciences › Management Science and Operations Research › Optimization and Mathematical Programming
- Physical Sciences › Engineering › Control and Systems Engineering › Process Optimization and Integration
- Keywords
- grain elevators, food safety risk, traceability, storage bins, multi-objective optimization, mixed integer programming, Pareto front, sensitivity analysis
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review