Abstract | ||
---|---|---|
In this paper, we explore a set of new heuristic strategies integrated within the column generation algorithm to solve the Capacitated Vehicle Routing Problem with 2-Dimensional Loading constraints. These heuristics rely on constructive procedures that iteratively build a solution using the solutions of a mixed integer linear programming model. The pricing subproblem is also heuristically solved, using strategies relying on variable neighborhood search algorithms proposed in literature. Column generation approaches for the 2L-CVRP are not quite explored. This paper aims to contribute with new strategies to tackle this problem. All the approaches were implemented and an exhaustive computational study is performed. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1016/j.endm.2018.01.015 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
vehicle routing problem,column generation,heuristics | Discrete mathematics,Column generation,Heuristic,Vehicle routing problem,Mathematical optimization,Variable neighborhood search,Constructive,Integer linear programming model,Heuristics,Mathematics | Journal |
Volume | ISSN | Citations |
64 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Telmo Pinto | 1 | 19 | 2.51 |
Cláudio Alves | 2 | 184 | 16.29 |
José M. Valério De Carvalho | 3 | 168 | 14.06 |