Aiming at distribution logistics planning in green manufacturing, heterogeneous-vehicle vehicle routing problems are identified for the first time with multiple time windows that meet load constraints, arrival time window constraints, material demand, etc. This problem is expressed by a mathematical model with the characteristics of the vehicle routing problem with split deliveries by order. A hybrid ant colony optimization algorithm based on tabu search is designed to solve the problem. The search time is reduced by a peripheral search strategy and an improved probability transfer rule. Parameter adaptive design is used to avoid premature convergence, and the local search is enhanced through a variety of neighborhood structures. Based on the problem that the time window cannot be violated, the time relaxation rule is designed to update the minimum wait time. The algorithm has the best performance that meets the constraints by comparing with other methods.

In this paper, we present a two-dimensional irregular bin packing problem (2DIBPP) that takes into account the slit distance and allows the pieces to rotate freely. The target is to arrange a specified collection of pieces with irregular shapes into a minimal number of bins. Firstly, we develop a mathematical model for the 2DIBPP that considers slit distance and free rotation of the pieces, and an equidistant edge expansion approach is then proposed to handle the slit distance. Secondly, a two-stage method is implemented to get a finite collection of promising rotation angles, effectively decreasing the search neighbourhood. Thirdly, we decompose the 2DIBPP into two sub-problems: piece assignment and packing. The Partial Bin Packing (PBP) strategy is employed in the allocation stage, and we adopt an overlap minimization method to pack the pieces into an individual bin. Finally, we use a local search (LS) algorithm to advance the quality of the solutions by adjusting the piece assignment across bins. Experimental evidence exhibits that our approach is competitive in most instances of the literature, with four better results in five benchmark instances.

The inventory routing problem (IRP) arises in the joint practices of vendor-managed inventory (VMI) and vehicle routing problem (VRP), aiming to simultaneously optimize the distribution, inventory and vehicle routes. This paper studies the multi-vehicle multi-compartment inventory routing problem with stochastic demands (MCIRPSD) in the context of fuel delivery. The problem with maximum-to-level (ML) replenishment policy is modeled as a two-stage stochastic programming model with the purpose of minimizing the total cost, in which the inventory management and routing decisions are made in the first stage while the corresponding resource actions are implemented in the second stage. An acceleration strategy is incorporated into the exact single-cut Benders decomposition algorithm and its multi-cut version respectively to solve the MCIRPSD on the small instances. Two-phase heuristic approaches based on the single-cut decomposition algorithm and its multi-cut version are developed to deal with the MCIRPSD on the medium and large-scale instances. Comparing the performance of the proposed algorithms with the Gurobi solver within limited time, the average objective value obtained by the proposed algorithm has decreased more than 7.30% for the medium and large instances, which demonstrates the effectiveness of our algorithms. The impacts of the instance features on the results are further analyzed, and some managerial insights are concluded for the manager.

For a serial delivery system, the latter 3PL needs to be prepared at the transshipment node in advance to reduce the total delivery time. In this paper, we propose the concept of Connecting Time Spot (CTS) to help 4PL schedule the latter 3PL when to wait at the transshipment node. We study a serial delivery system with a 4PL and two 3PLs, where 4PL designs optimal contracts with two types of CTS (GCTS is derived by system parameter and DCTS is determined by 4PL’s optimization) to induce 3PLs to exert the optimal effort levels. We analyze the effects of CTS on the system profit in the centralized system. For the decentralized system, we particularly investigate the optimal contracts in three penalty modes which are according to the occupancy of the warehouses. The results show that CTS can avoid 3PLs’ idle resources and enhance the system profit for serial delivery both in the centralized system and the decentralized system. Compared with GCTS, DCTS has a better performance in enhancing the system profits. Also, the optimal incentive contracts achieve Pareto improvement for system profits. Interestingly, one 3PL’s delivery penalty mode will not affect the other 3PL’s optimal contracts.

We address a manufacturing environment with the no-wait constraint which is common in industries such as metal, plastic, and semiconductor. Setup times are modelled as uncertain with the objective of minimizing maximum lateness which is an important performance measure for customer satisfaction. This problem has been addressed in scheduling literature for the two-machine no-wait flowshop where dominance relations were presented. Recently, another dominance relation was presented and shown to be about 90% more efficient than the earlier ones. In the current paper, we propose two new dominance relations, which are less restrictive than the earlier ones in the literature. The new dominance relations are shown to be 140% more efficient than the most recent one in the literature. As the level of uncertainty increases, the newly proposed dominance relation performs better, which is another strength of the newly proposed dominance relation. Moreover, we also propose constructive heuristics and show that the best of the newly proposed heuristics is 95% more efficient than the existing one in the literature under the same CPU time.

