This work presents a study on the general case of the Common Due-Date scheduling problem (CDD). The CDD is a problem of scheduling and sequencing a certain number of jobs with different processing times on a single ma...
详细信息
ISBN:
(纸本)9781479979813
This work presents a study on the general case of the Common Due-Date scheduling problem (CDD). The CDD is a problem of scheduling and sequencing a certain number of jobs with different processing times on a single machine against a common due-date. The objective of the problem is to minimize the total penalty incurred due to earliness or tardiness of the jobs. This work presents a novel property for the CDD which implies that in any given job sequence (also the optimal job sequence) of the CDD the position of the due-date is independent to the processing times of the jobs. Thereafter, we put forward an exact polynomial algorithm to optimize a given job sequence with a run-time complexity of O(n), where n is the number of jobs. Henceforth, we implement our polynomial algorithm in conjunction with a modifiedsimulatedannealing (SA) algorithm to obtain the optimal or best job sequence. The effectiveness of our approach is evident from our results for the benchmark instances provided in the OR-library.
Global path planning for mobile robot using simulatedannealingalgorithm is investigated in this paper. In view of the slow convergence speed of the conventional simulatedannealingalgorithm, a modifiedsimulated an...
详细信息
ISBN:
(纸本)9781605583266
Global path planning for mobile robot using simulatedannealingalgorithm is investigated in this paper. In view of the slow convergence speed of the conventional simulatedannealingalgorithm, a modified simulated annealing algorithm is presented, and a hybrid algorithm based on the modified simulated annealing algorithm and conjugate direction method is proposed. On each temperature, conjugate direction method is utilized for searching local optimal solution firstly, then the modified simulated annealing algorithm is employed to move off local optimal solution, and then the temperature is updated;these operations are repeated until a termination criterion is satisfied. Experimental results indicate that the proposed algorithm has better performance than simulatedannealingalgorithm and conjugate direction method in term of both solution quality and computational time, and thus it is a viable approach to mobile robot global path planning.
A modified simulated annealing algorithm (MSAA) is proposed as combinatorial multivariable optimisation technique to design discrete frequency-coding (DFC) sequence sets with good auto- and cross-correlation propertie...
详细信息
A modified simulated annealing algorithm (MSAA) is proposed as combinatorial multivariable optimisation technique to design discrete frequency-coding (DFC) sequence sets with good auto- and cross-correlation properties. The proposed algorithm is a combination of simulatedannealing and Hamming scan algorithm. MSAA has global minimum estimation capability of simulatedannealing and fast convergence rate of Hamming scan algorithm. Some of the synthesised results are presented, the properties of the sequence sets are shown to be better than the other sequence sets known in the literature. Synthesised DFC sequence sets have properties far better than polyphase sequence sets. The synthesised DFC sequence sets are promising for practical application to netted radar/multiple radar systems.
暂无评论