A Modified Column Generation to Solve the Heterogeneous Fixed Fleet Open Vehicle Routing Problem

In the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), several different types of vehicles can be used to service the customers. The types of vehicles are different in terms of capacity, fixed cost, and variable cost. In this problem, the vehicles are not required to return to the...

Full description

Saved in:
Bibliographic Details
Published in:Journal of engineering (Cairo, Egypt) Egypt), 2016-01, Vol.2016 (2016), p.1-12
Main Authors: Rahmati, Farhad, Didehvar, Farzad, Dolatnejad, Azam, Yousefikhoshbakht, Majid
Format: Article
Language:English
Subjects:
Acceptability
Algorithms
Computation
Customers
Inserts
Mathematical models
Route selection
Vehicles
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), several different types of vehicles can be used to service the customers. The types of vehicles are different in terms of capacity, fixed cost, and variable cost. In this problem, the vehicles are not required to return to the depot after completing a service and the number of vehicles of each type is fixed and limited. Since this problem belongs to NP-hard problems, in this paper a compound heuristic algorithm called SISEC which includes sweep algorithm, insert, swap, and 2-opt moves, modified elite ant system (EAS), and column generation (CG) is applied to solve the HFFOVRP. We report computational results on 22 problems and solve each problem by using our SISEC. The results which were compared to the results of exact algorithms and the classic CG confirm that the proposed algorithm produces high quality solutions within an acceptable computation time.
ISSN:2314-4904
2314-4912
2314-4912
DOI:10.1155/2016/5692792