o:29591 Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation en Abstract: A 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. The authors also state that the research conducted in this paper was partially supported by Serbian Ministry of Education, Science and Technological Development under the Grants Nos. 174010 and 174033. Keywords: Optimization in transport, Vehicle scheduling problem, Mixed integer linear programming, Variable neighborhood search, Greedy Randomized Adaptive Search Procedure 1552099 10.1007/s12351-019-00495-z 1552101 1109-2858 2023-05-18T10:59:45.009Z 44 no 46 Ana Anokić 0000-0002-9159-3491 Zorica Stanimirović Univerzitet u Beogradu Matematički fakultet person 0000-0001-5658-4111 Đorđe Stakić Univerzitet u Beogradu Ekonomski fakultet person 27797863 0000-0002-3241-4289 Tatjana Davidović person 0000-0001-9561-5339 application/pdf 2971462 https://phaidrabg.bg.ac.rs/o:29591 no yes 1 70 1552253 11A03 Operational research 21 3 2021 2053 2021