Cross Dock Scheduling Using Genetic Algorithms

Ley, S.; Elfayoumy, Sherif

doi:10.1109/cira.2007.382928

Cited by 14 publications

(9 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results of experiments showed that SBSA performed better than the arbitrary scheduling (where the best truck schedule was identified over a large number of randomly generated truck schedules), which had been widely used by freight consolidation terminals at the time of the study. Ley et al (2007) modeled CDT truck scheduling. The objective of the model presented was the minimization of the total travel distance by the internal handling equipment.…”

Section: General Cdt Truck Schedulingmentioning

confidence: 99%

Models and Solution Algorithms for Efficient Truck Scheduling at Cross-docking Terminals with Time-sensitive Products

Theophilus¹

2021

Preprint

View full text Add to dashboard Cite

This dissertation focuses on the scheduling of trucks (both in- and outbound trucks) at a CDT, where some of the delivered products are perishable in nature. The short lifespan of perishable products (i.e., foods and drugs) poses critical challenges to the CDT operations management. Perishable goods are time-sensitive products that require minimal handling time to preserve their quality and profitability. Cross-docking is expected to facilitate the distribution of perishable products within supply chains. There are many challenges involved in the management of the cross-docking terminals with perishable products, including determination of the service order of the trucks (inbound and outbound) carrying perishable products, selection of preemption strategies for certain trucks (i.e., a given truck can leave the door, so another truck can be docked for service), allocation of suitable temporary storage space for products, quality loss due to late delivery or errors in temperature control.This dissertation aims to develop a mathematical model for scheduling the arriving trucks at a cross-dock terminal, taking product decay into consideration throughout the handling process. The objective of the mathematical model minimizes the total truck service cost, which includes (1) waiting cost; (2) service cost; (3) cost of product storage; (4) cost of delay in truck departure; and (5) the cost associated with the decay of products that are perishable in nature. A number of linearization techniques are discussed in order to linearize the original nonlinear mathematical model (where the nonlinearity is caused by the adopted product decay function). The complexity of the linearized model is evaluated in this dissertation. Moreover, the candidate solution approaches for the proposed mathematical model are described.The developed model was solved using the exact optimization technique. In particular, the model was solved to optimality using CPLEX. However, it was observed that the computational time increased as the problem size increased due to the model complexity. Four alternative solution approaches namely: (1) Evolutionary Algorithm (EA); (2) Variable Neighborhood Search (VNS); (3) Tabu Search (TS); and (4) Simulated Annealing (SA), which are common metaheuristic algorithms, were developed and compared with CPLEX using small-size problem instances. These metaheuristics were able to achieve optimal solutions for the small-size problem instances and required relatively low computational times. The metaheuristic algorithms were further compared, and EA was found to outperform the others (VNS, TS, and SA) based on the balance between the objective function and computational time values. A set of analyses were carried out using EA, and managerial insights that could be of interest to supply chain stakeholders were drawn. The proposed mathematical model, the developed EA, and the managerial insights could assist the CDT manager in making efficient and timely truck scheduling decisions in any planning horizon.

show abstract

Section: General Cdt Truck Schedulingmentioning

confidence: 99%

Models and Solution Algorithms for Efficient Truck Scheduling at Cross-docking Terminals with Time-sensitive Products

Theophilus¹

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The heuristic methods are proposed to solve the model. Ley and Elfayoumy (2007) developed a scheduling model of inbound and outbound truck to minimize the distances. They proposed Genetic Algorithm (GA) to solve the problem.…”

Section: Scheduling Problemmentioning

confidence: 99%

A Review: Mathematical Modles for Cross Docking Planning

Agustina

Lee

Piplani

2010

International Journal of Engineering Business Management

View full text Add to dashboard Cite

This paper provides a comprehensive literature review of mathematical models in cross docking planning. From the reviews, the models are classified in three different levels regarding its decisions level which are operational, tactical, and strategic level. The researches in operational level are mainly related to develop model in scheduling, dock door assignment, transhipment problem, vehicle routing, and product allocation. For tactical and strategic level, the researches are mainly proposing model to design the layout and the network of cross docking respectively. The contribution of this paper is to realize the gaps of knowledge in strategic, tactical and operational levels and point out the future research directions in cross docking.

show abstract

“…The best way to assign the doors on time to the trucks coming in and out of a CDF is a scheduling problem and several approaches have been used to solve it. See for example Soltani and Sadjadi [8], Wang and Regan [7], and Ley and Elfayoumy [9].…”

Section: Modeling Cross-dock Network With Time Constraints Using Simmentioning

confidence: 99%

Modeling cross-dock networks with time constraints using simulation

Rodriguez-Velasquez

Arnaout

Rabadi

et al. 2010

2010 IEEE Systems and Information Engineering Design Symposium

View full text Add to dashboard Cite

We address in this paper a cross-dock network problem where trucks must be routed from origins to destinations either directly or indirectly through cross-dock facilities. Loads to be shipped are subject to delivery time constraints with a required service level that is important to customers for the service to be acceptable. This problem has been addressed in the literature previously but in a deterministic fashion and with several strong assumptions. In this paper, we introduce simulation model that relaxes some of these conditions to solve the problem and evaluate its behavior against a traditional distribution system. The contribution of this paper is to take into consideration stochastic parameters that have been previously considered deterministic, and to predict how the system will behave under a specific number of trucks and network configuration.978-1-4244-7522-3/10/$26.00 ©2010 IEEE

show abstract

Cross Dock Scheduling Using Genetic Algorithms

Cited by 14 publications

References 0 publications

Models and Solution Algorithms for Efficient Truck Scheduling at Cross-docking Terminals with Time-sensitive Products

Models and Solution Algorithms for Efficient Truck Scheduling at Cross-docking Terminals with Time-sensitive Products

A Review: Mathematical Modles for Cross Docking Planning

Modeling cross-dock networks with time constraints using simulation

Contact Info

Product

Resources

About