Pith. sign in

REVIEW 2 major objections 49 references

A new heuristic finds practical solutions to the air cargo load planning with routing, pickup and delivery problem in far less than operationally acceptable time on a portable computer.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.3

2026-06-26 00:27 UTC pith:S2BDQGTU

load-bearing objection The paper names a combined air cargo load-and-routing problem and tests a custom heuristic on Brazilian hub data, but supplies no performance numbers and leaves physical constraints unmodeled. the 2 major comments →

arxiv 2606.26404 v1 pith:S2BDQGTU submitted 2026-06-24 math.GM

Air cargo load and route planning in pickup and delivery operations

A.C.P. Mesquita , C.A.A. Sanches This is my paper
classification math.GM
keywords air cargo planningpickup and deliveryload balancingrouting optimizationheuristic algorithmNP-hard problempallet loadingtransport logistics
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper models the combined tasks of route planning, item prioritization, pallet building, and balanced loading for air cargo pickup and delivery as a single NP-hard problem called ACLP+RPDP. It represents the aircraft load using standardized pallets placed only in fixed positions to enforce balance and other limits. The authors test a commercial solver, five existing meta-heuristics, and one new heuristic they designed for this model against historical data from Brazilian hub networks. Their custom strategy produces usable plans quickly enough for real operations on ordinary portable hardware.

Core claim

The central claim is that the new heuristic, when applied to the ACLP+RPDP model built around fixed pallet positions, generates practical solutions for a wide range of real pickup-and-delivery air cargo missions in times well below what turnaround operations require.

What carries the argument

The ACLP+RPDP mathematical model that assigns standardized pallets to fixed positions on the aircraft while jointly optimizing routes, pickups, deliveries, and load balance, solved by a problem-specific heuristic.

Load-bearing premise

The model that places standardized pallets in fixed positions on the aircraft captures the physical, regulatory, and operational constraints that arise in actual missions.

What would settle it

Running the heuristic on fresh real-world mission data and obtaining plans that violate aircraft weight-and-balance rules in flight, or that take longer than operational windows allow, would show the practical claim does not hold.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Planners gain the ability to handle trip itineraries, item prioritization, pallet construction, and balanced loading inside one optimization run.
  • Risks of improper delivery, excess fuel burn, and imbalance-related safety issues can be reduced by using the generated plans.
  • Turn-around times shorten because the full planning task completes faster than partial manual methods.
  • The same approach works across varied instances drawn from actual hub network history without requiring high-end computing resources.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Dispatch teams could rerun the planner in real time if a cargo manifest changes shortly before departure.
  • The fixed-position modeling choice might transfer to truck or rail loading problems that share similar balance and standardization constraints.
  • Airlines could embed the heuristic inside existing flight planning software to produce balanced-load itineraries as a standard output.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 0 minor

Summary. The paper models the NP-hard Air Cargo Load Planning with Routing, Pickup, and Delivery Problem (ACLP+RPDP) by placing standardised pallets in fixed aircraft positions. It develops a new heuristic, compares it against a commercial solver and five meta-heuristics, and tests the approach on historical data from Brazilian hub networks. The central claim is that the strategy finds practical solutions for a wide range of real instances on a portable computer in much less than operationally acceptable time.

Significance. If the result holds with proper validation, the work would supply an integrated computational approach to air-cargo load planning, routing, and prioritisation that is currently unavailable commercially, potentially lowering imbalance risks, fuel consumption, and turnaround times. Credit is due for grounding the experiments in real Brazilian hub data and for systematically comparing multiple solution methods including a purpose-built heuristic.

