Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows

Khebbache-Hadji, Selma; Prins, Christian; Yalaoui, Alice; Reghioui, Mohamed

doi:10.1007/s10100-011-0204-9

Cited by 46 publications

(25 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Commonly used methods include the bottom-left-fill heuristic (e.g., Iori et al 2007;Zachariadis et al 2009;Fuellerer et al 2009), maximum touching perimeter (e.g., Zachariadis et al 2009;Strodl et al 2010;Khebbache-Hadji et al 2013), lower bounds (e.g., Iori et al 2007;Gendreau et al 2006;Fuellerer et al 2009) and branch-and-bound (e.g., Iori et al 2007;Gendreau et al 2006;Fuellerer et al 2009;Strodl et al 2010). If a combination of heuristic and exact algorithms is used, first the heuristics are applied, and when they do not find a feasible solution, the exact method is used to solve the packing problem.…”

Section: Two-dimensional Loading Cvrpmentioning

confidence: 99%

See 1 more Smart Citation

Vehicle routing problems with loading constraints: state-of-the-art and future directions

et al. 2014

View full text Add to dashboard Cite

Distributors are faced with loading constraints in their route planning, e.g.,multi-dimensional packing constraints, unloading sequence constraints, stability constraints and axle weight limits. Ignoring these constraints impairs planning and induces last-minute changes resulting in additional costs. Developing vehicle routing models incorporating loading constraints is critical to more efficient route planning. The last couple of years has seen a huge increase of contributions to this field of research with almost 60 % of these being published after 2009. Our contribution is twofold. First, we overview the recent developments in the literature on all vehicle types in which loading constraints play a key role (trucks, airplanes, ships, and automated guided vehicles), using a state-of-the-art classification scheme to identify the loading constraints considered in each article. Second, we identify research gaps and opportunities for future research.

show abstract

Section: Two-dimensional Loading Cvrpmentioning

confidence: 99%

“…three papers consider time windows(Attanasio et al 2007;Khebbache-Hadji et al 2013;Martinez and Amaya 2013). A mathematical formulation for a 2L-CVRP is presented byMartinez and Amaya (2013);Dominguez et al (2014) andPollaris et al (2014) Iori et al (2007).…”

mentioning

confidence: 99%

Vehicle routing problems with loading constraints: state-of-the-art and future directions

et al. 2014

View full text Add to dashboard Cite

show abstract

“…Similarly, Khebbache‐Hadji et al. () also presented an MIP for a 2D VRPLC with the same considerations as the study of Schmid et al. ().…”

Section: Introductionmentioning

confidence: 91%

A nonlinear optimization model for the balanced vehicle routing problem with loading constraints

Vega-Mejía

Montoya‐Torres

Islam

2018

Int Trans Operational Res

View full text Add to dashboard Cite

The vehicle routing problem with loading constraints (VRPLC) is related to real‐life transportation problems and integrates two of the most important activities in distribution logistics: packing of items inside vehicles and planning of delivery routes. In spite of its relevance, literature on VRPLCs is still limited. The majority of the solution approaches have concentrated on heuristic solution methods, and few have presented mathematical optimization models to help characterize the problem. Furthermore, few studies have considered several practical loading and routing constraints that could be used to approximate the problem toward more realistic situations. To help fill this gap in the literature, this article extends an existing VRPLC optimization model to a nonlinear optimization model that considers weight‐bearing strength of three‐dimensional items, vehicle weight capacity, weight distribution inside vehicles, delivery time windows, and a balanced fleet of vehicles. The model is solved by applying a simple procedure that isolates the nonlinearity of the model. Computational experiments show that the new proposed model gives a more streamlined formulation than the model it extended on, and that the addition of practical loading constraints can improve the solutions of the original model by reducing the measure of tardiness due to late deliveries and by producing cargo patterns with better weight distribution.

show abstract

“…Leung et al (2013) assessed the VRP with heterogeneous fleet, combined the simulated annealing algorithm with local search heuristic to solve the routing problem and used a variety of heuristic methods to address the loading constraints. Khebbache-Hadji et al (2013) proposed the 2L-CVRP with time windows and then presented a meta-heuristic solution approach for this problem which is a combination of memetic algorithm and some loading heuristics. Dominguez et al (2016) also assessed the VRP with heterogeneous fleet and proposed a heuristic approach to solve it in the scenarios where item rotation is/is not allowed.…”

Section: Review Of the Literaturementioning

confidence: 99%

A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem

Alinaghian

Zamanlou

Sabbagh

2017

Journal of the Operational Research Society

View full text Add to dashboard Cite

This paper introduces two-dimensional loading time-dependent vehicle routing problem and proposes a biobjective mathematical model. This problem assesses the process of distributing the rectangular-shaped demanded items over an urban environment; it does not, however, allow items to be loaded on top of each other. In addition to the above assumptions, the presented model also satisfies the first-in-first-out property in the timedependent vehicle routing problem. Given the NP-hard nature of the problem, a method called elitist nondominated sorting local search is developed to obtain its solutions. To evaluate the performance of the proposed algorithm, the solutions of this algorithm for small-scale problem instances are compared with the results of an exact method. For the medium-scale problem instances, results of NSGA-II and SPEA2 are used as the basis of comparison. The computational results demonstrate the good performance of the proposed method.

show abstract

Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows

Cited by 46 publications

References 34 publications

Vehicle routing problems with loading constraints: state-of-the-art and future directions

Vehicle routing problems with loading constraints: state-of-the-art and future directions

A nonlinear optimization model for the balanced vehicle routing problem with loading constraints

A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem

Contact Info

Product

Resources

About