Browse
Submit Data
Databases
API
Help

Dataset Information

23 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Simulation Versus an Ordered–Fuzzy-Numbers-Driven Approach to the Multi-depot Vehicle Cyclic Routing and Scheduling Problem

ABSTRACT: 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.

SUBMITTER: Krzhizhanovskaya V

PROVIDER: S-EPMC7302809 | biostudies-literature | 2020 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

A benchmark dataset for the multiple depot vehicle scheduling problem.

Project description:This data article presents a description of a benchmark dataset for the multiple depot vehicle scheduling problem (MDVSP). The MDVSP is to assign vehicles from different depots to timetabled trips to minimize the total cost of empty travel and waiting. The dataset has been developed to evaluate the heuristics of the MDVSP that are presented in "A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem" (Kulkarni et al., 2018). The dataset contains 60 problem instances of varying size. Researchers can use the dataset to evaluate the future algorithms for the MDVSP and compare the performance with the existing algorithms. The dataset includes a program that can be used to generate new problem instances of the MDVSP.

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

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

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

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

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

A novel joint problem of routing, scheduling, and variable-width channel allocation in WMNs.

Project description:This paper investigates a novel joint problem of routing, scheduling, and channel allocation for single-radio multichannel wireless mesh networks in which multiple channel widths can be adjusted dynamically through a new software technology so that more concurrent transmissions and suppressed overlapping channel interference can be achieved. Although the previous works have studied this joint problem, their linear programming models for the problem were not incorporated with some delicate constraints. As a result, this paper first constructs a linear programming model with more practical concerns and then proposes a simulated annealing approach with a novel encoding mechanism, in which the configurations of multiple time slots are devised to characterize the dynamic transmission process. Experimental results show that our approach can find the same or similar solutions as the optimal solutions for smaller-scale problems and can efficiently find good-quality solutions for a variety of larger-scale problems.

| S-EPMC3996876 | biostudies-other

Multi-resource scheduling and routing for emergency recovery operations.

Project description:Efficient delivery of multiple resources for emergency recovery during disasters is a matter of life and death. Nevertheless, most studies in this field only handle situations involving single resource. This paper formulates the Multi-Resource Scheduling and Routing Problem (MRSRP) for emergency relief and develops a solution framework to effectively deliver expendable and non-expendable resources in Emergency Recovery Operations. Six methods, namely, Greedy, Augmented Greedy, k-Node Crossover, Scheduling. Monte Carlo, and Clustering, are developed and benchmarked against the exact method (for small instances) and the genetic algorithm (for large instances). Results reveal that all six heuristics are valid and generate near or actual optimal solutions for small instances. With respect to large instances, the developed methods can generate near-optimal solutions within an acceptable computational time frame. The Monte Carlo algorithm, however, emerges as the most effective method. Findings of comprehensive comparative analysis suggest that the proposed MRSRP model and the Monte Carlo method can serve as a useful tool for decision-makers to better deploy resources during emergency recovery operations.

| S-EPMC7456293 | biostudies-literature

Benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths.

Project description:In this paper, the benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths is presented (AC-VRP-SPDVCFP). This problem is a specific multi-attribute variant of the well-known Vehicle Routing Problem, and it has been originally built for modelling and solving a real-world newspaper distribution problem with recycling policies. The whole benchmark is composed by 15 instances comprised by 50-100 nodes. For the design of this dataset, real geographical positions have been used, located in the province of Bizkaia, Spain. A deep description of the benchmark is provided in this paper, aiming at extending the details and experimentation given in the paper A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy (Osaba et al.) [1]. The dataset is publicly available for its use and modification.

| S-EPMC7005518 | biostudies-literature

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

Project description: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.

| S-EPMC6356091 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

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