Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints

Bin Ji, Zheng Zhang, Samson S. Yu, Saiqi Zhou and Guohua Wu

European Journal of Operational Research, 2023, vol. 306, issue 3, 1219-1235

Abstract: In light of the existing practical applications of the two-dimensional loading on vehicle scheduling and many-to-many supply-demand relationships between suppliers and customers, we address a many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints (or the heterogeneous 2L-MVRPCD). The newly proposed problem can be regarded as a generalized problem of the many-to-many vehicle routing with cross-docking (MVRPCD) and capacitated vehicle routing problem with two-dimensional loading constraints (2L-CVRP). To solve small-scale 2L-MVRPCDs, a mixed integer linear programming (MILP) model is developed, whereas two hybrid optimization heuristic algorithms are proposed to solve large-scale 2L-MVRPCDs. The first heuristic incorporates a basic adaptive large neighborhood search (ALNS) algorithm and a new best-fit-skyline (BFS) packing heuristic, while the second heuristic, a Tabu-based ALNS (ALNS/TS), extends the first one by embedding an insert-tabu strategy to enhance the intensity and diversity of search. Wide-ranging instances with various many-to-many supply-demand scenarios and different loading configurations are employed to verify the efficacy of the proposed MILP model and two heuristics. Numerical results show that small-scale heterogeneous 2L-MVRPCD instances with and without the rotation constraints can be solved to optimality by commercial solvers, and the proposed heuristics can achieve high-quality solutions within a reasonable computational time for large-scale instances. Meanwhile, the comparison between the proposed heuristics and existing methods verifies the effectiveness and applicability of the proposed heuristics for solving MVRPCD and 2L-CVRP.

Keywords: Routing; Cross-docking; Loading constraints; Tabu-based adaptive large neighborhood search; Mixed integer linear programming (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221722006440
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:306:y:2023:i:3:p:1219-1235

DOI: 10.1016/j.ejor.2022.08.001

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().