Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking

Amalia I. Nikolopoulou, Panagiotis Repoussis, Christos D. Tarantilis, Emmanouil E. Zachariadis

Research output: Contribution to journalArticle

1 Citations (Scopus)

Abstract

This paper presents a new generalized vehicle routing problem with a cross-dock. Basic features of the examined problem are the many-to-many relationship between the suppliers and customers, and the use of different vehicle fleets for performing the inbound and outbound routes. An adaptive memory programming method has been developed coupled with a Tabu Search algorithm. For generating new provisional solutions, elite subroutes with varying lengths are identified from the reference solutions and are used as building blocks, while multiple strategies are applied to maintain an effective interplay between diversification and intensification. Various computational experiments are conducted on existing as well as on new data sets with diverse features, regarding the geographic distribution of the nodes and the density of supplier-customer links. Overall, the proposed method performed very well and new best solutions have been found. Lastly, new insights regarding the impact of split options are reported.

Original languageEnglish (US)
JournalOperational Research
Volume19
Issue number1
DOIs
StatePublished - Mar 12 2019

Fingerprint

Many to many
Vehicle routing
Docking
Vehicle Routing Problem
Computer programming
Programming
Customers
Data storage equipment
Tabu Search Algorithm
Diversification
Computational Experiments
Building Blocks
Docks
Tabu search
Vertex of a graph
Cross-docking
Vehicle routing problem
Suppliers
Experiments
Strategy

Cite this

Nikolopoulou, Amalia I. ; Repoussis, Panagiotis ; Tarantilis, Christos D. ; Zachariadis, Emmanouil E. / Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking. In: Operational Research. 2019 ; Vol. 19, No. 1.
@article{ca4afa519b0146a596021a04ec662e57,
title = "Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking",
abstract = "This paper presents a new generalized vehicle routing problem with a cross-dock. Basic features of the examined problem are the many-to-many relationship between the suppliers and customers, and the use of different vehicle fleets for performing the inbound and outbound routes. An adaptive memory programming method has been developed coupled with a Tabu Search algorithm. For generating new provisional solutions, elite subroutes with varying lengths are identified from the reference solutions and are used as building blocks, while multiple strategies are applied to maintain an effective interplay between diversification and intensification. Various computational experiments are conducted on existing as well as on new data sets with diverse features, regarding the geographic distribution of the nodes and the density of supplier-customer links. Overall, the proposed method performed very well and new best solutions have been found. Lastly, new insights regarding the impact of split options are reported.",
author = "Nikolopoulou, {Amalia I.} and Panagiotis Repoussis and Tarantilis, {Christos D.} and Zachariadis, {Emmanouil E.}",
year = "2019",
month = "3",
day = "12",
doi = "https://doi.org/10.1007/s12351-016-0278-1",
language = "English (US)",
volume = "19",
journal = "Operational Research",
issn = "1109-2858",
publisher = "Springer Verlag",
number = "1",

}

Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking. / Nikolopoulou, Amalia I.; Repoussis, Panagiotis; Tarantilis, Christos D.; Zachariadis, Emmanouil E.

In: Operational Research, Vol. 19, No. 1, 12.03.2019.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking

AU - Nikolopoulou, Amalia I.

AU - Repoussis, Panagiotis

AU - Tarantilis, Christos D.

AU - Zachariadis, Emmanouil E.

PY - 2019/3/12

Y1 - 2019/3/12

N2 - This paper presents a new generalized vehicle routing problem with a cross-dock. Basic features of the examined problem are the many-to-many relationship between the suppliers and customers, and the use of different vehicle fleets for performing the inbound and outbound routes. An adaptive memory programming method has been developed coupled with a Tabu Search algorithm. For generating new provisional solutions, elite subroutes with varying lengths are identified from the reference solutions and are used as building blocks, while multiple strategies are applied to maintain an effective interplay between diversification and intensification. Various computational experiments are conducted on existing as well as on new data sets with diverse features, regarding the geographic distribution of the nodes and the density of supplier-customer links. Overall, the proposed method performed very well and new best solutions have been found. Lastly, new insights regarding the impact of split options are reported.

AB - This paper presents a new generalized vehicle routing problem with a cross-dock. Basic features of the examined problem are the many-to-many relationship between the suppliers and customers, and the use of different vehicle fleets for performing the inbound and outbound routes. An adaptive memory programming method has been developed coupled with a Tabu Search algorithm. For generating new provisional solutions, elite subroutes with varying lengths are identified from the reference solutions and are used as building blocks, while multiple strategies are applied to maintain an effective interplay between diversification and intensification. Various computational experiments are conducted on existing as well as on new data sets with diverse features, regarding the geographic distribution of the nodes and the density of supplier-customer links. Overall, the proposed method performed very well and new best solutions have been found. Lastly, new insights regarding the impact of split options are reported.

UR - http://www.scopus.com/inward/record.url?scp=84995804396&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84995804396&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/s12351-016-0278-1

DO - https://doi.org/10.1007/s12351-016-0278-1

M3 - Article

VL - 19

JO - Operational Research

JF - Operational Research

SN - 1109-2858

IS - 1

ER -