Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation

被引：6

作者：

Anokic, Ana

Stanimirovic, Zorica ^{[1
]}

Stakic, Dorde ^{[2
]}

Davidovic, Tatjana ^{[3
]}

机构：

[1] Univ Belgrade, Fac Math, Studentski Trg 16-4, Belgrade 11000, Serbia

[2] Univ Belgrade, Fac Econ, Kamenicka 6, Belgrade 11000, Serbia

[3] Serbian Acad Arts & Sci, Math Inst, Kneza Mihaila 36, Belgrade 11000, Serbia

来源：

OPERATIONAL RESEARCH | 2021年 / 21卷 / 03期

关键词：

Optimization in transport; Vehicle scheduling problem; Mixed integer linear programming; Variable neighborhood search; Greedy Randomized Adaptive Search Procedure; VARIABLE NEIGHBORHOOD SEARCH; ROUTING PROBLEM; GRASP;

D O I：

10.1007/s12351-019-00495-z

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：2021 / 2053

页数：33

共 32 条

[1] Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation [J].