Kernel Search for the Capacitated Vehicle Routing Problem

This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optimization problem due to its relevance to the field of transportation, distribution, and logistics. We present a matheuristic method for CVRP that adopts the main idea of the Kernel Search algorithm (KS...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied sciences Jg. 12; H. 22; S. 11421
1. Verfasser: Borčinová, Zuzana
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Basel MDPI AG 01.11.2022
Schlagworte:
ISSN:2076-3417, 2076-3417
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optimization problem due to its relevance to the field of transportation, distribution, and logistics. We present a matheuristic method for CVRP that adopts the main idea of the Kernel Search algorithm (KS) based on decomposing the original problem into sub-problems that are easier to solve. Unlike the original scheme of KS, our approach uses the Clarke–Wright savings algorithm to construct a sequence of smaller sub-problems, which are subsequently solved using mathematical programming strategies. The computational experiments performed on a set of benchmark instances showed that the proposed matheuristics achieves good results in acceptable computational time.
AbstractList This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optimization problem due to its relevance to the field of transportation, distribution, and logistics. We present a matheuristic method for CVRP that adopts the main idea of the Kernel Search algorithm (KS) based on decomposing the original problem into sub-problems that are easier to solve. Unlike the original scheme of KS, our approach uses the Clarke–Wright savings algorithm to construct a sequence of smaller sub-problems, which are subsequently solved using mathematical programming strategies. The computational experiments performed on a set of benchmark instances showed that the proposed matheuristics achieves good results in acceptable computational time.
Author Borčinová, Zuzana
Author_xml – sequence: 1
  givenname: Zuzana
  orcidid: 0000-0003-1768-6283
  surname: Borčinová
  fullname: Borčinová, Zuzana
BookMark eNptkElLA0EQhRuJYIy5-QMGvBrtbbpnjhJcggHF7dpUb8mEyfTY0zn4750kCkGsSxXFq68e7xQNmtA4hM4JvmKsxNfQtoRSSgin5AgNKZZiwjiRg4P5BI27boX7KgkrCB6i8tHFxtXZq4NolpkPMUtLl02hBVMlSM5mH25ZmdplL2GTqmaRPcega7c-Q8ce6s6Nf_oIvd_dvk0fJvOn-9n0Zj4xTMg00YZTUdIca46ltoXxOZWGg80dNdhYyDWVIjfCaw8FphZI6XmJQRRayBzYCM32XBtgpdpYrSF-qQCV2i1CXCiIaetQFVJ6ornFWnvePwROeqZg3FhcYCx61sWe1cbwuXFdUquwiU1vX1HJSk4ZyYteRfcqE0PXRefVLooqNClCVSuC1TZxdZh4f3T55-jX6r_yb4Kjgdw
CitedBy_id crossref_primary_10_3390_a18030165
crossref_primary_10_1007_s10489_024_06076_8
crossref_primary_10_3390_math11040811
Cites_doi 10.1287/mnsc.6.1.80
10.1111/itor.12945
10.1007/s12532-016-0108-8
10.1016/j.cor.2021.105475
10.1057/palgrave.jors.2601916
10.1137/1.9781611973594
10.1007/978-3-030-70277-9
10.1016/0377-2217(88)90154-3
10.1016/j.cor.2019.01.002
10.1057/jors.1970.52
10.1007/s13675-014-0030-7
10.1007/s10107-020-01523-z
10.1287/trsc.2019.0914
10.1007/978-3-319-07557-0
10.1016/j.omega.2016.01.004
10.1002/nav.20261
10.1057/jors.2009.89
10.1016/j.ejor.2021.02.024
10.1057/palgrave.jors.2602488
10.1016/j.cor.2010.02.002
10.1287/trsc.2021.1059
10.1016/j.ejor.2011.09.004
10.1057/jors.1967.44
10.1016/j.cor.2021.105292
10.1016/j.cor.2013.01.013
10.1287/opre.12.4.568
10.1007/s10732-012-9212-8
10.1007/s10589-010-9326-6
ContentType Journal Article
Copyright 2022 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2022 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
ABUWG
AFKRA
AZQEC
BENPR
CCPQU
DWQXO
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
DOA
DOI 10.3390/app122211421
DatabaseName CrossRef
ProQuest Central (Alumni Edition)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest One Community College
ProQuest Central Korea
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database (subscription)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Publicly Available Content Database
CrossRef

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
EISSN 2076-3417
ExternalDocumentID oai_doaj_org_article_877f1b4d0bbf40b4a41fa8634cd08006
10_3390_app122211421
GroupedDBID .4S
2XV
5VS
7XC
8CJ
8FE
8FG
8FH
AADQD
AAFWJ
AAYXX
ADBBV
ADMLS
AFFHD
AFKRA
AFPKN
AFZYC
ALMA_UNASSIGNED_HOLDINGS
APEBS
ARCSS
BCNDV
BENPR
CCPQU
CITATION
CZ9
D1I
D1J
D1K
GROUPED_DOAJ
IAO
IGS
ITC
K6-
K6V
KC.
KQ8
L6V
LK5
LK8
M7R
MODMG
M~E
OK1
P62
PHGZM
PHGZT
PIMPY
PROAC
TUS
ABUWG
AZQEC
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c367t-bc4269250b407bd8cf527c4ad5e2c0cda5b2765c6fbfa802da19f490a68b675a3
IEDL.DBID BENPR
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000887133800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2076-3417
IngestDate Fri Oct 03 12:51:53 EDT 2025
Mon Jun 30 07:46:45 EDT 2025
Sat Nov 29 07:17:47 EST 2025
Tue Nov 18 22:15:34 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 22
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c367t-bc4269250b407bd8cf527c4ad5e2c0cda5b2765c6fbfa802da19f490a68b675a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-1768-6283
OpenAccessLink https://www.proquest.com/docview/2739423158?pq-origsite=%requestingapplication%
PQID 2739423158
PQPubID 2032433
ParticipantIDs doaj_primary_oai_doaj_org_article_877f1b4d0bbf40b4a41fa8634cd08006
proquest_journals_2739423158
crossref_citationtrail_10_3390_app122211421
crossref_primary_10_3390_app122211421
PublicationCentury 2000
PublicationDate 2022-11-01
PublicationDateYYYYMMDD 2022-11-01
PublicationDate_xml – month: 11
  year: 2022
  text: 2022-11-01
  day: 01
PublicationDecade 2020
PublicationPlace Basel
PublicationPlace_xml – name: Basel
PublicationTitle Applied sciences
PublicationYear 2022
Publisher MDPI AG
Publisher_xml – name: MDPI AG
References Angelelli (ref_15) 2012; 51
Paessens (ref_29) 1988; 34
Guastaroba (ref_18) 2012; 217
Gaskell (ref_27) 1967; 18
Guastaroba (ref_16) 2012; 18
ref_13
ref_34
ref_10
Arnold (ref_7) 2019; 105
Angelelli (ref_14) 2010; 37
Pessoa (ref_5) 2017; 183
Laporte (ref_23) 2007; 54
Yellow (ref_28) 1970; 21
ref_17
Subramanian (ref_6) 2013; 40
Corominas (ref_31) 2010; 61
Christiaens (ref_9) 2020; 54
Accorsi (ref_8) 2020; 55
Battarra (ref_30) 2008; 59
Nascimento (ref_11) 2021; 294
(ref_25) 2005; 56
Dantzig (ref_1) 1959; 6
ref_22
ref_20
Clarke (ref_26) 1964; 12
Sungur (ref_24) 2006; 2032
(ref_33) 2016; 18
Byrne (ref_32) 1987; 20
ref_3
ref_2
Archetti (ref_12) 2014; 2
Filippi (ref_19) 2016; 65
Pecin (ref_4) 2017; 9
Archetti (ref_21) 2021; 28
References_xml – volume: 6
  start-page: 80
  year: 1959
  ident: ref_1
  article-title: The truck dispatching problem
  publication-title: Manag. Sci.
  doi: 10.1287/mnsc.6.1.80
– volume: 28
  start-page: 2984
  year: 2021
  ident: ref_21
  article-title: A kernel search heuristic for the multivehicle inventory routing problem
  publication-title: Int. Trans. Oper. Res.
  doi: 10.1111/itor.12945
– volume: 9
  start-page: 61
  year: 2017
  ident: ref_4
  article-title: Improved branch-cut-and-price for capacitated vehicle routing
  publication-title: Math. Program. Comput.
  doi: 10.1007/s12532-016-0108-8
– ident: ref_10
  doi: 10.1016/j.cor.2021.105475
– ident: ref_34
– volume: 2032
  start-page: 53
  year: 2006
  ident: ref_24
  article-title: A Priori Performance Measures for Arc-Based Formulations of Vehicle Routing Problem
  publication-title: Transp. Res. Rec.
– volume: 56
  start-page: 954
  year: 2005
  ident: ref_25
  article-title: A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
  publication-title: J. Oper. Res. Soc.
  doi: 10.1057/palgrave.jors.2601916
– ident: ref_2
  doi: 10.1137/1.9781611973594
– ident: ref_22
  doi: 10.1007/978-3-030-70277-9
– volume: 34
  start-page: 336
  year: 1988
  ident: ref_29
  article-title: The savings algorithm for the vehicle routing problem
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(88)90154-3
– volume: 20
  start-page: 19
  year: 1987
  ident: ref_32
  article-title: The Taguchi Approach to Parameter Design
  publication-title: Qual. Prog.
– volume: 105
  start-page: 32
  year: 2019
  ident: ref_7
  article-title: Knowledge-guided local search for the vehicle routing problem
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2019.01.002
– volume: 21
  start-page: 281
  year: 1970
  ident: ref_28
  article-title: A computational modification to the savings method of vehicle scheduling
  publication-title: Oper. Res. Q.
  doi: 10.1057/jors.1970.52
– volume: 2
  start-page: 223
  year: 2014
  ident: ref_12
  article-title: A survey on matheuristics for routing problems
  publication-title: EURO J. Comput. Optim.
  doi: 10.1007/s13675-014-0030-7
– volume: 183
  start-page: 483
  year: 2017
  ident: ref_5
  article-title: A generic exact solver for vehicle routing and related problems
  publication-title: Math. Program.
  doi: 10.1007/s10107-020-01523-z
– volume: 54
  start-page: 417
  year: 2020
  ident: ref_9
  article-title: Slack induction by string removals for vehicle routing problems
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.2019.0914
– ident: ref_3
  doi: 10.1007/978-3-319-07557-0
– volume: 65
  start-page: 122
  year: 2016
  ident: ref_19
  article-title: A heuristic framework for the bi-objective enhanced index tracking problem
  publication-title: Omega
  doi: 10.1016/j.omega.2016.01.004
– volume: 54
  start-page: 811
  year: 2007
  ident: ref_23
  article-title: What you should know about the vehicle routing problem
  publication-title: Nav. Res. Logist.
  doi: 10.1002/nav.20261
– volume: 61
  start-page: 1309
  year: 2010
  ident: ref_31
  article-title: Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics)
  publication-title: J. Oper. Res. Soc.
  doi: 10.1057/jors.2009.89
