The rapid advancements in information technologies and globalization change the way of distributing goods to customers. Many enterprises have multiple factories, warehouses, distribution centers strive for competitive efficiency operations minimize transportation costs. This study proposed mixed-integer programming (MIP) model multi-depot split-delivery vehicle routing problems (MDSDVRPs) with ...

This paper focuses on a modified Multi-Depot Unmanned Aerial Vehicle Routing Problem (MMDUAVRP). Comparing to classic multi-depot vehicle routing problem, our studied problem has no constraints restrict the depot where (UAV) departs and returns. work aims minimize number of UAVs total distance traveled by all UAVs. is mathematically formulated in this heuristic-assignment based hybrid large nei...

In this research discusses the problem of distributing goods from a depot to several customer locations minimize travel costs. The is solved by using Vehicle Routing Problem method. data used in secondary with 10 customers and one depot. aim form model that has been obtained determine optimal route based on formed. first step objective function problem, then constraints may occur. After formed,...

The vehicle routing with pickups and deliveries (VRPD) problem is de6ned over a graph G=(V; E). Some vertices in G represent delivery customers who expect deliveries from a depot, and other vertices in G represent pickup customers who have available supply to be picked up and transported to a depot. The objective is to 6nd a minimum length tour for a capacitated vehicle, which starts at a depot...

• A bi-objective multi-depot electric transit vehicle scheduling problem. Time-of-use electricity tariffs and peak load risk for power grids are explicitly considered. lexicographic method to reformulate the optimization model achieve win-win situations. tailored branch-and-price algorithm that embeds heuristics a trip chain pool strategy. Higher solution quality computation efficiency compared...

this paper addresses the vehicle routing problem with delivery time cost. this problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. in this research, a hybrid metaheuristic approa...

Long-acting depot antipsychotics were developed specifically to promote treatment adherence (compliance) and they are a valuable option for patients requiring maintenance medication for schizophrenia. Depot use has fallen in recent years, perhaps owing to the introduction of oral atypical antipsychotics. Psychiatrist and patient acceptance of depot medication is variable. The depot formulation ...

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...