CoChat
Sign Up
Cited by 49Vehicle Routing Optimization MethodsFacility Location and Emergency ManagementUrban and Freight Transport Logistics

The DOI matches its Crossref record; the references it cites are not checked yet.

Exact and heuristic algorithms for finding envy-free allocations in food rescue pickup and delivery logistics

Rey, David, Almi’ani, Khaled, Nair, Divya J.·2018·Transportation Research Part E: Logistics and Transportation Review
DOI 10.1016/j.tre.2018.02.001
Open this paper in CoChat — free account

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.tre.2018.02.001

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

The citation lists haven’t been fetched yet

References 48 · Cited by 49

Research works printed but not linked: 42

  1. Azadian, 2017, An unpaired pickup and delivery problem with time dependent assignment costs: Application in air cargo transportation, Euro. J. Oper. Res., 263, 188, 10.1016/j.ejor.2017.04.033 · DOI
  2. Balcik, 2014, Multi-vehicle sequential resource allocation for a nonprofit distribution system, IIE Trans., 46, 1279, 10.1080/0740817X.2013.876240 · DOI
  3. Bartholdi, 1983, A minimal technology routing system for meals on wheels, Interfaces, 13, 1, 10.1287/inte.13.3.1 · DOI
  4. Benders, 1962, Partitioning procedures for solving mixed-variables programming problems, Numer. Math., 4, 238, 10.1007/BF01386316 · DOI
  5. Birge, 1988, A multicut algorithm for two-stage stochastic linear programs, Euro. J. Oper. Res., 34, 384, 10.1016/0377-2217(88)90159-2 · DOI
  6. Campbell, 2008, Routing for relief efforts, Transport. Sci., 42, 127, 10.1287/trsc.1070.0209 · DOI
  7. Carotenuto, 2007, Finding minimum and equitable risk routes for hazmat shipments, Comput. Oper. Res., 34, 1304, 10.1016/j.cor.2005.06.003 · DOI
  8. Chen, 2014, Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads, Transport. Res. Part E: Logist. Transport. Rev., 69, 218, 10.1016/j.tre.2014.06.010 · DOI
  9. Dantzig, 1954, Solution of a large-scale traveling-salesman problem, J. Oper. Res. Soc. Am., 2, 393
  10. Davis, 2014, Scheduling food bank collections and deliveries to ensure food safety and improve access, Socio-Econ. Plan. Sci., 48, 175, 10.1016/j.seps.2014.04.001 · DOI · Paper page
  11. Foley, D.K., 1967. Resource Allocation and the Public Sector. YALE ECON ESSAYS, VOL 7, NO 1, PP 45-98, SPRING 1967. 7 FIG, 13 REF.
  12. Gorr, 2001, Spatial decision support system for home-delivered services, J. Geogr. Syst., 3, 181, 10.1007/PL00011474 · DOI
  13. Haghani, 1997, Testing and evaluation of a multi-commodity multi-modal network flow model for disaster relief management, J. Adv. Transport., 31, 249, 10.1002/atr.5670310304 · DOI
  14. Hernández-Pérez, 2009, A hybrid grasp/vnd heuristic for the one-commodity pickup-and-delivery traveling salesman problem, Comput. Oper. Res., 36, 1639, 10.1016/j.cor.2008.03.008 · DOI
  15. Hernández-Pérez, 2004, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, Discrete Appl. Math., 145, 126, 10.1016/j.dam.2003.09.013 · DOI
  16. Hernández-Pérez, 2004, Heuristics for the one-commodity pickup-and-delivery traveling salesman problem, Transport. Sci., 38, 245, 10.1287/trsc.1030.0086 · DOI
  17. Hernández-Pérez, 2007, The one-commodity pickup-and-delivery traveling salesman problem: inequalities and algorithms, Networks, 50, 258, 10.1002/net.20209 · DOI
  18. Huang, 2012, Models for relief routing: equity, efficiency and efficacy, Transport. Res. Part E: Logist. Transport. Rev., 48, 2, 10.1016/j.tre.2011.05.004 · DOI
  19. Ichoua, S., 2010. Relief distribution networks: design and operations. Supply Chain Optimization, Design, and Management: Advances and Intelligent Methods, pp. 171–186. · DOI
  20. Laporte, 1984, Two exact algorithms for the distance-constrained vehicle routing problem, Networks, 14, 161, 10.1002/net.3230140113 · DOI
  21. Lien, 2014, Sequential resource allocation for nonprofit operations, Oper. Res., 62, 301, 10.1287/opre.2013.1244 · DOI
  22. Lin, 1965, Computer solutions of the traveling salesman problem, Bell Syst. Tech. J., 44, 2245, 10.1002/j.1538-7305.1965.tb04146.x · DOI
  23. Luis, 2012, Disaster relief routing: integrating research and practice, Socio-Econ. Plan. Sci., 46, 88, 10.1016/j.seps.2011.06.001 · DOI
  24. Magnanti, 1981, Accelerating benders decomposition: algorithmic enhancement and model selection criteria, Oper. Res., 29, 464, 10.1287/opre.29.3.464 · DOI
  25. Martinovic, 2009, Single-commodity vehicle routing problem with pickup and delivery service, Math. Probl. Eng., 2008
  26. Mladenović, 2012, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, Euro. J. Oper. Res., 220, 270, 10.1016/j.ejor.2012.01.036 · DOI
  27. Nair, 2016, Food rescue and delivery: heuristic algorithm for periodic unpaired pickup and delivery vehicle routing problem, Transport. Res. Rec.: J. Transport. Res. Board, 2548, 81, 10.3141/2548-10 · DOI
  28. Nair, 2017, Scheduling and routing models for food rescue and delivery operations, Socio-Econ. Plan. Sci.
  29. Nair, 2017, Fair allocation and cost-effective routing models for food rescue and redistribution, IISE Trans., 49, 1172, 10.1080/24725854.2017.1351043 · DOI
  30. Orgut, 2017, Modeling for the equitable and effective distribution of food donations under stochastic receiving capacities, IISE Trans., 49, 567, 10.1080/24725854.2017.1300358 · DOI
  31. Orgut, 2016, Modeling for the equitable and effective distribution of donated food under capacity constraints, IIE Trans., 48, 252, 10.1080/0740817X.2015.1063792 · DOI
  32. Rahmaniani, 2017, The benders decomposition algorithm: a literature review, Euro. J. Oper. Res., 259, 801, 10.1016/j.ejor.2016.12.005 · DOI
  33. Rei, 2009, Accelerating benders decomposition by local branching, INFORMS J. Comput., 21, 333, 10.1287/ijoc.1080.0296 · DOI
  34. Saharidis, 2010, Accelerating benders method using covering cut bundle generation, Int. Trans. Oper. Res., 17, 221, 10.1111/j.1475-3995.2009.00706.x · DOI
  35. Solak, 2014, The stop-and-drop problem in nonprofit food distribution networks, Ann. Oper. Res., 221, 407, 10.1007/s10479-012-1068-7 · DOI
  36. Steinhaus, 1948, The problem of fair division, Econometrica, 16
  37. Tzeng, 2007, Multi-objective optimal planning for designing relief delivery systems, Transport. Res. Part E: Logist. Transport. Rev., 43, 673, 10.1016/j.tre.2006.10.012 · DOI
  38. Varian, 1974, Equity, envy, and efficiency, J. Econ. Theory, 9, 63, 10.1016/0022-0531(74)90075-1 · DOI
  39. Wong, 1993, A spatial decision support system approach to evaluate the efficiency of a meals-on-wheels program, Prof. Geogr., 45, 332, 10.1111/j.0033-0124.1993.00332.x · DOI
  40. Xu, 2017, An unpaired pickup and delivery vehicle routing problem with multi-visit, Transport. Res. Part E: Logist. Transport. Rev., 103, 218, 10.1016/j.tre.2017.04.011 · DOI
  41. Yildiz, 2012, Planning for meals-on-wheels: algorithms and application, J. Oper. Res. Soc., 64, 1540, 10.1057/jors.2012.129 · DOI
  42. Zhao, 2009, Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem, Comput. Ind. Eng., 56, 1642, 10.1016/j.cie.2008.10.014 · DOI

