Vehicle routing is a well-known optimization research topic with significant practical
importance. Among different approaches to solving vehicle routing, heuristics can produce a …

Abstract The Vehicle Routing Problem (VRP) was formally presented to the scientific
literature in 1959 by Dantzig and Ramser (DOI: 10.1287/mnsc. 6.1. 80). Sixty years on, the …

This work proposes a partial optimization metaheuristic under special intensification
conditions (POPMUSIC) for the classical capacitated vehicle routing problem. The proposed …

In this paper, we consider that a private company has developed a platform to provide
intercity ride-sharing (IRS) services for riders between two cities. The riders between the two …

The optimization community has made significant progress in solving vehicle routing
problems (VRPs) to optimality using sophisticated branch-cut-and-price (BCP) algorithms …

The capacitated vehicle routing problem (CVRP) is an NP-hard combinatorial optimization
problem that plays a significant role in end distribution in smart logistics. The CVRP solution …

In this paper, we address a classical MCVRP variant characterized by a single vehicle type
that has one exclusive compartment for each product type, fixed compartment sizes, limited …

Containers and packages contribute to about 28% of more than 292 million tons of
municipalsolid waste. Although a shift from single-use to reuse models seems inevitable for …

The paper discusses two variants of the Capacitated Vehicle Routing Problem (CVRP), in
which each customer to be visited can require both pickup and delivery, or only either pickup …

In the context of the Vehicle Routing Problem with Backhauls, which involves delivering to
linehaul and picking up from backhaul customers, we propose a novel mathematical model …