In the context of supply chain sustainability, Physical Internet (PI or ) was presented as an innovative concept to create a global sustainable logistics system. One of the main components of the Physical Internet paradigm consists in encapsulating products in modular and standardized PI-containers able to move via PI-nodes (such as PI-hubs) using collaborative routing protocols. This study focuses on optimizing operations occurring in a Rail–Road PI-Hub cross-docking terminal. The problem consists of scheduling outbound trucks at the docks and the routing of PI-containers in the PI-sorter zone of the Rail–Road PI-Hub cross-docking terminal. The first objective is to minimize the energy consumption of the PI-conveyors used to transfer PI-containers from the train to the outbound trucks. The second objective is to minimize the cost of using outbound trucks for different destinations. The problem is formulated as a Multi-Objective Mixed-Integer Programming model (MO-MIP) and solved with CPLEX solver using Lexicographic Goal Programming. Then, two multi-objective hybrid meta-heuristics are proposed to enhance the computational time as CPLEX was time consuming, especially for large size instances: Multi-Objective Variable Neighborhood Search hybridized with Simulated Annealing (MO-VNSSA) and with a Tabu Search (MO-VNSTS). The two meta-heuristics are tested on 32 instances (27 small instances and 5 large instances). CPLEX found the optimal solutions for only 23 instances. Results show that the proposed MO-VNSSA and MO-VNSTS are able to find optimal and near optimal solutions within a reasonable computational time. The two meta-heuristics found optimal solutions for the first objective in all the instances. For the second objective, MO-VNSSA and MO-VNSTS found optimal solutions for 7 instances. In order to evaluate the results for the second objective, a one way analysis of variance ANOVA was performed.
9 September 2019 in International Journal of Production Research
Physical Internet (PI) was introduced as a global standardised and interconnected logistics system based on PI-nodes, PI-movers and PI-containers as a mean toward global logistics sustainability. One important issue regarding PI-nodes concerns the planning and scheduling of operations and the management of PI-containers, both in a deterministic and a perturbed environment. This research considers the Road-Rail PI-hub sustainable truck scheduling and PI-containers grouping problem. In our research we consider the weighted sum of the number of used wagons, the internal distance travelled by PI-containers from PI-docks to wagons as well as the trucks’ tardiness, which translate the search for sustainable logistics. In this paper, an effective and reactive multi-agent system based model (MAS) is developed for the resolution of the trucks scheduling and PI-containers grouping. To ensure the efficiency of the MAS and improve the quality of each of its solutions, three concurrent hybrid meta-heuristics are embedded within three parallel scheduling agents. Then, a mixed integer linear programming model (MILP) is proposed to evaluate the performance of the MAS. Finally, the MAS is also evaluated under internal perturbations. The obtained results show the ability of the MAS to provide alternative sustainable solutions by rescheduling trucks in case of disruptions.
8 December 2020 in International Journal of Production Research
Cross-docking is a logistics process in which products are unloaded through receiving docks and then transferred to shipping docks with almost no storage in between. In this paper, a mixed integer linear programming model (MILP) is proposed to optimise the scheduling, storage, assignment and sequencing of trucks at receiving and shipping docks for a problem inspired from a multiple-door cross-dock facility of an industrial partner with multiple temporary storage zones. The multiple storage zones are separated and located in the centre of the cross-dock handling different types of products. The objective is to minimise the total tardiness of inbound and outbound trucks. A heuristic (H) is proposed to find an initial solution. Then, three meta-heuristics are developed, namely Random Search (RS), Tabu Search (TS) and Simulated Annealing (SA) to improve the scheduling of trucks in order to minimise the tardiness of inbound and outbound trucks. Experimental results indicate that the three meta-heuristics (RS, TS and SA) are able to find good quality results within reasonable computational times. Finally, since SA showed the best performance compared to RS and TS, it was chosen to be compared to the current manual method using discrete event simulation.
26 June 2023 in Computers & Industrial Engineering
Purpose: This paper proposes an approach to solve the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) in the context of the Physical Internet (PI) supply chain. The main objective is to minimize the total distribution costs (transportation cost and holding cost) to supply retailers from PI hubs.Design/methodology/approach: Mixed integer programming (MIP) is proposed to solve the problem in smaller instances. A random local search (RLS) algorithm and a simulated annealing (SA) metaheuristic are proposed to solve larger instances of the problem.Findings: The results show that SA provides the best solution in terms of total distribution cost and provides a good result regarding holding cost and transportation cost compared to other heuristic methods. Moreover, in terms of total carbon emissions, the PI concept proposed a better solution than the classical supply chain.Research limitations/implications: The sustainability of the route construction applied to the PI is validated through carbon emissions.Practical implications: This approach also relates to the main objectives of transportation in the PI context: reduce empty trips and share transportation resources between PI-hubs and retailers. The proposed approaches are then validated through a case study of agricultural products in Thailand. Social implications: This approach is also relevant with the reduction of driving hours on the road because of share transportation results and shorter distance than the classical route planning.Originality/value: This paper addresses the VRPSPD problem in the PI context, which is based on sharing transportation and storage resources while considering sustainability.