Browse
Submit Data
Databases
API
Help

Dataset Information

24 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Modelling of integrated scheduling problem of capacitated equipment systems with a multi-lane road network.

ABSTRACT: The coordination of different container-handling equipment is an important method for improving the overall efficiency of automated container terminals. In the real terminal, we should consider many real-life issues, such as the equipment capacity, the equipment collision, changing lanes in the multi-lane road, and choosing one of container-handling lanes for each container. This paper proposes the integrated scheduling problem of three container-handling equipment with the capacity constraint and the dual-cycle strategy, for simultaneously solving the equipment scheduling problem, the assignment problem of the container-handling lane and the conflict-free route planning problem of automated guided vehicles (AGVs). With the objective of minimizing the ship's berth time, we propose a mixed-integer programming model based on the space-time network representation method and two bilevel optimization algorithms based on conflict resolution rules. Finally, numerical experiments are conducted to verify the effectiveness of the proposed model and two bilevel optimization algorithms.

SUBMITTER: Luan D

PROVIDER: S-EPMC8171962 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

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

Dataset of metaheuristics for the flow shop scheduling problem with maintenance activities integrated.

Project description:This data article presents a flow shop scheduling problem in which machines are not available during the whole planning horizon and the periods of unavailability are due to random faults. The experimental dataset consists of two problems with different sizes. In the largest one, about 2400 problems were analysed and compared with two diffuse metaheuristics: Genetic Algorithm (GA) and Harmony Search (HS). In the smallest, about 600 problems were analysed comparing the solution obtained with an exhaustive algorithm with those obtained by means of GA and HS. This dataset represents a test-bed for further works, allowing a comparison between the solution quality and the computation time obtained with different optimization methods. The substantial computational effort spent to generate the dataset undoubtedly represents a significant asset for the scientific community.

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

A multi-objective scheduling optimization algorithm of a camera network for directional road network coverage.

Project description:Effective video monitoring systems require optimization of camera and road network coverage, to exploit fully the hardware and software solutions in smart city traffic applications. Monitoring requirements have grown increasingly diverse as scenes are becoming increasingly complex, thereby transforming the camera and road network coverage optimization issue into a nonlinear, high-dimension, and multi-objective problem. Previous research on this topic however, has focused on a single, specific optimization objective, which may result in invalid optimization results in actual applications. To extend this research, we propose a multi-objective scheduling optimization algorithm for a camera network that addresses the problem of directional road network coverage. In this solution, we incorporate an expanding parameter of main optical axes into particle swarm optimization algorithm. Our new strategy divides the range of main optical axes of all the cameras to control the scheduling number, achieving collaborative optimization of multiple objectives. In a simulated camera and road network, an experiment was designed for evaluating the effectiveness of the proposed method, comparing the distribution of optimization results with the global and local optimal solutions of the true value. A second experiment compared the distribution, performance and running time of the optimization results with different values of expanding parameter of main optical axes. A third experiment compared the performance of the optimization solutions with different values of camera parameters. The results showed that the proposed method can adapt to user application preference, and is effective and robust to schedule and allocate monitoring resources in different scenarios.

| S-EPMC6209222 | biostudies-other

On-road bicycle lane types, roadway characteristics, and risks for bicycle crashes.

Project description:Bicycle lanes reduce real and perceived risks for bicycle vs. motor vehicle crashes, reducing the burden of traffic injuries and contributing to greater cycling participation. Previous research indicates that the effectiveness of bicycle lanes differs according to roadway characteristics, and that bicycle lane types are differentially associated with reduced crash risks. The aim of this study is to combine these perspectives and identify the types of on-road bicycle lanes that are associated with the greatest reductions in bicycle crashes given the presence of specific roadway characteristics. We compiled a cross sectional spatial dataset consisting of 32,444 intersection polygons and 57,285 street segment polygons representing the roadway network for inner Melbourne, Australia. The dependent measure was a dichotomous indicator for any bicycle crash (2014-2017). Independent measures were bicycle lanes (exclusive bicycle lanes, shared bicycle and parking lanes, marked wide kerbside lanes, and kerbside bicycle lanes) and other roadway characteristics (speed limit, bus routes, tram routes, bridges, one-way flow, traffic lane width). In Bayesian conditional autoregressive logit models, bicycle lanes of all types were associated with decreased crash odds where speeds were greater, bus routes and tram stops were present, and traffic lanes were narrower. Only exclusive bicycle lanes were associated with reduced crash odds (compared to the expected odds given the presence of the bicycle lane and the roadway conditions) in all these setting. The extent to which on-road bicycle lanes reduce crash risks depends on the bicycle lane type, the roadway conditions, and the combination of these two factors. Bicycle lanes that provide greater separation between cyclists and vehicular traffic are most consistently protective.

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

Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem.

