scholarly journals A Hybrid Simulated Annealing Heuristic for Multistage Heterogeneous Fleet Scheduling with Fleet Sizing Decisions

2019 ◽  
Vol 2019 ◽  
pp. 1-19 ◽  
Author(s):  
Bing Li ◽  
Xinyu Yang ◽  
Hua Xuan
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Initial Solution ◽  
Mixed Integer ◽  
Greedy Heuristic ◽  
Allocation Scheme ◽  
Heterogeneous Fleet ◽  
Fleet Sizing ◽  
Vehicle Allocation

This paper deals with multistage heterogeneous fleet scheduling with fleet sizing decisions (MHFS-FSD). This MHFS-FSD attempts to integrate vehicles allocation and fleet sizing decisions considering the vehicle routing of multiple vehicle types. The problem is formulated as mixed integer programming model. The matrix formulation denoting vehicle allocation scheme is explored according to the characteristic of this problem. Generating vehicle allocation scheme with greedy heuristic procedure (VA-GHP) as initial solution of problem is presented. The USP-IVA method to update the initial solution generated by VA-GHP approach is developed. And then, incorporating VA-GHP and USP-IVA into simulated annealing algorithm, a novel heuristic called HSAH-GHP&IVA is proposed. Finally, some experiments are designed to test the proposed heuristic and the results show that the heuristic can generate reasonably good solutions in short CPU times.

scholarly journals Multi-Manned Assembly Line Balancing: Workforce Synchronization for Big Data Sets through Simulated Annealing

2021 ◽  
Vol 11 (6) ◽  
pp. 2523
Author(s):  
Francesco Pilati ◽  
Emilio Ferrari ◽  
Mauro Gamberi ◽  
Silvia Margelli
Keyword(s):  
Simulated Annealing ◽  
Assembly Line ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Assembly Line Balancing ◽  
Task Assignment ◽  
Computation Time ◽  
Mixed Integer ◽  
Solution Quality ◽  
Line Design

The assembly of large and complex products such as cars, trucks, and white goods typically involves a huge amount of production resources such as workers, pieces of equipment, and layout areas. In this context, multi-manned workstations commonly characterize these assembly lines. The simultaneous operators’ activity in the same assembly station suggests considering compatibility/incompatibility between the different mounting positions, equipment sharing, and worker cooperation. The management of all these aspects significantly increases the balancing problem complexity due to the determination of the start/end times of each task. This paper proposes a new mixed-integer programming model to simultaneously optimize the line efficiency, the line length, and the workload smoothness. A customized procedure based on a simulated annealing algorithm is developed to effectively solve this problem. The aforementioned procedure is applied to the balancing of the real assembly line of European sports car manufacturers distinguished by 665 tasks and numerous synchronization constraints. The experimental results present remarkable performances obtained by the proposed procedure both in terms of solution quality and computation time. The proposed approach is the practical reference for efficient multi-manned assembly line design, task assignment, equipment allocation, and mounting position management in the considered industrial fields.

scholarly journals A Two-Stage Simulated Annealing Algorithm for the Many-to-Many Milk-Run Routing Problem with Pipeline Inventory Cost

2015 ◽  
Vol 2015 ◽  
pp. 1-22 ◽  
Author(s):  
Yu Lin ◽  
Zheyong Bian ◽  
Shujing Sun ◽  
Tianyi Xu
Keyword(s):  
Simulated Annealing ◽  
Heuristic Algorithm ◽  
Simulated Annealing Algorithm ◽  
Greedy Heuristic ◽  
Two Stage ◽  
Satisfactory Solution ◽  
Routing Problem ◽  
Annealing Algorithm ◽  
The Many ◽  
Milk Run

In recent years, logistics systems with multiple suppliers and plants in neighboring regions have been flourishing worldwide. However, high logistics costs remain a problem for such systems due to lack of information sharing and cooperation. This paper proposes an extended mathematical model that minimizes transportation and pipeline inventory costs via the many-to-many Milk-run routing mode. Because the problem is NP hard, a two-stage heuristic algorithm is developed by comprehensively considering its characteristics. More specifically, an initial satisfactory solution is generated in the first stage through a greedy heuristic algorithm to minimize the total number of vehicle service nodes and the best insertion heuristic algorithm to determine each vehicle’s route. Then, a simulated annealing algorithm (SA) with limited search scope is used to improve the initial satisfactory solution. Thirty numerical examples are employed to test the proposed algorithms. The experiment results demonstrate the effectiveness of this algorithm. Further, the superiority of the many-to-many transportation mode over other modes is demonstrated via two case studies.