– volume: 294
  start-page: 1108
  year: 2021
  ident: ref_11
  article-title: A hybrid adaptive iterated local search with diversi-fication control to the capacitated vehicle routing problem
  publication-title: Eur. J. Oper.
  doi: 10.1016/j.ejor.2021.02.024
– volume: 59
  start-page: 1568
  year: 2008
  ident: ref_30
  article-title: Tuning a parametric Clarke-Wright heuristic via a genetic algorithm
  publication-title: J. Oper. Res. Soc.
  doi: 10.1057/palgrave.jors.2602488
– volume: 37
  start-page: 2017
  year: 2010
  ident: ref_14
  article-title: Kernel search: A general heuristic for the multi-dimensional knapsack problem
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2010.02.002
– volume: 55
  start-page: 832
  year: 2020
  ident: ref_8
  article-title: A fast and scalable heuristic for the solution of large-scale capacitated vehicle routing problems
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.2021.1059
– volume: 217
  start-page: 54
  year: 2012
  ident: ref_18
  article-title: Kernel search: An application to the index tracking problem
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2011.09.004
– volume: 18
  start-page: 281
  year: 1967
  ident: ref_27
  article-title: Bases for vehicle fleet scheduling
  publication-title: Oper. Res. Q.
  doi: 10.1057/jors.1967.44
