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

Abstract

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.

Urban Courier Delivery in a Smart City: The User Learning Process of Travel Costs Enhanced by Emerging Technologies

“…Consequently, e-ICTs became essential for creating sophisticated courier assistance advisors coupled with delivery bay systems [16,50]. It should be noted that after the use of an advanced learning process, the choice updating model can be used to point out the dynamics of the user's choice, upgrading the classical model representing choice behavior into a sequential one [51,52].…”

Routing optimization method of waste transportation vehicle using biological evolutionary algorithm under the perspective of low carbon and environmental protection

“…The community waste collection routing problem belongs to the category of VRP problem, which is similar to Capacitated VRP (CVRP) [20,21]. Compared with the CVRP model, the biggest difference in the mathematical model of this paper is that each waste vehicle must drive to the transfer station (treatment plant) to unload waste before returning to the depot, and then return from the transfer station (treatment plant) to depot.…”

Workload Equity in Multi-Period Vehicle Routing Problems

“…In addition, they considered two additional criteria within a multi-objective framework. Since that work, numerous papers have considered workload balance objectives in single-period VRPs with different equity measures (see, e.g., Golden et al 1997;Lee and Ueng 1999;Jozefowiez et al 2009;Lopez et al 2014;Oyola and Løkketangen 2014;Bertazzi et al 2015;Galindres Guancha et al 2018;Va et al 2018;Vega-Mejia et al 2019;Zhang et al 2019;Lehuédé et al 2020;Londono et al 2021). The Min-Max measure and the difference between the maximum and minimum workloads (called Range by Matl et al 2018) are most commonly used.…”