Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.13091/1563
Title: A mixed integer mathematical model and a heuristic approach for two echelon location routing problem with simultaneous pickup and delivery
Other Titles: İki aşamalı yer seçimi ve eş zamanlı topla dağıt araç rotalama problemi: Karışık tam sayılı matematiksel model ve sezgisel yaklaşım
Authors: Yıldız, Ece Arzu
Karaoğlan, İsmail
Altıparmak, Fulya
Keywords: Two Echelon Location Routing Problem
Simultaneous Pickup And Delivery
Integer Programming
Heuristic Approach
Facility Location
Local Search
Depot
Formulations
Algorithms
Logistics
Single
Publisher: GAZI UNIV, FAC ENGINEERING ARCHITECTURE
Abstract: This study considers Two Echelon Location Routing Problem with Simultaneous Pickup and Delivery (2E/LRP-SPD). In a two-echelon distribution network consisting of factories, warehouses and customers, the aim is to determine which facilities will be opened in which candidate regions and routing activities to be carried out among them. Routing activities include distributing and collecting activities. While distributing activities are performed from primary facilities (factory) to secondary facilities (depots) and secondary facilities to customers, collecting activities are done from customers to the secondary facilities and from secondary facilities to primary facilities. We propose a two-index node based mixed integer programming formulation for the 2E-LRPSPD. As the problem is in NP-Hard problem class, a constructive heuristic algorithm based on Clarke-Wright algorithm is developed to solve medium- and large- size problems. The performance of the heuristic approach is investigated on test instances derived from literature. Computational results show that heuristic algorithm gives good quality solutions for medium- and large-size instances in a very short computation time. Thus, the contribution of this study to the literature is to present an efficient mathematical model for solving small-size problems and to develop a constructive heuristic algorithm that produces very fast and high-quality solutions for medium and large-size problems.
URI: https://doi.org/10.17341/gazimmfd.591293
https://hdl.handle.net/20.500.13091/1563
ISSN: 1300-1884
1304-4915
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections
TR Dizin İndeksli Yayınlar Koleksiyonu / TR Dizin Indexed Publications Collections
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections

Files in This Item:
File SizeFormat 
10.17341-gazimmfd.591293-760764.pdf471.01 kBAdobe PDFView/Open
Show full item record



CORE Recommender

WEB OF SCIENCETM
Citations

1
checked on Mar 23, 2024

Page view(s)

258
checked on Mar 25, 2024

Download(s)

162
checked on Mar 25, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.