Integrated distribution and loading planning via a compact metaheuristic algorithm

► We solve the vehicle routing problem with two-dimensional loading constraints. ► An innovative and compact-structured solution approach is proposed. ► Only two search parameters are contained in the proposed optimization framework. ► An original memory component effectively tackles the loading requirements of the examined problem. ► The obtained results match or improve the best known solutions for most of the benchmark instances.