.png){kind=icon}
.png){kind=icon}
Return
Integrated distribution and loading planning via a compact metaheuristic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2013.01.040.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The present article examines a vehicle routing problem integrated with two-dimensional loading constraints, called 2L-CVRP. The problem is aimed at generating the optimal route set for satisfying customer demand. In addition, feasible loading arrangements have to be determined for the transported products. To solve 2L-CVRP, we propose a metaheuristic solution approach. The basic advantage of our approach lies at its compact structure, as in total, only two parameters affect the algorithmic performance. To optimize the routing aspects, we propose a local-search method equipped with an effective diversification component based on the regional aspiration criteria. The problem's loading requirements are tackled by employing a two-dimensional packing heuristic which repetitively attempts to develop feasible loading patterns. These attempts are effectively coordinated via an innovative, simple-structured memory mechanism. The overall solution framework makes use of several memory components for drastically reducing the computational effort required. The performance of our metaheuristic development has been successfully evaluated on benchmark instances considering two distinct versions of the loading constraints. More specifically, the algorithm managed to improve or match the majority of best known solution scores for both problem versions. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Logistics
Loading constraints
Combinatorial optimization
Metaheuristics
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W