This paper proposes a metaheuristic algorithm to solve the Multi-Depot Vehicle Routing Problem with a Heterogeneous Fleet (MDHFVRP). The problem consists of determining the customers and the vehicles to be assigned to each used depot and the routes to be performed to fulfill the demands of a set of customers. The objective is to minimize the sum of the fixed cost associated with the used vehicles and of the variable traveling costs related to the performed routes. The proposed approach is based on a modified genetic algorithm, which generates an initial population with heuristic solutions obtained from the well-known (LKH) heuristic algorithm for the TSP together with the solution of a mathematical model for the shortest path problem. In addition, two recombination methods and a mutation operator are considered. Computational experiments on benchmark instances show that the proposed algorithm can obtain high-quality solutions within short computing times.

This study employs mathematical modeling to explore the effects of overtime option, rework, and discontinuous end-item issuing policy on the economic manufacturing quantity (EMQ) model. Conventional EMQ model assumed that all products fabricated are of good quality and are issued under continuous policy. In real world, however, nonconforming items are randomly produced, due to diverse unexpected factors in fabrication process. When finished items are to be distributed to outside locations, discontinuous multi-shipment policy is often used rather than continuous rule. In addition, with the intention of increasing short-term capacity or shortening replenishment cycle length to smooth the production planning, adopting overtime option can be an effective strategy. To cope with the aforementioned features in real production systems, this study incorporates overtime option, rework, and multi-shipment policy into the EMQ model and explores their joint effects on optimal lot size and number of shipments, and on other relevant system parameters. Mathematical modeling and Hessian matrix equations enable us to derive the optimal policies to the problem. Through the use of numerical example, the applicability of research result is exhibited and a variety of significant effects of these features on the proposed system are revealed.

Particle swarm optimization has been established to be one of the efficient algorithms for finding solutions for continuous optimization problems. The discretized form of particle swarm optimization, known as the discrete particle swarm optimization is an efficient tool for solving combinatorial optimization problems and other problems involving discrete variables. In this paper, a revised version of the discrete particle swarm optimization algorithm is proposed for solving Quadratic Assignment Problems (QAP). Instead of using the general velocity and position update procedures in particle swarm optimization algorithms, four different possible positions are found out for each particle and the best among them is accepted as the updated position. The algorithm is applied to solve some benchmark instances of QAP taken from QAP Library and the results show minute deviations from best-known solutions.

The present study reports on the application of accelerated cooling environment (ACE) in hard turning of AISI D2 steel (55 ± 1HRC) using mixed ceramic insert (Al2O3 + TiCN) which is rarely being investigated and to address the major problems of brittle fracture of tool tip that arises through cutting forces and friction at tool-work and chip-tool interface. In spraying process, some portion of spraying coolant vaporize due to heat when it reaches to cutting zone where as remaining portion of coolant easily penetrate in cutting zone through capillary action and reduces friction as well as heat in cutting zone. Abrasion and chipping are noticed to be dominant wear mechanism. Cutting speed and depth of cut are significant for flank wear as well as cutting temperature whereas feed is significant for average surface roughness. Serrated chips have been identified at higher cutting speed and higher feeds. Optimal parametric combination is found to be d1-f1-v2 (0.1mm-0.04 m/min-108 m/min) and tool life and machining cost per part are 70 minutes and Rs 76.76 respectively. Investigation shows the worthy of application of ACE in hard turning in industrial sectors ecologically and economically. Empirical models reveal statistically significance due to higher coefficient of correlations.

In this paper, we introduce an inventory routing problem with network disruptions. In this problem, not only decisions on inventory levels and vehicle routing are made simultaneously, but also, we consider disruptions over the networks in which a number of arcs are vulnerable to these disruptions, leading to an increase in travel times. We develop a dynamic programming approach to deal with this situation, and we also evaluate some policies adapting well-known instances from the literature.

Electric Vehicles (EVs) represent a significant option that contributes to improve the mobility and reduce the pollution, leaving a future expectation in the merchandise transportation sector, which has been demonstrated with pilot projects of companies operating EVs for products delivering. In this work a new approach of EVs for merchandise transportation considering the location of Electric Vehicle Charging Stations (EVCSs) and the impact on the Power Distribution System (PDS) is addressed. This integrated planning is formulated through a mixed integer non-linear mathematical model. Test systems of different sizes are designed to evaluate the model performance, considering the transportation network and PDS. The results show a trade-off between EVs routing, PDS energy losses and EVCSs location.

