Capacitated Vehicle Routing Problem with Time Windows
| dc.contributor.author | Aleyna Tanel | |
| dc.contributor.author | Begum Kinay | |
| dc.contributor.author | Deniz Karakul | |
| dc.contributor.author | Efecan Ozyoruk | |
| dc.contributor.author | Elif Iskifoglu | |
| dc.contributor.author | Ezgi Ozogul | |
| dc.contributor.author | Meryem Ustaoglu | |
| dc.contributor.author | Damla Yuksel | |
| dc.contributor.author | Mustafa Arslan Ornek | |
| dc.contributor.author | Kınay, Begüm | |
| dc.contributor.author | İskifoğlu, Elif | |
| dc.contributor.author | Örnek, Mustafa Arslan | |
| dc.contributor.author | Özyörük, Efecan | |
| dc.contributor.author | Tanel, Aleyna | |
| dc.contributor.author | Karakul, Deniz | |
| dc.contributor.author | Özoğul, Ezgi | |
| dc.contributor.editor | NM Durakbasa | |
| dc.contributor.editor | MG Gencyilmaz | |
| dc.coverage.spatial | ELECTR NETWORK | |
| dc.date.accessioned | 2025-10-06T16:19:20Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | Since distribution activities have great importance for firms supply management is a widely studied concept in many sectors. This study demonstrates an application of a Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). The problem is in the form of a fixed destination multi depots visited by multi-travelling salesmen and the distance-travel time matrix is assumed to be asymmetric. The objective of the problem is to minimize the longest route time of each vehicle. This is achieved by developing a mixed-integer linear programming model (MILP) for the problem. Additionally since the problem is NP-hard a general heuristic method is developed to solve the problem for larger instances in negligible computational times. Results show that the balance between the individual route times of the vehicles is provided and the time window limit is ensured. The paper also discusses the results and presents concluding remarks. | |
| dc.identifier.doi | 10.1007/978-3-030-90421-0_56 | |
| dc.identifier.isbn | 978-3-030-90421-0, 978-3-030-90420-3 | |
| dc.identifier.isbn | 9783030904203 | |
| dc.identifier.isbn | 9783030904210 | |
| dc.identifier.issn | 2195-4356 | |
| dc.identifier.issn | 2195-4364 | |
| dc.identifier.scopus | 2-s2.0-85119884459 | |
| dc.identifier.uri | http://dx.doi.org/10.1007/978-3-030-90421-0_56 | |
| dc.identifier.uri | https://gcris.yasar.edu.tr/handle/123456789/5737 | |
| dc.identifier.uri | https://doi.org/10.1007/978-3-030-90421-0_56 | |
| dc.language.iso | English | |
| dc.publisher | SPRINGER-VERLAG SINGAPORE PTE LTD | |
| dc.relation.ispartof | 21st International Symposium on Production Research (ISPR) - Digitizing Production System | |
| dc.relation.ispartofseries | Lecture Notes in Mechanical Engineering | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.source | DIGITIZING PRODUCTION SYSTEMS ISPR2021 | |
| dc.subject | Multi depot, Multi-travelling salesman problem, MDMTSP, Min-Max mTSP, Mixed-integer linear programming, Capacitated vehicle routing problem, Time windows, Heuristics, 2opt algorithm | |
| dc.subject | MULTIPLE DEPOT, ALGORITHM | |
| dc.subject | Heuristics | |
| dc.subject | Min-Max mTSP | |
| dc.subject | Mixed-Integer Linear Programming | |
| dc.subject | Time Windows | |
| dc.subject | 2opt Algorithm | |
| dc.subject | Capacitated Vehicle Routing Problem | |
| dc.subject | Multi-Travelling Salesman Problem | |
| dc.subject | MDMTSP | |
| dc.subject | Multi Depot | |
| dc.title | Capacitated Vehicle Routing Problem with Time Windows | |
| dc.type | Conference Object | |
| dspace.entity.type | Publication | |
| gdc.author.id | Ornek, Mustafa Arslan/0000-0002-8612-5183 | |
| gdc.author.id | YÜKSEL, DAMLA/0000-0003-4630-3325 | |
| gdc.author.scopusid | 57352255300 | |
| gdc.author.scopusid | 55926629500 | |
| gdc.author.scopusid | 57351507400 | |
| gdc.author.scopusid | 57351507300 | |
| gdc.author.scopusid | 57351507500 | |
| gdc.author.scopusid | 57352255400 | |
| gdc.author.scopusid | 57351962100 | |
| gdc.author.wosid | Ornek, Mustafa Arslan/A-5643-2009 | |
| gdc.author.wosid | YÜKSEL, DAMLA/ABE-9888-2020 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | ||
| gdc.description.departmenttemp | [Tanel, Aleyna; Kinay, Begum; Karakul, Deniz; Ozyoruk, Efecan; Iskifoglu, Elif; Ozogul, Ezgi; Ustaoglu, Meryem; Yuksel, Damla; Ornek, Mustafa Arslan] Yasar Univ, Dept Ind Engn, Izmir, Turkey | |
| gdc.description.endpage | 664 | |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | |
| gdc.description.startpage | 653 | |
| gdc.description.woscitationindex | Conference Proceedings Citation Index - Science | |
| gdc.identifier.openalex | W3213828095 | |
| gdc.identifier.wos | WOS:000797796900058 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 1.0 | |
| gdc.oaire.influence | 2.521462E-9 | |
| gdc.oaire.isgreen | false | |
| gdc.oaire.popularity | 2.9743332E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 0.6278 | |
| gdc.openalex.normalizedpercentile | 0.68 | |
| gdc.opencitations.count | 2 | |
| gdc.plumx.mendeley | 21 | |
| gdc.plumx.scopuscites | 2 | |
| gdc.scopus.citedcount | 2 | |
| gdc.virtual.author | Örnek, Mustafa Arslan | |
| gdc.wos.citedcount | 2 | |
| oaire.citation.endPage | 664 | |
| oaire.citation.startPage | 653 | |
| person.identifier.orcid | YUKSEL- DAMLA/0000-0003-4630-3325, Ornek- Mustafa Arslan/0000-0002-8612-5183 | |
| relation.isAuthorOfPublication | 5432a2ed-1197-40db-b887-d0120928d4b9 | |
| relation.isAuthorOfPublication.latestForDiscovery | 5432a2ed-1197-40db-b887-d0120928d4b9 | |
| relation.isOrgUnitOfPublication | ac5ddece-c76d-476d-ab30-e4d3029dee37 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | ac5ddece-c76d-476d-ab30-e4d3029dee37 |