scholarly journals Research on airport multi-objective optimization of stand allocation based on simulated annealing algorithm

2021 ◽  
Vol 18 (6) ◽  
pp. 8314-8330
Author(s):  
Ningning Zhao ◽  
◽  
Mingming Duan
Keyword(s):  
Mathematical Model ◽  
Simulated Annealing ◽  
Objective Function ◽  
Simulated Annealing Algorithm ◽  
Allocation Scheme ◽  
Multi Objective Optimization ◽  
Practical Application ◽  
Allocation Decision ◽  
Multi Objective ◽  
Annealing Algorithm

<abstract> <p>In this study, a multi-objective optimized mathematical model of stand pre-allocation is constructed with the shortest travel distance for passengers, the lowest cost for airlines and the efficiency of stand usage as the overall objectives. The actual data of 12 flights at Lanzhou Zhongchuan Airport are analyzed by application and solved by simulated annealing algorithm. The results of the study show that the total objective function of the constructed model allocation scheme is reduced by 40.67% compared with the actual allocation scheme of the airport, and the distance traveled by passengers is reduced by a total of 4512 steps, while one stand is saved and the efficiency of stand use is increased by 31%, in addition to the reduction of airline cost by 300 RMB. In summary, the model constructed in the study has a high practical application value and is expected to be used for airport stand pre-allocation decision in the future.</p> </abstract>

scholarly journals A Simulated Annealing Methodology to Multiproduct Capacitated Facility Location with Stochastic Demand

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Jin Qin ◽  
Hui Xiang ◽  
Yong Ye ◽  
Linglin Ni
Keyword(s):  
Simulated Annealing ◽  
Facility Location ◽  
Programming Model ◽  
Transportation Cost ◽  
Mixed Integer ◽  
Optimal Decision ◽  
Location Decision ◽  
Inventory Cost ◽  
Stochastic Demands ◽  
Capacitated Facility Location

A stochastic multiproduct capacitated facility location problem involving a single supplier and multiple customers is investigated. Due to the stochastic demands, a reasonable amount of safety stock must be kept in the facilities to achieve suitable service levels, which results in increased inventory cost. Based on the assumption of normal distributed for all the stochastic demands, a nonlinear mixed-integer programming model is proposed, whose objective is to minimize the total cost, including transportation cost, inventory cost, operation cost, and setup cost. A combined simulated annealing (CSA) algorithm is presented to solve the model, in which the outer layer subalgorithm optimizes the facility location decision and the inner layer subalgorithm optimizes the demand allocation based on the determined facility location decision. The results obtained with this approach shown that the CSA is a robust and practical approach for solving a multiple product problem, which generates the suboptimal facility location decision and inventory policies. Meanwhile, we also found that the transportation cost and the demand deviation have the strongest influence on the optimal decision compared to the others.

Aircraft sequencing and scheduling in TMAs under wind direction uncertainties

2020 ◽  
Vol 124 (1282) ◽  
pp. 1896-1912
Author(s):  
R.K. Cecen ◽  
C. Cetek ◽  
O. Kaya
Keyword(s):  
Stochastic Model ◽  
Wind Direction ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Air Traffic ◽  
Mixed Integer ◽  
Scheduling Problems ◽  
Traffic Demand ◽  
Proposed Model ◽  
Sequencing And Scheduling

ABSTRACTAircraft sequencing and scheduling within terminal airspaces has become more complicated due to increased air traffic demand and airspace complexity. A stochastic mixed-integer linear programming model is proposed to handle aircraft sequencing and scheduling problems using the simulated annealing algorithm. The proposed model allows for proper aircraft sequencing considering wind direction uncertainties, which are critical in the decision-making process. The proposed model aims to minimise total aircraft delay for a runway airport serving mixed operations. To test the stochastic model, an appropriate number of scenarios were generated for different air traffic demand rates. The results indicate that the stochastic model reduces the total aircraft delay considerably when compared with the deterministic approach.

scholarly journals Temporary Workforce Planning with Firm Contracts: A Model and a Simulated Annealing Heuristic

2011 ◽  
Vol 2011 ◽  
pp. 1-18 ◽  
Author(s):  
Muhammad Al-Salamah
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Workforce Planning ◽  
Temporary Employment ◽  
Mixed Integer ◽  
Temporary Workers ◽  
Planning Models ◽  
Training Cost ◽  
Holding Cost ◽  
Temporary Staffing

