A Comparison between Memetic Algorithm and Genetic Algorithm for an Integrated Logistics Network with Flexible Delivery Path

Elham Behmanesh () and Jürgen Pannek
Additional contact information
Elham Behmanesh: University of Bremen
Jürgen Pannek: University of Bremen

SN Operations Research Forum, 2021, vol. 2, issue 3, 1-24

Abstract: Abstract The distribution/allocation problem is known as one of the most comprehensive strategic decision. In real-world cases, it is impossible to solve a distribution/allocation problem in traditional ways with acceptable time. Hence researchers develop efficient non-traditional techniques for the large-term operation of the whole supply chain. These techniques provide near optimal solutions particularly for large-scale test problems. This paper presents an integrated supply chain model which is flexible in the delivery path. As the solution methodology, we apply a memetic algorithm with a neighborhood search mechanism and novelty in population presentation method called “extended random path direct encoding method.” To illustrate the performance of the proposed memetic algorithm, LINGO optimization software serves as comparison basis for small size problems. In large-size cases that we are dealing with in real world, a classical genetic algorithm as the second metaheuristic algorithm is considered to compare the results and show the efficiency of the memetic algorithm.

Keywords: Integrated logistics network; Flexible path; Memetic algorithm; Genetic algorithm (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-021-00087-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:snopef:v:2:y:2021:i:3:d:10.1007_s43069-021-00087-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-021-00087-8

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().