The tobacco distribution in China is organized by the tobacco company in the unit of city. The distribution cycle is commonly a week with five fixed distribution districts started from the center depot, and the routes in each district are fixed for the vehicles and drivers. This method with low efficiency and high cost has continued for several decades because of the poor technology and economi...

Vehicle routing problem with time windows (VRPTW) involves the routing of a set of vehicles with limited capacity from a central depot to a set of customers with known demands and predefined time windows. Routes for the vehicles must meet all given constraints as well as minimize the objectives of travel distance and vehicles numbers. We proposed hybrid multiobjective evolutionary algorithm (HM...

Commuter bus systems plays a crucial role in the working of a city, especially for the non-metropolitan towns, where it is the primary mode of transport. For efficient planning, management and utilization of a citys transport system, a well-organized and structured database is necessary. While different cities follow different conventions to store and manage data, it is not clear if this repres...

The PVRPTW is defined on a complete directed graph G = (V,A), where V = {0, 1, . . . , n} is the vertex set and A = {(i, j) : i, j ∈ V, i 6= j} is the arc set. The considered planning horizon shall be t days, also referred to as T = {1, . . . , t}. Vertex 0 represents the depot with time window [e0, l0] at which are based m vehicles having capacities Q1, . . . , Qm and maximal daily working tim...

We consider the post-disaster road clearing problem with the goal of restoring network connectivity in shortest time. Given a set of blocked edges in the road network, teams positioned at depot nodes are dispatched to open a subset of them that reconnects the network. After a team finishes working on an edge, others can traverse it. The problem is to find coordinated routes for the teams. We ge...

The vehicle routing problem (VRP) aims to find a set of routes of minimum total length to serve the demand of a set of customers using a fleet of capacitated vehicles based at a central depot [6]. In this work we present a new extension of the VRP, the single truck and trailer routing problem with satellite depots (STTRPSD). To solve the STTRPSD we developed a hybrid metaheuristic based on gree...

The aims of this retrospective study were to evaluate the efficacy of different steroid formulations (depot vs oral) and if the continuous administration of steroids throughout and beyond a CHOP protocol might improve the survival time and rate of cats with mediastinal lymphoma. The medical records of client-owned cats diagnosed with mediastinal lymphoma were reviewed at two veterinary referral...

The synthetic polypeptide depot-tetracosactrin (Synacthen-Depot) was given to nine steroid-treated asthmatic patients hypersensitive to animal corticotrophin. Eight had a satisfactory increase in plasma and urinary 17-hydroxycorticosteroids (17-OHCS). The remaining patient had been shown previously to have adrenal suppression. None of the patients developed allergic reactions to depot-tetracosa...

This paper presents a method for solving multi-depot vehicle routing problem (MDVRP). First, a virtual central depot is added to transfer MDVRP to the multi-depot vehicle routing problem with the virtual central depot (V-MDVRP), which is similar to a vehicle routing problem (VRP) with the virtual central depot as the origin. An improved ant colony optimization with coarse-grain parallel strateg...

This article presents a mathematical model of the risk failures, depending on operating parameters, locomotive diesel engines. The purpose this study is to determine failures engines in maintenance. theory probability and logic reliability are used theoretical study. innovations main works first approaches calculating by hourly fuel consumption, which, under operational conditions, allows for e...