The split delivery vehicle routing problem is a variant of the well-known vehicle routing
problem, where each customer can be visited by several vehicles. The problem has many …

The Vehicle Routing Problem (VRP) is a well-known NP-hard combinatorial optimization
problem, which has wide spread applications in real world, such as logistics, bus route …

Vehicle routing problems (VRPs) are essential in logistics. In the literature, many exact and
heuristic optimization algorithms have been proposed to solve the VRPs. These traditional …

In this study, we investigate a forest-based solution representation for split delivery vehicle
routing problems (SDVRPs), which have several practical applications and are among the …

Motivated by practical applications such as the water sprinkling services of urban
administration bureaus in big cities, we study a split-delivery mixed capacitated arc-routing …

Two fundamental challenges in local search based metaheuristics are how to determine
parameter configurations and design the underlying Local Search (LS) procedure. In this …

In graph theory, the problem of finding minimum vertex separator (MVS) is a classic NP-hard
problem, and it plays a key role in a number of important applications in practice. The real …

Combinatorial auction, which allows bidders to bid on combinations of items, is an important
type of market mechanism. The winner determination problem (WDP) has extensive …

Abstract The Capacitated Location Routing Problem is an important planning and routing
problem in logistics, which generalizes the capacitated vehicle routing problem and the …

For the split delivery vehicle routing problem in the distribution link of logistics where the
optimization objective is to minimize the total distance of the transportation path, a hybrid …