The multiple Traveling Salesmen Problem (mTSP) is a general extension of the famous NP-hard (TSP), that there are m (m>1) salesmen to visit cities. In this paper, we address mTSP with both minsum objective and minmax objective, which aims at minimizing total length tours longest tour among all tours, respectively. We propose an iterated two-stage heuristic algorithm called ITSHA for mTSP. Each ...

This paper addresses to the Cell Formation Problem (CFP) in which Automated Guided Vehicles (AGVs) have been employed to transfer the jobs which may need to visit one or more cells. Because of added constraints to problem such as AGVs’ conflict and excessive cessation on one place, it is possible that AGVs select the different paths from one cell to another over the time. This means that the ti...

This study considers instant decision-making needs of the automobile manufactures for resequencing vehicles before final assembly (FA). We propose a rule-based two-stage stochastic model to determine the number of spare vehicles that should be kept in the pre-assembly buffer to restore the altered sequence due to paint defects and upstream department constraints. First stage of the model decide...

In this paper we present a local search heuristic method for an integrated airline scheduling, fleeting and pricing model. The integrated model simultaneously optimizes the decisions of schedule design, fleet assignment, seat allocation, pricing and considers passengers’ spill and recapture. The resulting problem is a mixed integer non-convex problem due to the explicit representation of a dema...

this article presents the application of two algorithms: heuristic big bang-big crunch (hbb-bc) and a heuristic particle swarm ant colony optimization (hpsaco) to discrete optimization of reinforced concrete planar frames subject to combinations of gravity and lateral loads based on aci 318-08 code. the objective function is the total cost of the frame which includes the cost of concrete, formw...

A two-stage inventory system is considered where Poisson demand occurs at Stage 1, and Stage 1 replenishes its inventory from Stage 2, which in turn orders from an outside supplier with unlimited stock. Each shipment, either to Stage 2 or to Stage 1, incurs a fixed setup cost. Under the assumption that the supply leadtime at Stage 2 is zero, we characterize a simple heuristic policy whose long-...