A two-phase simulated annealing algorithm to minimise the completion time variance of jobs in flowshops

2020 ◽  
Vol 10 (2) ◽  
pp. 261
Author(s):  
S. Thiagarajan ◽  
J. Krishnaraj
Keyword(s):  
Simulated Annealing ◽  
Completion Time ◽  
Simulated Annealing Algorithm ◽  
Two Phase ◽  
Time Variance ◽  
Annealing Algorithm

scholarly journals A two-agent one-machine multitasking scheduling problem solving by exact and metaheuristics

2021 ◽  
Author(s):  
Chin-Chia Wu ◽  
Ameni Azzouz ◽  
Jia-Yang Chen ◽  
Jianyou Xu ◽  
Wei-Lun Shen ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Completion Time ◽  
Simulated Annealing Algorithm ◽  
Optimal Schedule ◽  
Computational Studies ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Large Size ◽  
Annealing Algorithm ◽  
One Machine

AbstractThis paper studies a single-machine multitasking scheduling problem together with two-agent consideration. The objective is to look for an optimal schedule to minimize the total tardiness of one agent subject to the total completion time of another agent has an upper bound. For this problem, a branch-and-bound method equipped with several dominant properties and a lower bound is exploited to search optimal solutions for small size jobs. Three metaheuristics, cloud simulated annealing algorithm, genetic algorithm, and simulated annealing algorithm, each with three improvement ways, are proposed to find the near-optimal solutions for large size jobs. The computational studies, experiments, are provided to evaluate the capabilities for the proposed algorithms. Finally, statistical analysis methods are applied to compare the performances of these algorithms.

scholarly journals A Simulated Annealing Algorithm for Solving Two-Echelon Vehicle Routing Problem with Locker Facilities

Algorithms ◽  
2020 ◽  
Vol 13 (9) ◽  
pp. 218
Author(s):  
A. A. N. Perwira Redi ◽  
Parida Jewpanya ◽  
Adji Candra Kurniawan ◽  
Satria Fadil Persada ◽  
Reny Nadlifatin ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Simulated Annealing Algorithm ◽  
Two Phase ◽  
Routing Problem ◽  
Intermediate Facilities ◽  
Annealing Algorithm ◽  
Phase Optimization ◽  
The Cost

We consider the problem of utilizing the parcel locker network for the logistics solution in the metropolitan area. Two-echelon distribution systems are attractive from an economic standpoint, whereas the product from the depot can be distributed from or to intermediate facilities. In this case, the intermediate facilities are considered as locker facilities present in an accessible location in the vicinity of the final customers. In addition, the utilization of locker facilities can reduce the cost caused by the unattended deliveries. The problem is addressed as an optimization model that formulated into an integer linear programming model denoted as the two-echelon vehicle routing problem with locker facilities (2EVRP-LF). The objective is to minimize the cost of transportation with regards to the vehicle travelling cost, the intermediate facilities renting cost, and the additional cost to compensate the customer that needs to travel to access the intermediate facilities. Because of its complexity, a simulated annealing algorithm is proposed to solve the problem. On the other hand, the modelling approach can be conducted by generating two-phase optimization model approaches, which are the p-median problem and the capacitated vehicle routing problem. The results from both methods are compared in numerical experiments. The results show the effectiveness of 2EVRP-LF compared to the two-phase optimization. Furthermore, the simulated annealing algorithm showed an effective performance in solving 2EVRP-LF.

Sign in / Sign up

Export Citation Format

Share Document