This paper presents a methodology for solving the Periodic Vehicle Routing Problem (PVRP). Customer locations each with a certain daily demand are known, as well as the capacity of vehicles. In this work, the problem is solved by means of a two-phase heuristic. The first phase is the itinerary assignment to visit each customer, and in the second phase the routing is done for each day of the iti...

This paper presents the development of a novel vehicle-routing-based algorithm for optimizing component pick-up and placement on a collect-and-place type machine in printed circuit board manufacturing. We present a two-phase heuristic that produces solutions of remarkable quality with respect to other known approaches in a reasonable amount of computational time. In the first phase, a construct...

Abstract This study jointly optimizes the production capacity and safety stocks in a serial production–distribution system supplying multiple products under guaranteed service approach (GSA). The network comprises one manufacturer operating workcenters, warehouse with limited storage capacity, retailer. must efficiently allocate to workcenters budget, while retailer need maintain achieve target...

This work considers the strategic Supply Chain Network Design (SCND) problem, which is to define number and location of facilities, flow products among them fulfilling a long-term deterministic demand. A two-phase heuristic approach was specially developed solve large scale problems in reasonable time, extending previous algorithm introduced Farias et al. (2017). In construction phase, multi-st...

Here, a mixed-integer linear programming model is developed to represent transportation system of students traveling from/to university campus. The concept ridesharing used and the mechanism combinatorial auctions incorporated within routing-based model. mathematical based on vehicle routing problem along with appropriate constraints accommodating features that express auction clearing phase. A...

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique...

In this paper, we deal with the task of building a dynamic ensemble of chain classifiers for multi-label classification. To do so, we proposed two concepts of classifier chains algorithms that are able to change label order of the chain without rebuilding the entire model. Such modes allows anticipating the instance-specific chain order without a significant increase in computational burden. Th...