Abstract: This paper proposes the cuckoo search (CS), central force optimization (CFO), chemical reaction optimization (CRO) and 3-Opt for solving the capacitated vehicle routing problem (CVRP). HCSCROCFO-3Opt, which is the parallel hybrid algorithm that is proposed, is a form of augmented HCSCROCFO with a local search process founded on CS that utilizes positive aspects of the other optimization approaches including CRO and CFO in order to enhance quality of initial population and improve local search, correspondingly. The work is motivated by the need to enhance the computational effectiveness through attainment of improved outcomes compared to previous popular solutions, to explore the features of different parameters of to seek some ideal solutions. The first stage entails solving of CVRP through setting a variety of values to tune parameters for the HCSCROCFO-3Opt proposed. Then initialization of algorithm CS, CRO, CFO parameters are accomplished through tuning parameters within a tuning cycle. Subsequently, a novel solution is swapped in a random manner through a levy flight within the central loop, followed by execution of the hybrid solution as well as new CRO, CFO and CS algorithm solutions, whose implementation is supposed to enhance results for the local 3-Opt. Ultimately, the most ideal solution for general hybrid model’s solution space is identified, after which the solution that is best-suited for the CVRP purposes is presented. Within the standard CVRP cases, reported computational tests in large scale in the literature demonstrate the efficiency of presented approach.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: This study explores the optimal fabrication runtime for a buyer-vendor incorporated system featuring repairable items, stochastic breakdown, accelerated rate, and multi-delivery strategy. Operating in today’s competitive global market, transnational production firms make every effort to meet client requirements in terms of the due date and quality goods. Further, they also must handle all inevitable events incurred in the manufacturing process, such as unanticipated equipment breakdowns and defective products, with caution to avoid production schedule delay and cost overrun. To examine such a vendor-buyer incorporated system, we build a model to characterize the aforementioned features in the system. The function of total system cost is derived through formulation and analyses. The optimization method and a recursive algorithm are employed to help in deriving the optimal (i.e., cost minimization) fabrication runtime for our problem. An example numerically illustrates how our model, method, and algorithm work. It also reveals the capability of our model in analyzing the impact of each and/or joint feature(s) (e.g., the breakdown, accelerated rate, rework, multi-delivery strategy) on the system’s utilization, optimal runtime, total expenses, and individual cost contributor to assist in managerial decision making, and hence, enabling the firm to gain competitive advantage.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: This study develops a postponement model for the multi-item replenishment decision featuring commonality, an overtime strategy, and product quality reassurance. A single machine is used to meet the steady demand for multiple products wherein product commonality exists among these end products. The proposed postponement model assumes that all pertinent common parts are fabricated in Stage 1 and the finished products are sequentially fabricated in Stage 2. Random nonconformance rates are associated with both fabrication stages, the repairable nonconforming common parts are separated from scrap, and reworking in each cycle helps ensure product quality for each completed batch. An overtime strategy is used to reduce the lengthy fabrication and rework times for common parts. Mathematical analyses and derivation allow us to obtain the total system costs. The optimization method helps find the optimal replenishment decision. We provide a numerical illustration to show (1) how our model works; (2) the individual impact of the system features (e.g., the overtime factor, commonality in terms of the common part completion rate and its relative value, and the issues pertaining to scrap/rework) on the optimal decision, utilization, and the total system cost; and (3) the collective influence of system features on the highlighted problem. This proposed decision-support model helps production managers achieve the operating goals of lowering total system expenses and cutting the length of the production cycle.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: Transportation planning in forest industry is a challenging activity since it involves complex decisions about raw material allocation, vehicle routing and scheduling of trucks arrivals to both harvest areas and the plants. In the Argentine context, specifically in the Argentinean Northeast (NEA) region, the forest industry plays essential role for the economic development and, among the included activities, the transportation is the key element considering the volumes that must be moved and the distances to be traveled. Therefore, enhancing efficiency in the transportation activity improves significantly the performance of this industry. In this work, a Mixed Integer Linear Programming (MILP) model is presented, where raw material allocation, vehicle routing and scheduling of trucks arrivals are simultaneously addressed. Since the resolution times of the proposed integrated MILP model are prohibitive for large instances, a hierarchical approach is also presented. The considered decomposition approach involves two stages: in the first phase, the raw material allocation and vehicle routing problems are solved through a MILP model, while in the second phase, fixing the route for each truck according to the results of the previous step, the scheduling of truck arrivals to both the harvest areas and the plants is solved through a new MILP model. The obtained results show that the proposed approach is very effective and could be easily applied in this industry.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: Capacitated Vehicle Routing Problem (CVRP) is considered as one of the most famous specialized forms of VRP that has attracted considerable attention from researchers. This problem belongs to complex combinatorial optimization problems included in the NP-Hard Problem category, which is a problem that needs difficult computation. This paper presents an improvement of Ant Colony System (ACS) to solve this problem. In this study, the problem deals with a few vehicles which are used for transporting products to specific places. Each vehicle starts from a main location at different times every day. The capacitated vehicle routing problem (CVRP) is defined to serve a group of delivery customers with known demands. The proposed study seeks to find the best solution of CVRP by using improvement ACS with the accompanying targets: (1) To decrease the distance as long distances negatively affect the course of the process since it consumes a great time to visit all customers. (2) To implement the improvement of ACS algorithm on new data from the database of CVRP. Through the implementation of the proposed algorithm better results were obtained from the results of other methods and the results were compared.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: Maximising the patient flows throughout the emergency care patient pathway is one of the most important objectives in the healthcare system. The emergency department (ED) is the critical point of this pathway in most hospitals, as the potential delays reduce the number of patients seen in the recommended time. One of the key delays in the ED is the waiting time of a patient prior to treatment, which can be reduced by optimising the patient treatment schedules with priorities. In this paper, a novel blocking patient flow (BPF) algorithm is developed and tested using the real data from a hospital in Brisbane, Australia. Initially, a simulation model of real-life ED operations is developed by characterising patient interarrival and treatment times according to different disease categories. Subsequently, a BPF heuristic algorithm is designed and benchmarked via computational experiments using two dominance rules: first come first served (FCFS) and shortest processing time (SPT). The computational results show that the proposed approach leads to a reduction of the total waiting time by more than 8 % in comparison to the current hospital practice, which implies that more patients will be served in a specified time window.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: In this paper a mixed-integer linear programming (MILP) model is developed to be used as a decision support tool for the chemical company Perstorp Oxo AB. The intention with the mathematical model is to maximize the profit and the model can be used in the process of planning the supply chain for the company. Perstorp Oxo is classified as a global company in the process industry and is has production sites in Gent, Castellanza, Stenungsund and Perstorp. The site in Stenungsund is in focus in this paper. The company produces chemicals that later are used for example in textiles, plastic and glass production. Perstorp Oxo also uses inventories in other countries for enabling the selling abroad. It has two larger inventories in Antwerp and in Tees and two smaller in Philadelphia and in Aveiro. The larger facilities store five different products and the smaller take care of one type each. To be able to find feasible and profitable production plans for the company we have developed and implemented rolling horizon techniques for a time horizon of one year and used real sales data. The outcomes from the model show the transportation of products between different production sites, the different production rates, the levels of inventory, setups and purchases from external suppliers. The numerical results are promising and we conclude that a decision support tool based on an optimization model could improve the situation for the planners at Perstorp Oxo AB.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: Autocorrelation and measurement errors have a negative effect on the performance of any monitoring scheme; therefore, more efficient monitoring schemes are required to monitor such special processes. Hence, in this paper, the use of improved synthetic and runs-rules X̅ schemes with an embedded variable sample size and sampling interval (VSSI) approach to efficiently monitor the mean of a process under the combined effect of autocorrelation and measurement errors is proposed. These new monitoring schemes incorporate a linearly covariate error model with a constant standard deviation and a first-order autoregressive model to the variability of this special process in order to account for measurement errors and autocorrelation, respectively. Moreover, in order to evaluate the zero- and steady-state run-length properties of the proposed monitoring schemes, a dedicated Markov chain matrix that takes into account the following is constructed: (i) VSSI approach, (ii) improved charting regions design of the synthetic and runs-rules X̅ schemes, and (iii) the combined effect of autocorrelation and measurement errors. Also, the probability elements of the Markov chain matrix incorporate two special sampling methods that aid in the reduction of the negative effect of autocorrelation and measurement errors. A real life example is given to illustrate the implementation of the proposed monitoring schemes.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: The set covering problem is to find the minimum cardinality set of locations to site the facilities which cover all of the demand points in the network. In this classical problem, it is assumed that the potential facility locations and the demand points are limited to the set of vertices. Although this problem has some applications, there are some covering problems in which the facilities can be located along the edges and the demand exists on the edges, too. For instance, in the public service environment the demand (population) is distributed along the streets. In addition, in many applications (like bus stops), the facilities are not limited to be located at the vertices (intersections), rather they are allowed to be located along the edges (streets). For the first time, this paper develops a novel integer programming formulation for the set covering problem wherein the demand and facility locations lie continuously along the edges. In order to find good solutions in a reasonable time, a matheuristic algorithm is developed which iteratively adds dummy vertices along the edges and solves a simpler problem which does not allow non-nodal facility locations. Finally, a Benders decomposition reformulation of the problem is developed and the lower bounds generated by the Benders algorithm are used to evaluate the quality of the heuristic solutions. Numerical results show that the Benders lower bounds are tight and the matheuristic algorithm generates good quality solutions in short time.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: After three decades of its introduction, the dynamic vehicle routing problem (DVRP) remains a fertile field for new studies. The technological evolution, which continues to progress day by day, has allowed better communication between different actors of this model and a more encouraging execution time. This encouraged researchers to investigate new variants of the DVRP and use more complicated algorithms for the resolution. Among these variants is the multi-tour DVRP (MTDVRP) with overtime (MTDVRPOT), which is the subject of this article. This paper proposes an approach with a memetic algorithm (MA). The results obtained in this study are better than those of the ant colony system (ACS) applied to the same problem and published in an earlier paper.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)