[ { "id": "https://openalex.org/W2266308794", "doi": "10.7232/iems.2015.14.3.299", "title": "A Multi-Objective Differential Evolution for Just-In-Time Door Assignment and Truck Scheduling in Multi-door Cross Docking Problems", "year": 2015, "publication_date": "2015-09-30", "type": "article", "language": "en", "authors": [ "Warisa Wisittipanich", "Piya Hengmeechai" ], "first_author": "Warisa Wisittipanich", "venue": "Industrial Engineering & Management Systems", "publisher": null, "abstract": "Nowadays, the distribution centres aim to reduce costs by reducing inventory and timely shipment. Cross docking is a logistics strategy in which products delivered to a distribution centre by inbound trucks are directly unloaded and transferred to outbound trucks with minimum warehouse storage. Moreover, on-time delivery in a distribution network becomes very crucial especially when several distribution centres and customers are involved. Therefore, an efficient truck scheduling is needed to synchronize the delivery throughout the network in order to satisfy all stake-holders. This paper presents a mathematical model of a mixed integer programming for door assignment and truck scheduling in a multiple inbound and outbound doors cross docking problem according to Just-In-Time concept. The objective is to find the schedule of transhipment operations to simultaneously minimize the total earliness and total tardiness of trucks. Then, a multi-objective differential evolution (MODE) is proposed with an encoding scheme and four decoding strategies, called ITSH, ITDD, OTSH and OTDD, to find a Pareto frontier for the multi-door cross docking problems. The performances of MODE are evaluated using 15 generated instances. The numerical experiments demonstrate that the proposed algorithm is capable of finding a set of diverse and high quality non-dominated solutions.", "keywords": [ "Truck", "Tardiness", "Scheduling (production processes)", "Doors", "Pareto principle", "Computer science", "Integer programming", "Mathematical optimization", "Job shop scheduling", "Vehicle routing problem", "Schedule", "Operations research" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "http://koreascience.or.kr:80/article/JAKO201530261999157.pdf" }, { "id": "https://openalex.org/W4296767464", "doi": "10.1016/j.engappai.2022.105439", "title": "Machine learning approach for truck-drones based last-mile delivery in the era of industry 4.0", "year": 2022, "publication_date": "2022-09-20", "type": "article", "language": "en", "authors": [ "Ali Arishi", "Krishna Krishnan", "Majed Arishi" ], "first_author": "Ali Arishi", "venue": "Engineering Applications of Artificial Intelligence", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Truck", "Computer science", "Travelling salesman problem", "Cluster analysis", "Last mile (transportation)", "Vehicle routing problem", "Routing (electronic design automation)", "Mile", "Operations research", "Artificial intelligence", "Computer network" ], "cited_by_count": 66, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.engappai.2022.105439" }, { "id": "https://openalex.org/W3004009942", "doi": "10.1016/j.trb.2019.12.009", "title": "A generic model for the local container drayage problem using the emerging truck platooning operation mode", "year": 2020, "publication_date": "2020-01-29", "type": "article", "language": "en", "authors": [ "Jintao You", "Lixin Miao", "Canrong Zhang", "Zhaojie Xue" ], "first_author": "Jintao You", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Platoon", "Container (type theory)", "Mode (computer interface)", "Computer science", "Heuristic", "Generalization", "Ant colony optimization algorithms", "Set (abstract data type)", "Operations research", "Mathematical optimization", "Transport engineering" ], "cited_by_count": 65, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trb.2019.12.009" }, { "id": "https://openalex.org/W4400425908", "doi": "10.1186/s12544-024-00662-0", "title": "Exploring cost performance tradeoffs and uncertainties for electric- and autonomous electric trucks using computational experiments", "year": 2024, "publication_date": "2024-07-08", "type": "article", "language": "en", "authors": [ "Albin Engholm", "Andreas Allström", "Mehdi Akbarian" ], "first_author": "Albin Engholm", "venue": "European Transport Research Review", "publisher": "Springer Science+Business Media", "abstract": "Abstract The recent development of battery electric trucks (BETs) suggests that they could play a vital role in transitioning to zero-emission road freight. To facilitate this transition, it is important to understand under which conditions BETs can be a viable alternative to internal combustion engine trucks (ICETs). Concurrently, the advancement of autonomous driving technology adds uncertainty and complexity to analyzing how the cost competitiveness of future zero-emissions trucks, such as autonomous electric trucks (AETs) may develop. This study examines the cost performance of BETs and AETs compared to ICETs, and how it varies over different market and technology conditions, charging strategies, and transport applications. Focus is on heavy-duty tractor-trailer trucks operating full truckload shuttle-flows in Sweden. Due to the inherent uncertainty and interactions among the analyzed factors, the analysis is performed as computational experiments using a simulation model of BET, AET, and ICET shuttle flow operations and associated costs. In total, 19,200 experiments are performed by sampling the model across 1200 scenarios representing various transport applications and technical and economic conditions for sixteen charging strategies with different combinations of depot, destination, and en route charging. The results indicate that both BETs and AETs are cost competitive compared to ICETs in a large share of scenarios. High asset utilization is important for offsetting additional investment costs in vehicles and chargers, highlighting the importance of deploying these vehicles in applications that enable high productivity. The cost performance for BETs is primarily influenced by energy related costs, charging strategy, and charging infrastructure utilization. The AET cost performance is in addition heavily affected by remote operations cost, and costs for the automated driving system. When feasible, relying only on depot charging is in many scenarios the most cost-effective charging strategy, with the primary exceptions being highly energy-demanding scenarios with long distances and heavy goods in which the required battery is too heavy to operate the truck within vehicle weight regulations if not complemented by destination, or en route charging. However, many experiments do not lead to a reduced payload capacity for BETs and AETs compared to ICETs, and a large majority of the considered scenarios are feasible to operate with a BET or AET within current gross vehicle weight regulations.", "keywords": [ "Truck", "Automotive engineering", "Transport engineering", "Total cost of ownership", "Battery electric vehicle", "Computer science", "Operations research", "Engineering", "Electric vehicle" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1186/s12544-024-00662-0" }, { "id": "https://openalex.org/W2031220301", "doi": "10.1007/s40092-014-0088-0", "title": "Developing a cross-docking network design model under uncertain environment", "year": 2014, "publication_date": "2014-09-10", "type": "article", "language": "en", "authors": [ "Seyed Mohammad Seyedhoseini", "Reza Rashid", "Ebrahim Teimoury" ], "first_author": "Seyed Mohammad Seyedhoseini", "venue": "Journal of industrial engineering international", "publisher": "Springer Nature", "abstract": "Cross-docking is a logistic concept, which plays an important role in supply chain management by decreasing inventory holding, order packing, transportation costs and delivery time. Paying attention to these concerns, and importance of the congestion in cross docks, we present a mixed-integer model to optimize the location and design of cross docks at the same time to minimize the total transportation and operating costs. The model combines queuing theory for design aspects, for that matter, we consider a network of cross docks and customers where two M/M/c queues have been represented to describe operations of indoor trucks and outdoor trucks in each cross dock. To prepare a perfect illustration for performance of the model, a real case also has been examined that indicated effectiveness of the proposed model.", "keywords": [ "Truck", "Queueing theory", "Network planning and design", "Computer science", "Queue", "Operations research", "DOCK", "Transport engineering", "Operations management", "Computer network", "Engineering", "Automotive engineering" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s40092-014-0088-0.pdf" }, { "id": "https://openalex.org/W4317387691", "doi": "10.1108/ijlm-11-2021-0515", "title": "An optimization model for collaborative logistics among carriers in vehicle routing problems with cross-docking", "year": 2023, "publication_date": "2023-01-19", "type": "article", "language": "en", "authors": [ "Vahid Ghomi", "David Marius Gligor", "Sina Shokoohyar", "Reza Alikhani", "Farnaz Ghazi Nezami" ], "first_author": "Vahid Ghomi", "venue": "The International Journal of Logistics Management", "publisher": "Emerald Publishing Limited", "abstract": "Purpose Collaborative Logistics (CL) and merging operations are crucial strategies for reducing costs and improving service in transportation companies. This study proposes a model for optimizing efficiency in supply chain networks through inbound and outbound Collaborative Logistics implementation among the carriers in centralized, coordinated networks with cross-docking. Design/methodology/approach A mixed-integer non-linear programming model is developed to determine the optimal truck-goods assignment while gaining economies of scale through mixing multiple less-than-truckload (LTL) products with different weight-to-volume ratios. Unlike the previous studies that have considered Collaborative Logistics from the cost and profit-sharing perspective, the proposed model seeks to determine an appropriate form of Collaborative Logistics in the VRP. Findings This article shows that in a three-echelon supply chain consisting of a set of suppliers, a set of customers and a cross-docking terminal, partial collaboration among the inbound carriers and outbound carriers outperforms no/complete collaboration. This approach enhances the supply chain efficiency by minimizing the total transportation costs, the total transportation miles and the total number of trucks and maximizing fleet utilization. While addressing the four points, the role of collaborative logistics among the carriers was discussed. In a three-echelon SC consisting of a set of suppliers, a set of customers and a cross-docking terminal, partial collaboration among the inbound carriers and outbound carriers outperforms no/complete collaboration. Using a combination of experimental analysis and optimization process, it was recommended that managers be cautious that too much (full or complete) or no collaboration can result in SC performance deterioration. Originality/value The suggested approach enhances the supply chain efficiency by minimizing the total transportation costs, the total transportation miles and the total number of trucks and maximizing fleet utilization. While addressing the four points, the role of Collaborative Logistics among the carriers was discussed.", "keywords": [ "Truck", "Supply chain", "Vehicle routing problem", "Computer science", "Operations research", "Profit (economics)", "Integer programming", "Supply chain management", "Transport engineering", "Business", "Routing (electronic design automation)", "Computer network" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://scholarsphere.psu.edu/resources/f0fea0b7-4d6e-478f-bb40-eb2e3d63cd21/downloads/34426" }, { "id": "https://openalex.org/W2945900996", "doi": "10.24200/sci.2019.52662.2824", "title": "A hybrid Approach in Metaheuristics for a Cross-dock Scheduling Considering Time Windows and Deadline for Trucks Departure", "year": 2019, "publication_date": "2019-05-21", "type": "article", "language": "en", "authors": [ "Amir Golshahi-Roudbaneh", "Mostafa Hajiaghaei–Keshteli", "Mohammad Mahdi Paydar" ], "first_author": "Amir Golshahi-Roudbaneh", "venue": "Scientia Iranica", "publisher": "Sharif University of Technology", "abstract": "Recent years have envisaged a great deal of interest in optimizing of logistics and transforming systems. One of important challenges in this regard is the cross dock scheduling with several real-life limitations such as the deadline for both perishable and imperishable products. This study is a new cross-dock scheduling problem by not only considering a time window but also for all shipping trucks, the deadline is assumed by the presence of perishable products for the first time in this research area. Based on these suppositions, a new mathematical model is developed. The last but not the least is to propose a new hybrid metaheuristic by combining a recent nature-inspired metaheuristic called Keshtel Algorithm (KA) and a well-known algorithm named Simulated Annealing (SA). The proposed hybrid algorithm not only is compared with its individual ones but also some other well-known metaheuristic algorithms are used. Finally, the performance of the proposed algorithm is validated by several experiments with different complexities and statistical analyses.", "keywords": [ "DOCK", "Truck", "Computer science", "Metaheuristic", "Scheduling (production processes)", "Job shop scheduling", "Mathematical optimization", "Engineering", "Algorithm", "Mathematics", "Automotive engineering", "Marine engineering" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "http://scientiairanica.sharif.edu/article_21434_601dd80d80a3822d2e1e4827c3def55b.pdf" }, { "id": "https://openalex.org/W4388766824", "doi": "10.1016/j.eswa.2023.122483", "title": "Multi-Depot Vehicle Routing Problem with Drones: Mathematical formulation, solution algorithm and experiments", "year": 2023, "publication_date": "2023-11-17", "type": "article", "language": "en", "authors": [ "Petr Stodola", "Libor Kutěj" ], "first_author": "Petr Stodola", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": "The use of Unmanned Aerial Vehicles (UAVs) is expected to grow rapidly in the coming years, driven by technological advancements, cost-effectiveness, and the increasing demand for faster and more efficient delivery solutions. This article deals with the mathematical formulation of the Multi-Depot Vehicle Routing Problem with Drones (MDVRP-D), whereby a set of heterogeneous trucks, each paired with a UAV, are located in different depots. Both types of vehicles deliver goods to customers; UAVs are dispatched from trucks while en route to make the last-mile delivery. A metaheuristic algorithm based on the Ant Colony Optimization (ACO) principle is proposed as the solution. This algorithm has been adapted for this newly proposed problem; the novel mechanics include the probabilistic decision to dispatch an UAV, the selection of a customer to be served, and local search optimization. Extensive computational experiments are performed to verify the proposed algorithm. First, its performance is compared with Adaptive Large Neighborhood Search (ALNS) metaheuristics on a set of Vehicle Routing Problem with Drones (VRP-D) benchmarks. A set of various benchmark instances are subsequently proposed for the newly formulated MDVRP-D (differing in complexity and graph topology). Finally, the behavior of the proposed algorithm is thoroughly analyzed, especially in respect of features connected with UAVs. The findings presented in this article provide valuable contributions to the NP-hard models related to the Travelling Salesman Problem (TSP) and to the very popular ACO-based algorithms.", "keywords": [ "Vehicle routing problem", "Computer science", "Travelling salesman problem", "Ant colony optimization algorithms", "Metaheuristic", "Mathematical optimization", "Drone", "Benchmark (surveying)", "Truck", "Set (abstract data type)", "Algorithm", "Probabilistic logic" ], "cited_by_count": 47, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2023.122483" }, { "id": "https://openalex.org/W2027137742", "doi": "10.1016/j.cie.2014.03.002", "title": "A sequential priority-based heuristic for scheduling material handling in a satellite cross-dock", "year": 2014, "publication_date": "2014-03-19", "type": "article", "language": "en", "authors": [ "Yousef Maknoon", "Oumar Koné", "Pierre Baptiste" ], "first_author": "Yousef Maknoon", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "DOCK", "Scheduling (production processes)", "Computer science", "Satellite", "Heuristic", "Operations research", "Mathematical optimization", "Engineering", "Operations management", "Marine engineering", "Mathematics", "Artificial intelligence" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2014.03.002" }, { "id": "https://openalex.org/W2942977665", "doi": "10.1007/s12182-019-0316-8", "title": "A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows", "year": 2019, "publication_date": "2019-04-29", "type": "article", "language": "en", "authors": [ "Bohong Wang", "Yongtu Liang", "Meng Yuan", "Haoran Zhang", "Qi Lin Liao" ], "first_author": "Bohong Wang", "venue": "Petroleum Science", "publisher": "Elsevier BV", "abstract": "The petrol truck routing problem is an important part of the petrol supply chain. This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizing the total travel cost and the fixed cost required to use the trucks. We propose a mathematical model that considers petrol trucks returning to a depot multiple times and develop a heuristic algorithm based on a local branch-and-bound search with a tabu list and the Metropolis acceptance criterion. In addition, an approach that accelerates the solution process by adding several valid inequalities is presented. In this study, the trucks are homogeneous and have two compartments, and each truck can execute at most three tasks daily. The sales company arranges the transfer amount and the time windows for each station. The performance of the proposed algorithm is evaluated by comparing its results with the optimal results. In addition, a real-world case of routing petrol trucks in Beijing is studied to demonstrate the effectiveness of the proposed approach.", "keywords": [ "Truck", "Vehicle routing problem", "Tabu search", "Gasoline", "Routing (electronic design automation)", "Heuristic", "Transport engineering", "Computer science", "Pareto principle", "Process (computing)", "Operations research", "Metaheuristic" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s12182-019-0316-8.pdf" }, { "id": "https://openalex.org/W2622505203", "doi": null, "title": "A polynomial algorithm for a simple scheduling problem at cross docking terminals", "year": 2008, "publication_date": "2008-01-01", "type": "report", "language": "en", "authors": [ "Ruslan Sadykov" ], "first_author": "Ruslan Sadykov", "venue": "HAL (Le Centre pour la Communication Scientifique Directe)", "publisher": "Centre National de la Recherche Scientifique", "abstract": "At cross docking terminals, products from incoming trucks are sorted according to there destinations and transferred to outgoing trucks using a temporary storage. Such terminals allow companies to reduce storage and transportation costs in supply chain. This paper focuses on the operational activities at cross docking terminals. We consider the trucks scheduling problem with the objective to minimise the storage usage during the product transfer. We show that a simplification of this NP-hard problem in which the arrival sequences of incoming and outgoing trucks are fixed is polynomially solvable by proposing a dynamic programming algorithm for it.", "keywords": [ "Truck", "Computer science", "Job shop scheduling", "Scheduling (production processes)", "Dynamic programming", "Mathematical optimization", "Time complexity", "Algorithm", "Engineering", "Schedule", "Mathematics", "Operating system" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://inria.hal.science/inria-00412519" }, { "id": "https://openalex.org/W2044155356", "doi": "10.1016/j.eswa.2012.05.057", "title": "Genetic algorithms for door-assigning and sequencing of trucks at distribution centers for the improvement of operational performance", "year": 2012, "publication_date": "2012-06-15", "type": "article", "language": "en", "authors": [ "Kang-Bae Lee", "Byung Soo Kim", "Cheol Min Joo" ], "first_author": "Kang-Bae Lee", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Computer science", "Distribution center", "Genetic algorithm", "Scheduling (production processes)", "Supply chain", "Algorithm", "Operations research", "Real-time computing", "Mathematical optimization", "Automotive engineering", "Machine learning" ], "cited_by_count": 47, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2012.05.057" }, { "id": "https://openalex.org/W4404421367", "doi": "10.1007/s12065-024-00992-x", "title": "Evolutionary algorithm framework for optimizing truck scheduling in multi-dock truck cross-docking centers", "year": 2024, "publication_date": "2024-11-15", "type": "article", "language": "en", "authors": [ "Thiago Henrique Nogueira", "Felipe Provezano Coutinho", "Maria Gabriela Mendonça Peixoto", "Eduardo Gontijo Carrano", "Martı́n Gómez Ravetti" ], "first_author": "Thiago Henrique Nogueira", "venue": "Evolutionary Intelligence", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "DOCK", "Computer science", "Truck", "Scheduling (production processes)", "Docking (animal)", "Operations research", "Algorithm", "Mathematical optimization", "Automotive engineering" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s12065-024-00992-x" }, { "id": "https://openalex.org/W2915338839", "doi": "10.1016/j.trc.2019.11.003", "title": "The multiple flying sidekicks traveling salesman problem: Parcel delivery with multiple drones", "year": 2019, "publication_date": "2019-12-13", "type": "article", "language": "en", "authors": [ "Chase C. Murray", "Ritwik Raj" ], "first_author": "Chase C. Murray", "venue": "Transportation Research Part C Emerging Technologies", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Travelling salesman problem", "Truck", "Heuristic", "Computer science", "Mathematical optimization", "Automation", "Integer (computer science)", "Integer programming", "Operations research", "Real-time computing", "Simulation" ], "cited_by_count": 566, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trc.2019.11.003" }, { "id": "https://openalex.org/W4291162950", "doi": "10.1016/j.asoc.2022.109448", "title": "Solving the number of cross-dock open doors optimization problem by combination of NSGA-II and multi-objective simulated annealing", "year": 2022, "publication_date": "2022-08-11", "type": "article", "language": "en", "authors": [ "Arash Motaghedi-Larijani" ], "first_author": "Arash Motaghedi-Larijani", "venue": "Applied Soft Computing", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "DOCK", "Doors", "Vehicle routing problem", "Computer science", "Truck", "Metaheuristic", "Simulated annealing", "Mathematical optimization", "Scheduling (production processes)", "Sorting", "Genetic algorithm", "Routing (electronic design automation)" ], "cited_by_count": 27, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.asoc.2022.109448" }, { "id": "https://openalex.org/W4385258285", "doi": "10.1109/itec55900.2023.10187064", "title": "Home-Base Charging Load Profiles of Battery Electric Trucks Considering Tour Completion and Time-of-Use Rates", "year": 2023, "publication_date": "2023-06-21", "type": "conference-paper", "language": "en", "authors": [ "Jacqueline Garrido", "Emmanuel Hidalgo", "Matthew Barth", "Kanok Boriboonsomsin" ], "first_author": "Jacqueline Garrido", "venue": null, "publisher": null, "abstract": "With California targeting all drayage trucks operating in the state to be zero-emitting by 2035, it is critical to model the quantities, locations, and load curves of medium-duty (MD) and heavy-duty (HD) electric vehicle (EV) chargers. This paper generates home-base charging load profiles using real-world activity data for a drayage truck fleet operating in Southern California. As a likely scenario, trucks with a battery capacity of 565 kWh were modeled charging at their home-base (i.e., fleet depot) at two power levels. We then consider constraints of energy needed to complete the next subsequent tour and Time-of-Use (TOU) energy rates. An uncontrolled baseline charging scenario was also modeled for comparison. Results suggest that a decrease of about 21% in energy charging cost can be achieved when comparing the baseline vs. constrained scenarios using a 50 k W power level. A similar decrease in cost was found when modeling a power level of 150 k W. In addition, the percentage of tours completed increased approximately by 10-12%, just by adjusting the charging power level. Finally, the proposed constrained scenarios decreased the number of required chargers by 2–3 on average when compared to their baseline cases.", "keywords": [ "Truck", "Battery (electricity)", "Baseline (sea)", "Automotive engineering", "Power (physics)", "Environmental science", "State of charge", "Battery capacity", "Lead–acid battery", "Heavy duty", "Energy (signal processing)", "Simulation" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "http://dx.doi.org/10.1109/itec55900.2023.10187064" }, { "id": "https://openalex.org/W4289133134", "doi": "10.1155/2022/2171305", "title": "A Multiobjective Mathematical Model for Truck Scheduling Problem in Multidoor Cross‐Docking System", "year": 2022, "publication_date": "2022-01-01", "type": "article", "language": "en", "authors": [ "Mahziar Taghizadeh", "Amir Abbas Shojaie", "Amir Homayoun Sarfaraz", "Sadigh Raissi" ], "first_author": "Mahziar Taghizadeh", "venue": "Discrete Dynamics in Nature and Society", "publisher": "Hindawi Publishing Corporation", "abstract": "Cross‐docking is the main operation of unloading products from incoming trucks, regrouping products in relation to their destination, and loading directly onto shipping trucks, reducing warehousing, picking, transportation costs, and delivery times. This is the intended logistics technology. In this paper, we present a new bi‐objective mixed‐integer mathematical model for truck scheduling problems in cross‐docking systems. The goal of the proposed mixed‐integer mathematical model is to minimize the total operation time (makespan) and cost of moving cargo within the terminal. The performance of the proposed model is compared with that of the available model to solve small instances. The results showed that in solving small size of problem, the proposed model in this study is more efficient and we found better solutions. An evolutionary algorithm called the nondominated sorting genetic algorithm (NSGA‐II) has been proposed to solve larger instances due to computational complexity. To evaluate the proposed algorithm, a comparative analysis of benchmark instances was performed and the efficiency of the above algorithm was compared to the nondominated ranked algorithm (NRGA) based on the index designed in the literature. The statistical hypothesis testing ( t ‐test) is used for determining the best algorithm based on the average runtime and average number of Pareto solutions. Using the Taguchi method, the proposed algorithms are tuned. Considering a temporary storage space and the multiple receiving and shipping docks is the main contribution of the paper. Finally, for evaluating algorithms, multicriteria decision‐making (MCDM) technique and statistical method are used. The results show the suitable performance of presented model.", "keywords": [ "Truck", "Computer science", "Mathematical optimization", "Sorting", "Job shop scheduling", "Scheduling (production processes)", "Genetic algorithm", "Integer programming", "Multi-objective optimization", "Taguchi methods", "Algorithm", "Schedule" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/ddns/2022/2171305.pdf" }, { "id": "https://openalex.org/W112728932", "doi": null, "title": "Risk Averse Truck Scheduling at a Cross-Dock Facility", "year": 2011, "publication_date": "2011-01-01", "type": "article", "language": "en", "authors": [ "Mihalis Golias", "Georgios K. D. Saharidis", "Stephanie S. Ivey", "Martin E Lipinski" ], "first_author": "Mihalis Golias", "venue": "Transportation Research Board 90th Annual MeetingTransportation Research Board", "publisher": null, "abstract": "In this paper the authors deal with the scheduling of inbound trucks (ITs) to the available inbound doors (IDs) at a cross dock facility. The authors assume that the truck arrival times are stochastic variables with unknown distributions but with a known range (min and max) and known expected values. The authors propose a modeling framework based on the concept of games against a demon. A number of computational examples are performed to evaluate the performance ratio of the schedule obtained by the proposed approach.", "keywords": [ "Truck", "DOCK", "Doors", "Scheduling (production processes)", "Computer science", "Schedule", "Operations research", "Range (aeronautics)", "Engineering", "Operations management", "Operating system" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1092971" }, { "id": "https://openalex.org/W2529947307", "doi": "10.1051/ro/2016067", "title": "Truck routing and scheduling for cross-docking in the supply chain: model and solution method", "year": 2016, "publication_date": "2016-10-10", "type": "article", "language": "en", "authors": [ "Mehdi Yazdani", "Bahman Naderi", "Shabnam Rahmani", "Shadi Rahmani" ], "first_author": "Mehdi Yazdani", "venue": "RAIRO - Operations Research", "publisher": "EDP Sciences", "abstract": "Among various distribution networks, the idea behind the cross-docking for cost reduction is to decrease/eliminate inventory to the extent possible. In classical cross-dock, it is assumed that there is one truck for each supplier and customer. Yet, one truck for each supplier and customer can be very costly and consequently ineffective. Each truck likely can serve more than one supplier/customer in its pickup/delivery process. Therefore, to more actualize the cross-dock problem, it can be extended with the truck routing problem, i.e., the truck scheduling in the cross-docking system and truck routing in the pickup/delivery process. Hence, this paper considers the integrated truck routing and scheduling problem. First, the problem is formulated as a mixed integer linear programming model. Using this model, we solve small-sized instances to optimality. Moreover, two metaheuristics, a reactive tabu search with path relinking and a generational genetic algorithm with a local search and restart phase, are proposed to solve large instances. The parameters of the proposed algorithms are tuned. Finally, the performance of the proposed algorithms is evaluated.", "keywords": [ "Truck", "Tabu search", "Vehicle routing problem", "Computer science", "Mathematical optimization", "Integer programming", "Job shop scheduling", "Metaheuristic", "Scheduling (production processes)", "Routing (electronic design automation)", "Engineering", "Algorithm" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1051/ro/2016067" }, { "id": "https://openalex.org/W3007037163", "doi": "10.1016/j.promfg.2020.01.356", "title": "A Genetic Algorithm Approach for Multi Objective Cross Dock Scheduling in Supply Chains", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Siwaphong Kusolpuchong", "Krerkkiat Chusap", "Omar I. Alhawari", "Gürsel A. Süer" ], "first_author": "Siwaphong Kusolpuchong", "venue": "Procedia Manufacturing", "publisher": "Elsevier BV", "abstract": "In supply chain, cross docking terminal aims to move products directly from inbound trucks to outbound trucks; however, value or non-value added operations might be needed before loading into outbound trucks, for instance, repacking, sorting, and labeling. Also, cross docking terminal might be the place for consolidated shipment intended for full truckload freight or less-than-truckload freight and can reduce the inventory cost of supply chain network. Further, cross docking helps reducing space required and reducing transportation costs. Although the literature shows several methods for improving operations in cross docking terminal, there is a gap in finding the inventory level of temporary storage considering truck scheduling and dock assignment simultaneously. In this paper, Genetic Algorithm (GA) is used for solving the truck scheduling and dock assignment for the inbound and outbound trucks with minimizing three objectives namely makespan, maximum inventory level, and total traveling distance of material handling. Also, the performance of the four crossover strategies is compared in finding the satisfaction level of the three objectives combined. The results show that, among the four crossover strategies, none of the crossover strategies is dominant in finding the best satisfaction level according the dataset used.", "keywords": [ "Truck", "DOCK", "Crossover", "Scheduling (production processes)", "Supply chain", "Job shop scheduling", "Genetic algorithm", "Computer science", "Sorting", "Operations research", "Engineering", "Transport engineering" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.promfg.2020.01.356" }, { "id": "https://openalex.org/W1586616618", "doi": "10.1002/atr.1239", "title": "Truck capacity analysis in a cross‐dock transportation network considering direct shipment", "year": 2013, "publication_date": "2013-07-23", "type": "article", "language": "en", "authors": [ "Sajjad Rahmanzadeh Tootkaleh", "Mohsen Akbarpour Shirazi", "S.M.T. Fatemi Ghomi", "Seyed Davod Hosseini" ], "first_author": "Sajjad Rahmanzadeh Tootkaleh", "venue": "Journal of Advanced Transportation", "publisher": "Hindawi Publishing Corporation", "abstract": "SUMMARY In a transportation network, decision making parameters may change and may cause the optimum value of objective function to vary in a specific range. Therefore, managers try to identify the effects of these changes by sensitive analysis to find appropriate solutions. In this paper, first, a model for cross‐dock transportation network considering direct shipment is presented, and then an algorithm based on branch and bound algorithm and dual price concept for sensitive analysis is developed. When managers encounter problems such as budget limit, they may decide to change the capacity of trucks as a procedure to reduce the transportation costs of the network. The algorithm provides a useful lower bound on the solutions of the problems and makes it easy for the managers to eliminate inappropriate options of truck capacities, which cannot lead to cost reduction. To verify the algorithm, an example will be given at the end of the paper. Copyright © 2013 John Wiley & Sons, Ltd.", "keywords": [ "Truck", "Computer science", "Function (biology)", "Operations research", "Range (aeronautics)", "Flow network", "Limit (mathematics)", "Transport engineering", "DOCK", "Mathematical optimization", "Engineering", "Mathematics" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/atr.1239" }, { "id": "https://openalex.org/W4391436228", "doi": "10.1108/jm2-06-2023-0130", "title": "A multi-objective optimization model of truck scheduling problem using cross-dock in supply chain management: NSGA-II and NRGA", "year": 2024, "publication_date": "2024-02-01", "type": "article", "language": "en", "authors": [ "Ahsan Haghgoei", "Alireza Irajpour", "Nasser Hamidi" ], "first_author": "Ahsan Haghgoei", "venue": "Journal of Modelling in Management", "publisher": "Emerald Publishing Limited", "abstract": "Purpose This paper aims to develop a multi-objective problem for scheduling the operations of trucks entering and exiting cross-docks where the number of unloaded or loaded products by trucks is fuzzy logistic. The first objective function minimizes the maximum time to receive the products. The second objective function minimizes the emission cost of trucks. Finally, the third objective function minimizes the number of trucks assigned to the entrance and exit doors. Design/methodology/approach Two steps are implemented to validate and modify the proposed model. In the first step, two random numerical examples in small dimensions were solved by GAMS software with min-max objective function as well as genetic algorithms (GA) and particle swarm optimization. In the second step, due to the increasing dimensions of the problem and computational complexity, the problem in question is part of the NP-Hard problem, and therefore multi-objective meta-heuristic algorithms are used along with validation and parameter adjustment. Findings Therefore, non-dominated sorting genetic algorithm (NSGA-II) and non-dominated ranking genetic algorithm (NRGA) are used to solve 30 random problems in high dimensions. Then, the algorithms were ranked using the TOPSIS method for each problem according to the results obtained from the evaluation criteria. The analysis of the results confirms the applicability of the proposed model and solution methods. Originality/value This paper proposes mathematical model of truck scheduling for a real problem, including cross-docks that play an essential role in supply chains, as they could reduce order delivery time, inventory holding costs and shipping costs. To solve the proposed multi-objective mathematical model, as the problem is NP-hard, multi-objective meta-heuristic algorithms are used along with validation and parameter adjustment. Therefore, NSGA-II and NRGA are used to solve 30 random problems in high dimensions.", "keywords": [ "Truck", "Mathematical optimization", "Computer science", "Genetic algorithm", "Particle swarm optimization", "Sorting", "Job shop scheduling", "Scheduling (production processes)", "Supply chain management", "Supply chain", "Operations research", "Mathematics" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/jm2-06-2023-0130" }, { "id": "https://openalex.org/W2884998623", "doi": "10.5267/j.uscm.2018.7.001", "title": "Designing a location-routing model for cross docking in green supply chain", "year": 2018, "publication_date": "2018-07-21", "type": "article", "language": "en", "authors": [ "Afrouz Rahmandoust", "Roya Soltani" ], "first_author": "Afrouz Rahmandoust", "venue": "Uncertain Supply Chain Management", "publisher": "Growing Science", "abstract": "Today, most industrial managers in the world are interested in protecting the environment and biological resources.On the other hand, current technologies are getting momentum towards specialization and globalization.Thus, in order to remain in a highly competitive world market, producers have to respond to the customers' demands under different circumstances.The leading role of distribution centers to deliver products to customers on time and to reduce the costs of stock maintenance has attracted the attention of many supply chain managers in current competitive conditions.Cross docking is a logistic strategy aiming to reduce the stock and increase the level of customer's satisfaction.Products are delivered from the supplier to the customers through cross docking.In this paper, a nonlinear multiproduct vehicle locationrouting model is presented with heterogeneous vehicles.Each truck can carry one or more types of products.In other words, compatibility between product and vehicle has been accounted for here.This model aims to find out the possible minimum number of cross dockings among the existing set of discrete locations and minimize the total cost of opening cross docking centers as well as vehicle transportation (distribution and operation cost) costs.In sum, the model aims to find the number of cross docking centers, the number of vehicles and the best route in the distribution network.Since the model is mixed integer programming, to apply the model to medium and large scale problems, meta innovative genetic and particle swarm optimization algorithms are introduced.The results obtained from examining various problems show high efficiency of the proposed methods.", "keywords": [ "Docking (animal)", "Supply chain", "Computer science", "Business", "Marketing" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5267/j.uscm.2018.7.001" }, { "id": "https://openalex.org/W2777257784", "doi": "10.1155/2017/8524960", "title": "Multiple Depots Vehicle Routing Problem in the Context of Total Urban Traffic Equilibrium", "year": 2017, "publication_date": "2017-01-01", "type": "article", "language": "en", "authors": [ "Dongxu Chen", "Zhongzhen Yang" ], "first_author": "Dongxu Chen", "venue": "Journal of Advanced Transportation", "publisher": "Hindawi Publishing Corporation", "abstract": "A multidepot VRP is solved in the context of total urban traffic equilibrium. Under the total traffic equilibrium, the multidepot VRP is changed to GDAP (the problem of Grouping Customers + Estimating OD Traffic + Assigning traffic) and bilevel programming is used to model the problem, where the upper model determines the customers that each truck visits and adds the trucks’ trips to the initial OD (Origin/Destination) trips, and the lower model assigns the OD trips to road network. Feedback between upper model and lower model is iterated through OD trips; thus total traffic equilibrium can be simulated.", "keywords": [ "Context (archaeology)", "TRIPS architecture", "Truck", "Transport engineering", "Bilevel optimization", "Vehicle routing problem", "Traffic network", "Computer science", "Routing (electronic design automation)", "Iterated function", "Operations research", "Mathematical optimization" ], "cited_by_count": 38, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1155/2017/8524960" }, { "id": "https://openalex.org/W2064041015", "doi": "10.1016/j.sbspro.2013.12.608", "title": "Simulated Annealing Approach for Transportation Problem of Cross-docking Network Design", "year": 2014, "publication_date": "2014-01-01", "type": "conference-paper", "language": "en", "authors": [ "İlker Küçükoğlu", "Nursel Öztürk" ], "first_author": "İlker Küçükoğlu", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "Cross-docking is one of the effective methods applied in supply chain management in order to minimize total transportation costs while satisfying the customer demands. This paper addresses the transportation problem of cross-docking network design where products are transferred from suppliers to customers through cross-docking centers without storing them for a long time. Two- dimensional truck loading constraints are taken into account for different sized products in order to find exact capacity of each truck. This assumption allows decision makers to find idle vehicle capacities and evaluate the capacity utilizations as a cost factor. The problem is formulated using mixed integer programming and solved using simulated annealing (SA) meta-heuristic algorithm which has great potential to solve NP-Hard problems. The proposed algorithm is performed for several randomly generated examples and compared with the optimum solutions. Results show that proposed algorithm demonstrates effective and efficient solutions to reduce the total transportation costs in cross-docking network design.", "keywords": [ "Simulated annealing", "Mathematical optimization", "Computer science", "Truck", "Network planning and design", "Integer programming", "Flow network", "Supply chain network", "Supply chain", "Operations research", "Algorithm", "Supply chain management" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877042813052476/pdf" }, { "id": "https://openalex.org/W4399920344", "doi": "10.1016/j.prime.2024.100656", "title": "Sizing up sustainability: Influence of battery size and cell chemistry on battery-electric trucks’ life-cycle carbon emissions", "year": 2024, "publication_date": "2024-06-22", "type": "article", "language": "en", "authors": [ "Jakob Schneider", "Sebastian Wolff", "Moritz Seidenfus", "Markus Lienkamp" ], "first_author": "Jakob Schneider", "venue": "e-Prime - Advances in Electrical Engineering Electronics and Energy", "publisher": "Elsevier BV", "abstract": "Customers and legislators will increasingly demand monitoring and reducing the carbon footprint of logistic companies in the coming years. Besides the fundamental decision for a battery-electric truck, the choice of battery size and cell chemistry should be approached with the goal of minimizing the carbon footprint of the supply chain. Therefore, this paper analyzes the impact of battery size and cell chemistry on the carbon footprint and which factors influence this the most. To quantify this footprint, emissions from production, potential replacements based on battery aging, energy generation, and reuse in second-life applications for both LFP and NMC cell chemistries are considered. The results show that use phase emissions from energy generation have the largest leverage on life-cycle emissions, whereas production emissions play a minor role. If electricity with lower emissions at the home depot compared to the public electricity is available, oversizing the battery capacity tends to be the emission optimal choice. If more than 8% additional renewable energy at the home base for NMC and more than 38% for LFP is available, the largest possible battery is emission-optimal. For smaller shares, the smallest possible battery should be selected. Significant dependence on purchase year and share of second-life usage can be observed.", "keywords": [ "Truck", "Sizing", "Battery (electricity)", "Sustainability", "Cell voltage", "Automotive engineering", "Carbon fibers", "Engineering", "Environmental science", "Waste management", "Computer science", "Chemistry" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.prime.2024.100656" }, { "id": "https://openalex.org/W4294176580", "doi": "10.3390/logistics6030062", "title": "A Particle Swarm Optimization Approach to Solve the Vehicle Routing Problem with Cross-Docking and Carbon Emissions Reduction in Logistics Management", "year": 2022, "publication_date": "2022-09-01", "type": "article", "language": "en", "authors": [ "Shih‐Che Lo" ], "first_author": "Shih‐Che Lo", "venue": "Logistics", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Background: The logistics network design with cross-docking operations enables shipping service providers to integrate the physical flow of products between vendors and dealers in logistics management. The collective goal is to synchronize the goods in both pickup and delivery operations concurrently to reduce the handling cost, inventory cost, and operation cost generated. Therefore, the optimal vehicle routing plan is crucial to generate a truck routing schedule with minimal total cost, fulfilling the purchasing requirements and the distribution demand. Global warming and climate change are important topics due to increasing greenhouse gas emissions. Sustainable logistics management with optimized routes for trucks can assist in reducing greenhouse gas emissions and easing the effects of temperature increases on our living environment. Methods: A heuristic approach based on Particle Swarm Optimization, called ePSO, was proposed and implemented in this paper to solve the vehicle routing problems with cross-docking and carbon emissions reduction at the same time. Results: Performance comparisons were made with the Genetic Algorithm (GA) through the experiments of several vehicle routing problems with pickup and delivery benchmark problems to validate the performance of the ePSO procedure. Conclusions: Experimental results showed that the proposed ePSO approach was better than the GA for most cases by statistical hypothesis testing.", "keywords": [ "Vehicle routing problem", "Greenhouse gas", "Truck", "Particle swarm optimization", "Purchasing", "Computer science", "Operations research", "Routing (electronic design automation)", "Engineering", "Operations management", "Automotive engineering", "Computer network" ], "cited_by_count": 26, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2305-6290/6/3/62/pdf?version=1662103125" }, { "id": "https://openalex.org/W2622352012", "doi": "10.1109/pdcat.2016.058", "title": "An Application Oriented Multi-Agent Based Approach to Dynamic Truck Scheduling at Cross-Dock", "year": 2016, "publication_date": "2016-12-01", "type": "conference-paper", "language": "en", "authors": [ "Houda Zouhaier", "Lamjed Ben Saïd" ], "first_author": "Houda Zouhaier", "venue": null, "publisher": null, "abstract": "Truck arrival management forms a very active stream of research and a crucial challenge for a cross-dock terminals. The study focuses on the truck congestion problem, which leads to a lower operation efficiency and a longer waiting time at the gate and at the yard. One of the operational measures to solve this problem is the truck appointment system. It is used to coordinate the major cross-dock planning activities and to regulate the arrival time of trucks at the cross-dock. When the trucker get an appointment time different to its preference time, then we are talking about a truck deviation time. Because the deviation will result in daily operations schedule, an optimization model for truck appointment was proposed in this paper. In the model, the truck deviation time was minimized subject to the constraints of resources availability including dock doors, yard zones, gate lanes, workforce and material handling systems. To solve the model, a method based multi-agent system to real-time truck scheduling, that take into account the uncertainty of arrival time as an operational characteristic, was designed. It ensures a negotiation among truck agents and resource agents. Lastly, a numerical experiments are provided to illustrate the validity of the model and to illustrate the working and benefit of our approach.", "keywords": [ "Truck", "DOCK", "Yard", "Computer science", "Scheduling (production processes)", "Job shop scheduling", "Doors", "Operations research", "Schedule", "Transport engineering", "Engineering", "Real-time computing" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/pdcat.2016.058" }, { "id": "https://openalex.org/W4399268510", "doi": "10.1016/j.eswa.2024.124254", "title": "Integrated truck drone delivery services with an optimal charging stations", "year": 2024, "publication_date": "2024-06-01", "type": "article", "language": "en", "authors": [ "Dev Mishra", "Manoj Kumar Tiwari" ], "first_author": "Dev Mishra", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Truck", "Computer science", "Automotive engineering", "Engineering" ], "cited_by_count": 37, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2024.124254" }, { "id": "https://openalex.org/W2550511130", "doi": "10.3934/jimo.2016.12.431", "title": "A mixed integer programming model for solving real-time truck-to-door assignment and scheduling problem at cross docking warehouse", "year": 2015, "publication_date": "2015-06-11", "type": "article", "language": "en", "authors": [ "Wan Nor Ashikin Wan Ahmad Fatthi", "Adibah Shuib", "Rosma Mohd Dom" ], "first_author": "Wan Nor Ashikin Wan Ahmad Fatthi", "venue": "Journal of Industrial and Management Optimization", "publisher": "American Institute of Mathematical Sciences", "abstract": "This paper address the problem at the inboundphase at the cross docking warehouse. The fundamental issues in crossdocking facility is to assign the incoming truck to the door and tocoordinate the sequences of the trucks in order to minimize the completiontime at the inbound phase. Using the theories and methodologies ofassignment and scheduling, paper on hand proposed a mixed integerprogramming model for solving the truck-to-door assignment and schedulingproblem with the objective to minimize the total service time of trucks.Meanwhile, reduce the waiting time of trucks before being served atthe designated door. A preliminary computation is conducted to verifythe logic of the mathematical model proposed.", "keywords": [ "Truck", "Computer science", "Integer programming", "Scheduling (production processes)", "Warehouse", "Computation", "Job shop scheduling", "Operations research", "Mathematical optimization", "Engineering", "Algorithm", "Mathematics" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.aimsciences.org/data/article/export-pdf?id=6d4d42b3-7fea-4f40-8f99-f127f0f86559" }, { "id": "https://openalex.org/W2045149654", "doi": "10.1016/0305-0548(94)00083-k", "title": "A heuristic and lower bound for a multi-depot routing problem", "year": 1995, "publication_date": "1995-12-01", "type": "article", "language": "en", "authors": [ "Robert T. Sumichras", "Ina S. Markham" ], "first_author": "Robert T. Sumichras", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Depot", "Heuristic", "Computer science", "Mathematical optimization", "Routing (electronic design automation)", "Upper and lower bounds", "Vehicle routing problem", "Branch and bound", "Operations research", "Mathematics", "Algorithm", "Computer network" ], "cited_by_count": 27, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/0305-0548(94)00083-k" }, { "id": "https://openalex.org/W2412110906", "doi": "10.1016/j.ijpe.2016.05.015", "title": "Optimizing transshipment workloads in less-than-truckload cross-docks", "year": 2016, "publication_date": "2016-06-04", "type": "article", "language": "en", "authors": [ "Yousef Maknoon", "François Soumis", "Pierre Baptiste" ], "first_author": "Yousef Maknoon", "venue": "International Journal of Production Economics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Transshipment (information security)", "Computer science", "Workload", "Truck", "Scheduling (production processes)", "Operations research", "Mathematical optimization", "Job shop scheduling", "Schedule", "Mathematics", "Engineering", "Operating system" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "http://infoscience.epfl.ch/record/221333" }, { "id": "https://openalex.org/W2973573481", "doi": "10.15388/informatica.2019.215", "title": "Endosymbiotic Evolutionary Algorithm for an Integrated Model of the Vehicle Routing and Truck Scheduling Problem with a Cross-Docking System", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Kun-Young Lee", "Ji-Soo Lim", "Sung‐Seok Ko" ], "first_author": "Kun-Young Lee", "venue": "Informatica", "publisher": "IOS Press", "abstract": "This paper presents a model which integrates inbound and outbound logistics with a crossdocking system. This model integrates the problem of routing inbound vehicles between suppliers and cross-docks and outbound vehicles between cross-docks and retailers, considering logistics costs and the products properties. This model aims to minimize the total cost by optimizing assignment of products to suppliers and retailers and operations of inbound and outbound vehicles. We developed an endosymbiotic evolutionary algorithm, which yields good performance in concurrent searches for the solutions of multiple subproblems and validate the performance using several numerical examples.", "keywords": [ "Vehicle routing problem", "Truck", "Computer science", "Scheduling (production processes)", "Routing (electronic design automation)", "Job shop scheduling", "Operations research", "Mathematical optimization", "Computer network", "Automotive engineering", "Engineering", "Mathematics" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://informatica.vu.lt/journal/INFORMATICA/article/1125/file/pdf" }, { "id": "https://openalex.org/W2584086099", "doi": "10.1016/j.cor.2017.01.018", "title": "An integer programming approach to scheduling the transshipment of products at cross-docks in less-than-truckload industries", "year": 2017, "publication_date": "2017-01-31", "type": "article", "language": "en", "authors": [ "Yousef Maknoon", "François Soumis", "Pierre Baptiste" ], "first_author": "Yousef Maknoon", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Transshipment (information security)", "Computer science", "Mathematical optimization", "Integer programming", "Branch and bound", "Schedule", "Synchronizing", "Scheduling (production processes)", "Integer (computer science)", "Algorithm", "Mathematics" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "http://infoscience.epfl.ch/record/225646" }, { "id": "https://openalex.org/W4319999568", "doi": "10.1016/j.jer.2023.100015", "title": "Transportation cost reduction using cross-docks linking", "year": 2023, "publication_date": "2023-01-28", "type": "article", "language": "en", "authors": [ "Hasan Hosseini-Nasab", "Saeid Nasrollahi", "Mohammad Bagher Fakhrzad", "Mahboobeh Honarvar" ], "first_author": "Hasan Hosseini-Nasab", "venue": "Journal of Engineering Research", "publisher": "Elsevier BV", "abstract": "Many kinds of research have been done to reduce shipping costs so far. Using different transportation systems such as direct shipping, product consolidation, indirect shipping via cross-docks, and using vehicles with different capacities are some methods that can reduce transportation costs. Cross-docking is a logistics procedure that decreases transportation costs typically. Establishing links between cross-docks and using heterogeneous trucks could decrease the total cost of a supply chain, which is investigated in this paper. The problem is mathematically formulated and various simulated problems with different parameters are investigated. Then a real-world case study of the Agri-product supply chain in Isfahan, Iran, is addressed. For the case study examined, the total transportation cost for the proposed method was reduced by 36% compared to the model without establishing links between cross-docks with the same parameters.", "keywords": [ "Truck", "Supply chain", "Consolidation (business)", "Total cost", "Cost reduction", "Operations research", "Computer science", "Transport engineering", "Product (mathematics)", "Business", "Engineering", "Automotive engineering" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.jer.2023.100015" }, { "id": "https://openalex.org/W4384157206", "doi": "10.1016/j.ejor.2023.07.014", "title": "A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment", "year": 2023, "publication_date": "2023-07-13", "type": "article", "language": "en", "authors": [ "Mingjie Li", "Jin‐Kao Hao", "Qinghua Wu" ], "first_author": "Mingjie Li", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Mathematical optimization", "Heuristic", "Benchmark (surveying)", "Reinforcement learning", "Tabu search", "GRASP", "Integer programming", "Algorithm", "Mathematics", "Artificial intelligence" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2023.07.014" }, { "id": "https://openalex.org/W2044251385", "doi": "10.1504/ijstl.2015.067850", "title": "Truck scheduling for cross docking systems with multiple receiving and shipping docks", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Wooyeon Yu" ], "first_author": "Wooyeon Yu", "venue": "International Journal of Shipping and Transport Logistics", "publisher": "Inderscience Publishers", "abstract": "The objective of this study is to find the best docking sequences for trucks at each receiving and shipping dock as well as assignments of inbound and outbound trucks to docks to minimise the makespan of the cross docking system with multiple docks. The unloading sequences of products from inbound trucks, product routing, and routing sequences are also determined simultaneously. To solve the cross docking problem, two approaches - a mathematical model and two heuristic algorithms - were developed. Due to time complexity of the mathematical model, the lower bound of the makespan is developed to compare the performance of the heuristics. The results shows that the makespans found from the heuristics are very close to the lower bounds of the problems.", "keywords": [ "Truck", "Heuristics", "Job shop scheduling", "Computer science", "Scheduling (production processes)", "DOCK", "Vehicle routing problem", "Mathematical optimization", "Routing (electronic design automation)", "Docking (animal)", "Operations research", "Computer network" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijstl.2015.067850" }, { "id": "https://openalex.org/W2562747735", "doi": "10.1145/3014812.3014840", "title": "Robust scheduling of truck arrivals at a cross-docking platform", "year": 2016, "publication_date": "2016-12-20", "type": "conference-paper", "language": "en", "authors": [ "Houda Zouhaier", "Lamjed Ben Saïd" ], "first_author": "Houda Zouhaier", "venue": "Proceedings of the Australasian Computer Science Week Multiconference", "publisher": null, "abstract": "This paper addresses an important planning operation which is the truck scheduling problem at a cross-docking terminal under full and partial information about the truck arrival times. The problem is subject to a resource-constrained crossdock; comprising the availability of the workforce and the handling equipment. One of the operational measures to control truck arrivals is the use of Appointment System (AS). AS is to establish coordination between cross-dock operator and truckers in order to determine when a truck can enter the cross-dock for loading or unloading operations. In spite of making appointment, the challenge is about the uncertainty factor of the earliness and the tardiness of truck arrivals and of the resource availability which implies the congestion at the platform. A fundamental issue about the congestion is the truck queueing behavior. To solve this issue, it is important to reduce the discipline of the queued trucks and to maintain the cost-efficiency of freight flows. One way of achieving this challenge is by applying the field of Queueing Theory (QT). In this paper, we focus on the question how to plan inbound truck arrivals effectively and what if trucks arrive outside the assigned time window. So, we present an efficient approach to optimize the allocation of arrival time of trucks and to optimize the resource schedules minimizing the total cost in the system. The proposed model is a mathematical formulation in conjunction with simulation that attempts to find a robust solution for cross-dock operator and trucks showing up late or early. Our early experimental results illustrate the working and benefit of our approach.", "keywords": [ "Truck", "Computer science", "Scheduling (production processes)", "Docking (animal)", "Automotive engineering", "Engineering", "Operations management" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1145/3014812.3014840" }, { "id": "https://openalex.org/W4297020687", "doi": "10.1007/s10479-022-04939-2", "title": "Cross-dock facility for disaster relief operations", "year": 2022, "publication_date": "2022-09-23", "type": "article", "language": "en", "authors": [ "Fatemeh Faghih-Mohammadi", "Mohammad Mahdi Nasiri", "Dinçer Konur" ], "first_author": "Fatemeh Faghih-Mohammadi", "venue": "Annals of Operations Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "DOCK", "Truck", "Computer science", "Operations research", "Solver", "Emergency management", "Transport engineering", "Engineering" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10479-022-04939-2" }, { "id": "https://openalex.org/W4396925629", "doi": "10.1007/s11425-024-2301-9", "title": "A neural branch-and-price for truck scheduling in cross-docks", "year": 2024, "publication_date": "2024-05-10", "type": "article", "language": "en", "authors": [ "Rahimeh Neamatian Monemi", "Shahin Gelareh", "Nelson Maculan", "Wei‐Kun Chen" ], "first_author": "Rahimeh Neamatian Monemi", "venue": "Science China Mathematics", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Truck", "Computer science", "Scheduling (production processes)", "Operations research", "Automotive engineering", "Economics", "Engineering", "Operations management" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s11425-024-2301-9" }, { "id": "https://openalex.org/W2165575774", "doi": "10.1007/s10845-015-1156-z", "title": "A hybrid meta-heuristic algorithm for vehicle routing and packing problem with cross-docking", "year": 2015, "publication_date": "2015-10-19", "type": "article", "language": "en", "authors": [ "İlker Küçükoğlu", "Nursel Öztürk" ], "first_author": "İlker Küçükoğlu", "venue": "Journal of Intelligent Manufacturing", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Simulated annealing", "Tabu search", "Vehicle routing problem", "Mathematical optimization", "Computer science", "Truck", "Benchmark (surveying)", "Algorithm", "Routing (electronic design automation)", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10845-015-1156-z" }, { "id": "https://openalex.org/W2804893030", "doi": "10.1109/icnsc.2018.8361332", "title": "Optimizing truck scheduling in a cross-docking system with preemption and unloading/loading sequence constraint", "year": 2018, "publication_date": "2018-03-01", "type": "conference-paper", "language": "en", "authors": [ "Ye Yan", "Jing-feng Li", "Richard Y.K. Fung", "Kaibin Li", "Hui Fu" ], "first_author": "Ye Yan", "venue": null, "publisher": null, "abstract": "To solve the truck scheduling problem with preemption and unloading/loading sequence requirement in a multi-door cross-docking system, preemption rules are analyzed and a mathematical programming model is formulated aiming at minimizing total operation time. Then, a hybrid meta-heuristic algorithm based on particle swarm optimization and tabu search (PSO-TS) is proposed. Using Taguchi method, PSO-TS is tuned to attain the best robustness. Finally, computational experiments are carried out by using problem instances with different scales to compare the performances of PSO-TS and an improved PSO in the literature. Results show that PSO-TS had a significant advantage in computational time and produced better solutions with the increase of problem sizes.", "keywords": [ "Preemption", "Particle swarm optimization", "Computer science", "Mathematical optimization", "Job shop scheduling", "Tabu search", "Taguchi methods", "Scheduling (production processes)", "Robustness (evolution)", "Algorithm", "Schedule", "Mathematics" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/icnsc.2018.8361332" }, { "id": "https://openalex.org/W1803678950", "doi": "10.1007/978-3-319-23126-6_8", "title": "High Capacity Trucks Serving as Mobile Depots for Waste Collection in IoT-Enabled Smart Cities", "year": 2015, "publication_date": "2015-01-01", "type": "conference-paper", "language": "en", "authors": [ "Theodoros Anagnostopoulos", "Arkady Zaslavsky", "Stefanos Georgiou", "Sergey Khoruzhnikov" ], "first_author": "Theodoros Anagnostopoulos", "venue": "Lecture notes in computer science", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Computer science", "Smart city", "Waste collection", "Scheduling (production processes)", "Internet of Things", "Data collection", "Routing (electronic design automation)", "Computer network", "Operations research", "Real-time computing", "Transport engineering" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-23126-6_8" }, { "id": "https://openalex.org/W1990790780", "doi": "10.1016/s1369-8478(01)00003-1", "title": "Survey of New Zealand truck driver fatigue and fitness for duty", "year": 2000, "publication_date": "2000-12-01", "type": "article", "language": "en", "authors": [ "Peter H. Baas", "Samuel G. Charlton", "Gary T. Bastin" ], "first_author": "Peter H. Baas", "venue": "Transportation Research Part F Traffic Psychology and Behaviour", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Duty", "Engineering", "Aeronautics", "Transport engineering", "Forensic engineering", "Automotive engineering", "Political science", "Law" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/s1369-8478(01)00003-1" }, { "id": "https://openalex.org/W4414561396", "doi": "10.3390/su17198693", "title": "Medium- and Heavy-Duty Electric Truck Charging Assessment to 2035 in California: Projections and Practical Challenges", "year": 2025, "publication_date": "2025-09-26", "type": "article", "language": "en", "authors": [ "Hong Yang", "Marshall R. Miller", "Lewis M. Fulton", "Aravind Kailas" ], "first_author": "Hong Yang", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "As of mid-2025, California maintains a target (and legal agreement with truck OEMs) to achieve 100% zero-emission medium- and heavy-duty (M/HD) truck sales by 2036. While the US federal government has relaxed its targets, fuel economy standards continue to incentivize electrification. To meet these ambitions, the adequate rollout of charging infrastructure at scale is needed. This paper reviews existing studies on M/HD charging and investment needs in California and the U.S. This paper introduces a novel matrix that delineates charging needs by charging power, truck type (Class 2b-8), charger-to-vehicle ratios, and charger investment costs. Results indicate that California may require 151,000 to 156,000 depot and public chargers on the road by 2030, growing to 434,000 to 460,000 chargers on the road by 2035. Corresponding investment—including new installation and replacement—could reach USD 7.1 to USD 7.4 billion by 2030 and USD 16.4 to USD 17.8 billion by 2035. Meeting this scale of infrastructure deployment represents not only a technical challenge but also a sustainability imperative, demanding unprecedented coordination among policymakers, utilities, and fleet operators to overcome barriers like financing and permitting and to ensure infrastructure growth aligns with climate commitments and equitable access.", "keywords": [ "Truck", "Software deployment", "Investment (military)", "Government (linguistics)", "Sustainability" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/17/19/8693/pdf?version=1758898579" }, { "id": "https://openalex.org/W4220680827", "doi": "10.1016/j.trd.2022.103258", "title": "Life cycle greenhouse gas emissions of alternative fuels and powertrains for medium-duty trucks: A Singapore case study", "year": 2022, "publication_date": "2022-03-24", "type": "article", "language": "en", "authors": [ "Lih Wei Yeow", "Yuting Yan", "Lynette W. Cheah" ], "first_author": "Lih Wei Yeow", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": "Alternatives to conventional diesel engines in medium/heavy-duty commercial trucks offer promising solutions to decarbonize road freight. We compare the life cycle greenhouse gas (GHG) emissions from diesel, battery electric (BEV) and hydrogen fuel cell (FCV) medium-duty urban delivery trucks (gross vehicle weight 3.5 – 7 metric tonnes) in Singapore, including the vehicle and fuel production, use phase and end-of-life stages. Use phase energy demand was estimated by simulating energy consumption on local real-world driving cycles. BEVs powered by the 2019 electricity mix had up to 11% lower GHG emissions than conventional diesel, but doubling battery capacity to meet travel range requirements resulted in up to 12% higher emissions. FCVs using gaseous hydrogen via steam methane reforming achieved 23 – 30% GHG reductions while satisfying range requirements. Efforts in obtaining updated and reliable data on vehicle production remain critical for assessments of emerging technologies and enacting evidence-based policies to decarbonize road freight.", "keywords": [ "Truck", "Diesel fuel", "Powertrain", "Greenhouse gas", "Environmental science", "Life-cycle assessment", "Waste management", "Automotive engineering", "Engineering", "Production (economics)" ], "cited_by_count": 37, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1361920922000888/pdf" }, { "id": "https://openalex.org/W3031119883", "doi": null, "title": "An Ant Colony Optimization for the Multi-Dock Truck Scheduling Problem with Cross-Docking", "year": 2017, "publication_date": "2017-09-01", "type": "article", "language": "en", "authors": [ "Chi-Yuan Luo", "Ching-Jung Ting" ], "first_author": "Chi-Yuan Luo", "venue": "DOAJ (DOAJ: Directory of Open Access Journals)", "publisher": null, "abstract": "Cross-docking operation is a new distribution strategy for synchronizing inbound and outbound trucks at the terminal. Products move directly from inbound dock to shipping dock without being stored in the distribution center. In this paper, we consider the truck scheduling problem which simultaneously determines dock assignment and truck scheduling of both inbound and outbound trucks for a multi-door cross-docking operation. The objective is to minimize total holding cost at the cross-docking terminal. A mixed integer programming model is first formulated for the problem. Since both dock assignment and truck scheduling problems are NP-hard, this truck scheduling problem is more difficult to solve. Thus we propose an ant colony optimization (ACO) algorithm for the problem. To evaluate the proposed ACO, 24 instances are generated and tested. The computational results and comparison with Gurobi optimizer solutions show that the ACO is competitive.", "keywords": [ "DOCK", "Docking (animal)", "Truck", "Ant colony optimization algorithms", "Computer science", "Scheduling (production processes)", "Job shop scheduling", "Engineering", "Artificial intelligence", "Automotive engineering", "Operations management", "Medicine" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doaj.org/article/cc86378d47884087812f9d3082ac50b0" }, { "id": "https://openalex.org/W2183505869", "doi": "10.1016/j.ejor.2015.09.049", "title": "A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints", "year": 2015, "publication_date": "2015-10-23", "type": "article", "language": "en", "authors": [ "Shahin Gelareh", "Rahimeh Neamatian Monemi", "Frédéric Semet", "Gilles Gonçalves" ], "first_author": "Shahin Gelareh", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Branch and cut", "Mathematical optimization", "Polytope", "Column generation", "Integer programming", "Branch and bound", "Truck", "Constraint (computer-aided design)", "Computer science", "Algorithm", "Dimension (graph theory)", "Assignment problem" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2015.09.049" }, { "id": "https://openalex.org/W2797592275", "doi": null, "title": "Integrate Vehicle Routing and Truck Sequencing in Cross-docking Operations", "year": 2014, "publication_date": "2014-01-01", "type": "article", "language": "en", "authors": [ "Ching‐Jung Ting", "Ting-Don Chen" ], "first_author": "Ching‐Jung Ting", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Vehicle routing problem", "Truck", "Docking (animal)", "Computer science", "Transport engineering", "Routing (electronic design automation)", "Engineering", "Computer network", "Automotive engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://digitalcommons.georgiasouthern.edu/cgi/viewcontent.cgi?article=1030&context=pmhr_2014" }, { "id": "https://openalex.org/W2589685526", "doi": "10.1007/978-3-319-53480-0_45", "title": "Multi-agent Based Truck Scheduling Using Ant Colony Intelligence in a Cross-Docking Platform", "year": 2017, "publication_date": "2017-01-01", "type": "conference-paper", "language": "en", "authors": [ "Houda Zouhaier", "Lamjed Ben Saïd" ], "first_author": "Houda Zouhaier", "venue": "Advances in intelligent systems and computing", "publisher": "Springer Nature", "abstract": null, "keywords": [ "DOCK", "Truck", "Computer science", "Ant colony optimization algorithms", "Scheduling (production processes)", "Distributed computing", "Job shop scheduling", "Interdependence", "Schedule", "Ant colony", "Operations research", "Artificial intelligence" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-53480-0_45" }, { "id": "https://openalex.org/W4321850414", "doi": "10.1007/s12351-023-00762-0", "title": "A multi-stage stochastic model for designing a linked cross-docking distribution network with heterogeneous trucks", "year": 2023, "publication_date": "2023-02-25", "type": "article", "language": "en", "authors": [ "Saeid Nasrollahi", "Hasan Hosseini-Nasab", "Mohammad Bagher Fakhrzad", "Mahboobeh Honarvar" ], "first_author": "Saeid Nasrollahi", "venue": "Operational Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Supply chain network", "Computer science", "Supply chain", "Economic shortage", "Network planning and design", "Computational intelligence", "Mathematical optimization", "Operations research", "Supply chain management", "Engineering", "Mathematics" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s12351-023-00762-0" }, { "id": "https://openalex.org/W4399087848", "doi": "10.1115/1.4065595", "title": "Velocity and Energy Consumption Prediction of Medium-Duty Electric Trucks Considering Road Features and Traffic Conditions", "year": 2024, "publication_date": "2024-05-28", "type": "article", "language": "en", "authors": [ "Hyunjin Ahn", "Heran Shen", "Xingyu Zhou", "Yung-Chi Kung", "John Maweu", "Junmin Wang" ], "first_author": "Hyunjin Ahn", "venue": "Journal of Dynamic Systems Measurement and Control", "publisher": "ASM International", "abstract": "Abstract Electric vehicles (EVs) have emerged as a promising solution to address environmental concerns, especially benefiting urban delivery and last-mile fleets due to their unique operational characteristics. Despite the potential advantages, the adoption of electric trucks (eTrucks) into delivery fleets has been slow, mainly due to the challenge posed by eTrucks' limited driving range. Consequently, a reliable method for predicting the eTrucks' energy consumption in fleet route planning is essential, and the accuracy of the velocity trajectory forecast forming the fundamental basis. This paper introduces a data-driven approach to predict the velocity and energy consumption of medium-duty (MD) eTrucks, considering various road features, payload, and traffic conditions. A gated recurrent unit (GRU) is trained using traffic-labeled characteristic features specific to each road segment within a delivery route. For every predefined route, the GRU generates the velocity profile by analyzing a sequence of traffic states predicted from the maximum entropy Markov model (MEMM). Corresponding eTruck energy consumption is estimated using an autonomie truck model. Real-world EV data are used to evaluate the proposed method, and the results demonstrate that the model effectively utilizes the information, achieving high accuracy in predicting both eTruck velocity and energy consumption.", "keywords": [ "Truck", "Energy consumption", "Automotive engineering", "Consumption (sociology)", "Duty", "Transport engineering", "Electric energy consumption", "Environmental science", "Computer science", "Engineering", "Electric energy", "Electrical engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1115/1.4065595" }, { "id": "https://openalex.org/W4386896894", "doi": "10.1002/nav.22151", "title": "A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup", "year": 2023, "publication_date": "2023-09-20", "type": "article", "language": "en", "authors": [ "Dongwei Li", "Joshua Ignatius", "Dujuan Wang", "Yunqiang Yin", "T.C.E. Cheng" ], "first_author": "Dongwei Li", "venue": "Naval Research Logistics (NRL)", "publisher": "Wiley", "abstract": "Abstract Increasing environmental concerns and e‐commerce has attracted a growing focus on reverse logistics that not only delivers some goods to customers but also picks up other goods from customers. To achieve cost‐efficient and fast deliveries, integrating drones into the delivery and pickup services provides a competitive advantage, which however increases the operational challenges. We consider a truck‐drone routing problem with simultaneous delivery and pickup, where each truck carries a set of heterogeneous drones. Each truck can simultaneously perform its own delivery and pickup, and serve as an intermediate movable depot from which multiple drones can be dispatched to serve customers when the truck arrives at a customer, and the truck must wait until all the drones return. The energy consumption of drones is considered during their flights. All the delivery services must be performed, whereas the pickup services are optional with certain rewards. The objective is to find the synthetic‐routes of the truck‐drone combinations so as to minimize the sum of the assignment cost and the transport cost of the trucks and drones minus the total pickup revenue. To solve the problem, we devise a tailored branch‐and‐price‐and‐cut algorithm incorporating a specialized two‐stage bidirectional labeling algorithm to solve the challenging pricing problem. To enhance the efficiency of the algorithm, we use the subset‐row inequalities to tighten the lower bound, and apply some heuristic pricing strategies to quickly solve the pricing problem. We perform extensive numerical studies to assess the performance of the developed algorithm, analyze the merit of the truck‐drone cooperative service mode over the truck‐only service mode and the superiority of the configuration with heterogeneous drones, and ascertain the impacts of the key model parameters to generate managerial insights. We also show how our model would perform should it be used for the medical supply delivery and pickup in Shenzhen, China.", "keywords": [ "Pickup", "Truck", "Drone", "Computer science", "Revenue", "Routing (electronic design automation)", "Heuristic", "Vehicle routing problem", "Operations research", "Mathematical optimization", "Business", "Engineering" ], "cited_by_count": 41, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/nav.22151" }, { "id": "https://openalex.org/W4213375795", "doi": "10.3390/en15041530", "title": "Optimizing Multi Cross-Docking Systems with a Multi-Objective Green Location Routing Problem Considering Carbon Emission and Energy Consumption", "year": 2022, "publication_date": "2022-02-18", "type": "article", "language": "en", "authors": [ "Ieva Meidutė‐Kavaliauskienė", "Nihal Sütütemiz", "Figen Yıldırım", "Shahryar Ghorbani", "Renata Činčikaitė" ], "first_author": "Ieva Meidutė‐Kavaliauskienė", "venue": "Energies", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Cross-docking is an excellent way to reduce the space required to store goods, inventory management costs, and customer order delivery time. This paper focuses on cost optimization, scheduling incoming and outgoing trucks, and green supply chains with multiple cross-docking. The three objectives are minimizing total operating costs, truck transportation sequences, and carbon emissions within the supply chain. Since the linear programming model is an integer of zero and one and belongs to NP-hard problems, its solution time increases sharply with increasing dimensions. Therefore, the non-dominated sorting genetic algorithm-II (NSGA-II) and the multi-objective particle swarm optimization (MOPSO) were used to find near-optimal solutions to the problem. Then, these algorithms were compared with criteria such as execution time and distance from the ideal point, and the superior algorithm in each criterion was identified.", "keywords": [ "Mathematical optimization", "Particle swarm optimization", "Computer science", "Integer programming", "Sorting", "Scheduling (production processes)", "Truck", "Vehicle routing problem", "Genetic algorithm", "Energy consumption", "Supply chain", "Routing (electronic design automation)" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/1996-1073/15/4/1530/pdf?version=1645614726" }, { "id": "https://openalex.org/W2763426329", "doi": "10.1016/j.procs.2017.09.011", "title": "Loading Time Flexibility in Cross-docking Systems", "year": 2017, "publication_date": "2017-01-01", "type": "conference-paper", "language": "en", "authors": [ "Dinçer Konur", "Mihalis Golias" ], "first_author": "Dinçer Konur", "venue": "Procedia Computer Science", "publisher": "Elsevier BV", "abstract": "In this study, we investigate truck-to-door assignment problem for loading outgoing trucks in a cross-docking system with flexible handling times. Specifically, a truck’s loading time depends on the number of workers assigned to the outbound door, where the truck is being loaded. An optimization problem is formulated to jointly determine the number of workers and the trucks to be loaded at each door. The resulting problem is a nonlinear integer programming model. Due to the complexity of this model, two evolutionary heuristic methods are proposed for solution. First heuristic method is based on truck assignments while the second heuristic is based on worker assignments. A numerical study is conducted to compare the two heuristic methods.", "keywords": [ "Truck", "Computer science", "Heuristic", "Flexibility (engineering)", "Integer programming", "Mathematical optimization", "Nonlinear programming", "Nonlinear system", "Algorithm", "Artificial intelligence", "Automotive engineering", "Mathematics" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.procs.2017.09.011" }, { "id": "https://openalex.org/W191632802", "doi": "10.5555/1866939.1866949", "title": "Modeling cross-docking operations using discrete event simulation", "year": 2010, "publication_date": "2010-06-07", "type": "article", "language": "en", "authors": [ "Georges M. Arnaout", "Elkin Rodriguez-Velasquez", "Ghaith Rabadi", "Rami Musa" ], "first_author": "Georges M. Arnaout", "venue": null, "publisher": null, "abstract": "Abstract. Cross-docking is a distribution system where products transported from warehouses to destinations are unloaded temporarily at intermediate facilities, and loaded onto outbound trucks to be shipped to their final destination. The complexity of cross-docking operations has been considered a problem of great interest to researchers and practitioners in the areas of Scheduling, Optimization, Supply Chain Management, and Operations Research. In this paper, a cross-docking simulation model is proposed to study the cross-docking problem. This problem has been addressed in the literature previously, but was considered in a deterministic fashion and with several strong assumptions. The contribution of our study is to present a stochastic discrete-event simulation for the problem where several scenarios will be studied aiming at relaxing some of the assumptions set by previous work. Finally, the study reveals some of the most important parameters that must be investigated in a crossdocking problem, and analyzes their significance on the final results.", "keywords": [ "Docking (animal)", "Computer science", "Discrete event simulation", "Scheduling (production processes)", "Truck", "Mathematical optimization", "Operations research", "Simulation", "Engineering", "Mathematics" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.369.7350" }, { "id": "https://openalex.org/W2124749298", "doi": null, "title": "Heuristics for Truck Scheduling at Cross Docking Terminals", "year": 2014, "publication_date": "2014-04-07", "type": "dissertation", "language": "en", "authors": [ "Wenying Yan" ], "first_author": "Wenying Yan", "venue": "Spectrum Research Repository (Concordia University)", "publisher": "Concordia University", "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.", "keywords": [ "Truck", "Heuristics", "Computer science", "Doors", "Docking (animal)", "Integer programming", "DOCK", "Scheduling (production processes)", "Operations research", "Engineering", "Operations management", "Algorithm" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://spectrum.library.concordia.ca/978412/1/Yan_MSc_S2014.pdf" }, { "id": "https://openalex.org/W2018869439", "doi": "10.1007/s10696-014-9201-3", "title": "Cross-docking assessment and optimization using multi-agent co-simulation: a case study", "year": 2014, "publication_date": "2014-08-16", "type": "article", "language": "en", "authors": [ "Eun Suk Suh" ], "first_author": "Eun Suk Suh", "venue": "Flexible Services and Manufacturing Journal", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "DOCK", "Computer science", "Supply chain", "Docking (animal)", "Truck", "Automotive engineering", "Engineering", "Business" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10696-014-9201-3" }, { "id": "https://openalex.org/W2221718825", "doi": "10.1016/j.promfg.2015.11.051", "title": "Fatigue Evaluation of Fuel Truck Drivers", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Yassierli Yassierli", "Manik Mahachandra", "Iftikar Zahedi SUTALAKSANA" ], "first_author": "Yassierli Yassierli", "venue": "Procedia Manufacturing", "publisher": "Elsevier BV", "abstract": "Fatigue has been considered as a main risk factor of accidents in transportation. The objective of this study was to evaluate fatigue level of fuel truck drivers and to provide recommendations to the company in order to minimizing the risk of fatigue. A total of 54 drivers (40 employees working at day shift, and 15 employees working at night shift) selected randomly agreed to participate. Fatigue developments while driving were monitored during 1st day, 3rd day and 5th day from a weekly rooster. Fatigue was measured thoroughly via changes in heart rate (HR), reductions in Critical Flicker Fusion (CFF) frequency using flicker apparatus, and increases in subjective sleepiness scale using the modified Karolinska Sleepiness Scale. Measurements were done for both day and night shifts, right before the drivers leaving the main depot in Plumpang, Jakarta for targeted gas stations and right after their return back to the depot (there were about 3-4 trips in a shift). Results of this study found that there was no significant effect of the measurement day on fatigue. Changes in HR appeared to be less sensitive to fatigue and sleepiness. Interestingly, fatigue development at night shift was significantly higher than that of day shift, based on changes in CFF and modified KSS (p<0.05). In general, fatigue level appeared to be at moderate-high levels, and the company was suggested to implement a comprehensive fatigue management system.", "keywords": [ "Truck", "Flicker fusion threshold", "Alertness", "Medicine", "Physical therapy", "Aeronautics", "Engineering", "Operations management", "Flicker", "Automotive engineering", "Psychiatry" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2351978915011671/pdf" }, { "id": "https://openalex.org/W2996999140", "doi": "10.1016/j.trd.2019.102209", "title": "Comparison of energy demands of drone-based and ground-based parcel delivery services", "year": 2019, "publication_date": "2019-12-27", "type": "article", "language": "en", "authors": [ "Thomas Kirschstein" ], "first_author": "Thomas Kirschstein", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Truck", "Flexibility (engineering)", "Transport engineering", "Last mile (transportation)", "Energy consumption", "Business", "Computer science", "Engineering", "Automotive engineering", "Mile" ], "cited_by_count": 262, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2019.102209" }, { "id": "https://openalex.org/W2804618900", "doi": "10.29252/iors.8.1.2", "title": "A Bi-Objective Green Truck Routing and Scheduling Problem in a Cross Dock with the Learning Effect", "year": 2017, "publication_date": "2017-04-01", "type": "article", "language": "en", "authors": [ "MirMohammad Musavi", "Reza R. Tavakkoli-Moghaddam", "Farnaz Rayat" ], "first_author": "MirMohammad Musavi", "venue": "Iranian Journal of Operations Research", "publisher": "Armenian Green Publishing Co.", "abstract": "We present a bi-objective model for a green truck scheduling and routing problem at a crossdocking system.This model determines three key decisions at the cross dock: (1) defining a sequence and schedule of inbound trucks at the receiving door, (2) specifying a sequence and a schedule of outbound trucks at the shipping door, and (3) determining the routes of the outbound truck while serving customers.The first objective function is related to responsiveness of the network that minimizes time window violations and the second objective function minimizes total fuel consumption of trucks in order to consider the environmental factor of the network.Also, a learning effect is considered in loading and unloading process times.To solve the bi-objective model, an archived multi-objective simulated annealing (AMOSA) is used and modified.Finally, a number of test problems are solved and the efficiency of the proposed AMOSA is compared with the -constraint method.", "keywords": [ "Truck", "Computer science", "Vehicle routing problem", "Schedule", "Scheduling (production processes)", "DOCK", "Job shop scheduling", "Simulated annealing", "Routing (electronic design automation)", "Fuel efficiency", "Time constraint", "Operations research" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "http://iors.ir/journal/files/site1/user_files_ba3acb/rtavakkoli-A-10-10-6-bbb5362.pdf" }, { "id": "https://openalex.org/W2528504233", "doi": "10.5829/idosi.ije.2016.29.11b.14", "title": "Trucks Scheduling in a Multi-product Cross Docking System with Multiple Temporary Storages and Multiple Dock Doors", "year": 2016, "publication_date": "2016-11-01", "type": "article", "language": "en", "authors": [], "first_author": null, "venue": "International Journal of Engineering", "publisher": "Materials and Energy Research Center", "abstract": "In order to reduce costs and increase efficiency of a supply chain system, cross docking is one of the most important strategies of warehousing for consolidation shipments from different suppliers to different customers. Products are collected from suppliers by inbound trucks and then moved to customers by outbound trucks through cross dock. Scheduling of trucks plays important role in the cross docking system. In this paper, we consider a single cross dock multi-product with multiple dock doors which sequence of products and trucks scheduling are specified simultaneously. Also, we have considered multiple temporary storages with different capacities and equipmentو each of which is used for a specific set of products. These products are perishable; so, avoiding from storage is necessary. A two- level optimization model for this problem is proposed. The first level includes scheduling of inbound and outbound trucks aim to minimizing makespan and second level is maximizing direct shipment in order to reduce the level of storage. The problem is mathematically formulated by a mixed integer, nonlinear programming (MINLP).  A real data set is used to solve the model and results confirm better efficiency and less storage.", "keywords": [ "DOCK", "Doors", "Truck", "Docking (animal)", "Scheduling (production processes)", "Computer science", "Engineering", "Operating system", "Automotive engineering", "Operations management", "Marine engineering", "Medicine" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5829/idosi.ije.2016.29.11b.14" }, { "id": "https://openalex.org/W2619423534", "doi": "10.1155/2017/4987127", "title": "Comparing an Approximate Queuing Approach with Simulation for the Solution of a Cross-Docking Problem", "year": 2017, "publication_date": "2017-01-01", "type": "article", "language": "en", "authors": [ "Roberta Briesemeister", "Antônio Galvão Novaes" ], "first_author": "Roberta Briesemeister", "venue": "Journal of Applied Mathematics", "publisher": "Hindawi Publishing Corporation", "abstract": "Cross-docking is a logistics management concept in which products are temporarily unloaded at intermediate facilities and loaded onto output trucks to be sent to their final destination. In this paper, we propose an approximate nonstationary queuing model to size the number of docks to receive the trucks, so that their unloading will be as short as possible at the receiving dock, thus making the cross-docking process more efficient. It is observed that the stochastic queuing process may not reach the steady equilibrium state. A type of modeling that does not depend on the stationary characteristics of the process developed is applied. In order to measure the efficiency, performance, and possible adjustments of the parameters of the algorithm, an alternative simulation model is proposed using the Arena® software. The simulation uses analytic tools to make the problem more detailed, which is not allowed in the theoretical model. The computational analysis compares the results of the simulated model with the ones obtained with the theoretical algorithm, considering the queue length and the average waiting time of the trucks. Based on the results obtained, the simulation represented very well the proposed problem and possible changes can be easily detected with small adjustments in the simulated model.", "keywords": [ "Truck", "Queueing theory", "Computer science", "Queue", "DOCK", "Mathematical optimization", "Simulation software", "Software", "Stochastic simulation", "Process (computing)", "Simulation", "Mathematics" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "http://downloads.hindawi.com/journals/jam/2017/4987127.pdf" }, { "id": "https://openalex.org/W2907030565", "doi": "10.1007/978-3-030-00473-6_29", "title": "A Decomposition-Based Heuristic for the Truck Scheduling Problem in a Cross-Docking Terminal", "year": 2018, "publication_date": "2018-01-01", "type": "book-chapter", "language": "en", "authors": [ "Manlio Gaudioso", "Maria Flavia Monaco", "Marcello Sammarra" ], "first_author": "Manlio Gaudioso", "venue": "AIRO Springer series/AIRO Springer Series", "publisher": "Springer International Publishing", "abstract": null, "keywords": [ "Docking (animal)", "Truck", "Computer science", "Heuristic", "Terminal (telecommunication)", "Scheduling (production processes)", "Mathematical optimization", "Engineering", "Mathematics", "Artificial intelligence", "Computer network", "Automotive engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-030-00473-6_29" }, { "id": "https://openalex.org/W2766035569", "doi": "10.1007/978-3-319-67308-0_60", "title": "An Optimization Model for the Outbound Truck Scheduling Problem at Cross-Docking Platforms", "year": 2017, "publication_date": "2017-01-01", "type": "conference-paper", "language": "en", "authors": [ "Antonio Diglio", "Andrea Genovese", "Carmela Piccolo" ], "first_author": "Antonio Diglio", "venue": "Springer proceedings in mathematics & statistics", "publisher": "Springer International Publishing", "abstract": null, "keywords": [ "Truck", "Scheduling (production processes)", "Computer science", "DOCK", "Job shop scheduling", "Operations research", "Mathematical optimization", "Docking (animal)", "Engineering", "Schedule", "Mathematics" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-67308-0_60" }, { "id": "https://openalex.org/W4407230029", "doi": "10.1016/j.eswa.2025.126757", "title": "Truck-multidrone same-day delivery strategies: On-road resupply vs depot return", "year": 2025, "publication_date": "2025-02-06", "type": "article", "language": "en", "authors": [ "David Sánchez-Wells", "José Luis Andrade-Pineda", "Pedro Luis González Rodríguez" ], "first_author": "David Sánchez-Wells", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": "This paper explores an enhanced two-waved same-day delivery (SDD) system that leverages a mothership truck equipped with multiple drones supported by an auxiliary “resupply” truck. Under standard SDD operations, this mothership truck, also capable of performing deliveries, must return to the depot to reload, incurring extra travel time and mileage. In contrast, the proposed resupply strategy enables the second delivery wave by dispatching a secondary vehicle to meet the mothership truck on-road, reloading parcels without interrupting ongoing deliveries by the drones. A single unified routing framework, the Genetic Algorithm with Iterated Estimations for Resupply (GAIER), is presented to optimise both strategies under two selectable criteria: minimising total service time or total truck mileage. In tests with benchmark networks of different sizes (20, 50, and 75 nodes), incorporating a resupply truck reduced every selected criterion when compared to the strategy where the mothership vehicle returns to the depot. Subsequent comparative analysis points an average reduction of 17 % in service time and 21 % in truck mileage while statistical analyses support the strategy choice significancy, confirming resupply strategy’s potential for cost savings and reduced environmental impact. These findings bolster our proposition that incorporating a resupply truck into hybrid truck-multidrone systems enhances flexibility in drone delivery scheduling and improves the system’s ability to meet urban demand.", "keywords": [ "Depot", "Truck", "Computer science", "Automotive engineering", "Aeronautics", "Operations research", "Simulation", "Transport engineering", "Engineering", "History" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2025.126757" }, { "id": "https://openalex.org/W3138950717", "doi": "10.1155/2021/2026834", "title": "A Hybrid Genetic Algorithm for Integrated Truck Scheduling and Product Routing on the Cross-Docking System with Multiple Receiving and Shipping Docks", "year": 2021, "publication_date": "2021-03-17", "type": "article", "language": "en", "authors": [ "Wooyeon Yu", "Chunghun Ha", "Sejoon Park" ], "first_author": "Wooyeon Yu", "venue": "Mathematical Problems in Engineering", "publisher": "Hindawi Publishing Corporation", "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.", "keywords": [ "DOCK", "Heuristics", "Truck", "Vehicle routing problem", "Scheduling (production processes)", "Job shop scheduling", "Computer science", "Mathematical optimization", "Genetic algorithm", "Algorithm", "Engineering", "Routing (electronic design automation)" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/mpe/2021/2026834.pdf" }, { "id": "https://openalex.org/W4319297038", "doi": "10.3390/math11040811", "title": "Vehicle Routing Optimization with Cross-Docking Based on an Artificial Immune System in Logistics Management", "year": 2023, "publication_date": "2023-02-05", "type": "article", "language": "en", "authors": [ "Shih‐Che Lo", "Ying-Lin Chuang" ], "first_author": "Shih‐Che Lo", "venue": "Mathematics", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Background: Manufacturing companies optimize logistics network routing to reduce transportation costs and operational costs in order to make profits in an extremely competitive environment. Therefore, the efficiency of logistics management in the supply chain and the quick response to customers’ demands are treated as an additional source of profit. One of the warehouse operations for intelligent logistics network design, called cross-docking (CD) operations, is used to reduce inventory levels and improve responsiveness to meet customers’ requirements. Accordingly, the optimization of a vehicle dispatch schedule is imperative in order to produce a routing plan with the minimum transport cost while meeting demand allocation. Methods: This paper developed a two-phase algorithm, called sAIS, to solve the vehicle routing problem (VRP) with the CD facilities and systems in the logistics operations. The sAIS algorithm is based on a clustering-first and routing-later approach. The sweep method is used to cluster trucks as the initial solution for the second phase: optimizing routing by the Artificial Immune System. Results: In order to examine the performance of the proposed sAIS approach, we compared the proposed model with the Genetic Algorithm (GA) on the VRP with pickup and delivery benchmark problems, showing average improvements of 7.26%. Conclusions: In this study, we proposed a novel sAIS algorithm for solving VRP with CD problems by simulating human body immune reactions. The experimental results showed that the proposed sAIS algorithm is robustly competitive with the GA on the criterion of average solution quality as measured by the two-sample t-test.", "keywords": [ "Vehicle routing problem", "Computer science", "Cluster analysis", "Profit (economics)", "Genetic algorithm", "Schedule", "Routing (electronic design automation)", "Scheduling (production processes)", "Operations research", "Mathematical optimization", "Operations management", "Engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2227-7390/11/4/811/pdf?version=1676535587" }, { "id": "https://openalex.org/W4312956865", "doi": "10.3934/mbe.2023146", "title": "Logistic models to minimize the material handling cost within a cross-dock", "year": 2022, "publication_date": "2022-01-01", "type": "article", "language": "en", "authors": [ "Taniya Mukherjee", "Isha Sangal", "Biswajit Sarkar", "Qais Almaamari" ], "first_author": "Taniya Mukherjee", "venue": "Mathematical Biosciences & Engineering", "publisher": "Arizona State University", "abstract": "Retail supply chains are intended to empower effectiveness, speed, and cost-savings, guaranteeing that items get to the end client brilliantly, giving rise to the new logistic strategy of cross-docking. Cross-docking popularity depends heavily on properly executing operational-level policies like assigning doors to trucks or handling resources to doors. This paper proposes a linear programming model based on door-to-storage assignment. The model aims to optimize the material handling cost within a cross-dock when goods are unloaded and transferred from the dock area to the storage area. A fraction of the products unloaded at the incoming gates is assigned to different storage zones depending on their demand frequency and the loading sequence. Numerical example considering a varying number of inbound cars, doors, products, and storage areas is analyzed, and the result proves that the cost can be minimized or savings can be intensified based on the feasibility of the research problem. The result explains that a variation in the number of inbound trucks, product quantity, and per-pallet handling prices influences the net material handling cost. However, it remains unaffected by the alteration in the number of material handling resources. The result also verifies that applying direct transfer of product through cross-docking is economical as fewer products in storage reduce the handling cost.", "keywords": [ "Doors", "Truck", "Pallet", "DOCK", "Computer science", "Supply chain", "Operations research", "Total cost", "Engineering", "Automotive engineering", "Business" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3934/mbe.2023146" }, { "id": "https://openalex.org/W4283156590", "doi": "10.1080/21693277.2022.2083714", "title": "Design and analysis of AGV-based cross-docking operations using analytical models", "year": 2022, "publication_date": "2022-06-20", "type": "article", "language": "en", "authors": [ "Xiao He", "Vittaldas V. Prabhu" ], "first_author": "Xiao He", "venue": "Production & Manufacturing Research", "publisher": "Taylor & Francis", "abstract": "Cross-docking is important for logistics because it reduces inventory, lead-times, and shipments. However, dynamic imbalances between supply and demand usually results in some inventory being warehoused in cross-docks. Therefore, flexible automation using robots, such as automated guided vehicles (AGV), can be used to improve performance of cross-docking, a trend in industry. This paper focuses on mathematical modeling of cross-docking operations when packages are moved in AGVs. A model based on Mean Value Analysis (MVA) is developed for determining the number of AGVs and estimating the service rate. This service rate is used as a parameter in a fork/join queuing model to characterize the performance of cross-docks in which outbound trucks get their packages directly from in-bound trucks as well as warehouses by estimating the queue lengths and mean sojourn times. The efficacy of the combined MVA and fork/join analytical models is verified using a discrete-event simulation as a case study, which shows that the models are largely in agreement in a test range with difference of 28% at the lowest throughput tested. Future study could use advances in sensors and Industry 4.0 for estimating parameters in the proposed models and improve performance and sustainability.", "keywords": [ "Queue", "Truck", "Queueing theory", "Automation", "Computer science", "Cross-validation", "Discrete event simulation", "Simulation", "Automated guided vehicle", "Fork (system call)", "Operations research", "Engineering" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/21693277.2022.2083714" }, { "id": "https://openalex.org/W4302028130", "doi": "10.1016/j.ejtl.2022.100095", "title": "Scheduling cross-docking operations under uncertainty: A stochastic genetic algorithm based on scenarios tree", "year": 2022, "publication_date": "2022-01-01", "type": "article", "language": "en", "authors": [ "Andrea Gallo", "Riccardo Accorsi", "Renzo Akkerman", "Riccardo Manzini" ], "first_author": "Andrea Gallo", "venue": "EURO Journal on Transportation and Logistics", "publisher": "Springer Science+Business Media", "abstract": "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 instances. 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.", "keywords": [ "Truck", "Computer science", "Genetic algorithm", "Schedule", "Scheduling (production processes)", "Operations research", "Mathematical optimization", "DOCK", "Stochastic programming", "Job shop scheduling", "Engineering", "Mathematics" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2192437622000206/pdf" }, { "id": "https://openalex.org/W2946031390", "doi": "10.1016/j.asoc.2019.105513", "title": "Hybrid bi-objective gray wolf optimization algorithm for a truck scheduling problem in the automotive industry", "year": 2019, "publication_date": "2019-05-21", "type": "article", "language": "en", "authors": [ "Tao Peng", "Binghai Zhou" ], "first_author": "Tao Peng", "venue": "Applied Soft Computing", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Tardiness", "Job shop scheduling", "Mathematical optimization", "Truck", "Computer science", "Automotive industry", "Integer programming", "Algorithm", "Scheduling (production processes)", "Metaheuristic", "Schedule", "Mathematics" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.asoc.2019.105513" }, { "id": "https://openalex.org/W2050124121", "doi": "10.2139/ssrn.2697638", "title": "Cross-Docking and its Implications in Location-Distribution Systems", "year": 2015, "publication_date": "2015-01-01", "type": "preprint", "language": "en", "authors": [ "Mehmet Gümüş", "James H. Bookbinder" ], "first_author": "Mehmet Gümüş", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Docking (animal)", "Computer science", "Medicine" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.2697638" }, { "id": "https://openalex.org/W4206470773", "doi": "10.1590/0103-6513.20210091", "title": "Scheduling of the inbound and outbound trucks at a Cross-Docking platform considering mutualization of docks", "year": 2022, "publication_date": "2022-01-01", "type": "article", "language": "en", "authors": [ "Natalia Cordoba", "Alejandro Montoya" ], "first_author": "Natalia Cordoba", "venue": "Production", "publisher": "Associação Brasileira de Engenharia de Produção", "abstract": "Paper aims This paper studies a new Cross-Docking (CD) scheduling problem inspired by the trend of resource mutualization at CD operations where a company owning a CD platform can lease its docks to other companies. Originality This work pioneers the studies of the resource mutualization at CD operations solving at scheduling problem, where there is a set of requirements for leasing the loading and unloading docks for a period, and the company owning the docks can accept or decline each requirement. Considering that the availability of the docks is linked to scheduling the trucks at the company’s loading and unloading docks, the decision to accept the requirements must be made along with the decisions for scheduling the trucks. Research method To solve this problem, this work proposes a Mixed-Integer Linear Programming (MILP) formulation. Main findings Using a commercial solver, the MILP formulation can optimally solve 65/128 instances based on a real operation. For the remaining instances, the MILP formulation obtains an average optimized gap of 8.95%. Implications for theory and practice The MILP formulation obtains acceptable results. Moreover, we found that all the instances accepted the requirements showing that it is economically interesting to lease docks.", "keywords": [ "Lease", "Truck", "Scheduling (production processes)", "Operations research", "Solver", "Integer programming", "Job shop scheduling", "Computer science", "Mathematical optimization", "Engineering", "Operations management", "Business" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.scielo.br/j/prod/a/jLBbNjWQrX5jYmV3dgcZFSQ/?lang=en&format=pdf" }, { "id": "https://openalex.org/W4388773809", "doi": "10.1016/j.eswa.2023.122485", "title": "Data-driven robust optimization for a multi-trip truck-drone routing problem", "year": 2023, "publication_date": "2023-11-16", "type": "article", "language": "en", "authors": [ "Mohsen Roytvand Ghiasvand", "Donya Rahmani", "Mohammad Moshref‐Javadi" ], "first_author": "Mohsen Roytvand Ghiasvand", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Vehicle routing problem", "Cluster analysis", "Drone", "Truck", "Robust optimization", "Column generation", "Mathematical optimization", "Routing (electronic design automation)", "Newsvendor model", "Machine learning", "Supply chain" ], "cited_by_count": 30, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2023.122485" }, { "id": "https://openalex.org/W3008945985", "doi": "10.24352/ub.ovgu-2020-002", "title": "A Two-Tier Urban Delivery Network with Robot-based Deliveries", "year": 2020, "publication_date": "2020-01-23", "type": "article", "language": "en", "authors": [ "Iurii Bakach", "Ann Melissa Campbell", "Jan Fabian Ehmke" ], "first_author": "Iurii Bakach", "venue": "Otto-von-Guericke-Universität Magdeburg", "publisher": null, "abstract": "In this paper, we investigate a two-tier delivery network with robots operating on the second tier. We determine the optimal number of local robot hubs as well as the optimal number of robots to service all customers and compare the resulting operational cost to conventional truck-based deliveries. Based on the well-known p-median problem, we present mixed-integer programs that consider the limited range of robots due to battery size. Compared to conventional truck-based deliveries, robot-based deliveries can save about 70% of operational cost and even more, up to 90%, for a scenario with customer time windows.", "keywords": [ "Computer science", "Robot", "Computer network", "Operations research", "Artificial intelligence", "Mathematics" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.24352/ub.ovgu-2020-002" }, { "id": "https://openalex.org/W2528128345", "doi": "10.1007/s10799-016-0267-3", "title": "A decision support system for improved resource planning and truck routing at logistic nodes", "year": 2016, "publication_date": "2016-10-03", "type": "article", "language": "en", "authors": [ "Alessandro Hill", "Jürgen W. Böse" ], "first_author": "Alessandro Hill", "venue": "Information Technology and Management", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Computer science", "Container (type theory)", "Routing (electronic design automation)", "Node (physics)", "Cloud computing", "Transport engineering", "Operations research", "Decision support system", "Resource (disambiguation)", "Computer network", "Engineering" ], "cited_by_count": 27, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10799-016-0267-3" }, { "id": "https://openalex.org/W4389662517", "doi": "10.1016/j.trpro.2023.11.878", "title": "Comparison of the social cost of cargo bikes, electric and thermal commercial trucks for urban deliveries", "year": 2023, "publication_date": "2023-01-01", "type": "article", "language": "en", "authors": [ "Antoine Robichet", "Patrick Niérat", "François Combes" ], "first_author": "Antoine Robichet", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "Road transport is a major contributor to greenhouse gas emissions on a global scale. In addition, in urban areas, other negative externalities must be considered, such as congestion, noise, etc. Freight transport is responsible for a significant part of these externalities which companies are not, today, financially charged. To address these issues, one solution is to operate the city in a more sustainable way. In this study, we compare the social cost (cost of ownership and environmental cost) of three technologies (Light Commercial Trucks – LCTs, electric LCTs and cargo bikes) in the case of Paris City. The main results indicate that it is worthwhile to use cargo bikes up to a certain point, the optimum being a mixed fleet. The originality of this study is that it is based on an operational database of one carrier's activities during two months in the Ile-de-France region.", "keywords": [ "Truck", "Externality", "Transport engineering", "Business", "Greenhouse gas", "Social cost", "Scale (ratio)", "Environmental economics", "Sustainable transport", "Point (geometry)", "Engineering", "Economics" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trpro.2023.11.878" }, { "id": "https://openalex.org/W2120255397", "doi": null, "title": "Short term storage of goods in cross-docking operations", "year": 2004, "publication_date": "2004-01-01", "type": "preprint", "language": "en", "authors": [ "Iris F.A. Vis", "Kees Jan Roodbergen" ], "first_author": "Iris F.A. Vis", "venue": "RePEc: Research Papers in Economics", "publisher": "Federal Reserve Bank of St. Louis", "abstract": "Cross docking is one of the options to reduce lead times and inventories and to improve customer response time in supply chains. Cross-docking centres are dynamic environments where products arrive, are regrouped, and leave the same day. In this paper we focus on the process of short-term storage of unit-Ioads in a cross-docking environment. The goal is to determine temporary storage locations for incoming unit loads such that the travel distances of the forklift trucks with these unit loads are minimised. We model this problem as a navel application of the minimum cast flow problem and show the applicability of the model for different types of layouts and priorities.", "keywords": [ "Truck", "Computer science", "Docking (animal)", "Unit load", "Operations research", "Engineering", "Automotive engineering", "Business", "Marketing" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://research.vu.nl/en/publications/24d48841-f3d5-40e1-8f29-6a17e0ebcb32" }, { "id": "https://openalex.org/W2020178391", "doi": "10.3126/jie.v8i1-2.5114", "title": "Cross-Docking Operations for Supply Chain Logistics in JIT Production and Distribution Systems", "year": 1970, "publication_date": "1970-01-01", "type": "article", "language": "en", "authors": [ "Gyan Bahadur Thapa", "Tanka Nath Dhamala", "Shankar Raj Pant" ], "first_author": "Gyan Bahadur Thapa", "venue": "Journal of the Institute of Engineering", "publisher": null, "abstract": "The multi-level production problem is one of the challenging research areas in supply chain management. We present brief literature review and mathematical models of multi-level just-in-time sequencing problem with a view of cross-docking approach for supply chain logistics. Describing cross-docking operations, we propose a mathematical model for the cross-docking supply chain logistics problem to minimize the operation time as truck sequencing problem. We establish a proposition as the synthesis of the production and logistics.Key Words: Just-in-time; Supply chain; Logistics; Cross-dock; Operation timeDOI: http://dx.doi.org/10.3126/jie.v8i1-2.5114Journal of the Institute of Engineering Vol. 8, No. 1&2, 2010/2011Page: 219-230Uploaded Date: 20 July, 2011", "keywords": [ "Supply chain", "Truck", "Supply chain management", "Computer science", "Operations research", "Business", "Engineering", "Automotive engineering" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.nepjol.info/index.php/JIE/article/download/5114/4250" }, { "id": "https://openalex.org/W4226256297", "doi": "10.1016/j.procs.2022.01.339", "title": "A novel mathematical approach for the Truck-and-Drone Location-Routing Problem", "year": 2022, "publication_date": "2022-01-01", "type": "conference-paper", "language": "en", "authors": [ "Laura Castro Montaña", "Laura Malagón-Alvarado", "Paola Andrea Miranda", "Mateo Montealegre Arboleda", "Elyn Lizeth Solano Charris", "Carlos Alberto Vega-Mejía" ], "first_author": "Laura Castro Montaña", "venue": "Procedia Computer Science", "publisher": "Elsevier BV", "abstract": "During the last decade, e-commerce has increased last-mile deliveries, impacting the (CO2) emissions footprint. Considering this environmental impact, sustainable technologies have emerged for transport operations, e.g., drones and electric vehicles. This paper deals with the Location-Routing Problem for delivering orders to a set of customers. The problem aims to minimize the total CO2 emissions due to freight transportation in last-mile deliveries with Trucks-and-Drones. A mathematical model is proposed for solving the problem. We test the model in different scenarios varying the number of clients (between 10 and 25), the number of trucks and drones (between 4 and 12 and between 5 and 13, respectively), and the available depots (i.e., between 5 and 15 parking lots). Our results provide insights on how shifting to cleaner transportation technologies can aid in the reduction of the carbon footprint of distribution activities and present a preamble of the significant impact that UAVs have in parcel delivery routing problems.", "keywords": [ "Drone", "Truck", "Computer science", "Carbon footprint", "Routing (electronic design automation)", "Vehicle routing problem", "Last mile (transportation)", "Operations research", "Transport engineering", "Footprint", "Mile", "Greenhouse gas" ], "cited_by_count": 23, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877050922003489/pdf" }, { "id": "https://openalex.org/W2158874997", "doi": "10.5267/j.msl.2012.12.009", "title": "Scheduling trucks in cross docking systems with temporary storage and dock repeat truck holding pattern using genetic algorithm", "year": 2013, "publication_date": "2013-01-24", "type": "article", "language": "en", "authors": [ "Ehsan Ghobadian", "Reza R. Tavakkoli-Moghaddam", "Mahdi Naderi-Beni", "Hassan Javanshir" ], "first_author": "Ehsan Ghobadian", "venue": "Management Science Letters", "publisher": "Growing Science", "abstract": "Cross docking is one of the most important issues in management of supply chains.In cross docking, different items delivered to a warehouse by inbound trucks are directly arranged and reorganized based on customer demands, routed and loaded into outbound trucks for delivery purposes to customers without virtually keeping them at the warehouse.If any item is kept in storage, it is normally for a short amount of time, say less than 24 hours.In this paper, we consider a special case of cross docking where there is temporary storage and implements genetic algorithm to solve the resulted problem for some realistic test problems.In our method, we first use some heuristics as initial solutions and then improve the final solution using genetic algorithm.The performance of the proposed model is compared with alternative solution strategy, the GRASP method.", "keywords": [ "Truck", "DOCK", "Computer science", "Scheduling (production processes)", "Genetic algorithm", "Algorithm", "Operations management", "Automotive engineering", "Engineering", "Machine learning" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5267/j.msl.2012.12.009" }, { "id": "https://openalex.org/W594128088", "doi": null, "title": "USING MARGINAL COSTS TO EVALUATE DRAYAGE RATES IN RAIL-TRUCK INTERMODAL SERVICE", "year": 1993, "publication_date": "1993-01-01", "type": "article", "language": "en", "authors": [ "Lazar Spasovic", "E K Morlok" ], "first_author": "Lazar Spasovic", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "An operations planning model of the highway portion, or drayage, of rail-truck intermodal transport is used to develop pricing guidelines for drayage service. The model, originally developed and used to evaluate the potential of reducing cost and improving service quality of drayage, also generates marginal (incremental) costs of moving loads in the drayage operation. The marginal costs are used to evaluate the efficiency of drayage rates charged by truckers in the current operation as well as rates used in a proposed operation with centralized planning of tractor and trailer movements. The insights gained from this analysis are used to develop guidelines for using marginal costs in the areas of pricing intermodal door-to-door movements, load solicitation, and decisions regarding load acceptance. Application of the model as a decision support tool for assisting intermodal management in developing proper strategies for pricing and marketing of intermodal service is illustrated. The need for railroad management to become aware of the characteristics of drayage operation and the systemwide impacts of drayage movements on the cost and thus profitability of intermodal operation is indicated.", "keywords": [ "Truck", "Profitability index", "Transport engineering", "Trailer", "Marginal cost", "Service (business)", "Operations research", "Engineering", "Business", "Marketing", "Economics", "Automotive engineering" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/378410" }, { "id": "https://openalex.org/W2001735394", "doi": "10.1007/s12063-011-0057-3", "title": "Vis-à-vis vs. mixed dock door assignment: A comparison of different cross dock layouts", "year": 2011, "publication_date": "2011-09-22", "type": "article", "language": "en", "authors": [ "Konrad Stephan", "Nils Boysen" ], "first_author": "Konrad Stephan", "venue": "Operations Management Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "DOCK", "Terminal (telecommunication)", "Doors", "Flexibility (engineering)", "Destinations", "Truck", "Business", "Operations research", "Computer science", "Operations management", "Economics", "Engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://nbn-resolving.org/urn:nbn:de:gbv:27-20110203-101008-2" }, { "id": "https://openalex.org/W4410360275", "doi": "10.1080/21681015.2025.2498662", "title": "Optimizing truck scheduling and dock placement at cross-docking systems through a hybrid genetic-ant colony optimization algorithm", "year": 2025, "publication_date": "2025-05-14", "type": "article", "language": "en", "authors": [ "Ehsan Esmaeeli", "Alireza Haji", "Jalal Rezaeenour", "Maryam Sabaghieh Yazd", "Mohammad Reza Feylizadeh" ], "first_author": "Ehsan Esmaeeli", "venue": "Journal of Industrial and Production Engineering", "publisher": "Taylor & Francis", "abstract": "This paper proposes an innovative two-stage methodology to optimize truck scheduling and dock placement in cross-docking systems, streamlining logistics by transferring shipments directly from inbound to outbound vehicles without storage. The first stage addresses strategic warehouse location decisions to enhance logistics networks, while the second focuses on operational efficiencies in truck routing and scheduling. A hybrid genetic-ant colony optimization algorithm reduces costs, minimizes environmental impacts, and improves service quality. Supported by mathematical modeling and experimental analysis, the results demonstrate the methodology’s ability to enhance efficiency and reduce costs. Findings reveal that Increasing fleet capacity reduces emissions and costs, balancing economic and environmental goals. Experimental results indicate that the hybrid approach achieves up to 25% cost savings and a 19% improvement in Pareto efficiency compared to standalone methods, highlighting its practical applications in logistics and providing a foundation for future research to address uncertainties, incorporate inventory management, and refine optimization approaches.", "keywords": [ "DOCK", "Ant colony optimization algorithms", "Computer science", "Truck", "Scheduling (production processes)", "Genetic algorithm", "Docking (animal)", "Optimization algorithm", "Mathematical optimization", "Algorithm", "Engineering", "Mathematics" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/21681015.2025.2498662" }, { "id": "https://openalex.org/W2033631410", "doi": "10.1016/j.apergo.2011.06.019", "title": "How well do truck drivers sleep in cabin sleeper berths?", "year": 2011, "publication_date": "2011-08-06", "type": "article", "language": "en", "authors": [ "David Darwent", "Gregory Daniel Roach", "Drew E. Dawson" ], "first_author": "David Darwent", "venue": "Applied Ergonomics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Sleep (system call)", "Poison control", "Nap", "Transport engineering", "Medicine", "Environmental health", "Engineering", "Psychology", "Automotive engineering", "Computer science" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://figshare.com/articles/journal_contribution/How_well_do_truck_drivers_sleep_in_cabin_sleeper_berths_/13431494" }, { "id": "https://openalex.org/W3026788256", "doi": "10.1177/0361198120917162", "title": "Exploring Benefits of Cargo-Cycles versus Trucks for Urban Parcel Delivery under Different Demand Scenarios", "year": 2020, "publication_date": "2020-05-01", "type": "article", "language": "en", "authors": [ "Giacomo Dalla Chiara", "André Romano Alho", "Cheng Cheng", "Moshe E Ben-Akiva", "Lynette W. Cheah" ], "first_author": "Giacomo Dalla Chiara", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "Urban deliveries are traditionally carried out with vans or trucks. These vehicles tend to face parking difficulties in dense urban areas, leading to traffic congestion. Smaller and nimbler vehicles by design, such as cargo-cycles, struggle to compete in distance range and carrying capacity. However, a system of cargo-cycles complemented with strategically located cargo-storing hubs can overcome some limitations of the cargo-cycles. Past research provides a limited perspective on how demand characteristics and parking conditions in urban areas are related to potential benefits of this system. To fill this gap, we propose a model to simulate the performance of different operational scenarios—a truck-only scenario and a cargo-cycle with mobile hubs scenario—under different delivery demand and parking conditions. We apply the model to a case study using data synthesized from observed freight-carrier demand in Singapore. The exploration of alternative demand scenarios informs how demand characteristics influence the viability of the solution. Furthermore, a sensitivity analysis clarifies the contributing factors to the demonstrated results. The combination of cargo-cycles and hubs can achieve progressive reductions in kilometers-traveled and hours-traveled up to around densities of 150 deliveries/km 2 , beyond which savings taper off. Whereas the reduction in kilometers-traveled is influenced by the the carrying capacity of the cargo-cycle, the reduction in hours-traveled is related to to the cargo-cycle ability to effectively decrease the parking dwell time by reducing, for instance, the time spent searching for parking and the time spent walking to a delivery destination.", "keywords": [ "Truck", "Transport engineering", "Range (aeronautics)", "Traffic congestion", "Computer science", "Engineering", "Automotive engineering" ], "cited_by_count": 36, "is_retracted": false, "is_paratext": false, "open_access_url": "https://journals.sagepub.com/doi/pdf/10.1177/0361198120917162" }, { "id": "https://openalex.org/W4413008552", "doi": "10.3390/math13152533", "title": "Inbound Truck Scheduling for Workload Balancing in Cross-Docking Terminals", "year": 2025, "publication_date": "2025-08-06", "type": "article", "language": "en", "authors": [ "Younghoo Noh", "S.W. Lee", "Jeongyoon Hong", "Jeongeum Kim", "Sung Won Cho" ], "first_author": "Younghoo Noh", "venue": "Mathematics", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "The rapid growth of e-commerce and advances in information and communication technologies have placed increasing pressure on last-mile delivery companies to enhance operational productivity. As investments in logistics infrastructure require long-term planning, maximizing the efficiency of existing terminal operations has become a critical priority. This study proposes a mathematical model for inbound truck scheduling that simultaneously minimizes truck waiting times and balances workload across temporary inventory storage located at outbound chutes in cross-docking terminals. The model incorporates a dynamic rescheduling strategy that updates the assignment of inbound trucks in real time, based on the latest terminal conditions. Numerical experiments, based on real operational data, demonstrate that the proposed approach significantly outperforms conventional strategies such as First-In First-Out (FIFO) and Random assignment in terms of both load balancing and truck turnaround efficiency. In particular, the proposed model improves workload balance by approximately 10% and 12% compared to the FIFO and Random strategies, respectively, and it reduces average truck waiting time by 17% and 18%, thereby contributing to more efficient workflow and alleviating bottlenecks. The findings highlight the practical potential of the proposed strategy for improving the responsiveness and efficiency of parcel distribution centers operating under fixed infrastructure constraints. Future research may extend the proposed approach by incorporating realistic operational factors, such as cargo heterogeneity, uncertain arrivals, and terminal shutdowns due to limited chute storage.", "keywords": [ "Workload", "Truck", "Docking (animal)", "Computer science", "Scheduling (production processes)", "Engineering", "Operating system", "Automotive engineering", "Operations management" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2227-7390/13/15/2533/pdf?version=1754490225" }, { "id": "https://openalex.org/W4310470361", "doi": "10.1080/23302674.2022.2142463", "title": "An optimization model for forklift utilisation and congestion control in cross-docking terminals", "year": 2022, "publication_date": "2022-11-30", "type": "article", "language": "en", "authors": [ "Vahid Ghomi", "Farnaz Ghazi Nezami", "Sina Shokoohyar", "Mina Ghofrani Esfahani" ], "first_author": "Vahid Ghomi", "venue": "International Journal of Systems Science Operations & Logistics", "publisher": "Taylor & Francis", "abstract": "This study aims to optimize cross-docking (CD) performance and efficiency in CD assignment problems by maximising forklift utilisation inside the terminal. ‘We present a new Mixed-Integer Nonlinear programming (MINLP)’ model that considers truck-door assignment and forklift utilisation inside the airport. One objective is to enhance the quality of truck-door by minimising the total transshipment costs, including the penalty cost associated with forklift underutilisation, the total forklift travel distance cost, and the total weighted loading unloading and operator cost. Another objective is to control the forklift congestion by minimising the total number of forklifts needed to transfer products between multiple doors inside the terminal. Two algorithms, including the tabu-search and the best-local-point-finder, are proposed to accomplish these objectives. Our computational results show the advantage of the proposed algorithms over the CPLEX commercial solver.", "keywords": [ "Transshipment (information security)", "Tabu search", "Solver", "Doors", "Computer science", "Truck", "Mathematical optimization", "Total cost", "Integer programming", "Operations research", "Engineering", "Automotive engineering" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://scholarsphere.psu.edu/resources/18080308-198d-4f09-afa2-34bb2a25058c" }, { "id": "https://openalex.org/W4301431241", "doi": "10.1016/j.pmcj.2022.101700", "title": "On the Scheduling of Conflictual Deliveries in a last-mile delivery scenario with truck-carried drones", "year": 2022, "publication_date": "2022-10-05", "type": "article", "language": "en", "authors": [ "Francesco Betti Sorbelli", "Federico Corò", "Sajal Kumar Das", "Lorenzo Palazzetti", "Cristina Maria Pinotti" ], "first_author": "Francesco Betti Sorbelli", "venue": "Pervasive and Mobile Computing", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Drone", "Mile", "Truck", "Last mile (transportation)", "Scheduling (production processes)", "Operations management", "Automotive engineering" ], "cited_by_count": 27, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.pmcj.2022.101700" }, { "id": "https://openalex.org/W2949957913", "doi": "10.1007/978-3-030-21803-4_101", "title": "A Genetic Algorithm for Solving the Truck-Drone-ATV Routing Problem", "year": 2019, "publication_date": "2019-06-14", "type": "conference-paper", "language": "en", "authors": [ "Mahdi Moeini", "Hagen Salewski" ], "first_author": "Mahdi Moeini", "venue": "Advances in intelligent systems and computing", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Drone", "Truck", "Grid", "Computer science", "Vehicle routing problem", "Merge (version control)", "Routing (electronic design automation)", "Engineering", "Operations research", "Computer network", "Geography", "Aerospace engineering" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-030-21803-4_101" }, { "id": "https://openalex.org/W4390120137", "doi": "10.18485/aeletters.2023.8.4.1", "title": "Energy-Efficiency and Sustainability in Cross-Docking Supply Using E-Vehicles", "year": 2023, "publication_date": "2023-01-01", "type": "article", "language": "en", "authors": [ "Ágota Bányai" ], "first_author": "Ágota Bányai", "venue": "Applied Engineering Letters Journal of Engineering and Applied Sciences", "publisher": null, "abstract": "Manufacturing and service companies in different sectors are trying to green their supply chains in two ways: by optimizing processes and by using green technologies such as electric vehicles.Cross-docking offers a good solution for optimizing supply chain processes.The aim of this research is to investigate how cross-docking supply with electric vehicles can lead to energy efficient solutions and emission reduction.The scientific novelty of this research is the integration of a process improvement solution and the application of advanced technology through optimization.The presented functional model, mathematical model and its solution algorithm are suitable to demonstrate the economic feasibility of applying a crossdocking facility and solving the transportation tasks with e-trucks for a conventional supply chain.Based on the numerical studies presented, it can be concluded, that the proposed solution can significantly contribute to the optimization of local and global supply chains, reducing the ecological footprint of supply chains both locally and globally.As the analysis of case studies shows, it is possible to reach an energy efficiency improvement of about 40%, which can also lead to a significant GHG emission up to 30%.", "keywords": [ "Supply chain", "Truck", "Sustainability", "Efficient energy use", "Ecological footprint", "Computer science", "Energy supply", "Novelty", "Automotive engineering", "Greenhouse gas", "Environmental economics", "Business" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "http://doi.fil.bg.ac.rs/pdf/journals/aeletters/2023-4/aeletters-2023-8-4-1.pdf" }, { "id": "https://openalex.org/W4404087519", "doi": "10.1007/s10586-024-04809-5", "title": "Multi-depot vehicle routing problem with drones in emergency logistics", "year": 2024, "publication_date": "2024-11-04", "type": "article", "language": "en", "authors": [ "Xun Weng", "Wenke She", "Hong-Qiang Fan", "Jingtian Zhang", "Lifen Yun" ], "first_author": "Xun Weng", "venue": "Cluster Computing", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Computer science", "Vehicle routing problem", "Depot", "Drone", "Routing (electronic design automation)", "Operations research", "Computer network" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10586-024-04809-5" }, { "id": "https://openalex.org/W2092781554", "doi": "10.12812/ksms.2013.15.2.167", "title": "Development of Dispatching Strategy for Inbound and Outbound Trucks in Cross Docking System", "year": 2013, "publication_date": "2013-06-30", "type": "article", "language": "en", "authors": [ "Wooyeon Yu", "Pius J. Egbelu" ], "first_author": "Wooyeon Yu", "venue": "Journal of the Korea Safety Management and Science", "publisher": null, "abstract": "A cross docking operation involves multiple inbound trucks that deliver items from suppliers to a distribution center and multiple outbound trucks that ship items from the distribution center to customers. Based on customer demands, an inbound truck may have its items transferred to multiple outbound trucks. Similarly, an outbound truck can receive its consignments from multiple inbound trucks. The objective of this study is to find the best truck spotting sequence for both inbound and outbound trucks in order to minimize total operation time of the cross docking system under the condition that multiple visits to the dock by a truck to unload or load its consignments is allowed. The allocations of the items from inbound trucks to outbound trucks are determined simultaneously with the spotting sequences of both the inbound and outbound trucks.", "keywords": [ "Truck", "Computer science", "Transport engineering", "DOCK", "Automotive engineering", "Engineering", "Marine engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "http://koreascience.or.kr:80/article/JAKO201319947249383.pdf" }, { "id": "https://openalex.org/W4253378911", "doi": "10.1504/ijise.2020.107778", "title": "Particle swarm optimisation for truck scheduling problem in cross docking network", "year": 2020, "publication_date": "2020-01-01", "type": "article", "language": "en", "authors": [ "Warisa Wisittipanich", "Takashi Irohara", "Piya Hengmeechai" ], "first_author": "Warisa Wisittipanich", "venue": "International Journal of Industrial and Systems Engineering", "publisher": "Inderscience Publishers", "abstract": "In cross docking network, multiple products from multiple origins are transferred by trucks through one or more cross docks. One critical concern is the decision on how to synchronise product transshipment through multiple cross docks to achieve timely shipment. This paper presents a mathematical model of truck scheduling problem in cross docking network in order to minimise makespan. Since the problem is NP-hard, a solution method is developed based on particle swarm optimisation (PSO) with two solution representations: randomised truck solution representation (Ra-SR) and prioritised truck solution representation (Pr-SR). The results show that the PSO-based approach performs well in solving the problem. Both solution representations are proven effective when comparing the solution quality and computational time with optimal results obtained from LINGO. However, the Pr-SR yields superior results to the Ra-SR in terms of solution quality and convergence behaviour for most instances especially in the case of large-size problems.", "keywords": [ "Particle swarm optimization", "Truck", "Transshipment (information security)", "Job shop scheduling", "Mathematical optimization", "Computer science", "Scheduling (production processes)", "Operations research", "Engineering", "Mathematics", "Automotive engineering", "Computer network" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijise.2020.107778" }, { "id": "https://openalex.org/W3168902832", "doi": "10.1016/j.ejor.2021.06.019", "title": "Scheduling truck drivers with interdependent routes under European Union regulations", "year": 2021, "publication_date": "2021-06-15", "type": "article", "language": "en", "authors": [ "Carlo S. Sartori", "Pieter Smet", "Greet Vanden Berghe" ], "first_author": "Carlo S. Sartori", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Interdependence", "Computer science", "Vehicle routing problem", "Operations research", "Scheduling (production processes)", "Schedule", "Job shop scheduling", "European union", "Transport engineering", "Routing (electronic design automation)", "Operations management" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://lirias.kuleuven.be/retrieve/5768c9d3-77e9-492d-88e7-89dedd0c9892" }, { "id": "https://openalex.org/W2045207845", "doi": "10.3141/2440-03", "title": "Network Routing of Snowplow Trucks with Resource Replenishment and Plowing Priorities", "year": 2014, "publication_date": "2014-01-01", "type": "article", "language": "en", "authors": [ "Leila Hajibabai", "Seyed Mohammad Nourbakhsh", "Yanfeng Ouyang", "Fan Peng" ], "first_author": "Leila Hajibabai", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "The routing of snowplow trucks in urban and regional areas encompasses a variety of complex decisions, especially for jurisdictions with heavy snowfall. The main activities involve dispatching a fleet of snowplow trucks from a central depot or satellite facility to clean and spread salt and chemicals on the network links (i.e., snow routes). In this paper, a mixed integer linear program model is proposed to minimize the total operation time of all snowplow trucks needed to complete a given set of snow routes with multiple plowing priorities and to reduce the longest individual truck operation time. Customized construction and local search solution algorithms are developed and used to design snow routes for an empirical application. The computational results show that the proposed solution approach is able to solve the problem effectively and the model result outperforms the current solution in practice. The proposed models and algorithms are also incorporated into the development of a state-of-the-art snowplow routing software that can help planners optimize snow routes and evaluate options for resource allocation.", "keywords": [ "Snow removal", "Truck", "Routing (electronic design automation)", "Snow", "Transport engineering", "Computer science", "Integer programming", "Operations research", "Engineering", "Automotive engineering", "Algorithm", "Computer network" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/2440-03" }, { "id": "https://openalex.org/W4412951311", "doi": "10.1016/j.cie.2025.111423", "title": "Value of operational flexibility in cross-docking", "year": 2025, "publication_date": "2025-08-05", "type": "article", "language": "en", "authors": [ "Maciek Nowak", "Shokuh Puladi" ], "first_author": "Maciek Nowak", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": "We study a truck scheduling problem in a cross-docking system with preemption of truck operations and multiple dock doors operated in mixed service mode. Mixed service and preemption are two operational flexibilities used within cross-docks. Mixed service indicates that dock doors can be used for both unloading and loading operations. Preemption occurs when a truck is moved from a dock in the midst of operations to allow another truck to be served. Both offer gains in efficiency, but many cross-docks operate without consideration of either. We are the first to develop a model that incorporates both, seeking to minimize the makespan of completing all operations. We utilize theoretical insights to decrease the solution space and develop two metaheuristics that take advantage of problem characteristics to more efficiently solve real-world-sized instances. These metaheuristics perform very well relative to an exact solution methodology. They are applied to show that operations require approximately 50% more time without mixed service and 30% more time without preemption.", "keywords": [ "Value (mathematics)", "Computer science", "Mathematics", "Statistics" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2025.111423" }, { "id": "https://openalex.org/W91562683", "doi": null, "title": "Obtaining optimal and approximate solutions to the problem of scheduling inbound and outbound trucks in cross docking operations", "year": 2009, "publication_date": "2009-06-30", "type": "article", "language": "en", "authors": [ "Shahin Nourmohammasi Sharabiani" ], "first_author": "Shahin Nourmohammasi Sharabiani", "venue": null, "publisher": null, "abstract": "The thesis focuses on optimization of inbound and outbound truck scheduling with the\ngoal of minimizing total operation time of cross docking. A model of cross docking is\ndeveloped; two different m ...", "keywords": [ "Truck", "Scheduling (production processes)", "Docking (animal)", "Computer science", "Job shop scheduling", "Mathematical optimization", "Operations research", "Engineering", "Automotive engineering", "Mathematics", "Computer network" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "http://bada.hb.se:80/bitstream/2320/5226/1/Sharabiani.pdf" }, { "id": "https://openalex.org/W2028887461", "doi": "10.1142/s0217595915500165", "title": "Scheduling Trucks in Multi-Door Cross Docking Systems: An Adaptive Genetic Algorithm with a Dispatching Rule", "year": 2014, "publication_date": "2014-11-27", "type": "article", "language": "en", "authors": [ "Byung Soo Kim", "Cheol Min Joo" ], "first_author": "Byung Soo Kim", "venue": "Asia Pacific Journal of Operational Research", "publisher": "World Scientific", "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.", "keywords": [ "Truck", "Doors", "Computer science", "Scheduling (production processes)", "DOCK", "Genetic algorithm", "Job shop scheduling", "Docking (animal)", "Algorithm", "Real-time computing", "Mathematical optimization", "Engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1142/s0217595915500165" }, { "id": "https://openalex.org/W2913883799", "doi": "10.1016/j.cstp.2019.01.009", "title": "Functional and environmental impact analysis of urban deliveries in a Brazilian historical city", "year": 2019, "publication_date": "2019-01-27", "type": "article", "language": "en", "authors": [ "Roberta Alves", "Renato da Silva Lima", "Kaique Silva", "William Araújo Gomes", "Carlos A. González‐Calderón" ], "first_author": "Roberta Alves", "venue": "Case Studies on Transport Policy", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Downtown", "TRIPS architecture", "Business", "Urban planning", "Population", "Sustainable city", "Environmental planning", "Transport engineering", "City logistics", "Compact city", "City centre", "Geography" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cstp.2019.01.009" }, { "id": "https://openalex.org/W2261882415", "doi": "10.3126/jist.v19i1.13825", "title": "A Cross-Docking Framework for Supply Chain Logistics in Production Scheduling", "year": 2015, "publication_date": "2015-11-08", "type": "article", "language": "en", "authors": [ "Hongnian Yu", "Gyan Bahadur Thapa" ], "first_author": "Hongnian Yu", "venue": "Journal of Institute of Science and Technology", "publisher": null, "abstract": "Synchronization of all partners along a supply chain logistics system is one of the challenges in most of the business operations. In this paper, we present a brief literature review of cross-docking approaches for supply chain logistics problem. On describing the problem, we formulate the supply chain logistics problem as a truck sequencing problem to minimize the discrepancies of operation times of inbound and outbound trucks. The problem is decomposed in two sub-problems as inbound and outbound parts as a solution strategy.Journal of Institute of Science and Technology, 2014, 19(1): 39-44", "keywords": [ "Supply chain", "Truck", "Supply chain management", "Scheduling (production processes)", "Operations research", "Computer science", "Job shop scheduling", "Business", "Operations management", "Manufacturing engineering", "Engineering", "Automotive engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.nepjol.info/index.php/JIST/article/download/13825/11203" }, { "id": "https://openalex.org/W4414957519", "doi": "10.1016/j.ejor.2025.10.008", "title": "A hybrid urban delivery system with robots", "year": 2025, "publication_date": "2025-10-08", "type": "article", "language": "en", "authors": [ "Shaohua Yu", "Ann Melissa Campbell", "Jan Fabian Ehmke", "Jakob Puchinger" ], "first_author": "Shaohua Yu", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Robot", "Hybrid system", "Delivery Performance", "Distribution (mathematics)", "Sensitivity (control systems)", "Delivery system" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hal.science/hal-05307302v1/document" }, { "id": "https://openalex.org/W2342478160", "doi": "10.1007/s11590-016-1035-3", "title": "The vehicle routing problem with drones: several worst-case results", "year": 2016, "publication_date": "2016-04-29", "type": "article", "language": "en", "authors": [ "Xingyin Wang", "Stefan Poikonen", "Bruce Golden" ], "first_author": "Xingyin Wang", "venue": "Optimization Letters", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Drone", "Truck", "Computational intelligence", "Routing (electronic design automation)", "Computer science", "Vehicle routing problem", "Duration (music)", "Operations research", "Order (exchange)", "Transport engineering", "Business", "Engineering" ], "cited_by_count": 557, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s11590-016-1035-3" }, { "id": "https://openalex.org/W4289792233", "doi": "10.1016/j.segan.2022.100836", "title": "Utilization of dynamic wireless power transfer technology in multi-depot, multi-product delivery supply chain", "year": 2022, "publication_date": "2022-08-04", "type": "article", "language": "en", "authors": [ "Arman Fathollahi", "Sayed Yaser Derakhshandeh", "Ali Ghiasian", "Mohammad Hassan Khooban" ], "first_author": "Arman Fathollahi", "venue": "Sustainable Energy Grids and Networks", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Depot", "Wireless power transfer", "Supply chain", "Wireless", "Product (mathematics)", "Chain (unit)", "Power (physics)", "Engineering", "Telecommunications", "Business", "Physics", "Marketing" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.segan.2022.100836" }, { "id": "https://openalex.org/W2768569172", "doi": "10.1016/j.trd.2017.11.009", "title": "A cost and CO 2 comparison of using trains and higher capacity trucks when UK FMCG companies collaborate", "year": 2017, "publication_date": "2017-11-24", "type": "article", "language": "en", "authors": [ "Andrew John Palmer", "Philip Mortimer", "Philip Greening", "Maja Izabela Piecyk", "Pratyush Dadhich" ], "first_author": "Andrew John Palmer", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": "Companies working in a collaboration are able to achieve higher vehicle capacity utilisation and reduced empty running, resulting in lower costs and improved sustainability through reduced emissions and congestion. Collaboration produces higher volumes of goods to be moved than individual companies which means that further efficiencies may be possible by relaxing the freight mode constraints and considering rail and higher capacity vehicles. This paper explains how real world data has been used in a model to quantify the economic and environmental benefits in the FMCG sector delivered through collaboration utilising road and rail freight modes. Data for one month was provided by 10 FMCG companies and included freight transport flows between depots and customers, inter depot movements, and supplier collections. Detailed road and rail costs and operating characteristics were obtained and, with the transport flows, applied to a network design model which was used to validate the company data sets. A strategy examining the potential use of alternative higher capacity vehicles and rail for the flows between nine regional consolidation centres showed cost and CO 2 savings. Just under half the inter-regional flows benefited from double deck trailers, longer heavier vehicles for 30% of the flows and rail with different wagon configurations for the rest. In summary there was a 23% reduction in cost with 58% fewer road kilometres and a 46% reduction in CO 2 emissions. The ability to backhaul the same mode of transport between most of the regional centres was one of the strengths of this strategy.", "keywords": [ "Truck", "Train", "Transport engineering", "Sustainability", "Business", "Rail freight transport", "Modal shift", "Kilometer", "Consolidation (business)", "Environmental economics", "Finance", "Automotive engineering" ], "cited_by_count": 30, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2017.11.009" }, { "id": "https://openalex.org/W2785361204", "doi": "10.1109/ieem.2017.8289849", "title": "Comparison of PSO and DE for truck scheduling in multi-door cross docking terminals", "year": 2017, "publication_date": "2017-12-01", "type": "conference-paper", "language": "en", "authors": [ "Warisa Wisittipanich", "Piya Hengmeechai" ], "first_author": "Warisa Wisittipanich", "venue": null, "publisher": null, "abstract": "This paper presents an application of the modified version of Differential Evolution, call 2-Stage DE (2S-DE), for solving the transshipment of multiple product types in a multi-door cross docking system when a storage is allowed to be temporarily hold at the shipping dock. The objective is to find the truck schedule that minimizes the makespan. The performances of the proposed 2S-DE are evaluated and compared with the original DE and the GLNPSO previously published in literature. Using a set of generated instances, the experimental results show that all algorithms are able to find optimal solutions in small-size problems easily. However, when the problem becomes more complex, 2S-DE is superior to the GLNPSO and the original DE since it statistically shows outstanding results in terms of solution quality and convergence behavior.", "keywords": [ "Job shop scheduling", "Transshipment (information security)", "Truck", "Computer science", "Mathematical optimization", "Differential evolution", "Scheduling (production processes)", "Particle swarm optimization", "Schedule", "Algorithm", "Engineering", "Mathematics" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/ieem.2017.8289849" }, { "id": "https://openalex.org/W4389934305", "doi": "10.1109/tevc.2023.3344350", "title": "Locating Drone Stations for a Truck-Drone Delivery System in Continuous Space", "year": 2023, "publication_date": "2023-12-19", "type": "article", "language": "en", "authors": [ "Lingyun Zhou", "Daniel F. Silva", "Alice E. Smith" ], "first_author": "Lingyun Zhou", "venue": "IEEE Transactions on Evolutionary Computation", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "Truck-drone delivery systems have been proposed for sustainable and economical last-mile distribution, especially in urban environments. To widen the service range, some works have recommended adding facilities such as drone stations, considering the problem in discrete space by choosing from a pre-defined set. In this paper, an evolutionary optimization approach to the design decision of where to locate drone stations in the continuous plane is introduced, modeled, and solved. Drone stations serve as facilities for storage, charging, and launching. A truck (or other land transport means) transports parcels to the drone stations from a depot and the drones launch from the stations and deliver the parcels to each customer. The objective is to determine the positions of the drone stations in two-dimensional space and establish the shortest fixed truck route from the depot through all the stations and returning to the depot. The problem is constrained by the radius of service for each drone and all customers must be served, if possible. We formulate the problem as a constrained nonlinear optimization problem and present two versions of an algorithm using particle swarm optimization with a subordinate dynamic program. Computational results show that our approach achieves much better results than a standard commercial nonlinear solver in a similar amount of computational time for both maximizing coverage of customers and minimizing distance of the truck delivery route. A design case study concerning healthcare delivery throughout the Birmingham, Alabama (USA) metropolitan area is provided.", "keywords": [ "Drone", "Truck", "Computer science", "Particle swarm optimization", "Last mile (transportation)", "Solver", "Metropolitan area", "Travelling salesman problem", "Operations research", "Real-time computing", "Transport engineering", "Engineering" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tevc.2023.3344350" }, { "id": "https://openalex.org/W2323509096", "doi": "10.1504/ijal.2015.068894", "title": "Scheduling trucks in fruit cross docks as an open shop problem with edge colouring", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Mohammad Gholami", "Masoud Rabbani", "Mehran Samavati" ], "first_author": "Mohammad Gholami", "venue": "International Journal of Automation and Logistics", "publisher": "Inderscience Publishers", "abstract": "Cross docking is believed to be an efficient approach to control the physical flow of the supply chain. Due to its importance, companies these days feel the necessity of careful planning of the inbound and outbound flows. As a result, they can reach customer satisfaction milestone and also time and cost reduction. In this paper, we study fruit and vegetable cross docks which are different than the other forms of cross docks. In such cross docks, time plays an important role and it must be reduced to the minimum length possible so that we can decrease the cooling and spoilage expenses to a great extent. We modelled the inbound docks as an open shop problem in order to minimise the unloading time of the inbound trucks, then we developed a heuristic solution procedure method based on graph theory to deal with this problem.", "keywords": [ "Truck", "Computer science", "Operations research", "Scheduling (production processes)", "Operations management", "Supply chain", "Business", "Mathematics", "Engineering", "Marketing", "Automotive engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijal.2015.068894" }, { "id": "https://openalex.org/W3015844860", "doi": "10.1016/j.promfg.2020.02.045", "title": "Managing loading and discharging operations at cross-docking terminals", "year": 2020, "publication_date": "2020-01-01", "type": "article", "language": "en", "authors": [ "Maria Flavia Monaco", "Marcello Sammarra" ], "first_author": "Maria Flavia Monaco", "venue": "Procedia Manufacturing", "publisher": "Elsevier BV", "abstract": "A cross-docking terminal is a relevant node within a distribution chain. Actually, at this intermediate logistic platform between suppliers and retailers, incoming flows of possible different commodities are consolidated into single shipments, with respect to the retailers\\x92 orders, and directly delivered, skipping thus the storage phase. In such a context the synchronization of the inbound and outbound trucks is a necessary condition to guarantee fast and congestion-free transshipment operations. In this paper we propose a Mixed Integer Linear Program and a heuristic algorithm for managing the loading and discharging operations, with the aim of minimizing the completion time of the whole transshipment process.", "keywords": [ "Transshipment (information security)", "Truck", "Computer science", "Operations research", "Engineering", "Automotive engineering" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2351978920306016/pdf" }, { "id": "https://openalex.org/W4408493979", "doi": "10.1016/j.trc.2025.105082", "title": "Integrating battery-related decisions into truck-drone tandem delivery problem with limited battery resources", "year": 2025, "publication_date": "2025-03-16", "type": "article", "language": "en", "authors": [ "Zhongshan Liu", "Bin Yu", "Tingting Chen", "Li Zhang" ], "first_author": "Zhongshan Liu", "venue": "Transportation Research Part C Emerging Technologies", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Battery (electricity)", "Tandem", "Drone", "Engineering", "Transport engineering", "Computer science", "Automotive engineering", "Operations research", "Aeronautics", "Aerospace engineering", "Biology" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trc.2025.105082" }, { "id": "https://openalex.org/W4382051103", "doi": "10.1016/j.cie.2023.109404", "title": "Fuzzy multi-objective truck scheduling in multi-modal rail–road Physical Internet hubs", "year": 2023, "publication_date": "2023-06-26", "type": "article", "language": "en", "authors": [ "Fatma Essghaier", "Tarik Chargui", "Tienté Hsu", "Abdelghani Bekrar", "Hamid Allaoui", "Damien Trentesaux", "Gilles Gonçalves" ], "first_author": "Fatma Essghaier", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Computer science", "Operations research", "Supply chain", "Modal", "Fuzzy logic", "The Internet", "Scheduling (production processes)", "Integer programming", "Mathematical optimization", "Engineering", "Business" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2023.109404" }, { "id": "https://openalex.org/W2090032764", "doi": "10.1109/icsmc.2012.6377822", "title": "Application of NSGA-II with local search to multi-dock cross-docking sheduling problem", "year": 2012, "publication_date": "2012-10-01", "type": "conference-paper", "language": "en", "authors": [ "Yu Hui Guo", "Zhou-Rong Chen", "Yong-Liu Ruan", "Jun Zhang" ], "first_author": "Yu Hui Guo", "venue": null, "publisher": null, "abstract": "Cross-docking is now widely applied to trucking industry, for which the optimal schedule of the trucks is a crucial issue. In the cross-docking scheduling problem, the objectives of minimizing the operation cost and maximizing the possibility of punctuality are both important. In this paper, a non-dominated sorting genetic algorithm version II (NSGA-II) with a novel greedy local search strategy is proposed to solve the multi-objective optimization problem. NSGA-II can provide decision makers with flexible choices among the different trade-off solutions, while the local-search strategy is employed to accelerate the convergence speed. In the experiments, four criteria are applied to evaluate the strengths of the proposed algorithm. Experimental results on both small and large size of problems show the accuracy and efficiency of the propose strategy.", "keywords": [ "Mathematical optimization", "Punctuality", "Computer science", "Greedy algorithm", "Local search (optimization)", "Scheduling (production processes)", "Sorting", "Genetic algorithm", "Schedule", "Engineering", "Algorithm", "Machine learning" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/icsmc.2012.6377822" }, { "id": "https://openalex.org/W2149318535", "doi": "10.3141/2386-12", "title": "Developing Truck Corridor Crash Severity Index", "year": 2013, "publication_date": "2013-01-01", "type": "article", "language": "en", "authors": [ "Xiao Dong Qin", "Most Afia Sultana", "Madhav Chitturi", "David A. Noyce" ], "first_author": "Xiao Dong Qin", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "According to NHTSA, more than 400,000 truck accidents occurred in 2009 and approximately 7,800 of those were fatal crashes. Compared with extensive studies conducted on freeway truck safety, the research on arterial streets is considerably disproportionate. Making the connections between truck traffic generators, arterial streets are key links in door-to-door deliveries. There is an urgent need to study truck safety on arterial streets because of the strong growth of truck traffic. Truck-related crashes are expected to be reduced through careful planning of the location, design, and operation of driveways, median openings, street connections, and street sections. Through the collection of extensive data on selected arterial corridors that are heavily used by trucks, contributing factors to truck crash frequency and severity were identified with a negative binomial model and multinomial logit model. Corridor truck miles traveled, annual average daily traffic, signal density, shoulder width, and pavement serviceability index and its standard deviation are significant factors for crash frequency prediction. The multinomial logit model identified 12 causal factors for crash severity, such as posted speed limit, lane width, number of lanes, pavement condition index, and undivided roadway portion. Subsequently, a crash severity index for truck arterial corridors was developed. The findings from the study not only will benefit state and local agencies in planning, design, and management of a safer truck arterial corridor, but will also help carriers to optimize their routes from a safety perspective.", "keywords": [ "Truck", "Crash", "Transport engineering", "Index (typography)", "Multinomial logistic regression", "Serviceability (structure)", "SAFER", "Poison control", "Engineering", "Computer science", "Statistics", "Civil engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/2386-12" }, { "id": "https://openalex.org/W7131618109", "doi": "10.59188/eduvest.v6i2.52807", "title": "Assessing the Challenges and Benefits of Electric Truck Adoption in Truck Logistics: A Case Study of Truck Logistics Companies in Indonesia", "year": 2026, "publication_date": "2026-02-26", "type": "article", "language": null, "authors": [ "Otari Akenzi" ], "first_author": "Otari Akenzi", "venue": "Eduvest - Journal Of Universal Studies", "publisher": null, "abstract": "This study examines the challenges and benefits of electric truck adoption in Indonesia’s truck logistics sector through a case study of PT Seino Indomobil Logistics. Employing a qualitative research approach, data were collected through semi-structured interviews with senior management, including the Chief Operating Officer, Chief Financial Officer, Head of Field Operations, and Head of Vehicle Management. The analysis utilized the Technology-Organization-Environment (TOE) framework, complemented by PESTEL and SWOT analyses, to provide a comprehensive understanding of adoption dynamics. The findings reveal that electric trucks offer substantial benefits, including reduced operational costs through lower fuel and maintenance expenses, enhanced environmental sustainability, improved customer value for ESG-committed clients, and greater operational predictability. However, adoption is constrained by critical challenges: limited charging infrastructure, high upfront capital costs, operational complexity in fleet integration, technical uncertainties regarding battery lifecycle, and an unsupportive policy environment characterized by diesel fuel subsidies and minimal incentives for electric vehicles. The study demonstrates that successful adoption requires strategic alignment across technological readiness, organizational capabilities, and external environmental conditions. Recommendations include implementing phased pilot projects on suitable routes, developing depot-based charging infrastructure, positioning electric trucks as customer-specific green logistics offerings, employing rigorous total cost of ownership analysis, building organizational capabilities through training, and engaging in policy advocacy. This research contributes actionable insights for logistics companies, policymakers, and industry stakeholders navigating the transition toward sustainable freight transportation in emerging markets.", "keywords": [ "Truck", "SWOT analysis", "Incentive", "Subsidy", "Fleet management", "Sustainable transport", "Electric vehicle", "Sustainability", "Humanitarian Logistics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.59188/eduvest.v6i2.52807" }, { "id": "https://openalex.org/W4407404687", "doi": "10.3390/wevj16020096", "title": "Electric Long-Haul Trucks and High-Power Charging: Modelling and Analysis of the Required Infrastructure in Germany", "year": 2025, "publication_date": "2025-02-12", "type": "article", "language": "en", "authors": [ "Tobias Tietz", "Tu-Anh Fay", "Tilmann Schlenther", "Dietmar Göhlich" ], "first_author": "Tobias Tietz", "venue": "World Electric Vehicle Journal", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Heavy goods transportation is responsible for around 27% of CO2 emissions from road transport in the EU and for 5% of total CO2 emissions in the EU. The decarbonization of long-distance transport in particular remains a major challenge. The combination of battery electric trucks (BETs) with on-route high-power charging (HPC) offers a promising solution. Planning and setting up the required infrastructure is a critical success factor here. We propose a methodology to evaluate the charging infrastructure needed to support the large-scale introduction of heavy-duty BETs in Germany, considering different levels of electrification, taking the European driving and rest time regulations into account. Our analysis employs MATSim, an activity-based multi-agent transport simulation, to assess potential bottlenecks in the charging infrastructure and to simulate the demand-based distribution of charging stations. The MATSim simulation is combined with an extensive pre-processing of transport-related data and a suitable post-processing. This approach allows for a detailed examination of the required charging infrastructure, considering the impacts of depot charging solutions and the dynamic nature of truck movements and charging needs. The results indicate a significant need to augment HPC with substantial low power overnight charging facilities and highlight the importance of strategic infrastructure development to accommodate the growing demand for chargers for BETs. By simulating various scenarios of electrification, we demonstrate the critical role of demand-oriented infrastructure planning in reducing emissions from the road freight sector until 2030. This study contributes to the ongoing discourse on sustainable transportation, offering insights into the infrastructure requirements and planning challenges associated with the transition to battery electric heavy-duty vehicles.", "keywords": [ "Truck", "Automotive engineering", "Environmental science", "Business", "Engineering" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2032-6653/16/2/96/pdf?version=1739340942" }, { "id": "https://openalex.org/W2739497777", "doi": "10.1108/mabr-10-2016-0030", "title": "An inland-depots-for-empty-containers-model for the hinterland", "year": 2017, "publication_date": "2017-06-15", "type": "article", "language": "en", "authors": [ "Stephanie Finke", "Herbert W. Kotzab" ], "first_author": "Stephanie Finke", "venue": "Maritime Business Review", "publisher": "Emerald Publishing Limited", "abstract": "Purpose The purpose of this paper is to figure out in which way a hinterland-based inland depot model can help a shipping company in solving the empty container problem at a regional level. The repositioning of empty containers is a very expensive operation that does not generate profits. Consequently, it is very important to provide an efficient empty container management. Design/methodology/approach In this paper, the empty container problem is discussed at a regional repositioning level. For solving this problem, a mixed-integer linear optimization model is developed and validated by using the German hinterland as a case. Findings The findings show that the hinterland-based solution is able to reduce the total system costs by 40 per cent. In addition, total of truck kilometres could be reduced by more than 30 per cent too. Research limitations/implications This research is based on German data only. Originality/value This paper closes the gap in empty container repositioning research by looking at the hinterland dimension from a single shipping company point of view.", "keywords": [ "Container (type theory)", "Truck", "German", "Dimension (graph theory)", "Originality", "Operations research", "Computer science", "Value (mathematics)", "Business", "Point (geometry)", "Operations management", "Transport engineering" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.emerald.com/insight/content/doi/10.1108/MABR-10-2016-0030/full/pdf?title=an-inland-depots-for-empty-containers-model-for-the-hinterland" }, { "id": "https://openalex.org/W3196019228", "doi": "10.14569/ijacsa.2021.0120715", "title": "Truck Scheduling Model in the Cross-docking Terminal by using Multi-agent System and Shortest Remaining Time Algorithm", "year": 2021, "publication_date": "2021-01-01", "type": "article", "language": "en", "authors": [ "Purba Daru Kusuma" ], "first_author": "Purba Daru Kusuma", "venue": "International Journal of Advanced Computer Science and Applications", "publisher": "Science and Information Organization", "abstract": "One most important and critical problem in a cross-docking system is truck scheduling. Many studies in it assumed that the temporary storage is unlimited which is in the real world, the temporary storage is limited. Many studies focus on minimizing total completion time. Meanwhile, studies that focus on minimizing temporary storage are hard to find, although this aspect is very important. Due to its complexity, especially in the cross-docking system with multiproduct characteristics, manual scheduling is almost impossible to achieve its goals. Many studies used several techniques, such as genetic algorithm (GA) and mixed integer programming where these methods are computationally expensive. Based on this problem, in this work, we propose new truck scheduling model in a cross-docking terminal with limited temporary storage constraint. This model is developed by using multi-agent system. The main contribution of this work is proposing the multi-agent-based truck scheduling model with limited temporary storage capacity constraint and temporary truck changeover permit. In it, there are three agents: inbound-trucks scheduler agent, outbound-trucks scheduler agent, and material handler agent. The shortest remaining time (SRT) algorithm is adopted in every agent. Based on the simulation result, this proposed model is proven competitive compared with the existing FIFO based models and integer-programming based model. Compared with the integer-programming model, it creates 41.8 percent lower in maximum inventory level. Compared with the FIFO based model, it creates 52.1 to 55.1 percent lower in maximum inventory level. In total time aspect, it creates 0.2 to 2.2 percent lower than the FIFO based model. It creates 7.2 percent higher in total time compared with the integer-programming based model.", "keywords": [ "Computer science", "Truck", "Scheduling (production processes)", "Integer programming", "Job shop scheduling", "Mathematical optimization", "Distributed computing", "Algorithm", "Schedule", "Operating system" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "http://thesai.org/Downloads/Volume12No7/Paper_15-Truck_Scheduling_Model_in_the_Cross_docking_Terminal.pdf" }, { "id": "https://openalex.org/W4403670380", "doi": "10.1016/j.trb.2024.103101", "title": "The multi-visit drone-assisted routing problem with soft time windows and stochastic truck travel times", "year": 2024, "publication_date": "2024-10-23", "type": "article", "language": "en", "authors": [ "Shanshan Meng", "Dong Li", "Jiyin Liu", "Yanru Chen" ], "first_author": "Shanshan Meng", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Drone", "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Transport engineering", "Operations research", "Simulation", "Engineering", "Automotive engineering", "Computer network" ], "cited_by_count": 27, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trb.2024.103101" }, { "id": "https://openalex.org/W4414712791", "doi": "10.1016/j.eswa.2025.129849", "title": "Truck scheduling optimization at a cold chain cross-docking terminal considering uncertainties and the door-mixed service mode", "year": 2025, "publication_date": "2025-10-01", "type": "article", "language": "en", "authors": [ "Feifeng Zheng", "Yuzhi Yi", "Ming Liu", "Huaxin Qiu" ], "first_author": "Feifeng Zheng", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Cold chain", "Truck", "Scheduling (production processes)", "Cluster analysis", "Genetic algorithm", "Sensitivity (control systems)", "Stochastic programming", "Job shop scheduling" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2025.129849" }, { "id": "https://openalex.org/W2090420739", "doi": "10.1109/sieds.2010.5469678", "title": "Modeling cross-dock networks with time constraints using simulation", "year": 2010, "publication_date": "2010-04-01", "type": "conference-paper", "language": "en", "authors": [ "Elkin Rodriguez-Velasquez", "Georges M. Arnaout", "Ghaith Rabadi", "Rami Musa" ], "first_author": "Elkin Rodriguez-Velasquez", "venue": null, "publisher": null, "abstract": "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.", "keywords": [ "Truck", "DOCK", "Computer science", "Service (business)", "Operations research", "Distributed computing", "Computer network", "Mathematical optimization", "Engineering" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/sieds.2010.5469678" }, { "id": "https://openalex.org/W4410313758", "doi": "10.1016/j.enconman.2025.119916", "title": "Conversion of an existing diesel depot into an on-site hydrogen refuelling station for heavy-duty vehicles: A multi-objective optimisation", "year": 2025, "publication_date": "2025-05-13", "type": "article", "language": "en", "authors": [ "Antonio Sgaramella", "Lorenzo Mario Pastore", "Gianluigi Lo Basso", "Livio de Santoli" ], "first_author": "Antonio Sgaramella", "venue": "Energy Conversion and Management", "publisher": "Elsevier BV", "abstract": "Transport is one of the energy segments belonging to the so-called hard-to-abate sectors. Despite several EU directives promote its decarbonisation, heavy-duty mobility still shows increasing emissions, due to the continuous raise in road freight activity and reliance on low-efficiency internal combustion engines powered by fossil fuels. Hydrogen fuel cell electric trucks represent one of the most valuable solutions for the long-haul transport segment greening. However, the current lack of economy of scale and paucity of refuelling infrastructure represent a significant hint to the widespread deployment of hydrogen mobility. This paper presents a design methodology for converting a diesel depot into an on-site green hydrogen refuelling station dedicated to fuel cell electric trucks. To do so, 150 eligible capacities of photovoltaic plant, electrolyser and low-pressure storage system have been dynamically simulated in the MATLAB/Simulink environment. Thereafter, by means of a multi-objective optimization, based on Pareto Front and Utopia Point, the optimal solutions have been identified. By maximising the hydrogen production and simultaneously minimising the levelized cost of hydrogen, solar energy excess and compressor energy utilisation the components size can be determined. The main outcomes of this study show that the most suitable electrolyser/photovoltaic plant capacity ratio is 44.1%. By comparing on-site with off-site hydrogen refuelling stations, the hydrogen production, distribution and transmission cost equal to 7.70 €/kg is the break-even point between the two stations typologies. Converting diesel pumps into hydrogen refuelling stations can reduce capital expenditure by 30–50% compared to greenfield hydrogen stations.", "keywords": [ "Depot", "Waste management", "Heavy duty", "Diesel fuel", "Engineering", "Environmental science", "Automotive engineering", "Geography" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.enconman.2025.119916" }, { "id": "https://openalex.org/W2905862327", "doi": "10.15480/882.1484", "title": "Reducing truck congestion at ports – classification and trends", "year": 2017, "publication_date": "2017-10-01", "type": "conference-paper", "language": "en", "authors": [ "Ann-Kathrin Lange", "Anne Schwientek", "Carlos Jahn" ], "first_author": "Ann-Kathrin Lange", "venue": "Econstor (Econstor)", "publisher": null, "abstract": "Truck drayage in container ports faces several challenges. Due to the ongoing growth of container ship sizes, there are increasingly high peak situations in landside container handling at logistic nodes in the port, e.g. container terminals, empty depots, freight stations. In combination with rising demands to improve the port’s ecological footprint this requires the port and its companies to adapt to the situation in order to reduce congestion. To identify important methods, key parameters, past developments and future trends a classification scheme based on an extensive literature survey on waiting times at terminals and drayage operations is conducted and applied to 71 publications. The analyzed methods to reduce congestion in the port range from optimizing the infrastructure to controlling truck arrival times. While this problem is mainly analyzed from a container terminal perspective, its impacts also affect other stakeholders in the port as trucking companies, empty depots or freight stations. Past literature surveys mainly focus on either one method or one stakeholder. This led to limited assessments for the whole drayage networks in ports. Therefore, the developed classification scheme is a basis to identify promising further research areas while enabling a more holistic approach.", "keywords": [ "Container (type theory)", "Port (circuit theory)", "Truck", "Transport engineering", "Computer science", "Order (exchange)", "Operations research", "Footprint", "Business", "Engineering", "Geography", "Finance" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10419/209325" }, { "id": "https://openalex.org/W2915502992", "doi": "10.20944/preprints201902.0183.v1", "title": "Two-Echelon Routing Problem for Parcel Delivery by Cooperated Truck and Drone", "year": 2019, "publication_date": "2019-02-19", "type": "preprint", "language": "en", "authors": [ "Yao Liu", "Jianmai Shi", "Guohua Wu", "Zhong Liu", "Witold Pedrycz" ], "first_author": "Yao Liu", "venue": "Preprints.org", "publisher": null, "abstract": "A new variant of two-echelon routing problem is investigated, where the truck and the drone are used to cooperatively complete the deliveries of all parcels. The truck not only acts as a tool for parcel delivery, but also serves as a moving depot for the drone. The drone can carry several parcels and take off from the truck, while returning to the truck after completing the delivery. The energy consumption model for the routing process of the drone is analyzed, when it is utilized to deliver multiple parcels. A two-stage route-based modelling approach is proposed to optimize both the truck’s main route and the drone’s adjoint flying routes. A hybrid heuristic integrating nearest neighbor and cost saving strategies is developed to quickly construct a feasible solution. The simulated annealing algorithm is applied to improve the quality of the solution, where a Tabu list is employed to improve the search efficiency. Random instances at different scales are used to test the performance of the proposed algorithm. A case study based on the practical road network in Changsha, China, is presented, through which the sensitivity analysis is conducted with respect to some critical factors.", "keywords": [ "Drone", "Truck", "Simulated annealing", "Routing (electronic design automation)", "Tabu search", "Computer science", "Vehicle routing problem", "Heuristic", "Process (computing)", "Operations research", "Transport engineering", "Engineering" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.preprints.org/manuscript/201902.0183/v1/download" }, { "id": "https://openalex.org/W1964317936", "doi": "10.1016/j.ejor.2014.01.005", "title": "A survey of recent research on location-routing problems", "year": 2014, "publication_date": "2014-01-18", "type": "article", "language": "en", "authors": [ "Caroline Prodhon", "Christian Prins" ], "first_author": "Caroline Prodhon", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Operations research", "Vehicle routing problem", "Truck", "Computer science", "Facility location problem", "Interdependence", "Routing (electronic design automation)", "Trailer", "Total cost", "Set (abstract data type)", "Metaheuristic", "Fixed cost" ], "cited_by_count": 678, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2014.01.005" }, { "id": "https://openalex.org/W183918860", "doi": null, "title": "Maximizing Throughput and Minimizing Tardiness and Earliness at a Cross Dock Facility: Biobjective Formulation", "year": 2010, "publication_date": "2010-01-01", "type": "conference-paper", "language": "en", "authors": [ "Mihalis Golias", "Stephanie S. Ivey", "Hercules E. Haralambides", "Georgios K. D. Saharidis" ], "first_author": "Mihalis Golias", "venue": "EUR Research Repository (Erasmus University Rotterdam)", "publisher": "Erasmus University Rotterdam", "abstract": "In this paper we deal with the scheduling of inbound and outbound trucks (ITs and OTs) to the available inbound and outbound doors at a cross dock facility. We assume that an OT cannot start service until all the ITs carrying cargo destined for that OT have finished unloading. We further assume that both the ITs and OTs need to meet several deadlines for deliveries and pick-ups and thus request a departure time window from the facility, penalizing the facility operator if that deadline is not met. Assuming that departure deadlines are in the form of a time window is more realistic than to assume deadlines as a point in time. Furthermore, penalization of both early and tardy departures is compatible with the just-in-time (JIT) philosophy, where both service types should be discouraged. The truck scheduling policy presented in this paper has two objectives: a) maximization of the facility’s total throughput, measured as the total service time for all trucks served at the facility, and b) minimization of costs incurred by the cross dock facility operator from early and tardy departures of trucks at both the inbound and outbound doors. To solve the resulting problem with reasonable computational effort, an evolutionary based heuristic is proposed and a number of computational examples are presented to evaluate the efficiency of the proposed resolution algorithm.", "keywords": [ "Tardiness", "Truck", "Doors", "Computer science", "Scheduling (production processes)", "DOCK", "Minification", "Window (computing)", "Operations research", "Maximization", "Service (business)", "Throughput" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://pure.eur.nl/en/publications/fe518257-313a-4299-964f-a87cc657081b" }, { "id": "https://openalex.org/W3024787865", "doi": "10.1002/9781119574293.ch6", "title": "An Efficient Modified Red Deer Algorithm to Solve a Truck Scheduling Problem Considering Time Windows and Deadline for Trucks' Departure", "year": 2020, "publication_date": "2020-04-17", "type": "other", "language": "en", "authors": [ "Amir M. Fathollahi‐Fard", "Abbas Ahmadi", "Mohsen S. Sajadieh" ], "first_author": "Amir M. Fathollahi‐Fard", "venue": null, "publisher": null, "abstract": "The truck scheduling for cross-docking systems is one of primary, challenging and important types of scheduling which can substantially reduce distribution costs and improve customer satisfaction. This study to get closer to real-world suppositions not only considers the time window limitations but also for every shipping truck, the products are divided into two groups, namely, perishable and imperishable products. Another novelty of the proposed problem is to consider a deadline assumed for shipping the trucks due to the presence of perishable products for the first time in this research area. Based on these challenges, a new mathematical model is developed. The last but not the least is to propose a new modification for the one of recently-developed evolutionary algorithms called Red Deer Algorithm (RDA) to better solve the proposed problem. Although the literature of truck scheduling is very rich in applying recent metaheuristics, this is the first attempt to develop an efficient modified RDA in this research area. Finally, a comparative study based on different numerical examples shows the performance of the proposed evolutionary algorithm compared with other classical and well-known algorithms.", "keywords": [ "Truck", "Computer science", "Metaheuristic", "Vehicle routing problem", "Scheduling (production processes)", "Novelty", "Mathematical optimization", "Algorithm", "Operations research", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/9781119574293.ch6" }, { "id": "https://openalex.org/W3129247893", "doi": "10.1016/j.omega.2021.102431", "title": "Internal resource requirements: The better performance metric for truck scheduling?", "year": 2021, "publication_date": "2021-02-21", "type": "article", "language": "en", "authors": [ "Pascal Wolff", "Simon Emde", "Hans‐Christian Pfohl" ], "first_author": "Pascal Wolff", "venue": "Omega", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Computer science", "Scheduling (production processes)", "Schedule", "Integer programming", "Job shop scheduling", "Column generation", "Performance metric", "Heuristic", "Operations research", "Mathematical optimization", "Engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.omega.2021.102431" }, { "id": "https://openalex.org/W2998391831", "doi": "10.1016/j.ijpe.2019.107598", "title": "Two echelon vehicle routing problem with drones in last mile delivery", "year": 2019, "publication_date": "2019-12-27", "type": "article", "language": "en", "authors": [ "Patchara Kitjacharoenchai", "Byung‐Cheol Min", "Seokcheon Lee" ], "first_author": "Patchara Kitjacharoenchai", "venue": "International Journal of Production Economics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Truck", "Computer science", "Heuristics", "Routing (electronic design automation)", "Vehicle routing problem", "Swap (finance)", "Scheduling (production processes)", "Integer programming", "Operations research", "Mathematical optimization", "Computer network" ], "cited_by_count": 333, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ijpe.2019.107598" }, { "id": "https://openalex.org/W4401114230", "doi": "10.1109/ecai61503.2024.10607540", "title": "A Cost-Effective Corona-Virus Search Optimization Based Approach to Joint Expansion Planning of Distribution Networks with Heavy-Duty Electric Truck Dedicated Urban Charging Stations", "year": 2024, "publication_date": "2024-06-27", "type": "conference-paper", "language": "en", "authors": [ "Hossein Shayeghi", "Peyman Zare", "Iraj Faraji Davoudkhani", "Nicu Bizon", "Adam Figiel", "Antoni Jacek Szumny" ], "first_author": "Hossein Shayeghi", "venue": null, "publisher": null, "abstract": "The increasing demand for operational efficiency and redundancy in electric distribution networks necessitates continuous advancements in power distribution network expansion planning methodologies. Traditional approaches are no longer sufficient due to the integration of distributed generation resources, capacitor banks, and the proliferation of heavy-duty electric trucks. This paper presents a novel approach that integrates dedicated heavy-duty electric truck urban charging stations into modern electric distribution networks. The proposed framework employs joint expansion planning for both electric distribution networks and dedicated heavy-duty electric truck urban charging stations, encompassing constructed elements such as substation construction, circuit reinforcement, distributed generation allocation, and capacitor bank installation. To address computational complexities, the study leverages a novel metaheuristic algorithm called corona-virus search optimization, inspired by the dynamics of the COVID-19 virus. The model’s efficiency and scalability are demonstrated through evaluations using an 18 -bus and a 54 -bus system. The analysis reveals that depot charging of HDETs presents a more challenging scenario with higher costs. However, integrating dedicated heavy-duty electric truck urban charging stations in Scenario II leads to significant cost reductions $(4.34 \\%$ and $7.56 \\%$ for two systems). The model’s adaptability make it a valuable solution for integrating modern multi-energy electric distribution networks with dedicated charging urban infrastructure.", "keywords": [ "Truck", "Heavy duty", "Joint (building)", "Computer science", "Automotive engineering", "Transport engineering", "Engineering", "Civil engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/ecai61503.2024.10607540" }, { "id": "https://openalex.org/W4281708316", "doi": "10.1007/s10479-022-04747-8", "title": "Hybrid partheno-genetic algorithm for multi-depot perishable food delivery problem with mixed time windows", "year": 2022, "publication_date": "2022-05-30", "type": "article", "language": "en", "authors": [ "Na Li", "Guo Li" ], "first_author": "Na Li", "venue": "Annals of Operations Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Computer science", "Vehicle routing problem", "Genetic algorithm", "Sorting", "Mathematical optimization", "Crossover", "Initialization", "Customer satisfaction", "Population", "Hybrid algorithm (constraint satisfaction)", "Operations research", "Cluster analysis" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10479-022-04747-8" }, { "id": "https://openalex.org/W2725075910", "doi": "10.1007/978-3-319-57105-8_21", "title": "A Multi-depot Periodic Vehicle Routing Model for Petrol Station Replenishment", "year": 2017, "publication_date": "2017-07-04", "type": "conference-paper", "language": "en", "authors": [ "Pasquale Carotenuto", "Stefano Giordani", "Simone Massari", "Fabrizio Vagaggini" ], "first_author": "Pasquale Carotenuto", "venue": "Advances in intelligent systems and computing", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Truck", "Context (archaeology)", "Gasoline", "Vehicle routing problem", "Computer science", "Genetic algorithm", "Set (abstract data type)", "Routing (electronic design automation)", "Time horizon", "Operations research", "Mathematical optimization", "Automotive engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-57105-8_21" }, { "id": "https://openalex.org/W2316166222", "doi": "10.7763/ijmo.2011.v1.63", "title": "Petrol Delivery Assignment with Multi-Product, Multi-Depot, Split Deliveries and Time Windows", "year": 2011, "publication_date": "2011-01-01", "type": "article", "language": "en", "authors": [ "Isti Surjandari", "Amar Rachman", "Fauzia Dianawati", "R. Pramono Wibowo" ], "first_author": "Isti Surjandari", "venue": "International Journal of Modeling and Optimization", "publisher": null, "abstract": "The purpose of this study is to solve a planning problem faced by Pertamina, a state-owned Oil and Gas company in Indonesia, dealing with the delivery of petrol products. Based on Petrol Station Replenishment Problem (PSRP), a fleet of tank-trucks with different capacities has been assigned to deliver two petrol products from two depots with split deliveries and time windows to a set of petrol stations in the working area. The Tabu Search (TS) algorithm has been used to solve this problem. The problem consists of jointly determining the fleet assignment and of designing delivery routes to petrol stations to satisfy the orders using the available resources with the minimum total travel cost for delivery.", "keywords": [ "Depot", "Computer science", "Product (mathematics)", "Mathematics" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.7763/ijmo.2011.v1.63" }, { "id": "https://openalex.org/W4288443358", "doi": "10.3390/a15080265", "title": "Modelling Cross-Docking in a Three-Level Supply Chain with Stochastic Service and Queuing System: MOWFA Algorithm", "year": 2022, "publication_date": "2022-07-28", "type": "article", "language": "en", "authors": [ "Parinaz Rostami", "Soroush Avakh Darestani", "Mitra Movassaghi" ], "first_author": "Parinaz Rostami", "venue": "Algorithms", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "In today’s competitive world, it is essential to provide a new method through which maximum efficiency can be created in the production and supply cycle. In many production environments, sending goods directly from the producer to the consumer brings many problems. Therefore, an efficient transport system should be established between producers and consumers. Such a system is designed in the field of supply chain management knowledge. Supply chain management is the evolutionary result of warehousing management and is one of the important infrastructural foundations of business implementation, in many of which the main effort is to shorten the time between the customer’s order and the actual delivery of the goods. In this research, the supply chain consists of three levels. Suppliers are placed on the first level, cross-docks on the second level, and factories on the third level. In this system, a number of suppliers send different raw materials to several different cross-docks. Each channel is assigned to a cross-dock for a specific product. The main goal of this article is to focus on optimizing the planning of incoming and outgoing trucks with the aim of minimizing the total operation time within the supply chain. The arrival rate of goods from suppliers to the cross-dock is stochastic with a general probability distribution. On the other hand, the time required to prepare and send the goods is random with a general probability distribution. The service time in each cross-dock depends on the number of its doors. Therefore, each cross-dock can be modeled as a G/G/m queueing system where m represents the number of doors. The mathematical model of the research has been developed based on these assumptions. Since the problem is NP-hard, the time to solve it increases drastically with the increase in the dimensions of the problem. Therefore, three metaheuristics, including multi-objective water flow, non-dominated sorting genetic, and a multi-objective simulated annealing algorithm have been used to find near-optimal solutions to the problem. After adjusting the parameters of the algorithms using the Taguchi method, the results obtained from the algorithms were analyzed with a statistical test and the performance of the algorithms was evaluated. The results vividly demonstrate that non-dominated sorting genetics is the best of all.", "keywords": [ "Supply chain", "Computer science", "Supply chain management", "Truck", "Operations research", "Service (business)", "Service level", "Production (economics)", "Product (mathematics)", "Order fulfillment", "Service management", "Fast fashion" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/1999-4893/15/8/265/pdf?version=1660117476" }, { "id": "https://openalex.org/W2018808459", "doi": "10.7232/jkiie.2011.37.3.248", "title": "A Genetic Algorithm for Scheduling of Trucks with Inbound and Outbound Process in Multi-Door Cross Docking Terminals", "year": 2011, "publication_date": "2011-09-01", "type": "article", "language": "en", "authors": [ "Cheol-Min Joo", "Byung-Soo Kim" ], "first_author": "Cheol-Min Joo", "venue": "Journal of Korean Institute of Industrial Engineers", "publisher": null, "abstract": "Cross docking is a logistics management concept in which items delivered to a terminal by inbound trucks are immediately sorted out, routed and loaded into outbound trucks for delivery to customers. Two main advantages by introducing a cross docking terminal are to consolidate multiple smaller shipment into full truck load and remove storage and order picking processes to save up logistics costs related to warehousing and transportation costs. This research considers the scheduling problem of trucks in the cross docking terminals with multi-door in an inbound and outbound dock, respectively. The trucks sequentially deal with the storage process at the one of inbound doors and the shipping process at the one of the outbound doors. A mathematical model for an optimal solution is derived, and genetic algorithms with two different chromosome representations are proposed. To verify performance of the GA algorithms, we compare the solutions of GAs with the optimal solutions and the best solution using randomly generated several examples.", "keywords": [ "Truck", "Computer science", "Docking (animal)", "Scheduling (production processes)", "Algorithm", "Engineering", "Mathematical optimization", "Mathematics", "Automotive engineering", "Medicine" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.7232/jkiie.2011.37.3.248" }, { "id": "https://openalex.org/W2914081600", "doi": "10.1109/poms.2018.8629444", "title": "A novel framework and effective scheduling of cross-docking center for multi-objective truck Scheduling Problem", "year": 2018, "publication_date": "2018-12-01", "type": "conference-paper", "language": "en", "authors": [ "Vijaya Kumar Manupati", "Siddharth Madan", "Somnath Lahiri", "Jayakrishna Kandasamy" ], "first_author": "Vijaya Kumar Manupati", "venue": null, "publisher": null, "abstract": "Cross-docking is a technique used for scheduling the vehicles in distribution centers more effectively. Cross-Docking Centre (CDC) acts as a temporary distribution center that undergoes three important functions i.e., the goods from inbound trucks are continuously sorted, consolidated and then loaded onto outbound trucks for delivery to the customers. In this paper, an effective Cross-docking framework by considering the different performance measures in inbound and outbound doors has been developed. Subsequently, a multi-objective linear programming model has been developed for optimizing the objectives i.e., minimization of earliness and tardiness for the outbound trucks in a stochastic environment. Moreover, with FLEXSIM based simulation approach the analysis has been conducted and the effectiveness of the proposed framework. Finally, the results are evaluated and validated.", "keywords": [ "Tardiness", "Truck", "Doors", "Computer science", "Scheduling (production processes)", "Docking (animal)", "Distribution center", "Job shop scheduling", "Minification", "Linear programming", "Simulation", "Mathematical optimization" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/poms.2018.8629444" }, { "id": "https://openalex.org/W3044927044", "doi": "10.3390/info11080377", "title": "Model for Collaboration among Carriers to Reduce Empty Container Truck Trips", "year": 2020, "publication_date": "2020-07-26", "type": "article", "language": "en", "authors": [ "Majbah Uddin", "Nathan N. Huynh" ], "first_author": "Majbah Uddin", "venue": "Information", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "In recent years, intermodal transport has become an increasingly attractive alternative to freight shippers. However, the current intermodal freight transport is not as efficient as it could be. Oftentimes an empty container needs to be transported from the empty container depot to the shipper, and conversely, an empty container needs to be transported from the receiver to the empty container depot. These empty container movements decrease the freight carrier’s profit, as well as increase traffic congestion, decrease roadway safety, and add unnecessary emissions to the environment. To this end, our study evaluates a potential collaboration strategy to be used by carriers for domestic intermodal freight transport based on an optimization approach to reduce the number of empty container trips. A binary integer-linear programming model is developed to determine each freight carrier’s optimal schedule while minimizing its operating cost. The model ensures that the cost for each carrier with collaboration is less than or equal to its cost without collaboration. It also ensures that average savings from the collaboration are shared equally among all participating carriers. Additionally, two stochastic models are provided to account for uncertainty in truck travel times. The proposed collaboration strategy is tested using empirical data and is demonstrated to be effective in meeting all of the shipment constraints.", "keywords": [ "Container (type theory)", "TRIPS architecture", "Truck", "Transport engineering", "Operations research", "Profit (economics)", "Integer programming", "Schedule", "Linear programming", "Computer science", "Business", "Engineering" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2078-2489/11/8/377/pdf?version=1595917023" }, { "id": "https://openalex.org/W4309340008", "doi": "10.1016/j.cor.2022.106074", "title": "Dock assignment and truck scheduling problem; consideration of multiple scenarios with resource allocation constraints", "year": 2022, "publication_date": "2022-11-16", "type": "article", "language": "en", "authors": [ "Rahimeh Neamatian Monemi", "Shahin Gelareh" ], "first_author": "Rahimeh Neamatian Monemi", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Computer science", "Integer programming", "Scheduling (production processes)", "Mathematical optimization", "Column generation", "Integer (computer science)", "Software deployment", "Operations research", "Algorithm", "Engineering", "Mathematics" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2022.106074" }, { "id": "https://openalex.org/W656375231", "doi": null, "title": "Discrete time formulation for the assignment problem applied in cross docking facilities", "year": 2012, "publication_date": "2012-01-01", "type": "article", "language": "en", "authors": [ "Georgios K. D. Saharidis", "Mihalis Golias", "T Zhang" ], "first_author": "Georgios K. D. Saharidis", "venue": "Transportation Research Board 91st Annual MeetingTransportation Research Board", "publisher": null, "abstract": "Assignment problems arise in different situations in transportation and are a well-studied topic in combinatorial optimization. Despite this fact, few works have been published on the use of a discrete time formulation. In this paper two new mathematical formulations are presented for the scheduling of inbound trucks to doors at a cross dock facility, and compared to the classical machine scheduling formulation.In the first formulation a continuous time representation is considered (similar to the classical one commonly found in the literature). In the second formulation, a discrete time representation is proposed. Numerical results, obtained using an exact algorithm, are presented in order to illustrate and critically discuss each formulation.", "keywords": [ "Scheduling (production processes)", "Mathematical optimization", "Doors", "Job shop scheduling", "Discrete time and continuous time", "Computer science", "Representation (politics)", "GRASP", "Combinatorial optimization", "DOCK", "Discrete optimization", "Mathematics" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1130595" }, { "id": "https://openalex.org/W2767614587", "doi": "10.1016/j.dam.2018.07.033", "title": "A two-commodity flow formulation for the capacitated truck-and-trailer routing problem", "year": 2018, "publication_date": "2018-09-15", "type": "article", "language": "en", "authors": [ "Enrico Bartolini", "Michael D. Schneider" ], "first_author": "Enrico Bartolini", "venue": "Discrete Applied Mathematics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Trailer", "Benchmark (surveying)", "Vehicle routing problem", "Routing (electronic design automation)", "Commodity", "Flow (mathematics)", "Computer science", "Mathematical optimization", "Operations research", "Mathematics", "Engineering" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0166218X18304402/pdf" }, { "id": "https://openalex.org/W2801336120", "doi": null, "title": "Dock Assignment and Truck Scheduling Problems at Cross-docking Terminals", "year": 2012, "publication_date": "2012-01-01", "type": "article", "language": "en", "authors": [ "Ching‐Jung Ting", "Amanda G. Rodríguez López" ], "first_author": "Ching‐Jung Ting", "venue": null, "publisher": null, "abstract": null, "keywords": [ "DOCK", "Truck", "Computer science", "Scheduling (production processes)", "Docking (animal)", "Engineering", "Operations management", "Marine engineering", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://digitalcommons.georgiasouthern.edu/cgi/viewcontent.cgi?article=1033&context=pmhr_2012" }, { "id": "https://openalex.org/W3030576075", "doi": null, "title": "Dock Assignment and Truck Scheduling Problems at Cross-docking Terminals", "year": 2012, "publication_date": "2012-06-25", "type": "article", "language": "en", "authors": [ "Amanda G. Rodríguez López", "Ching‐Jung Ting" ], "first_author": "Amanda G. Rodríguez López", "venue": null, "publisher": null, "abstract": null, "keywords": [ "DOCK", "Truck", "Computer science", "Scheduling (production processes)", "Docking (animal)", "Operations research", "Engineering", "Operations management", "Automotive engineering", "Marine engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://yzuir.yzu.edu.tw/handle/310901000/70824" }, { "id": "https://openalex.org/W2249694421", "doi": "10.1109/iesm.2015.7380237", "title": "Neighborhood strategies for the truck dock assignment problem in cross-docks", "year": 2015, "publication_date": "2015-10-01", "type": "conference-paper", "language": "en", "authors": [ "Cécilia Daquin", "Gilles Gonçalves", "Hamid Allaoui", "Tienté Hsu" ], "first_author": "Cécilia Daquin", "venue": null, "publisher": null, "abstract": "In this paper, we are interested in the truck dock assignment problem in cross-docks with several constraints. A cross-dock is a warehouse with limited storage capacity. Arriving trucks are assigned to docks and have to deliver goods to a warehouse. These goods are sorted out and loaded into the outbound trucks immediately. The objective is to find an optimal dock assignment for each truck in order to minimize the cost of transferring shipments within the cross-dock while avoiding delivery problems. To solve this problem, we propose several meta-heuristics. The first one is a local search that is characterized by different neighboring operators. These operators are tested and compared one by one on various instances of the cross-docking problem. The second meta-heuristic is a Variable Neighborhood Search (VNS). According to the efficiency of the local search operators, we test the way they can be combined in a VNS structure. Our experimental study shows that VNS makes use of the operators depending on their properties.", "keywords": [ "DOCK", "Truck", "Heuristics", "Variable neighborhood search", "Computer science", "Heuristic", "Variable (mathematics)", "Mathematical optimization", "Operations research", "Metaheuristic", "Engineering", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/iesm.2015.7380237" }, { "id": "https://openalex.org/W2737472830", "doi": null, "title": "Dynamic Hybrid Cross-Docking Model with Multiple Truck Types", "year": 2015, "publication_date": "2015-05-01", "type": "dissertation", "language": "en", "authors": [ "Sitara Holla" ], "first_author": "Sitara Holla", "venue": "DSpace at AUS (American University of Sharjah)", "publisher": "American University of Sharjah", "abstract": "A Master of Science thesis in Engineering Systems Management by Sitara Holla entitled, \"Dynamic Hybrid Cross-Docking Model with Multiple Truck Types,\" submitted in May 2015. Thesis advisor is Dr. Moncer Hariga and thesis co-advisor is Dr. Mehmet Gumus. Soft and hard copy available.", "keywords": [ "Truck", "Docking (animal)", "Engineering", "Computer science", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/11073/7789" }, { "id": "https://openalex.org/W4400083685", "doi": "10.1007/978-3-031-57603-4_17", "title": "Express Package Delivery Optimization Using Walkers, Cargo Tricycles and Delivery Trucks", "year": 2024, "publication_date": "2024-01-01", "type": "book-chapter", "language": "en", "authors": [ "Patrick Meredith-Karam", "Jia Hui Jiang", "Sina Bahrami", "Matthew J. Roorda" ], "first_author": "Patrick Meredith-Karam", "venue": "International series in management science/operations research/International series in operations research & management science", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Transport engineering", "Computer science", "Business", "Engineering", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-031-57603-4_17" }, { "id": "https://openalex.org/W4387134128", "doi": "10.1007/s12597-023-00694-5", "title": "Presenting an optimization model for multi cross-docking rescheduling location problem with metaheuristic algorithms", "year": 2023, "publication_date": "2023-09-28", "type": "article", "language": "en", "authors": [ "Iman Ghasemian Sahebi", "Seyed Pendar Toufighi", "Mahdi Azzavi", "Faezeh Zare" ], "first_author": "Iman Ghasemian Sahebi", "venue": "OPSEARCH", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Particle swarm optimization", "Metaheuristic", "Computer science", "Mathematical optimization", "Algorithm", "Simulated annealing", "Genetic algorithm", "Meta heuristic", "Mathematics" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://portal.findresearcher.sdu.dk/da/publications/ead5f55e-eb7d-4efe-9285-2dc7c5b41f4c" }, { "id": "https://openalex.org/W2621937623", "doi": "10.1002/net.21746", "title": "The vehicle routing problem with drones: Extended models and connections", "year": 2017, "publication_date": "2017-06-07", "type": "article", "language": "en", "authors": [ "Stefan Poikonen", "Xingyin Wang", "Bruce Golden" ], "first_author": "Stefan Poikonen", "venue": "Networks", "publisher": "Wiley", "abstract": "The vehicle routing problem with drones (VRPD) is inspired by the increasing interest in commercial drone delivery by companies such as Amazon, Google, DHL, and Walmart. In our model, a fleet of m homogeneous trucks each carries k drones with a speed of α times that of the truck. Each drone may dispatch from the top of the truck and carry a package to a customer location. The drone then returns to the top of its truck to recharge or swap batteries (we assume instantaneously). The truck itself is allowed to move and deliver packages, but must be stationary at a delivery location or the depot when launching or retrieving drones. The goal is to minimize the completion time to deliver all packages and return all vehicles back to the central depot. In this article, we review and extend several worst‐case results from an earlier paper and we make connections with another practical variant of the vehicle routing problem and with Amdahl's Law. We find that the VRPD model offers some important practical advantages. The drones allow the truck to parallelize tasks and they are able to take advantage of crow‐fly distances. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(1), 34–43 2017", "keywords": [ "Drone", "Truck", "Computer science", "Swap (finance)", "Routing (electronic design automation)", "Vehicle routing problem", "Operations research", "Computer network", "Automotive engineering", "Engineering", "Business" ], "cited_by_count": 348, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/net.21746" }, { "id": "https://openalex.org/W3124264248", "doi": "10.5377/nexo.v33i02.10780", "title": "Routing cross-docking depots, considering the time windows and pricing routes (case study: container transportation of Chabahar port)", "year": 2020, "publication_date": "2020-12-31", "type": "article", "language": "en", "authors": [ "Farhad Bavar", "Majid Sabzehparvar", "Mona Ahmadi Rad" ], "first_author": "Farhad Bavar", "venue": "Nexo Revista Científica", "publisher": "Universidad Nacional de Ingeniería", "abstract": "In this study, we develop a model for routing cross-docking centers considering time windows and pricing routs. In this model picking and delivery in several times is permitted and each knot can be serviced by more than one vehicle. Every truck can transport one or more product, in other words, we consider compatibility between product and vehicle. This model includes two goals: reducing the total cost and reducing the cost of carrying goods (freight fare). The total cost includes the cost required to traverse between the points, the cost of traversing the routes between the central cross-docking center and the first points after moving, and the cost to traverse the routes between the last points in each route and the depots that must be minimized. In general, the purpose of the model is to obtain the number of cross-docking center, the number of vehicles and the best route in the distribution network. We present a nonlinear programming model for this problem. We have solved the proposed model by GAMS. As the dimensions of the problem increase, the implementation time of the program increases progressively. So, in order to solve the model in medium and large scales, we proposed a genetic meta-heuristic algorithm. The results of examining different issues by the meta-heuristic approach show the very high efficiency of the developed algorithms in terms of the solution time and the answer of the problem.", "keywords": [ "Traverse", "Vehicle routing problem", "Truck", "Computer science", "Mathematical optimization", "Operations research", "Routing (electronic design automation)", "Engineering", "Mathematics", "Computer network", "Automotive engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.camjol.info/index.php/NEXO/article/download/10780/12626" }, { "id": "https://openalex.org/W4407959019", "doi": "10.1016/j.engappai.2025.110258", "title": "The two-tier multi-depot vehicle routing problem with robot stations and time windows", "year": 2025, "publication_date": "2025-02-26", "type": "article", "language": "en", "authors": [ "Giovanni Campuzano", "Eduardo Lalla‐Ruiz", "Martijn Mes" ], "first_author": "Giovanni Campuzano", "venue": "Engineering Applications of Artificial Intelligence", "publisher": "Elsevier BV", "abstract": "The deployment of sidewalk robots or automated guided vehicles (AGVs) offers significant potential to reduce traffic congestion and operational costs in last-mile logistics. Delivery systems using a two-layer structure, with trucks in the first layer and sidewalk robots at stations in the second, are modeled as Two-Tier Vehicle Routing Problems with Robot Stations (2T-VRP-RS). In this paper, we extend the 2T-VRP-RS to introduce the Two-Tier Multi-Depot Vehicle Routing Problem with Robot Stations and Time Windows (2T-MDVRP-RS-TW). We propose a Mixed-Integer Linear Programming (MILP) formulation and a Multi-Start Iterated Local Search metaheuristic with Crossover and Repair (MS-ILS-CR) operators. The MS-ILS-CR combines three strategies: a Multi-Start mechanism, a Crossover operator, and a Repair operator adapted from Variable Neighborhood Search, Genetic Algorithms, and Adaptive Large Neighborhood Search, respectively. We introduce new instance sets to study the 2T-MDVRP-RS-TW. Results showed that the MILP formulation is competitive for small instances of 10 customers. However, the metaheuristic consistently achieved better solution quality and lower computational times, with improvements of over 20% in the average objective values for instances of up to 30 customers. The MS-ILS-CR outperformed similar metaheuristic methods, improving its initial solutions by 66%. Furthermore, a sensitivity analysis showed a limited impact of time-window variations on the objective values. Nevertheless, a significant sensitivity was found to the depot configurations. Hence, increasing the number of depots from 1 to 3 improved the average objective values by 56%. Additionally, the MS-ILS-CR performance was further enhanced with more crossover iterations, but at the cost of higher computational times.", "keywords": [ "Computer science", "Depot", "Vehicle routing problem", "Robot", "Routing (electronic design automation)", "Real-time computing", "Simulation", "Embedded system", "Artificial intelligence" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.engappai.2025.110258" }, { "id": "https://openalex.org/W2550611797", "doi": null, "title": "A Holonic Logistics Execution System for Cross-docking", "year": 2013, "publication_date": "2013-10-29", "type": "dissertation", "language": "en", "authors": [ "Jan Van Belle" ], "first_author": "Jan Van Belle", "venue": "Lirias", "publisher": null, "abstract": "The coordination and control of cross-docking operations is a complex task and a challenging problem. A severe competition in the logistics sector and ever-increasing traffic (congestion) make that cross-docks should be able to operate efficiently in uncertain and dynamic environments. Moreover, the operational coordination and control is a going concern, so 'one-shot optimization' is not sufficient.As the logistics and manufacturing domain are characterized by similar properties (e.g. large decision space, nonlinearity, uncertainty, etc.), this thesis applies the concepts and principles of the Holonic Manufacturing Execution System (HMES) in order to develop a Holonic Logistics Execution System (HLES). The HLES is in charge of the organization of the logistic operations (e.g. resource allocation, tracking and tracing, etc.). By combining the PROSA reference architecture and the delegate MAS pattern in its software architecture, the HLES is able to provide a view on the expected short-term future of the system. The provided visibility is a valuable property for the staff, and also allows the control system to take better (informed) decisions.The objective of this thesis is to show that the HLES concept is a valuable option for a cross-docking logistics execution system. To this end, the thesis explains how such an HLES implementation can be developed. First, several adaptations and extensions to the latest HMES implementation are proposed. The HLES consists of a reusable core, domain-specific models and application-specific decision mechanisms. The introduced adaptations to the core allow the HLES to offer support for mobile resources (e.g. trucks), batching and multi-resource allocation. The thesis also presents the necessary models and decision mechanisms for the entities relevant in the context of cross-docking. It has been shown by simulation experiments that the holonic technology is applicable and that the developed system works as intended.Second, to support the cross-docking HLES in finding good global solutions, a vehicle routing scheduling system and truck scheduling system are developed. A cooperation mechanism between the holonic on-line control system and these scheduling systems is also presented. As the developed scheduling systems make use of a simplified and approximated model of reality, the schedules provided by these systems can be (partially) infeasible. The HLES is however able to compensate for several simplifications. Moreover, the HLES also deals with deviations from the schedule, making the scheduling approach more robust. Simulation experiments confirm that the cooperation between the HLES and external scheduling systems improves the performance.", "keywords": [ "Computer science", "Truck", "Delegate", "Tracing", "Domain (mathematical analysis)", "Operations research", "Architecture", "Distributed computing", "Engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://lirias.kuleuven.be/bitstream/123456789/416324/1/PhD_JanVanBelle.pdf" }, { "id": "https://openalex.org/W4287308100", "doi": "10.1177/03611981221108378", "title": "Multiple-Drones-Multiple-Trucks Routing Problem for Disruption Assessment", "year": 2022, "publication_date": "2022-07-25", "type": "article", "language": "en", "authors": [ "Alireza Ermagun", "Nazanin Tajik" ], "first_author": "Alireza Ermagun", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "This study proposes a multiple-drones-multiple-trucks (MDMT) routing problem to assess infrastructure in the areas of disruption epicenters using multiple drones that operate in synchronicity with multiple trucks. Incorporating the trucks as moving depots enables drones to move across disrupted areas further from their flight range. The MDMT routing problem is formulated as mixed integer linear programming (MILP). This is an NP-Hard (Non-deterministic Polynomial-time Hardness) problem, which is solved by introducing a greedy heuristic algorithm to cluster the disrupted locations and plan each drone’s schedule within each disrupted cluster and between clusters. Both MILP and the greedy heuristic algorithm are tested for small to large test problems extracted from the Minneapolis–St. Paul freeway system with a grid-like network topology. Results show that disrupted locations’ spatial distribution affects the efficient number of active drones and trucks in the system. When direct travel between two nodes takes longer than other alternative paths, increasing the number of trucks accelerates the assessment procedure. Findings also indicate that the spatial distribution of disruptions clustered by the greedy heuristic algorithm is correlated with the routing time and affects drone scheduling. If clusters are scattered, each drone is typically assigned to one cluster for damage assessments. With a dense pocket of clusters in the network, however, a drone moves back and forth between multiple clusters. The proposed framework for disruption assessment provides insights on the optimal deployment of resources to collect information following a network disruption. Practitioners will also benefit from the findings to augment resource management.", "keywords": [ "Drone", "Truck", "Greedy algorithm", "Computer science", "Routing (electronic design automation)", "Integer programming", "Scheduling (production processes)", "Heuristic", "Cluster analysis", "Schedule", "Linear programming", "Mathematical optimization" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1177/03611981221108378" }, { "id": "https://openalex.org/W3130670691", "doi": "10.33915/etd.582", "title": "Optimization Models for Locating Cross-docks under Capacity Uncertainty", "year": 2012, "publication_date": "2012-12-01", "type": "dissertation", "language": "en", "authors": [ "Anshul Soanpet" ], "first_author": "Anshul Soanpet", "venue": null, "publisher": null, "abstract": "The objective of this thesis is to develop mathematical models for locating cross-docks in a supply chain. Cross-docking is a strategy which can help consolidate the goods in the supply chain and save costs by reducing the number of truck trips. In this thesis four optimization models were developed. First two optimization models termed Model A and Model B were deterministic models. The goal of model A was to choose exactly P locations to locate cross-docks so that the transportation and handling costs are minimized. The goal of model B is to locate as many cross-docks as needed so that total routing, handling, and facility location costs are minimized. Then we developed a chance constraint model and a recourse model which accounted for capacity uncertainties at cross-dock location. The chance constraint model accounts for day to day operational uncertainties whereas the recourse model accounts to drastic reductions in capacities due to disruptions. Extensive computational analysis was conducted on two networks with parameters consistent with real world freight operations. The results reveal that cross-docking provides significant savings when the demand sizes are small and there is more potential for consolidation. For larger demands where the potential for consolidation is less, cross-dock savings diminish. The results were found to be consistent across a variety of capacity uncertainty scenarios.", "keywords": [ "Truck", "Operations research", "Supply chain", "Consolidation (business)", "TRIPS architecture", "Computer science", "Vehicle routing problem", "Constraint (computer-aided design)", "Mathematical model", "Mathematical optimization", "Engineering", "Routing (electronic design automation)" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://researchrepository.wvu.edu/cgi/viewcontent.cgi?article=1585&context=etd" }, { "id": "https://openalex.org/W2999047033", "doi": "10.1109/iesm45758.2019.8948106", "title": "Inbound and Outbound Truck Scheduling in a Cross-Docking Center for Fresh Products", "year": 2019, "publication_date": "2019-09-01", "type": "conference-paper", "language": "en", "authors": [ "Fei Pan", "Tijun Fan" ], "first_author": "Fei Pan", "venue": null, "publisher": null, "abstract": "In this paper, a novel optimization indicator, which is called the total deterioration value, is proposed to establish a mixed integer programming model for fresh product truck scheduling in a cross-docking center. We consider this indicator is related to the quantity of product, the corresponding deterioration time and rate. Meanwhile, the genetic algorithm with map-based crossover is developed to obtain the approximate optimal solution. According to the different proportions of high deterioration rates of fresh products, 4 scenarios including 30 instances are analyzed to test the effectiveness of our model. Compared with a model considering the minimization of makespan, interestingly, we find that our model can optimize the total deterioration value with a small increase of makespan in every scenario. In contrast with our model, the makespan model significantly increase the total deterioration value in every scenario. Specifically, in scenario 2, where high deterioration rate is in the minority, the makespan model will increase the total deterioration value by 10.72% compared with the optimal value. Results of the 4 scenarios show that our model is applicable for fresh product truck scheduling in a cross-docking center.", "keywords": [ "Job shop scheduling", "Truck", "Minification", "Computer science", "Scheduling (production processes)", "Integer programming", "Mathematical optimization", "Crossover", "Real-time computing", "Mathematics", "Engineering", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/iesm45758.2019.8948106" }, { "id": "https://openalex.org/W7131660961", "doi": "10.1016/j.cie.2026.111939", "title": "Urban delivery network location–routing problem under a metro–truck intermodal transportation mode", "year": 2026, "publication_date": "2026-02-26", "type": "article", "language": "en", "authors": [ "Zhen Di", "Yuhang Zhou", "Jianguo Qi" ], "first_author": "Zhen Di", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Iterated local search", "Routing (electronic design automation)", "Heuristic", "Mode (computer interface)", "Total cost", "City logistics", "Sensitivity (control systems)", "Metro station", "Minification" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2026.111939" }, { "id": "https://openalex.org/W2981484461", "doi": "10.1109/icmsao.2019.8880379", "title": "Autonomous Vehicles Delivery Systems Classification: Introducing a TSP With a Moving Depot", "year": 2019, "publication_date": "2019-04-01", "type": "conference-paper", "language": "en", "authors": [ "Batool Madani", "Malick Ndiaye" ], "first_author": "Batool Madani", "venue": null, "publisher": null, "abstract": "The vast growth in the e-commerce market has increased the attention to resolving the problem of conveying goods from distribution hubs to final destinations (customers) in the supply chain. The process known as the Last Mile Delivery (LMD) problem has significant challenges such as reducing operational cost or ecological impact and increasing supply chain performance. The inclusion of new technologies such as drones, robots, and the internet of things help tackle these challenges by developing new distribution systems to improve from traditional deliveries methods (delivery person, postal/delivery boxes). However, the use of these technologies brings new operational challenges. For instance, in a combined truck-drone delivery system, the truck serves as a depot from where we load the product to the drone for final delivery to the customers. The depot is now moving unlike in a traditional Vehicle Routing Problem (VRP) for which we always assume a fixed depot. This research paper deals with the impact of using Autonomous Vehicles (AV) on the logistics of the LMD. We first present a technological review of the use of AVs in logistics and use it to introduce a classification of the delivery systems based on the parcel/product handover at the time of the last handling before delivery to customers. We describe three categories of handovers, namely, machine-to-person, machine-to-machine, and person-to-machine. We present a new class of vehicle routing problems with a moving depot and formulate two variants of a Discrete Traveling Salesman Problem (TSP) with a Moving Depot (TSP-MD). We solve the problem using the General Algebraic Modeling System (GAMS) software and discuss some of the problem characteristics.", "keywords": [ "Truck", "Vehicle routing problem", "Travelling salesman problem", "Computer science", "Supply chain", "Drone", "Last mile (transportation)", "Routing (electronic design automation)", "Product (mathematics)", "Depot", "Operations research", "Process (computing)" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/icmsao.2019.8880379" }, { "id": "https://openalex.org/W2905321319", "doi": "10.1007/978-3-030-03003-2_23", "title": "Tabu Search Robustness for Cross-Dock and PI-Hub Scheduling Under Possible Internal Transportation Breakdowns", "year": 2018, "publication_date": "2018-12-11", "type": "conference-paper", "language": "en", "authors": [ "Tarik Chargui", "Abdelghani Bekrar", "Mohamed Reghioui", "Damien Trentesaux" ], "first_author": "Tarik Chargui", "venue": "Studies in computational intelligence", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Tabu search", "Robustness (evolution)", "DOCK", "Mathematical optimization", "Computer science", "Scheduling (production processes)", "Operations research", "Engineering", "Mathematics", "Marine engineering", "Biology" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-030-03003-2_23" }, { "id": "https://openalex.org/W4386000861", "doi": "10.1002/net.22178", "title": "A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group", "year": 2023, "publication_date": "2023-08-16", "type": "article", "language": "en", "authors": [ "Rossana Cavagnini", "Michael Schneider", "Alina Theiß" ], "first_author": "Rossana Cavagnini", "venue": "Networks", "publisher": "Wiley", "abstract": "Abstract To plan the postal deliveries of our industry partner DHL Group (DHL), the single truck and trailer routing problem with satellite depots (STTRPSD) is solved to optimize mail carriers routes. In this application context, instances feature a high number of customers and satellites, and they are based on real street networks. This motivates the study of the asymmetric STTRPSD (ASTTRPSD). The heuristic solution methods proposed in the literature for the STTRPSD can either solve only the symmetric problem variant, or it is unclear whether they can also be used to solve the ASTTRPSD. We introduce an iterated local search, called ILS‐ASTTRPSD, which generates different first‐level tours in the perturbation phase, and improves the second‐level tours in the local search phase. To speed up the search, granular neighborhoods are used. The computational results on instances from the literature prove the capability of ILS‐ASTTRPSD to return high‐quality solutions. On DHL instances, ILS‐ASTTRPSD significantly decreases total travel times of the mail carriers and returns solutions with a different structure compared to the ones provided by DHL. Based on these differences, we give recommendations on how DHL could design more efficient mail carrier practices. Dedicated computational experiments reveal that considering parking and loading times when solving the ASTTRPSD leads to lower travel times, and that ignoring parking times is more counterproductive than ignoring loading times. Moreover, we assess the robustness of our solutions under parking time fluctuations. Finally, we derive properties of instances for which optimal solutions contain multiple second‐level tours rooted at the same parking spot and for which the optimal solutions of the ASTTRPSD correspond to the ones of a pure traveling salesman problem.", "keywords": [ "Iterated local search", "Computer science", "Robustness (evolution)", "Iterated function", "Routing (electronic design automation)", "Truck", "Mathematical optimization", "Context (archaeology)", "Local search (optimization)", "Operations research", "Mathematics", "Computer network" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.22178" }, { "id": "https://openalex.org/W1548457369", "doi": "10.1080/14942119.2003.10702478", "title": "Economic Impact of Secondary Intermediate Transport of Pulpwood to Truck Transport Depots in South Africa: Three Case Studies", "year": 2003, "publication_date": "2003-06-01", "type": "article", "language": "en", "authors": [ "Pierre Ackerman", "Reino E. Pulkki" ], "first_author": "Pierre Ackerman", "venue": "International Journal of Forest Engineering", "publisher": "Taylor & Francis", "abstract": "Shorthaul transport, known as secondary intermediate transport (SIT), is an additional transport phase within traditional secondary transport in South Africa. It originates at roadside landing or depot and terminates at another depot or rail siding (not the final destination). The use of SIT is forced by poor and steadily declining forest road conditions, to the extent that highway type vehicles are unable to reach roadside landings. This necessitates the use of intermediate storage sites, from which the timber is once again loaded and transported to its final destination. A network analysis model and grid cell-based geographic information system were combined to analyse the various transport scenarios within three study areas in the KwaZulu/Natal Midlands of South Africa, employing SIT on poor, high-density forest road networks. Results show the South African forest industry’s average annual transportation cost penalty, by maintaining SIT, to be $US 4.32 million or $US 0.82/m3 over the cost of transportation over an improved road network using only secondary terminal transport. This cost differential does not account for the cost of upgrades required to eliminate the need for SIT. However a net present value cost analysis of the inclusion of road upgrade costs versus the average annual transportation cost savings and increased forest yield from decommissioned roads, maintains a positive financial benefit. Economic analysis highlighted the need for reduced road network densities and for improvement of the remaining network. This would eliminate extended primary transport, multiple loading, unloading and storage by allowing highway vehicles to transport timber from compartment roadside to its final destination.", "keywords": [ "Truck", "Transport engineering", "Road transport", "Forest road", "Transport network", "Flow network", "Upgrade", "Engineering", "Geography", "Forestry", "Computer science" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/14942119.2003.10702478" }, { "id": "https://openalex.org/W2735037747", "doi": null, "title": "Cross-dock door assignments: models, algorithms and extensions", "year": 2017, "publication_date": "2017-05-10", "type": "dissertation", "language": "en", "authors": [ "W. Nassief" ], "first_author": "W. Nassief", "venue": "Spectrum Research Repository (Concordia University)", "publisher": "Concordia University", "abstract": "In a cross-dock, goods coming from numerous origins get unloaded from incoming trucks, consolidated according to their destinations, and then loaded into outgoing trucks with little or no storage in between. We study a class of cross-dock door assignment problems where the assignments of origins (or incoming trucks) to inbound doors, and destinations (or outgoing trucks) to outbound doors are determined with the objective of minimizing the handling cost. Cross-dock door assignment problems are a fundamental class of optimization problems in cross-docking as they arise in more complex operational problems incorporating other decisions such as scheduling, routing, and workforce allocation. We first introduce several linear mixed integer programming formulations with Lagrangean relaxation and column generation algorithms based on some of these formulations. We then theoretically and computationally compare these formulations in terms of their linear, Lagrangean and combinatorial relaxations. Finally, we integrate the assignments with sequencing and selection decisions, based on our observations on a large cross-dock company in the USA, and introduce two new integer programming formulations. Where possible, our work is compared with existing ones, and new sets of instances are generated to either vary or enlarge the current data sets in the literature.", "keywords": [ "Doors", "Truck", "DOCK", "Integer programming", "Linear programming relaxation", "Column generation", "Computer science", "Scheduling (production processes)", "Mathematical optimization", "Bipartite graph", "Class (philosophy)", "Linear programming" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://spectrum.library.concordia.ca/982540/1/Nassief_PhD_S2017.pdf" }, { "id": "https://openalex.org/W4403280247", "doi": "10.1016/j.ifacol.2024.09.066", "title": "Sustainable Multi-Objective Truck Scheduling in a Rail-Road Physical Internet Cross-Docking Hub with Internal Storage", "year": 2024, "publication_date": "2024-01-01", "type": "article", "language": "en", "authors": [ "Soukaina Aberka", "Marouan Aghrod", "Wafae Ettaki", "Zakaria Natiji", "Tarik Chargui", "Sondès Chaabane" ], "first_author": "Soukaina Aberka", "venue": "IFAC-PapersOnLine", "publisher": "Elsevier BV", "abstract": "Cross-docking is a just-in-time logistics strategy that involves the seamless transfer of goods from receiving docks to shipping docks without the need for extensive storage. It optimizes the order picking process by efficiently moving freight with the same destination, regardless of their original suppliers. This paper delves into optimizing operations within a rail-road PI-hub cross-docking terminal, which includes an internal storage zone. The primary goal is to enhance the flexibility and sustainability of workflows within the cross-dock platform. Scheduling revolves around assigning PI-containers, unloaded from train wagons, to outbound trucks and their corresponding docks within a specified timeframe. The objective is to concurrently minimize storage costs, energy consumption costs of PI-conveyors during container movement, and the overall trucking expenses required to meet demand at various destinations. To address this, a Multi-Objective Mixed-Integer Programming model (MO-MIP) is formulated and solved using the CPLEX solver with Lexicographic Goal Programming. The model’s efficacy is demonstrated through testing on five distinct instances, where the CPLEX solver successfully identifies optimal solutions within reasonable computation times.", "keywords": [ "Truck", "Docking (animal)", "Transport engineering", "Scheduling (production processes)", "Automotive engineering", "Computer science", "The Internet", "Engineering", "Operations management", "World Wide Web" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ifacol.2024.09.066" }, { "id": "https://openalex.org/W2116094399", "doi": "10.1109/ccdc.2009.5195134", "title": "Model and algorithm of multi-depot container truck transportation with time windows", "year": 2009, "publication_date": "2009-06-01", "type": "conference-paper", "language": "en", "authors": [ "Ruiyou Zhang", "Dingwei Wang", "Won Young Yun" ], "first_author": "Ruiyou Zhang", "venue": null, "publisher": null, "abstract": "A multi-depot container truck transportation problem with time windows is studied in this paper. Two types of transportation resources as trucks and containers and four types of container movements as inbound/outbound full and inbound/outbound empty movements are considered. The problem is formulated as a graph and then mathematically modeled as a multi-traveling salesman problem with time windows (m-TSPTW) with multiple depots. A reactive tabu search (RTS) algorithm is developed and tested based on a number of randomly generated examples. The results compared with the commercial tool CPLEX indicate that the RTS algorithm can find the optimum solutions of small-sized examples in short time. Furthermore, the algorithm is robust and stable to solve large-sized example.", "keywords": [ "Travelling salesman problem", "Truck", "Tabu search", "Container (type theory)", "Computer science", "Traveling purchaser problem", "Mathematical optimization", "Pickup", "Vehicle routing problem", "Graph", "Algorithm", "2-opt" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/ccdc.2009.5195134" }, { "id": "https://openalex.org/W4386485183", "doi": "10.1007/s00500-023-09137-1", "title": "A new hybrid genetic algorithm to optimize distribution and operational plans for cross-docking satellites", "year": 2023, "publication_date": "2023-09-06", "type": "article", "language": "en", "authors": [ "İlker Küçükoğlu", "Nursel Öztürk" ], "first_author": "İlker Küçükoğlu", "venue": "Soft Computing", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Simulated annealing", "Truck", "Genetic algorithm", "Computer science", "Algorithm", "Mathematical optimization", "Estimation of distribution algorithm", "Engineering", "Mathematics", "Automotive engineering", "Machine learning" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00500-023-09137-1" }, { "id": "https://openalex.org/W2338327873", "doi": "10.1016/j.trd.2017.02.017", "title": "Delivery by drone: An evaluation of unmanned aerial vehicle technology in reducing CO 2 emissions in the delivery service industry", "year": 2017, "publication_date": "2017-03-14", "type": "article", "language": "en", "authors": [ "Anne Goodchild", "Jordan Toy" ], "first_author": "Anne Goodchild", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Truck", "Service (business)", "Transport engineering", "Aeronautics", "Environmental science", "Engineering", "Computer science", "Business", "Automotive engineering", "Marketing" ], "cited_by_count": 467, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2017.02.017" }, { "id": "https://openalex.org/W1975309404", "doi": "10.2139/ssrn.979909", "title": "A Hybrid Method Based on Linear Programming and Tabu Search for Routing of Logging Trucks", "year": 2007, "publication_date": "2007-01-01", "type": "preprint", "language": "en", "authors": [ "Patrik Flisberg", "Bertil Lidén", "Mikael Rönnqvist" ], "first_author": "Patrik Flisberg", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Truck", "Tabu search", "Logging", "Routing (electronic design automation)", "Vehicle routing problem", "Linear programming", "Computer science", "Mathematical optimization", "Transport engineering", "Engineering", "Mathematics", "Algorithm" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.979909" }, { "id": "https://openalex.org/W3200210046", "doi": "10.1007/s40305-021-00362-9", "title": "Multiple Cross-docks Scheduling with Multiple Doors using Fuzzy Approach and Metaheuristic Algorithms", "year": 2021, "publication_date": "2021-11-06", "type": "article", "language": "en", "authors": [ "Mitra Movassaghi", "Soroush Avakh Darestani" ], "first_author": "Mitra Movassaghi", "venue": "Journal of the Operations Research Society of China", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Metaheuristic", "Computer science", "Operations research", "Fuzzy logic", "Truck", "Supply chain", "Supply chain management", "Ant colony optimization algorithms", "Procurement", "Mathematical optimization", "Integer programming", "Scheduling (production processes)" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s40305-021-00362-9" }, { "id": "https://openalex.org/W4390616928", "doi": "10.3390/en17020286", "title": "Reducing CO2 Emissions of Hybrid Heavy-Duty Trucks and Buses: Paving the Transition to Low-Carbon Transport", "year": 2024, "publication_date": "2024-01-05", "type": "article", "language": "en", "authors": [ "Nikiforos Zacharof", "Evangelos Bitsanis", "Stijn Broekaert", "Georgios Fontaras" ], "first_author": "Nikiforos Zacharof", "venue": "Energies", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "This study investigates the CO2 reduction potential of powertrain hybridisation on heavy-duty lorries and city buses. The analysis considers modern parallel and serial hybrid architectures, assessing their efficiency and limits in CO2 emission reduction through vehicle simulation in VECTO, which is the official tool of the European Commission for calculating heavy-duty vehicle fuel and energy consumption. The results reveal distinct trends for each vehicle type and architecture. In lorries, more significant improvements are observed in urban delivery profiles, reaching up to ~16%, indicating the benefits of hybridisation in transient conditions with energy recuperation opportunities. City buses, particularly those with serial architectures, exhibit significant emission reductions that reach 36%, making them suitable for urban environments. The optimisation of electric motor size and performance plays a crucial role in achieving emission reductions, while battery capacity must be carefully considered to avoid adverse effects. For lorries in urban delivery use, further improvements of 17.5% can be achieved by utilising a 160 kW engine motor and 30 kWh battery. Buses are already quite well optimised, with serial architecture presenting the highest benefits with a 120 kW electric motor and a battery of 11 kWh. Future research should focus on supercapacitors and gearboxes to improve efficiency at higher vehicle speeds and assess hybridisation potential in interurban coach travel. The heavy-duty vehicle sector can make significant strides towards low-carbon transport by maximising hybrid powertrain efficiency and emission reductions.", "keywords": [ "Truck", "Powertrain", "Automotive engineering", "Battery (electricity)", "Fuel efficiency", "Efficient energy use", "Electrification", "Greenhouse gas", "Energy consumption", "Supercapacitor", "Environmental science", "Engineering" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/1996-1073/17/2/286/pdf?version=1704465437" }, { "id": "https://openalex.org/W2068574738", "doi": "10.4103/0974-777x.52977", "title": "HIV infection, genital symptoms and sexual risk behavior among Indian truck drivers from a large transportation company in South India", "year": 2009, "publication_date": "2009-01-01", "type": "article", "language": "en", "authors": [ "Annie Dude", "Ganesh Oruganti", "Vinod Kumar", "KennethH Mayer", "Vijay V. Yeldandi", "John Schneider" ], "first_author": "Annie Dude", "venue": "Journal of Global Infectious Diseases", "publisher": "Medknow", "abstract": "BACKGROUND: Sentinel surveillance conducted in the high Human Immuno-deficiency Virus (HIV) prevalent state of Andhra Pradesh includes sub-populations thought to be at high-risk for HIV, but has not included truck drivers. Novel HIV prevention programs targeting this population increasingly adopt public - private partnership models. There have been no targeted studies of HIV prevalence and risk behavior among truck drivers belonging to the private sector in India. METHODS: A sample of 189 truck drivers, aged between 15 and 56, were recruited from Gati Limited's large trucking depot in Hyderabad, India. A quantitative survey instrument was conducted along with blood collection for HIV 1/2 testing. Multivariate regression models were utilized to determine predictors of HIV infection and risk behavior. RESULTS: 2.1% of subjects were infected with HIV. Older age was protective against self-reported genital symptoms (OR = 0.77; P = 0.03), but these were more likely among those truck drivers with greater income (OR = 1.05; P = 0.02), and those who spent more time away from home (OR = 25.7; P = 0.001). Men with higher incomes also reported significantly more sex partners (OLS coefficient = 0.016 more partners / 100 rupees in monthly income, P = 0.04), as did men who spent a great deal of time away from home (OLS coefficient = 1.30, P = 0.002). Drivers were more likely to report condom use with regular partners if they had ever visited a female sex worker (OR = 6.26; P = 0.002), but married drivers exhibited decreased use of condoms with regular partners (OR = 0.14, P = 0.008). Men who had higher levels of knowledge regarding HIV and HIV preventative practices were also more likely to use condoms with regular partners (OR = 1.22, P = 0.03). CONCLUSION: Time away from home, urban residence, income, and marital status were the strongest correlates of genital symptoms for Sexually Transmitted Infections (STI) and risk behaviors, although none were consistent predictors of all outcomes. Low HIV prevalence might be explained by a cohort that was mostly married, and at home. Novel HIV prevention interventions may be most cost effective when focusing upon young, single, and long-haul truck drivers.", "keywords": [ "Condom", "Demography", "Medicine", "Population", "Environmental health", "Human immunodeficiency virus (HIV)", "Immunology" ], "cited_by_count": 27, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.4103/0974-777x.52977" }, { "id": "https://openalex.org/W2293473699", "doi": "10.3390/mca18030273", "title": "A Mathematical Model for Two Dimensional Loading Problem in Cross-Docking Network Design", "year": 2013, "publication_date": "2013-12-01", "type": "article", "language": "en", "authors": [ "İlker Küükoğlu", "Aslı Aksoy", "Seval Ene", "Nursel Öztürk" ], "first_author": "İlker Küükoğlu", "venue": "Mathematical and Computational Applications", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "In this paper, the transportation problem of cross-docking network is taken into account. Cross-docking centers differ from distribution centers or warehouses in that the loads are transported from origins to destinations through cross-docking centers without storing them for a long time. Goods are unloaded from incoming trucks and reloaded immediately onto outgoing trucks in these cross-docking centers. This problem is formulated using a mixed integer programming with two-dimensional loading constraints. The two-dimensional shapes are applied for both trucks and loads in order to find exact capacity of each truck in basis of each product. The illustrative problems are solved and results show that the proposed model finds practical solutions with two- dimensional loading constraints.", "keywords": [ "Truck", "Computer science", "Docking (animal)", "Integer programming", "Mathematical optimization", "Engineering", "Mathematics", "Algorithm", "Automotive engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2297-8747/18/3/273/pdf?version=1457527435" }, { "id": "https://openalex.org/W4386975320", "doi": "10.1016/j.tre.2023.103282", "title": "Inter-terminal transportation for an offshore port integrating an inland container depot", "year": 2023, "publication_date": "2023-09-21", "type": "article", "language": "en", "authors": [ "Pengliang Cao", "Yujing Zheng", "Kum Fai Yuen", "Yuxiong Ji" ], "first_author": "Pengliang Cao", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Container (type theory)", "Port (circuit theory)", "Transport engineering", "Bottleneck", "Throughput", "Traffic congestion", "Computer science", "Marine engineering", "Operations research", "Engineering", "Operations management" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2023.103282" }, { "id": "https://openalex.org/W4312934430", "doi": "10.1016/j.trpro.2022.12.048", "title": "Location-allocation problem in a multi-terminal cross-dock distribution network for palletized perishables delivery", "year": 2022, "publication_date": "2022-01-01", "type": "article", "language": "en", "authors": [ "Ilaria Battarra", "Riccardo Accorsi", "Giacomo Lupi", "Riccardo Manzini", "Gabriele Sirri" ], "first_author": "Ilaria Battarra", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "A multi-terminal cross-dock distribution network deals with widespread suppliers through intermediate logistic actors that collect products from supplier facilities and use cross-docking hubs for consolidation and distribution. In these hubs, incoming products are unloaded, sorted, and consolidated with others into new shipments heading towards retailers and final customers. This type of network is suitable for the express delivery of fast-moving products, such as perishables, guaranteeing shipment within a short time window (e.g., one day). The strategic design of a multi-terminal cross-dock network deals with solving the location-allocation problem (LAP) because hub location and flow allocation play a pivotal role in reducing transportation time and cost. This paper proposes a mixed-integer linear programming (MILP) model that solves the strategic problem of a multi-terminal cross-dock network design for perishables in an augmented LAP formulation. The aim is to exploit the potential hub location and handling capacity (i.e., location problem ), as well as the optimal destination hub for unloading/loading operations (i.e., allocation problem ) per truck, while minimizing the total logistics costs and increasing truck utilization. The proposed model is applied to a cross-dock multi-terminal network owned by an Italian company specializing in the fast delivery of palletized perishable products. A comparative what-if multi-scenario analysis illustrates the change in the traveling cost and truck utilization according to several factors, such as the opportunity to open (close) new (existing) hubs in Italy.", "keywords": [ "Truck", "DOCK", "Exploit", "Terminal (telecommunication)", "Integer programming", "Network planning and design", "Flow network", "Computer science", "Operations research", "Transport engineering", "Computer network", "Engineering" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trpro.2022.12.048" }, { "id": "https://openalex.org/W2528239233", "doi": null, "title": "Towards holonic control for cross-docks", "year": 2010, "publication_date": "2010-11-01", "type": "conference-paper", "language": "en", "authors": [ "Jan Van Belle", "Bart Saint Germain", "Rudi Bahtiar", "Paul Valckenaers", "Hendrik VAN BRUSSEL", "Dirk Cattrysse" ], "first_author": "Jan Van Belle", "venue": "Lirias", "publisher": null, "abstract": "Cross-docking is a logistics strategy typically used for the consolidation of freight and the reduction of stock. In this paper, a short overview is given of the different problems concerning cross-docking that are studied in literature. Concerning the internal logistics, the manager of a cross-dock is faced with similar problems as in the manufacturing domain. By applying the concepts of the Holonic Manufacturing Execution System, it is possible to proactively and reactively control the cross-dock in real time. The paper explains how the same concepts can be applied and how this approach can be extended beyond the borders of the cross-dock by also considering the inbound and outbound trucks.", "keywords": [ "Control (management)", "Computer science", "Business", "Artificial intelligence" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://lirias.kuleuven.be/handle/123456789/280397" }, { "id": "https://openalex.org/W4213448920", "doi": "10.1177/03611981221077264", "title": "Optimization Models for Snowplow Routes and Depot Locations: A Real-World Implementation", "year": 2022, "publication_date": "2022-02-24", "type": "article", "language": "en", "authors": [ "Shuoyan Xu", "Mingjian Wu", "Tae Jung Kwon", "Max S Perchanok" ], "first_author": "Shuoyan Xu", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "This study developed a series of strategies to reassess the service level of winter road maintenance (WRM) operations on the road network in Perth County, Ontario, Canada. These strategies include rearranging plow routes by sharing the material storage yards and optimizing their numbers and locations while considering operational and legislative constraints such as total circuit time, operating speeds, and the number of available trucks. A methodological framework was then formulated and solved by tackling four practical, yet challenging, tasks in a sequential manner. The first task was to identify existing plow routes and construct a detailed GIS database that was later used for benchmarking the current WRM operations. The second task involved the optimization of existing plow routes, while the third task focused on the optimization of plow routes and depot locations by amalgamating WRM operations of different municipalities within Perth County. The final task was to conduct a clean slate optimization to see the benefits of combining depots and route sharing. The optimization models developed were implemented to transform the existing maintenance operations networks to an optimized, integrated, and unified network of routes, with improved land use utilization for road maintenance yards. The framework then captured the impact of the service order of maintenance routes and arranged routing priority efficiently using the tabu search algorithm. The findings also revealed that, by sharing depots, the county could retire three depots and eight trucks while still meeting legislative requirements, thereby suggesting the potential for substantial monetary savings.", "keywords": [ "Truck", "Transport engineering", "Task (project management)", "Computer science", "Operations research", "Service (business)", "Benchmarking", "Routing (electronic design automation)", "Yard", "Vehicle routing problem", "Engineering", "Business" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1177/03611981221077264" }, { "id": "https://openalex.org/W4403128054", "doi": "10.1016/j.trb.2024.103078", "title": "The multi-compartment truck and trailer petrol station replenishment problem with domino hazard risks", "year": 2024, "publication_date": "2024-10-04", "type": "article", "language": "en", "authors": [ "Weitiao Wu", "Yu Li" ], "first_author": "Weitiao Wu", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Trailer", "Gasoline", "Compartment (ship)", "Hazard", "Environmental science", "Engineering", "Automotive engineering", "Waste management", "Biology", "Geology", "Ecology" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trb.2024.103078" }, { "id": "https://openalex.org/W2606805938", "doi": "10.18844/gjbem.v7i1.1408", "title": "A mathematical model for truck-door assignment and product placement problem in cross-docking center", "year": 2017, "publication_date": "2017-04-12", "type": "article", "language": "en", "authors": [ "İlker Küçükoğlu", "Nursel Öztürk" ], "first_author": "İlker Küçükoğlu", "venue": "Global Journal of Business Economics and Management Current Issues", "publisher": null, "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;", "keywords": [ "Truck", "Doors", "Computer science", "Mathematical model", "Docking (animal)", "Assignment problem", "Operations research", "Engineering", "Mathematical optimization", "Mathematics", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.18844/gjbem.v7i1.1408" }, { "id": "https://openalex.org/W4382182524", "doi": "10.1097/jom.0000000000002914", "title": "The Efficacy and Feasibility of a High Intensity Interval Training Program to Improve Cardiorespiratory Fitness in Truck Drivers", "year": 2023, "publication_date": "2023-06-23", "type": "article", "language": "en", "authors": [ "Nicholas David Gilson", "Grégore Iven Mielke", "Jeff Scott Coombes", "Mitch J. Duncan", "Wendy J. Brown" ], "first_author": "Nicholas David Gilson", "venue": "Journal of Occupational and Environmental Medicine", "publisher": "Lippincott Williams & Wilkins", "abstract": "OBJECTIVE: This cluster-controlled pilot study assessed the efficacy and feasibility of \"Fit 2 Drive,\" a depot-delivered, high-intensity interval training (HIIT) program to improve the cardiorespiratory fitness (CRF) of truck drivers. METHODS: Companies of local delivery drivers (44 men; mean [SD] age = 50.5 [9.8] years; Brisbane, Australia) were assigned to \"Fit 2 Drive\" (4 clusters; 27 drivers; 1 × 4 minutes supervised to self-managed HIIT, 3 times a week, 12 weeks) or a control (5 clusters; 17 drivers). Analyses assessed between group changes in CRF (VO 2peak ), HIIT session attendance, and delivery costs. RESULTS: Driver clusters allocated to \"Fit 2 Drive\" significantly improved CRF compared to a control (mean difference of 3.6 mL·kg -1 ·min -1 ; P < 0.019; 95% confidence interval = 0.7-6.5 mL·kg -1 ·min -1 ). Drivers who completed the program attended 70% of sessions (25/36) with delivery costs averaging $710 AUD per driver. CONCLUSIONS: The findings support the efficacy and feasibility of Fit 2 Drive but also highlight challenges for in-person delivery at scale.", "keywords": [ "Cardiorespiratory fitness", "Attendance", "Interval training", "High-intensity interval training", "Confidence interval", "Medicine", "Physical therapy", "Internal medicine" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1097/jom.0000000000002914" }, { "id": "https://openalex.org/W4366813960", "doi": "10.1016/j.ejor.2023.04.016", "title": "Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints", "year": 2023, "publication_date": "2023-04-24", "type": "article", "language": "en", "authors": [ "Abderrahman Bani", "Issmaïl El Hallaoui", "Ayoub Insa Corréa", "Adil Tahir" ], "first_author": "Abderrahman Bani", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Column generation", "Heuristics", "Bottleneck", "Computer science", "Mathematical optimization", "Truck", "Context (archaeology)", "Operations research", "Shortest path problem", "Simulated annealing", "Mathematics", "Theoretical computer science" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2023.04.016" }, { "id": "https://openalex.org/W4399670154", "doi": "10.3390/su16125090", "title": "Modeling and Optimization of Container Drayage Problem with Empty Container Constraints across Multiple Inland Depots", "year": 2024, "publication_date": "2024-06-14", "type": "article", "language": "en", "authors": [ "Xuhui Yu", "Yin Feng", "Cong He", "Chang Liu" ], "first_author": "Xuhui Yu", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Container drayage involves the transportation of containers by trucks. Although the distance is relatively short compared to maritime and rail transport, container drayage accounts for 25% to 40% of the total container transportation costs and significantly contributes to increased fuel consumption and carbon emissions. Thus, the modeling of the container drayage problem (CDP) has received a lot of attention in the last two decades. However, the three fundamental modeling factors, including the combination of trucking operation modes and empty container relocation strategies, as well as empty container constraints and multiple inland depots, have not been simultaneously investigated. Hence, this study addressed a comprehensive CDP that simultaneously incorporates the three modeling factors. The problem was formulated as a novel mixed integer linear programming (MILP) model based on the DAOV graph. Given the complexity of this problem, it was not realistic to find an exact solution for large instances. Therefore, an improved genetic algorithm (GA) was designed by integrating the “sequential insertion” method and “solution re-optimization” operation. The performance of Gurobi and GA was validated and evaluated through randomly generated instances. The results indicate that (1) the proposed algorithm can provide near-optimal solutions for large-scale instances within a reasonable running time, (2) the greatest cost savings from combining trucking operation modes and empty container relocation strategies range from 10.45% to 31.86%, and (3) the three modeling factors significantly influence the fuel consumption and carbon emissions, which can provide managerial insights for sustainable container drayage practices.", "keywords": [ "Container (type theory)", "Relocation", "Truck", "Genetic algorithm", "Integer programming", "Mathematical optimization", "Fuel efficiency", "Greenhouse gas", "Range (aeronautics)", "Computer science", "Operations research", "Environmental science" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3390/su16125090" }, { "id": "https://openalex.org/W7140735999", "doi": "10.3390/wevj17040172", "title": "Investigating the Impact of Public En-Route and Depot Charging for Electric Heavy-Duty Trucks Using Agent-Based Transport Simulation and Probabilistic Grid Modeling", "year": 2026, "publication_date": "2026-03-26", "type": "article", "language": "en", "authors": [ "Mattias Ingelström", "Alice Callanan", "Francisco J. Márquez-Fernández" ], "first_author": "Mattias Ingelström", "venue": "World Electric Vehicle Journal", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "This study presents an integrated simulation framework that combines agent-based transport modeling with probabilistic load-flow analysis to quantify power system loading of long-haul heavy-duty electrification. The approach is applied to a case study considering fully electrified road freight in the Skåne region in Sweden, using high-resolution transport demand data and the actual power grid model used by the grid owner in the study area. The synthetic freight population covers the full long-haul truck segment intersecting Skåne. Both public en-route fast charging and end-of-trip depot charging are considered. The analysis reveals two fundamentally different charging demand profiles: a heavily fluctuating profile for public en-route charging, accounting on average for 82% of the total daily charging energy, and a stable profile for end-of-trip depot charging, covering on average the remaining 18%. The latter is achieved through a Linear Programming (LP) optimization model that flattens the load by scheduling charging across depot stay windows. These profiles serve as inputs to a probabilistic load-flow simulation that computes loading distributions for substation transformers. The simulation results show that in 4 of the 43 primary substations studied, the maximum transformer loading exceeds 100% following the introduction of truck charging, with peak loading at the most affected substation rising from 99% to 159%. This stress is primarily caused by the public charging demand, which peaks from late morning to noon, aligning with the early stages of logistics operations. However, there is no clear correlation between the magnitude of the truck charging load and the impact on transformer loading, since this is also highly dependent on local grid conditions. These findings highlight the value of integrated transport-energy simulations for planning resilient infrastructure and guiding targeted grid reinforcements.", "keywords": [ "Truck", "Probabilistic logic", "Grid", "Depot", "Transformer", "Public transport", "Scheduling (production processes)", "Load profile", "Population" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2032-6653/17/4/172/pdf?version=1774514952" }, { "id": "https://openalex.org/W7128779250", "doi": "10.5281/zenodo.18631297", "title": "mattiasingelstrom/hd-ev-charging-profiles: Charging Demand Profiles for Heavy-Duty Electric Trucks — Skåne, Sweden", "year": 2026, "publication_date": "2026-02-13", "type": "software", "language": null, "authors": [ "Mattias Ingelström" ], "first_author": "Mattias Ingelström", "venue": "Zenodo (CERN European Organization for Nuclear Research)", "publisher": "European Organization for Nuclear Research", "abstract": "Initial release — Reproducibility package Hourly charging demand profiles for heavy-duty electric trucks in the Skåne region of southern Sweden, derived from 78 iterations of a MATSim agent-based transport simulation. Contents Normalised profiles (fraction of daily energy, sum = 1.0) — reusable temporal shapes independent of fleet size Scaled MW curves — pre-scaled to simulation-default fleet sizes Absolute demand curves (kW) — with full percentile bands (P5–P95) Battery-size breakdowns — profiles for five battery-capacity bins (0–200 through 500–600 kWh) Self-contained Python plotting scripts — regenerate all figures or re-scale to custom scenarios Charging scenarios | Scenario | Description | |----------|-------------| | Public | En-route fast / opportunity charging (1,269 MWh/day, ~1,894 trucks) | | Depot | Optimised overnight charging with peak shaving (141.6 MWh/day, ~756 trucks) | How to use pip install pandas numpy matplotlib python [plot_normalized_profiles.py](http://_vscodecontentref_/0)", "keywords": [ "Python (programming language)", "Truck", "Percentile", "Scripting language", "Public transport", "Peak demand", "Travel time" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5281/zenodo.18631297" }, { "id": "https://openalex.org/W3212361331", "doi": "10.1016/j.ifacol.2021.08.011", "title": "Dynamic Multiple Depots Vehicle Routing in the Physical Internet context", "year": 2021, "publication_date": "2021-01-01", "type": "article", "language": "en", "authors": [ "Anirut Kantasa–ard", "Tarik Chargui", "Abdelghani Bekrar", "Abdessamad Ait El Cadi", "Yves Sallez" ], "first_author": "Anirut Kantasa–ard", "venue": "IFAC-PapersOnLine", "publisher": "Elsevier BV", "abstract": "This paper proposes Dynamic Multiple Depots Vehicle Routing (DMDVR) to explore the feasible solution of routing transportation between PI-hubs and retailers in the same cluster. The routing solution in this research is constructed by the daily forecasting demand of a commodity crop, Pineapple, from Thailand’s northern region. Each route is composed of a starting hub, the number of retailers, and an ending hub. The authors propose Mixed Integer Linear Programming (MILP) to construct the routes considering inventory and truck capacity constraints. Besides, another solution method is proposed by using a heuristic method named “Iterated Random Heuristic”. The empirical results are evaluated by using the total distribution cost and computational time. The routing transportation of this research is based on the daily delivery transportation from PI-hubs to retailers. The results show that Iterated Random Heuristic with Nearest Neighbor Search generates near-optimal solutions within a short computational time.", "keywords": [ "Iterated local search", "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Heuristic", "Context (archaeology)", "Mathematical optimization", "Truck", "Integer programming", "Operations research", "Local search (optimization)", "Mathematics" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ifacol.2021.08.011" }, { "id": "https://openalex.org/W4280585885", "doi": "10.23939/tt2022.01.038", "title": "Cross-docking cargo delivery routing for guaranteed minimum period", "year": 2022, "publication_date": "2022-05-19", "type": "article", "language": "en", "authors": [ "Myroslav Oliskevych", "Viktor Danchuk", "Oleksandr Mastykash" ], "first_author": "Myroslav Oliskevych", "venue": "Transport technologies", "publisher": null, "abstract": "The article is devoted to the problem of effective use of cross-docking as a technology of cargo delivery with increased time requirements, which allows to resolve the contradictions of guaranteed delivery time ensuring and the efficiency of the existing fleet of trucks. The process of delivery organization is considered as the ordering on the transport network of many discrete freight flows in the form of their phases. If qualitative and / or quantitative changes do not occur from phase to phase with the flow, then the tact of such flow is constant. However, cross-docking flows change the size of the band of moving goods. Cargo can be moved as intended by any group size, which, however, is limited by the maximum and minimum values. A two-stage algorithm for solving the problem has been developed. The transport network is represented as a graph. The content of the route search problem is optimization, as it consists of multiple selections from the initial graph of arcs in the presence of restrictions on input and output flows. One needs to replace every each edge of the graph with an arc of the forward or reverse direction, or remove this edge. The criterion for the optimal solution of the problem, which is applied, is the minimum guaranteed duration of delivery of goods throughout the set of specified freight flows. At the first stage of the algorithm, the search for the shortest paths in the graph is performed, along which every given cargo flow can pass. The first stage of optimization is a linear problem of integer programming, the dimension of which is not too large. The initial data of the second stage is freight flows matrix, which is obtained as a result of optimization in the first stage. The content of the second stage of the algorithm is the solution of the equation of the balance of discrete goods flows. The balance equation means that all flows entering each peak including the sources of cargo flows of this peak have an average intensity equal to the intensity of the outgoing cargo flows from each source peak, including runoff. Due to the studied dependencies between the individual phases of the delivery process on the example of a cargo carrier on the transport network of Ukraine, the formulated restrictions and boundary conditions, the possibility of guaranteed accurate solution of a complex problem is obtained. At the same time, the shortest routes were found, reloading points were identified as well as time parameters of operation and the degree of loading of cars. According to the results of the research, a threefold increase in the productivity of the fleet of road trains with a reduction in the guaranteed delivery time by 30%.", "keywords": [ "Mathematical optimization", "Computer science", "Truck", "Flow network", "Graph", "Maximum flow problem", "Operations research", "Mathematics", "Engineering", "Theoretical computer science" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://science.lpnu.ua/sites/default/files/journal-paper/2022/may/27922/5myroslavoliskevychviktordanchukoleksandrmastykash.pdf" }, { "id": "https://openalex.org/W4413913983", "doi": "10.1016/j.ejor.2025.08.057", "title": "The stochastic location-routing problem with parallel truck–drone operations for humanitarian aid delivery", "year": 2025, "publication_date": "2025-09-02", "type": "article", "language": "en", "authors": [ "Hannan Tureci-Isik", "Melih Çelik", "Ece Sancı" ], "first_author": "Hannan Tureci-Isik", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": "Timely response in the aftermath of a disaster is crucial to alleviate loss of life and suffering. Timeliness of relief may be hampered by road network disruptions caused by the disaster, such as damage to road segments or debris covering the roads. The use of drones simultaneously with trucks can potentially help overcome issues around network disruptions and achieve more timely delivery of post-disaster aid. In an effort to shed more light into this potential, we address the problem of network design for parallel truck–drone operations by depot location prior to the disaster and routing of the vehicles in its aftermath. We incorporate the uncertainty on network disruption by modelling this problem as a two-stage stochastic program, which proves computationally challenging to solve to optimality for real-life disaster scenarios. Consequently, we propose a tailored heuristic based on variable neighbourhood search to find high-quality solutions efficiently. Our computational results on randomly generated instances and a case study from the 2011 Van Earthquake in Turkiye demonstrate the effectiveness of the heuristic, the benefits of employing both trucks and drones, and the significance of accounting for uncertainties in pre-disaster planning. • Network design and for a parallel truck–drone routing to deliver humanitarian aid. • Considers uncertain travel times due to network vulnerability and latency objective. • Introduces a flow-based formulation for sparse networks lacking triangle inequality. • Develops a tailored VNS for scenario-specific depot location and routing. • Applies model on a case study to draw managerial insights.", "keywords": [ "Drone", "Vehicle routing problem", "Truck", "Computer science", "Routing (electronic design automation)", "Operations research", "Mathematical optimization", "Computer network", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2025.08.057" }, { "id": "https://openalex.org/W3194319731", "doi": "10.22116/jiems.2021.252150.1395", "title": "Developing a mathematical model for a multi-door cross-dock scheduling problem with human factors: A modified imperialist competitive algorithm", "year": 2021, "publication_date": "2021-07-01", "type": "article", "language": "en", "authors": [ "Iman Seyedi", "Maryam Hamedi", "Reza Tavakkoli-Moghadaam" ], "first_author": "Iman Seyedi", "venue": "Industrial Engineering and Management", "publisher": "Hilaris", "abstract": "This paper deals with optimizing the multi-door cross-docking scheduling problem for incoming and outgoing trucks. Contrary to previous studies, it first considers the simultaneous effects of learning and deteriorating on loading and unloading the jobs. A mixed-integer linear programming (MILP) model is developed for this problem, in which the basic truck scheduling problem in a cross-docking system is strongly considered as NP-hardness. Thus, in this paper, meta-heuristic algorithms namely genetic algorithm, imperialist competitive algorithm, and a new hybrid meta-heuristic algorithm, resulted from the principal component analysis (PCA) and an imperialist competitive algorithm (ICA) called PCICA are proposed and used. Finally, the numerical results obtained from meta-heuristic algorithms are examined using the relative percentage deviation and time criteria. Results show that the hybrid PCICA algorithm performs better than the other algorithms in terms of the solution quality. Computational results indicate when the learning rate increases, its decreasing effect on processing time will growth and the objective function value is improved. Finally, the sensitivity analysis also indicates when the deterioration rate is reduced, its incremental effect is decreased over time.", "keywords": [ "Imperialist competitive algorithm", "Computer science", "Algorithm", "Job shop scheduling", "Mathematical optimization", "Scheduling (production processes)", "Integer programming", "Mathematics", "Metaheuristic" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "http://jiems.icms.ac.ir/article_133508_d7d7ebe0d6025d8e73b88a7d62efe1a9.pdf" }, { "id": "https://openalex.org/W4394627581", "doi": "10.1109/tits.2024.3381933", "title": "Truck-Drone Hybrid Delivery Routing: A Mathematical Model and Micro- Evolutionary Algorithm", "year": 2024, "publication_date": "2024-04-09", "type": "article", "language": "en", "authors": [ "Jiang Bian", "Rui Song", "Shiwei He", "Jushang Chi" ], "first_author": "Jiang Bian", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "This study investigates a Feasibility-assured Mothership System (FAMS) model for truck-drone hybrid delivery. As a mothership system variant, it is considered to be able to bring benefits by using drones for low-cost short distance transportation. Besides, it depicts a scenario aligning closely with the current features of urban delivery services and adopts methods to increase drone utilization. Most importantly, the model addresses potential infeasibility resulting from assumptions in existing relevant literature. In this study, the FAMS is formulated as a mixed integer linear program (MILP) model and micro-evolutionary algorithm (MEA), a population-based algorithm that captures the structural characteristics of individuals in order to find high-quality solutions more efficiently, is proposed. The experimental results demonstrate the effectiveness of the algorithm. The performance of the two proposed crossover operators is analyzed as well. Furthermore, the cost efficiency of the FAMS under numerous situations including different truck-drone unit travel cost ratios and various combinations of drone technical features is confirmed.", "keywords": [ "Drone", "Truck", "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "Engineering", "Algorithm", "Computer network", "Aerospace engineering", "Biology" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2024.3381933" }, { "id": "https://openalex.org/W143091653", "doi": "10.5283/epub.10196", "title": "Neue Tabusuche-Heuristiken für die logistische Tourenplanung bei restringierendem Anhängereinsatz, mehreren Depots und Planungsperioden", "year": 2004, "publication_date": "2004-01-01", "type": "dissertation", "language": "de", "authors": [ "Stephan Scheuerer" ], "first_author": "Stephan Scheuerer", "venue": "University of Regensburg Publication Server (University of Regensburg)", "publisher": "University of Regensburg", "abstract": "Primäres Ziel dieser Arbeit war die Entwicklung neuer heuristischer Lösungsverfahren für die logistische Tourenplanung bei restringierendem Anhängereinsatz (engl. Truck and Trailer Routing Problem). Kennzeichnend für dieses kombinatorische Optimierungsproblem ist, dass Fahrzeuge einen Anhänger mitführen, jedoch ein Teil der Kunden nur ohne Anhänger angefahren werden kann. Dies erfordert das An- und Abkoppeln von Anhängern im Verlauf einer Fahrzeugroute. Dadurch stellt sich bei der Tourenplanung zugleich die Frage nach den optimalen Anhängerstellplätzen, nach der Anzahl an An- und Abkoppelvorgängen sowie nach der optimalen Bedienreihenfolge für die Kunden unterschiedlichen Typs auf einer Fahrzeugroute. Die Arbeit präsentiert für diese Problemstellung zwei neue Konstruktionsheuristiken sowie eine Tabusuche-Heuristik zur weiteren Lösungsverbesserung. Ein Vergleich auf bekannten Benchmarkproblemen verdeutlicht, dass die neuen Verfahren mit existierenden Algorithmen konkurrieren können. Die neue Tabusuche konnte zu allen 21 Benchmarkproblemen eine neue beste Lösung finden. Erstmals wurden im Rahmen dieser Arbeit auch zwei Erweiterungen des Tourenplanungsproblems bei restringierendem Anhängereinsatz betrachtet. Dies ist zum einen eine Erweiterung des Problems um mehrere Fahrzeug-Depots, zum anderen die Betrachtung eines mehrtägigen Planungshorizonts. Bei letzterem ist jedem Kunden eine Menge an gewünschten Bedienmustern zugeteilt, die jeweils bestimmen, an welchen Tagen des Planungshorizonts die Bedienung des Kunden zu erfolgen hat. Diese beiden Erweiterungen fügen dem zugrunde liegenden Tourenplanungsproblem bei restringierendem Anhängereinsatz eine zusätzliche Entscheidungsstufe hinzu, indem es zusätzlich eine optimale Zuordnung der Kunden zu den Depots bzw. ein optimales Bedienmuster für jeden Kunden zu bestimmen gilt. Für jedes dieser Probleme wurde ebenfalls eine Tabusuche-Heuristik entwickelt und auf existierenden und neuen Benchmarkproblemen getestet. Für die bekannten Benchmarkprobleme der Multi-Depot und periodischen Tourenplanung konnten neue beste Lösungen gefunden werden.", "keywords": [ "Humanities", "Engineering", "Art" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://epub.uni-regensburg.de/10196/1/Scheuerer_Stephan_Dissertation_April_2004.pdf" }, { "id": "https://openalex.org/W2010697626", "doi": "10.3182/20100701-2-pt-4011.00043", "title": "Petri Net Model and Mathematical Resolution for Cross Docking", "year": 2010, "publication_date": "2010-01-01", "type": "conference-paper", "language": "en", "authors": [ "Benoît Trouillet" ], "first_author": "Benoît Trouillet", "venue": "IFAC Proceedings Volumes", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "DOCK", "Petri net", "Pallet", "Computer science", "Solver", "Operations research", "Integer programming", "Engineering", "Distributed computing", "Algorithm", "Programming language" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3182/20100701-2-pt-4011.00043" }, { "id": "https://openalex.org/W4324124444", "doi": "10.52547/jamlu.19.4.37", "title": "Enhancing the Search Capability of the Imperialist Competitive Algorithm for Truck Scheduling Problem in the Cross-Docking System", "year": 2022, "publication_date": "2022-12-01", "type": "article", "language": "en", "authors": [ "Iman Seyedi", "Mohsen Hamedi", "Reza R. Tavakkoli-Moghaddam" ], "first_author": "Iman Seyedi", "venue": "مجله تحقیق در عملیات در کاربردهای آن ( ریاضی کاربردی ) - دانشگاه آزاد لاهیجان", "publisher": null, "abstract": "Enhancing the Search Capability of the Imperialist Competitive Algorithm for Truck Scheduling Problem in the Cross-Docking System", "keywords": [ "Imperialist competitive algorithm", "Truck", "Docking (animal)", "Computer science", "Scheduling (production processes)", "Job shop scheduling", "Mathematical optimization", "Algorithm", "Engineering", "Metaheuristic", "Mathematics", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://jamlu.liau.ac.ir/files/site1/user_files_088e30/iman_ie-A-11-1789-1-a8928bd.pdf" }, { "id": "https://openalex.org/W3011573950", "doi": "10.1016/j.trpro.2020.03.022", "title": "A procedure for optimizing hazardous materials transportation including road infrastructures’ characteristics and door-to-door attempted deliveries", "year": 2020, "publication_date": "2020-01-01", "type": "article", "language": "en", "authors": [ "Stefano Carrese", "Marialisa Nigro", "Luigi Pallante" ], "first_author": "Stefano Carrese", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "This study deals with downstream logistics of Liquefied Petroleum Gas (LPG) by tank trucks both at regional and urban level. The distribution problem is formulated as a capacitated Vehicle Routing Problem (VRP) with time windows. Its solution is based on a two steps procedure with the aim of maximizing the revenue of the logistic operator: 1) in the first step, the problem is solved at suburban level, where each delivery point represents a municipality in the study area. The employed objective function of the VRP has been conceived as to integrate the usual operating costs with aspects related to infrastructure characteristics of the used paths; 2) in the second step, door to door deliveries at urban level are attempted, taking into account the operating costs and the last delivery time for each potential client. The method has been applied in a real case study based in the city of Perugia, Italy. Sensitivity analysis considering different values for the parameters regulating the relative weights of the objective function components has been performed. Results show that the potential revenues for the operator can be doubled through the proposed optimization procedure. Moreover, explicitly taking into account that not all roads are suitable for vehicles transporting hazardous materials can increase the security of the distribution process, resulting in a service cost increase of just +1.4% with respect to extant conditions.", "keywords": [ "Truck", "Revenue", "Vehicle routing problem", "Transport engineering", "Liquefied petroleum gas", "Hazardous waste", "Routing (electronic design automation)", "Operations research", "Operator (biology)", "Computer science", "Service (business)", "Total cost" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146520301848/pdf" }, { "id": "https://openalex.org/W2990917582", "doi": "10.1136/bmjopen-2019-030175", "title": "Cluster randomised controlled trial to investigate the effectiveness and cost-effectiveness of a Structured Health Intervention For Truckers (the SHIFT study): a study protocol", "year": 2019, "publication_date": "2019-11-01", "type": "article", "language": "en", "authors": [ "Stacy A. Clemes", "Verónica Varela-Mato", "Fehmidah Munir", "Charlotte L. Edwardson", "Yuling Chen", "Mark Hamer", "Laura J. Gray", "Nishal Bhupendra Jaicim", "Gerry A. Richardson", "Vicki Johnson", "Jacqui Troughton", "Thomas E. Yates", "James A. King" ], "first_author": "Stacy A. Clemes", "venue": "BMJ Open", "publisher": "BMJ", "abstract": "INTRODUCTION: Heavy goods vehicle (HGV) drivers exhibit higher than nationally representative rates of obesity, and obesity-related comorbidities, in comparison to other occupational groups. Their working environments are not conducive to a healthy lifestyle, yet there has been limited attention to health promotion efforts. We have developed a Structured Health Intervention For Truckers (the SHIFT programme), a multicomponent, theory-driven, health-behaviour intervention targeting physical activity, diet and sitting in HGV drivers. This paper describes the protocol of a cluster randomised controlled trial designed to evaluate the effectiveness and cost-effectiveness of the SHIFT programme. METHODS AND ANALYSIS: HGV drivers will be recruited from a logistics company in the UK. Following baseline measurements, depots (clusters) will be randomised to either the SHIFT intervention or usual-care control arm (12 clusters in each, average cluster size 14 drivers). The 6-month SHIFT intervention includes a group-based interactive 6-hour education session, worksite champion support and equipment provision (including a Fitbit and resistance bands/balls to facilitate a 'cab workout'). Objectively measured total daily physical activity (steps/day) will be the primary outcome. Secondary outcomes include: objectively measured light-intensity physical activity and moderate-to-vigorous physical activity, sitting time, sleep quality, markers of adiposity, blood pressure and capillary blood markers (glycated haemoglobin, low-density lipoprotein-cholesterol, high-density lipoprotein-cholesterol). Self-report questionnaires will examine fruit and vegetable intake, psychosocial and work outcomes and mental health. Quality of life and resources used (eg, general practitioner visits) will also be assessed. Measures will be collected at baseline, 6 and 12 months and analysed according to a modified intention-to-treat principle. A full process evaluation and cost-effectiveness analysis will be conducted. ETHICS AND DISSEMINATION: Ethical approval was obtained from the Loughborough University Ethics Approvals Sub-Committee (reference: R17-P063). Study findings will be disseminated through publications in research and professional journals, through conference presentations and to relevant regional and national stakeholders via online media and at dissemination events. TRIAL REGISTRATION NUMBER: ISRCTN10483894.", "keywords": [ "Medicine", "Physical therapy", "Psychosocial", "Public health", "Quality of life (healthcare)", "Randomized controlled trial", "Cluster randomised controlled trial", "Gerontology", "Intervention (counseling)", "Nursing", "Psychiatry" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://bmjopen.bmj.com/content/bmjopen/9/11/e030175.full.pdf" }, { "id": "https://openalex.org/W4385560350", "doi": "10.2139/ssrn.4530365", "title": "Solution Algorithms for Dock Scheduling and Truck Sequencing in Cross-Docks: A Neural Branch-and-Price and a Metaheuristic", "year": 2023, "publication_date": "2023-01-01", "type": "preprint", "language": "en", "authors": [ "Rahimeh Neamatian Monemi", "Shahin Gelareh", "Nelson Maculan" ], "first_author": "Rahimeh Neamatian Monemi", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Metaheuristic", "Truck", "DOCK", "Computer science", "Vehicle routing problem", "Scheduling (production processes)", "Operations research", "Mathematical optimization", "Algorithm", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.4530365" }, { "id": "https://openalex.org/W4411757186", "doi": "10.5829/ije.2026.39.02b.16", "title": "The Cost and Time Objectives Minimization in Cross-Dock Truck Scheduling of Perishable Goods Considering Uncertainty", "year": 2025, "publication_date": "2025-06-28", "type": "article", "language": "en", "authors": [ "S. Khodashenas", "Zeinab Abtahi", "Rashed Sahraeian" ], "first_author": "S. Khodashenas", "venue": "International Journal of Engineering", "publisher": "Materials and Energy Research Center", "abstract": "This study optimizes truck scheduling for transporting perishable products considering demand uncertainty. The supply chain of perishable goods is complex due to the critical importance of quality to consumers and presents significant logistical distribution challenges that must be managed effectively. The approach proposed here uses cross-docking, a popular strategy that reduces inventory levels and shortens delivery times. We develop a non-deterministic bi-objective mathematical programming model to minimize cost and time objectives. Minimizing product quality degradation is implicitly included in the cost-related objective function. The model also considers the uncertainty. Also, in the proposed model, which is defined in a multi-period environment, the types of trucks and the loading and unloading times required for each type of product are specified. Considering these parameters together distinguishes this model from existing cross-docking models. For small-sized problems, CPLEX Optimizer provides accurate solutions. For large problems, NSGA-II is used. Comparing CPLEX and NSGA-II on small problems shows no significant performance difference. CPLEX is superior in exact solutions, while NSGA-II is better at considering different alternatives in multi-objective scenarios, showing how they complement each other in optimization. Input parameters are optimized using the Taguchi method to evaluate their impact on NSGA-II. Sensitivity analysis showed that key parameters significantly affect delay and cost, contributing to 22-25% and 12-15% variations, respectively. It is worth noting that increasing product variety has the most significant impact on the total delay weight. Overall, this model increases service flexibility, reduces wasted time, improves customer satisfaction and service level, and ultimately increases profitability.", "keywords": [ "DOCK", "Truck", "Minification", "Scheduling (production processes)", "Computer science", "Operations research", "Operations management", "Business", "Engineering", "Automotive engineering", "Marine engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.ije.ir/article_217883_c6b3318c184b46339f4f208ec75a4b89.pdf" }, { "id": "https://openalex.org/W3027189506", "doi": null, "title": "Cross dock scheduling under multi-period condition", "year": 2019, "publication_date": "2019-11-01", "type": "article", "language": "en", "authors": [ "S.M.T. Fatemi Ghomi", "Sajjad Rahmanzadeh", "Mohsen S. Sajadieh" ], "first_author": "S.M.T. Fatemi Ghomi", "venue": "Journal of industrial and systems engineering.", "publisher": null, "abstract": "This paper proposes a truck scheduling model in a cross dock system under multi-period, multi-commodity condition with fixed outbound departures. In an operational truck scheduling problem, outbound trucks leave the cross dock terminals at predetermined times and delayed loads are kept as inventory that are sent at the next period (a time slot in a day). The proposed model optimizes the inbound truck scheduling problem through the minimizing cross dock operational costs. An accelerated Benders decomposition technique based on Covering Cut Bundle (CCB) strategy and a heuristic approach are developed to solve the model. Finally, numerical analysis introduces the sensitivity of the input parameters to the objective value.", "keywords": [ "DOCK", "Truck", "Computer science", "Scheduling (production processes)", "Operations research", "Bundle", "Mathematical optimization", "Job shop scheduling", "Mathematics", "Automotive engineering", "Engineering", "Schedule" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.jise.ir/article_103588_d78c08bcd75aad91202a0d58e00be393.pdf" }, { "id": "https://openalex.org/W4386987302", "doi": "10.1016/j.ijdrr.2023.104027", "title": "A multi-agency coordination resource allocation and routing decision-making problem: A coordinated truck-and-drone DSS for improved wildfire detection coverage", "year": 2023, "publication_date": "2023-09-23", "type": "article", "language": "en", "authors": [ "Maryam Momeni", "Hamed Soleimani", "Shahrooz Shahparvari", "Behrouz Afshar-Nadjafi" ], "first_author": "Maryam Momeni", "venue": "International Journal of Disaster Risk Reduction", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Regret", "Drone", "Truck", "Column generation", "Operations research", "Computer science", "Decision support system", "Mathematical optimization", "Engineering", "Automotive engineering" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://figshare.com/articles/journal_contribution/A_multi-agency_coordination_resource_allocation_and_routing_decision-making_problem_A_coordinated_truck-and-drone_DSS_for_improved_wildfire_detection_coverage/27578328" }, { "id": "https://openalex.org/W2138696651", "doi": "10.1109/soli.2010.5551586", "title": "Two efficient constructive heuristics for scheduling trucks at crossdocking terminals", "year": 2010, "publication_date": "2010-07-01", "type": "conference-paper", "language": "en", "authors": [ "Mojtaba Shakeri", "Malcolm Yoke Hean Low", "Zhengping Li", "Eng Wah Lee" ], "first_author": "Mojtaba Shakeri", "venue": null, "publisher": null, "abstract": "This paper studies an important crossdocking planning operation which is the scheduling of trucks at cross-docking terminals. The operation consists of two optimization problems: truck sequencing and door assignment. The problems are integrated and formulated as a machine scheduling problem. Two constructive heuristics are developed to address truck scheduling: a dependency ranking (DR) heuristic for truck sequencing and a machine fitness (MF) heuristic for door assignment. The solutions generated by the heuristics are compared with those of an MIP model formulated for the same problem. Considering the constructive nature of the proposed heuristics where no optimization technique has been employed, the quality of results compared to that of the CPLEX solver is quite promising. Also, the heuristics maintain scalability in solution time as the problem size increases to large scales.", "keywords": [ "Heuristics", "Job shop scheduling", "Computer science", "Scheduling (production processes)", "Solver", "Constructive", "Truck", "Mathematical optimization", "Scalability", "Engineering", "Mathematics", "Computer network" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/soli.2010.5551586" }, { "id": "https://openalex.org/W4392138810", "doi": "10.1177/03611981231225431", "title": "Integrated Forward and Reverse Cross-Docking with Vehicle Routing and Scheduling Under the Uncertainty of Inspection Results: A Genetic-Mathematic Algorithm", "year": 2024, "publication_date": "2024-02-23", "type": "article", "language": "en", "authors": [ "Ali Rahbari", "Mohammad Mahdi Nasiri", "Fariborz Jolai", "Dinçer Konur" ], "first_author": "Ali Rahbari", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "Despite the recognized advantages of cross-docking in forward logistics, very few studies have investigated reverse cross-docking, and these studies do not consider the operational uncertainties of returned products in the reverse flow, which is required in practice. This paper introduces a vehicle routing and scheduling problem for the integration of forward and reverse logistics, in which the cross-docking facility is employed as (i) the distribution center in forward flow and (ii) the collection and dispatching center of returned products in reverse flow. We present two modes based on the inspection point: (i) retailer site or (ii) cross-dock. A deterministic mixed integer linear programming model is presented for the retailer-site inspection mode to minimize the total operational costs. For the second mode, a robust optimization counterpart of the modified deterministic model is formulated to account for the uncertainties arising from the inspection results revealed at the cross-dock. A genetic-mathematic algorithm is proposed to solve the large-sized instances. Through numerical studies, we evaluated the performance of the algorithm and demonstrated cost reductions and truck utilization improvements as benefits of integration. Moreover, in sensitivity analyses using a quasi-real case of a personal electronic device supply chain, and employing simulation, the price of robustness of the second model was evaluated by considering various budget sets, which justified the full robustness and application of the cross-dock as the inspection point in the closed-loop supply chain.", "keywords": [ "Robustness (evolution)", "Supply chain", "Reverse logistics", "Scheduling (production processes)", "Computer science", "Integer programming", "Vehicle routing problem", "Genetic algorithm", "Supply chain management", "Mathematical optimization", "Algorithm", "Operations research" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1177/03611981231225431" }, { "id": "https://openalex.org/W3047992796", "doi": "10.1051/ro/2020087", "title": "Variable neighborhood search based algorithms for crossdock truck assignment", "year": 2020, "publication_date": "2020-08-05", "type": "article", "language": "en", "authors": [ "Cécilia Daquin", "Hamid Allaoui", "Gilles Gonçalves", "Tienté Hsu" ], "first_author": "Cécilia Daquin", "venue": "RAIRO - Operations Research", "publisher": "EDP Sciences", "abstract": "To operate a cross-dock successfully, an efficient assignment of trucks to docks is one of the key decisions. In this paper, we are interested in the cross-dock assignment of trucks to docks problem, where the number of trucks exceeds the number of docks. The objective is to minimize the cost of transferring goods within the cross-dock while avoiding delivery penalties. This problem being NP-hard, we use Variable Neighborhood Search metaheurisitc (VNS) to solve it approximately. More specifically, we conduct a structured empirical study to compare several VNS configurations and to find which is/are the most effective for this cross-dock problem. In this work, first we analyze the way the search strategy and the neighborhood operators can be combined in a VNS framework according to their efficiency within a local search. Then the best configurations are tested within three VNS variants, namely Basic VNS (BVNS), General VNS (GVNS) using Basic VND (B-VND) and GVNS using Union VND (U-VND) according to the number of used operators and the order of applying these operators. Finally we evaluate the influence of the stopping criterion within these variants. Some significant differences among these configurations are shown and illustrated by conducting the Friedman test.", "keywords": [ "Truck", "DOCK", "Variable neighborhood search", "Variable (mathematics)", "Computer science", "Key (lock)", "Mathematical optimization", "Algorithm", "Mathematics", "Engineering", "Metaheuristic" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.rairo-ro.org/articles/ro/pdf/2021/01/ro190317.pdf" }, { "id": "https://openalex.org/W4410278172", "doi": "10.1016/j.isci.2025.112629", "title": "From diesel to electric: potential of drayage trucks transition in Southern California", "year": 2025, "publication_date": "2025-05-11", "type": "article", "language": "en", "authors": [ "Guoliang Feng", "Craig Ross Rindt", "Stephen G. Ritchie" ], "first_author": "Guoliang Feng", "venue": "iScience", "publisher": "Cell Press", "abstract": "Battery electric drayage trucks (BEDTs) offer an opportunity to decarbonize the drayage fleets. This article analyzes the potential of BEDTs using data on 1,051 drayage trucks in Southern California. A methodology is developed to evaluate energy and charger requirements across singleton, small, and large fleets. This study assesses the fraction of trucks that can be electrified using battery sizes from 100 to 1000 kWh. Our analysis reveals decreasing uncertainties for fleet electrification with increasing battery size and with offsite charging involved. Combining an 800-kWh battery with both depot and offsite charging using 350 kW chargers, approximately 95% of diesel drayage trucks can be electrified. However, singleton fleets demonstrate the lowest performance and experience substantial improvements through offsite charging. Preferred locations for depot and off-site chargers are identified near the Ports of Long Beach and Los Angeles, and the City of Ontario. These results provide essential guidance for electrifying drayage trucks.", "keywords": [ "Truck", "Diesel fuel", "Environmental science", "Chemistry", "Engineering", "Automotive engineering" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.isci.2025.112629" }, { "id": "https://openalex.org/W2088671450", "doi": "10.2495/ut060201", "title": "A collaborative transportation proposal for urban deliveries: costs and environmental savings", "year": 2006, "publication_date": "2006-06-27", "type": "conference-paper", "language": "en", "authors": [ "Douglas Tacla", "Orlando Fontes Lima", "Rui Carlos Botter" ], "first_author": "Douglas Tacla", "venue": "WIT transactions on the built environment", "publisher": "WIT Press", "abstract": "What is the best way to make deliveries in urban areas: with big trucks or small cargo vehicles?Which one is better if we think about environmental problems and traffic?Just one medium-sized truck can substitute fifteen small vehicles.A Collaborative transportation plan and operation between shippers, carriers and customers could solve this problem, but only a complete collaboration could do it.Fifteen small vehicles need fifteen different time slots to unload, with fifteen drivers and fifteen engines throwing out smoke and money in the air.This paper presents a proposal to plan collaborative transportation between big players (carrier, shippers and customers) to optimize transportation using trucks with cargo consolidated between various shippers going to one destination (a supermarket for example).The methodology used is a combination between collaborative planning (CPFR) and a mathematical model to optimize the fleet.This study brings the CPFR concept, in a practical approach, to urban deliveries, trying not to contribute just another case for optimization, but to lesson the environmental and traffic impacts on highly populated cities.The paper also presents a case study creating a great opportunity for the development of a methodology capable of contributing to the framing of collaborative transportation, as well as to alternatives, which mitigate issues caused by metropolitan cargo transportation.The case study is a real case concerning one of the biggest retail companies in the world, the Distribution Center in Brasilia (BDC), Brazil.The database has 18,314 lines with cargoes, trucks, information of receipt, goods and invoices.", "keywords": [ "Truck", "Metropolitan area", "Transport engineering", "Plan (archaeology)", "Transportation planning", "Receipt", "Traffic management", "Business", "Computer science", "Operations research", "Engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.witpress.com/Secure/elibrary/papers/UT06/UT06020FU1.pdf" }, { "id": "https://openalex.org/W2887031113", "doi": "10.1049/iet-its.2018.0083", "title": "INTRALOG – intelligent autonomous truck applications in logistics; single and double articulated autonomous rearward docking on DCs", "year": 2018, "publication_date": "2018-07-30", "type": "article", "language": "en", "authors": [ "Rakshith Kusumakar", "Lejo Buning", "Frank Rieck", "Peter C. Schuur", "Frans Tillema" ], "first_author": "Rakshith Kusumakar", "venue": "IET Intelligent Transport Systems", "publisher": "Institution of Engineering and Technology", "abstract": "Vehicle automation opens opportunities toward the improvement of people, planet, profit value in applications on distribution centres (DCs). Despite vision and drive for innovation in logistics, the lack of knowledge prevents the application of autonomous applications. Intelligent Truck Applications in Logistics (INTRALOG) contributes to this deficit and generates valuable insights for a future application in public environments. Current operational automated guided truck applications are bound to fixed infrastructure and do neither operate in the public domain nor offer opportunities to do so. Nowadays, in‐vehicle intelligent systems are focused on driver support, opening opportunities such as truck platooning. INTRALOG cross‐borders on DCs in relatively low‐complex traffic environment, bridging the gap between autonomous driving in the public domain. The multi‐agent system developed within INTRALOG aligns logistical movements on DCs, controlling single or double articulated container trailers (longer and heavier vehicle) between the public parking area and cross‐docks. This study elaborates on the experiments on automated manoeuvring on a DC with single (SAVs) and double articulated vehicles (DAVs). The experiments comply with business requirements, e.g. manoeuvrability, time to dock and positioning accuracy. The research focuses on the effects of these aspects and control strategies of SAVs and DAVs.", "keywords": [ "Truck", "Docking (animal)", "Computer science", "Automotive engineering", "Engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://onlinelibrary.wiley.com/doi/pdfdirect/10.1049/iet-its.2018.0083" }, { "id": "https://openalex.org/W3212497734", "doi": "10.2139/ssrn.3913875", "title": "Multi-Depot Vehicle Fleet Planning with Trucks and Aerial Drones", "year": 2021, "publication_date": "2021-01-01", "type": "preprint", "language": "en", "authors": [ "Alexander Rave", "Pirmin Fontaine", "Heinrich C. Kuhn" ], "first_author": "Alexander Rave", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Truck", "Drone", "Depot", "Aeronautics", "Fleet management", "Transport engineering", "Engineering", "Automotive engineering", "Geography", "Archaeology" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.3913875" } ]