– ident: ref_17
  doi: 10.1016/j.cor.2021.105292
– volume: 40
  start-page: 2519
  year: 2013
  ident: ref_6
  article-title: A hybrid algorithm for a class of vehicle routing problems
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2013.01.013
– ident: ref_13
– volume: 12
  start-page: 568
  year: 1964
  ident: ref_26
  article-title: Scheduling of vehicles from a central depot to a number of delivery points
  publication-title: Oper. Res.
  doi: 10.1287/opre.12.4.568
– volume: 18
  start-page: 877
  year: 2012
  ident: ref_16
  article-title: Kernel search for the capacitated facility location problem
  publication-title: J. Heuristics
  doi: 10.1007/s10732-012-9212-8
– volume: 51
  start-page: 345
  year: 2012
  ident: ref_15
  article-title: Kernel search: A new heuristic framework for portfolio selection
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-010-9326-6
– ident: ref_20
– volume: 18
  start-page: 19
  year: 2016
  ident: ref_33
  article-title: New exact iterative method for the capacitated vehicle routing problem
  publication-title: Commun. Sci. Lett. Univ. Žilina
SSID ssj0000913810
Score 2.2563193
Snippet This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optimization problem due to its relevance to the field of...
SourceID doaj
proquest
crossref
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
StartPage 11421
SubjectTerms Algorithms
capacitated vehicle routing problem
Customers
Heuristic
kernel search
Linear programming
Literature reviews
Mathematical programming
matheuristics
mixed integer linear programming
Optimization
Variables
Vehicles
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS8MwFA4yPOhB3FScTslBQZFi0iZNctThEISxg8puJb-KwqiyTf9-X9JuVES8eG3TtHyvyfceee97CJ0ZyrTgRidAJSZhVvEEaIgn3hlimMyd1CQ2mxDjsZxO1aTV6ivkhNXywDVw11KIkhrmiDElg8c1o6WWecasC85OFNsmQrWCqbgHKxqkq-pM9wzi-nAeTIELQ-ko_cZBUar_x04c6WW0i3YavxDf1N_TRRu-6qHtllpgD3WbdbjAF41Y9OUeUg9-XvkZrtOGMbigGFw6PAQOtKF8zDv87F_CnDgk_8BEeFL3kNlHT6O7x-F90rRDSGyWi2VibCg7BZfFQBBmnLQlT4Vl2nGfWmKd5iYVObd5aQAhkjpNVckU0bk0EBbo7AB1qrfKHyIMN22qgK4d0Sx1TgGBeWZIaQDtLNN9dLUCqLCNVnhoWTErIGYIcBZtOPvofD36vdbI-GXcbcB6PSYoW8cLYO-isXfxl737aLCyVNEst0UBPpgCv5ByefQf7zhGW2mocoglhwPUWc4__AnatJ_L18X8NP5pX_2I1hs
  priority: 102
  providerName: Directory of Open Access Journals
