Browse
Submit Data
Databases
API
Help

Dataset Information

28 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

Nurse-patient relationship for multi-period home health care routing and scheduling problem.

Project description:This article proposes a novel dynamic objective function in a multi-period home health care (HHC) problem, known as the nurse-patient relationship (NPR). The nurse-patient relationship score indicating the trust a patient has for his or her care worker increases when the same people meet regularly and decreases when they are apart. Managing human resources in HHC is a combination of routing and scheduling problems. Due to computational complexity of the HHC problem, a 28-day home health care problem is decomposed into daily subproblems, and solved sequentially with the tabu search. The solutions are then combined to give a solution to the original problem. For problems with less complex constraints, the NPR model can also be solved using exact methods such as CPLEX. For larger scale instances, however, the numerical results show that the NPR model can only be solved in reasonable times using our proposed tabu search approach. The solutions obtained from the NPR models are compared against those from existing models in the literature such as preference and continuity of care. Essentially, the analysis revealed that the proposed NPR models encouraged the search algorithm to assign the same care worker to visit the same patient. In addition, it had a tendency to assign a care worker on consecutive days to each patient, which is one of the key factors in promoting trust between patients and care workers. This leads to the efficacy of monitoring patient's disease progression and treatment.

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

Multi-objective optimization of dual resource integrated scheduling problem of production equipment and RGVs considering conflict-free routing.

Project description:In flexible job shop scheduling problem (FJSP), the collision of bidirectional rail guided vehicles (RGVs) directly affects RGVs scheduling, and it is closely coupled with the allocation of production equipment, which directly affects the production efficiency. In this problem, taking minimizing the maximum completion time of RGVs and minimizing the maximum completion time of products as multi-objectives a dual-resource integrated scheduling model of production equipment and RGVs considering conflict-free routing problem (CFRP) is proposed. To solve the model, a multi-objective improved discrete grey wolf optimizer (MOID-GWO) is designed. Further, the performance of popular multi-objective evolutionary algorithms (MOEAs) such as NSGA-Ⅱ, SPEA2 and MOPSO are selected for comparative test. The results show that, among 42 instances of different scales designed, 37, 34 and 28 instances in MOID-GWO are superior to the comparison algorithms in metrics of generational distance (GD), inverted GD (IGD) and Spread, respectively. Moreover, in metric of Convergence and Diversity (CD), the Pareto frontier (PF) obtained by MOID-GWO is closer to the optimal solution. Finally, taking the production process of a construction machinery equipment component as an example, the validity and feasibility of the model and algorithm are verified.

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

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