Browse
Submit Data
Databases
API
Help

Dataset Information

0 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 | 2019 Jan

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

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

Gajpal Yuvraj Y Roy Vivek V Sahay B S BS

Heliyon 20190129 1

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 deliv ...[more]

PMID: 30775566

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

Dataset for the cumulative unmanned aerial vehicle routing problem.

Project description:The Cumulative Unmanned Aerial Vehicle Routing Problem applies to area covering operations using UAVs. It is defined on a graph, the nodes of which, ensure the complete coverage of the underlying area of interest. The data generation process takes into account the characteristics of such operations, in particular, the viewing window of the UAVs' sensor, their maximum range, the size of the UAV fleet and the unknown locations of the targets within the area of interest. Instances are created simulating different scenarios, using different values for those UAV characteristics, as well as the different locations where the search targets might be positioned in the area of interest.

| S-EPMC10294095 | 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

A highway vehicle routing dataset during the 2019 Kincade Fire evacuation

Project description:As the threat of wildfire increases, it is imperative to enhance the understanding of household evacuation behavior and movements. Mobile GPS data provide a unique opportunity for studying evacuation routing behavior with high ecological validity, but there are little publicly available data. We generated a highway vehicle routing dataset derived from GPS trajectories generated by mobile devices (e.g., smartphones) in Sonoma County, California during the 2019 Kincade Fire that started on October 23, 2019. This dataset contains 21,160 highway vehicle routing records within Sonoma County from October 16, 2019 to November 13, 2019. The quality of the dataset is validated by checking trajectories and average travel speeds. The potential use of this dataset lies in analyzing and modeling evacuee route choice behavior, estimating traffic conditions during the evacuation, and validating wildfire evacuation simulation models. Measurement(s)highway vehicle routingTechnology Type(s)GPS location trackingSample Characteristic - LocationSonoma County, California, USA

| S-EPMC9546841 | biostudies-literature

The effect of the Mid-Day Meal programme on the longitudinal physical growth from childhood to adolescence in India

Project description: Not available

| S-EPMC10783765 | 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

Meal-to-meal and day-to-day macronutrient variation in an ad libitum vending food paradigm.

Project description:BackgroundTheory posits that macronutrient intake is regulated by protein consumption and adequate intake of protein results in consumption of less carbohydrates and fat. The current study investigates the effect of protein intake on calorie and macronutrient content using an ad libitum vending machine paradigm.MethodsHealthy volunteers (n = 287; 177 m; Age = 36 ± 11; BMI = 32 ± 8) were admitted to our clinical research unit. Macronutrient meal content (grams) and energy intake (Kcal) were quantified by specialized food processing software and collected on an hourly basis over a three-day period using a validated ad libitum vending machine paradigm. Body composition was assessed by DXA. Lagged multi-level models accounting for age, sex, race/ethnicity, fat and fat free mass indices were fitted to examine the impact of prior macronutrient content on subsequent meals.ResultsProtein intake was associated with decreased energy intake (Kcal; B = -1.67 kcal, p = 0.0048), lower protein and carbohydrate intake (B = -0.08 g, p = 0.0006; B = -0.21 g, p = 0.0003, respectively) at subsequent meals. Daily Macronutrient intake and subsequent intake were positively associated.ConclusionsDietary protein exhibits a negative regulatory effect on a short-term meal-to-meal rather than day-to-day basis. In the setting of readily available food, protein intake impacts energy intake only over very short time courses.

| S-EPMC8842501 | 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

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