Relevant bibliographies by topics / Docking a truck

Academic literature on the topic 'Docking a truck'

Author: Grafiati
Published: 10 December 2022
Last updated: 19 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Docking a truck.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Docking a truck"

1

Kim, Byung Soo, and Cheol Min Joo. "Scheduling Trucks in Multi-Door Cross Docking Systems: An Adaptive Genetic Algorithm with a Dispatching Rule." Asia-Pacific Journal of Operational Research 32, no. 03 (June 2015): 1550016. http://dx.doi.org/10.1142/s0217595915500165.

Full text
Abstract:
One of the most important operational management problems of a cross docking system is the truck scheduling problem. Cross docking is a logistics management concept in which products delivered to a distribution center by inbound trucks are immediately sorted out, routed and loaded into outbound trucks for delivery to customers. The truck scheduling problem in a multi-door cross docking system considered in this paper comprises the assignment of trucks to dock doors and the determination of docking sequences for all inbound and outbound trucks in order to minimize the total operation time. A mathematical model for optimal solution is derived, and the genetic algorithms (GAs) and the adaptive genetic algorithms (AGAs) as solution approaches with different types of chromosomes are proposed. The performance of the meta-heuristic algorithms are evaluated using randomly generated several examples.
APA, Harvard, Vancouver, ISO, and other styles
2

Küçükoğlu, İlker, and Nursel Öztürk. "A mathematical model for truck-door assignment and product placement problem in cross-docking center." Global Journal of Business, Economics and Management: Current Issues 7, no. 1 (April 12, 2017): 135–42. http://dx.doi.org/10.18844/gjbem.v7i1.1408.

Full text
Abstract:
In today’s cross-docking offers a significant cost benefits to companies because of the small orders and frequent deliveries in logistical environment. Cross-docking is a relatively new logistics strategy in which items are moved from suppliers to customers through cross-docking centers without putting them into long-term storage. One of the fundamental issues in cross-docking facility is to assign the incoming and outgoing trucks to the doors in order to minimize movement of the products. This paper addresses the truck-door assignment problem of cross-docking centers with product placement plans and proposes a mixed integer mathematical model to solve problem. The objective of the mathematical model is to find best truck-door assignment and product placement plans that minimize total travelling distance of the products. The proposed model is tested on a problem set which are created by using a real-life data of a logistics company. The computational results show that the proposed mathematical model can be carried out for the real-life operations to minimize movement costs of the products in cross-docking centers. Keywords: Cross-docking, truck-door assignment, product placement, mathematical modelling;
APA, Harvard, Vancouver, ISO, and other styles
3

Vahdani, Behnam, and Shayan Shahramfard. "A truck scheduling problem at a cross-docking facility with mixed service mode dock doors." Engineering Computations 36, no. 6 (July 8, 2019): 1977–2009. http://dx.doi.org/10.1108/ec-08-2018-0355.

Full text
Abstract:
Purpose The purpose of this study is truck scheduling and assignment of trucks to the doors simultaneously since these issues were considered mainly separately in the previous research. Also, the door service time and its impact on truck scheduling were not taken into account, so this research endeavors to cover this gap. Design/methodology/approach In this research, a novel model has been presented for simultaneous truck scheduling and assignment problem with time window constraints for the arrival and departure of trucks, mixed service mode dock doors and truck queuing. To resolve the developed model, two meta-heuristic algorithms, namely, genetic and imperialist competitive algorithms, are presented. Findings The computational results indicate that the proposed framework leads to increased total costs, although it has a more accurate planning; moreover, these indicate that the proposed algorithms have different performances based on the criteria considered for the comparison. Research limitations/implications There are some limitations in this research, which can be considered by other researchers to expand the current study, among them the specifications of uncertainty about arrival times of inbound and outbound trucks, number of merchandises which has been loaded on inbound trucks are the main factors. If so, by considering this situation, a realistic scheme about planning of cross docking system would be acquired. Moreover, the capacity of temporary storage has been considered unlimited, so relaxing this limitation can prepare a real and suitable situation for further study. Examining the capacity in the front of each type of doors of cross-dock and executive servers are the other aspects, which could be expanded in the future. Originality/value In this study, a mathematical programing model proposed for truck scheduling to minimize total costs including holding, truck tardiness and waiting time for queue of trucks caused by the interference of each carrier’s movement. At the operational levels, this research considered a multi-door cross-docking problem with mixed service mode dock doors and time window constraints for arrival and departure time of trucks. Moreover, M/G/C queue system was developed for truck arrival and servicing of carriers to trucks.
APA, Harvard, Vancouver, ISO, and other styles
4

Correa Issi, Gustavo, Rodrigo Linfati, and John Willmer Escobar. "Mathematical Optimization Model for Truck Scheduling in a Distribution Center with a Mixed Service-Mode Dock Area." Journal of Advanced Transportation 2020 (November 27, 2020): 1–13. http://dx.doi.org/10.1155/2020/8813372.

