Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

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

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

SUBMITTER: Lin CC

PROVIDER: S-EPMC3996876 | biostudies-other | 2014

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

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

Home health care nurse routing and scheduling problem considering ergonomic risk factors.

Project description:Home health care routing and scheduling is a complex problem that requires many aspects to be considered simultaneously. One of the important aspects is ergonomics. Home health care nurses are at higher risk of work-related health problems such as musculoskeletal disorders and burnout since they are frequently exposed to physical, mental, and environmental ergonomic risks in their jobs. Therefore, it is essential to integrate ergonomic considerations into the construction of daily schedules for home health care nurses to mitigate these health risks. The purpose of this study is to present a mathematical model that incorporate ergonomic risks. We introduce a set of constraints into our model to prevent nurses from encountering excessive workloads. To assess the workload, we propose a subjective assessment method and employ a fuzzy inference system to calculate nurses' perceived workload levels. We applied our model to a several numerical examples to investigate the impact of workload on the nurse daily schedules. We observed that, at a specified workload level, there may be alternative solutions where the number of patients visited is the same. Therefore, we defined an objective function to maximize patient visits while minimizing nurses' workload levels as much as possible. As a result, our model generates solutions that effectively reduce nurse workloads, leading to more balanced schedules. Thus, our study offers a comprehensive approach to home health care scheduling by incorporating ergonomic considerations, ultimately enhancing both patient care and nurse well-being.

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

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

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

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

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

Allocation Variable-Based Probabilistic Algorithm to Deal with Label Switching Problem in Bayesian Mixture Models.

Project description:The label switching problem occurs as a result of the nonidentifiability of posterior distribution over various permutations of component labels when using Bayesian approach to estimate parameters in mixture models. In the cases where the number of components is fixed and known, we propose a relabelling algorithm, an allocation variable-based (denoted by AVP) probabilistic relabelling approach, to deal with label switching problem. We establish a model for the posterior distribution of allocation variables with label switching phenomenon. The AVP algorithm stochastically relabel the posterior samples according to the posterior probabilities of the established model. Some existing deterministic and other probabilistic algorithms are compared with AVP algorithm in simulation studies, and the success of the proposed approach is demonstrated in simulation studies and a real dataset.

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

An approximation solution to refinery crude oil scheduling problem with demand uncertainty using joint constrained programming.

Project description:This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand uncertainty is treated by specifying proximity level on the satisfaction of product demands. However, the joint chance constraints usually hold strong nonlinearity and consequently, it is still hard to handle it directly. In this paper, an approximation method combines a relax-and-tight technique to approximately transform the joint chance constraints to a serial of parameterized linear constraints so that the complicated problem can be attacked iteratively. The basic idea behind this approach is to approximate, as much as possible, nonlinear constraints by a lot of easily handled linear constraints which will lead to a well balance between the problem complexity and tractability. Case studies are conducted to demonstrate the proposed methods. Results show that the operation cost can be reduced effectively compared with the case without considering the demand correlation.

| S-EPMC3976839 | biostudies-other

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

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