Diseño y desarrollo del modelo óptimo de asignación y cronograma de remolques en el sistema de cadena de suministro con consideración de cross dock con planificación estocástica

Todays, transportation, and logistics engineering processes are among the important issues of organizations in the competitive market. Considering the logistical structure of the logistics engineering and the more attention paid to the logistical tools and, in particular, such as the use of these tools, such as containers (pallets, containers, etc.), transportation equipment (trailer, forklift trucks, etc.), and The art of building the supply and distribution network concerning the main warehouses, cross-dock, and temporary storage, is one of the most critical and contemplative cases. In fact, all these tools work together to maximize system efficiency in the field of logistics concerning the leading impact indicators, including the time of shipment (loading, disloading, the allocation of trailers, etc.). This paper's main goal is to present and develop a mathematical model of trailer schedule planning in possible conditions in the cross-dock. In fact, the main function of this mathematical model is to minimize the total time of the logistics process from the stage of emptying the pallets from the materials producers in the cross docks and assigning the trailer to the door, and finally reloading the pallets to be distributed to the production sites. To solve this model and to analyze the outputs, mixed integer programming was used by GAMS software.Hoy en día, los procesos de ingeniería de transporte y logística se encuentran entre los temas importantes de las organizaciones en el mercado competitivo. Teniendo en cuenta la estructura logística de la ingeniería logística y la mayor atención prestada a las herramientas logísticas y, en particular, como el uso de estas herramientas, como contenedores (pallets, contenedores, etc.), equipos de transporte (remolque, carretillas elevadoras, etc.), y El arte de construir la red de suministro y distribución con respecto a los almacenes principales, cross dock y almacenamiento temporal, es uno de los casos más importantes y contemplativos. De hecho, todas estas herramientas trabajan juntas para maximizar la eficiencia del sistema en el campo de la logística con respecto a los principales indicadores de impacto, incluido el tiempo de envío (carga, descarga, asignación de remolques, etc.). El objetivo principal de este artículo es presentar y desarrollar un modelo matemático de planificación de horarios de remolques en las posibles condiciones en el muelle de cruce. De hecho, la función principal de este modelo matemático es minimizar el tiempo total del proceso logístico desde la etapa de vaciado de los pallets de los productores de materiales en los cross docks y la asignación del remolque a la puerta y finalmente la recarga de los pallets a distribuir. a los sitios de producción. Para resolver este modelo y analizar las salidas, el software GAMS utilizó la programación de enteros mixtos

Optimisation of a crossdocking distribution centre simulation model

This paper reports on continuing research into the modelling of an order picking process within a Crossdocking distribution centre using Simulation Optimisation. The aim of this project is to optimise a discrete event simulation model and to understand factors that affect finding its optimal performance. Our initial investigation revealed that the precision of the selected simulation output performance measure and the number of replications required for the evaluation of the optimisation objective function through simulation influences the ability of the optimisation technique. We experimented with Common Random Numbers, in order to improve the precision of our simulation output performance measure, and intended to use the number of replications utilised for this purpose as the initial number of replications for the optimisation of our Crossdocking distribution centre simulation model. Our results demonstrate that we can improve the precision of our selected simulation output performance measure value using Common Random Numbers at various levels of replications. Furthermore, after optimising our Crossdocking distribution centre simulation model, we are able to achieve optimal performance using fewer simulations runs for the simulation model which uses Common Random Numbers as compared to the simulation model which does not use Common Random Numbers

A Review: Mathematical Modles for Cross Docking Planning

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

Meta-heuristics Methods for Fixed Transshipment Problems with Time Windows in Three-Echelon Crossdocking System

随着经济全球化的加深，企业竞争由企业之间转向企业所在供应链之间的竞争。越库（Crossdocking）集库存管理策略与配送策略为一体，越来越被各类企业用于优化配送网络的准时制物流策略。越库是指在物流活动中的任何中间点（仓库或配送中心）只实现收发货功能而消除货物存储与订单获取功能的运作模式。越库技术极大地降低了企业的库存水平，从而降低库存成本、货物损失成本，并加快货物的流动速度。 基于此背景，本文研究了基于时间窗口的三级越库系统运输车辆调度及其优化算法。作者首先对越库的定义、发展、类型、应用状况等进行介绍，结合国内外研究现状，提出并建立基于时间窗口的三级越库系统车辆调度模型。然后介绍了组合最优...As economic globalization deepens, enterprise competition more exits among Supply Chain that corporations related to than just a single corporation. Crossdocking as a type of JIT logistics strategy, integrating inventory management strategy and distribution strategy as a whole, is increasingly being used to optimize the distribution network of enterprises. Crossdocking refers to mainly function pi...学位：管理学硕士院系专业：管理学院管理科学系_管理科学与工程学号：1772007115073