Full text
Abstract:
Cross-docking is a logistics strategy in which products arriving at a distribution center are unloaded from inbound trucks and sorted for transfer directly to outbound trucks, reducing costs and storage and product handling times. This paper addresses a cross-docking problem by designing a mixed-integer linear programming (MILP) model to determine a schedule for inbound and outbound trucks in a mixed service-mode dock area that minimizes the time from when the first inbound truck arrives until the last outbound truck departs (makespan). The model is developed using AMPL software with the CPLEX and Gurobi solvers, which provide results for different instances, most of these with actual shift data from an integrated distribution center of a multinational food company located in Concepción, Chile. The results obtained from the case study are notable and show the effectiveness of the proposed mathematical model.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhou, Binghai, and Shi Zong. "Adaptive memory red deer algorithm for cross-dock truck scheduling with products time window." Engineering Computations 38, no. 8 (March 8, 2021): 3254–89. http://dx.doi.org/10.1108/ec-05-2020-0273.

Full text
Abstract:
Purpose The cross-docking strategy has a significant influence on supply chain and logistics efficiency. This paper aims to investigate the most suitable and efficient way to schedule the transfer of logistics activities and present a meta-heuristic method of the truck scheduling problem in cross-docking logistics. A truck scheduling problem with products time window is investigated with objectives of minimizing the total product transshipment time and earliness and tardiness cost of outbound trucks. Design/methodology/approach This research proposed a meta-heuristic method for the truck scheduling problem with products time window. To solve the problem, a lower bound of the problem is built through a novel two-stage Lagrangian relaxation problem and on account of the NP-hard nature of the truck scheduling problem, the novel red deer algorithm with the mechanism of the heuristic oscillating local search algorithm, as well as adaptive memory programming was proposed to overcome the inferior capability of the original red deer algorithm in the aspect of local search and run time. Findings Theory analysis and simulation experiments on an industrial case of a cross-docking center with a product’s time window are conducted in this paper. Satisfactory results show that the performance of the red deer algorithm is enhanced due to the mechanism of heuristic oscillating local search algorithm and adaptive memory programming and the proposed method efficiently solves the real-world size case of truck scheduling problems in cross-docking with product time window. Research limitations/implications The consideration of products time window has very realistic significance in different logistics applications such as cold-chain logistics and pharmaceutical supply chain. Furthermore, the novel adaptive memory red deer algorithm could be modified and applied to other complex optimization scheduling problems such as scheduling problems considering energy-efficiency or other logistics strategies. Originality/value For the first time in the truck scheduling problem with the cross-docking strategy, the product’s time window is considered. Furthermore, a mathematical model with objectives of minimizing the total product transshipment time and earliness and tardiness cost of outbound trucks is developed. To solve the proposed problem, a novel adaptive memory red deer algorithm with the mechanism of heuristic oscillating local search algorithm was proposed to overcome the inferior capability of genetic algorithm in the aspect of local search and run time.
APA, Harvard, Vancouver, ISO, and other styles
6

Yu, Wooyeon, Chunghun Ha, and SeJoon Park. "A Hybrid Genetic Algorithm for Integrated Truck Scheduling and Product Routing on the Cross-Docking System with Multiple Receiving and Shipping Docks." Mathematical Problems in Engineering 2021 (March 17, 2021): 1–17. http://dx.doi.org/10.1155/2021/2026834.

Full text
Abstract:
In this research, a truck scheduling problem for a cross-docking system with multiple receiving and shipping docks is studied. Until recently, single-dock cross-docking problems are studied mostly. This research is focused on the multiple-dock problems. The objective of the problem is to determine the best docking sequences of inbound and outbound trucks to the receiving and shipping docks, respectively, which minimize the maximal completion time. We propose a new hybrid genetic algorithm to solve this problem. This genetic algorithm improves the solution quality through the population scheme of the nested structure and the new product routing heuristic. To avoid unnecessary infeasible solutions, a linked-chromosome representation is used to link the inbound and outbound truck sequences, and locus-pairing crossovers and mutations for this representation are proposed. As a result of the evaluation of the benchmark problems, it shows that the proposed hybrid GA provides a superior solution compared to the existing heuristics.
APA, Harvard, Vancouver, ISO, and other styles
7

Serrano, Christian, Javier Moral, Xavier Delorme, and Alexandre Dolgui. "Cross-docking Operation Scheduling: Truck Arrivals, Shop-Floor Activities and Truck Departures." IFAC-PapersOnLine 49, no. 12 (2016): 1353–58. http://dx.doi.org/10.1016/j.ifacol.2016.07.751.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kuo, Yiyo. "Optimizing truck sequencing and truck dock assignment in a cross docking system." Expert Systems with Applications 40, no. 14 (October 2013): 5532–41. http://dx.doi.org/10.1016/j.eswa.2013.04.019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hengmeechai, Piya, Takashi Irohara, and Warisa Wisittipanich. "Truck scheduling problems in the cross docking network." International Journal of Logistics Systems and Management 33, no. 3 (2019): 420. http://dx.doi.org/10.1504/ijlsm.2019.10022658.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wisittipanich, Warisa, Takashi Irohara, and Piya Hengmeechai. "Truck scheduling problems in the cross docking network." International Journal of Logistics Systems and Management 33, no. 3 (2019): 420. http://dx.doi.org/10.1504/ijlsm.2019.101164.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Docking a truck"

