968 research outputs found
Dock Assignment and Truck Scheduling Problems at Cross-docking Terminals
In this paper, we consider the integration of dock assignment and truck scheduling problem at cross-docking terminals. The problem is first formulated as a 0-1 integer programming model. Since both dock assignment and truck scheduling problems are NP-hard, its integration is more difficult to solve. Thus we propose reduced variable neighborhood search (RVNS) algorithms to solve the problem. Computational experiments are carried out on four set of instances. The results show that RVNS is capable of finding good solutions in a much shorter computation time when it is compared with optimization solver Gurobiâs solutions
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
Scheduling Material Handling in Cross-Docking Terminals
RĂSUMĂ : La manutention au sein des plateformes de distribution est un problĂšme dâordonnancement. Le transport interne des produits doit en effet ĂȘtre synchronisĂ© avec les arrivĂ©es et les dĂ©parts des camions. Ce problĂšme se retrouve dans toutes les plateformes de distribution oĂč la manipulation des produits est effectuĂ©e manuellement par lâopĂ©rateur. Dans cette thĂšse, nous investiguons ce problĂšme dâordonnancement dans les plateformes de distribution. Nous mettons en relief les diffĂ©rentes facettes de ce problĂšme et proposons une classification de ses diffĂ©rents sous problĂšmes. De maniĂšre gĂ©nĂ©rale, l'objectif est d'Ă©viter les doubles manipulations (dĂ©placer un produit dâun camion vers le stock, puis du stock vers un camion) qui doublent les coĂ»ts sans valeur ajoutĂ©e. Il faut minimiser ces doubles manipulations en orchestrant les transferts internes et la sĂ©quence de chargement/ dĂ©chargement des camions. Dans une premiĂšre partie, nous analysons la structure du problĂšme avec un modĂšle simplifiĂ© nâayant quâun quai de rĂ©ception et un quai dâenvois. Nous formalisons les dĂ©cisions de manipulation interne et dĂ©veloppons un algorithme optimal pour dĂ©terminer le meilleur plan de transfert de produits lorsque la sĂ©quence des camions est connue. Cet algorithme est utilisĂ© comme fonction dâĂ©valuation dans une recherche stochastique pour minimiser les doubles manipulations et optimisant les sĂ©quences de chargement/dĂ©chargement. Nous prĂ©sentons ensuite un modĂšle de programmation linĂ©aire en nombres entiers du problĂšme gĂ©nĂ©ral (ordonnancement des arrivĂ©es et dĂ©parts de camions et transfert interne des produits). Nous proposons un algorithme de sĂ©paration et dâĂ©valuation permettant une rĂ©solution efficace du problĂšme. Nous proposons des structures de dominance et quelques inĂ©galitĂ©s valides permettant dâamĂ©liorer les performances de lâalgorithme. Cette approche nous permet de rĂ©soudre Ă lâoptimum en un temps raisonnable de trĂšs gros problĂšmes.
Dans une seconde partie, nous Ă©tendons ces modĂšles au problĂšme gĂ©nĂ©ral avec plusieurs quais. Nous nous intĂ©ressons dâabord au terminal de type satellite oĂč lâordonnancement des camions dâentrĂ©e est connu. Ces plateformes opĂšrent en deux mouvements diffĂ©rents : lâordonnancement et chargement pour le transport de nuit et celui pour les livraisons matinales. Nous donnons une reprĂ©sentation mathĂ©matique qui permet de rĂ©soudre les problĂšmes de petite taille. Pour ceux de plus grandes ampleurs, nous utilisons une heuristique. Les rĂ©sultats numĂ©riques montrent la validitĂ© de cette approche.
Finalement, nous gĂ©nĂ©ralisons le type de plateforme (les sĂ©quences dâarrivĂ©e et de dĂ©part sont Ă dĂ©terminer) et dĂ©veloppons un nouveau modĂšle dâordonnancement plus compact. Nous utilisons pour les grandes instances une recherche par voisinage. Nous mettons en place des voisinages originaux adaptĂ©s Ă ce type dâordonnancement.
Mots clĂ©s: Transfert de produits, ordonnancement, plateforme de transbordement, recherche stochastique, programmation Ă nombres entiers, heuristiques, recherche du plus proche voisin.----------ABSTRACT : Material handling in cross-dock is a relevant class of scheduling problems in distribution centers in which inner transhipment decisions need to be considered in addition to the processing order of trucks. The problem has applications in distribution centers where operators manually perform internal transhipment. In this dissertation, we investigate the problem of material handling inside cross-docking terminals. The main component of the problem is presented, followed by a classification scheme to express its diversity. Moreover, double handling identifies the main source of deficiencies in transferring operations. The objective is to synchronize the trucksâ loading and unloading sequences with internal transferring decisions to minimize excessive product displacement inside the terminal. First, the problem is studied for a conceptual model of the platform with single receiving and shipping doors. We formalize decisions on internal transhipment and develop an algorithm to determine the best transferring plan with restricted orders on processing trucks. This algorithm is employed as an evaluation function in a stochastic search framework to ameliorate the order of processing trucks and reduce the cost of double handling. Then, a mixed integer linear programming formulation of the general problem is introduced. The proposed model determines the joint schedule between processing order of trucks at inbound and outbound doors with an internal transhipment plan. A path branching algorithm is proposed. We present several structural properties and some valid inequalities to enhance the performance of the algorithm. This method could solve fairly large instances within a reasonable time. Second, we extend the developed models and approaches to schedule material handling process for a real platform with multiple doors. In the first installment, we focus on the satellite cross-docks that have limitations on the processing order of trucks at inbound door. These platforms operate in two separate shifts: consolidating pickup freight for overnight shipments and processing received products for early morning deliveries. A mathematical formulation of the problem is presented that can solve small instances with commercial software. In addition, a sequential priority-based heuristic is introduced to tackle the large problems. Numerical results depict the stability of this approach. Finally, in the second instalment, we study the general model with no restriction on the arrival and departure pattern of trucks and formulate a new mathematical model. This model has considerably fewer variables and constraints than the previous one. Moreover, a variable neighborhood search heuristic is developed to tackle real life problems. This method consists of several operators incorporated in a search subroutine to find local optima and a perturbation operator to alter it. The developed method is adopted for three scenarios concerning limitations imposed by the network schedule. The analyzes demonstrate economical savings in the cost of material handling. Keywords: Material handling; scheduling; cross-dock; stochastic search; Integer programming; heuristic; variable neighborhood search
High-Level Object Oriented Genetic Programming in Logistic Warehouse Optimization
DisertaÄnĂ prĂĄce je zamÄĆena na optimalizaci prĆŻbÄhu pracovnĂch operacĂ v logistickĂœch skladech a distribuÄnĂch centrech. HlavnĂm cĂlem je optimalizovat procesy plĂĄnovĂĄnĂ, rozvrhovĂĄnĂ a odbavovĂĄnĂ. JelikoĆŸ jde o problĂ©m patĆĂcĂ do tĆĂdy sloĆŸitosti NP-teĆŸkĂœ, je vĂœpoÄetnÄ velmi nĂĄroÄnĂ© nalĂ©zt optimĂĄlnĂ ĆeĆĄenĂ. MotivacĂ pro ĆeĆĄenĂ tĂ©to prĂĄce je vyplnÄnĂ pomyslnĂ© mezery mezi metodami zkoumanĂœmi na vÄdeckĂ© a akademickĂ© pĆŻdÄ a metodami pouĆŸĂvanĂœmi v produkÄnĂch komerÄnĂch prostĆedĂch. JĂĄdro optimalizaÄnĂho algoritmu je zaloĆŸeno na zĂĄkladÄ genetickĂ©ho programovĂĄnĂ ĆĂzenĂ©ho bezkontextovou gramatikou. HlavnĂm pĆĂnosem tĂ©to prĂĄce je a) navrhnout novĂœ optimalizaÄnĂ algoritmus, kterĂœ respektuje nĂĄsledujĂcĂ optimalizaÄnĂ podmĂnky: celkovĂœ Äas zpracovĂĄnĂ, vyuĆŸitĂ zdrojĆŻ, a zahlcenĂ skladovĂœch uliÄek, kterĂ© mĆŻĆŸe nastat bÄhem zpracovĂĄnĂ ĂșkolĆŻ, b) analyzovat historickĂĄ data z provozu skladu a vyvinout sadu testovacĂch pĆĂkladĆŻ, kterĂ© mohou slouĆŸit jako referenÄnĂ vĂœsledky pro dalĆĄĂ vĂœzkum, a dĂĄle c) pokusit se pĆedÄit stanovenĂ© referenÄnĂ vĂœsledky dosaĆŸenĂ© kvalifikovanĂœm a trĂ©novanĂœm operaÄnĂm manaĆŸerem jednoho z nejvÄtĆĄĂch skladĆŻ ve stĆednĂ EvropÄ.This work is focused on the work-flow optimization in logistic warehouses and distribution centers. The main aim is to optimize process planning, scheduling, and dispatching. The problem is quite accented in recent years. The problem is of NP hard class of problems and where is very computationally demanding to find an optimal solution. The main motivation for solving this problem is to fill the gap between the new optimization methods developed by researchers in academic world and the methods used in business world. The core of the optimization algorithm is built on the genetic programming driven by the context-free grammar. The main contribution of the thesis is a) to propose a new optimization algorithm which respects the makespan, the utilization, and the congestions of aisles which may occur, b) to analyze historical operational data from warehouse and to develop the set of benchmarks which could serve as the reference baseline results for further research, and c) to try outperform the baseline results set by the skilled and trained operational manager of the one of the biggest warehouses in the middle Europe.
Application of Tabu Search to Scheduling Trucks in Multiple Doors Cross-Docking Systems
RĂSUMĂ : Cette recherche focus sur lâamĂ©lioration des cross-dockings en vue dâaugmenter les niveaux de performance du service et de rĂ©duire les coĂ»ts. lâalgorithme de la recherche avec tabous est Ă©tudiĂ©e pour trouver la sĂ©quence optimale dâentrĂ©e et sortie des remorques au cross-docking. Lâobjectif de cette recherche est de maximiser le nombre total de transferts directs entre le fournisseur et une destination finale commune de livraison. Dans les stratĂ©gies de distribution actuelles, lâobjectif est de synchroniser les chaines du fabricant et du client. Le cross-docking implique de recevoir les produits dâun fournisseur pour plusieurs clients et dâoccasionnellement consolider cela avec les produits dâautres fournisseurs pour des destinations finales de livraison communes.
En rĂ©sumĂ©, lâapproche examinĂ©e dans cette recherche donne une occasion significative pour lâamĂ©lioration des opĂ©rations au Cross-docking par la rĂ©duction du stockage des produits.----------ABSTRACT : Todayâs supply chain management performance has been affected by continuously increasing pressure of market forces. The pressure of market includes demands on increased flow of products and throughput with less amount of storage, also customers demand for more products with lower operational costs and more value-added services provided to customers. Supply chain is responsible in cost reduction and service levels increase by providing transshipments across its members. However supply chain has to face fluctuations of demands with the short available lead times. Physical problem of warehouse limitations and also inventory costs and shipping affect the performance of supply chain. In todayâs distribution strategies, the main goal is to provide a synchronization of customer chains and the suppliers. The objective is to reduce the inventory buffering between customers and suppliers. The idea of cross-docking is to receive different goods from a manufacturer for several end destinations and possibly consolidate the goods with other manufacturerâs items for common final customers; then ship them in the earliest possible time. The focus of this research effort is to improve cross-dock operations with the goal of increasing the service performance levels and reducing costs. Specifically, metaheuristics algorithm of Tabu search is investigated for finding optimal sequence of incoming and outgoing trailers at cross-docks. This thesis reviews available research literature on cross-dock operations. Tabu search for the truck scheduling problem is presented along with results. Tabu search algorithm is investigated for the truck scheduling problem in the multiple doors cross-docking with unknown incoming and outgoing sequences. The objective of this research is to maximize the total direct transfer of products from a supplier to common final delivery destinations. The algorithm is implemented in C++ and analyzed using different problem instances. The results gained from algorithm of Tabu search are compared with other iterative heuristic descent method. The results indicate that the Tabu search performs significantly better than the descent method for large problem instances. In general, the results present that a metaheuristic algorithm of Tabu search for multiple or single door cross-docking offers thelargest potential for improvement. In summary, the approach explored in this research offers significant opportunity to improve cross-dock operations through reducing storage of products
Scheduling cross-docking operations under uncertainty: A stochastic genetic algorithm based on scenarios tree
A cross-docking terminal enables consolidating and sorting fast-moving products along supply chain networks and reduces warehousing costs and transportation efforts. The target efficiency of such logistic systems results from synchronizing the physical and information flows while scheduling receiving, shipping and handling operations. Within the tight time-windows imposed by fast-moving products (e.g., perishables), a deterministic schedule hardly adheres to real-world environments because of the uncertainty in trucks arrivals. In this paper, a stochastic MILP model formulates the minimization of penalty costs from exceeding the time-windows under uncertain truck arrivals. Penalty costs are affected by products' perishability or the expected customerâ service level. A validating numerical example shows how to solve (1) dock-assignment, (2) while prioritizing the unloading tasks, and (3) loaded trucks departures with a small instance. A tailored stochastic genetic algorithm able to explore the uncertain scenarios tree and optimize cross-docking operations is then introduced to solve scaled up instaces. The proposed genetic algorithm is tested on a real-world problem provided by a national delivery service network managing the truck-to-door assignment, the loading, unloading, and door-to-door handling operations of a fleet of 271 trucks within two working shifts. The obtained solution improves the deterministic schedule reducing the penalty costs of 60%. Such results underline the impact of unpredicted trucksâ delay and enable assessing the savings from increasing the number of doors at the cross-dock
Managing Advanced Synchronization Aspects in Logistics Systems
In this thesis, we model various complex logistics problems and develop appropriate techniques to solve them. We improve industrial practices by introducing synchronized solutions to problems that were previously solved independently. The first part of this thesis focuses on cross-docks. We simultaneously optimize supplier orders and cross-docking operations to either reduce the storage space required or evenly distribute workload over the week. The second part of this thesis is devoted to transport problems in which two types of vehicles are synchronized, one of which can be transported by the other. The areas of application range from home services to parcel delivery to customers.
After analyzing the complexity associated with these synchronized solutions (i.e., largescale problems for which the decisions depend on each other), we design algorithms based on the "destroy-and-repair" principle to find efficient solutions. We also introduce mathematical programs for all the considered problems.
The problems under study arose directly from collaborations with various industrial partners. In this respect, our achieved solutions have been benchmarked with current industrial practice. Depending on the problem, we have been able to reduce the environmental impact generated by the industrial activities, the overall cost, or the social impact. The achieved gains compared to current industrial practice range from 10 to 70%, depending on the application.
--
Dans cette thĂšse, nous modĂ©lisons divers problĂšmes logistiques complexes et dĂ©veloppons des techniques appropriĂ©es pour les rĂ©soudre. Nous cherchons Ă amĂ©liorer certaines pratiques industrielles en introduisant des solutions synchronisĂ©es Ă des problĂšmes qui Ă©taient auparavant rĂ©solus indĂ©pendamment. La premiĂšre partie de cette thĂšse porte sur les cross-docks. Nous optimisons simultanĂ©ment les commandes fournisseurs et les opĂ©rations au sein de la plateforme de logistique pour rĂ©duire lâespace de stockage requis ou rĂ©partir uniformĂ©ment la charge de travail sur la semaine. La deuxiĂšme partie de cette thĂšse est consacrĂ©e aux problĂšmes de transport dans lesquels deux types de vĂ©hicules sont synchronisĂ©s, lâun pouvant ĂȘtre transportĂ© par lâautre. Les domaines dâapplication vont du service Ă domicile Ă la livraison de colis chez des clients.
AprĂšs avoir analysĂ© la complexitĂ© des solutions synchronisĂ©es (câest-Ă -dire des problĂšmes de grandes dimensions pour lesquels les dĂ©cisions dĂ©pendent les unes des autres), nous concevons des algorithmes basĂ©s sur le principe de "destruction / reconstruction" pour trouver des solutions efficaces. Nous modĂ©lisons Ă©galement les problĂšmes considĂ©rĂ©s avec la programmation mathĂ©matique.
Les problĂšmes Ă lâĂ©tude viennent de collaborations avec divers partenaires industriels. A cet Ă©gard, les solutions que nous prĂ©sentons sont comparĂ©es aux pratiques industrielles actuelles. En fonction du problĂšme, nous avons pu rĂ©duire lâimpact environnemental gĂ©nĂ©rĂ© par les activitĂ©s industrielles, le coĂ»t global, ou lâimpact social des solutions. Les gains obtenus par rapport aux pratiques industrielles actuelles varient de 10 Ă 70%, selon lâapplication.
Mot-clefs: Logistique, Synchronisation, ProblÚme de transport, Tournée de véhicules, Plateforme de Cross-dock (transbordement), Programmation Mathématiques, Métaheuristiques, Matheuristiques, Instances Réelle
Heuristics for Truck Scheduling at Cross Docking Terminals
Cross-docking is a logistics management concept that has been gaining global recognition in less-than-truckload logistics industries and retail firms. In cross-docking terminals, shipments are unloaded from inbound trucks at strip doors, consolidated insider cross-docks according to their destinations, and then, loaded into outbound tucks at stack doors. The goal of cross-docking is to reduce inventory and order picking which are the two most costly functions of traditional warehousing management. The sequence in which the inbound and outbound trucks have to be processed at the cross-dock is crucial for improving the efficiency of cross-docking systems. In this thesis we introduce an integer programming formulation and apply four heuristic algorithms: a local search, a simulated annealing, a large neighborhood search and a beam search, to schedule the trucks in a cross-docking terminal so as to minimize the total operational time
Truck scheduling problem in a cross-docking system with release time constraint
Abstract In a supply chain, cross-docking is one of the most innovative systems for ameliorating the operational performance at distribution centers. Cross-docking is a logistical strategy in which freight is unloaded from inbound trucks and (almost) directly loaded into outbound trucks, with little or no storage in between, thus no inventory remains at the distribution center. In this study, we consider the scheduling problem of inbound and outbound trucks with multiple dock doors, aiming at the minimization of the makespan. The considered scheduling problem determines where and when the trucks must be processed; also due to the interchangeability specification of products, product assignment is done simultaneously as well. Inbound trucks enter the system according to their release times', however, there is no mandatory time constraint for outbound truck presence at a designated stack door; they should just observe their relative docking sequences. Moreover, a loading sequence is determined for each of the outbound trucks. In this research, a mathematical model is derived to find the optimal solution. Since the problem under study is NP-hard, a simulated annealing algorithm is adapted to find the (near-) optimal solution, as the mathematical model will not be applicable to solve largescale real-world cases. Numerical examples have been done in order to specify the efficiency of the metaheuristic algorithm in comparison with the results obtained from solving the mathematical model
Cross-Docking: A Proven LTL Technique to Help Suppliers Minimize Products\u27 Unit Costs Delivered to the Final Customers
This study aims at proposing a decision-support tool to reduce the total supply chain costs (TSCC) consisting of two separate and independent objective functions including total transportation costs (TTC) and total cross-docking operating cost (TCDC). The full-truckload (FT) transportation mode is assumed to handle supplierâcustomer product transportation; otherwise, a cross-docking terminal as an intermediate transshipment node is hired to handle the less-than-truckload (LTL) product transportation between the suppliers and customers. TTC model helps minimize the total transportation costs by maximization of the number of FT transportation and reduction of the total number of LTL. TCDC model tries to minimize total operating costs within a cross-docking terminal. Both sub-objective functions are formulated as binary mathematical programming models. The first objective function is a binary-linear programming model, and the second one is a binary-quadratic assignment problem (QAP) model. QAP is an NP-hard problem, and therefore, besides a complement enumeration method using ILOG CPLEX software, the Tabu search (TS) algorithm with four diversification methods is employed to solve larger size problems. The efficiency of the model is examined from two perspectives by comparing the output of two scenarios including; i.e., 1) when cross-docking is included in the supply chain and 2) when it is excluded. The first perspective is to compare the two scenariosâ outcomes from the total supply chain costs standpoint, and the second perspective is the comparison of the scenariosâ outcomes from the total supply chain costs standpoint. By addressing a numerical example, the results confirm that the present of cross-docking within a supply chain can significantly reduce total supply chain costs and total transportation costs
- âŠ