major comments (2)
  1. [Mathematical model] The mathematical model places standardised pallets only in fixed positions. This formulation implicitly assumes that any assignment satisfying position, capacity, and priority rules will also satisfy centre-of-gravity limits, tie-down requirements, and mission-specific regulations. No section of the manuscript reports an explicit feasibility check against these omitted constraints or a sensitivity analysis on their violation rate. Because the central claim concerns “practical solutions,” this modelling gap is load-bearing.
  2. [Abstract / Experiments] The abstract asserts that experiments produced practical solutions yet supplies no quantitative metrics, optimality gaps, baseline comparisons, or validation against real operational outcomes. Without these data the claim that solutions are found “in much less than operationally acceptable time” cannot be verified from the given text.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback and the recommendation of major revision. We address each major comment below, agreeing where clarifications and additions are warranted to strengthen the claims regarding practical solutions. All indicated revisions will be made in the next version of the manuscript.

read point-by-point responses

  1. Referee: [Mathematical model] The mathematical model places standardised pallets only in fixed positions. This formulation implicitly assumes that any assignment satisfying position, capacity, and priority rules will also satisfy centre-of-gravity limits, tie-down requirements, and mission-specific regulations. No section of the manuscript reports an explicit feasibility check against these omitted constraints or a sensitivity analysis on their violation rate. Because the central claim concerns “practical solutions,” this modelling gap is load-bearing.

    Authors: The fixed-position formulation is based on pre-validated aircraft configurations used in the Brazilian hub operations, where positions are selected such that they inherently satisfy centre-of-gravity and tie-down requirements by design. Nevertheless, the manuscript does not provide an explicit post-solution feasibility check or sensitivity analysis on potential violations. We agree this is a gap for substantiating the practicality claim and will add a new subsection to the model description that details the position validation assumptions, along with a validation procedure applied to the historical instances to quantify any violation rates. This addition will be included in the revised manuscript. revision: yes

  2. Referee: [Abstract / Experiments] The abstract asserts that experiments produced practical solutions yet supplies no quantitative metrics, optimality gaps, baseline comparisons, or validation against real operational outcomes. Without these data the claim that solutions are found “in much less than operationally acceptable time” cannot be verified from the given text.

    Authors: The abstract is written concisely to outline the problem, approach, and high-level findings, consistent with standard practice. Quantitative details—including solution times on a portable computer, comparisons against the commercial solver and five meta-heuristics, optimality gaps where relevant, and performance on real Brazilian hub instances—are fully reported in the Experiments section. We concur that embedding a few key quantitative indicators (e.g., average solution times and success rates) directly in the abstract would better support the central claim and will revise the abstract accordingly. revision: yes

Circularity Check

0 steps flagged

No circularity: model and heuristics are independent of outputs

full rationale

The paper defines an NP-hard optimization problem (ACLP+RPDP) via a fixed-position pallet model on aircraft, then applies historical Brazilian hub data as input instances to off-the-shelf solvers and custom heuristics. No derivation step equates a claimed prediction or result to its own fitted parameters, self-citations, or ansatzes by construction. The central claim of practical solutions in acceptable time rests on external data and standard algorithmic performance rather than any self-referential reduction. This is the normal case of a self-contained applied OR paper.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract supplies no explicit free parameters, axioms, or invented entities; full text would be required to populate the ledger.

pith-pipeline@v0.9.1-grok · 5722 in / 1066 out tokens · 40044 ms · 2026-06-26T00:27:29.861509+00:00 · methodology

0 comments
read the original abstract

In the aerial pickup and delivery of goods in a distribution network, transport aviation faces risks of load imbalance due to the urgency required for loading, immediate take-off, and mission accomplishment. Transport planners deal with trip itineraries, prioritisation of items, building up pallets, and balanced loading, but there are no commercially available systems that can integrally assist in all these requirements. This enables other risks, such as improper delivery, excessive fuel burn, and possible safety issues due to cargo imbalance, as well as a longer than necessary turn-around time. This NP-hard problem, named "Air Cargo Load Planning with Routing, Pickup, and Delivery Problem" (ACLP+RPDP), is mathematically modelled using standardised pallets in fixed positions. We developed a strategy to solve this problem, considering historical transport data from some Brazilian hub networks, and performed several experiments with a commercial solver, five known meta-heuristics, and a new heuristic designed specifically for this problem. By using a portable computer, our strategy quickly found practical solutions to a wide range of real problems in much less than operationally acceptable time.