1

ANDERSSON, OSCAR, and LUCAS MOLIN. "AutoTruck : Automated docking with internal sensors." Thesis, KTH, Mekatronik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-233142.

Full text
Abstract:
The purpose of this bachelor thesis was to discover how an articulated vehicle can park itself using a pre-defined parking path with a combination of ultrasonic sensors as well as a rotary angle sensor. The project was divided into two parts: constructing a small scale demonstrator and the software controlling the demonstrator. The demonstrator was constructed from offthe- shelf components and custom parts. The truck was designed based on a rear wheel driven truck with Ackermann steering. The localization of a parking spot and measuring other distances was done with ultrasonic sensors and the hitch angle was measured by a rotary angle sensor. The performance of the demonstrator was evaluated by measuring the trailers angle difference from the center line of the parking spot. The performance was deemed to be reasonably good with successful parkings in 8 out of 10 attempts.
Kandidatarbetet syftar till att undersöka hur ett ledat fordon kan parkera sig självt efter en förbestämd parkeringsrutt med en kombination av flera ultraljudssensorer samt en vinkelgivare. Projektet består av två delar; konstruktion av ett miniatyrfordon samt mjukvaran som styr fordonet. Fordonet tillverkades från butiksköpta komponenter och skräddarsydda delar. Lastbilens design var baserad på en bakhjulsdriven Ackermannstyrd lastbil. Identifieringen av en parkeringsplats samt avståndsmätning hanterades av ultraljudssensorer och hitch vinkeln mättes av en vinkelgivare. Miniatyrfordonets prestanda utvärderades genom att mäta släpets vinkelskillnad från centerlinjen av parkeringsplatsen. Prestandan ansågs att vara tillräckligt god med lyckade parkeringar i 8 av 10 tester.
APA, Harvard, Vancouver, ISO, and other styles
2

Andersson, Oscar, and Lucas Molin. "AutoTruck : Automated docking with internal sensors." Thesis, KTH, Maskinkonstruktion (Inst.), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-230383.

Full text
Abstract:
The purpose of this bachelor thesis was to discover howan articulated vehicle can park itself using a pre-definedparking path with a combination of ultrasonic sensors aswell as a rotary angle sensor.The project was divided into two parts: constructing asmall scale demonstrator and the software controlling thedemonstrator. The demonstrator was constructed from offthe-shelf components and custom parts. The truck was designedbased on a rear wheel driven truck with Ackermannsteering. The localization of a parking spot and measuringother distances was done with ultrasonic sensors and thehitch angle was measured by a rotary angle sensor.The performance of the demonstrator was evaluated bymeasuring the trailers angle difference from the center lineof the parking spot.The performance was deemed to be reasonably goodwith successful parkings in 8 out of 10 attempts.
Kandidatarbetet syftar till att undersöka hur ett ledatfordon kan parkera sig självt efter en förbestämd parkeringsruttmed en kombination av flera ultraljudssensorersamt en vinkelgivare.Projektet består av två delar; konstruktion av ett miniatyrfordonsamt mjukvaran som styr fordonet. Fordonettillverkades från butiksköpta komponenter och skräddarsyddadelar. Lastbilens design var baserad p°a en bakhjulsdrivenAckermannstyrd lastbil. Identifieringen av en parkeringsplatssamt avståndsmätning hanterades av ultraljudssensoreroch hitch vinkeln mättes av en vinkelgivare.Miniatyrfordonets prestanda utvärderades genom attmäta släpets vinkelskillnad från centerlinjen av parkeringsplatsen.Prestandan ansågs att vara tillräckligt god med lyckadeparkeringar i 8 av 10 tester.
APA, Harvard, Vancouver, ISO, and other styles
3

Nourmohammasi, Sharabiani Shahin. "Obtaining optimal and approximate solutions to the problem of scheduling inbound and outbound trucks in cross docking operations." Thesis, Högskolan i Borås, Institutionen Ingenjörshögskolan, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-19500.

