An improved chemical reaction optimisation for the dynamic CVRP with two-dimensional loading constraints

Document Type

Article

Source of Publication

International Journal of Operational Research

Publication Date

1-1-2026

Abstract

Efficient packing and routing are key to minimising supply chain costs and delivery times. This is particularly critical with two-dimensional items like appliances or forklifts, where maximising cargo space and optimising routes are crucial. In this study, we investigate the dynamic vehicle routing problem with two-dimensional loading constraints. This problem involves assigning routes to vehicles while considering items' dimensions and minimising transport costs. To tackle this problem, we propose an improved chemical reaction optimisation algorithm. The algorithm's effectiveness lies in its balance between finding known good solutions and exploring new possibilities, leading to optimal solutions. Additionally, we perform a local search scheme to refine the solution further. To address the complexity of dynamic packing, a next-fit decreasing heuristic is designed. To assess the effectiveness our algorithm, we adapt the static benchmark instances using various degrees of dynamism. Based on performance metrics, results demonstrate the competitiveness of our algorithm.

ISSN

1745-7645

Publisher

Inderscience Publishers

Volume

57

Issue

1

First Page

30

Last Page

53

Disciplines

Computer Sciences

Keywords

chemical reaction optimisation, dynamic vehicle routing problem, local search, next fit decreasing heuristic, two-dimensional loading constraints

Scopus ID

105052202686

Indexed in Scopus

yes

Open Access

no

Link to Full Text

Share

COinS