Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25530%2F24%3A39922546" target="_blank" >RIV/00216275:25530/24:39922546 - isvavai.cz</a>

Result on the web

<a href="https://onlinelibrary.wiley.com/doi/10.1155/2024/8753106" target="_blank" >https://onlinelibrary.wiley.com/doi/10.1155/2024/8753106</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1155/2024/8753106" target="_blank" >10.1155/2024/8753106</a>

Result language

angličtina

Original language name

Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix

Original language description

The goods collection and delivery process often relates to distribution logistics problems. The task is to deliver goods from warehouses to customers under specific circumstances. Efforts to optimize the process are largely aimed at reducing overall costs of goods transportation. Among the prominent algorithms for solving the basic type of the delivery (or collection) problem, which includes a single depot and a homogeneous vehicle fleet, is the algorithm developed by Clarke and Wright in 1964. This algorithm minimizes transportation costs by maximizing the savings achieved through merging multiple routes into one. This paper primarily aims to solve the pickup and delivery problem where the goods must be delivered and empty packaging collected in a single process. The request of a customer can be routed from the depot or from another customer. Similarly, the destination of the request may be the depot or another customer. Unlike the original version of the Clarke and Wright algorithm, the initial routes are created to satisfy delivery orders, and therefore, the same customer can occur in multiple routes. Consequently, a situation may arise in which two routes containing one or more common vertices must be combined during the calculation. Furthermore, these vertices need not be the outermost vertices of the routes. This situation cannot be addressed by using the original version of the Clarke and Wright algorithm, and that is why we propose its modification. Merging routes through inner vertices means that the cost savings depend on the configurations of the routes, and therefore, they cannot be calculated a priori. Instead, the dynamic savings matrix must be used.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

20100 - Civil engineering

Project

—

Continuities

O - Projekt operacniho programu

Publication year

2024

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Journal of Advanced Transportation

ISSN

0197-6729

e-ISSN

2042-3195

Volume of the periodical

1

Issue of the periodical within the volume

Volume 2024

Country of publishing house

GB - UNITED KINGDOM

Number of pages

15

Pages from-to

"29 March 2024"

UT code for WoS article

001197972500001

EID of the result in the Scopus database

2-s2.0-85189971344