Full text
Abstract:
The thesis focuses on optimization of inbound and outbound truck scheduling with thegoal of minimizing total operation time of cross docking. A model of cross docking isdeveloped; two different methods are applied on the model in order to find an optimaldocking sequence for receiving and shipping trucks and their assignment to receiving andshipping docks, and product routing from receiving to shipping trucks.The two methods used were mathematical modeling and heuristic algorithm. For the firstmethod, a mixed integer programming model was developed to minimize total operationtime; AMPL modeling language is used for the mathematical modeling for small sizedproblems. For the second method, a heuristic algorithm was developed to find nearoptimal solutions fast and was used for problems of larger size. In order to examine theperformance of heuristic algorithm, small problems were solved by both mathematicalmodel and the heuristic algorithm.The results from the mathematical model and the heuristic algorithm are very close withslight differences in receiving and shipping truck docking sequence, and in productrouting between these two methods. In addition, the heuristic algorithm also calculatesnumber of products transferring from receiving trucks to the temporary storage as well asthe number of products transferring from the temporary storage to shipping truck incontrary to the mathematical model. Total number of units of products passing throughthe temporary storage calculated by heuristic algorithm is presented and it can be seenthat the heuristic algorithm transfers to the temporary storage as few products as possible.Furthermore, in cases that receiving and shipping trucks are divided into groups orclusters in the cross docking operation, heuristic algorithm can be used to calculateoptimal number of receiving and shipping docks based on preferences of total operationtime or total number of products passing through the temporary storage.Another issue which is focused on is the problem of dock door assignment. Closeshipping docks to each receiving dock are determined and the percentage of productstransferred from a receiving dock to its close shipping docks is calculated as a method tomeasure the performance of the dock assignment solution.
APA, Harvard, Vancouver, ISO, and other styles
4

Ladier, Anne-Laure. "Planification des opérations de cross-docking : prise en compte des incertitudes opérationelles et de la capacité des ressources internes." Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENI066/document.

Full text
Abstract:
Dans une plateforme de cross-docking, les produits sont déchargés descamions entrants, triés puis directement rechargés dans les camions sortants– chaque produit passe moins de 24 heures sur la plateforme.L’analyse des écarts entre la littérature et les observations réalisées sur leterrain permet de dégager deux axes de recherche : la prise en compte desincertitudes opérationnelles d’une part, et de la capacité des ressourceshumaines de la plateforme d’autre part.Le problème de planification des camions entrants et sortants avec fenêtrede temps est modélisé par un programme linéaire et résolu par troisheuristiques différentes. La robustesse des plannings obtenus est ensuitetestée à l’aide d’un modèle de simulation à événements discrets, qui permetd’évaluer plusieurs reformulations robustes du modèle initial.Le problème de planification des employés sur la plateforme est traité àl’aide de trois programmes linéaires mixtes, résolus de façon séquentielle.La combinaison des deux modèles permet d’obtenir un modèle d’aide àla décision pour une plateforme de cross-docking
In a cross-docking platform, goods are unloaded from inbound trucks,sorted and directly reloaded in outbound trucks – each product typicallystays less than 24 hours in the platform.By analyzing the gaps between the literature and on-field observations,we highlight two research directions: accounting for operational uncertainties,and for the human resource capacity in the platform.A truck scheduling problem with time windows for the inbound andoutbound trucks is modeled with an integer program and solved withthree different heuristics. The robustness of the schedules obtained is thentested with a discrete-event simulation model, which enables to evaluateseveral robust reformulations of the initial model.The employee timetabling and rostering problem in the platform is addressedwith three mixed integer linear problems solved sequentially. Thetwo models can be combined to serve as a decision-support tool for across-docking platform
APA, Harvard, Vancouver, ISO, and other styles
5

Chargui, Tarik. "Optimisation et simulation des opérations de cross-docking dans le contexte de l'internet physique." Thesis, Valenciennes, Université Polytechnique Hauts-de-France, 2020. http://www.theses.fr/2020UPHF0012.

Full text
Abstract:
Dans cette thèse, nous étudions les problèmes d’optimisation des opérations de crossdocking dans le contexte de l’Internet Physique (PI). Ce nouveau concept a été introduit pour améliorer la flexibilité, la synchronisation et la durabilité des systèmes logistiques. Nous nous intéressons particulièrement à la planification des opérations dans plusieurs types de cross-docks (les PI-hubs), à savoir le Road-Road, le Road-Rail et le Rail-Road PI-hub. Nous commençons par modéliser mathématiquement le problème de planification des véhicules dans un cross-dock Road-Road classique et puis nous développons deux méta-heuristiques stables et performantes par rapport aux solutions obtenues par le solveur CPLEX. Cette première étude a été réalisée afin d’entamer par la suite le passage vers le Road-Road PI-hub à travers une simulation à événements discrets pour évaluer la robustesse des deux types de cross-docks et en proposant également un couplage simulation-optimisation qui permet d’obtenir des solutions robustes efficaces même en cas des perturbations. Ensuite, nous proposons un modèle multi-agent MAS pour la planification des opérations dans un Road-Rail PI-hub. La performance et la stabilité du MAS ont été validées par un modèle mathématique MILP implémenté sur CPLEX et ensuite sur un benchmark d’instances de la littérature. La réactivité du MAS a été également validée dans un environnement dynamique sous perturbations. Enfin, nous étudions la planification durable dans un Rail-Road PI-hub. Nous proposons un modèle mathématique de programmation lexicographique multi-objectifs MO-MIP résolu sur CPLEX. Puis, deux méta-heuristiques hybrides sont proposée pour minimiser à la fois la consommation énergétique des PI-convoyeurs ainsi que le coût d’utilisation des véhicules. Les deux méta-heuristiques génèrent des solutions optimales et quasi-optimales dans des temps de calculs très réduits
This doctoral thesis addresses the cross-docking optimization problems in the context of the Physical Internet (PI). This new paradigm was introduced to improve the flexibility, synchronization and sustainability of the supply chain and logistics systems. We focus on the operations scheduling in several types of cross-docks (called PI-hubs in the context of the PI), namely the Road-Road, Road-Rail and the Rail-Road PI-hub. After analyzing the state of the art of the Physical Internet optimization problems in the global supply chain, especially for classical cross-docks and PI-hubs, we address the problem of truck scheduling in a classical Road-Road cross-dock through different approaches (MILP, meta-heuristics, etc.) in order to evaluate its performances compared to the Road-Road PI-hub through a discrete event simulation study to evaluate the robustness of the two cross-docks and also by proposing a simulation-optimization approach. Next, we propose a multi-agent model MAS for scheduling operations in a Road-Rail PI-hub. The performance and the stability of the MAS are validated by a MILP model and then on a benchmark instances from the literature. The MAS is also evaluated in a dynamic environment under perturbations. The results obtained showed the ability of the MAS to react to perturbations. Finally, we study the Rail-Road PI-hub sustainable scheduling. We propose a multi-objective mathematical model MO-MIP using lexicographic programming to minimize the energy consumption of PI-conveyors as well as the cost of using trucks. Then, two hybrid and multi-objective meta-heuristics are proposed, namely MO-VNSSA and MO-VNSTS
APA, Harvard, Vancouver, ISO, and other styles
6