Figures

Figures reproduced from arXiv: 2606.26404 by A.C.P. Mesquita, C.A.A. Sanches.

Figure 1
Figure 1. Figure 1: A route with 7 airports This article is organised into six more sections. In Section 2, we make the literature review. In Section 3, we present the context and requirements of ACLP+RPDP. In Section 4, we describe its mathematical modelling. In Section 5, we describe the developed algorithms, whose results are 2 [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: A packed content on 463L pallet inside a Boeing C-17 Source: From Wikimedia Commons, the free media repository 3.2 Aircraft parameters and load balancing We consider real-world scenarios, where [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Aircraft longitudinal cut, where red lines are pallets positions We also make the following assumptions: • on each pallet, the items are distributed in such a way that their CG coincides with the centroid of the pallet, because builders are well-trained to do so; • the CG of the total load must be at a maximum longitudinal distance of limitCG long from the CG of the aircraft; • the CG of the total load mus… view at source ↗
Figure 4
Figure 4. Figure 4: Solution process • An important parameter is the number ntours of tours tested. In practical cases where K ≤ 6, we have the possibility to check all possible tours (ntours = K!). In this situation, as K is small, we can also specially analyse the two optimal solutions of the corresponding TSP (ntours = 2). Finally, in cases where K > 6, we will use a heuristic to select 100 tours of low length (ntours = 10… view at source ↗
Figure 5
Figure 5. Figure 5: Shims of various thicknesses Source: www.mscdirect.com/product/details/70475967 η1 | shims | η2 θij eij [PITH_FULL_IMAGE:figures/full_fig_p016_5.png] view at source ↗
Figure 7
Figure 7. Figure 7: Occupation rates obtained by Shims with scenario = 1, surplus = 1.2 and tmax = 3600s both methods in all scenarios. The higher the value of Normalized, the closer the method approached the best solutions found. • Speed-up: ratio of the sums of the runtimes of all scenarios and the sum of the method runtimes in all scenarios. The method with the highest Speed-up is the fastest. We also indicate the adopted … view at source ↗
Figure 8
Figure 8. Figure 8: shows the runtime curve of Shims as the number K of nodes increases. Runtime is the average obtained from 7 instances generated with surplus = 2.0 and tmax = 1200s for each value of K. In [PITH_FULL_IMAGE:figures/full_fig_p024_8.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

49 extracted references · 3 canonical work pages

  1. [1]

    and Mundru, Nishanth , title =

    Bertsimas, Dimitris and Chang, Allison and Misic, Velibor V. and Mundru, Nishanth , title =. 2019 , journal =. doi:10.1287/trsc.2018.0847 , type =

    work page doi:10.1287/trsc.2018.0847 2019

  2. [2]

    Christopher , title =

    Golestanian, Arnoosh and Bianco, Giovanni Lo and Tao, Chengyu and Beck, J. Christopher , title =. 29th International Conference on Principles and Practice of Constraint Programming (CP 2023) , pages =. 2023 , volume =

    2023

  3. [3]

    2023 , journal =

    Meng, Shanshan and Guo, Xiuping and Li, Dong and Liu, Guoquan , title =. 2023 , journal =

    2023

  4. [4]

    , title =

    Debnath, Dipraj and Hawary, A.F. , title =. 2021 , journal =. doi:10.1007/978-981-16-0866-7_12 , type =

    work page doi:10.1007/978-981-16-0866-7_12 2021

  5. [5]

    A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy , journal =

    Cheikhrouhou, Omar and Khoufi, Ines , year=. A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy , volume=. doi:10.1016/j.cosrev.2021.100369 , journal=

    work page doi:10.1016/j.cosrev.2021.100369 2021

  6. [6]

    An Integrated Traveling Salesman and Coverage Path Planning Problem for Unmanned Aircraft Systems , year=

    Xie, Junfei and Carrillo, Luis Rodolfo Garcia and Jin, Lei , journal=. An Integrated Traveling Salesman and Coverage Path Planning Problem for Unmanned Aircraft Systems , year=

  7. [7]

    Route Optimization of Airplane Travel Plans Using the Tabu-Simulated Annealing Algorithm to Solve the Traveling Salesman Challenge 2.0 , year=

    Ahmad, Edwin Dwi and Muklason, Ahmad and Nurkasanah, Ika , booktitle=. Route Optimization of Airplane Travel Plans Using the Tabu-Simulated Annealing Algorithm to Solve the Traveling Salesman Challenge 2.0 , year=

  8. [8]

    2012 , journal =

    F\'elix-Antoine Fortin and Fran c ois-Michel De Rainville and Marc-Andr\'e Gardner and Marc Parizeau and Christian Gagn\'e. 2012 , journal =

    2012

  9. [9]

    2020 , eprint=

    Genetic Algorithm for the 0/1 Multidimensional Knapsack Problem , author=. 2020 , eprint=

    2020

  10. [10]

    2022 IEEE Congress on Evolutionary Computation (CEC) , isbn =

    Peerlinck, Amy and Sheppard, John , keywords =. 2022 IEEE Congress on Evolutionary Computation (CEC) , isbn =. 2022 , title =

    2022

  11. [11]

    A genetic algorithm for the three-dimensional bin packing problem with heterogeneous bins , organization =

    Li, Xueping and Zhao, Zhaoxia and Zhang, Kaike , year=. A genetic algorithm for the three-dimensional bin packing problem with heterogeneous bins , organization =

  12. [12]

    Proceedings of the International Conference on Computing, Communications and Control Technologies , year=

    Optimizing Three-Dimensional Bin Packing Through Simulation , author=. Proceedings of the International Conference on Computing, Communications and Control Technologies , year=

  13. [13]

    2023 , journal=

    Optimal Aircraft Payload Weight and Balance using Fuzzy Linear Programming Model , author=. 2023 , journal=

    2023

  14. [14]

    Lopez-Ibanez and J

    M. Lopez-Ibanez and J. Dubois-Lacoste and L.P. C\'. Operations. 2016 , title =

    2016

  15. [15]

    2015 , title =

    Transportation Research Part C: Emerging Technologies , pages =. 2015 , title =

    2015

  16. [16]

    1985 , title =

    Journal of Complexity , pages =. 1985 , title =

    1985

  17. [17]

    Proceedings of the International Conference on Computing, Communications and Control Technologies , year=

    Optimizing air cargo load planning and analysis , author=. Proceedings of the International Conference on Computing, Communications and Control Technologies , year=

  18. [18]

    Kevin Y. K. Ng , year =. A Multicriteria Optimization Approach to Aircraft Loading , journal =

  19. [19]

    European Journal of Operational Research , year =

    Ole Larsen and Gert Mikkelsen , title =. European Journal of Operational Research , year =

  20. [20]

    Eugene Y. C. Wong and Daniel Y. Mo and Stuart So , title =. International Journal of Computer Integrated Manufacturing , volume =. 2021 , publisher =

    2021

  21. [21]

    and Ling, Kev K

    Wong, Eugene Y.C. and Ling, Kev K. T. , booktitle=. A Mixed Integer Programming Approach to Air Cargo Load Planning with Multiple Aircraft Configurations and Dangerous Goods , year=

  22. [22]

    IET Intelligent Transport Systems , volume =

    Zhao, Xiangling and Yuan, Yuan and Dong, Yun and Zhao, Ren , title =. IET Intelligent Transport Systems , volume =

  23. [23]

    Zhao and Y

    X. Zhao and Y. Dong and L. Zuo , title =. Mathematics , volume =

  24. [24]

    A. C. P. Mesquita and C. B. Cunha , title =. Transportes , year =

  25. [25]

    European Journal of Operational Research , year =

    Israel Brosh , title =. European Journal of Operational Research , year =

  26. [26]

    Chan and R

    F.T.S. Chan and R. Bhagwat and N. Kumar and M.K. Tiwari and P. Lam , title =. Expert Systems with Applications , year =

  27. [27]

    2001 , title =

    European Journal of Operational Research , pages =. 2001 , title =

    2001

  28. [28]

    1993 , title =

    Operations Research Letters , pages =. 1993 , title =

    1993

  29. [29]

    Dorigo and V

    M. Dorigo and V. Maniezzo and A. Colorni , title =. IEEE Transactions on Systems, Man, and Cybernetics , year =

  30. [30]

    T. A. Feo and M. G. C. Resende , title =. Operations Research Letters , year =

  31. [31]

    Glover , title =

    F. Glover , title =. Computers and Operations Research , year =

  32. [32]

    Heidelberg and Gregory S

    Kurt R. Heidelberg and Gregory S. Parnell and James E. Ames , title =. Naval Research Logistics , year =

  33. [33]

    Handbook of Research on Nature Inspired Computining for Economics and Management , publisher =

    Ant Colony Optimization and Multiple Knapsack Problem , volume =. Handbook of Research on Nature Inspired Computining for Economics and Management , publisher =. 2006 , author =

    2006

  34. [34]

    Laabadi and M

    S. Laabadi and M. Naimi and H. El Amri and B. Achchab , title =. American Journal of Operations Research , year =

  35. [35]

    Limbourg and M

    S. Limbourg and M. Schyns and G. Laporte , title =. Journal of the Operational Research Society , year =

  36. [36]

    2015 , volume =

    Lurkin, Virginie and Schyns, Michaël , title =. 2015 , volume =

    2015

  37. [37]

    Mongeau and C

    M. Mongeau and C. Bes , title =. IEEE Transaction on Aerospace and Electronic Systems , year =

  38. [38]

    Niar and A

    S. Niar and A. Freville , title =. Proceedings 11th International Parallel Processing Symposium , year =

  39. [39]

    and Schyns, M

    Paquay, C. and Schyns, M. and Limbourg, S. , title =. International Transactions in Operational Research , year =

  40. [40]

    Journal of Nonlinear Analysis and Optimization: Theory and Applications , author=

    A NONLINEAR INTEGER PROGRAMMING FORMULATION FOR THE AIRLIFT LOADING PROBLEM WITH INSUFFICIENT AIRCRAFT , volume=. Journal of Nonlinear Analysis and Optimization: Theory and Applications , author=. 2014 , pages=

    2014

  41. [41]

    Roesener and J.W

    A.G. Roesener and J.W. Barnes , title =. Logistics Research , year =

  42. [42]

    2014 , title =

    Transportation Research Part E: Logistics and Transportation Review , pages =. 2014 , title =

    2014

  43. [43]

    Verstichel and W

    J. Verstichel and W. Vancroonenburg and W. Souffriau and G. V. Berghe , title =. Procedia Social and Behavioral Sciences , year =

  44. [44]

    Zhan and L

    S. Zhan and L. Wang and Z. Zhang and Y. Zhong , title =. Memetic Computing , year =

  45. [45]

    M. T. Alonso and R. Alvarez-Valdes and F. Parreno , title =. A Quarterly Journal of Operations Research , year =

  46. [46]

    2009 , title =

    International Transactions in Operational Research , pages =. 2009 , title =

    2009

  47. [47]

    2018 , title =

    MATEC Web of Conferences , pages =. 2018 , title =

    2018

  48. [48]

    and Schyns, M

    Paquay, C. and Schyns, M. and Limbourg, S. and Oliveira, J. F. , title =. International Journal of Production Research , volume =. 2018 , publisher =

    2018

  49. [49]

    1992 , publisher=

    Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence , author=. 1992 , publisher=

    1992