The Economic Lot Scheduling Problem (ELSP) has been well-researched for more than 40 years. As the ELSP has been generally seen as NP-hard, researchers have focused on the development of efficient heuristic approaches. In this paper, we consider the time-varying lot size approach to solve the ELSP. A computational study of the existing solution algorithms, Dobson’s heuristic, Hybrid Genetic alg...

This paper presents an investigation of two search techniques, tabu search (TS) and simulated annealing (SA), to assess their relative merits when applied to engineering design optimisation. Design optimisation problems are generally characterised as having multi-modal search spaces and discontinuities making global optimisation techniques beneficial. Both techniques claim to be capable of loca...

Recently, the use of the particle swarm optimization (PSO) technique for the reconstruction of microwave images has received increasing interest from the optimization community due to its simplicity in implementation and its inexpensive computational overhead. However, the basic PSO algorithm is easily trapping into local minimum and may lead to the premature convergence. When a local optimal s...

The Balanced Academic Curriculum Problem (BACP) consists in assigning courses to teaching periods satisfying prerequisites and balancing students’ load. BACP is included in CSPlib along with three benchmark instances. However, the BACP formulation in CSPLib is actually simpler than the real problem that, in general, universities have to solve in practice. In this paper, we propose a generalized...

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...

The paper presents two heuristics for hardwarelsoftware partitioning of system level spec@cations. The main objective is to achieve pedormance optimization with a limited hardware and software cost. We consider minimization of communication cost and improvement of the overall parallelism as essential criteria. One ofthe heuristics is based on simulated annealing and the other on tabu search. Ex...

A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. The 3-opt, simulated annealing, tabu search and ant algorithms to solve the delivery problem are discussed.

This paper presents an algorithm for solving optimal power flow problem through the application of Differential Evolution (DE). The objective is to minimize the total fuel cost of thermal generating units having quadratic cost characteristics subjected to limits on generator real and reactive power outputs, bus voltages, transformer taps and power flow of transmission lines. The proposed method...