In this paper, we develop an extended guided tabu search (EGTS) and a new heuristic packing algorithm for the two-dimensional loading vehicle routing problem (2L-CVRP). The 2L-CVRP is a combination of two well-known NP-hard problems, the capacitated vehicle routing problem, and the two-dimensional bin packing problem. It is very difficult to get a good performance solution in practice for these...

The Vehicle Routing Problem (VRP) is a hard combinatorial problem with numerous industrial applications. Among the large number of extensions to the canonical VRP, we study the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of the same capacity. A cellular Genetic Algorithm (cGA)—a kind of decentralized population based heuristic—is used for solving CVRP, improving seve...

This paper provides a review of the recent developments that had a major impact on the current state-ofthe-art exact algorithms for the vehicle routing problem (VRP). The paper reviews mathematical formulations, relaxations and recent exact methods for two of the most important variants of the VRP: the capacitated VRP (CVRP) and the VRP with time windows (VRPTW). The paper also reports a compar...

In the paper we examine a modification of the classical Vehicle Routing Problem (VRP) in which three-dimensional shapes of transported cargo are accounted for. This approach, in contrast to the standard capacitated VRP (CVRP) formulation, is appropriate when transported commodities are not perfectly divisible, but have fixed and heterogeneous dimensions. However, nesting a version of a threedim...

This paper presents a discussion arisen after reading ”A hybrid genetic algorithm that optimizes capacitated vehicle routing problem”, by Chung-Ho Wang and Jiu-Zhang Lu, (2009). Expert System with Applications (35)(pp. 2921-2936). The discussed paper presents a hybrid genetic algorithm applied to the Capacitated Vehicle Routing Problem (CVRP). When the authors present the results obtained by th...

Capacitated Vehicle Routing Problem (CVRP) is a type of NP-Hard combinatorial problem that requires high computational process. In the case CVRP, there an additional constraint in form capacity limit owned by vehicle, so complexity from CVRP to find optimum route pattern for minimizing travel costs which are also adjusted customer demand and vehicle distribution. One method solving can be done ...

This work presents a multistart algorithm for solving the capacitated vehicle routing problem with 2D loading constraints (2L-CVRP) allowing rotation of goods. Research dedicated to graph theory and symmetry considered as classical application. has complex aspects that stimulate use advanced algorithms in graphs. The modeling 2L-CVRP by undirected allowed high performance algorithm. developed i...

The purpose of this work is to present a developed three-axes rotation algorithm improve the solving methodology for relaxed 3L-CVRP (Three-Dimensional Capacitated Vehicle Routing Problem). Although there are reported works on approaches that consider product optimize load capacity, three axes has not been thoroughly studied. In aspect, explicitly explores and its impact capacity optimization. ...

The capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints is an extension of the classical Capacitated Vehicle Routing Problem (CVRP). It integrates loading constraints in a routing problem and is based on a real-world transportation problem. The demand of the customers consists of pallets. These pallets may be placed in two horizontal rows inside th...

Metaheuristics are widely employed to solve hard optimization problems, like vehicle routing problems (VRP), for which exact solution methods impractical. In particular, local search-based metaheuristics have been successfully applied the capacitated VRP (CVRP). The CVRP aims at defining minimum-cost delivery routes a given set of identical vehicles since each only travels one route and there i...