Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints and reliability limits, make it a combinatorial problem which should be solved by optimization algorithms. This paper presents a new hybrid simulated annealing and tabu search algorithm for distribution network expan...

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...

Hydrodynamic reductions of the hydrodynamic chain associated with dispersionless limit of 2+1 Harry Dym equation are found by the Miura type and reciprocal transformations applied to the Benney hydrodynamic chain.

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

some algorithms for nding common xed point of a family of mappings isconstructed. indeed, let c be a nonempty closed convex subset of a uniformlyconvex banach space x whose norm is gateaux dierentiable and let {tn} bea family of self-mappings on c such that the set of all common fixed pointsof {tn} is nonempty. we construct a sequence {xn} generated by the hybridmethod and also we give the ...