A Multi-Objective Differential Evolution for Just-In-Time Door Assignment and Truck Scheduling in Multi-door Cross Docking Problems

Abstract

Nowadays, the distribution centres aim to reduce costs by reducing inventory and timely shipment. Cross docking is a logistics strategy in which products delivered to a distribution centre by inbound trucks are directly unloaded and transferred to outbound trucks with minimum warehouse storage. Moreover, on-time delivery in a distribution network becomes very crucial especially when several distribution centres and customers are involved. Therefore, an efficient truck scheduling is needed to synchronize the delivery throughout the network in order to satisfy all stakeholders. This paper presents a mathematical model of a mixed integer programming for door assignment and truck scheduling in a multiple inbound and outbound doors cross docking problem according to Just-In-Time concept. The objective is to find the schedule of transhipment operations to simultaneously minimize the total earliness and total tardiness of trucks. Then, a multi-objective differential evolution (MODE) is proposed with an encoding scheme and four decoding strategies, called ITSH, ITDD, OTSH and OTDD, to find a Pareto frontier for the multi-door cross docking problems. The performances of MODE are evaluated using 15 generated instances. The numerical experiments demonstrate that the proposed algorithm is capable of finding a set of diverse and high quality non-dominated solutions.

A comparative study of artificial neural network (ANN) and adaptive neuro-fuzzy inference system (ANFIS) models in distribution system with nondeterministic inputs

“…Some other recent papers in the area include a multi-objective GA solution for transportation, assignment and transshipment problems, 21 and a Just-in-time (JIT) multi-objective truck forecast problem with door assignment using differential evolution in the cross-dock system. 22,23 Model notations and formulation…”

“…(21) If the unit cost to D7 is in 1mf1 and unit cost to D9 is in 2mf3 and unit cost to D10 is in 3mf1 and demand is in 4mf3 then supply at D10 is out 1mf21. (22) If the unit cost to D7 is in 1mf1 and unit cost to D9 is in 2mf3 and unit cost to D10 is in 3mf2 and demand is in 4mf1 then supply at D7 is out 1mf22.…”

Modelo de asignación dinámica de lugares de almacenamiento en centros Cross Docking

“…En [17] se aborda el concepto de Just-In-Time en asignación de puertas y la programación de camiones en un Centro Cross Docking de puertas y salidas múltiples, para ellos se desarrollan un modelo matemático de programación entera mixta que busca encontrar la programación de operaciones de transbordo para minimizar simultáneamente la precocidad total y la tardanza total de los camiones.…”

Improved Harmony Search Algorithm for Truck Scheduling Problem in Multiple-Door Cross-Docking Systems

“…The makespan of cross docking as well as the total earliness and total tardiness of trucks is discussed more often. Wisittipanich and Hengmeechai [11] and Boloori Arabani et al [12] proposed a truck scheduling model with objective of minimizing the total earliness and tardiness simultaneously. Lee et al [13] established a mathematical model to maximize the number of products shipped in a given working horizon.…”