Due to the deep integration of modern information technology, supply chain management has moved into a new stage of a smart supply chain. Considering the dual smart innovation of the manufacturer's production and retailer’s service, the manufacturer-led Stackelberg game model is constructed in the smart supply chain. Under the single and coordinated government subsidy strategies, the optimal decisions of the smart supply chain are researched, and the impacts of manufacturers' risk aversion on the government subsidy strategies and supply chain decisions are analysed. In addition, the efficiencies of different government subsidy strategies are compared and analysed by numerical simulation. Finally, the results show that: (i) The moderate risk aversion by the manufacturer can improve social welfare and help provide consumers with more affordable products. (ii) The government expenditure and product prices are highest under the coordinated subsidy strategy. (iii) Subsidising manufacturers is more beneficial than subsidising retailers among the two single government subsidy strategies. (iv) In general, the coordinated government subsidy strategy is more effective than the single subsidy strategy for the innovative development of a smart supply chain. In conclusion, the research provides a significant practical reference for jointly building the smart supply chain.

As a result of the rapidly increasing distribution network, the toxic gases emitted by the vehicles to the environment have also increased, thus posing a threat to health. This study deals with the problem of determining green vehicle routes aiming to minimize CO2 emissions to meet customers' demand in a supermarket chain that distributes fresh and dried products. A new method based on clustering algorithms and Hopfield Neural Network is proposed to solve the problem. We first divide the large-size green vehicle routing problem into clusters using the K-Means and K-Medoids algorithms, and then the routing problem for each cluster is found using the Hopfield Neural Network, which minimizes CO2 emissions. A real-life example is carried out to illustrate the performance and applicability of the proposed method. The research concludes that the proposed approach produces very encroaching results.

In recent years, the Vehicle Routing Problem (VRP) has become an important issue for distribution companies. Also, the rapid development of communication means and the appearance of reverse logistics have given rise to new variants of the VRP. This article deals with an important variant of the VRP which is Dynamic Vehicle Routing Problem with Simultaneous Delivery and Pickup (DVRPSDP), in which new customers appear during the working day and each customer requires simultaneous delivery and pickup. A Memetic Algorithm (MA) that combines Genetic Algorithm (GA) and local search procedure have been proposed to solve the problem. The performance of the algorithm is evaluated with the tests carried out on a set of benchmarks found in the literature. The proposed memetic algorithm is very efficient and gives many good solutions.

Internal supply chains exist in many global enterprises, where manufacturing tasks and sales jobs operate separately, but the management needs to integrate their financial performance reports. In addition, the fabrication planning must meet specific operational goals, such as meeting external clients’ requirements on quality and short order due dates, avoiding internal fabricating interruptions due to inevitable equipment breakdowns, and minimizing overall manufacturing and stock holding costs. Motivated by helping multinational corporations deal with the issues mentioned earlier, this study aims to optimize a finite production rate (FPR)-based supplier-retailer cooperative problem with multi-shipment, rework, subcontracting, probabilistic failure, and expedited rate. Wherein using an outsourcer and expedited-rate help shorten the needed batch producing time significantly; the rework of defects and corrective action on unanticipated breakdown assist in up-keeping the quality and avoiding fabricating delay. We develop an FPR-based model to cautiously represent the considered manufacturing features and activities involved in transporting end products and retailers’ stock holding. Model’s formulating and investigating assists us in gaining the function of operating costs. In addition, optimization procedures with a proposed algorithm help us verify its convexity and decide the model’s best fabricating runtime solution. Finally, we validate how this study works and what important information our model can disclose using a numerical example to facilitate management’s decision-making to end our work.

Artificial neural networks (ANNs) are one of the artificial intelligence techniques used in real-world problems and applications encountered in almost all industries such as education, health, chemistry, food, informatics, logistics, transportation. ANN is widely used in many techniques such as optimization, modelling, classification and forecasting, and many empirical studies have been carried out in areas such as planning, inventory management, maintenance, quality control, econometrics, supply chain management and logistics related to ANN. The most important and just as hard stage of ANNs is the learning process. This process is about finding optimal values in the search space for different datasets. In this process, the values generated by training algorithms are used as network parameters and are directly effective in the success of the neural network (NN). In classical training techniques, problems such as local optimum and slow convergence are encountered. Meta-heuristic algorithms for the training of ANNs in the face of this negative situation have been used in many studies as an alternative. In this study, a new hybrid algorithm namely MVOSANN is suggested for the training of ANNs, using Simulated annealing (SA) and Multi-verse optimizer (MVO) algorithms. The suggested MVOSANN algorithm has been experimented on 12 prevalently classification datasets. The productivity of MVOSANN has been compared with 12 well-recognized and current meta-heuristic algorithms. Experimental results show that MVOSANN produces very successful and competitive results.