The aim of this paper is to introduce a model for temporary staffing when temporary employment is managed by firm contracts and to propose a simulated annealing-based method to solve the model. Temporary employment is a policy frequently used to adjust the working hour capacity to fluctuating demand. Temporary workforce planning models have been unnecessarily simplified to account for only periodic hiring and laying off; a company can review its workforce requirement every period and make hire-fire decisions accordingly, usually with a layoff cost. We present a more realistic temporary workforce planning model that assumes a firm contract between the worker and the company, which can extend to several periods. The model assumes the traditional constraints, such as inventory balance constraints, worker availability, and labor hour mix. The costs are the inventory holding cost, training cost of the temporary workers, and the backorder cost. The mixed integer model developed for this case has been found to be difficult to solve even for small problem sizes; therefore, a simulated annealing algorithm is proposed to solve the mixed integer model. The performance of the SA algorithm is compared with the CPLEX solution.

Research on Printed Wiring Boards Manufacture Based on Optimization

2013 ◽  
Vol 312 ◽  
pp. 506-510
Author(s):  
Jiang Ze Hu ◽  
An Ni Peng ◽  
Xin Zhong Lu
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Shortest Path ◽  
Ant Colony Algorithm ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Printed Wiring Boards ◽  
Tool Switching ◽  
Annealing Algorithm ◽  
Better Than

The efficiency E of a punch for making printed wiring boards is decided by its cost and time. The weight of cost and time is different in different companies. In this paper, we establish a bi-object programming model to measure E. We use an algorithm for obtaining an order of tool switching. Considering how to calculate the shortest path for every tool, we compare three modern optimizationalgorithms. We find Ant colony Algorithm is best in computing the shortest path, but it will cost a lot of time in running. Genetic Algorithm is better than Simulated Annealing Algorithm in time and cost. We make some improvements on these algorithms.

scholarly journals A mathematical model and simulated annealing algorithm for solving the cyclic scheduling problem of a flexible robotic cell

2018 ◽  
Vol 10 (1) ◽  
pp. 168781401775391 ◽  
Author(s):  
Mazyar Ghadiri Nejad ◽  
Hüseyin Güden ◽  
Béla Vizvári ◽  
Reza Vatankhah Barenji
Keyword(s):  
Mathematical Model ◽  
Simulated Annealing ◽  
Cycle Time ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Scheduling Problem ◽  
Robotic Cell ◽  
First Case ◽  
Annealing Algorithm ◽  
Flexible Robotic Cell

Flexible robotic cells are used to produce standardized items at a high production speed. In this study, the scheduling problem of a flexible robotic cell is considered. Machines are identical and parallel. In the cell, there is an input and an output buffer, wherein the unprocessed and the finished items are kept, respectively. There is a robot performing the loading/unloading operations of the machines and transporting the items. The system repeats a cycle in its long run. It is assumed that each machine processes one part in each cycle. The cycle time depends on the order of the actions. Therefore, determining the order of the actions to minimize the cycle time is an optimization problem. A new mathematical model is presented to solve the problem, and as an alternative, a simulated annealing algorithm is developed for large-size problems. In the simulated annealing algorithm, the objective function value of a given solution is computed by solving a linear programming model which is the first case in the literature to the best of our knowledge. Several numerical examples are solved using the proposed methods, and their performances are evaluated.

scholarly journals Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints

Mathematics ◽  
2019 ◽  
Vol 7 (7) ◽  
pp. 598 ◽  
Author(s):  
Zhiping Zuo ◽  
Yanhui Li ◽  
Jing Fu ◽  
Jianlin Wu
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Search Algorithm ◽  
Time Windows ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Service Personnel ◽  
The Stability

In situations where an organization has limited human resources and a lack of multi-skilled employees, organizations pay more and more attention to cost control and personnel arrangements. Based on the consideration of the service personnel scheduling as well as the routing arrangement, service personnel of different skills were divided into different types according to their multiple skills. A mathematical programming model was developed to reduce the actual cost of organization. Then, a hybrid meta heuristic that combines a tabu search algorithm with a simulated annealing was designed to solve the problem. This meta heuristic employs several neighborhood search operators and integrates the advantages of both the tabu search algorithm and the simulated annealing algorithm. Finally, the stability and validity of the algorithm were validated by the tests of several kinds of examples.

Sign in / Sign up

Export Citation Format

Share Document