Lindsey, Kathleen A. "Improving freight consolidation networks using IP-based local search." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45786.

Full text
Abstract:
This dissertation addresses problems arising in freight routing and scheduling where full truckload (FTL) and less-than-truckload (LTL) carriers are used to serve transportation needs. Each of the problems investigated in this dissertation tries to optimize/maximize consolidation to decrease system transportation costs by (1) carefully choosing the timing and path of freight and/or (2) introducing consolidation points. Approaches are proposed that enable effective planning and operation of freight routing and scheduling for large-scale transportation networks. Chapter 2 presents solution approaches for a shipper pickup and delivery planning problem faced by many large retailers to move freight from suppliers to distribution centers. Each shipment is moved either direct via a LTL carrier or possibly consolidated with other shipments and moved by one or two FTL routes. When using a FTL carrier, the shipper takes advantage of contracted lane rates that establish prices per mile for a truck operated between two locations that are significantly less than the comparable LTL price for shipping a full truckload. Consolidated FTL routes may each visit multiple shipment origins (supplier locations) and/or destinations (distribution center locations). Additionally, FTL routes may move shipments through a single crossdock facility en route. The challenge in this planning problem is to exploit as much as possible negotiated truckload lane rates and to judiciously make use of routes through crossdock facilities to consolidate shipments. The primary contributions of this section are that (1) an interesting new problem variant is introduced to the field of transportation and logistics that is important in practice and (2) the solution approach demonstrates that exploiting knowledge of the problem and solution structure to cleverly select subsets of path variables for evaluation during each iteration of an integer programming based local search heuristic is effective on path-based routing models. Chapter 3 evaluates how to route each customer shipment through a sequence of transfer terminals in a LTL carrier network. At each terminal stop, a shipment is unloaded from an inbound trailer and reloaded onto an outbound trailer. A load plan determines the specific sequence of terminal transfers to be used for freight moving between each origin and destination. The design of the load plan determines the linehaul transportation and handling costs required to serve customers. We develop an improved very large-scale neighborhood search heuristic for solving an integer programming model for load plan design. The main contributions of this section include (1) the investigation of the pros and cons of optimizing system-wide into a single destination versus optimizing freight for all destinations in a small region, and (2) a solution approach that can find load plans with costs 6 to 7\% lower than those used in practice, and can find 2.5 to 5\% additional cost savings using the same time budget when compared to an approach optimizing system-wide into a single destination. Chapter 4 addresses a strategic planning problem that extends the load plan design problem to consider terminal roles. We investigate two-stage approaches that first identify the set of transfer terminals and then develop the corresponding load plan. Computational results compare the terminals chosen as transfer facilities from the proposed integer programming based local search method with a traditional hub location formulation and a simple facility location formulation to depict the benefits gained from modeling additional information. The key contributions of this section are (1) the introduction of a new hub location problem variant incorporating freight dispatch timing and trailer transportation cost characteristics found in the LTL trucking industry and (2) a solution approach utilizing IP-based local search that demonstrates the importance of incorporating freight dispatch timing. Finally, Chapter 5 summarizes the main conclusions from this dissertation and discusses directions for further research.
APA, Harvard, Vancouver, ISO, and other styles
7

Yan, Wenying. "Heuristics for Truck Scheduling at Cross Docking Terminals." Thesis, 2014. http://spectrum.library.concordia.ca/978412/1/Yan_MSc_S2014.pdf.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
8

Lopez, Amanda Guadalupe Rodriguez, and 艾蔓妲. "Dock Assignment and Truck Scheduling at Cross-docking Terminals." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/93154753947882912928.

