Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/1185
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tütüncü, Gözde Yazgı | - |
dc.date.accessioned | 2023-06-16T12:59:17Z | - |
dc.date.available | 2023-06-16T12:59:17Z | - |
dc.date.issued | 2010 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.issn | 1872-6860 | - |
dc.identifier.uri | https://doi.org/10.1016/j.ejor.2009.03.044 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14365/1185 | - |
dc.description.abstract | In this article, a visual interactive approach based on a new greedy randomised adaptive memory programming search (GRAMPS) algorithm is proposed to solve the heterogeneous fixed fleet vehicle routing problem (HFFVRP) and a new extension of the HFFVRP. which is called heterogeneous fixed fleet vehicle routing problem with backhauls (HFFVRPB). This problem involves two different sets of customers. Backhaul customers are pickup points and linehaul customers are delivery points that are to be serviced from a single depot by a heterogeneous fixed fleet of vehicles, each of which is restricted in the capacity it can carry, with different variable travelling costs. The proposed approach is implemented within a visual decision support system, which was developed to allow users to produce and judge alternative decisions by using their knowledge and experience about the requirements of the HFFVRP. The computational results are provided on classical problem instances for HFFVRP and a new best-known solution has been reported. A new set of problem instances for HFFVRPB is proposed. The results show that the proposed approach can find high quality solutions in very short time and the system is able to create alternative solutions in order to satisfy the user's expectations. (C) 2009 Elsevier B.V. All rights reserved. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.relation.ispartof | European Journal of Operatıonal Research | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Routing | en_US |
dc.subject | Metaheuristics | en_US |
dc.subject | GRAMPS | en_US |
dc.subject | Heterogeneous fixed fleet | en_US |
dc.subject | Backhauls | en_US |
dc.subject | Search | en_US |
dc.title | An Interactive Gramps Algorithm for the Heterogeneous Fixed Fleet Vehicle Routing Problem With and Without Backhauls | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.ejor.2009.03.044 | - |
dc.identifier.scopus | 2-s2.0-70349290593 | en_US |
dc.department | İzmir Ekonomi Üniversitesi | en_US |
dc.authorid | Tütüncü, G.Yazgı/0000-0002-9363-6141 | - |
dc.authorwosid | Tütüncü, G.Yazgı/AAP-6520-2021 | - |
dc.authorscopusid | 26436326500 | - |
dc.identifier.volume | 201 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.startpage | 593 | en_US |
dc.identifier.endpage | 600 | en_US |
dc.identifier.wos | WOS:000270964900025 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q1 | - |
dc.identifier.wosquality | Q1 | - |
item.grantfulltext | reserved | - |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
item.openairetype | Article | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.02. Mathematics | - |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Files in This Item:
File | Size | Format | |
---|---|---|---|
205.pdf Restricted Access | 506.06 kB | Adobe PDF | View/Open Request a copy |
CORE Recommender
SCOPUSTM
Citations
31
checked on Dec 18, 2024
WEB OF SCIENCETM
Citations
25
checked on Dec 18, 2024
Page view(s)
74
checked on Dec 23, 2024
Download(s)
6
checked on Dec 23, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.