Results 31 to 40 of about 2,693,622 (341)

Nghiên cứu bài toán lập lịch biểu theo hướng tiếp cận mục tiêu, áp dụng cho trường đại học

open access: yesTạp chí Khoa học, 2023
Bài báo trình bày kết quả nghiên cứu về bài toán lập lịch biểu cho trường đại học, một bài toán đòi hỏi phải lập lịch cho nhiều tiết học, các lớp học, các giảng viên và phòng học khác nhau, cùng với nhiều ràng buộc khác như giờ giảng dạy của giảng viên ...
Trần Hải Thanh*, Nguyễn Lan Oanh, Nguyễn Thu Phương, Nguyễn Thị Duyên
doaj   +1 more source

TS2PACK: A Two-Level Tabu Search for the Three-dimensional Bin Packing Problem [PDF]

open access: yes, 2009
Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins. We present a two-level tabu search for this problem.
CRAINIC T. G   +3 more
core   +1 more source

Large-scale timetabling problems with adaptive tabu search

open access: yesJournal of Intelligent Systems, 2022
Timetabling problems are specific types of scheduling problems that deal with assigning certain events to the timeslots. This assigning is subject to certain hard constraints that should be achieved to get a feasible timetable and soft constraints that ...
Awad Fouad H.   +2 more
doaj   +1 more source

Recommendation of Scheduling Tourism Routes using Tabu Search Method (Case Study Bandung)

open access: yesInternational Conference on Computer Science and Computational Intelligence, 2019
In 2019, the Indonesian Ministry of Tourism is in the process of improving the Go Digital program for the industrial era 4.0, where the internet has become one of the ways to determine travel destinations.
M Anranur Uwaisy   +2 more
semanticscholar   +1 more source

A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING

open access: yesStudia Universitatis Babes-Bolyai: Series Informatica, 2020
The adaptive distance between the neighbourhood’s makespans influences the local search to explore the non-investigated areas of the solutions space.
Cristina Elena DODU, Mircea ANCĂU
doaj   +1 more source

A hybridization of granular adaptive tabu search with path relinking for the multi-depot open vehicle routing problem

open access: yesEgyptian Informatics Journal, 2023
The multi-depot open vehicle routing problem (MDOVRP) differs from the classical VRP in that there is more than one depot and the vehicle does not need to return to a depot after serving the last customer. For solving this challenging problem, we propose
Wenhan Shao   +4 more
doaj   +1 more source

Single-machine scheduling with periodic maintenance and learning effect

open access: yesScientific Reports, 2023
This paper discusses a single-machine scheduling problem with periodic maintenance activities and position-based learning effect to minimize the makespan.
Hui Wu, Hongmei Zheng
doaj   +1 more source

A Tabu Search algorithm for the vehicle routing problem with discrete split deliveries and pickups

open access: yesComputers & Operations Research, 2018
The Vehicle Routing Problem with Discrete Split Deliveries and Pickups is a variant of the Vehicle Routing Problem with Split Deliveries and Pickups, in which customers’ demands are discrete in terms of batches (or orders).
M. Qiu, Z. Fu, R. Eglese, Qiong Tang
semanticscholar   +1 more source

Population-Based Redundancy Control in Genetic Algorithms: Enhancing Max-Cut Optimization

open access: yesMathematics
The max-cut problem is a well-known topic in combinatorial optimization, with a wide range of practical applications. Given its NP-hard nature, heuristic approaches—such as genetic algorithms, tabu search, and harmony search—have been extensively ...
Yong-Hyuk Kim   +2 more
doaj   +1 more source

Tabu Search and an Exact Algorithm for the Solutions of Resource-constrained Project Scheduling Problems [PDF]

open access: yesInternational Journal of Computational Intelligence Systems, 2011
When the project is scheduled with a given set of resources, it is difficult to find the optimal solution. Resourceconstrained scheduling problems (RCPSP) are generally NP-hard.
Omer Atli
doaj   +1 more source

Home - About - Disclaimer - Privacy