Full text
Abstract:
碩士
元智大學
工業工程與管理學系
99
In a cross docking system products are received at the terminal, occasionally gathered with other products going to the same destination, then shipped at the earliest opportunity, without going into long-term storage. Applying cross docking in the distribution network can reduce transportation cost, the inventory holding cost, cycle time and increase customer satisfaction. In order to obtain such benefits, the company should be able to operate the cross docking effectively and efficiently. For this purpose several scheduling and door assignment procedures have been introduced in recent years, which aim at solving the so called truck scheduling and dock assignment problem. This research deals with both dock assignment and truck scheduling problems. The integration of both problems is discussed in two scenarios: one considers a static dock assignment and truck scheduling, and the other one addresses a dynamic dock assignment and truck scheduling. Mathematical formulations for both problems are first presented as 0-1 integer programming models. Since both dock assignment and truck scheduling problems are NP-hard, the integration of both problems is more difficult to solve. Thus we propose different heuristic algorithms to solve the integrated problem. For the static dock assignment and truck scheduling three different reduced variable neighborhood search (RVNS) algorithm frameworks are proposed, while for the dynamic dock assignment and truck scheduling a RVNS algorithm with three different types of solution initialization is proposed. The experimental results show that the RVNS algorithms for the static dock assignment and truck scheduling are capable of finding good solutions in a much shorter computation time when it is compared with Gurobi optimizer solutions. For the RVNS for the dynamic dock assignment and truck scheduling it was observed that the algorithm converges to the same quality of solution no matter the type of initial solution generated for small instances, however for large instances a better quality of solution is obtained when the algorithm is seeded by a construction heuristic.
APA, Harvard, Vancouver, ISO, and other styles
9

Kuo, Wen-Ling, and 郭紋伶. "Truck Dock Assignment Problem in a Cross Docking System with Operational Time Constraint." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/63756592190405446177.

Full text
Abstract:
碩士
國立臺灣科技大學
工業管理系
98
In this paper, we consider a truck dock assignment problem with an operational time constraint in a crossdock where the number of trucks exceeds the number of docks available. The objective of the problem is to find an optimal truck dock assignment to minimize the sum of the total dock operational cost and the penalty cost for all the unfulfilled shipments. The problem is limited by the crossdock capacity where the cargo temporary storage. The problem feasibility is affected by three factors: the arrival and departure time windows of each truck, the operational time for the cargo shipments among the docks, and the total capacity available to the crossdock. Two heuristics are proposed in this paper for the problem. To obtain a better solution, a Particle Swarm Optimization (PSO) algorithm combined with the heuristics is also proposed. Computational experiments show that the heuristics alone perform better than an existing tabu search (TS) algorithm in terms of computation time and solution quality. The PSO algorithm also outperforms the TS algorithm when both employing the heuristics.
APA, Harvard, Vancouver, ISO, and other styles
10

Chuang, Jung-Fa, and 莊榮發. "Inbound and outbound truck scheduling in multiple docks and limited capacity cross docking system." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/67561730323149926756.

Full text
Abstract:
碩士
國立臺灣大學
工業工程學研究所
100
Recently, more and more research has focused on the topic of cross-docking systems. Adopting a cross-docking system is one of the techniques for supply chain management. The research of the cross-dock system can be divided into three categories: operational, tactical and strategic operations. Our study concentrates on the operational operation about the inbound and outbound trucks scheduling in which determines the arrival and departure times for the inbound and outbound trucks. With the multiple loading and unloading dock doors more than one trucks can simultaneously enter the cross docking system to load or unload cargos. In addition, there is a limited capacity space for storing the unloaded products temporarily, which affects the sequence and the loading operation for the inbound trucks. A well-planed truck scheduling will increase the efficiency of the cross-docking system, and the outbound trucks can deliver products on time to the retailers and improve the customer satisfaction. For the problem, we construct a mixed integer programming model. And then, we propose the heuristic algorithm (CDS Heurisitc Algorithm) to solve the medium and large size problem instance, which result show that our heuristic algorithm can indeed get good solutions in reasonable time.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Docking a truck"

1

Sime, Stuart. 15. Track Allocation and Case Management. Oxford University Press, 2018. http://dx.doi.org/10.1093/he/9780198823100.003.1711.

Full text
Abstract:
Judicial case management of civil litigation is one of the central planks of the Civil Procedure Rules 1998 (CPR). In exercising their powers to manage cases, the courts will be seeking to secure the overriding objective of the CPR of ensuring that cases are dealt with justly and at proportionate cost. This chapter discusses procedural judges; docketing; provisional track allocation; filing directions questionnaires; track allocation rules; notice of allocation; allocation directions; ADR and stays to allow for settlement; transfer to appropriate court; trial in the Royal Courts of Justice; changing tracks; and subsequent case management.
APA, Harvard, Vancouver, ISO, and other styles
2

Sime, Stuart. 15. Track allocation and case management. Oxford University Press, 2017. http://dx.doi.org/10.1093/he/9780198787570.003.1711.

