The Vehicle Routing Problem (VRP) is a well studied logistical problem along with its various variants such as VRP customer Time-Window (VRPTW). However, all the previously assume that vehicles are mostly same in terms of their capacity, location and home (depot). This study uses agent-based approach for solving VRPTW vehicle’s unique depot. to minimise number used main target. Other targets in...

The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of the Single-Depot Vehicle Routing Problem (SDVRP) in which vehicle(s) start from multiple depots and return to their depots of origin at the end of their assigned tours. The traditional objective in MDVRP is to minimize the sum of all tour lengths, and existing literature handles this problem with a variety of assumptions and...

This contribution gives an introduction to an integrated vehicle routing and resource allocation problem. We refer to it as the Swap Trailer Problem and formulate the mathematical model. After the analysis of dynamic decision problems and the development of a framework for this problem, we highlight the dynamic aspect of the problem. Two different solution strategies are supposed. Special prope...

Given the emergence of two-echelon distribution systems in several practical contexts, this paper tackles, at strategic level, a network design problem under uncertainty. This is defined as stochastic multi-period capacitated location-routing (2E-SM-CLRP). It considers partitioned into two echelons: each echelon involves specific location-assignment-transportation schema that must cope with fut...

We address in this paper the pickup and delivery multi-depot vehicle routing problem (PDMDVRP). In this problem, a single commodity type is collected from a set of pickup customers to be delivered to a set of delivery customers by vehicles dispatched from multiple depots. The proposed problem has many applications in practice such as distribution of money between the branches of a bank, and mov...

Inspired by a real-life case in the Brussels Capital Region, Belgium, this paper provides Memetic Algorithm with Sequential Split procedure (MASS) for solving large variety of waste collection problems multiple depots, restricted vehicle fleet at each depot, (intermediate) processing facilities, capacity restrictions per facility and partial pick-ups. MASS first generates satisfactory initial s...

Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...