Authors: Anokić, Ana
Stanimirović, Zorica
Stakić, Đorđe
Davidović, Tatjana 
Title: Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation
Journal: Operational Research
Volume: 21
First page: 2021
Last page: 2053
Issue Date: 1-Jan-2019
Rank: M22
ISSN: 1109-2858
DOI: 10.1007/s12351-019-00495-z
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.
Keywords: Greedy Randomized Adaptive Search Procedure | Mixed integer linear programming | Optimization in transport | Variable neighborhood search | Vehicle scheduling problem
Publisher: Springer Link
Project: Graph theory and mathematical programming with applications in chemistry and computer science 
Mathematical Modelas and Optimization Methods on Large-Scale Systems 

Show full item record


checked on Jul 14, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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