Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/256
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Belgin, Ö. | - |
dc.contributor.author | Karaoğlan, İ. | - |
dc.contributor.author | Altıparmak, F. | - |
dc.date.accessioned | 2021-12-13T10:23:55Z | - |
dc.date.available | 2021-12-13T10:23:55Z | - |
dc.date.issued | 2021 | - |
dc.identifier.issn | 1300-1884 | - |
dc.identifier.uri | https://doi.org/10.17341/gazimmfd.687959 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/256 | - |
dc.description.abstract | In this study, the two-echelon vehicle routing problem with simultaneous pickup and delivery (2E-VRPSPD) is considered. A two-index node-based mixed integer programming (MIP) formulation is developed for the problem and then valid inequalities are used to strengthen the formulation. Moreover, several variants of the 2E-VRPSPD are introduced and the MIP formulation is adapted for these variants. To solve the problem and its variants, a matheuristic algorithm based on variable neighborhood descent algorithm with local search and mathematical programming is proposed. The performance of the proposed matheuristic is analyzed on 2E-VRPSPD and each variant of the problem using test problems derived from the literature. The experimental studies indicate that 390 out of 564 test instances up to 10 depots and 100 customers are solved to optimality for the base problem 2E-VRPSPD. Similar satisfactory results are also obtained for the other variants of the problem using same data sets. © 2021 Gazi Universitesi Muhendislik-Mimarlik. All rights reserved. | en_US |
dc.language.iso | tr | en_US |
dc.publisher | Gazi Universitesi | en_US |
dc.relation.ispartof | Journal of the Faculty of Engineering and Architecture of Gazi University | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Logistics | en_US |
dc.subject | Matheuristic | en_US |
dc.subject | Simultaneous pickup and delivery | en_US |
dc.subject | Two-echelon vehicl routing problem | en_US |
dc.subject | Variable neighborhood descen search | en_US |
dc.title | Mathematical programming based heuristic approach for two-echelon vehicle routing problem with simultaneous pickup and delivery | en_US |
dc.title.alternative | İki aşamalı eş zamanlı topla-dağıt araç rotalama problemi için matematiksel programlama tabanlı sezgisel yaklaşım | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.17341/gazimmfd.687959 | - |
dc.identifier.scopus | 2-s2.0-85107643983 | en_US |
dc.department | Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Endüstri Mühendisliği Bölümü | en_US |
dc.identifier.volume | 36 | en_US |
dc.identifier.issue | 3 | en_US |
dc.identifier.startpage | 1565 | en_US |
dc.identifier.endpage | 1579 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.authorscopusid | 23974586600 | - |
dc.authorscopusid | 12143936100 | - |
dc.authorscopusid | 6602908594 | - |
dc.identifier.trdizinid | 1138971 | en_US |
dc.identifier.scopusquality | Q2 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.languageiso639-1 | tr | - |
item.openairetype | Article | - |
item.grantfulltext | open | - |
item.fulltext | With Fulltext | - |
crisitem.author.dept | 02.09. Department of Industrial Engineering | - |
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 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
10.17341-gazimmfd.687959-965310.pdf | 527.77 kB | Adobe PDF | View/Open |
CORE Recommender
Page view(s)
210
checked on Aug 26, 2024
Download(s)
124
checked on Aug 26, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.