Modelling of integrated scheduling problem of capacitated equipment systems with a multi-lane road network.
Ontology highlight
ABSTRACT:
SUBMITTER: Luan D
PROVIDER: S-EPMC8171962 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
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
Project description:Regarding climate change and energy resource problems, cargo movement in the urban environment is essential to shift to a more sustainable mode. As cities seek to slash transport-related emissions and tackle traffic congestion, the cargo bike is showing itself to be an attractive and versatile last-mile delivery alternative. To this end, this article presents a series of datasets for the Electric Capacitated Travelling Salesman Problem (EC-TSP). This problem has been built for modeling and solving the e-cargo bike parcel distribution problem in urban environments. For the design of these datasets, real geographical data have been used that are in the city centers of Athens, Thessaloniki, Patra, and Larisa in Greece. These datasets have been used for the assessment of e-cargo bikes versus typical delivery vans in terms of operational efficiency and CO2e emissions. The entire benchmark is composed of 9 instances comprised of 14-29 nodes each. The datasets are publicly available for use and modification.
| S-EPMC10430151 | biostudies-literature
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
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
Project description:With the continuous prosperity of maritime transportation on a global scale and the resulting escalation in port trade volume, tugboats assume a pivotal role as essential auxiliary tools influencing the ingress and egress of vessels into and out of ports. As a result, the optimization of port tug scheduling becomes of paramount importance, as it contributes to the heightened efficiency of ship movements, cost savings in port operations, and the promotion of sustainable development within the realm of maritime transportation. However, a majority of current tugboat scheduling models tend to focus solely on the maximum operational time. Alternatively, the formulated objective functions often deviate from real-world scenarios. Furthermore, prevailing scheduling methods exhibit shortcomings, including inadequate solution accuracy and incompatibility with integer programming. Consequently, this paper introduces a novel multi-objective tugboat scheduling model to align more effectively with practical considerations. We propose a novel optimization algorithm, the Improved Grey Wolf Optimization (IGWO), for solving the tugboat scheduling model. The algorithm enhances convergence performance by optimizing convergence parameters and individual updates, making it particularly suited for solving integer programming problems. The experimental session designs several scale instances according to the reality of the port, carries out simulation experiments comparing several groups of intelligent algorithms, verifies the effectiveness of IGWO, and verifies it in the comprehensive port area of Huanghua Port to get the optimal scheduling scheme of this port area, and finally gives management suggestions to reduce the cost of tugboat operation through sensitivity analysis.
| S-EPMC10896540 | biostudies-literature
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-literature
Project description:This paper focuses on the cooperative driving challenges of connected and automated vehicles (CAVs) at single-lane roundabouts. First, a geometric path planning method is proposed for CAVs navigating a single-lane roundabout. Based on this method, a vehicle roundabout model is established. Four potential traffic scenarios for CAVs are established, and the optimal arrival times at conflict points are analyzed. By correlating the optimal arrival times at conflict points with the optimal entry times into the roundabout, the multi-vehicle coordination problem in complex intersections is simplified to a speed control issue during entry. Utilizing the principles of optimal control and Pontryagin minimization, two speed optimization strategies are proposed. Finally, MATLAB is employed for simulation analysis. The results indicate that the control strategy proposed in this paper enables the system to clearly identify potential conflicts between vehicles and implement an optimal control strategy, ensuring that vehicles can navigate the roundabout efficiently in terms of time and fuel without collisions. Additionally, the minimum time interval is established at 0.2 seconds to completely prevent vehicle collisions. In this study, the fusion problem involving two vehicles at a single conflict point is further expanded to encompass multiple vehicles at multiple conflict points. Thus, the efficient scheduling of multiple vehicles in single-lane roundabouts is realized.
| S-EPMC11364289 | biostudies-literature
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
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
Project description:Although a wide range of literature has investigated the network-level highway maintenance plans and policies, few of them focused on the maintenance scheduling problem. This study proposes a methodology framework to model and compare two different maintenance scheduling strategies for highway networks, i.e., minimal makespan strategy (MMS) and minimal increased travel delay strategy (MITDS). We formulate MMS as a mixed integer linear programming model subject to the constraints of the quantity of manpower and the worst-first maintenance sequence. A bi-level programming model is proposed to quantify and optimize MITDS. The upper level model determines the optimal scheduling to minimize the increased traffic delays during the maintenance makespan. In the lower level, a modified day-to-day traffic assignment model is put forward to reflect the traffic evolution dynamics by simulating travelers' route choice behaviors. A simulated annealing algorithm and augmented Lagrange algorithm are employed to solve the two proposed models, respectively. Finally, a numerical example using a highway network is developed. The two proposed strategies are tested considering different traffic demands, numbers of engineering teams, and travelers' sensitivities to traffic congestion. The experiment results reveal that compared with MMS, MITDS extends makespan by 2 days though, it reduces the total increased travel delays by 4% and both MMS and MITDS can obtain the minimum total increased travel delays when the number of engineering teams is 6. The sensitivity analysis indicates that both the two strategies have the maximum and minimum total increased travel delays when the weight of prediction in travelers' perception is 0.3 and 0.7, respectively. The proposed framework has the potential to provide reference in implementing highway maintenance activities reasonably.
| S-EPMC9176791 | biostudies-literature