A Multiple-Neighborhood-Based Parallel Composite Local Search Algorithm for Timetable Problem

被引:0
|
作者
颜鹤
郁松年
机构
[1] Shanghai University
[2] P.R. China
[3] School of Computer Engineering and Science
[4] Shanghai 200072
关键词
multiple neighborhoods; parallel; composite local search algorithm; timetable problem;
D O I
暂无
中图分类号
TP301.6 [算法理论];
学科分类号
081202 ;
摘要
This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can be solved by general local search algorithms. Experimental results show that the new algorithm can generate better solutions than general local search algorithms.
引用
收藏
页码:301 / 308
页数:8
相关论文
共 50 条
  • [1] A neighborhood search algorithm for the unrelated parallel machine scheduling problem
    Zhan, Y.
    Zhong, Y. G.
    [J]. CIVIL, ARCHITECTURE AND ENVIRONMENTAL ENGINEERING, VOLS 1 AND 2, 2017, : 1589 - 1592
  • [2] A fast local search based memetic algorithm for the parallel row ordering problem
    Palubeckis, Gintaras
    [J]. Applied Mathematics and Computation, 2025, 486
  • [3] Adaptive Local Search Approach for the Timetable Scheduling Problem
    Hadjidj, Drifa
    Hadjidj, Rachid
    Drias, Habiba
    [J]. 2017 5TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING - BOUMERDES (ICEE-B), 2017,
  • [4] An Iterative Neighborhood Local Search Algorithm for Capacitated Centered Clustering Problem
    Xu, Yuying
    Guo, Ping
    Zeng, Yi
    [J]. IEEE ACCESS, 2022, 10 : 34497 - 34510
  • [5] Composite Algorithm Based on Clarke - Wright and Local Search for the Traveling Salesman Problem
    Komarudin
    Parhusip, Sandiego F.
    [J]. 2019 5TH INTERNATIONAL CONFERENCE ON INDUSTRIAL AND BUSINESS ENGINEERING (ICIBE 2019), 2019, : 87 - 90
  • [6] A multiple-neighborhoods-based simulated annealing algorithm for Timetable Problem
    Yan, H
    Yu, SN
    [J]. GRID AND COOPERATIVE COMPUTING, PT 2, 2004, 3033 : 474 - 481
  • [7] A parallel local search algorithm for Euclidean Steiner tree problem
    Bin Muhammad, Rashid
    [J]. SNPD 2006: Seventh ACIS International Conference on Software Engineering Artificial Intelligence, Networking, and Parallel/Distributed Computing, Proceedings, 2006, : 157 - 162
  • [8] A Memetic Algorithm for the Quadratic Assignment Problem with Parallel Local Search
    Harris, Matthew
    Berretta, Regina
    Inostroza-Ponta, Mario
    Moscato, Pablo
    [J]. 2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 838 - 845
  • [9] A reverse search algorithm for the neighborhood problem
    Filippi, C
    [J]. OPERATIONS RESEARCH LETTERS, 1999, 25 (01) : 33 - 37
  • [10] Smart General Variable Neighborhood Search with Local Search based on Mathematical Programming for Solving the Unrelated Parallel Machine Scheduling Problem
    Rego, Marcelo Ferreira
    Freitas Souza, Marcone Jamilson
    [J]. PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS (ICEIS), VOL 1, 2019, : 287 - 295