Browse
Submit Data
Databases
API
Help

Dataset Information

25 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Vehicle routing for a mid-day meal delivery distribution system.

ABSTRACT: This paper considers the distribution system of a school feeding program (mid-day meals), wherein a set of delivery vehicles transfer cooked food from a kitchen facility to various schools within a specified delivery deadline. The food is required to be delivered before the lunch period, which is consistent across all the schools. A delay in food delivery can deprive students of their lunch, and, therefore, designing the vehicle routes for such distribution systems and maintaining a strict delivery deadline becomes critical. The resultant problem is identified as a vehicle routing problem with a common due date (VRPCDD). We provide a formulation for the VRPCDD and thereby focus on suggesting solution methods. In addition, we also demonstrate the practical application of VRPCDD by focusing on a real-life problem of a mid-day meal provider operating in the Chhattisgarh province of India.

SUBMITTER: Gajpal Y

PROVIDER: S-EPMC6356091 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Delivery routing problem of pure electric vehicle with multi-objective pick-up and delivery integration.

Project description:With the growth of people's environmental awareness and the encouragement of government policies, the use of electric vehicles in logistics distribution is gradually increasing. In order to solve the dual demand of customers' simultaneous pick-up and delivery in the "last kilometer logistics", an electric vehicle routing problem with simultaneous pick-up and delivery and time window (EVRPSPDTW) is considered from the perspective of multi-objective distribution in this paper. Firstly, a decision-making model based on distribution cost and power consumption function is established. In this model, distribution cost includes transportation cost, vehicle use cost, penalty cost of not arriving on time and charging cost. Power consumption function is the energy loss caused by air resistance, tire rolling friction and transmission system. Secondly, a multi-objective genetic algorithm (NSGA-II) optimization solution with fast nondominated ranking and elite strategy is designed, and in view of the shortcomings of traditional NSGA-II, it is proposed to complete population initialization through greedy algorithm and random rules, introduce adaptive cross-mutation strategy in the chromosome crossing and mutation stage, and design three different neighborhood operators in mutation operation based on variant fitness function. Finally, the sensitivity analysis of traffic congestion coefficient further proves the effectiveness of the proposed model and the improved algorithm.

| S-EPMC9916606 | biostudies-literature

Optimization of "vehicle-UAV" joint distribution routing for cold chain logistics considering risk of epidemic spreading and green cost.

Project description:To address the epidemic, such as COVID-19, the government may implement the home quarantine policy for the infected residents. The logistics company is required to control the risk of epidemic spreading while delivering goods to residents. In this case, the logistics company often uses vehicles and unmanned aerial vehicles (UAVs) for delivery. This paper studies the distribution issue of cold chain logistics by integrating UAV logistics with epidemic risk management innovatively. At first, a "vehicle-UAV" joint distribution mode including vehicles, small UAVs and large UAVs, is proposed. The green cost for vehicles and UAVs is calculated, respectively. The formula for infection risk due to large numbers of residents gathering at distribution centers to pick up goods is then derived. Furthermore, based on the control of infection risk, an optimization model is developed to minimize the total logistics cost. A modified ant colony algorithm is designed to solve the model. The numerical results show that the maximum acceptable risk and the crowd management level of distribution centers both have significant effects on the distribution network, logistics cost and number of new infections. Our study provides a new management method and technical idea for ensuring the needs of residents during the epidemic.

| S-EPMC11207173 | biostudies-literature

Benchmark dataset for multi depot vehicle routing problem with road capacity and damage road consideration for humanitarian operation in critical supply delivery.

Project description:The dataset for Multi Depot Dynamic Vehicle Routing Problem with Stochastic Road Capacity (MDDVRPSRC) is presented in this paper. The data consist of 10 independent designs of evolving road networks ranging from 14-49 nodes. Together with the road networks are the Damage file (DF) for each corresponding road network. The DF simulates the damage level of roads within the networks due to a disaster source, thus affecting travel time and road capacity. We applied this data to test our proposed algorithm and validate our proposed model. This dataset served as an addition to the Vehicle Routing Problem (VRP) datasets that specifically addressed the road capacity problem during a disaster from an epicentre and could be used for other applications that constitute chaotic events and compromised road networks.

| S-EPMC8844765 | biostudies-literature

The Mobile Charging Vehicle Routing Problem with Time Windows and Recharging Services.

Project description:For the environmental friendliness of the technology on battery electric vehicles, there is growing attention on it. However, the market share of battery electric vehicles remains low due to the range anxiety. As a remedy, the mobile charging services could offer charging service at any time or locations requested. For profitability of the services, the operator should route the charging vehicles in a more efficient manner. For this consideration, we formulate the mobile charging vehicle routing problem as a mixed integer linear program based on the classical vehicle routing problem with time windows. To demonstrate the model, test instances are designed and computational results are presented. In order to examine the change of the number of mobile charging vehicles and travel distance, sensitivity analyses, such as battery capacity and recharging rate, are performed. The results show that larger battery capacity, quicker charging rate, or higher service efficiency could decrease the number of mobile charging vehicles and total traveled distances, respectively.

