A vehicle routing problem with time windows (VRPTW) is an important problem with many real applications in a transportation problem. The optimum set of routes with the minimum distance and vehicles used is determined to deliver goods from a central depot, using a vehicle with capacity constraint. In the real cases, there are other objective functions that should be considered. This paper considers not only the minimum distance and the number of vehicles used as the objective function, the customer’s satisfaction with the priority of customers is also considered. Additionally, it presents a new model for a bi-objective VRPTW solved by a revised multi-choice goal programming approach, in which the decision maker determines optimistic aspiration levels for each objective function. Two meta-heuristic methods, namely simulated annealing (SA) and genetic algorithm (GA), are proposed to solve large-sized problems. Moreover, the experimental design is used to tune the parameters of the proposed algorithms. The presented model is verified by a real-world case study and a number of test problems. The computational results verify the efficiency of the proposed SA and GA.

It is very important to manage and control projects with the consideration of the triple constraints; namely time, cost and scope. It is also extremely important to manage the scope and all the procurements needed to complete any project. During the project’s lifecycle many changes take place, either positively or negatively, which should be controlled. If the changes are not controlled we may have scope creep that has negative effect on the project. It is commonly considered a negative incident, and thus, should be kept away from the project. By considering this concept, in this paper, we discuss scope change and managing scope and fuzzy analytical hierarchy process is used in selecting the best strategy to manage scope change in projects.

In this paper, we present a new Imperialist Competitive Algorithm (ICA) to solve a bi-objective unrelated parallel machine scheduling problem where setup times are sequence dependent. The objectives include mean completion time of jobs and mean squares of deviations from machines workload from their averages. The performance of the proposed ICA (PICA) method is examined using some randomly generated data and they are compared with three alternative methods including particle swarm optimization (PSO), original version of imperialist competitive algorithm (OICA) and genetic algorithm (GA) in terms of the objective function values. The preliminary results indicate that the proposed study outperforms other alternative methods. In addition, while OICA performs the worst as alternative solution strategy, PSO and GA seem to perform better.

Cross docking play an important role in management of supply chains where items delivered to a warehouse by inbound trucks are directly sorted out, reorganized based on customer demands, routed and loaded into outbound trucks for delivery to customers without virtually keeping them at the warehouse. If any item is held in storage, it is usually for a short time, which is normally less than 24 hours. The proposed model of this paper considers a special case of cross docking where there is temporary storage and uses GRASP technique to solve the resulted problem for some realistic test problems. In our method, we first use some heuristics as initial solutions and then improve the final solution using GRASP method. The preliminary test results indicate that the GRASP method performs better than alternative solution strategies.

Customers are believed to be the main part of any organization’s assets and customer retention as well as customer churn management are important responsibilities of organizations. In today’s competitive environment, organization must do their best to retain their existing customers since attracting new customers cost significantly more than taking care of existing ones. In this paper, we present a hybrid method based on neural network and Cox regression analysis where neural network is used for outlier data and Cox regression method is implemented for prediction of future events. The proposed model of this paper has been implemented on some data and the results are compared based on five criteria including prediction accuracy, errors’ type I and II, root mean square error and mean absolute deviation. The preliminary results indicate that the proposed model of this paper performs better than alternative methods.

In this paper, we study no-wait flow shop problem where setup times depend on sequence of operations. The proposed problem considers sequence-independent removal times, release date with an additional assumption that there are some preliminary setup times. There are two objectives of weighted mean tardiness and makespan associated with the proposed model of this paper. We formulate the resulted problem as a mixed integer programming, where a two-phase fuzzy programming is implemented to solve the model. To examine the performance of the proposed model, we generate several sample data, randomly and compare the results with other methods. The preliminary results indicate that the proposed two-phase model of this paper performed relatively better than Zimmerman & apos; s single-phase fuzzy method.

In this paper, we study a supply chain problem where a whole seller/producer distributes goods among different retailers. Such problems are always faces with uncertainty with input data and we have to use various techniques to handle the uncertainty. The proposed model of this paper considers different input parameters such as demand, capacity and cost in trapezoid fuzzy forms and using two ranking methods, we handle the uncertainty. The results of the proposed model of this paper have been compared with the crisp and other existing fuzzy techniques using some randomly generated data. The preliminary results indicate that the proposed models of this paper provides better values for the objective function and do not increase the complexity of the resulted problem.

In this paper, we study a supply chain problem where a whole seller/producer distributes goods among different retailers. The proposed model of this paper is formulated as a more general and realistic form of traditional vehicle routing problem (VRP). The main advantages of the new proposed model are twofold. First, the time window does not consider any lower bound and second, it treats setup time as separate cost components. The resulted problem is solved using a hybrid of particle swarm optimization and simulated annealing (PSO-SA). The results are compared with other hybrid method, which is a combination of Ant colony and Tabu search. We use some well-known benchmark problems to compare the results of our proposed model with other method. The preliminary results indicate that the proposed model of this paper performs reasonably well.

Cross docking is one of the most important issues in management of supply chains. In cross docking, different items delivered to a warehouse by inbound trucks are directly arranged and reorganized based on customer demands, routed and loaded into outbound trucks for delivery purposes to customers without virtually keeping them at the warehouse. If any item is kept in storage, it is normally for a short amount of time, say less than 24 hours. In this paper, we consider a special case of cross docking where there is temporary storage and implements genetic algorithm to solve the resulted problem for some realistic test problems. In our method, we first use some heuristics as initial solutions and then improve the final solution using genetic algorithm. The performance of the proposed model is compared with alternative solution strategy, the GRASP method.

During the past few years, operations research applications in health care operation management have grown quickly. On the other hand blood as a perishable, valuable and lifesaving product is one important asset of any healthcare center. Therefore, designing a blood supply network comes to importance. It also should be noted that a blood supply chain comprises specific modifications. This study intends to locate blood bank components in a network, and to determine the allocations among the network components. The supply chain components considered in this study are donation sites, testing and processing labs, blood banks, and demand points. It is known that demand centers such as hospitals and clinics highly depend on blood products and any deficiency in procurement can even result in a person’s death. Thus, in the last layer of the considered network a transshipment sub-network is considered between demand points. Most of the intricacies in problem formulation of blood supply chain are regarded in this study; cases such as blood wastage, blood product decomposition in lab facilities, and transshipments between demand points. Due to the fact that for such an important and lifesaving supply chain the aim would go beyond minimizing cost, another objective function is presented for the problem. Hence, to obtain a Pareto solution for both objective functions ?-constraint method is utilized. Finally, to demonstrate the applicability of the problem, the model is implemented on a number of problem sets.