Full text
Abstract:
Judicial case management of civil litigation is one of the central planks of the Civil Procedure Rules 1998 (CPR). In exercising their powers to manage cases, the courts will be seeking to secure the overriding objective of the CPR of ensuring that cases are dealt with justly and at proportionate cost. This chapter discusses procedural judges; docketing; provisional track allocation; filing directions questionnaires; track allocation rules; notice of allocation; allocation directions; ADR and stays to allow for settlement; transfer to appropriate court; trial in the Royal Courts of Justice; changing tracks; and subsequent case management.
APA, Harvard, Vancouver, ISO, and other styles
3

Sime, Stuart. 15. Track allocation and case management. Oxford University Press, 2016. http://dx.doi.org/10.1093/he/9780198747673.003.1711.

Full text
Abstract:
Judicial case management of civil litigation is one of the central planks of the Civil Procedure Rules 1998 (CPR). In exercising their powers to manage cases, the courts will be seeking to secure the overriding objective of the CPR of ensuring that cases are dealt with justly and at proportionate cost. This chapter discusses procedural judges; docketing; provisional track allocation; filing directions questionnaires; track allocation rules; notice of allocation; allocation directions; ADR and stays to allow for settlement; transfer to appropriate court; trial in the Royal Courts of Justice; changing tracks; and subsequent case management.
APA, Harvard, Vancouver, ISO, and other styles
4

R, Price C., Walter L. M, and Lyndon B. Johnson Space Center., eds. Track and capture of the orbiter with the Space Station remote manipulator system. Houston, Tex: National Aeronautics and Space Administration, Johnson Space Center, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Docking a truck"

1

Li, Jing-feng, Yan Ye, and Hui Fu. "Research on Truck Scheduling with Preemption in Cross-Docking Systems." In Proceedings of the 22nd International Conference on Industrial Engineering and Engineering Management 2015, 147–56. Paris: Atlantis Press, 2016. http://dx.doi.org/10.2991/978-94-6239-180-2_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Diglio, Antonio, Andrea Genovese, and Carmela Piccolo. "An Optimization Model for the Outbound Truck Scheduling Problem at Cross-Docking Platforms." In Springer Proceedings in Mathematics & Statistics, 601–10. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67308-0_60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zouhaier, Houda, and Lamjed Ben Said. "Multi-agent Based Truck Scheduling Using Ant Colony Intelligence in a Cross-Docking Platform." In Advances in Intelligent Systems and Computing, 457–66. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53480-0_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gaudioso, Manlio, M. Flavia Monaco, and Marcello Sammarra. "A Decomposition-Based Heuristic for the Truck Scheduling Problem in a Cross-Docking Terminal." In AIRO Springer Series, 265–73. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00473-6_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sime, Stuart. "15. Track Allocation and Case Management." In A Practical Approach to Civil Procedure, 162–82. Oxford University Press, 2019. http://dx.doi.org/10.1093/he/9780198838593.003.0015.

Full text
Abstract:
Judicial case management of civil litigation is one of the central planks of the Civil Procedure Rules 1998 (CPR). In exercising their powers to manage cases, the courts will be seeking to secure the overriding objective of the CPR of ensuring that cases are dealt with justly and at proportionate cost. This chapter discusses procedural judges; docketing; provisional track allocation; filing directions questionnaires; track allocation rules; notice of allocation; allocation directions; ADR and stays to allow for settlement; transfer to appropriate court; trial in the Royal Courts of Justice; changing tracks; and subsequent case management.
APA, Harvard, Vancouver, ISO, and other styles
6

Sime, Stuart. "15. Track Allocation and Case Management." In A Practical Approach to Civil Procedure, 158–78. Oxford University Press, 2020. http://dx.doi.org/10.1093/he/9780198858386.003.0015.

Full text
Abstract:
Judicial case management of civil litigation is one of the central planks of the Civil Procedure Rules 1998 (CPR). In exercising their powers to manage cases, the courts will be seeking to secure the overriding objective of the CPR of ensuring that cases are dealt with justly and at proportionate cost. This chapter discusses procedural judges; docketing; provisional track allocation; filing directions questionnaires; track allocation rules; notice of allocation; allocation directions; ADR and stays to allow for settlement; transfer to appropriate court; trial in the Royal Courts of Justice; changing tracks; and subsequent case management.
APA, Harvard, Vancouver, ISO, and other styles
7

Sime, Stuart. "15. Track Allocation and Case Management." In A Practical Approach to Civil Procedure, 159–79. Oxford University Press, 2022. http://dx.doi.org/10.1093/he/9780192859365.003.0015.

Full text
Abstract:
Judicial case management of civil litigation is one of the central planks of the Civil Procedure Rules 1998 (CPR). In exercising their powers to manage cases, the courts will be seeking to secure the overriding objective of the CPR of ensuring that cases are dealt with justly and at proportionate cost. This chapter discusses procedural judges; docketing; provisional track allocation; filing directions questionnaires; track allocation rules; notice of allocation; allocation directions; ADR and stays to allow for settlement; transfer to appropriate court; trial in the Royal Courts of Justice; changing tracks; and subsequent case management.
APA, Harvard, Vancouver, ISO, and other styles
8

