Publication: The traveling purchaser problem with fast service option
dc.contributor.author | Küçükoğlu, İlker | |
dc.contributor.buuauthor | KÜÇÜKOĞLU, İLKER | |
dc.contributor.department | Mühendislik Fakültesi | |
dc.contributor.department | Endüstri Mühendisliği Bölümü | |
dc.contributor.orcid | 0000-0002-5075-0876 | |
dc.contributor.researcherid | D-8543-2015 | |
dc.date.accessioned | 2024-09-10T06:53:36Z | |
dc.date.available | 2024-09-10T06:53:36Z | |
dc.date.issued | 2022-01-21 | |
dc.description.abstract | The traveling purchaser problem (TPP) is a generalization of the well-known traveling salesman problem, in which a list of products with different quantities has to be purchased from a subset of markets selling various products with different prices. The aim of the problem is to minimize total traveling and purchasing costs while satisfying the products demand in a unique tour. This study introduces a new variant of the TPP, in which the tour has to be completed within a duration time limit by taking into account the traveling and purchasing times of the purchaser. For the purchasing operations, two types of service options are allowed for the purchaser: standard and fast service. The fast service option of a market gives opportunities to the purchaser to complete the purchasing process in a shorter time with an additional cost. This problem is called the traveling purchaser problem with fast service option (TPP-FSO). In addition to presenting a new TPP variant to the literature, this paper proposes an adaptive large neighborhood search (ALNS) algorithm for the TPP-FSO. The proposed ALNS is enriched by a local search procedure, which consists of a set of route-change-based and procurement-changebased heuristics. To evaluate the performance of the ALNS on TPP-FSO, different-sized benchmark problems are generated by using a well-known TPP benchmark problem set. The results of the computations demonstrate the efficiency of the proposed algorithm by introducing better results in shorter computational times. | |
dc.identifier.doi | 10.1016/j.cor.2022.105700 | |
dc.identifier.eissn | 1873-765X | |
dc.identifier.issn | 0305-0548 | |
dc.identifier.uri | https://doi.org/10.1016/j.cor.2022.105700 | |
dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S0305054822000053 | |
dc.identifier.uri | https://hdl.handle.net/11452/44458 | |
dc.identifier.volume | 141 | |
dc.identifier.wos | 000762974200016 | |
dc.indexed.wos | WOS.SCI | |
dc.language.iso | en | |
dc.publisher | Elsevier | |
dc.relation.journal | Computers & Operations Research | |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi | |
dc.rights | info:eu-repo/semantics/closedAccess | |
dc.subject | Large neighborhood search | |
dc.subject | Vehicle-routing problem | |
dc.subject | Cut algorithm | |
dc.subject | Formulation | |
dc.subject | Heuristics | |
dc.subject | Combinatorial optimization | |
dc.subject | Traveling purchaser problem | |
dc.subject | Meta-heuristics | |
dc.subject | Adaptive large neighborhood search | |
dc.subject | Science & technology | |
dc.subject | Technology | |
dc.subject | Computer science, interdisciplinary applications | |
dc.subject | Engineering, industrial | |
dc.subject | Operations research & management science | |
dc.subject | Computer science | |
dc.subject | Engineering | |
dc.subject | Operations research & management science | |
dc.title | The traveling purchaser problem with fast service option | |
dc.type | Article | |
dspace.entity.type | Publication | |
local.contributor.department | Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü | |
relation.isAuthorOfPublication | 3715d274-af41-48cd-a5d7-8b2b7cd50a1a | |
relation.isAuthorOfPublication.latestForDiscovery | 3715d274-af41-48cd-a5d7-8b2b7cd50a1a |