Silicon carbide (SiC) particulate impregnated Al 7075 matrix composite was fabricated by stir casting method and then heat treated to T6 condition. It was then machined with multiple layer of TiN coated tungsten carbide (WC) inserts in dry environment and pollution free Spray Impingement Cooling (SIC) environment to compare the machining performance. SIC environment presented better machining performance with respect to cutting tool temperature (T), average roughness of the machined surface (Ra) and tool flank wear (VBc). Quadratic response surface models were developed by computing the experimental data. Weighted Principal Component Analysis (WPCA) based Taguchi technique was adopted to optimize the multiple responses simultaneously, which resulted 40 m/min of cutting speed (V), 0.05 mm/rev of feed (f) and 0.2 mm of cutting depth (d) was the optimal combination of process parameters.

In Australia, Bioenergy plays an important role in modern power systems, where many biomass resources provide greenhouse gas neutral and electricity at a variety of scales. By 2050, the Biomass energy is projected to have a 40-50 % share as an alternative source of energy. In addition to conversion of biomass, barriers and uncertainties in the production, supply may hinder biomass energy development. The sugarcane is an essential ingredient in the production of Bioenergy, across the whole spectrum ranging from the first generation to second generation, e.g., production of energy from the lignocellulosic component of the sugarcane initially regarded as waste (bagasse and cane residue). Sustainable recovery of the Lignocellulosic component of sugarcane from the field through a structured process is largely unknown and associated with high capital outlay that have stifled the growth of bioenergy sector. In this context, this paper develops a new scheduler to optimise the recovery of lignocellulosic component of sugarcane and cane, transport and harvest systems with reducing the associated costs and operational time. An Optimisation Algorithm called Limited Discrepancy Search has been adapted and integrated with the developed scheduling transport algorithms. The developed algorithms are formulated and coded by Optimization Programming Language (OPL) to obtain the optimised cane and cane residues transport schedules. Computational experiments demonstrate that high-quality solutions are obtainable for industry-scale instances. To provide insightful decisions, sensitivity analysis is conducted in terms of different scenarios and criteria.

In recent years, many studies on the multi-agent scheduling problems in which agents compete for using the shared resources, have been performed. However, relatively few studies have been undertaken in the field of the multi-agent scheduling in a flowshop environment. To bridge the gap, this paper aims at addressing the two-agent scheduling problem in a two-machine flowshop. Because of the importance of delay penalties and efficient resource utilization in many manufacturing environments, the objective is to find an optimal schedule which has the minimum total tardiness for the first agent’s jobs, under the makespan limitation for the second agent. Since this problem is strongly NP-hard, several theorems and properties of the problem are proposed to apply in exact and meta-heuristic methods. Also, for some instances of the problem for which exact methods cannot achieve optimal solutions in a reasonable amount of time, a tabu search algorithm is developed to achieve near-optimal solutions. Computational results of the tabu search algorithm show that the average absolute error value is lower than 0.18 percent for instances with 20 to 60 jobs in size.

In this article, we propose Simulated Annealing (SA) heuristic to solve Unequal Area Dynamic Facility Layout Problem (FBS) with Flexible Bay Structure (UA-DFLPs with FBS). The UA-DFLP with FBS is the problem of determining the facilities dimension and their location coordinates with flexible bays formation in the layout for various periods of the planning horizon. The UA-DFLP with FBS is more constrained than general UA-DFLP and it is an NP-complete problem. The proposed SA is tested with the available UA-DFLPs instances in the literature. The proposed SA heuristic has given new best solution or the same solution for FBS based problems as compared with the best-known reported in the UA-DFLPs with FBS literature. The proposed SA heuristic is also tested on standard UA-DFLPs used in non-FBS approaches. The SA heuristic solution is not significantly different from the best solution reported in the literature for non-FBS approaches. Equal area DFLP instances are also solved with the proposed SA and the results obtained are promising with the solutions reported in the literature. Hence the results obtained indicate that the proposed SA for UA-DFLP with FBS is effective and versatile for both equal and unequal area dynamic facility layout problems. The computational efficiency of the proposed SA heuristic is very much competitive as compared to other meta-heuristics computational timings reported in the literature.