Ordonnancement de camions dans une plateforme logistique : complexité, méthodes de résolution et incertitudes

La problématique dite de crossdocking a été source de beaucoup d'attention ces dernières années dans la littérature. Un crossdock est une plateforme logistique favorisant, par une synchronisation efficace des camions entrants et sortants, une rotation rapide des produits, le volume de produits stockés devant être le plus faible possible. Le crossdocking soulève de nombreux problèmes logistiques, dont notamment celui de l'ordonnancement des camions entrants et sortants sur les quais de la plateforme. L'objectif classiquement considéré dans la littérature pour ce problème est la minimisation du makespan, critère très répandu en d'ordonnancement. Pour le crossdocking néanmoins, minimiser la date de départ du dernier camion ne garantie pas nécessairement une bonne synchronisation des camions et le makespan ne semble donc pas être l'objectif le plus pertinent. Pour répondre au besoin de synchronisation et favoriser les rotations rapides, notre travail propose alternativement de minimiser la somme des temps de séjour des palettes dans le stock. Nous étudions d'abord la version déterministe de ce problème d'ordonnancement. Sa complexité est détaillée selon différentes hypothèses pour identifier les éléments menant à sa NP-difficulté. Différentes méthodes de résolutions sont proposées. Une méthode classique de programmation linéaire en nombres entiers utilisant des variables de décision indexées par le temps. Une famille d'inégalités valides est également proposée et exploitée dans un algorithme avec ajout itératif de coupes. Des méthodes basées sur la programmation par contraintes sont enfin proposées. Une analyse comparative de ces différentes méthodes est proposée. Dans un deuxième temps, nous étudions une version non-déterministe de notre problème d'ordonnancement dans laquelle des incertitudes sur les dates d'arrivée des camions sont introduites sous la forme d'intervalles de temps équiprobables. Une méthode d'ordonnancement proactive-réactive utilisant le concept de groupes d'opérations permutables est proposée pour faire face aux incertitudes. Des groupes de camions permutables sont séquencés et affectés aux quais puis, durant l'exécution d'ordonnancement, en fonction de la réalisation des dates d'arrivée, un ordre est choisi dans chaque groupe à l'aide d'un algorithme réactif.Crossdocking has received a lot of attention in the literature in recent years. A crossdock is a logistic platform that promotes rapid product turnover through efficient synchronization of incoming and outgoing trucks, with the volume of products stored being kept as low as possible. Crossdocking raises many logistical problems, including the scheduling of incoming and outgoing trucks on the platform's docks. The classical objective considered in the literature for this problem is the minimization of the makespan, a very common criterion in scheduling. However, for crossdocking, minimizing the departure date of the last truck does not necessarily guarantee a good synchronization of the trucks and the makespan does not seem to be the most relevant objective. In order to meet the need for synchronization and to help fast rotations, our work proposes alternatively to minimize the sum of the pallets' sojourn times in the warehouse. We first study the deterministic version of this scheduling problem. Its complexity is detailed under different assumptions to identify the elements leading to its NP-hardness. Different solution methods are proposed. A classical integer linear programming method using time-indexed decision variables. A family of valid inequalities is also proposed and exploited in an algorithm with iterative addition of cuts. Finally, methods based on constraint programming are proposed. A comparative analysis of these different methods is proposed. In a second step, we study a non-deterministic version of our scheduling problem in which uncertainties on truck arrival dates are introduced in the form of equiprobable time intervals. A proactive-reactive scheduling method using the concept of permutable operation groups is proposed to cope with the uncertainties. Groups of permutable trucks are sequenced and assigned to the docks and then, during the scheduling run, based on the realization of arrival dates, an order is chosen in each group using a reactive algorithm

Cross-docking: A systematic literature review

This paper identifies the major research concepts, techniques, and models covered in the cross-docking literature. A systematic literature review is conducted using the BibExcel bibliometric analysis and Gephi network analysis tools. A research focus parallelship network (RFPN) analysis and keyword co-occurrence network (KCON) analysis are used to identify the primary research themes. The RFPN results suggest that vehicle routing, inventory control, scheduling, warehousing, and distribution are most studied. Of the optimization and simulation techniques applied in cross-docking, linear and integer programming has received much attention. The paper informs researchers interested in investigating cross-docking through an integrated perspective of the research gaps in this domain. This paper systematically reviews the literature on cross-docking, identifies the major research areas, and provides a survey of the techniques and models adopted by researchers in the areas related to cross-docking