Vehicle routing for a mid-day meal delivery distribution system.
Ontology highlight
ABSTRACT:
SUBMITTER: Gajpal Y
PROVIDER: S-EPMC6356091 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
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
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
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
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
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
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
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
Project description:The mammalian circadian clock drives the temporal coordination in cellular homeostasis and it leads the day-night fluctuation of physiological functions, such as sleep/wake cycle, hormonal secretion, and body temperature. The mammalian circadian clock system in the body is classified hierarchically into two classes, the central clock in the suprachiasmatic nucleus (SCN) of the hypothalamus and the peripheral clocks in peripheral tissues such as the intestine and liver, as well as other brain areas outside the SCN. The circadian rhythm of various tissue-specific functions is mainly controlled by each peripheral clock and partially by the central clock as well. The digestive, absorptive, and metabolic capacities of nutrients also show the day-night variations in several peripheral tissues such as small intestine and liver. It is therefore indicated that the bioavailability or metabolic capacity of nutrients depends on the time of day. In fact, the postprandial response of blood triacylglycerol to a specific diet and glucose tolerance exhibit clear time-of-day effects. Meal frequency and distribution within a day are highly related to metabolic functions, and optimal time-restricted feeding has the potential to prevent several metabolic dysfunctions. In this review, we summarize the time-of-day-dependent postprandial response of macronutrients to each meal and the involvement of circadian clock system in the time-of-day effect. Furthermore, the chronic beneficial and adverse effects of meal time and eating pattern on metabolism and its related diseases are discussed. Finally, we discuss the timing-dependent effects of exercise on the day-night variation of exercise performance and therapeutic potential of time-controlled-exercise for promoting general health.
| S-EPMC7059348 | biostudies-literature
Project description:Botulinum neurotoxin (BoNT) is the most potent poison known to mankind. Currently no antidote is available to rescue poisoned synapses. An effective medical countermeasure strategy would require developing a drug that could rescue poisoned neuromuscular synapses and include its efficient delivery specifically to poisoned presynaptic nerve terminals. Here we report a drug delivery strategy that could directly deliver toxin inhibitors into the intoxicated nerve terminal cytosol.A targeted delivery vehicle was developed for intracellular transport of emerging botulinum neurotoxin antagonists. The drug delivery vehicle consisted of the non-toxic recombinant heavy chain of botulinum neurotoxin-A coupled to a 10-kDa amino dextran via the heterobifunctional linker 3-(2-pyridylthio)-propionyl hydrazide. The heavy chain served to target botulinum neurotoxin-sensitive cells and promote internalization of the complex, while the dextran served as a platform to deliver model therapeutic molecules to the targeted neurons. Our results indicated that the drug delivery vehicle entry into neurons was via BoNT-A receptor mediated endocytosis. Once internalized into neurons, the drug carrier component separated from the drug delivery vehicle in a fashion similar to the separation of the BoNT-A light chain from the holotoxin. This drug delivery vehicle could be used to deliver BoNT-A antidotes into BoNT-A intoxicated cultured mouse spinal cord cells.An effective BoNT-based drug delivery vehicle can be used to directly deliver toxin inhibitors into intoxicated nerve terminal cytosol. This approach can potentially be utilized for targeted drug delivery to treat other neuronal and neuromuscular disorders. This report also provides new knowledge of endocytosis and exocytosis as well as of BoNT trafficking.
| S-EPMC2774289 | biostudies-other
Project description:It is an undeniable fact that material handling systems aim at supplying the right materials at the right locations at the right time. This fact creates the need for the design of logistic-train-fleet-oriented, distributed and scalability-robust control policies ensuring deadlock-free operations. The paper presents a solution to a multi-item and multi-depot vehicle routing and scheduling problem subject to fuzzy pick-up and delivery transportation time constraints. Since this type of problem can be treated as a fuzzy constraint satisfaction problem, a solution to it can be determined using both computer simulation and analytical ordered-fuzzy-numbers-driven calculations. The accuracy of both approaches is verified based on the results of multiple simulations. In this context, our contribution consists of proposing an alternative approach that allows avoiding time-consuming computer simulation-based calculations of logistic train fleet schedules.
| S-EPMC7302809 | biostudies-literature