Project description:The solution to the job shop scheduling problem (JSSP) is of great significance for improving resource utilization and production efficiency of enterprises. In this paper, in view of its non-deterministic polynomial properties, a multi-agent genetic algorithm based on tabu search (MAGATS) is proposed to solve JSSPs under makespan constraints. Firstly, a multi-agent genetic algorithm (MAGA) is proposed. During the process, a multi-agent grid environment is constructed based on characteristics of multi-agent systems and genetic algorithm (GA), and a corresponding neighbor interaction operator, a mutation operator based on neighborhood structure and a self-learning operator are designed. Then, combining tabu search algorithm with a MAGA, the algorithm MAGATS are presented. Finally, 43 benchmark instances are tested with the new algorithm. Compared with four other algorithms, the optimization performance of it is analyzed based on obtained test results. Effectiveness of the new algorithm is verified by analysis results.

| S-EPMC6764687 | biostudies-other

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

Solution strategy based on Gaussian mixture models and dispersion reduction for the capacitated centered clustering problem.

Project description:The Capacitated Centered Clustering Problem (CCCP)-a multi-facility location model-is very important within the logistics and supply chain management fields due to its impact on industrial transportation and distribution. However, solving the CCCP is a challenging task due to its computational complexity. In this work, a strategy based on Gaussian mixture models (GMMs) and dispersion reduction is presented to obtain the most likely locations of facilities for sets of client points considering their distribution patterns. Experiments performed on large CCCP instances, and considering updated best-known solutions, led to estimate the performance of the GMMs approach, termed as Dispersion Reduction GMMs, with a mean error gap smaller than 2.6%. This result is more competitive when compared to Variable Neighborhood Search, Simulated Annealing, Genetic Algorithm and CKMeans and faster to achieve when compared to the best-known solutions obtained by Tabu-Search and Clustering Search.

| S-EPMC7959615 | biostudies-literature

Integrating complex systems science into road safety research and practice, Part 2: applying systems tools to the problem of increasing pedestrian death rates.

Project description:ObjectivesTo provide a specific example of how systems dynamics tools can increase understanding of stakeholder 'mental models' and generate robust systems-based hypotheses about the escalating problem of rising pedestrian death rates in the USA.MethodsWe designed and facilitated two group model building (GMB) workshops. Participants generated causal loop diagrams (CLDs) individually and in small groups to explore hypotheses concerning time-dynamic interacting factors underlying the increasing rates of pedestrian deaths. Using a grounded theory approach, research team members synthesised the structures and hypotheses into a single CLD.ResultsCLDs from the 41 participants indicated four core factors hypothesised to have a direct impact on pedestrian fatalities: pedestrian-vehicle crashes, vehicle speed at the time of the crash, vehicle size/dimensions and emergency response time. Participants diagrammed how actions and reactions impacted these proximal factors over time and led to ripple effects throughout a larger system to generate an increase in pedestrian deaths. Hypothesised contributing mechanisms fell within the following broad categories: community responses; research, policy and industry influence; potential unintended consequences of responses to pedestrian deaths; and the role of sprawl.ConclusionsThis application of systems science tools suggested several strategies for advancing injury prevention research and practice. The project generated robust hypotheses and advanced stakeholder communication and depth of understanding and engagement in this key issue. The CLD and GMB process detailed in this study provides a concrete example of how systems tools can be adopted and applied to a transportation safety topic.

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