Municipal waste management has become a challenging issue with the rise in urban populations and changes people’s habits, particularly developing countries. Moreover, government policy plays an important role associated municipal management. Thus, this research proposes regional location routing problem (RLRP) model multi-depot (MRLRP) model, which are extensions of (LRP), to provide better col...

Logistics and supply-chain management may generate notable operational cost savings with increased reliance on shared serving of customer demands by multiple agents. However, traditional logistics planning exhibits an intrinsic limitation in modeling and implementing shared commodity delivery from multiple depots using multiple agents. In this paper, we investigate a centralized model and a heu...

We introduce the multimodal car- and ride-sharing problem (MMCRP), in which a pool of cars is used to cover set ride requests while uncovered are assigned other modes transport (MOT). A car’s route consists one or more trips. Each trip must have specific but non-predetermined driver, start depot finish (possibly different) depot. Ride-sharing between users allowed, even when two rides do not sa...

The single-vehicle cyclic inventory routing problem (SV-CIRP) is concerned with a repeated distribution of a product from a single depot to a selected subset of retailers having stable demands. The objective is to determine the subset of retailers to cyclically replenish, the quantities to be delivered to each, and to design the vehicle routes so that the expected total distribution and invento...

We study the Multi-Depot Multiple Traveling Salesman Problem (MDMTSP), which is a variant of the very well-known Traveling Salesman Problem (TSP). In the MDMTSP an unlimited number of salesmen have to visit a set of customers using routes that can be based on a subset of available depots. The MDMTSP is an NPhard problem because it includes the TSP as a particular case when there is only one dep...

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...

This research present a set-partitioning heuristic to generate populations in a hybrid genetic algorithm (hGA) which is able to solve four different variants of the vehicle routing problem: the multi-depot vehicle routing problem (MDVRP), the heterogeneous fleet and mix decisions (type, size and number of vehicle) (HFMVRP), site dependent vehicle routing problem (SDVRP) and the asymmetric vehic...

The shunting schedule of electric multiple units depot (SSED) is one of the essential plans for high-speed train maintenance activities. This paper presents a 0-1 programming model to address the problem of determining an optimal SSED through automatic computing. The objective of the model is to minimize the number of shunting movements and the constraints include track occupation conflicts, sh...

one of the important issues in transportation and logistics systems is vehicle routing problem (vrp). the vehicle routing problem is concerned with finding efficient routes of minimum total cost, beginning and ending at a central depot, for a fleet of vehicles to serve a number of customers. on the other hand, as a result of the increasing environmental concerns, economic problems and pressure ...

in this paper, a stochastic multi-depot multi-objective vehicle routing problem (vrp) is studied. based on observations in real-world problems, we develop an aspect of the problem, such as stochastic availability of routes. to solve the problem in this situation, a two-objective mathematical model is developed, in which the related objective functions are: (1) minimizing transportation costs an...