In this paper, we present a state-of-the-art survey on the vehicle routing problem with
multiple depots (MDVRP). Our review considered papers published between 1988 and …

Over the past two decades, equity aspects have been considered in a growing number of
models and methods for vehicle routing problems (VRPs). Equity concerns most often relate …

The minmax multiple traveling salesman problem with single depot (the minmax mTSP) or
multiple depots (the minmax multidepot mTSP) aims to minimize the longest tour among a …

Abstract The Multi-Depot Vehicle Routing Problem (MDVRP) involves minimizing the total
distance traveled by vehicles originating from multiple depots so that the vehicles together …

Context Vehicle routing problem (VRP) is one of the many difficult issues that have no
perfect solutions yet. Many researchers over the last few decades have established …

Multi-agent exploration of a bounded 3D environment with the unknown initial poses of
agents is a challenging problem. It requires both quickly exploring the environments and …

Distribution of finished goods from depots to predetermined customers and collection of
goods and wastes are practical and challengeable optimization and logistics problems; …

While industry tends towards mass personalisation and instant deliveries, the last mile of
urban logistics is being challenged to decrease the number of vehicles in circulation and the …

A widely applied strategy for workload sharing is to equalize the workload assigned to each
resource. In mobile multiagent systems, this principle directly leads to equitable partitioning …

The min-max vehicle routing problem (min-max VRP) traverses all given customers by
assigning several routes and aims to minimize the length of the longest route. Recently …