Sharing surplus food — Technical https://thesis.uya.no/proposals/good-food-better-shared/#technical-track BACHELOR Final result: A matching prototype with constraint tests and workflow feedback. Task: Build a surplus-food matching tool using a fixed expiry-first allocation rule. Data: 20 simulated 7-day weeks; seeds 1–20 (planned) 10 donors, 5 recipients and 3 food types. Record lot kg, availability/expiry, accepted types, demand, pickup windows, capacity, fixed route feasibility and two announced pickup cancellations per week; allow divisible kilograms. Requires: Recruit food-redistribution coordinators; the simulation uses declared assumptions. Method: Use the synthetic offers and requests; check expiry/capacity constraints and observe coordinator tasks. Plan 4 participant sessions. STEPS Build and test 1. Read the starting sources and choose one established implementation method. 2. Write the requirements, data fields, system diagram and test cases. 3. Prepare 20 simulated 7-day weeks; seeds 1–20. Make the answer key and pass criteria before testing. 4. Build a working version of a matching prototype with constraint tests and workflow feedback. 5. Run function, integration and failure-case tests. Record each result. 6. Run the practical evaluation and list the changes the system still needs. MASTER Final result: Allocation tool, generator and comparison table. Research question: Investigate fairness–waste trade-offs when food availability changes. Compare expiry-first matching with constrained allocation on the same revealed offers; analyse who loses allocations and whether coordinators can explain those decisions. Research result: Evaluated allocation principles that expose efficiency and recipient trade-offs. STEPS Design, build and test (DSR) 1. Read the newest papers and list the closest existing systems. 2. Write down the versions, fields, data split, case assignment, random seeds and correct answers for 20 simulated 7-day weeks; seeds 1–20. 3. Draw the user workflow, data model and system architecture. List the requirements and pass criteria. 4. Build a working version of allocation tool, generator and comparison table. 5. Test every function, connection and failure case. Save the failed tests as well as the passed tests. 6. Compare the system with the named alternative. Then run the user task or decision task in the assignment. 7. Report the measured result, the failed cases and the design lessons another team can reuse. CURRENT PROJECT LITERATURE Predicting and optimizing the fair allocation of donations in hunger relief supply chains (2024, peer-reviewed): https://doi.org/10.1016/j.ijforecast.2024.06.004 Combines donation forecasting and fair allocation in a real organizational network. Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation (2024, preprint): https://arxiv.org/abs/2406.06363 Studies a deployed food-rescue matching platform and its fairness-efficiency trade-off. IS THEORY STARTING POINTS Vessey & Galletta (1991) — Cognitive Fit: https://pubsonline.informs.org/doi/10.1287/isre.2.1.63 Test whether a representation helps one kind of task more than another. Wang & Strong (1996) — Beyond Accuracy: https://www.tandfonline.com/doi/abs/10.1080/07421222.1996.11518099 Distinguish accuracy, completeness, representation and fitness for the task. Search Scopus or Web of Science and ACM Digital Library using the topic query, then follow citations to the thesis start date. Record searches and compare methods, data, findings and limitations in literature-matrix.csv. Use that review to confirm or revise the gap and choose a current comparator. The linked papers are starting points. PILOT QUESTION Can an allocation tool reduce expired food while making shortages and reassignment decisions clear? EXAMPLE TOOLS Python, pandas, OR-Tools, Streamlit Equivalent tools are fine. FIRST THREE ACTIONS 1. Write one day of donor, recipient and transport CSVs with units stated. 2. Hand-check a feasible allocation and explicitly define what expires at day end. 3. Implement the first-expiring-first baseline and verify total kilograms before running the full simulation. LITERATURE SEARCH surplus food redistribution allocation coordination information systems DATA 20 simulated 7-day weeks; seeds 1–20 (planned) 10 donors, 5 recipients and 3 food types. Record lot kg, availability/expiry, accepted types, demand, pickup windows, capacity, fixed route feasibility and two announced pickup cancellations per week; allow divisible kilograms. HOW TO TEST IT Compare deterministic FEFO with maximum-throughput and 100/95/90% throughput ε-constraint allocations. Verify conservation, eligibility, capacity, expiry and post-override feasibility. Report delivered/expired/unmet kg, minimum and distribution of fill rates, solver gap/time and violations; six coordinators revise four non-overlapping cases and explain overrides. FINAL RESULT Allocation tool, generator and comparison table. ACCESS OR PEOPLE Recruit 6 food-redistribution coordinators; the simulation uses declared assumptions. TEMPLATES https://thesis.uya.no/starters/good-food-better-shared/technical/data-plan.csv https://thesis.uya.no/starters/good-food-better-shared/technical/evaluation.csv https://thesis.uya.no/starters/good-food-better-shared/technical/literature-matrix.csv Use participant codes instead of names or email addresses.