Metadata

Authors
Rey, D., Almi’ani, K., & Nair, D. J.
Affiliations
UNSW Sydney (AU)
Corresponding author
Rey, David
ORCID
Venue
Transportation Research Part E: Logistics and Transportation Review
Publisher
Elsevier BV
Published
2018-04
Volume
112
Pages
19-46
ISSN
1366-5545 (ISSN-L)
DOI
10.1016/j.tre.2018.02.001
OpenAlex
W2794044364
Cited by
49
References
48
Citations by year
2026: 5 · 2025: 9 · 2024: 6 · 2023: 7 · 2022: 10 · 2021: 6 · 2020: 2 · 2019: 3 · 2018: 1
FWCI
2.49
Type
journal article
Language
en
Open access
closed
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)
Locations
  • Transportation Research Part E Logistics and Transportation Review (publishedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
Funders
Australian Research Council (LP150101266)
Topics
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Facility Location and Emergency Management
  • Social Sciences › Transportation › Urban and Freight Transport Logistics
Keywords
food rescue, envy-free allocation, pickup and delivery, humanitarian logistics, Benders decomposition, cutting plane method, greedy algorithm, local search, NP-hardness, travel cost minimization

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Exact and heuristic algorithms for finding envy-free allocations in food rescue pickup and delivery logistics. https://app.cochat.ai/papers/10.1016/j.tre.2018.02.001
The paper
Rey, D., Almi’ani, K., & Nair, D. J. (2018). Exact and heuristic algorithms for finding envy-free allocations in food rescue pickup and delivery logistics. Transportation Research Part E: Logistics and Transportation Review. https://doi.org/10.1016/j.tre.2018.02.001