Title Kernel Search for the Capacitated Vehicle Routing Problem
URI https://www.proquest.com/docview/2739423158
https://doaj.org/article/877f1b4d0bbf40b4a41fa8634cd08006
Volume 12
WOSCitedRecordID wos000887133800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: DOA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: M~E
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: BENPR
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: PIMPY
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3da9swED_Wpg_tw7Z-jGXLgh5WWCmmsi3b8lNpQspKWTBlLemT0Ze7QUhaJ9vfvztbyVLG9rJHW0JIOkm_O-nudwAfdShUlmgVIJToQJg8CRCGksBZzbWQqZWKN8kmsvFYTiZ54S_cFt6tcnUmNge1nRu6Iz9DmM0R-sNEnj8-BZQ1il5XfQqNLegQUxmu885gNC5u1rcsxHopQ956vMdo39O7cIiYSCGk4TMsaij7_ziRG5i5fPW_HXwNL72CyS7aFbEPL9zsAPY2aAcPYN9v6AX75FmnTw4hv3b1zE1Z63_MUJdlqBuyIYKpoTg0Z9md-0ZtMvIiwoZY0SajOYLby9HX4efA51UITJxmy0Abil9F3UejNaetNFUSZUYom7jIcGNVoqMsTUxa6UpJHlkV5pXIuUqlRvtCxW9gezafubfAsNBEOeK-5UpE1uaIhE5oXuksq-JYdeF0NcOl8aTjlPtiWqLxQfIoN-XRheN17ceWbOMv9QYkrHUdoshufszrh9LvuFJiD0ItLNe6EjhUJUIcTRoLY0lLTrvQW8mx9Pt2Uf4W4rt_F7-H3YgCIZqoxB5sL-sf7gPsmJ_L74u675dhv7Hw8au4-lLc_wLX4egv
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LTxRBEK7gYiIcFBDiIkofINGYiT09PTPdB2MUJWwWNntAg6exXwMkZBd3F4x_yt9o1TxWjNEbB67Tnc70VE19Vd1V9QHs2FiaPLUmQiixkXQ6jRCG0ih4y61UmVeGV2QT-WCgTk70cAF-trUwlFbZ2sTKUPuxozPy1wizGqE_TtXby28RsUbR7WpLoVGrRT_8-I4h2_RN7wPKd1eI_Y_HewdRwyoQuSTLZ5F1VL2JyG8xlrFeuTIVuZPGp0E47rxJrciz1GWlLY3iwptYl1JzkymL3rVJcN17sChJ2TuwOOwdDb_MT3Woy6aKeZ1hnySa0z10jBhMJavxH9hXUQT8hQAVrO0_umsfZAUeNg40e1dr_CoshNEaLN9oq7gGq43BmrIXTVftl49B98NkFC5YnV_N0Fdn6PuyPXQWHNXZBc8-hzNak1GWFC7EhjXZzjp8upUNbUBnNB6FJ8Bw0AmNfo3nRgrvNSJ9kJaXNs_LJDFdeNVKtHBNU3Xi9rgoMLgi-Rc35d-F3fnsy7qZyD_mvSflmM-hFuDVg_HktGgsSqHwDWIrPbe2lLhVI2PcTZZI5ykKyLqw1epN0dilafFbaTb_P7wNDw6Ojw6Lw96g_xSWBBV9VBWYW9CZTa7CM7jvrmfn08nz5hdg8PW2lewXNV9D_g
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB2VLUJwAFpALBTwgUogFNVxnMQ-IAQtK1YLqxwAlVPwV1qkarfsLiD-Gr-OmcRZihDceuAaW1YcP897jucD4KFNpSlzaxKkEptIp_MEaShPgrfcSlV4ZXhbbKKcTtXhoa424EcfC0Nulb1NbA21nzv6R76HNKuR-tNc7TXRLaI6GD07_ZxQBSm6ae3LaXQQmYTv3_D4tnw6PsC13hVi9PLt_qskVhhIXFaUq8Q6iuREFWDxXGO9ck0uSieNz4Nw3HmTW1EWuSsa2xjFhTepbqTmplAWlbbJcNwLsImSXIoBbFbjN9WH9R8eyripUt5522eZ5nQnnSIfU_hq-hsPtuUC_mCDluJG1_7nj3MdrkZhzZ53O2ELNsJsG66cSbe4DVvRkC3Zo5ht-_EN0JOwmIUT1vldM9TwDDUx20cR4Sj-Lnj2PhzTmIy8p3AgVnVFeG7Cu3OZ0C0YzOazcBsYNjqhUe94bqTwXqMCCNLyxpZlk2VmCE_61a1dTLZONT9Oajx0ERbqs1gYwu6692mXZOQv_V4QUNZ9KDV4-2C-OKqjpakVvkFqpefWNhKnamSKsyky6TydDooh7PQYqqO9Wta_AHTn380P4BIiq349nk7uwmVBsSBtYOYODFaLL-EeXHRfV5-Wi_txNzD4eN4Y-wnLcUy-
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Kernel+Search+for+the+Capacitated+Vehicle+Routing+Problem&rft.jtitle=Applied+sciences&rft.au=Bor%C4%8Dinov%C3%A1%2C+Zuzana&rft.date=2022-11-01&rft.issn=2076-3417&rft.eissn=2076-3417&rft.volume=12&rft.issue=22&rft.spage=11421&rft_id=info:doi/10.3390%2Fapp122211421&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_app122211421
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2076-3417&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2076-3417&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2076-3417&client=summon