A survey of simulated annealing applications to operations research problems

Koulamas, Christos; Antony, SR; Jaen, Ruben D.

doi:10.1016/0305-0483(94)90006-x

Cited by 183 publications

(78 citation statements)

References 66 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The important parameters of SA are an initial value of temperature, a cooling function, a number of neighbors to be searched at each temperature (to reach equilibrium state) and a stopping criterion to terminate the algorithm [26]. The linear cooling as a cooling function and the termination condition is reaching to the final temperature are considered to this study.…”

Section: Proposed Algorithmmentioning

confidence: 99%

Pricing and advertising decisions in a dominant-retailer supply chain: A multi-follower bi-level programming approach

Mokhlesian

Zegordi

2017

Scientia Iranica

View full text Add to dashboard Cite

Pricing and advertising is one of the most important decisions in each supply chain especially in the competitive environment. In the previous studies, this is as a centralized decision. However, if each channel member makes its decision independently, the utility of all members is optimized. In such decentralized situations, the channel members may have different market power that they influence on the other members' decisions. These issues can modeled through leader-follower Stackelberg game or bi-level programming. This study investigates coordination of pricing and cooperative advertising in a two-stage supply chain consisting of one dominant-retailer and multiple competitive manufactures which produce several perishable and substitutable products. This paper aims to determine pricing and cooperative advertising decisions expenditure as well as the amount of manufacturers' production or retailer's purchase such that utility of all members is met. Hence, the problem is modeled as a multifollower bi-level programming problem. Since it is proved that the model is NP-hard, the proposed model is solved

show abstract

Section: Proposed Algorithmmentioning

confidence: 99%

Pricing and advertising decisions in a dominant-retailer supply chain: A multi-follower bi-level programming approach

Mokhlesian

Zegordi

2017

Scientia Iranica

View full text Add to dashboard Cite

show abstract

“…Researchers have been studying the application of the SA algorithm in various fields of optimization. Koulamas [11] presented a survey of operational research problems in which the heuristic was applied. The effectives of the algorithm was also inspected in particular by Hurkała and Hurkała [5], [6], and also Hurkała andŚliwiński [7].…”

Section: A Simulated Annealingmentioning

confidence: 99%

Time-Dependent Traveling Salesman Problem with Multiple Time Windows

Hurkala

2015

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-The TSP, VRP and OP problems with time constraints have one common sub-problem -the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows. Moreover, since the assumption of constant travel time between two locations at all times is very unrealistic, problems with time-dependent travel were introduced and studied. Finally, it is also possible to imagine some situations, in which the service time changes during the day. Again, both issues have been investigated only in conjunction with single time windows. In this paper we propose a novel algorithm for computing minimum route duration in traveling salesman problem with multiple time windows and time-dependent travel and service time. The algorithm can be applied to wide range of problems in which a traveler has to visit a set of customers or locations within specified time windows taking into account the traffic and variable service/visit time. Furthermore, we compare three metaheuristics for computing a one-day schedule for this problem, and show that it can be solved very efficiently.

show abstract

“…While mass small deformations might be considered as local optimum, global solution constitutes an ideal crystal. Initially was simulated annealing applied primarily to operations research tasks (Heragu and Alfa, 1992;Koulamas et al 1994;Souilah, 1995;Van Breedam, 1995), but since then it has been intensively used in finance (Crama and Schyns, 2003;Luo et al 2014;Zarandi et al 2013), or medicine (Albrecht et al 2001;Jacob et al 2008). …”

Section: Figure 1 -Perfect Crystal With Minimum Energymentioning

confidence: 99%

Medical Staff Scheduling Using Simulated Annealing

2015

View full text Add to dashboard Cite

Purpose: The efficiency of medical staff is a fundamental feature of healthcare facilities quality. Therefore the better implementation of their preferences into the scheduling problem might not only rise the work-life balance of doctors and nurses, but also may result into better patient care. This paper focuses on optimization of medical staff preferences considering the scheduling problem. Methodology/Approach:We propose a medical staff scheduling algorithm based on simulated annealing, a well-known method from statistical thermodynamics. We define hard constraints, which are linked to legal and working regulations, and minimize the violations of soft constraints, which are related to the quality of work, psychic, and work-life balance of staff.Findings: On a sample of 60 physicians and nurses from gynecology department we generated monthly schedules and optimized their preferences in terms of soft constraints. Our results indicate that the final value of objective function optimized by proposed algorithm is more than 18-times better in violations of soft constraints than initially generated random schedule that satisfied hard constraints.Research Limitation/implication: Even though the global optimality of final outcome is not guaranteed, desirable solutionwas obtained in reasonable time.Originality/Value of paper: We show that designed algorithm is able to successfully generate schedules regarding hard and soft constraints. Moreover, presented method is significantly faster than standard schedule generation and is able to effectively reschedule due to the local neighborhood search characteristics of simulated annealing.

show abstract

A survey of simulated annealing applications to operations research problems

Cited by 183 publications

References 66 publications

Pricing and advertising decisions in a dominant-retailer supply chain: A multi-follower bi-level programming approach

Pricing and advertising decisions in a dominant-retailer supply chain: A multi-follower bi-level programming approach

Time-Dependent Traveling Salesman Problem with Multiple Time Windows

Medical Staff Scheduling Using Simulated Annealing

Contact Info

Product

Resources

About