Collision-free scheduling of multi-bridge machining systems: a colored traveling salesman problem-based approach

Li, Jun; Meng, Xianghu; Dai, Xing

doi:10.1109/jas.2017.7510415

Cited by 40 publications

(15 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The start and end of the route are in Prague, since the Czech companies currently operating in the Black Sea have their head offices there. Li et al (2018) present a case study of a large triple bridge waterjet cutting system that is modelled as a serialcolored traveling salesman problem. To solve it, a greedy algorithm that selects a neighboring city satisfying proximity is developed.…”

Section: Related Workmentioning

confidence: 99%

Performance measurement of a solution for the travelling salesman problem for routing through the incorporation of service time variability

et al. 2019

View full text Add to dashboard Cite

This work assessed the performance of a solution to the problem of assigning service squads, incorporating the variability of service times. The initial problem was modelled as a Travelling Salesman Problem (TSP), whose solution was obtained by the ant colony algorithm, showing the efficient route to be followed by the squad. Assessment of the performance of the solution by discrete event simulation (DES) included the travel time and added the service time. The TSP solution indicated that up to six customer visits could be carried out in an 8hour working day. Validation by DES presented a stable behavior of the variance, regardless of the number of visit sites assigned along the route.

show abstract

Section: Related Workmentioning

confidence: 99%

Performance measurement of a solution for the travelling salesman problem for routing through the incorporation of service time variability

et al. 2019

View full text Add to dashboard Cite

show abstract

“…In the traditional research of discrete event systems, Petri-net based analysis of message and resource interactions among different sub-systems received much attention in the past two decades. As one of the most typical kind of resource interaction (allocation) systems [32], modeling and correctness verification of flexible manufacturing systems concerning resource allocation problems [12], [45], [50]- [52] have been extensively studied. Message interactions in Web service composition and cross-organizational workflow management have also received much concern [27], [38], [50].…”

Section: Introductionmentioning

confidence: 99%

Privacy-Preserving Behavioral Correctness Verification of Cross-Organizational Workflow With Task Synchronization Patterns

Liu

Zeng

Cheng

et al. 2021

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

Workflow management technology has become a key means to improve enterprise productivity. More and more workflow systems are crossing organizational boundaries and may involve multiple interacting organizations. This paper focuses on a type of loosely-coupled workflow architecture with collaborative tasks, i.e., each business partner owns its private business process and is able to operate independently, and all involved organizations need to be synchronized at certain point to complete certain public tasks. Because of each organization's privacy consideration, they are unwilling to share the business details with others. In this way, traditional correctness verification approaches via reachability analysis is not practical as a global business process model is unavailable for privacy preservation. To ensure its globally correct execution, this work establishes a correctness verification approach for cross-organizational workflow with task synchronization patterns. Its core idea is to use local correctness of each sub-organizational workflow process to guarantee its global correctness. We proved that the proposed approach can be used to investigate the behavioral property preservation when synthesizing sub-organizational workflows via collaborative tasks. A medical diagnosis running case is used to illustrate the applicability of the proposed approaches. Note to Practitioners-Cross-organizational workflow verification techniques play an increasingly important role for ensuring correct execution of collaborative enterprise businesses. This work addresses the issue of correctness verification for loosely-coupled interactive workflows with collaborative tasks. To ensure the globally correct execution, a behavioral correctness verification approach is established. All proposed concepts and techniques are supported by open-source tools and evaluation over a medical

show abstract

“…A clustering algorithm and a collaborative filtering recommendation algorithm are adopted to optimize the ant colony algorithm. The improved ant colony algorithm can better help solve the problems encountered in the actual production process, such as improving the production efficiency of the multi-bridge machining system (MBMS) [25]. The main contributions of this paper are as follows:…”

Section: Introductionmentioning

confidence: 99%

Dynamic Density Clustering Ant Colony Algorithm With Filtering Recommendation Backtracking Mechanism

You

Liu

2020

IEEE Access

View full text Add to dashboard Cite

Ant colony system has a good performance in solving Traveling Salesman Problem (TSP), but it tends to fall into local optimum and is deficient in convergence speed. To address this problem, a dynamic density clustering ant colony algorithm with a filtering recommendation backtracking mechanism is proposed (DBACS). Firstly, a dynamic density clustering strategy is proposed to accelerate the convergence speed of the algorithm and improve the quality of the solution. Under this strategy, the search radius is expanded dynamically to merge adjacent classes, so as to form the differential pheromone distribution. The splicing paths between each class are adjusted through the ant colony algorithm to achieve better performance. Secondly, a recommendation backtracking mechanism based on collaborative filtering is proposed to increase the diversity of the population, thus helping the algorithm jump out of the local optimum. With the help of the collaborative filtering algorithm, some dense data points are recommended for pheromone dynamic backtracking, which can not only help algorithm jump out of the local optimum, but also help the algorithm accelerate convergence. Simulation results show that the improved algorithm can obtain a better solution and higher stability. Especially in solving large-scale TSP, the accuracy of the solution is significantly improved.

show abstract

Collision-free scheduling of multi-bridge machining systems: a colored traveling salesman problem-based approach

Cited by 40 publications

References 17 publications

Performance measurement of a solution for the travelling salesman problem for routing through the incorporation of service time variability

Performance measurement of a solution for the travelling salesman problem for routing through the incorporation of service time variability

Privacy-Preserving Behavioral Correctness Verification of Cross-Organizational Workflow With Task Synchronization Patterns

Dynamic Density Clustering Ant Colony Algorithm With Filtering Recommendation Backtracking Mechanism

Contact Info

Product

Resources

About