| S-EPMC6196982 | biostudies-literature

Improved artificial bee colony algorithm for vehicle routing problem with time windows.

Project description:This paper investigates a well-known complex combinatorial problem known as the vehicle routing problem with time windows (VRPTW). Unlike the standard vehicle routing problem, each customer in the VRPTW is served within a given time constraint. This paper solves the VRPTW using an improved artificial bee colony (IABC) algorithm. The performance of this algorithm is improved by a local optimization based on a crossover operation and a scanning strategy. Finally, the effectiveness of the IABC is evaluated on some well-known benchmarks. The results demonstrate the power of IABC algorithm in solving the VRPTW.

| S-EPMC5621664 | biostudies-literature

A unified model framework for the multi-attribute consistent periodic vehicle routing problem.

Project description:Modeling real-life transportation problems usually require the simultaneous incorporation of different variants of the classical vehicle routing problem (VRP). The periodic VRP (PVRP) is a classical extension in which routes are determined for a planning period of several days and each customer has an associated set of allowable visit schedules. This work proposes a unified model framework for PVRP that consists of multiple attributes or variants not previously addressed simultaneously, such as time-windows, time-dependence, and consistency -which guarantees the visits to customer by the same vehicle-, together with three objective functions that respond to the needs of practical problems. The numerical experimentation is focused on the effects of three factors: frequency, depot centrality, and the objective function on the performance of a general-purpose MILP solver, through the analysis of the achieved relative gaps. Results show higher sensitivity to the objective functions and to the problem sizes.

| S-EPMC7398502 | biostudies-literature

Joint optimization of green vehicle scheduling and routing problem with time-varying speeds.

Project description:Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions.

| S-EPMC5821442 | biostudies-literature

Nanoparticle System Based on Amino-Dextran as a Drug Delivery Vehicle: Immune-Stimulatory CpG-Oligonucleotide Loading and Delivery.

Project description:The aim of this study is to prepare and characterize an amino-dextran nanoparticle (aDNP) platform and investigate two loading strategies for unmethylated cytosine-phosphate-guanine (CpG) oligonucleotide. aDNP was prepared by desolvation of amino-dextran followed by the chemical crosslinking of amino groups. Size, surface charge, and surface morphology of aDNP was determined by dynamic light scattering and transmission electron microscopy. CpG was either loaded onto aDNP by adsorption (CpG-adsorbed-aDNP) or conjugated to aDNP (CpG-conjugated-aDNP). In vitro cytokine production by bone marrow-derived dendritic cells (BMDCs) was measured by flow cytometry. aDNPs size and zeta potential could be controlled to produce uniform particles in the size range of 50 to 300 nm, surface charge of -16.5 to +14 mV, and were spherical in shape. Formulation control parameters investigated included the anti-solvent, water-to-anti-solvent ratio, level of amine functionality of dextran, and the molar ratio of glutaraldehyde to amine. aDNP could be lyophilized without additional cryoprotectant. Unloaded cationic aDNP (+13 mV) showed acceptable in vitro hemolysis. Unloaded and CpG-loaded aDNPs showed no cytotoxicity on BMDCs. CpG-loaded nanoparticles stimulated cytokine production by BMDCs, the level of cytokine production was higher for CpG-conjugated-aDNP compared to CpG-absorbed-aDNP. aDNP is a promising new drug delivery platform as its offers versatility in loading and tuning of particle properties.

| S-EPMC7760314 | biostudies-literature

Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order.

Project description:The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution. In order to reduce the cost of logistics distribution, the distance-constrained and capacitated VRP with split deliveries by order (DCVRPSDO) was studied. We show that the customer demand, which can't be split in the classical VRP model, can only be discrete split deliveries by order. A model of double objective programming is constructed by taking the minimum number of vehicles used and minimum vehicle traveling cost as the first and the second objective, respectively. This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP. A new tabu search algorithm is designed to solve the problem and the examples testing show the efficiency of the proposed algorithm. This paper focuses on constructing a double objective mathematical programming model for DCVRPSDO and designing an adaptive tabu search algorithm (ATSA) with good performance to solving the problem. The performance of the ATSA is improved by adding some strategies into the search process, including: (a) a strategy of discrete split deliveries by order is used to split the customer demand; (b) a multi-neighborhood structure is designed to enhance the ability of global optimization;

| S-EPMC5953470 | biostudies-literature

Salmonella as a vaccine delivery vehicle.

Project description:Attenuated Salmonella vaccines can be administered orally to deliver recombinant antigens to mucosal surfaces inducing a protective immune response against a variety of targeted pathogens. A number of exciting new approaches and technologies for attenuated Salmonella vaccines have been developed recently. However, a disconnect remains between results obtained with mice in preclinical studies and results obtained in human clinical trials. This is due to an incomplete understanding of Salmonella Typhi interactions with human hosts and inadequate animal models available for study. In this review, the authors describe recent progress in identifying important differences underlying S. Typhi-host interactions, the development of novel approaches to vaccine design and six recent clinical trials evaluating Salmonella-vectored vaccines.

| S-EPMC3956298 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data