DC FieldValueLanguage
dc.contributor.authorAnokić, Anaen
dc.contributor.authorStanimirović, Zoricaen
dc.contributor.authorStakić, Đorđeen
dc.contributor.authorDavidović, Tatjanaen
dc.date.accessioned2020-04-03T08:16:00Z-
dc.date.available2020-04-03T08:16:00Z-
dc.date.issued2019-01-01en
dc.identifier.issn1109-2858en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/243-
dc.description.abstractA variant of vehicle scheduling problem (VSP) arising from the sugar beet transportation in a sugar factory in Serbia is introduced. The objective of the considered VSP is to minimize the required transportation time under problem-specific constraints. The problem is formulated as a mixed integer linear program (MILP). Within the framework of commercial CPLEX solver the proposed MILP model was able to produce optimal solutions for small size problem instances. Therefore, two metaheuristic methods, variable neighborhood search (VNS) and greedy randomized adaptive search procedure (GRASP), are designed to solve problem instances of larger dimensions. The proposed GRASP and VNS are evaluated and compared against CPLEX and each other on the set of real-life and generated problem instances. Computational results show that VNS is superior method with respect to the solution quality, while GRASP is able to find high quality solutions within very short running times.en
dc.publisherSpringer Link-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relationMathematical Modelas and Optimization Methods on Large-Scale Systems-
dc.relation.ispartofOperational Researchen
dc.subjectGreedy Randomized Adaptive Search Procedure | Mixed integer linear programming | Optimization in transport | Variable neighborhood search | Vehicle scheduling problemen
dc.titleMetaheuristic approaches to a vehicle scheduling problem in sugar beet transportationen
dc.typeArticleen
dc.identifier.doi10.1007/s12351-019-00495-zen
dc.identifier.scopus2-s2.0-85081239424en
dc.relation.grantno174033-
dc.relation.grantno174010-
dc.description.rankM22-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-9561-5339-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.fundingProgramDirectorate for Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103-
Show simple item record

SCOPUSTM   
Citations

4
checked on Jan 29, 2023

Page view(s)

48
checked on Jan 30, 2023

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.