a shortest path problem is a practical issue in networks for real-world situations. this paper addresses the fuzzy shortest path (fsp) problem to obtain the best fuzzy path among fuzzy paths sets. for this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (ifss) in order to determine the fuzzy shortest path. moreover, this algorithm is developed for ...

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

We investigate if consequential angular momentum losses (CAML) or an intrinsic deformation of the donor star in CVs could increase the CV bounce period from the canonical theoretical value ∼ 65 min to the observed value P min ≈ 77 min, and if a variation of these effects in a CV population could wash out the theoretically predicted accumulation of systems near the minimum period (the period spi...

We use twisted sheaves and their moduli spaces to study the Brauer group of a scheme. In particular, we (1) show how twisted methods can be efficiently used to re-prove the basic facts about the Brauer group and cohomological Brauer group (including Gabber’s theorem that they coincide for a separated union of two affine schemes), (2) give a new proof of de Jong’s periodindex theorem for surface...

This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives are to minimize total travel costs and customer waiting, and to balance the daily workload over the planning hor...

In the 2-period Balanced Traveling Salesman Problem (2B-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days); moreover, the number of customers visited in every tour must be ‘balanced’, i.e. it must be the same or, alternatively, the difference between the maximum and the minimum number of visited customer...

In this paper, a multi-period assignment problem is studied that arises as part of a weekly planning problem at mail processing and distribution centers. These facilities contain a wide variety of automation equipment that is used to cancel, sort, and sequence the mail. The input to the problem is an equipment schedule that indicates the number of machines required for each job or operation dur...