Sime, Stuart. "15. Track Allocation and Case Management." In A Practical Approach to Civil Procedure, 159–79. Oxford University Press, 2021. http://dx.doi.org/10.1093/he/9780192844521.003.0015.

Full text
Abstract:
Judicial case management of civil litigation is one of the central planks of the Civil Procedure Rules 1998 (CPR). In exercising their powers to manage cases, the courts will be seeking to secure the overriding objective of the CPR of ensuring that cases are dealt with justly and at proportionate cost. This chapter discusses procedural judges; docketing; provisional track allocation; filing directions questionnaires; track allocation rules; notice of allocation; allocation directions; ADR and stays to allow for settlement; transfer to appropriate court; trial in the Royal Courts of Justice; changing tracks; and subsequent case management.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Docking a truck"

1

Zouhaier, Houda, and Lamjed Ben Said. "Robust scheduling of truck arrivals at a cross-docking platform." In ACSW 2017: Australasian Computer Science Week 2017. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3014812.3014840.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tsiogas, Efthimios, Ioannis Kleitsiotis, Ioannis Kostavelis, Andreas Kargakos, Dimitris Giakoumis, Marc Bosch-Jorge, Raquel Julia Ros, Rafa Lopez Tarazon, Spyridon Likothanassis, and Dimitrios Tzovaras. "Pallet detection and docking strategy for autonomous pallet truck AGV operation." In 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2021. http://dx.doi.org/10.1109/iros51168.2021.9636270.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pan, Fei, and Tijun Fan. "Inbound and Outbound Truck Scheduling in a Cross-Docking Center for Fresh Products." In 2019 International Conference on Industrial Engineering and Systems Management (IESM). IEEE, 2019. http://dx.doi.org/10.1109/iesm45758.2019.8948106.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wisittipanich, W., and P. Hengmeechai. "Comparison of PSO and DE for truck scheduling in multi-door cross docking terminals." In 2017 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2017. http://dx.doi.org/10.1109/ieem.2017.8289849.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ladier, Anne-Laure, and Gulgun Alpan. "Integrating truck scheduling and employee rostering in a cross-docking platform - an iterative approach." In 2015 International Conference on Industrial Engineering and Systems Management (IESM). IEEE, 2015. http://dx.doi.org/10.1109/iesm.2015.7380232.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ye, Yan, Jing-feng Li, Richard Y. K. Fung, Kaibin Li, and Hui Fu. "Optimizing truck scheduling in a cross-docking system with preemption and unloading/loading sequence constraint." In 2018 IEEE 15th International Conference on Networking, Sensing and Control (ICNSC). IEEE, 2018. http://dx.doi.org/10.1109/icnsc.2018.8361332.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Manupati, Vijaya Kumar, Siddharth Madan, Somnath Lahiri, and Jayakrishna K. "A novel framework and effective scheduling of cross-docking center for multi-objective truck Scheduling Problem." In 2018 International Conference on Production and Operations Management Society (POMS). IEEE, 2018. http://dx.doi.org/10.1109/poms.2018.8629444.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bu, Fanping, and Han-Shue Tan. "Pneumatic Brake Actuator Design and Modeling for the Precision Stopping Control of Automated Bus." In ASME 2005 International Mechanical Engineering Congress and Exposition. ASMEDC, 2005. http://dx.doi.org/10.1115/imece2005-80616.

Full text
Abstract:
Precision stopping is an important automated vehicle control function that is critical in applications such as precision bus docking, automated truck or bus fuelling, as well as automatic intersection or toll booth stopping. The initial applications of this technology are most likely to be applied to heavy-duty vehicles such as buses or trucks. Such applications require specific attention to brake control since the characteristics of a typical pneumatic brake system of a heavy vehicle is inherently nonlinear with large uncertainties. The feasibility of providing a smooth precision stopping brake control based on a conventional pneumatic brake system has not yet been demonstrated. As the first step toward the fine braking control of conventional pneumatic brake system, this paper describes the design of a pneumatic brake actuator based on the “off-the-shelf” components for the precision stopping control of an automated bus and details the modelling of each components. In order to facilitate controller design, the complex “component by component” model is reduced to a more tractable one which still preserves the basic nonlinear characteristics of the original system. Both physical explanation and experimental data are provided to justify the model reduction and validate the simplified model which is used for controller design in [1.]
APA, Harvard, Vancouver, ISO, and other styles
9

Clowes, Ted J., and Richard F. Schuma. "Target Acquisition And Track In The Laser Docking Sensor." In 1988 Technical Symposium on Optics, Electro-Optics, and Sensors, edited by Charles B. Weaver. SPIE, 1988. http://dx.doi.org/10.1117/12.946660.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Luo, Ren C., Chien H. Huang, and Chun Y. Huang. "Search and track power charge docking station based on sound source for autonomous mobile robot applications." In 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2010). IEEE, 2010. http://dx.doi.org/10.1109/iros.2010.5649993.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Docking a truck' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography