Multi-Task Scheduling Optimization Method Integrating Visibility Graph, Simulated Annealing, and A Algorithm

This paper presents a multi-task allocation method integrating the visibility graph, A* algorithm, and simulated annealing to enhance scheduling stability and path accuracy in complex environments. The method constructs a path cost matrix and globally optimizes task sequences. Experimental results s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2025 2nd International Conference on Algorithms, Software Engineering and Network Security (ASENS) S. 263 - 267
Hauptverfasser: Luo, Guilan, Chen, Zijie, Zeng, Yongwang, Wang, Long, Wen, Shuzhen, Zhang, Mei
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 21.03.2025
Schlagworte:
A algorithm
Accuracy
Approximation algorithms
ask allocation
Costs
Dynamic scheduling
Heuristic algorithms
Multitasking
Path planning
Resource management
Simulated annealing
Simulated annealing algorithm
Software algorithms
Visibility graph algorithm
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This paper presents a multi-task allocation method integrating the visibility graph, A* algorithm, and simulated annealing to enhance scheduling stability and path accuracy in complex environments. The method constructs a path cost matrix and globally optimizes task sequences. Experimental results show a 2% reduction in path length compared to Euclidean-based methods while improving path planning accuracy, allocation efficiency, and stability, providing a robust solution for dynamic multi-task scheduling.
AbstractList This paper presents a multi-task allocation method integrating the visibility graph, A* algorithm, and simulated annealing to enhance scheduling stability and path accuracy in complex environments. The method constructs a path cost matrix and globally optimizes task sequences. Experimental results show a 2% reduction in path length compared to Euclidean-based methods while improving path planning accuracy, allocation efficiency, and stability, providing a robust solution for dynamic multi-task scheduling.
Author Wang, Long
Chen, Zijie
Wen, Shuzhen
Zhang, Mei
Luo, Guilan
Zeng, Yongwang
Author_xml – sequence: 1
  givenname: Guilan
  surname: Luo
  fullname: Luo, Guilan
  email: yongxin_fly@163.com
  organization: Dali University,School of Mathematics and Computer Science,Dali,China
– sequence: 2
  givenname: Zijie
  surname: Chen
  fullname: Chen, Zijie
  email: 1390523433@qq.com
  organization: Dali University,School of Engineering,Dali,China
– sequence: 3
  givenname: Yongwang
  surname: Zeng
  fullname: Zeng, Yongwang
  email: wasserss@qq.com
  organization: Dali University,School of Engineering,Dali,China
– sequence: 4
  givenname: Long
  surname: Wang
  fullname: Wang, Long
  email: wanglong200044@163.com
  organization: Dali University,School of Engineering,Dali,China
– sequence: 5
  givenname: Shuzhen
  surname: Wen
  fullname: Wen, Shuzhen
  email: flyer_zhenzhen@163.com
  organization: Dali University,School of Mathematics and Computer Science,Dali,China
– sequence: 6
  givenname: Mei
  surname: Zhang
  fullname: Zhang, Mei
  email: meizi108hn@163.com
  organization: Dali University,School of Mathematics and Computer Science,Dali,China
BookMark eNo1kE1LAzEQhiPoQWv_gYf8gG7Nh80mx6XUWmjtYYvXMmaT7mA2W7bpof56U1QYGOZ54YF5H8ht7KMjhHI25ZyZ56pevNfqxRg2FUzMrjAPK2_I2JRGS8lnmRt9T8LmHBIWOzh90dq2rjkHjAe6PSbs8BsS9pFuXGr7hq5icocho5x_4Ak_MWC60OUAx3ZCa-zOAZJraBWjg6tlQiHmk1bh0A-Y2u6R3HkIJzf-2yOye13s5m_Fertczat1gUamAhQoPxNcea2Y1tIL4W3ZaAO6BM25Eh5KL7SwIr-VibXM-sY6IaWyrJEj8vSrRefc_jhgB8Nl_9-B_AFsfFf8
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ASENS64990.2025.11011007
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798331520298
EndPage 267
ExternalDocumentID 11011007
Genre orig-research
GrantInformation_xml – fundername: National Natural Science Foundation of China
  funderid: 10.13039/501100001809
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i93t-a6a6f5216f860883f22fc7d89a87a81162fa7f282c2101a81cc0cfdce2336c0d3
IEDL.DBID RIE
IngestDate Wed Jun 04 06:02:00 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i93t-a6a6f5216f860883f22fc7d89a87a81162fa7f282c2101a81cc0cfdce2336c0d3
PageCount 5
ParticipantIDs ieee_primary_11011007
PublicationCentury 2000
PublicationDate 2025-March-21
PublicationDateYYYYMMDD 2025-03-21
PublicationDate_xml – month: 03
  year: 2025
  text: 2025-March-21
  day: 21
PublicationDecade 2020
PublicationTitle 2025 2nd International Conference on Algorithms, Software Engineering and Network Security (ASENS)
PublicationTitleAbbrev ASENS
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.902251
Snippet This paper presents a multi-task allocation method integrating the visibility graph, A* algorithm, and simulated annealing to enhance scheduling stability and...
SourceID ieee
SourceType Publisher
StartPage 263
SubjectTerms A algorithm
Accuracy
Approximation algorithms
ask allocation
Costs
Dynamic scheduling
Heuristic algorithms
Multitasking
Path planning
Resource management
Simulated annealing
Simulated annealing algorithm
Software algorithms
Visibility graph algorithm
Title Multi-Task Scheduling Optimization Method Integrating Visibility Graph, Simulated Annealing, and A Algorithm
URI https://ieeexplore.ieee.org/document/11011007
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFG6EePCkRoy_04NHBlsHbXckBtREkWSEcCP1tcVFGASGif-9r2VoPHjwtnbLlrymff3W73sfIbfAI3jl3AQgNQtabQ1BohKD012LWMmopb3qffQk-n05HieDUqzutTDGGE8-Mw136c_y9QI27ldZE1OVq3AmKqQiBN-KtXbsnDBpdtJuP-W4hQ8R97F2Y_f4L-MUnzd6h__84hGp_Sjw6OA7txyTPZOfkJlXywZDtX6nKQZbOxb5lL7grJ-Xckr67B2h6WNZBcLdH2UlBfaT3rvy1HWaZnPn2mU07eAyq9xb6lTl2KSd2XSxyoq3eY0Me93h3UNQuiUEWRIXgeKKW8zF3EqOK0dsGbMgtEyUFBjziDOrhEWABQjyIuwBCMFqMCyOOYQ6PiXVfJGbM0ITIzHJIxIDa1uIL1XoPNbbXDPtqunDOam5SE2W23oYk12QLv7ovyQHbjwcc4tFV6RarDbmmuzDR5GtVzd-FL8AL2Wfvg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwGG0UTfSkRoy_7cEjg63buu1IDAgRJskWwo3U_sBFNgwME_97v5ah8eDB29plW_I17de3vvc9hO45dfgLpdLioSCW5wtuRSySMN1F4LLQ8YRRvY8HQRyHk0k0qsTqRgsjpTTkM9nUl-YsXyz4Wv8qa0Gq0hXOgl2053sesTdyrS0_x45a7aQTJxQ28TYgP-I3tw_8sk4xmaN79M9vHqP6jwYPj76zywnakcUpmhu9rJWy1RtOINxC88hn-BnmfV4JKvHQeELjflUHQt8fZxUJ9hM_6gLVDZxkufbtkgK3YaFl-i0NzApo4vZ8tlhm5WteR2m3kz70rMovwcoit7QYZVRBNqYqpLB2uIoQxQMRRiwMIOoOJYoFCiAWB5jnQA_nNleCS-K6lNvCPUO1YlHIc4QjGUKaByzGlfIAYTJbu6z7VBCh6-nzC1TXkZq-bypiTLdBuvyj_w4d9NLhYDrox09X6FCPjeZxEeca1crlWt6gff5RZqvlrRnRL6yDowU
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2025+2nd+International+Conference+on+Algorithms%2C+Software+Engineering+and+Network+Security+%28ASENS%29&rft.atitle=Multi-Task+Scheduling+Optimization+Method+Integrating+Visibility+Graph%2C+Simulated+Annealing%2C+and+A+Algorithm&rft.au=Luo%2C+Guilan&rft.au=Chen%2C+Zijie&rft.au=Zeng%2C+Yongwang&rft.au=Wang%2C+Long&rft.date=2025-03-21&rft.pub=IEEE&rft.spage=263&rft.epage=267&rft_id=info:doi/10.1109%2FASENS64990.2025.11011007&rft.externalDocID=11011007