[ { "id": "https://openalex.org/W2351039256", "doi": null, "title": "Application of cultural algorithm in cross-docking scheduling", "year": 2013, "publication_date": "2013-01-01", "type": "article", "language": "en", "authors": [ "Zhiying Zhang" ], "first_author": "Zhiying Zhang", "venue": "Journal of Computer Applications", "publisher": "Science Press", "abstract": "This paper studied on the operational scheduling problem in a cross-docking center of a single receiving and a single shipping door with finite temporary storage.A dynamic programming model was built with the objective to minimize the costs including additional handing,temporary storage and truck replacement cost.A cultural algorithm with two layer evolutionary mechanism was proposed to solve the problem.The evolution of population space adopted genetic algorithm,and the belief space received good individual from population space to form knowledge which was used to guide evolution in turn.Numerical experiments under small and big scale situations prove the validity of proposed cultural algorithm.", "keywords": [ "Computer science", "Mathematical optimization", "Scheduling (production processes)", "Cultural algorithm", "Population", "Truck", "Genetic algorithm", "Algorithm", "Population-based incremental learning", "Mathematics", "Engineering", "Machine learning" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://en.cnki.com.cn/Article_en/CJFDTOTAL-JSJY201304021.htm" }, { "id": "https://openalex.org/W90654269", "doi": null, "title": "Efficient algorithms for various supply chain problems", "year": 2000, "publication_date": "2000-01-01", "type": "article", "language": "en", "authors": [ "David Simchi‐Levi", "Zuo‐Jun Max Shen" ], "first_author": "David Simchi‐Levi", "venue": null, "publisher": null, "abstract": "In this thesis, we develop and analyze heuristic algorithms for several supply chain problems. We focus on two important models, the first one deals with coordinating inventory control and transportation policies, and the second one is a joint location-inventory model. \r\nWe analyze the problem faced by companies that rely on TL (Truck-Load) and LTL (Less-than-Truck-Load) carriers for the distribution of products across their supply chains. Our goal is to design simple inventory policies and transportation strategies that minimize system-wide cost by taking advantage of quantity discounts in the transportation cost structures. \r\nThe thesis begins with a discussion of a celebrated inventory problem, the Single-item Economic Lot-Sizing problem, with a special cost structure—the modified all-unit discount structure. We prove that the problem is NP-hard. The effectiveness of Zero-Inventory-Ordering (ZIO) policies is demonstrated both analytically and empirically. \r\nWe then extend our analysis to the Single-Warehouse Multi-Retailer model in which the warehouse serves as a cross-dock facility. We show that there exists a ZIO policy whose total cost is no more than 4/3 times the optimal cost. Furthermore, if the transportation cost function does not vary over time, then we can find a ZIO policy whose cost is no more than 5.6/4.6 times the optimal cost. We propose two algorithms to find an effective ZIO policy. Finally, we extend the worst-case results to systems in which the warehouse does hold inventory. \r\nThe last part of the thesis deals with a joint location-inventory problem involving a single supplier and multiple retailers who face random demands. Some amount of safety stock must be maintained to achieve suitable service levels. However, risk-pooling benefits may be achieved by allowing some retailers to serve as distribution centers for other retailers. The problem is to determine which retailers should serve as distribution centers and how to allocate the other retailers to the distribution centers. We formulate this problem as a set-covering integer-programming model. The pricing problem that must be solved as part of the column generation algorithm for the set-covering model involves a non-linear term. We show how this pricing problem can be solved efficiently.", "keywords": [ "Supply chain", "Truck", "Heuristic", "Computer science", "Inventory control", "Holding cost", "Operations research", "Focus (optics)", "Total cost", "Sizing", "Relevant cost", "Cost structure" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://dl.acm.org/citation.cfm?id=932729" }, { "id": "https://openalex.org/W2142508628", "doi": "10.1109/icsmc.2000.885014", "title": "A method for solving nested combinatorial optimization problems - a case of optimizing a large-scale distribution network", "year": 2002, "publication_date": "2002-11-07", "type": "conference-paper", "language": "en", "authors": [ "Takashi Onoyama", "Sen Kubota", "Kazuko Oyanagi", "Setsuo Tsuruta" ], "first_author": "Takashi Onoyama", "venue": null, "publisher": null, "abstract": "The optimization of a large-scale distribution network is considered to be a nested combinatorial problem consisting of the following steps: (1) the decision about part delivery volume per part manufacturer; (2) the decision about depots and trucks for the transportation of parts; and (3) the generation of delivery routes for each truck. In such a nested combinatorial problem, a high-level and mathematically strict optimization is desirable as the first step. In addition, at each step, human multi-sided inspection is desired, which requires interactive simulation. Thus, for the first step, a method using linear programming (LP) is proposed. For the second and third steps, a method using a genetic algorithm (GA) is proposed. The latter guarantees interactive responsiveness and realizes expert-level accuracy, through enabling the solution of 1000 mid-scale traveling salesman problems (TSPs) for a distribution network within 30 seconds and within a 3% error. Experimental results proved that the proposed method enables the optimization of a nationwide large-scale distribution network.", "keywords": [ "Travelling salesman problem", "Truck", "Computer science", "Mathematical optimization", "Scale (ratio)", "Linear programming", "Genetic algorithm", "Nested loop join", "Estimation of distribution algorithm", "Optimization problem", "Combinatorial optimization", "Distribution (mathematics)" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/icsmc.2000.885014" }, { "id": "https://openalex.org/W4411000973", "doi": "10.3390/futuretransp5020065", "title": "Green Last-Mile Delivery: Adapting Beverage Distribution to Low Emission Urban Areas", "year": 2025, "publication_date": "2025-06-03", "type": "article", "language": "en", "authors": [ "Alessandro Giordano", "Panayotis Christidis" ], "first_author": "Alessandro Giordano", "venue": "Future Transportation", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Electrifying urban last-mile logistics is an important step towards reducing carbon emissions which requires replacing conventional vehicles with low-carbon alternatives that offer comparable operational and cost characteristics. This study presents a methodology for evaluating the feasibility of electrifying an urban delivery fleet, using data from a major beverage company in Seville as a case study. Applying a fleet and route optimization algorithm for various vehicle combinations, we demonstrate that emerging electric vehicle options, combined with a redesigned fleet mix and an optimized routing, can already enable cost-efficient electrification of distribution activities in the city centre. Furthermore, our analysis suggests that full electrification of the company’s local distribution network may be possible by 2030, depending on the availability of larger electric trucks. Our results show that currently available electric vehicles can fully substitute conventional options in the case study context, with higher capital costs offset by lower energy costs in most cases. The electrification of urban logistics can yield significant environmental benefits, particularly if powered by a clean energy mix.", "keywords": [ "Mile", "Last mile (transportation)", "Distribution (mathematics)", "Environmental science", "Geography", "Mathematics" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2673-7590/5/2/65/pdf?version=1748936815" }, { "id": "https://openalex.org/W7171294660", "doi": "10.6084/m9.figshare.33088136.v1", "title": "Research Data and Source Code for Deep Reinforcement Learning for Noise-Aware Truck-Drone Collaborative Routing in Urban Delivery", "year": 2026, "publication_date": "2026-07-26", "type": "dataset", "language": null, "authors": [ "Tianyi Zheng" ], "first_author": "Tianyi Zheng", "venue": "Figshare", "publisher": "Figshare (United Kingdom)", "abstract": "This dataset provides the experimental instances, per-seed results, training records, urban-morphology generalization data, and Python source code supporting the study “Deep Reinforcement Learning for Noise-Aware Truck-Drone Collaborative Routing in Urban Delivery.”The released main results cover nine scenarios combining UAV noise thresholds of 50, 55, and 60 dB with 30, 60, and 80 customers. Each scenario contains 15 fixed test instances evaluated using the proposed dual-layer DQN, a genetic algorithm with a UAV heuristic (GA-H), an ant colony optimization algorithm with a UAV heuristic (ACO-H), and a problem-specific truck-UAV heuristic (H-TUAV). Per-seed summary tables and route-level decision records are provided.Training histories, configurations, convergence plots, and best checkpoints are included for the 55 dB scenarios. Urban-morphology generalization results are provided for suburban, typical urban, and high-rise urban environments at 55 dB with 60 customers. The source code supports all twelve noise-threshold and customer-scale combinations, although the 15-customer instances and results are not included in this release. Reproduction instructions, a data dictionary, and SHA-256 checksums are also provided.", "keywords": [ "Reinforcement learning", "Heuristic", "Generalization", "Source code", "Convergence (economics)", "Python (programming language)", "Code (set theory)", "Ant colony optimization algorithms", "Routing (electronic design automation)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.6084/m9.figshare.33088136.v1" }, { "id": "https://openalex.org/W2055728244", "doi": "10.1080/03081069908717642", "title": "On modes, nodes and networks: technological and spatial conditions for a breakthrough towards multimodal terminals and networks of freight transport in Europe", "year": 1999, "publication_date": "1999-12-01", "type": "article", "language": "en", "authors": [ "Hugo Priemus" ], "first_author": "Hugo Priemus", "venue": "Transportation Planning and Technology", "publisher": "Taylor & Francis", "abstract": "The market share of trucks in European freight transport is still growing. Avoiding road congestion and other environmental reasons makes a modal shift towards barge, train and pipes necessary. This shift entails much more than the substitution of truck kilometres by train or ship kilometres. First, trains and ships do not usually provide door‐to‐door transport services. A transhipment of freight is necessary to create intermodal logistic chains. Second, transhipment usually entails high costs and loss of time. There are, however, encouraging developments: strategically located multimodal terminals can efficiently tranship freight from one mode to another, operating 24 h a day. This transhipment can be implemented in an automated, robotized manner. Such technological innovations provide terminals with a promising future. Third, freight flows may be too thin to guarantee a satisfactory loading efficiency. The solution can be found by rearranging logistic chains to bundle freight and achieve thicker freight flows. This contribution describes — from a Dutch perspective — current problems of multi‐modality in European freight transport and some promising developments concerning terminals and networks. A technological and organizational breakthrough towards multimodality in freight transport is anticipated. This implies a change in the spatial configuration of freight flows and multimodal terminals along with the optimal choice of a combination of modes. This paper indicates an optimalization problem on a European scale, aiming at the minimization of private costs and a reduction of environmental costs.", "keywords": [ "Train", "Truck", "Multimodal transport", "Transport engineering", "Traffic management", "Rail freight transport", "Freight trains", "Computer science", "Operations research", "Engineering" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/03081069908717642" }, { "id": "https://openalex.org/W2350970564", "doi": null, "title": "Operational scheduling model and algorithms of cross-docking", "year": 2013, "publication_date": "2013-01-01", "type": "article", "language": "en", "authors": [ "Mao Dao-xia" ], "first_author": "Mao Dao-xia", "venue": "Journal of Guangxi University", "publisher": "Guangxi University", "abstract": "To study the operational scheduling problem of a cross-docking center with finite temporary storage,a mathematical model was presented with the objective to minimize temporary storage cost,additional handling cost and truck replacement cost. Both branch and bound algorithm( BB)and a hybrid meta-heuristic of greedy algorithm and genetic algorithm were proposed to solve the problem accurately or approximately. Numerical experiments under small and big scale situations show that BB can obtain optimal solution for small scale problems while it is difficult to obtain optimal solution in a short time for large ones; the minimum and the maximum of result error between hybrid meta-heuristic and BB are 0 and 0. 58% respectively under small scale situation,while under big scale situation the calculating results of hybrid meta-heuristic is better than that of BB within the given 1 800 seconds and the biggest gap between them run up to 7. 16%. This indicates that the proposed hybrid meta-heuristic is effective.", "keywords": [ "Mathematical optimization", "Greedy algorithm", "Meta heuristic", "Computer science", "Scheduling (production processes)", "Algorithm", "Heuristic", "Genetic algorithm", "Mathematics" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://en.cnki.com.cn/Article_en/CJFDTOTAL-GXKZ201305009.htm" }, { "id": "https://openalex.org/W3004274400", "doi": "10.7494/dmms.2019.13.1-2.3470", "title": "A MILP Model for the Municipal Solid Waste Selective Collection Routing Problem", "year": 2020, "publication_date": "2020-01-28", "type": "article", "language": "en", "authors": [ "Antoni Korcyl", "Katarzyna Zofia Gdowska", "Roger Książek" ], "first_author": "Antoni Korcyl", "venue": "Decision Making in Manufacturing and Services", "publisher": "AGH University of Science and Technology", "abstract": "Nowadays, selective solid waste management in the European Union belongs to important responsibilities of municipalities. In Solid Waste Management (SWM) the main operational task is to set a schedule for solid waste collection and to find optimal routes for garbage trucks, so that the total costs of the solid waste collection service can be minimized, subject to a series of constraints which not only guarantee the fulfillment of the SWM’s obligations but also ensure the desirable quality level of that service. The optimization in garbage truck routing belongs to so called rich Vehicle Routing Problems as it aims to cover the following constraints: pickup nodes (clients) must be visited during their predefined time windows; the number and capacity of depots and specialized sorting units cannot be exceeded; each garbage truck can be assigned to at most one depot; each route should be dedicated to collecting one type of segregated solid waste, and the route must be served by a garbage truck which can collect that type of solid waste; the availability of garbage trucks and their drivers must be respected; each garbage truck must be drained at a specialized sorting unit before going back to the depot. This paper contributes a newly developed Mixed-Integer Programming (MIP) model for the Municipal Solid Waste Selective Collection Routing Problem (MSWSCRP) with time windows, a limited heterogeneous fleet, and different types of segregated solid waste to be collected separately. Results obtained for solving small-sized instances of the MSWSCRP are reported.", "keywords": [ "Truck", "Garbage", "Garbage collection", "Municipal solid waste", "Vehicle routing problem", "Waste collection", "Computer science", "Operations research", "Integer programming", "Sorting", "Waste management", "Transport engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.7494/dmms.2019.13.1-2.3470" }, { "id": "https://openalex.org/W2905312192", "doi": "10.1007/978-3-030-05054-2_45", "title": "SDVRP-Based Reposition Routing in Bike-Sharing System", "year": 2018, "publication_date": "2018-01-01", "type": "conference-paper", "language": "en", "authors": [ "Zengyi Han", "Yongjian Yang", "Yunpeng Jiang", "Wenbin Liu", "En Wang" ], "first_author": "Zengyi Han", "venue": "Lecture notes in computer science", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Computer science", "Routing (electronic design automation)", "Computer network", "Computer security", "World Wide Web" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-030-05054-2_45" }, { "id": "https://openalex.org/W3126487794", "doi": "10.1007/s12182-021-00551-4", "title": "MILP formulations for highway petrol station replenishment in initiative distribution mode", "year": 2021, "publication_date": "2021-02-09", "type": "article", "language": "en", "authors": [ "Xintong Wei", "Qi Lin Liao", "Haoran Zhang", "Yongtu Liang", "Bohong Wang", "Ning Xu", "Meng Yuan" ], "first_author": "Xintong Wei", "venue": "Petroleum Science", "publisher": "Elsevier BV", "abstract": "Abstract To investigate highway petrol station replenishment in initiative distribution mode, this paper develops a mixed-integer linear programming (MILP) model with minimal operational costs that includes loading costs, unloading costs, transport costs and the costs caused by unpunctual distribution. Based on discrete representation, the working day is divided into equal time intervals, and the truck distribution process is decomposed into a pair of tasks including driving, standby, rest, loading and unloading. Each truck must execute one task during a single interval, and the currently executing task is closely related to the preceding and subsequent tasks. By accounting for predictive time-varying sales at petrol stations, real-time road congestion and a series of operational constraints, the proposed model produces the optimal truck dispatch, namely, a detailed task assignment for all trucks during each time interval. The model is tested on a real-world case of a replenishment system comprising eight highway petrol stations, one depot, one garage and eight trucks to demonstrate its applicability and accuracy.", "keywords": [ "Truck", "Interval (graph theory)", "Task (project management)", "Gasoline", "Mode (computer interface)", "Transport engineering", "Linear programming", "Process (computing)", "Integer programming", "Engineering", "Distribution (mathematics)", "Operations research" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s12182-021-00551-4.pdf" }, { "id": "https://openalex.org/W2587617414", "doi": "10.1023/a:1007599307171", "title": null, "year": 1999, "publication_date": "1999-01-01", "type": "article", "language": null, "authors": [ "René B.M. de Koster", "EDO VAN DER POORT" ], "first_author": "René B.M. de Koster", "venue": "IIE Transactions", "publisher": "Taylor & Francis", "abstract": null, "keywords": [ "Computer science", "Business" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1023/a:1007599307171" }, { "id": "https://openalex.org/W4126631", "doi": null, "title": "An Economic Feasibility Study of Short Sea Shipping Including the Estimation of Externalities with Fuzzy Logic.", "year": 2009, "publication_date": "2009-01-01", "type": "dissertation", "language": "en", "authors": [ "Athanasios Denisis" ], "first_author": "Athanasios Denisis", "venue": "Deep Blue (University of Michigan)", "publisher": "University of Michigan", "abstract": "The continuing growth of freight transportation has placed significant stress on U.S. and European transportation networks. The dominance of trucking as the main mode of domestic general cargo transportation has caused environmental and societal problems, such as traffic congestion, air pollution, highway accidents, noise, and increased energy consumption. Using inland and coastal waterways, short sea shipping (SSS) can alleviate these problems. SSS can provide efficient door-to-door transportation as part of an intermodal system, where ships perform the long-haul and trucks the short haul cargo collection and distribution. This dissertation examines the economic feasibility of SSS. The environmental and societal advantages of SSS over competing modes are translated into lower external costs. External costs or externalities are the hidden costs not reflected in transportation prices. This non-inclusion is considered a market failure by economists. Estimating their monetary value is a challenging task. There is an inherent subjectivity, imprecision, and vagueness in current external cost valuation methods. This dissertation addresses this vagueness and imprecision of externalities using fuzzy logic. Fuzzy logic treats subjectivity with mathematical rigor. Several factors that determine the impact level of transportation externalities are modeled as fuzzy input variables. The outputs are the damage costs of major air pollutants and the external costs of traffic congestion. A fuzzy inference system can provide site-specific monetary estimation for these externalities under defined conditions, instead of average values. The results show that SSS has great potential for further improving its environmental performance by lowering ship emissions at ports, where most of its external costs occur, by implementing procedures, such as “cold ironing.” The dissertation assesses the feasibility and competitiveness of SSS, in comparison to the all-truck mode, in two realistic cases of prospective short sea operations along the U.S. East Coast. SSS is highly competitive, due to its significant energy efficiencies. Furthermore, its environmental performance, in terms of monetary impact of emissions is superior, due to location. Combining the internal costs with the external cost estimates, the two case studies demonstrate the fair pricing principle in freight transportation, where prices are based on the full social cost of a transportation mode.", "keywords": [ "Externality", "Fuzzy logic", "Estimation", "Economics", "Computer science", "Operations research", "Engineering", "Microeconomics", "Artificial intelligence", "Management" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/2027.42/62275" }, { "id": "https://openalex.org/W2887907809", "doi": "10.1016/j.trb.2018.08.001", "title": "Load balance recovery for multi-drop distribution problems: A mixed integer linear programming approach", "year": 2018, "publication_date": "2018-08-11", "type": "article", "language": "en", "authors": [ "Elsa Silva", "Antonio Galrao Ramos", "José Fernando Oliveira" ], "first_author": "Elsa Silva", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Integer programming", "Container (type theory)", "Computer science", "Linear programming", "Vehicle routing problem", "Routing (electronic design automation)", "Drop (telecommunication)", "Mathematical optimization", "Transport engineering", "Operations research", "Engineering" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0191261518305216" }, { "id": "https://openalex.org/W3161580937", "doi": "10.26083/tuprints-00018501", "title": "Resource Planning in Cross-Docking Platforms - Models and Algorithms", "year": 2021, "publication_date": "2021-01-01", "type": "dissertation", "language": "en", "authors": [ "Pascal Wolff" ], "first_author": "Pascal Wolff", "venue": "Technischen Universität Darmstadt", "publisher": "Technische Universität Darmstadt", "abstract": "Cross-docking, a relatively new warehouse strategy that has its roots in the industry, can improve the efficiency of a company's logistics and distribution processes. Specifically, it can minimize the costly storage and order picking function of traditional warehouses by efficiently coordinating (i.e., synchronizing) incoming freight flows and outgoing freight flows. Companies from various industries such as the retailing industry, the less-than-truckload logistics service industry, the express and small parcel delivery industry, and the automotive industry operate cross-docking terminals in their transportation networks and benefit from improved service levels, reduced transportation costs, reduced inventory holding costs, reduced handling costs, etc. Besides its practical relevance, cross-docking has also received a lot of academic attention in the last 30 years. Many academic studies have addressed a wide range of strategic, tactical, and operational cross-docking decision problems. Most studies, however, have neglected resource planning aspects and hence failed to address two major concerns of cross-docking practitioners: - Determining the number of resources needed; - Scheduling internal resources in an efficient way. This thesis sets out to bridge this theory-practice gap in the cross-docking domain by proposing new models that combine two interdependent operational problems faced by cross-docking practitioners, namely the scheduling of internal resources and the scheduling of trucks. Three novel problems are introduced in this thesis. First, the resource and truck scheduling problem, denoted as TSFD-RC-F, is proposed. It allows scheduling both resources and trucks when the resource requirements of trucks are given and known in advance. The TSFD-RC-F aims to determine a truck schedule that can be executed with a minimum number of resources. Then, the multi-mode resource and truck scheduling problem (TSFD-RC-V) is proposed. It is a model extension of the TSFD-RC-F and offers the additional flexibility of adapting the number of resources for processing trucks. While deploying more operators accelerates truck processing, deploying fewer operators prolongs the processing time. The model aims to determine how many resources should be deployed for truck processing and at what time trucks should be serviced in order to minimize the maximum number of required resources. Lastly, the shift and truck scheduling problem (ISTSFD) is proposed. It considers different operator types (e.g., temporary and regular workers), shift patterns, and work breaks. The ISTSFD seeks to find a truck schedule and employee timetable with minimum labor costs. Two variants of the ISTSFD are presented: a single-mode problem (ISTSFD-F) and a multi-mode problem (ISTSFD-V). As the proposed models' complexity statuses make it challenging to solve large-sized instances with a default solver, tailored column generation-based solution procedures for all three problems are developed. Extensive computational experiments are conducted in order to assess the computational performance of both the mixed-integer programs and the proposed solution procedures. In addition, managerial insights are derived by benchmarking the proposed models against frequently used truck scheduling models. It is shown that the proposed discrete-time MIP formulations clearly outperform the proposed continuous-time MIP formulations in terms of both solution quality and computational time. Moreover, the solution time can be reduced by using the proposed preprocessing parameters for calculating the number of delayed freight units and compelling the service level. While a default solver can solve the discrete-time MIPs for small and medium-sized instances in a reasonable time, it often fails to provide good solutions for very large problem instances with a fine time granularity. The proposed heuristics solution procedures, on the other hand, can provide high-quality solutions for very large problem instances in a short time and clearly outperform commercial solvers. In addition, the following key take-home managerial insights could be derived: - By using the internal resource requirements instead of the frequently used makespan or processing time as the primary performance metrics, the cross-docking platform's operational efficiency can be significantly increased. - By integrating the decision of how many resources should be deployed for truck processing (i.e., considering multi-mode processing), further operational efficiency gains can be realized. - The defined service level has a significant impact on the operator demand. Lowering the required service level can be a reasonable means to improve a cross-docking facility's operational efficiency further. - The work break patterns have a significant impact on the operator requirements. Too low a number of work break patterns may result in a strong surge in operator demand.", "keywords": [ "Truck", "Interdependence", "Scheduling (production processes)", "Operations research", "Automotive industry", "Computer science", "Transport engineering", "Engineering", "Operations management" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://tuprints.ulb.tu-darmstadt.de/18501/1/20210426_Resource%20Planning%20in%20Cross-Docking%20Platforms_Pascal%20Wolff_final.pdf" }, { "id": "https://openalex.org/W2914974137", "doi": "10.1007/978-3-030-12119-8_1", "title": "A Model of Residential Mail Delivery by Drones", "year": 2019, "publication_date": "2019-01-01", "type": "conference-paper", "language": "en", "authors": [ "Monica Gabriela Cojocaru", "Edward Wolfgang Thommes", "Sierra Gillies" ], "first_author": "Monica Gabriela Cojocaru", "venue": "Springer proceedings in mathematics & statistics", "publisher": "Springer International Publishing", "abstract": null, "keywords": [ "Drone", "Truck", "Software deployment", "Food delivery", "Retrofitting", "Transport engineering", "Computer science", "Delivery system", "Engineering", "Business", "Advertising", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-030-12119-8_1" }, { "id": "https://openalex.org/W2550048885", "doi": "10.1080/17509653.2011.10671169", "title": "Solid waste management: case of collection and Vehicle Routing Problem in the city of Azemmour, Morocco", "year": 2011, "publication_date": "2011-01-01", "type": "article", "language": "en", "authors": [ "Abdelhadi Makan", "Dimitri Malamis", "Omar Assobhei", "Maria Loizidou", "Mohammed Mountadar" ], "first_author": "Abdelhadi Makan", "venue": "International Journal of Management Science and Engineering Management", "publisher": "Taylor & Francis", "abstract": "This paper considers a truck scheduling problem in the context of solid waste collection in the City of Azemmour. One such concern to city administrators is how to effectively distribute collection vehicles and crews in the region. The main object of this paper is to suggest a methodology for allocating trucks to the existing collection sites for minimizing cost and collecting 100% of waste. For this purpose, the software “Container Collector” was developed. This last is equipped with a file containing the application data that are required to represent the road network, the container position and the collection depot spatial information. In fact, the software allows determining routes which must be traversed in the city to optimize the vehicle routing. Thus, the software application has permit to determine four optimal routes which allow minimizing total distance traversed, total rounds duration and financial costs including salary, fuel and vehicle operation.", "keywords": [ "Truck", "Computer science", "Vehicle routing problem", "Waste collection", "Software", "Container (type theory)", "Context (archaeology)", "Data collection", "Operations research", "Scheduling (production processes)", "Routing (electronic design automation)", "Transport engineering" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/17509653.2011.10671169" }, { "id": "https://openalex.org/W2301007919", "doi": null, "title": "AN INVESTIGATION OF THE FACTORS LEADING TO TANKER TRUCKS DELAY AT OIL DEPOTS USING COMPUTER SIMULATION TECHNIQUES", "year": 2008, "publication_date": "2008-01-01", "type": "article", "language": "en", "authors": [ "K Shahanaghi", "M Golchinpour" ], "first_author": "K Shahanaghi", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Truck", "Marine engineering", "Computer science", "Environmental science", "Engineering", "Automotive engineering", "Simulation", "Aeronautics" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://en.journals.sid.ir/ViewPaper.aspx?ID=166650" }, { "id": "https://openalex.org/W2138267888", "doi": null, "title": "Dissecting Drayage: An Examination of Structure, Information, and Control in Drayage Operations", "year": 2010, "publication_date": "2010-02-12", "type": "dissertation", "language": "en", "authors": [ "Faith Jordan Srour" ], "first_author": "Faith Jordan Srour", "venue": "RePub (Erasmus University Rotterdam)", "publisher": "Erasmus University Rotterdam", "abstract": "The term dray dates back to the 14th century when it was used commonly to describe a type of very sturdy sideless cart . In the 1700s the word drayage came into use meaning “to transport by a sideless cart”. Today, drayage commonly refers to the transport of containerized cargo to and from port or rail terminals and inland locations. With the phenomenal growth of containerized freight since the container’s introduction in 1956, the drayage industry has also experienced significant growth. In fact, according to the Bureau for Transportation Statistics, the world saw total maritime container traffic grow to approximately 417 million twenty foot equivalent units (TEUs) in 2006. \\n \\nUnfortunately, the drayage portion of a door-to-door container move tends to be the most costly part of the move. There are a variety of reasons for this disproportionate assignment of costs, including a great deal of uncertainty at the interface of modes. For example, trucks moving containers to and from a port terminal are often uncertain as to how long it will take them to pick up a designated container coming from a ship, from the terminal stack, or from customs. This uncertainty leads to much difficulty and inefficiency in planning a profitable routing for multiple containers in one day. We study this problem from three perspectives using both empirical and theoretical techniques.", "keywords": [ "Container (type theory)", "Truck", "Port (circuit theory)", "Terminal (telecommunication)", "Transport engineering", "Meaning (existential)", "Inefficiency", "Operations research", "Computer science", "Engineering", "Economics", "Telecommunications" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "http://repub.eur.nl/pub/18231" }, { "id": "https://openalex.org/W4234677039", "doi": "10.1057/9781137475770_5", "title": "An Optimization Model for the Inland Repositioning of Empty Containers", "year": 2015, "publication_date": "2015-01-01", "type": "book-chapter", "language": "en", "authors": [ "Alessandro Adriano Olivo", "Massimo Di Francesco", "Paola Zuddas" ], "first_author": "Alessandro Adriano Olivo", "venue": "Palgrave Macmillan UK eBooks", "publisher": "Palgrave Macmillan", "abstract": "The inland repositioning of empty containers is a crucial problem for shipping companies providing door-to-door transport services to customers. This activity consists of the allocation of heterogeneous fleets of empty containers between inland depots and ports, so that they can be properly positioned in anticipation of future customer requests. This paper describes how shipping companies perform this complex activity and its connections with truck routing problems and the repositioning of empty containers on maritime networks.To address the inland repositioning of empty containers, we propose a time-extended optimization model, whose innovative elements are decision variables and constrains on the so-called flexible leased containers, which can be on-hired and off-hired according to a number of clauses, and substitution options between container types. The experimentation shows that the model is an effective instrument to support the current decision-making process on this issue, because realistic size instances can be solved within time limits imposed by planning operations. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.", "keywords": [ "Container (type theory)", "Anticipation (artificial intelligence)", "Truck", "Operations research", "Routing (electronic design automation)", "Process (computing)", "Computer science", "Transport engineering", "Engineering", "Computer network", "Artificial intelligence", "Automotive engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1057/9781137475770_5" }, { "id": "https://openalex.org/W561825647", "doi": null, "title": "A Multi-depot Location and Truck Routing Model for Bike Redistribution of the Kaohsiung Bicycle Sharing System", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Shou-Ren Hu", "Chao-Tang Liu" ], "first_author": "Shou-Ren Hu", "venue": "Transportation Research Board 94th Annual MeetingTransportation Research Board", "publisher": null, "abstract": "This paper presents a multi-depot location and routing model for bike deliver trucks of the Kaohsiung bicycle sharing system under bike demand uncertainty. Kaohsiung City is the first city that promotes Bicycle Sharing System (BSS) in Taiwan. The Kaohsiung City government constructed the City-bike system for the first- and last-mile services of public transport systems, The Kaohsiung Rapid Transit Corporation (KRTC) operated the City-bike system since 2009 in order to increase the transit ridership. A public transport system should consider operation efficiency for internal tasks, such as cost reduction, human resource management and vehicle/crew dispatching strategies. In this study, the authors develop a multi-depot location and truck routing model by a mathematical program where the main objective is to minimize the total system cost of fixed cost, operating cost, and truck routing cost. The ultimate goal is to find suitable locations for truck depots and shorten total routing distance while maintaining a certain level of public bike sharing services.", "keywords": [ "Truck", "Transport engineering", "Public transport", "Routing (electronic design automation)", "Engineering", "Computer science", "Computer network", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1337669" }, { "id": "https://openalex.org/W3120685046", "doi": "10.4271/2021-01-0717", "title": "Opportunities for Medium and Heavy Duty Vehicle Fuel Economy Improvements through Hybridization", "year": 2021, "publication_date": "2021-04-06", "type": "conference-paper", "language": "en", "authors": [ "Daniela Nieto Prada", "Ram Vijayagopal", "Vincent S. Costanzo" ], "first_author": "Daniela Nieto Prada", "venue": "SAE technical papers on CD-ROM/SAE technical paper series", "publisher": null, "abstract": "The objective of this study was to evaluate the fuel saving potential of various hybrid powertrain architectures for medium and heavy duty vehicles. The relative benefit of each powertrain was analyzed, and the observed fuel savings was explained in terms of operational efficiency gains, regenerative braking benefits from powertrain electrification and differences in vehicle curb weight. Vehicles designed for various purposes, namely urban delivery, utility, transit, refuse, drayage, regional and long haul were included in this work. Fuel consumption was measured in regulatory cycles and various real world representative cycles. A diesel-powered conventional powertrain variant was first developed for each case, based on vehicle technical specifications for each type of truck. Autonomie, a simulation tool developed by Argonne National Laboratory, was used for carrying out the vehicle modeling, sizing and fuel economy evaluation. Performance based sizing rules implemented in Autonomie were used to determine the component sizes for the hybridized concept trucks. In addition to the conventional baseline, a 48V start-stop system, parallel pre-transmission system and a series plug in hybrid system were considered in this work. This study shows that not all trucks can utilize engine downsizing as part of hybridization strategy. Hybrid trucks designed to match conventional vehicle performance in all functional requirements, will require engines that are comparably sized as the conventional counterparts. Plug in hybrids can have downsized engines and still meet performance goals, as the larger battery packs can be used to assist engine for a longer period of time. Depending on the drive cycle, the observed fuel economy for the hybrid powertrains will vary. It could be comparable to that of baseline vehicle in highway driving while resulting in over 30% fuel savings in more transient drive cycles.", "keywords": [ "Duty", "Heavy duty", "Business", "Automotive engineering", "Computer science", "Engineering", "Political science" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.4271/2021-01-0717" }, { "id": "https://openalex.org/W4389889225", "doi": "10.46254/ap04.20230137", "title": "A MILP Model for Single Depot, Single Truck and Multiple Drones for Last-Mile Delivery Problem", "year": 2023, "publication_date": "2023-09-12", "type": "conference-paper", "language": "en", "authors": [ "Saloni Jangid", "Rupkatha Ghosh", "Muthu Mathirajan" ], "first_author": "Saloni Jangid", "venue": null, "publisher": null, "abstract": "The high volume of daily e-commerce shipments in major urban areas require today's technology of drones for lastmile delivery (LMD) of parcels.The traditional method of delivering parcels using trucks is time-consuming due to traffic congestion, impeding their timely delivery.On the other hand, drones can avoid traffic congestion by flying over road networks.However, drones have a limited flight endurance due to their battery capacity constraints.At the same time, trucks possess long-haul capabilities.Hence, for achieving an efficient LMD, both trucks and drones should be integrated to offset each other's disadvantages.This paper addresses one such truck-drone based last-mile delivery (TD-LMD) problem.There are plenty of studies which have investigated TD-LMD problem with different configurations.For our study, we examine the TD-LMD problems involving single depot, single truck and multiple drones (SD-ST-MD) configuration.In the literature, various researchers have used mathematical models and heuristics to address this problem.In our study, we consider one Mixed-Integer Linear Programming (MILP) model given in the existing literature for the TD-LMD problem with SD-ST-MD configuration and relax one of their assumptions to give it a new dimension.In the process of extending the MILP model, we also introduce the CO2 emission cost along with the economic cost for optimizing the TD-LMD problem.Accordingly, the workability of the MILP model is tested using a tiny numerical example and solved through developing a code in the Python-MILP solver module.Further, the computational complexity is analyzed by increasing the number of nodes in the SD-ST-MD based TD-LMD problem.", "keywords": [ "Last mile (transportation)", "Mile", "Truck", "Drone", "Computer science", "Depot", "Transport engineering", "Engineering", "Automotive engineering", "Geography" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ieomsociety.org/proceedings/2023vietnam/137.pdf" }, { "id": "https://openalex.org/W7124464494", "doi": "10.52202/083767-0008", "title": "Optimization of Hybrid Truck-Drone Delivery Routing in a Multi-Depot Crowdsourcing Mode with No-Fly Zones", "year": 2025, "publication_date": "2025-01-01", "type": "conference-paper", "language": null, "authors": [ "Su Meng" ], "first_author": "Su Meng", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Mode (computer interface)", "Crowdsourcing", "Routing (electronic design automation)", "Key (lock)", "Process (computing)", "Genetic algorithm" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.52202/083767-0008" }, { "id": "https://openalex.org/W4394447619", "doi": "10.6084/m9.figshare.6260657", "title": "Integrated forward/reverse cross-dockingIntegrated forward and reverse cross-docking with vehicle routing and truck scheduling under two inspection strategies - R1", "year": 2021, "publication_date": "2021-01-01", "type": "dataset", "language": "en", "authors": [ "Ali Rahbari", "Mohammad Mahdi Nasiri" ], "first_author": "Ali Rahbari", "venue": "Figshare", "publisher": "Figshare (United Kingdom)", "abstract": "10 problem instances for integrated forward/reverse cross-docking problem", "keywords": [ "Vehicle routing problem", "Truck", "Computer science", "Scheduling (production processes)", "Docking (animal)", "Automotive engineering", "Engineering", "Embedded system", "Routing (electronic design automation)", "Operations management", "Medicine" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.6084/m9.figshare.6260657" }, { "id": "https://openalex.org/W4389817110", "doi": "10.1007/s10668-023-04123-x", "title": "Feeder vehicle routing problem in a collaborative environment using hybrid particle swarm optimization and adaptive learning strategy", "year": 2023, "publication_date": "2023-12-15", "type": "article", "language": "en", "authors": [ "M. Salehi Sarbijan", "Javad Behnamian" ], "first_author": "M. Salehi Sarbijan", "venue": "Environment Development and Sustainability", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Particle swarm optimization", "Vehicle routing problem", "Computer science", "Swarm behaviour", "Routing (electronic design automation)", "Multi-swarm optimization", "Mathematical optimization", "Artificial intelligence", "Computer network", "Machine learning", "Mathematics" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10668-023-04123-x" }, { "id": "https://openalex.org/W3041784702", "doi": "10.1016/j.retrec.2020.100884", "title": "The one container drayage problem with soft time windows", "year": 2020, "publication_date": "2020-07-10", "type": "article", "language": "en", "authors": [ "Alejandro Escudero-Santana", "Jesús Muñuzuri", "Pablo Cortés", "Luis Onieva" ], "first_author": "Alejandro Escudero-Santana", "venue": "Research in Transportation Economics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Transshipment (information security)", "Container (type theory)", "Benchmark (surveying)", "Truck", "Work (physics)", "Transport engineering", "Operations research", "Computer science", "Engineering", "Geography" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://idus.us.es/handle//11441/129779" }, { "id": "https://openalex.org/W4361218047", "doi": "10.1080/23302674.2023.2190474", "title": "Solving a heterogeneous fleet multi-compartment vehicle routing problem:a case study", "year": 2023, "publication_date": "2023-03-27", "type": "article", "language": "en", "authors": [ "Simos Efthymiadis", "Nikolaos Liapis", "George Nenes" ], "first_author": "Simos Efthymiadis", "venue": "International Journal of Systems Science Operations & Logistics", "publisher": "Taylor & Francis", "abstract": "Vehicle Routing Problem (VRP) is a complex optimisation problem in the field of supply chain management, especially in the Oil & Gas sector. Due to the rising cost of fuel, effective planning of transportation routes has become a crucial success factor for distribution companies, increasing operational efficiency as well as the corresponding service level. In this paper, we present an optimisation model to solve a heterogeneous fleet multi-compartment vehicle routing problem (MCVRP), a variant of the conventional vehicle routing problem (VRP). Real data are obtained from a medium size oil distribution company, operating in Greece and incorporates 19 petrol stations served from a central oil depot using a fleet of various multi-compartment tanker trucks. The main objective of this research is to design an optimum set of routes minimising distance and truck operating costs. The MCVRP with a heterogeneous fleet of vehicles is modelled as a Mixed-Integer Linear Programming (MILP) problem and the proposed solution determines the number of assigned vehicles, the planning of daily routes and the allocation of different fuels to vehicles compartments, while satisfying customer demand following specific requirements, as detailed in the Carriage of Dangerous Goods (ADR) Regulations.", "keywords": [ "Vehicle routing problem", "Truck", "Fleet management", "Integer programming", "Transport engineering", "Operations research", "Routing (electronic design automation)", "Computer science", "Linear programming", "Fuel efficiency", "Engineering", "Automotive engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/23302674.2023.2190474" }, { "id": "https://openalex.org/W4401994653", "doi": "10.1007/s00291-024-00785-9", "title": "Two-indexed formulation of the traveling salesman problem with multiple drones performing sidekicks and loops", "year": 2024, "publication_date": "2024-08-29", "type": "article", "language": "en", "authors": [ "Alexander Rave" ], "first_author": "Alexander Rave", "venue": "OR Spectrum", "publisher": "Springer Science+Business Media", "abstract": "Abstract Aerial drone delivery has great potential to improve package delivery time, as drones can fly autonomously over obstacles at a possibly higher speed than trucks. The benefits of drones in delivery can even be increased in a truck-and-drone tandem where a truck carries multiple drones and releases them at advantageous places, i.e., the traveling salesman problem with multiple drones (TSPmD). We focus on a general version of this problem with makespan minimization, where the drones have two options after serving the customer: they can return to any node the truck visits at a later stage (sidekick) or return to the same node they were launched from (loop) — even at the depot. We introduce an efficient two-indexed mixed-integer linear program (MILP) for this TSPmD and show how to adapt the MILP to cover two problem variants, namely the multiple flying sidekick traveling salesman problem and the traveling salesman problem with drone. Our MILP formulation is an efficient formulation, as it outperforms eight state-of-the-art MILP formulations for these problem variants in nearly all larger instances. In a numerical study, we provide new optimal solutions with up to 28 nodes for benchmark purposes. Moreover, we analyze the impact of allowing drone loops on makespan minimization in general and at the depot. We find that loops mainly become relevant when drones travel faster than trucks, resulting in average makespan savings of up to 2.7%.", "keywords": [ "Travelling salesman problem", "Drone", "Computer science", "Job shop scheduling", "Mathematical optimization", "Truck", "Benchmark (surveying)", "Integer programming", "Minification", "Routing (electronic design automation)", "Mathematics", "Computer network" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s00291-024-00785-9.pdf" }, { "id": "https://openalex.org/W2897033146", "doi": null, "title": "Planning in a cross dock network with an operational scheduling overview", "year": 2018, "publication_date": "2018-09-19", "type": "article", "language": "en", "authors": [ "Sajjad Rahmanzadeh", "Amin Shahmardan", "Mir Saman Pishvaee", "Armin Jabarzadeh" ], "first_author": "Sajjad Rahmanzadeh", "venue": "Journal of industrial and systems engineering.", "publisher": null, "abstract": "Nowadays, cross docking plays an important role in the supply chain networks especially in transportation systems. According to the cross dock system advantages such as reducing transportation costs, lead times, and inventories, scheduling in a cross-dock center would be more complicated by increasing the number of suppliers, customers and product types. Considering the cross dock limited capacities (equipment, storage space, work force, and etc.), sometimes it is not possible to deliver the supplier's products to customers in the right times. Thus, suppliers pay more tardiness penalties for scheduling problems in the cross dock centers. The current paper aims to propose an integer programming mathematical model that enables the suppliers to choose appropriate transportation paths according to amount of products delivered and moreover considering cross docks scheduling time constraints. In fact, cross dock centers present the list of outbound trucks departure times and suppliers reserve certain capacity based on their tardiness, transportation and inventory holding costs. Moreover, in this paper, a Lightening search algorithm (LSA) is developed to solve the proposed model. Additionally, to develop the solving procedure, a heuristic algorithm is proposed and compared with the LSA.", "keywords": [ "DOCK", "Tardiness", "Computer science", "Truck", "Scheduling (production processes)", "Operations research", "Integer programming", "Job shop scheduling", "Heuristic", "Operations management", "Schedule", "Economics" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.jise.ir/article_69382_fd9ac3c6f5706492cb9b133020320055.pdf" }, { "id": "https://openalex.org/W4410905257", "doi": "10.1007/978-981-96-4353-0_24", "title": "An Optimization Model for Cross-Docking Operation Scheduling and Distribution", "year": 2025, "publication_date": "2025-01-01", "type": "conference-paper", "language": "en", "authors": [ "Issacian Mutiara Paska", "Cucuk Nur Rosyidi", "Wakhid Ahmad Jauhari" ], "first_author": "Issacian Mutiara Paska", "venue": "Lecture notes in mechanical engineering", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Computer science", "Docking (animal)", "Scheduling (production processes)", "Mathematical optimization", "Mathematics", "Medicine" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-981-96-4353-0_24" }, { "id": "https://openalex.org/W4232178940", "doi": "10.4271/j1667_199602", "title": "SNAP-ACCELERATION SMOKE TEST PROCEDURE FOR HEAVY-DUTY DIESEL POWERED VEHICLES", "year": 2017, "publication_date": "2017-03-06", "type": "standard", "language": "en", "authors": [ "Truck and Bus Powertrain Committee" ], "first_author": "Truck and Bus Powertrain Committee", "venue": null, "publisher": null, "abstract": "This SAE Recommended Practice applies to vehicle exhaust smoke measurements made using the Snap-Acceleration test procedure. Because this is a non-moving vehicle test, this test can be conducted along the roadside, in a truck depot, a vehicle repair facility, or other test facilities. The test is intended to be used on heavy-duty trucks and buses powered by diesel engines. It is designed to be used in conjunction with smokemeters using the light extinction principle of smoke measurement. This procedure describes how the snap-acceleration test is to be performed. It also gives specifications for the smokemeter and other test instrumentation and describes the algorithm for the measurement and quantification of the exhaust smoke produced during the test. Included are discussions of factors which influence snap-acceleration test results and methods to correct for these conditions. Unless otherwise noted, these correction methodologies are to be considered an integral part of the snap-acceleration test procedure.", "keywords": [ "Acceleration", "Truck", "Automotive engineering", "Heavy duty", "Test (biology)", "Smoke", "Engineering", "Diesel fuel", "Physics", "Waste management" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.4271/j1667_199602" }, { "id": "https://openalex.org/W2997130848", "doi": "10.24815/jarsp.v2i4.14948", "title": "ANALISIS KINERJA PENGANGKUTAN SAMPAH PADA ZONA III KOTA BANDA ACEH (KECAMATAN LUENG BATA, KUTA RAJA DAN BAITURRAHMAN)", "year": 2019, "publication_date": "2019-12-10", "type": "article", "language": "en", "authors": [ "Murnianti Murnianti", "Syamsidik Syamsidik", "Muhammad Javed Zaki" ], "first_author": "Murnianti Murnianti", "venue": "Jurnal Arsip Rekayasa Sipil dan Perencanaan", "publisher": null, "abstract": "The analysis of Waste Transportion Performance in Zone III of Banda Aceh managed to evaluate the waste transport system related to the pattern of waste collection and transportation, the frequency of transportation and the number of waste transport vehicles in zone III, so optimization can be done. Primary data is obtained by observing the process of transporting waste directly in the field and interviewing the parties that involved. Observations were made on each vehicle that carrying waste twice a day (morning and afternoon/night). The vehicles that will be observed consists of 11 dumptrucks, 1 compactor truck, 2 armrolltruck, so the number of observations is 14 days. The application of the pattern of waste collection with the door to door system in some zone III does not match the standards set. The amount of trip for dumptruck can be increased to 3 trips/day, 4 trip/day for compactors truck and 11 trips/day for armroll trucks. Better waste disposal can save dumptruck transportation time 2.18 hours/day or 27.26% and increase ritation to 3 trips/day. The addition of transport trips increases the potential amount of waste transportation up to 59.17% from 48.10 tons/day to 76.56 tons/day. The needs for waste transportation based on the calculation results can be optimized to 10 units, while currently used is 14 units. Inadequate of work equipment, there is no special training for workers and a lack of public awareness in properly disposing waste can be a barrier in waste transportation services.", "keywords": [ "Truck", "TRIPS architecture", "Transport engineering", "Waste management", "Engineering", "Waste collection", "Public transport", "Municipal solid waste", "Environmental science", "Automotive engineering" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "http://jurnal.unsyiah.ac.id/JARSP/article/download/14948/11369" }, { "id": "https://openalex.org/W1920399554", "doi": "10.3141/2498-10", "title": "Using Lagrangian Relaxation to Solve Ready Mixed Concrete Dispatching Problems", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Pavan Kumar Narayanan", "David Rey", "Mojtaba Maghrebi", "Steven Travis Waller" ], "first_author": "Pavan Kumar Narayanan", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "The logistics and planning problem of delivering ready mixed concrete (RMC) to a set of demand customers from multiple depots is addressed. The RMC dispatching problem (RMCDP) is closely related to the vehicle routing problem, with the difference that a truck may visit demand nodes in the RMCDP more than once. This class of routing problems can be represented by using mixed-integer programming (MIP) and is known to be NP-hard. Solving RMC delivery problems is often achieved through heuristics and metaheuristic-based methods as exact solution approaches are often unable to find optimal solutions efficiently, in particular when multiple depots are represented in the model. Although a variety of methods are available to solve MIP models, in this paper an attempt is made to solve the RMCDP by using a Lagrangian relaxation technique. Namely, a solution algorithm based on Lagrangian relaxation is derived to reduce the complexity of the initial MIP model and show that the proposed relaxation is able to provide promising computation results on a realistic data set representative of an active RMCDP in the region of Adelaide, Australia.", "keywords": [ "Lagrangian relaxation", "Heuristics", "Mathematical optimization", "Relaxation (psychology)", "Routing (electronic design automation)", "Computer science", "Set (abstract data type)", "Integer programming", "Vehicle routing problem", "Class (philosophy)", "Variety (cybernetics)", "Computation" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/1959.4/unsworks_51351" }, { "id": "https://openalex.org/W3194783465", "doi": null, "title": "A decision support system for cross-docking centers with different objectives", "year": 2020, "publication_date": "2020-01-01", "type": "article", "language": "en", "authors": [ "Gökçe Özden", "İnci Sarıçiçek" ], "first_author": "Gökçe Özden", "venue": "DergiPark (Istanbul University)", "publisher": "Istanbul University", "abstract": "The truck scheduling problem is an important problem that consists of assigning each inbound and outbound truck to a door at the dock and then determining the sequences of trucks at each door. Truck scheduling in multi-door cross-docking centers is essential for both customers and cross-docking facilities. In this study, aDecision Support System (DSS) is designed for the truck scheduling problem for multi-door cross-docking centers. The scheduling model of the DSS uses Simulated Annealing (SA) meta-heuristic. In the solution process, each schedule is established for several different objectives, such as the minimization of the maximum completion time and the total earliness and tardiness, maximization of the total number of shipping products within a working period. The designed DSS provides alternative schedules to decision makers and enables the choice of an appropriate schedule by monitoring the sequences and trade-offs between alternative solutions for the cross-docking center and the customers.", "keywords": [ "Docking (animal)", "Decision support system", "Computer science", "Artificial intelligence", "Medicine" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://sigma.yildiz.edu.tr/storage/upload/pdfs/1629791671-en.pdf" }, { "id": "https://openalex.org/W3200618971", "doi": "10.1007/978-3-658-34754-3_2", "title": "Digital Twin to design and support the usage of alternative drives in municipal vehicle fleets", "year": 2021, "publication_date": "2021-01-01", "type": "book-chapter", "language": "en", "authors": [ "Sven Spieckermann", "Josef Becker", "Markus J. Henrich", "Thomas H. Schulte" ], "first_author": "Sven Spieckermann", "venue": "Proceedings", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": null, "keywords": [ "Truck", "Transport engineering", "Fleet management", "Engineering", "Fuel efficiency", "Service (business)", "Alternative fuel vehicle", "Automotive engineering", "Operations research", "Alternative fuels", "Business", "Marketing" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-658-34754-3_2" }, { "id": "https://openalex.org/W635970507", "doi": null, "title": "Strategies for Increasing Intermodal Freight Transport Between Eastern and Western Europe", "year": 2007, "publication_date": "2007-01-01", "type": "conference-paper", "language": "en", "authors": [ "Jost Wichser", "Ulrich Weidmann", "Nikolaus Fries", "Andrew Butler Nash" ], "first_author": "Jost Wichser", "venue": null, "publisher": null, "abstract": "An important European Union policy is to decrease the share of freight transport moving by truck in favor of alternative land transport modes (rail and waterway). The research project’s purpose was to identify strategies for increasing the share of intermodal freight transportation between Eastern and Western Europe. The project evaluated the demand for transport in this market and identified a potential candidate corridor. This corridor was used to help analyze strategies for addressing the key problems in increasing intermodal transport. The three main problems with intermodal transport are: quality, price and coverage; more specifically, intermodal transport is often slower, less reliable and more expensive than truck-only transport, and furthermore it is only offered in selected corridors. Addressing these problems is the key to increasing intermodal transport. Quality is the most important factor in today’s freight transport market. There are two main ways to improve the quality of intermodal transport: consolidate management and improve the infrastructure. Intermodal transport in Europe today is relatively disorganized; often it involves multiple parties working together on an ad-hoc basis. The best option would be a single company providing door-to-door service (similar to truck transport), but this is practically impossible for long distance intermodal transport. Therefore, to increase quality, a single responsible party must manage all transport chain partners, information flows must be improved, quality improvement strategies must be implemented, and all partners must share the same objectives. There are several alternative organizational structures that could achieve these objectives. One common requirement is that the intermodal terminal operator be responsible for providing the pre- and post-haulage service (to increase PPH efficiency). Ideally both the origin and destination terminals would be under the control of the same operator. The terminal operator could either contract with a railroad for the main haulage or (preferably) operate its own trains (under Europe’s Open Access rules) between terminals. In cases where the origin and destination terminals are operated by different companies, these companies must develop a real working partnership.", "keywords": [ "Truck", "Transport engineering", "Quality (philosophy)", "Business", "European union", "Market share", "Rail freight transport", "Traffic management", "Service (business)", "Engineering", "Finance", "Marketing" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/859875" }, { "id": "https://openalex.org/W4221158420", "doi": null, "title": "Perspectives on Charging Medium- and Heavy-Duty Electric Vehicles", "year": 2022, "publication_date": "2022-01-20", "type": "article", "language": "en", "authors": [ "Matteo Muratori" ], "first_author": "Matteo Muratori", "venue": "OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)", "publisher": "Office of Scientific and Technical Information", "abstract": "Electric vehicles (EVs) adoption is gaining momentum globally thanks to major technological advancements as well as policy actions and support from multiple stakeholders. EVs are well positioned to replace internal combustion engine vehicles for passenger cars, SUVs, vans, trucks, and buses, but a plethora of solutions is needed to provide effective, convenient, and affordable charging to different vehicles and for various applications. This talk focuses on charging of medium and heavy-duty vehicles, the second largest source of US transportation GHG emissions, providing an overview of charging needs for different applications. Moreover, we offer a deep dive on depot charging solutions for short-haul heavy-duty trucks based on a recent Nature Energy paper.", "keywords": [ "Heavy duty", "Automotive engineering", "Electrical engineering", "Computer science", "Environmental science", "Engineering" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.osti.gov/biblio/1840708" }, { "id": "https://openalex.org/W4391621146", "doi": "10.1109/tits.2024.3357648", "title": "Inventory Routing Problem With Split Delivery and Variable Time Windows for Customers With Small Capacity and Large Sales", "year": 2024, "publication_date": "2024-02-07", "type": "article", "language": "en", "authors": [ "Zhishuo Liu", "Xingquan Zuo" ], "first_author": "Zhishuo Liu", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "In push delivery mode, a supplier determines both delivery orders of customers and vehicle routes. Some customers have small inventory capacity and rapid sale speed (called small-C/S customers). Thus, each of them needs to receive multiple deliveries in a work shift (e.g., one day). The number of deliveries and quantity of each delivery for a customer are unknown. Each delivery has a pair of accommodation time and stockout time, both of which are variable and constitute the soft time window of the delivery. This work proposes a Single-period Inventory Routing problem with split delivery and variable time windows for Small-C/S customers (SIRSC). The number of deliveries for each customer, and the quantity, time window, and arrival time of each delivery are variable. Various products that cannot be mixed can be loaded on the same truck with multiple compartments and a truck can return several times to the depot to resupply in the period. A mathematical programming model is developed for SIRSC, to minimize the sum of transportation and stockout costs. A hybrid ant colony optimization with variable neighborhood search (ACO-VNS) is proposed to solve SIRSC. A distribution network model of ACO is developed and several problem-specific neighborhood structures are designed. ACO-VNS is applied to some problem instances and a real-world gasoline delivery case. Experimental results show that it can effectively solve SIRSC, and outperforms CPLEX and other meta-heuristics.", "keywords": [ "Vehicle routing problem", "Truck", "Stockout", "Heuristics", "Variable neighborhood search", "Computer science", "Operations research", "Delivery Performance", "Variable (mathematics)", "Routing (electronic design automation)", "Ant colony optimization algorithms", "Mathematical optimization" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2024.3357648" }, { "id": "https://openalex.org/W3136378622", "doi": "10.1049/stg2.12034", "title": "MILP‐based customer‐oriented E‐Fleet charging scheduling platform", "year": 2021, "publication_date": "2021-03-18", "type": "article", "language": "en", "authors": [ "Parisa Akaber", "Timothy Hughes", "S. L. Sobolev" ], "first_author": "Parisa Akaber", "venue": "IET Smart Grid", "publisher": "Institution of Engineering and Technology", "abstract": "Abstract Conventional road transport is a significant contributor to greenhouse gas emissions and air pollution. Electric mobile assets (E‐buses, E‐trucks, E‐taxis, and even E‐ferries) are an efficient, low noise, low emission alternative which could—if operated alongside significant renewable energy capacity—help to improve air quality and avoid catastrophic global warming. In this study, a Mixed Integer Linear Programming‐based solution for operating a fleet of E‐mobile assets has been proposed, considering technical and operational characteristics of different fleet elements. It takes into account customer (E‐fleet operator) objectives, such as load balancing and charging cost minimization. Furthermore, the E‐depot charging capacity increase achieved through integrating an energy storage system has been studied and discussed. The results of the optimization have been discussed and reported using a case study (demonstrating peak reduction of up to 50% and total charging reduction of 27%) and the benefits of operating an E‐fleet using the proposed solution have been discussed from economic and technical perspectives.", "keywords": [ "Taxis", "Truck", "Renewable energy", "Linear programming", "Greenhouse gas", "Automotive engineering", "Fleet management", "Computer science", "Total cost", "Integer programming", "Minification", "Scheduling (production processes)" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://onlinelibrary.wiley.com/doi/pdfdirect/10.1049/stg2.12034" }, { "id": "https://openalex.org/W2345158185", "doi": null, "title": "An aggregate approach for urban delivery tour simulation", "year": 2012, "publication_date": "2012-01-01", "type": "conference-paper", "language": "en", "authors": [ "Agostino Nuzzolo", "Antonio Comi" ], "first_author": "Agostino Nuzzolo", "venue": "Cineca Institutional Research Information System (Tor Vergata University)", "publisher": "University of Rome Tor Vergata", "abstract": "Today, most cities have to deal with the large number of trucks and vans delivering goods in the inner area and local administrators are looking at city logistics measures in order to reduce the negative effects of freight transport [1].It is therefore important to have methods and models able to assess new city logistics measure scenarios [2,3,4].In a general methodology for simulating and assessing freight transport system, a key-role is played by demand models in order to point out two sets of flows taking place in the study area.The first", "keywords": [ "Truck", "Order (exchange)", "City logistics", "Commodity", "Transport engineering", "Process (computing)", "Routing (electronic design automation)", "Aggregate (composite)", "Transport network", "Point (geometry)", "Computer science", "Flow network" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/2108/86488" }, { "id": "https://openalex.org/W3114407984", "doi": "10.1109/pesgm41954.2020.9281674", "title": "Routing and Scheduling of Mobile EV Chargers for Vehicle to Vehicle (V2V) Energy Transfer", "year": 2020, "publication_date": "2020-08-02", "type": "conference-paper", "language": "en", "authors": [ "Mohammad Ekramul Kabir", "Ibrahim Sorkhoh", "Bassam Moussa", "Chadi M. Assi" ], "first_author": "Mohammad Ekramul Kabir", "venue": null, "publisher": null, "abstract": "Ameliorating the range anxiety to propel the disparaged electric vehicle (EV) market necessitates an adequate charging infrastructure. But, the high initial installation cost, requirement of suitable places and the anticipated immense load on the grid during peak time hinder to elongate the charging station network, especially in urban areas. As a consequence, the bidirectional energy transferring capability between vehicle to vehicle (V2V) may act as an auxiliary solution to charge an EV at any place and at any time without leaning on a permanent charging infrastructure. Here in this work, we assume a company having a number of V2V enabled charging trucks equipped with a larger battery and a fast charger to charge a number of EVs at some particular parking lots. The company intends to maximize the served number EVs, when an EV should be considered as served if it would be fully charged during its declared charging window. All the charging requests are assumed to be received before the time horizon and we also consider that all trucks should return to the depot after serving EVs. We formulate an integer linear program (ILP) to maximize the number of served EVs by determining the optimal trajectory of each truck. The problem is formally proved as NP-hard and due to its larger computational time, we also propose three different heuristic algorithms: 1) Strictest Window Shortest Path First (SWSPF), 2) Smallest Demand Shortest Path First (SDSPF) and 3) Earliest Arrival Shortest Path First (EASPF). The performance of these three algorithms are examined in detail and finally, SDSPF shows the better performance and its performance is closer to the optimal solution.", "keywords": [ "Truck", "Shortest path problem", "Electric vehicle", "Computer science", "Scheduling (production processes)", "Driving range", "Heuristic", "Transfer (computing)", "Grid", "Charging station", "Mathematical optimization", "Real-time computing" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/pesgm41954.2020.9281674" }, { "id": "https://openalex.org/W7211943864", "doi": "10.1287/ijoc.2025.1233", "title": "Landscape-Aware Hybrid Metaheuristic for Cross-Dock Door Assignment", "year": 2026, "publication_date": "2026-09-08", "type": "article", "language": "en", "authors": [ "Wei Yang", "Wang Yang", "Abraham P. Punnen", "Rafael Martı́" ], "first_author": "Wei Yang", "venue": "INFORMS journal on computing", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "The cross-dock door assignment problem (CDAP) is a critical challenge in optimizing cargo transshipment in logistics, where each inbound door serves multiple origins and each outbound door serves multiple destinations, subject to capacity constraints on the volume of goods processed at each door. To address this problem, we propose a novel metaheuristic (LA-HM) that integrates landscape-aware iterated tabu search and large neighborhood search within a unified framework. The proposed algorithm begins with a model-driven procedure to generate a diverse set of initial solutions, which are then refined using an iterated tabu search procedure, enhanced by an innovative landscape-aware detection mechanism. This mechanism dynamically monitors the search landscape at regular intervals to identify plain regions characterized by slow local improvement. Based on the detected plain level, the algorithm adaptively adjusts the interval length in the tabu search and applies targeted perturbations to escape local optima, thereby exploring more promising regions. Additionally, we introduce a reformulation of the original problem, consolidating all trucks at a door into a single “consolidated truck.” This reformulation enables the use of an alternating local search method to further refine solutions efficiently. Evaluated on two widely used data sets, the proposed algorithm sets new best known records for 39 out of 99 benchmark instances, and surpasses the leading algorithms in the literature. Moreover, a comprehensive analysis of the landscape-aware detection mechanism and the large neighborhood search highlights their contributions to solution quality. Notably, the search strategies proposed in this work are generalizable and applicable to a wide range of combinatorial optimization problems, particularly those characterized by flat landscapes where traditional methods often struggle to navigate effectively. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by National Natural Science Foundation of China [Grant 72371200]; Spanish government-Ministerio de Ciencia e Innovación [Grants PID2021-125709OB-C21, PID2024-160226OB-C21]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1233 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1233 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .", "keywords": [ "Tabu search", "Metaheuristic", "Benchmark (surveying)", "Guided Local Search", "Local search (optimization)", "Transshipment (information security)", "Iterated local search", "Set (abstract data type)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/ijoc.2025.1233" }, { "id": "https://openalex.org/W2887654240", "doi": "10.21078/jssi-2018-302-18", "title": "Application of Drone in Solving Last Mile Parcel Delivery", "year": 2018, "publication_date": "2018-08-13", "type": "article", "language": "en", "authors": [ "Jiashi Liu", "Zhongliang Guan", "Jennifer S. Shang", "Xiang Xie" ], "first_author": "Jiashi Liu", "venue": "系统科学与信息学报(英文)", "publisher": null, "abstract": "Abstract The article is about solving the last mile delivery problem in rural town or village. We want to test the drone’s potential in parcel delivery. The objectives are 1) to introduce the cluster and truck-drone in tandem delivery method, 2) to compare the new method with the traditional TSP method in aspect of truck running distance, energy using and time occupation. The parcel delivery demand is sparse, so it is not dense enough for a truck to carry on delivery. We try to identify the best route for the drone to deliver the goods. We use k-mean method to carry on clustering, then we use enumeration method to fulfill the centroids delivery, which comes from the depot. We design a model and calculate the energy, time and distance saving between drone using method (DTSP) and traditional TSP method. The drone attended delivery saves truck delivery distance, energy consumption and time. The truck running distance of DTSP method saves 91.87%, the truck running distance is shortened from 189.69 km to 15.4252 km. The DTSP method saves 90.45% of energy. The DTSP method brings a 29.75% cutoff in time aspect when there are two drone in running. The research introduces the cluster and TSP combination method, which is a good way to carry on last mile delivery. The result shows a bright future for drone to attend parcel delivery. The e-commerce corporation can apply this method in practice.", "keywords": [ "Drone", "Truck", "Last mile (transportation)", "Computer science", "Cluster analysis", "Mile", "Cluster (spacecraft)", "Operations research", "Simulation", "Engineering", "Artificial intelligence", "Automotive engineering" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.21078/jssi-2018-302-18" }, { "id": "https://openalex.org/W658290904", "doi": null, "title": "Assessment of Trade-offs Among Urban Delivery Vehicles", "year": 2012, "publication_date": "2012-01-01", "type": "conference-paper", "language": "en", "authors": [ "Coral A Torres", "José Holguín‐Veras", "Xuegang Jeff Ban" ], "first_author": "Coral A Torres", "venue": "European Transport Conference 2012Association for European Transport (AET)Transportation Research Board", "publisher": null, "abstract": "As it is known, a heavy truck generates more externalities than a single unit truck, which is an obvious consequence of its larger size. What it is not frequently accounted is that if the total amount of cargo to be transported by each truck type is the same, heavy trucks may be more efficient than single unit trucks. This leads to a situation in which, although the contribution to externalities of an individual single unit truck is smaller than that of a heavy truck, their total impact on a road network may be greater in urban areas particularly because of the larger single unit truck traffic. This research is intended to shed light into the overall economic benefits and costs associated with different combinations of truck traffic for urban deliveries. This was accomplished by conducting micro-simulation, statistical modeling, economic valuation and optimization of a real world urban corridor network. The simulations provided an estimate of the externalities as a function of a multimodal vector of traffic flow. Externality cost functions were generated to provide insight into the relative contributions to congestion, pavement damage, and pollution associated with traffic. These cost functions were used to find the combinations of truck traffic that minimizes the total cost of externalities. The optimization analyses demonstrates that the key factor in minimizing the externality costs while maximizing cargo space is when the truckload of a single unit truck with respect to the truckload of a heavy truck is two thirds or less.", "keywords": [ "Truck", "Externality", "Transport engineering", "Valuation (finance)", "Unit (ring theory)", "Unit cost", "Business", "Computer science", "Engineering", "Economics", "Microeconomics", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1325011" }, { "id": "https://openalex.org/W577240993", "doi": null, "title": "Reinventing the Warehouse: World Class Distribution Logistics", "year": 1993, "publication_date": "1993-03-12", "type": "article", "language": "en", "authors": [ "Roy L. Harmon" ], "first_author": "Roy L. Harmon", "venue": null, "publisher": null, "abstract": "From the Publisher:\r\nHaving successfully reinvented the in his previous books, Roy Harmon extends his discussion of productivity from the factory to twenty-first-century warehouse and logistics channels. Harmon illustrates real-life applications of important warehousing improvements in over 50 companies throughout the world and presents state-of-the-art warehouse designs for high-quality, lightning-fast, low-cost customer service. Harmon describes superior operations in a variety of environments - including retail warehousing and logistics, service parts warehousing and distribution, manufacturing material and component storage, and industrial products - that can lead to 80 to 90 percent improvements in a company's capital and inventory investments and operating expenses. To be competitive in the twenty-first century, Harmon argues, companies must create new, small focused warehouses that will decrease bureaucracy and increase the authority of managers and work-teams to ensure successful operations. Modern clusters of suppliers' facilities in regional market areas will virtually eliminate the thousands of miles products and components travel from raw material source locations through production, into the hands of their customers. Such radical changes, asserts Harmon, will reduce the size and quantity of trucks on highways and increase the volume of more economical rail and water transport of raw materials. Truly superior warehousing, Harmon argues, entails maximum utilization of all logistics assets, such as manpower, facilities, and equipment: multifunctional warehouseman teams with complete responsibility for an area of the warehouse including receiving, stocking, packing, and shipping; modular warehousing designs for fast, nondisruptive additions during peak seasons; and increased hours and days during which expensive equipment is utilized by adding night and weekend shifts. Harmon introduces other strategies such as cross-docking - a procedure used to transfer rec", "keywords": [ "Warehouse", "Business", "Service (business)", "Truck", "Factory (object-oriented programming)", "Production (economics)", "Operations management", "Operations research", "Engineering", "Marketing", "Computer science", "Economics" ], "cited_by_count": 23, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.loc.gov/catdir/samples/simon031/92037644.html" }, { "id": "https://openalex.org/W7155204441", "doi": "10.2139/ssrn.6625687", "title": "Cross-Docking vs Warehousing: A Machine Learning-based Decision", "year": 2026, "publication_date": "2026-01-01", "type": "preprint", "language": null, "authors": [ "Fei Zhang", "Mehrdad Pirnia", "James H. Bookbinder", "Sara Nasiriyani" ], "first_author": "Fei Zhang", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Unavailability", "Support vector machine", "Classifier (UML)", "Feature (linguistics)", "Robustness (evolution)", "Training set", "Point (geometry)", "Adversarial system", "Stockout" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.6625687" }, { "id": "https://openalex.org/W3198097636", "doi": "10.1080/00207543.2021.1963876", "title": "Linear-quadratic optimal control of multi-modal distribution systems with imperfect channels*", "year": 2021, "publication_date": "2021-08-31", "type": "article", "language": "en", "authors": [ "Przemysław Ignaciuk" ], "first_author": "Przemysław Ignaciuk", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "The paper examines the perspectives of linear-quadratic (LQ) optimal control in steering the process of goods distribution in logistic systems with multiple transportation options. In the considered class, the distribution centre governs the stock replenishment process of subordinate depots, from which un uncertain market demand is served. The centre is linked with the depots via shared supply channels with different characteristics regarding delay, reliability, and capacity, e.g. train vs truck delivery. The design objective is a rule of dynamical channel allocation – how many goods to send in a period using a given mode – so that balanced, cost-efficient system performance and high customer service rate are achieved. The received goods are inspected for quality defects and rejected when faulty. Thus, one needs to cope with two major sources of uncertainty: unpredictable demand variations and channel imperfections. A multi-variable LQ optimal controller is designed and presented in closed form for detailed analytical and numerical treatment. It is formally shown that despite perturbations, the controller always establishes a non-negative and upper-bounded replenishment signal, and the stock level does not cross the reference value. Conditions for warehouse space selection and obtaining full demand satisfaction at the depots are specified and formally proved.", "keywords": [ "Mathematical optimization", "Bounded function", "Quadratic equation", "Controller (irrigation)", "Channel (broadcasting)", "Modal", "Computer science", "Control theory (sociology)", "Operations research", "Engineering", "Control (management)", "Mathematics" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2021.1963876" }, { "id": "https://openalex.org/W2913172887", "doi": "10.1287/trsc.2018.0885", "title": "Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts", "year": 2019, "publication_date": "2019-08-27", "type": "article", "language": "en", "authors": [ "Said Dabia", "Stefan Røpke", "Tom Van Woensel" ], "first_author": "Said Dabia", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "This paper introduces the vehicle routing problem with time windows and shifts (VRPTWS). At the depot, several shifts with nonoverlapping operating periods are available to load the planned trucks. Each shift has a limited loading capacity. We solve the VRPTWS exactly by a branch-and-cut-and-price algorithm. The master problem is a set partitioning with an additional constraint for every shift. Each constraint requires the total quantity loaded in a shift to be less than its loading capacity. For every shift, a pricing subproblem is solved by a label-setting algorithm. Shift capacity constraints define knapsack inequalities; hence we use valid inequalities inspired from knapsack inequalities to strengthen the linear programming relaxation of the master problem when solved by column generation. In particular, we use a family of tailored robust cover inequalities and a family of new nonrobust cover inequalities. Numerical results show that nonrobust cover inequalities significantly improve the algorithm.", "keywords": [ "Knapsack problem", "Cover (algebra)", "Vehicle routing problem", "Column generation", "Constraint (computer-aided design)", "Mathematical optimization", "Integer programming", "Linear programming relaxation", "Linear programming", "Routing (electronic design automation)", "Set (abstract data type)", "Inequality" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://research.tue.nl/en/publications/eea0ee5d-e127-4fe6-92a1-111112e8a368" }, { "id": "https://openalex.org/W2732695527", "doi": "10.1016/j.procs.2015.08.210", "title": "Research of Oil Product Secondary Distribution Optimization Based on Collaborative Distribution", "year": 2015, "publication_date": "2015-01-01", "type": "conference-paper", "language": "en", "authors": [ "Xuping Wang", "Hongxin Zhan", "Jun Zhang" ], "first_author": "Xuping Wang", "venue": "Procedia Computer Science", "publisher": "Elsevier BV", "abstract": "During peak seasons, the petrol company's oil supply capacity is insufficient, therefore, with limited trucks, adjusting the distribution quantity of petrol station and formulating an effective distribution route can minimize the total cost and maximize the vehicle utilization. In this paper we observe the extension of the multi-depot half open vehicle routing problem with time windows (MDHOVRPTW) in oil product secondary distribution. Based on the characteristics of secondary distribution and MDHOVRPTW problem, this paper formulates oil distribution model intra-area with distribution quantity and distribution routing as decision variables. A proposed algorithm is applied to solve this model and result compared with the traditional non-cooperative method to verify the effectiveness of collaborative distribution.", "keywords": [ "Vehicle routing problem", "Computer science", "Truck", "Distribution (mathematics)", "Product (mathematics)", "Routing (electronic design automation)", "Mathematical optimization", "Product distribution", "Operations research", "Automotive engineering", "Mathematics", "Computer network" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877050915023376/pdf" }, { "id": "https://openalex.org/W2613324722", "doi": "10.1108/s0276-897620170000018002", "title": "Multi-Objective Traveling Salesman and Transportation Problems with Environmental Aspects", "year": 2017, "publication_date": "2017-05-08", "type": "book-chapter", "language": "en", "authors": [ "Bartosz Sawik", "Javier Faulín", "Elena Pérez Bernabeu" ], "first_author": "Bartosz Sawik", "venue": "Applications of management science", "publisher": "Emerald Publishing Limited", "abstract": "Abstract The purpose of this chapter is to solve multi-objective formulation for traveling salesman and transportation problems. Computations are based on real data for the road freight transportation of a Spanish company. The company was selected because of its importance in Spanish economy and market. This company is important in the whole country; however, it has its higher importance in the northern part of Spain. The requirements for these models are the minimization of total distance and the CO2 emissions. To achieve this, it is required to know and carry out the minimization of the total distance traveled by the trucks during the deliveries. The deliveries are going to be executed between the different locations, nodes, in the region, and Elorrio, where the depot is situated. The data have been used to decide the best route in order to obtain a minimization of cost for the company. As it was mentioned earlier, the problems are focused on the reduction of the amount of CO2 emissions and minimization of total distance; by studying different parameters, the best solutions of route transportation have been obtained. The software used to solve these models is CPLEX solver with AMPL programming language.", "keywords": [ "Travelling salesman problem", "Truck", "Minification", "Solver", "Operations research", "Computer science", "Software", "Total cost", "Transportation theory", "Computation", "Order (exchange)", "Situated" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/s0276-897620170000018002" }, { "id": "https://openalex.org/W2556091653", "doi": "10.1016/j.trpro.2016.11.004", "title": "The Smart Freight Project as a Superior Way to Cope with Congestion and Environmental Negative Externalities in Urban Areas", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Dagmara Bubel", "Katarzyna Szymczyk" ], "first_author": "Dagmara Bubel", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "Congestion, car exhaust gases, permanent noise and risk of accidents are the most common and severe problems in conurbations, especially in their cores or commerce districts. Such problems basically result from the continuously increasing amount of private and business vehicles on streets. It is obvious that more cars moving on the streets indicate more environmental negative externalities, therefore, new solutions to combat them are not only needed, but absolutely necessary. The aim of this dissemination paper is to focus on the idea of the SmartFreight project which was introduced in the UE a few years ago, but still has been neglected by many city representatives or cargo delivery companies. The project deals with all the problems that appear inside city centres due to cargo trucks services or lorry door-to-door delivery. The authors of this paper posit the hypothesis that for the time being, the SmartFreight project is the best solution against congestion and environmentally harmful externalities in urban areas. To support the hypothesis and show the effectiveness and benefits of the SmartFreight project implementation, the authors discuss all assumptions of the SmartFreight project and analyse statistics, figures and survey data collected in the cities where the SmartFreight project has been launched.", "keywords": [ "Externality", "Traffic congestion", "Truck", "Transport engineering", "Business", "Business as usual", "Environmental economics", "Environmental planning", "Economics", "Engineering", "Environmental science", "Microeconomics" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146516306184/pdf" }, { "id": "https://openalex.org/W2625627601", "doi": "10.1108/jhlscm-09-2016-0036", "title": "Hybrid cargo airships: a humanitarian logistic game changer?", "year": 2017, "publication_date": "2017-06-16", "type": "article", "language": "en", "authors": [ "Peter H. Tatham", "Craig Neal", "Yong Chun Wu" ], "first_author": "Peter H. Tatham", "venue": "Journal of Humanitarian Logistics and Supply Chain Management", "publisher": "Emerald Publishing Limited", "abstract": "Purpose Recent advances in aviation technology have seen the development of helium-filled “hybrid cargo airships” (HCAs) which have the potential to convey large payloads over significant distances at relatively low cost and with a small carbon footprint. The purpose of this paper is to demonstrate how such HCAs could be used to improve the logistic response to a rapid onset disaster. Design/methodology/approach Through consideration of three recent natural disasters (Typhoon Haiyan – The Philippines – 2013; The Nepal Earthquake – 2015; Cyclone Winston – Fiji – 2016), and drawing on both academic and practitioner literature, this paper provides an overview of how HCAs could potentially provide logistic support to those affected by similar disasters. The paper considers two scenarios: one in which the HCA replaces local truck or sea-based transport from an international airport to the disaster area, and the other in which it operates directly from a United Nations Humanitarian Response Depot to the disaster area. Findings The paper demonstrates that, when compared with the actual response to these three exemplar disasters, in the first scenario the use of HCAs provides a significantly faster but more expensive response; whereas in the second scenario, the timeline to supply is longer, but the costs are considerably less. Research limitations/implications This paper is conceptual in nature, but has been developed through an analysis of the literature related to both HCAs and humanitarian logistics. Given that the emerging generation of HCAs has yet to become fully operational, it will be important to continue to monitor their development and analyse the emerging speed/time/cost parameters in order to ascertain how HCAs might be optimally integrated into the logistic response to a disaster. Practical implications The significant cargo carrying capacity of an HCA together with its ability to operate from and into ad hoc locations (including those on water) would enable direct delivery from an international airhead or humanitarian response depot to an affected area. This has clear potential to enhance the efficiency, effectiveness and flexibility of post-disaster logistic operations. Originality/value Whilst there is some emerging discussion of the humanitarian-related use of HCAs in the literature, this generally reflects the technical aspects such as flight control systems and the actual operation of the airships. This paper is the first to offer a practical analysis of how HCAs might be used to support the work of the humanitarian logistician.", "keywords": [ "Timeline", "Natural disaster", "Carbon footprint", "Typhoon", "Truck", "Supply chain", "Humanitarian Logistics", "Operations research", "Business", "Risk analysis (engineering)", "Computer science", "Operations management" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/jhlscm-09-2016-0036" }, { "id": "https://openalex.org/W3193516070", "doi": "10.21070/prozima.v5i1.1398", "title": "Development of Particle Swarm Optimization and Simulated Annealing Algorithms to Solve Vehicle Routing Problems with Drones", "year": 2021, "publication_date": "2021-07-06", "type": "article", "language": "en", "authors": [ "Hasan Aji Prawira", "Budi Santosa" ], "first_author": "Hasan Aji Prawira", "venue": "PROZIMA (Productivity Optimization and Manufacturing System Engineering)", "publisher": "Universitas Muhammadiyah Sidoarjo", "abstract": "Vehicle Routing Problem with Drone (VRPD) is a problem of determining the number of routes for delivery of goods from the depot to a number of customers using trucks and drones. Drones are an alternative delivery tool besides trucks, each truck can be equipped with a support drone. Drones can be used to make a delivery while the truck is making others. By combining a truck and a drone, the truck can act as a tool for drone launch and landing so that the drones can reach long distances from the depot. The purpose of this problem is to minimize the cost of sending goods by trucks and drones. In this study, the Particle Swarm Optimization (PSO) and the Simulated Annealing (SA) are proposed to solve these problems. The Route Drone algorithm are used to help change the structure of the PSO and SA solutions into a VRPD solution. The proposed algorithm has been applied to 24 different scenarios ranging from 6 customers to 100 customers. The PSO and SA algorithms are able to find solutions that are close to optimal. The SA is able to find a better solution than the PSO.", "keywords": [ "Drone", "Truck", "Simulated annealing", "Particle swarm optimization", "Vehicle routing problem", "Computer science", "Swarm behaviour", "Routing (electronic design automation)", "Mathematical optimization", "Algorithm", "Engineering", "Automotive engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://prozima.umsida.ac.id/index.php/prozima/article/download/1398/1684" }, { "id": "https://openalex.org/W2306610343", "doi": "10.58837/chula.the.2000.1334", "title": "Liquefied petroleum gas distribution plan to LPG depots in the north and northeast by trains and trucks for the Petroleum Authority of Thailand", "year": 2000, "publication_date": "2000-01-01", "type": "dissertation", "language": "en", "authors": [ "Rajsuda Rungsiyakull", "Rein Boondiskulchok" ], "first_author": "Rajsuda Rungsiyakull", "venue": null, "publisher": null, "abstract": "Product distribution system is a crucial part of running petroleum business. A well-planned distribution system significantly reduces an operating cost which is the most important issue for survival amongst high competition like nowadays. As a result of this thesis, the LPG distribution plan by rails and trucks from supply sources, Banrongpoh Depot and Lankrabue Gas Separation Plant, to LPG Depots in the North and Northeast, Lampang, Nakornsawan, and Konkhaen Petroleum Terminal, is done for the Petroleum Authority of Thailand for a five-year-period (year 2001-2005). Linear programming theory is applied as a primary study to figure out the primary quantity of transporters required in order to sufficiently serves the continuously increased demand. Nevertheless, some special characteristics of the linear programming itself are not compatible with some conditions of the real world operation such as fluctuation in transportation lead time, fluctuation in demand, transporter's failure rate, etc., the simulation study is then conducted to make the primary result more practical. From the simulation technique, three rails should be added into the system in the year 2004. Furthermore, a sensitivity analysis shows that if the demand deviates within the range of -3% to +5%, this alternative will still be the optimal solution. In case the demand is lower than the expected amount greater than 3%, two rails should be invested in the year 2004, and another one rail in the year 2005. On the contrary, if the demand is larger than the forecasted amount than 5%, the optimal solution is to invest in three rails in the year 2004 and another one rail in the year 2005.", "keywords": [ "Liquefied petroleum gas", "Truck", "Petroleum", "Train", "Waste management", "Petroleum engineering", "Engineering", "Environmental science", "Distribution (mathematics)", "Transport engineering", "Automotive engineering", "Geography" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.58837/chula.the.2000.1334" }, { "id": "https://openalex.org/W2725362748", "doi": "10.1109/logistiqua.2017.7962888", "title": "An ant colony optimization algorithm for solving the full truckload vehicle routing problem with profit", "year": 2017, "publication_date": "2017-04-01", "type": "conference-paper", "language": "en", "authors": [ "Karim El Bouyahyiouy", "Adil Bellabdaoui" ], "first_author": "Karim El Bouyahyiouy", "venue": null, "publisher": null, "abstract": "This paper proposes an ant colony optimization (ACO) to solve the full-truckload selective multi-depot vehicle routing problem under time windows constraints (denoted by FT-SMDVRPTW). The objective is to construct a solution composed of a set of routes associated with the trucks, aiming at maximizing the total profit. Each order is a pickup and delivery order associated with an origin, a destination, two time windows, and a price for serving the order paid by its corresponding shipper. Each route is a sequence of selected orders to serve so that the operational constraints are respected. Our problem appears clearly when the vehicles return back. It is not obligatory to serve all orders. The motivation of this study is to solve this problem by using an ant colony optimization metaheuristic, called ant colony system, which was originally implemented for solving the basic vehicle routing problem (VRP). We modify the algorithm to incorporate a robust optimization methodology, so that the full truckload can be handled. Finally, we give a numerical example on a randomly generated instance to illustrate our approach.", "keywords": [ "Ant colony optimization algorithms", "Vehicle routing problem", "Metaheuristic", "Mathematical optimization", "Computer science", "Truck", "Profit (economics)", "Ant colony", "Pickup", "Optimization problem", "Routing (electronic design automation)", "Algorithm" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/logistiqua.2017.7962888" }, { "id": "https://openalex.org/W599700135", "doi": null, "title": "An Ant-Based Algorithm for the Cross Docking Scheduling Problem for Distribution Centers", "year": 2013, "publication_date": "2013-08-01", "type": "article", "language": "en", "authors": [ "Kuancheng Huang", "Chi-Yu Hsieh", "Yun-Cheng Chou" ], "first_author": "Kuancheng Huang", "venue": null, "publisher": null, "abstract": "With an aim to reduce inventory level, raise handling efficiency, and to improve customer service, more and more logistics operators choose to adopt the cross-docking strategy. As no storage is involved at a distribution center (DC), transportation coordination becomes critical for a successful implementation of cross docking. The Cross-Docking Scheduling Problem (CDSP) determines the schedules of the inbound (supplier) and outbound (customer) trucks for a DC with the objective of minimizing the total work time span. Owing to the nature of the sequencing decision problem associated with the CDSP, this study designs the solution algorithm based on Ant Colony Optimization (ACO), which has some inherited advantages over other meta-heuristics due to its sequential framework for the searching process and the solution building procedure. An ant-based algorithm is developed to generate the outbound sequence under the condition of one single truck. Given this ant-generated initial sequence, a heuristic of several steps is used to make the scheduling decisions for both the inbound and outbound vehicles under the multiple-truck situation. In the numerical experiment, the developed algorithm is compared with a solution algorithm based on the classic Johnson’s Rule in the literature. It is found that the developed ant-based algorithm is promising for providing a new approach to solve the CDSP.", "keywords": [ "Ant colony optimization algorithms", "Heuristics", "Scheduling (production processes)", "Truck", "Computer science", "Job shop scheduling", "Operations research", "Ant colony", "Algorithm", "Mathematical optimization", "Engineering", "Schedule" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1265744" }, { "id": "https://openalex.org/W2954889717", "doi": "10.1504/ijlsm.2020.10020416", "title": "Auction based algorithm for solving scheduling problem in cross-docking centres.", "year": 2019, "publication_date": "2019-04-03", "type": "article", "language": "en", "authors": [ "Brijesh Paul", "Eldho Paul" ], "first_author": "Brijesh Paul", "venue": "International Journal of Logistics Systems and Management", "publisher": "Inderscience Publishers", "abstract": "A cross-docking centre reduces the amount of storage and transportation in a distribution system compared to an ordinary warehouse. This paper proposes an auction-based mechanism for optimum scheduling of inbound trucks in cross-docking centres, thereby reducing the storage and transportation costs. Auction mechanisms are commonly used in different real life applications for better allocation of limited resources. Here, an effort is made to integrate the auction mechanism with the functioning of cross-docking centres. A mathematical model is developed for the optimal scheduling of inbound trucks. As expected, the determination of exact schedule for problems involving large number of variables was found to be computationally complex, and hence a heuristic methodology is also proposed in this study. In our computational experiments, we found that the proposed heuristic method is capable of producing good schedules in minimal time.", "keywords": [ "Computer science", "Truck", "Scheduling (production processes)", "Mathematical optimization", "Schedule", "Operations research", "Mathematics", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijlsm.2020.10020416" }, { "id": "https://openalex.org/W4283709271", "doi": "10.1016/j.tre.2022.102806", "title": "Selection of vehicle size and extent of multi-drop deliveries for autonomous goods vehicles: An assessment of potential for change", "year": 2022, "publication_date": "2022-06-28", "type": "article", "language": "en", "authors": [ "Garrett Bray", "David Cebon" ], "first_author": "Garrett Bray", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": "This paper examines how vehicle size and multi-drop deliveries may change as a result of the removal of the driver cost for autonomous goods vehicles. Analysis is conducted by combining parameters derived from transport economics and vehicle engineering for a series of increasingly complex applications, ultimately incorporating a unique vehicle routing problem formulation for two multi-destination applications. It is concluded that while the removal of the driver cost produced the greatest savings, the use of smaller vehicles and fewer deliveries per journey could produce incremental savings, dependent on the application. The incremental savings and potential change in vehicle sizes and number of deliveries was greatest for applications: 1) where the human driver would otherwise constitute a greater proportion of overall cost (such as urban deliveries), 2) where there is greater dispersion of delivery locations relative to the origin depot, 3) where the value of the cargo time is higher. For a UK customer deliveries case study currently using 3.5 t vans, a shift to smaller 2.1 t vans performing 40–60% fewer stops per route could lead to an additional 7–16% of cost savings, or up to 75% savings when combined with the direct driver cost savings. By contrast, for a UK supermarket distribution case study using 44 t articulated trucks, the introduction of some 26 t rigids serving fewer stops per route indicated effectively negligible potential savings compared to the 22–32% of savings due to the removal of the driver. Conclusions are conditional on treating a number of aspects of the logistics system as fixed in order to isolate factors of interest. Realistically, such aspects may be subject to change in future scenarios under the combined impact of autonomous freight vehicles and other trends.", "keywords": [ "Truck", "Vehicle routing problem", "Transport engineering", "Value of time", "Total cost", "Computer science", "Travel time", "Operations management", "Routing (electronic design automation)", "Operations research", "Automotive engineering", "Economics" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1366554522001958/pdf" }, { "id": "https://openalex.org/W4283378648", "doi": "10.1016/j.compchemeng.2022.107897", "title": "Optimisation frameworks for integrated planning with allocation of transportation resources for industrial gas supply chains", "year": 2022, "publication_date": "2022-06-23", "type": "article", "language": "en", "authors": [ "Yena L. Lee", "José Mauricio Pinto", "Lazaros G. Papageorgiou" ], "first_author": "Yena L. Lee", "venue": "Computers & Chemical Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Purchasing", "Production (economics)", "Supply chain", "Integer programming", "Plan (archaeology)", "Constraint (computer-aided design)", "Linear programming", "Operations research", "Production planning", "Automotive industry", "Column generation" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://discovery.ucl.ac.uk/10159933/1/CACE-CO2sc.pdf" }, { "id": "https://openalex.org/W7203820400", "doi": "10.3390/systems14081029", "title": "An Event-Driven and Feasibility-Audited Decision-Support Framework for Dynamic Rescheduling of Inland Container Depot Truck Operations", "year": 2026, "publication_date": "2026-08-20", "type": "article", "language": "en", "authors": [ "Shucheng Fan", "Shaochuan Fu" ], "first_author": "Shucheng Fan", "venue": "Systems", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Inland container depot (ICD) truck schedules must absorb new orders, service delays, appointment changes, congestion, and port cut-offs without destabilizing an already executed plan. This study asks whether event-triggered local repair can be separated into an explicit business-rule audit and a learned ranking of feasible task–vehicle actions. The proposed decision-support framework connects a static baseline, candidate task chains, six modeled hard-feasibility predicates, a Transformer encoder trained with proximal policy optimization (Transformer-PPO), and discrete-event execution logs. A five-seed, 120-episode confirmation gave Transformer-PPO a held-out online completion proxy (αonline) of 0.3226 and reward of 110.58, compared with 0.2581 and 61.87 for the matched multilayer perceptron (MLP); deterministic rules and search remained competitive. An independent audit of 4,968,000 action cells across 552 decision states found no disagreement with an independently coded oracle for the implemented hard predicates, while a reward-weight screen exposed the expected efficiency-stability trade-off. Together with a rolling-horizon comparator and a three-scale by three-disturbance stress test, the evidence supports an auditable system-integration contribution, not a new generic reinforcement learning (RL) algorithm or universal performance superiority. Claims are limited to synthetic simulation-based decision support.", "keywords": [ "Reinforcement learning", "Oracle", "Truck", "Port (circuit theory)", "Task (project management)", "Audit", "Scheduling (production processes)", "Container (type theory)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3390/systems14081029" }, { "id": "https://openalex.org/W641795894", "doi": null, "title": "The rolling motorway as an alternative to door-to-door unimodal road transport: lessons from the Trieste-Chop project", "year": 2014, "publication_date": "2014-05-01", "type": "article", "language": "en", "authors": [ "Romeo Danielis", "Lucia Rotaris" ], "first_author": "Romeo Danielis", "venue": "ArTS Archivio della ricerca di Trieste (University of Trieste https://www.units.it/)", "publisher": "University of Trieste", "abstract": "Although there is a consistent and strong political consensus that intermodal transport (in-termodal rail transport, specifically) should play a greater role in the movement of freight across continental Europe, the available statistics (especially) for the rolling motorway (RoMo) show only a moderate absolute increase over time and a worrying decrease in the last years. \\nUnderstanding why that happened and what can be done about it is a challenging task for transport analysts. This paper adds to the existing literature - not very abundant for the rolling motorway - by illustrating, as a case study, the planned introduction of a new RoMo service, connecting Trieste Fernetti (Italy) with Chop (Ukraine). Sharing the difficulty common to freight mode choice studies in gathering a sufficiently large sample, only 42 valid interviews with freight forwarding and transport companies and truck drivers could be collected. However, the stated-preference interviews, generated via an efficient design, allowed us to estimate a quite robust mixed logit model containing several attributes of interest. The results indicate that: a) on average, road transport is, ceteris paribus, much preferred to RoMo both by freight forwarding and transport companies and truck drivers, with the first showing a stronger adversity towards RoMo; b) travel time and monetary costs are important variables for both actors; c) highway toll is a very sensitive variable especially for the freight forwarders and transport companies; d) differently from the truck drivers, the freight forwarders and transport companies appreciate the possibility of using the RoMo service on weekends. \\nA simple simulation performed with the estimated model allowed us to conclude that, under the current circumstances, the probability that a RoMo service between Trieste Fernetti and Chop be used is close to zero. A road toll increase of €300 euros would not change the probability of using the RoMo. Only an increase of €660 euros, setting the road toll to a level equivalent to that imposed in Switzerland or Austria, where it is motivated by the need of protecting the fragile Alpine valleys, would increase to 29% the chances of the RoMo service to be chosen. However, no equivalent motivation could be advanced in the case of the Trieste-Chop corridor.", "keywords": [ "Truck", "Ceteris paribus", "Service (business)", "Transport engineering", "Business", "Operations research", "Engineering", "Economics", "Microeconomics", "Marketing" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/11368/2787325" }, { "id": "https://openalex.org/W3123077634", "doi": null, "title": "A Bi-Objective Mathematical Programming Model For Truck Scheduling Problem In A Cross-Dock System Considering The Sequencing And Outsourcing Of Products Under Interval-Valued Fuzzy Uncertainty Conditi", "year": 2020, "publication_date": "2020-08-04", "type": "article", "language": "en", "authors": [ "Seyed Meysam Mousavi" ], "first_author": "Seyed Meysam Mousavi", "venue": null, "publisher": null, "abstract": "در این مقاله یک مسئله زمان بندی کامیون ورودی و خروجی در یک سیستم چندین درب انبارمتقاطعبا فرض موعد تحویل برای کامیونهای خروجی به عنوان یک محدودیت سخت بررسی میشود؛ برایرعایت زمان موعد تحویل، رضایت م", "keywords": [ "DOCK", "Computer science", "Scheduling (production processes)", "Outsourcing", "Fuzzy logic", "Truck", "Job shop scheduling", "Operations research", "Mathematical optimization", "Engineering", "Mathematics", "Artificial intelligence" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://research.shahed.ac.ir/WSR/WebPages/Report/PaperView.aspx?PaperID=137828" }, { "id": "https://openalex.org/W4396785566", "doi": "10.1016/j.trc.2024.104647", "title": "A new perspective on carrier collaboration: Collaborative vehicle utilization", "year": 2024, "publication_date": "2024-05-09", "type": "article", "language": "en", "authors": [ "Sahand Asgharieh Ahari", "Ilke Bakir", "Kees Jan Roodbergen" ], "first_author": "Sahand Asgharieh Ahari", "venue": "Transportation Research Part C Emerging Technologies", "publisher": "Elsevier BV", "abstract": "To reduce the environmental impact and costs associated with road transport, carriers can collaborate with each other in making deliveries to their customers, typically sharing any additional profits. Our proposed collaborative vehicle utilization framework allows participating carriers to borrow trucks from each other. The borrowed truck is picked up from the lender’s depot and used to transport goods from the borrower’s depot to the delivery locations based on optimal routing decisions. Although order sharing, where carriers can make deliveries on behalf of each other, is a common approach to carrier collaboration in the literature, it is rarely implemented in practice due to carriers’ reluctance to share sensitive customer information with other carriers and their desire to serve their own customers to preserve service consistency. In contrast, our framework maintains service consistency, and does not require customer information exchange between carriers. We develop two integer programming formulations for the collaborative vehicle utilization problem and design branch-and-price algorithms to solve them. Profits are shared among participating carriers using a cooperative game theoretical approach, which is solved by a constraint generation algorithm. Thanks to short calculation times, our collaborative vehicle utilization framework can solve instance sizes that are more relevant to practical applications, and on average achieves profits within 6.4% of those obtained through order sharing.", "keywords": [ "Perspective (graphical)", "Computer science", "Artificial intelligence" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trc.2024.104647" }, { "id": "https://openalex.org/W1717571056", "doi": "10.4324/9781315756684.ch16", "title": "Vehicle Routing and Scheduling", "year": 2015, "publication_date": "2015-08-20", "type": "article", "language": "en", "authors": [ "Xingyin Wang", "Maria Battarra", "Bruce Golden", "Edward Wasil" ], "first_author": "Xingyin Wang", "venue": null, "publisher": null, "abstract": "Introduction\nThe Vehicle Routing Problem (VRP) was introduced by Dantzig and Ramser (1959) as the\ntruck dispatching problem. They presented the problem of distributing gasoline from a bulk\nterminal to a set of service stations. The VRP, as defined by Dantzig and Ramser (1959),\nmodeled a distribution problem where goods had to be delivered from a central depot to a set\nof customers or demand points. The VRP differs from the Traveling Salesman Problem (TSP)\n(Applegate et al., 2006) because a fleet of vehicles is stationed at the depot. Each vehicle can\ndeliver goods to customers, but the goods carried by a vehicle cannot exceed its capacity. The\nVRP requires that we generate a route for each vehicle (a closed circuit starting and ending at\nthe depot) such that the demand of each customer is satisfied and the transportation costs are\nminimized.", "keywords": [ "Vehicle routing problem", "Travelling salesman problem", "Truck", "Scheduling (production processes)", "Computer science", "Operations research", "Job shop scheduling", "Depot", "Mathematical optimization", "Routing (electronic design automation)", "Transport engineering", "Engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "http://opus.bath.ac.uk/47401/" }, { "id": "https://openalex.org/W2128855429", "doi": null, "title": "A Multi-Size Compartment Vehicle Routing Problem for Multi-Product Distribution: Models and Solution Procedures", "year": 2013, "publication_date": "2013-06-27", "type": "article", "language": "en", "authors": [ "Krisada Asawarungsaengkul", "Tarit Rattanamanee", "Teeradej Wuttipornpun" ], "first_author": "Krisada Asawarungsaengkul", "venue": null, "publisher": null, "abstract": "This paper presents a Multi-Size Compartment Vehicle Routing Problem with Split Pattern (MC-VRP-SP). This MC-VRP-SP focuses on the delivery of multiple types of liquid products from depot to customers. The main objective is to minimize the total traveling cost. Multiple types of fluid product are loaded to the vehicles having several capacities with non-identical capacity of compartments. Then, two mathematical models are proposed to represent this MC-VRP-SP. Since the order quantity may be over the capacity of compartment, the splitting of order is needed. The original customers demand is split according to the predetermined patterns so that it can be loaded to compartments appropriately. However, the split demands must be delivered by the same truck and one compartment can support only a single split demand. The optimization approach is utilized to solve these mathematical models within the limited computational time. A homogeneous and heterogeneous fleet of multi-compartment trucks are considered in the numerical experiment. The results from numerical examples show that the optimization approach can yield us the optimal solution only in small-scale problem. For large-scale problem, the optimization approach can determine only the feasible solutions. Thus, the local search so called 2-opt is employed to make an improvement on solution of the large-scale problem. Moreover, a saving algorithm is utilized to separate the customers into clusters. Then each cluster is solved separately by CPLEX. The results show that this clustering can significantly improve the solutions on the large-scale problem.", "keywords": [ "Vehicle routing problem", "Mathematical optimization", "Truck", "Compartment (ship)", "Computer science", "Cluster analysis", "Scale (ratio)", "Routing (electronic design automation)", "Mathematics", "Engineering", "Artificial intelligence" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.ceser.in/ceserp/index.php/ijai/article/view/2332" }, { "id": "https://openalex.org/W4307029539", "doi": "10.1016/j.swevo.2022.101201", "title": "Real-time collaborative feeder vehicle routing problem with flexible time windows", "year": 2022, "publication_date": "2022-10-21", "type": "article", "language": "en", "authors": [ "M. Salehi Sarbijan", "Javad Behnamian" ], "first_author": "M. Salehi Sarbijan", "venue": "Swarm and Evolutionary Computation", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Vehicle routing problem", "Real-time computing", "Routing (electronic design automation)", "Embedded system" ], "cited_by_count": 28, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.swevo.2022.101201" }, { "id": "https://openalex.org/W4387618961", "doi": "10.1016/j.cie.2023.109684", "title": "A mathematical model and metaheuristic approach to solve the real-time feeder vehicle routing problem", "year": 2023, "publication_date": "2023-10-13", "type": "article", "language": "en", "authors": [ "M. Salehi Sarbijan", "Javad Behnamian" ], "first_author": "M. Salehi Sarbijan", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Truck", "Routing (electronic design automation)", "Computer science", "Particle swarm optimization", "Mathematical optimization", "Metaheuristic", "Time horizon", "Integer programming", "Process (computing)", "Real-time computing", "Engineering" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2023.109684" }, { "id": "https://openalex.org/W4413419611", "doi": "10.21872/2024iise_7288", "title": "Optimizing Cross-Docking Operations: A Multi-Objective Integer Programming Approach", "year": 2024, "publication_date": "2024-10-01", "type": "conference-paper", "language": "en", "authors": [ "M. S. Omar", "Peter Ajei", "Omar I. Alhawari", "Yusuf Zakaria" ], "first_author": "M. S. Omar", "venue": null, "publisher": null, "abstract": "In logistics and supply chain management, cross-docking operations play a pivotal role in enhancing efficiency and reducing storage costs. This study introduces an innovative multi-objective integer programming model aimed at minimizing total operation time and reducing internal transportation costs within cross-docking facilities. By integrating environmental considerations, the research seeks to reduce carbon emissions and operational costs, addressing the urgent need for sustainable logistics practices. Our solution approach adapts the SA algorithm to the unique context of cross-docking, involving a dynamic and complex coordination of inbound and outbound trucks. We meticulously tailored the cooling schedule, as well as acceptance probabilities to suit the intricate nature of logistics operations. The findings offer significant insights into applying these optimization techniques to real world scenarios, promising substantial improvements in logistical operations' environmental and economic performance.", "keywords": [ "Integer programming", "Computer science", "Docking (animal)", "Mathematical optimization", "Algorithm", "Mathematics" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.21872/2024iise_7288" }, { "id": "https://openalex.org/W2122658508", "doi": "10.1007/s10288-011-0186-4", "title": "Vehicle routing problems with trailers", "year": 2011, "publication_date": "2011-11-11", "type": "article", "language": "en", "authors": [ "Juan G. Villegas" ], "first_author": "Juan G. Villegas", "venue": "4OR", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "Transport engineering", "Environmental science", "Engineering", "Computer network" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10288-011-0186-4" }, { "id": "https://openalex.org/W4403820564", "doi": "10.24294/jipd.v8i12.7049", "title": "Streamlining logistics: Innovating cross-docking distribution systems for operational excellence", "year": 2024, "publication_date": "2024-10-28", "type": "article", "language": "en", "authors": [ "Albertus Laurensius Setyabudhi", "Humala Lodewijk Napitupulu", "Rosnani Ginting", "Meilita Tryana Sembiring" ], "first_author": "Albertus Laurensius Setyabudhi", "venue": "Journal of Infrastructure Policy and Development", "publisher": null, "abstract": "A logistics service company in Batam faces challenges related to warehouse load fulfillment and sorting inaccuracies. This study aims to identify proposed efficiency improvements to the goods distribution system using the cross-docking method. The research method chosen is cross-docking, a technique that eliminates the storage process in the warehouse, thus saving time and cost. The research findings show significant benefits, especially in achieving zero inventory efficiency. Data processing and discussion revealed that efficiencies were apparent by increasing the sorting tables from 1 to 6, with an output of 90,000 kg during aircraft loading and unloading (compared to approximately 77,000 kilograms). This efficiency arises from the larger output of the sorting tables compared to the input, eliminating the need for warehousing and adding ten trucks. As a result, the shipment can be completed in one trip, with no goods stored in the warehouse. The analysis shows that implementing cross-docking in the company increases efficiency in distributing goods to forwarding partners.", "keywords": [ "Operational excellence", "Excellence", "Business", "Process management", "Computer science", "Political science" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://systems.enpress-publisher.com/index.php/jipd/article/download/7049/4327" }, { "id": "https://openalex.org/W2900903926", "doi": "10.1016/b978-0-12-814242-4.00008-9", "title": "Sustainable Logistics With Cargo Bikes—Methods and Applications", "year": 2018, "publication_date": "2018-11-16", "type": "book-chapter", "language": "en", "authors": [ "Alexandra Anderluh", "Vera C. Hemmelmayr", "Pamela C. Nolz" ], "first_author": "Alexandra Anderluh", "venue": "Elsevier eBooks", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Vehicle routing problem", "Transport engineering", "Computer science", "Operations research", "Routing (electronic design automation)", "Shortest path problem", "Heuristic", "Engineering", "Computer network", "Automotive engineering" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/b978-0-12-814242-4.00008-9" }, { "id": "https://openalex.org/W629772487", "doi": null, "title": "Assessment of Externality Trade-offs Among Urban Delivery Vehicles", "year": 2012, "publication_date": "2012-01-01", "type": "article", "language": "en", "authors": [ "Coral A. Torres Cruz", "José Holguín‐Veras", "Xuegang Jeff Ban" ], "first_author": "Coral A. Torres Cruz", "venue": "Transportation Research Board 91st Annual MeetingTransportation Research Board", "publisher": null, "abstract": "As it is known, a heavy truck generates more externalities than a single unit truck, which is an obvious consequence of its larger size. What it is not frequently accounted is that if the total amount of cargo to be transported by each truck type is the same, heavy trucks may be more efficient than single unit trucks. This leads to a situation in which, although the contribution to externalities of an individual single unit truck is smaller than that of a heavy truck, their total impact on a road network may be greater in urban areas particularly because of the larger single unit truck traffic. This research is intended to shed light into the overall economic benefits and costs associated with different combinations of truck traffic for urban deliveries. This was accomplished by conducting micro-simulation, statistical modeling, economic valuation and optimization of a real world urban corridor network. The simulations provided an estimate of the externalities as a function of a multimodal vector of traffic flow. Externality cost functions were generated to provide insight into the relative contributions to congestion, pavement damage, and pollution associated with traffic. These cost functions were used to find the combinations of truck traffic that minimizes the total cost of externalities. The optimization analyses demonstrates that the key factor in minimizing the externality costs while maximizing cargo space is the when the truckload of a single unit truck with respect to the truckload of a heavy truck is two thirds or less.", "keywords": [ "Truck", "Externality", "Transport engineering", "Valuation (finance)", "Unit (ring theory)", "Unit cost", "Business", "Computer science", "Engineering", "Economics", "Microeconomics", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1129155" }, { "id": "https://openalex.org/W2921721501", "doi": "10.17577/ijertv7is030035", "title": "Design of an Overfill Prevention System to be used in Oil Trucks; A Case Study of Kenya Pipeline Company, Eldoret Depot, Kenya", "year": 2018, "publication_date": "2018-03-05", "type": "article", "language": "en", "authors": [ "Joan J. Kiptarus" ], "first_author": "Joan J. Kiptarus", "venue": "International Journal of Engineering Research and", "publisher": "International Research Publication House", "abstract": "Design of an Overfill Prevention System to be used in Oil Trucks; A Case Study of Kenya Pipeline Company, Eldoret Depot, Kenya - written by Joan J. Kiptarus published on 2018/03/05 download full article with reference data and citations", "keywords": [ "Truck", "Pipeline (software)", "Depot", "Engineering", "Geography", "Automotive engineering", "Archaeology" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.ijert.org/research/design-of-an-overfill-prevention-system-to-be-used-in-oil-trucks-a-case-study-of-kenya-pipeline-company-eldoret-depot-kenya-IJERTV7IS030035.pdf" }, { "id": "https://openalex.org/W4415649191", "doi": "10.2139/ssrn.5676919", "title": "Split Pick-Up and Delivery Vehicle Routing Problem with Cross-Docks", "year": 2025, "publication_date": "2025-01-01", "type": "preprint", "language": null, "authors": [ "Michael Flynn", "Chris N. Potts", "Antonio Martínez-Sykora" ], "first_author": "Michael Flynn", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Heuristics", "Metric (unit)", "Routing (electronic design automation)", "Path (computing)", "Set (abstract data type)", "Vehicle routing problem", "Linear programming" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.5676919" }, { "id": "https://openalex.org/W2077636828", "doi": "10.1016/s1464-2859(10)70327-8", "title": "Rapid refill, high uptime: running forklifts with fuel cells", "year": 2010, "publication_date": "2010-10-01", "type": "article", "language": "en", "authors": [ "Vicki P. McConnell" ], "first_author": "Vicki P. McConnell", "venue": "Fuel Cells Bulletin", "publisher": "Elsevier BV", "abstract": "Fuel cell technology is reaching into industrial truck applications worldwide in some 70 pilot test and commercial adoption projects. Materials handling (MH) forklifts powered by proton-exchange (PEMFCs) and direct methanol fuel cells (DMFCs) are operating at airports, manufacturing plants, hospitals, mega retailers, food distributors, and military depots, as reported in last month's feature. The international supply chain of fuel cell stack and system OEMs (original equipment manufacturers), system integrators, hydrogen and refueling equipment suppliers, forklift OEMs and end-users stretches from the US to Europe – in particular Germany and Scandinavia – and Japan.", "keywords": [ "Original equipment manufacturer", "Truck", "Engineering", "Automotive engineering", "Proton exchange membrane fuel cell", "Automotive industry", "Supply chain", "Waste management", "Fuel cells", "Manufacturing engineering", "Business", "Computer science" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/s1464-2859(10)70327-8" }, { "id": "https://openalex.org/W4401307531", "doi": "10.48550/arxiv.2408.00663", "title": "Fleet-mix Electric Vehicle Routing Problem for the E-commerce Delivery with Limited Off-Hour Delivery Implementation", "year": 2024, "publication_date": "2024-08-01", "type": "preprint", "language": "en", "authors": [ "Hyun-Seop Uhm", "Abdelrahman Ismael", "Natalia Zuniga-Garcia", "Olcay Sahin", "James Cook", "Joshua Auld", "Monique A. Stinson" ], "first_author": "Hyun-Seop Uhm", "venue": "arXiv (Cornell University)", "publisher": "Cornell University", "abstract": "Freight truck electrification for last-mile delivery is one of the most important research topics to reduce the dependency on fossil fuel operations. Although a battery electric truck still has limitations on daily operations with lower driving ranges and higher purchasing cost than a conventional truck, operations with electrified trucks reduce total energy usage and driving noise on routes. In this paper, we propose a fleet-mix and multi-shift electric vehicle routing problem for joint implementation of fleet electrification and off-hour delivery in urban e-commerce delivery systems. Every electrified truck is assumed to have two shifts for both daytime and nighttime delivery operations while conventional trucks can operate during daytime only because of municipal restrictions on nighttime deliveries, which are related to engine noise. Also, every electrified truck must recharge between shifts at its depot. A fleet owner decides the best electrification ratio of the fleet and the proper number of chargers which gives the minimum total cost. The optimization problem is described as a mixed-integer linear programming model including common constraints for vehicle routing problem, recharging constraints, and two-shift operation of electrified trucks. A bi-level VNS-TS heuristic is also suggested for efficient solution search. The upper-level problem assigns trucks with engine type and brief route information using variable neighborhood search heuristic, and the lower-level problem finds the best route of each assigned truck using a tabu search heuristic. Scenarios with different EV driving ranges and nighttime operation availabilities are developed and evaluated with the POLARIS transportation simulation framework, and results are reported.", "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "Electric vehicle", "Computer science", "Business", "Transport engineering", "Operations research", "Engineering", "Computer network" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://arxiv.org/pdf/2408.00663" }, { "id": "https://openalex.org/W7127065434", "doi": "10.2139/ssrn.6169555", "title": "Split Pick-Up and Delivery Vehicle Routing Problem with Cross-Docks", "year": 2026, "publication_date": "2026-01-01", "type": "preprint", "language": null, "authors": [ "Michael Flynn", "Chris N. Potts", "Antonio Martínez-Sykora" ], "first_author": "Michael Flynn", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Heuristics", "Metric (unit)", "Routing (electronic design automation)", "Path (computing)", "Set (abstract data type)", "Vehicle routing problem", "Linear programming" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.6169555" }, { "id": "https://openalex.org/W3168937749", "doi": null, "title": "Βελτιστοποίηση συστήματος διανομής cross-docking με χρήση αλγορίθμου αποδοχής κατωφλιού", "year": 2020, "publication_date": "2020-02-26", "type": "article", "language": "el", "authors": [ "Γεώργιος Κεχαγιάς" ], "first_author": "Γεώργιος Κεχαγιάς", "venue": null, "publisher": null, "abstract": "Cross docking is a method of managing and distributing goods in which products move directly from the unloading dock to the loading dock, without being stored in a warehouse or distribution center. It is a relatively new distribution strategy in the supply chain that is constantly finding application from companies worldwide.\r\nOptimizing the cross-docking process has occupied many researchers in recent years, with the main problem being combining the assignment of trucks to ports and their programming. Many research and efforts have been made to improve the overall time to complete the process with evolutionary algorithms, as this is an NP-hard problem.\r\nIn this paper, a cross-docking mathematical model is formulated with two input ports and two output ports, ten incoming trucks with arrival times, 10 outgoing trucks with arrival times that the products go to the merchants and return to reload. This is a realistic modeling of cross-docking on a small scale and research level, where all the objective functions are examined, such as the minimization of the whole loading and unloading process, the maximum stock of the warehouse, the delays of the trucks, etc.\r\nThe problem was solved using the Threshold Accepting (TA) algorithm while the results were compared with Palisade's Evolver computing package. The results are in good agreement and in fact Threshold Accepting in several cases gives better objective function values ​​as shown in the diagrams.", "keywords": [ "Truck", "DOCK", "Computer science", "Minification", "Mathematical optimization", "Docking (animal)", "Operations research", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://nemertes.lis.upatras.gr/jspui/handle/10889/14817" }, { "id": "https://openalex.org/W2607186746", "doi": null, "title": "Solving real-time cross docking truck-to-door assignment and scheduling using mixed integer programming and fuzzy logic model / Wan Nor Ashikin Wan Ahmad Fatthi", "year": 2014, "publication_date": "2014-01-01", "type": "dissertation", "language": "en", "authors": [ "Wan Nor Ashikin Wan Ahmad Fatthi", "Wan Nor Ashikin" ], "first_author": "Wan Nor Ashikin Wan Ahmad Fatthi", "venue": "UiTM Institutional Repositories (Universiti Teknologi MARA)", "publisher": "Universiti Teknologi MARA", "abstract": "Efficiency of cross docking is mainly affected by the inbound operation’s total operation time that involves truck-to-door assignment and scheduling. However, many cross docking centres are still practising conservative way for assigning and scheduling trucks to dock doors. Most current studies addressed deterministic truck scheduling model, thus, unable to deal with real time and dynamic environment of trucks arrival at the cross docking centre. Thus, this study embarks on four objectives which are to identify current issues of cross docking’s truck-to-door assignment and scheduling, to estimate the unloading time of a truck using fuzzy logic modelling, to develop a Mixed Integer Programming (MIP) model that minimizes the total service time of trucks at the inbound operation based on the estimated unloading time; and to analyse the simulations of daily real time truck scheduling operations based on the proposed model. This study utilized data gathered from a third party logistics company (3PL). Results from data analysis were used as basis for establishing the models of this study. Statistical analysis was utilized for hypothesis testing. Monte Carlo simulation experiments using an automated Excel-VBA template were conducted for verification and validation of the models. Based on the results, the developed mathematical model has been proven to be reliable in producing feasible solutions with low waiting time per truck and low service time, thus, capable of minimizing the total service time for all trucks at inbound operation at cross docking centre. The models and findings of this study can be utilized to enhance the cross docking services especially in Malaysia.", "keywords": [ "Truck", "Scheduling (production processes)", "Integer programming", "Fuzzy logic", "Computer science", "DOCK", "Operations research", "Engineering", "Simulation", "Real-time computing", "Algorithm", "Artificial intelligence" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ir.uitm.edu.my/id/eprint/16466/2/TM_WAN%20NOR%20ASHIKIN%20WAN%20AHMAD%20FATTHI%20CS%2014_5.pdf" }, { "id": "https://openalex.org/W4391680760", "doi": "10.15406/mojabb.2024.08.00200", "title": "Autonomous Trucks", "year": 2024, "publication_date": "2024-02-07", "type": "article", "language": "en", "authors": [ "Larry Medsker", "Harold H Szu" ], "first_author": "Larry Medsker", "venue": "MOJ Applied Bionics and Biomechanics", "publisher": "MedCrave Group", "abstract": "A short review of the formation of the International Neural Networks Society (INNS) is followed by a research review of how Autonomous Trucks (AT) uses computational intelligence. Using the power of pairs of biological sensor structures -- “agree, signals; disagree, noise” for all weather conditions, and the modern lithium batteries, electrically driven trucks can ship goods non-stop by replacing batteries from depot to depot by former truck divers serving as depot managers. Together these can solve modern supply-chain challenges and promote the 4th economic boom.", "keywords": [ "Truck", "Computer science", "Aeronautics", "Automotive engineering", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://medcraveonline.com/MOJABB/MOJABB-08-00200.pdf" }, { "id": "https://openalex.org/W2939666956", "doi": null, "title": "WF Train Depot", "year": 1967, "publication_date": "1967-01-01", "type": "article", "language": "en", "authors": [ "Jimmy W. Cochran" ], "first_author": "Jimmy W. Cochran", "venue": null, "publisher": null, "abstract": "Photograph of an incomplete Wichita Falls train station building next to a number of train tracks. A small truck can be seen in the distant background.", "keywords": [ "Depot", "Computer science", "Geography" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://texashistory.unt.edu/ark:/67531/metapth802429/" }, { "id": "https://openalex.org/W4311287630", "doi": "10.1371/journal.pone.0278649", "title": "Evaluating the long-term operational performance of a large-scale inland terminal: A discrete event simulation-based modeling approach", "year": 2022, "publication_date": "2022-12-05", "type": "article", "language": "en", "authors": [ "Punyaanek Srisurin", "Phipat Pimpanit", "Pisit Jarumaneeroj" ], "first_author": "Punyaanek Srisurin", "venue": "PLoS ONE", "publisher": "Public Library of Science", "abstract": "Inland terminals, or dry ports, have played an important role in multimodal transportation networks as transportation hubs that provide connections between seaports and hinterland economies. While important, evaluating the operational performance of a dry port is especially challenging since it depends not only on internal factors, such as the variety and number of container handling equipment (CHE) deployed, but also on other external factors, including changes in transportation policies and container demands experienced by a dry port. To properly evaluate the holistic performance of a dry port while considering all the aforementioned factors, a discrete event simulation (DES) framework is herein developed and applied to the Ladkrabang Inland Container Depot (LICD)-one of the largest dry ports in Southeast Asia-under various operational settings. Despite complicated internal operations, the devised DES framework has shown itself useful in the analyses of LICD, due largely to its flexibility that allows users to include sophisticated operational rules into models. According to our computational results, the current LICD operation is markedly ineffective as the usage rates of all CHE types are relatively low and varied across gate operators-especially the yard truck whose values range between 2.46% and 11.15% on yearly average. We also find that, by redesigning the LICD and its internal operations, the LICD's performance could be substantially enhanced-even with fewer numbers of CHE. Regarding the four CHE types, the reach stacker seems to limit LICD's capability, as its utilization tends to first reach the maximum allowable rate of 75%, while the rubber tyred gantry crane could help boost the usage rate of yard trucks, which, in turn, results in reduced container dwelling times. Nonetheless, the modified LICD could accommodate up to 140% of the current container demand before it experiences operational difficulties induced by the saturation of container flow from rail transportation.", "keywords": [ "Term (time)", "Computer science", "Discrete event simulation", "Scale (ratio)", "Event (particle physics)", "Terminal (telecommunication)", "Statistics", "Simulation", "Mathematics", "Geography", "Computer network", "Physics" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0278649&type=printable" }, { "id": "https://openalex.org/W3012355865", "doi": "10.3390/su12062180", "title": "A Multi-commodity Network Flow Model for Sustainable Performance Evaluation in City Logistics: Application to the Distribution of Multi-tenant Buildings in Tokyo", "year": 2020, "publication_date": "2020-03-11", "type": "article", "language": "en", "authors": [ "Rémy Dupas", "Eiichi Taniguchi", "Jean‐Christophe Deschamps", "Ali Gul Qureshi" ], "first_author": "Rémy Dupas", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "The distribution of goods in crowded city centers is a major challenge. In this paper, we propose a methodology for evaluating the performance of a parcel distribution network in city logistics. This methodology encompasses the main entities of a two-tier distribution system made up of carriers, huge shopping centers (multi-tenant buildings) and intermediate depots (urban consolidation centers), as well as the parcel flows between them. This methodology aims to optimize the transport flows (distance traveled) of a given distribution network while also quantifying the impact in terms of sustainable development by measuring gas emissions. Two different states of the network with different connectivity degrees are evaluated and compared: the current state of the network as well as its future state. The transport network modeling is based on a network flow, which is expressed in linear programming and implemented with an optimization solver. The validation of this methodology is based on the parcel distribution of the Multi-tenant Buildings of the city of Tokyo. The findings are that the network with greater connectivity between the entities brings significant traveled distance reduction as well as a reduction of emissions of CO2. Another finding is that the grouping of the parcels (i.e., pooling) brings a reduction of the distance traveled compared to the transport organization without grouping and contributes to a reduction in the number of trucks.", "keywords": [ "Solver", "Flow network", "Truck", "Street network", "Transport engineering", "Pooling", "Computer science", "Transport network", "Distribution (mathematics)", "Network planning and design", "Reduction (mathematics)", "Operations research" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/12/6/2180/pdf?version=1584023270" }, { "id": "https://openalex.org/W2981738698", "doi": "10.31590/ejosat.637816", "title": "Clarke & Wright's Savings Algorithm and Genetic Algorithms Based Hybrid Approach for Flying Sidekick Traveling Salesman Problem", "year": 2019, "publication_date": "2019-10-24", "type": "article", "language": "en", "authors": [ "Büşra Özoğlu", "Emre Çakmak", "Tuğçe Koç" ], "first_author": "Büşra Özoğlu", "venue": "European Journal of Science and Technology", "publisher": "European Journal of Science and Technology", "abstract": "Over the past few years, drones also known as unmanned aerial vehicles (UAV), have been adopted as a part of transportation activities in logistic sector. This paper investigates a new version of traveling salesman problem called as flying sidekick traveling salesman problem(FSTSP) in which trucks and drones serve the customers in coordination with the objective of minimizing the total delivery distance of trucks at the depot after completing the deliveries. Clarke & Wright's savings algorithm is a well-known heuristics approach in literature, which gives better solution for classical vehicle routing problem. In this paper, a hybrid approach based on Clarke & Wright's savings algorithm and genetic algorithm is proposed for solving the new version of travelling salesman problem. In the proposed hybrid algorithm, which is the sequential use of genetic algorithm and Clarke & Wright’s savings algorithm, is used for assignment of the truck, drone or both of them to serve the customer. The solution of the genetic algorithm, which is the well-known metaheuristic approach, is enhanced with Clarke & Wright's savings algorithm. The aim of the problem is to minimize the total delivery distance according to the assignment decisions. This is the first hybrid approach in the literature including Clarke & Wright’s savings algorithm and genetic algorithm that applies for FSTSP problem. The hypothetical experiments conducted on various instances and results confirm the efficiency of the approach and give some insights on this drone delivery system.", "keywords": [ "Travelling salesman problem", "Algorithm", "Drone", "Wright", "Computer science", "Vehicle routing problem", "Genetic algorithm", "Heuristics", "Hybrid algorithm (constraint satisfaction)", "Truck", "Mathematical optimization", "Metaheuristic" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://dergipark.org.tr/en/download/article-file/839098" }, { "id": "https://openalex.org/W1974246893", "doi": "10.3141/1763-15", "title": "Ferries for Airport Drayage: Analysis of the San Francisco Bay Area", "year": 2001, "publication_date": "2001-01-01", "type": "article", "language": "en", "authors": [ "Anthony Bruzzone", "Jon Ballesteros", "John D. Glover" ], "first_author": "Anthony Bruzzone", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "The San Francisco Bay Area’s intercity air transportation system can move transcontinental goods from airport to airport in less than 6 hours. However, congestion on the Bay Area’s regional highway system significantly increases the door-to-door travel time. This study shows that using water transit instead of trucks at peak periods in two primary air express markets would save shippers 20 to 50 min of travel time. The calculated additional cost for each min of savings is $0.003 to $0.01 per air express package. Using water transport for midday air cargo drayage increases costs over the air express component, but may be justified for logistical reasons. Constraints to implementation include environmental, jurisdictional, and labor issues.", "keywords": [ "Bay", "Truck", "Transport engineering", "Environmental science", "Transit (satellite)", "Travel time", "Transit time", "Traffic congestion", "Meteorology", "Geography", "Public transport", "Engineering" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/1763-15" }, { "id": "https://openalex.org/W2750843139", "doi": "10.3846/enviro.2017.058", "title": "Waste collection in low-density areas and air pollutants formed in the process", "year": 2017, "publication_date": "2017-01-01", "type": "conference-paper", "language": "en", "authors": [ "Monica Vilms", "Viktoria Voronova" ], "first_author": "Monica Vilms", "venue": "Environmental engineering", "publisher": null, "abstract": "The particular problems waste collection in low-density areas include the long travel distances required together with the small amount of waste that can be collected during a long journey. The current research investigates the amount of air pollutants (CO2, CO, HC, NOx and PM) formed in low-density areas when the current waste collection system is applied, and it proposes options for the minimisation of pollutant emissions. The calculation of air pollutants was carried out according to the amount of burnt fuel. There are no requirements for waste truck emission levels in low-density areas. Emissions could be reduced if there were requirements to use at least EURO III trucks or trucks that comply with higher standards. The optimisation of discharge frequency needs to be dealt with. Emptying containers should be carried out at the same time and in the same collecting area. If different waste types are collected according to the door-to-door system, trucks that can collect different waste types simultaneously should be used. The quantity of emissions could be reduced by replacing the door-to-door system by a waste collection point in a village or a waste station in a municipality centre.", "keywords": [ "Truck", "Pollutant", "Environmental science", "Waste collection", "Waste management", "NOx", "Air pollutants", "Environmental engineering", "Municipal solid waste", "Air pollution", "Engineering", "Automotive engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3846/enviro.2017.058" }, { "id": "https://openalex.org/W4386025613", "doi": "10.1109/tmag.2023.3306809", "title": "Magnetic Field Analysis of 50 kW Wireless Power Transfer System for Heavy Duty Vehicles", "year": 2023, "publication_date": "2023-08-21", "type": "article", "language": "en", "authors": [ "Amelie David", "Myrel Tiemann", "Markus Clemens", "Benedikt Schmuelling" ], "first_author": "Amelie David", "venue": "IEEE Transactions on Magnetics", "publisher": "IEEE Magnetics Society", "abstract": "This scientific publication delves into the magnetic field characteristics of high-power wireless transfer systems in the context of two trucks parked side by side with potential misalignment. The study aims to reflect real-life scenarios encountered in parking lots or depots, where multiple trucks undergo simultaneous charging. For comprehensive investigations, we employ unipolar coil arrangements specifically designed for high-power transfer applications. Electromagnetic field (EMF) analyses are performed using finite-element analysis modeling. With an evaluation method developed based on standards, the results show that depending on the relative positioning of the considered trucks, measures to guarantee EMF safety-level compliance might become necessary.", "keywords": [ "Wireless power transfer", "Truck", "Context (archaeology)", "Electromagnetic coil", "Computer science", "Automotive engineering", "Wireless", "Electromagnetic field", "Power (physics)", "Electrical engineering", "Field (mathematics)", "Finite element method" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tmag.2023.3306809" }, { "id": "https://openalex.org/W4382141495", "doi": "10.3390/inventions8040080", "title": "Practical Improvement Scenarios for an Innovative Waste-Collection Recycling Program Operating with Mobile Green Points (MGPs)", "year": 2023, "publication_date": "2023-06-24", "type": "article", "language": "en", "authors": [ "Konstantinos Tsimnadis", "Grigorios L. Kyriakopoulos", "Stefanos Leontopoulos" ], "first_author": "Konstantinos Tsimnadis", "venue": "Inventions", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Since 2021, the prefectural authorities of the Attica Region in Greece have been operating a rewarding recycling program for the collection of clean recyclable waste in collaboration with the “Specialist Integrated Association of the Prefecture of Attica” (EDSNA, in Greek) and private contractors, called “THE GREEN CITY”. This program mobilizes almost 30 mobile green points (MGPs) daily, which are self-propelled trucks that collect clean recyclable materials from citizens and businesses across the Attica Region. After one year of operation, this program has shown promising results, having more than 100,000 registered citizens and having already collected over 500 tons of clean recyclable municipal solid wastes in more than 60 municipalities of Attica. However, these promising results are accompanied by some significant financial and environmental costs. This study presents two different practical improvement scenarios for THE GREEN CITY recycling program’s current situation that ensure (a) the shortening of the annual kilometers and time on the remote routes of all programs, (b) the annual fuel-cost decrease for the MGPs and (c) the annual reduction of their CO2 emissions into the atmosphere. Afterwards, we compare these two scenarios and conclude that the “first improvement scenario with main depot decentralization” is more realistic, feasible and has a bigger total sum of positive impacts than the second one. Therefore, this study strongly suggests the implementation of the “first improvement scenario with main depot decentralization” and opens the road to future improvement scenarios for various waste-management systems or recycling programs.", "keywords": [ "Truck", "Decentralization", "Business", "Municipal solid waste", "Waste management", "Environmental planning", "Environmental economics", "Transport engineering", "Environmental science", "Engineering" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2411-5134/8/4/80/pdf?version=1687686242" }, { "id": "https://openalex.org/W3028718307", "doi": "10.1109/iciea49774.2020.9102045", "title": "Understanding Organizational Characteristics for Cross-Docking Adoption: A Case Study of Thai Industries", "year": 2020, "publication_date": "2020-04-01", "type": "conference-paper", "language": "en", "authors": [ "Phatcharika Naunthong", "Ploy Sud-On" ], "first_author": "Phatcharika Naunthong", "venue": null, "publisher": null, "abstract": "The cross-docking technique has attracted businesses as a way to respond to customer orders by increasing goods flow and shortening the shipping cycle. In cross-dock, incoming goods are sorted and directly reloaded to the outgoing trucks without being stored in between. The literatures have reviewed on the suitability of cross-dock and organizational structure, yet only few have identified the common attributes or they only focused on one aspect of organizational characteristics. This paper pertains to the study of organizational characteristics for cross-docking adoption. A total of 300 questionnaires were collected from different firms in central Thailand. Based on the descriptive analysis, the results showed that cross-dock is widely used in different industries such as retailing, food and drug and textiles. The predominant goods that go through cross-dock are not just only finished products but also raw material. Types of industry and inventory were found to have a significant impact on the choices of cross-dock, while size of organization and automation level showed no influence on the selection of distribution operations.", "keywords": [ "DOCK", "Truck", "Business", "Industrial organization", "Computer science", "Operations management", "Marketing", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/iciea49774.2020.9102045" }, { "id": "https://openalex.org/W7162854518", "doi": "10.1016/j.samod.2026.100067", "title": "Fleet-mix electric vehicle routing problem for the e-commerce delivery with limited off-hour delivery implementation", "year": 2026, "publication_date": "2026-01-01", "type": "article", "language": "en", "authors": [ "Hyun-Seop Uhm", "Abdelrahman Ismael", "Natalia Zuniga-Garcia", "Olcay Sahin", "Joshua Auld" ], "first_author": "Hyun-Seop Uhm", "venue": "Sustainability Analytics and Modeling", "publisher": "Elsevier BV", "abstract": "Operations with battery electric trucks can reduce total energy and transportation costs on daily delivery tours although an electric truck has operational limitations with lower driving ranges and higher purchasing cost than a conventional truck. In this paper, we propose a fleet-mix and multi-shift electric vehicle routing problem for joint implementation of fleet electrification and off-hour delivery in urban e-commerce delivery systems. Every electrified truck is assumed to have two shifts for both daytime and nighttime delivery operations while conventional trucks can operate during daytime only because of municipal restrictions on nighttime deliveries, which are related to engine noise. Also, every electrified truck must recharge between shifts at its depot. A fleet owner decides the best electrification ratio of the fleet and the proper number of chargers which gives the minimum total cost. The optimization problem is described as mixed-integer linear programming model including common constraints for vehicle routing problem, recharging constraints, and two-shift operation of electrified trucks. A bi-level meta-heuristic algorithm is also suggested for efficient solution search. The upper-level problem assigns trucks with engine type and brief tour information using variable neighborhood search heuristic, and the lower-level problem finds the best tour of each assigned truck using a tabu search heuristic. Scenarios with different driving ranges and nighttime operation availabilities are developed and evaluated with the POLARIS transportation simulation framework, and results are reported.", "keywords": [ "Electric vehicle", "Vehicle routing problem", "Routing (electronic design automation)", "Key (lock)", "Transmission (telecommunications)" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.samod.2026.100067" }, { "id": "https://openalex.org/W2950720046", "doi": null, "title": "Πολυκριτηριακή βελτιστοποίηση λειτουργίας συστήματος διανομής Cross – docking με χρήση γενετικών αλγορίθμων", "year": 2018, "publication_date": "2018-04-29", "type": "dissertation", "language": "el", "authors": [ "Θεοφάνης Σπυρίδης" ], "first_author": "Θεοφάνης Σπυρίδης", "venue": null, "publisher": null, "abstract": "A cross - docking facility is an intermediate node in a distribution network and is used exclusively for the transhipment of goods from the trucks. The process involves unloading the products from the incoming trucks, sorting and gathering them, and finally sending them to the end customers. Unlike other distribution methods, in this case the goods are not stored, resulting in zero or almost zero inventory. Most cross-docking articles aim to optimize the make of the above process, ie the total time to complete all the processes that take place in a cross-docking facility.\r\nThis paper presents a model of multi-objective optimization that produces feasible and effective solutions, with consideration not only minimizing the makespan, and the total service time of incoming trucks, the total departure time and late departure time (tardiness) of outgoing goods and the zero inventory policy implementation and Just-in-time goods delivery philosophy. The model being developed aims to increase system performance by optimizing the flow of incoming and outgoing products, reducing inventory and product delivery time, and thus to improve service and customer satisfaction and productivity growth a cross-docking system.\r\nThe optimization process is based on the use of genetic algorithms because of their potential to look at a variety of possible solutions and to reach the optimum in a short time. The capabilities of the proposed model were examined in a number of case studies. Various scenarios were tested with the introduction of parameters into a single objective function, types of constraints and gravity factors. Evaluation of the results makes the model capable of generating optimal solutions to the truck door assignment and the truck scheduling problem respectively.", "keywords": [ "Truck", "Tardiness", "Computer science", "Operations research", "Engineering", "Job shop scheduling", "Computer network", "Routing (electronic design automation)", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://nemertes.library.upatras.gr/jspui/handle/10889/11357" }, { "id": "https://openalex.org/W7162365576", "doi": null, "title": "Multi-objective optimization of a cross-docking distribution system using genetic algorithms", "year": 2018, "publication_date": "2018-04-29", "type": "dissertation", "language": "gr", "authors": [ "Θεοφάνης Σπυρίδης" ], "first_author": "Θεοφάνης Σπυρίδης", "venue": "Νημερτής", "publisher": null, "abstract": "Μια εγκατάσταση cross – docking είναι ένας ενδιάμεσος κόμβος σε ένα δίκτυο διανομής και χρησιμοποιείται αποκλειστικά για τη μεταφόρτωση των εμπορευμάτων από τα φορτηγά. Η διαδικασία περιλαμβάνει την εκφόρτωση των προϊόντων από τα εισερχόμενα φορτηγά, την διαλογή και την συγκέντρωσή τους, και τέλος την αποστολή τους στους τελικούς πελάτες. Σε αντίθεση με τους υπόλοιπους τρόπους διανομής σε αυτή την περίπτωση τα εμπορεύματα δεν αποθηκεύονται με αποτέλεσμα να έχουμε μηδενικό ή σχεδόν μηδενικό απόθεμα. Τα περισσότερα άρθρα της βιβλιογραφίας του cross – docking έχουν ως αντικειμενικό σκοπό την βελτιστοποίηση του makespan της παραπάνω διαδικασίας, δηλαδή του συνολικού χρόνου ολοκλήρωσης όλων των διεργασιών που λαμβάνουν χώρα σε μία εγκατάσταση cross – docking. Στην παρούσα εργασία παρουσιάζεται ένα μοντέλο πολυκριτηριακής βελτιστοποίησης που παράγει εφικτές και αποδοτικές λύσεις, με την θεώρηση όχι μόνο της ελαχιστοποίησης του makespan, αλλά και του ολικού χρόνου εξυπηρέτησης (total service time) των εισερχόμενων φορτηγών, του συνολικού χρόνου αναχώρησης (departure time) και του χρόνου αργοπορημένης αναχώρησης (tardiness) των εξερχόμενων φορτηγών καθώς και της εφαρμογής πολιτικής μηδενικού αποθέματος (zero inventory policy) και της Just-In-Time φιλοσοφίας παράδοσης των εμπορευμάτων. Το μοντέλο που αναπτύσσεται στοχεύει στην αύξηση της αποδοτικότητας του συστήματος, βελτιστοποιώντας την ροή των εισερχόμενων και εξερχόμενων προϊόντων στην εγκατάσταση, την μείωση του αποθέματος και του χρόνου παράδοσης των προϊόντων, άρα και στην βελτίωση της εξυπηρέτησης και της ικανοποίησης των πελατών και της αύξησης της παραγωγικότητας ενός συστήματος cross – docking. Η διαδικασία βελτιστοποίησης βασίζεται στη χρήση γενετικών αλγορίθμων λόγω των δυνατοτήτων τους να εξετάζουν πλήθος δυνατών λύσεων και να καταλήγουν στη βέλτιστη σε σύντομο χρονικό διάστημα. Οι δυνατότητες του προτεινόμενου μοντέλου εξετάστηκαν σε πλήθος μελετών περίπτωσης. Ελέγχθηκαν διαφορετικά σενάρια με την εισαγωγή παραμέτρων σε μία ενιαία αντικειμενική συνάρτηση, τύπους περιορισμών και παραγόντων βαρύτητας. Η αξιολόγηση των αποτελεσμάτων καθιστά το μοντέλο ικανό να παράγει βέλτιστες λύσεις για το πρόβλημα της ανάθεσης των φορτηγών σε θύρες (truck door assignment) και του προγραμματισμού των φορτηγών (truck scheduling) αντίστοιχα.", "keywords": [ "Job shop scheduling", "Genetic algorithm", "Docking (animal)", "Scheduling (production processes)", "Minification" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10889/11357" }, { "id": "https://openalex.org/W4412584916", "doi": "10.1016/j.ejor.2025.07.027", "title": "Exact solution approaches for the traveling salesman problem with a drone station", "year": 2025, "publication_date": "2025-07-23", "type": "article", "language": "en", "authors": [ "Zhiyuan Shi", "Shaozhi Hong", "Zeling Wang", "Ang Li" ], "first_author": "Zhiyuan Shi", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Travelling salesman problem", "Drone", "Traveling purchaser problem", "Computer science", "Mathematical optimization", "Bottleneck traveling salesman problem", "2-opt", "Operations research", "Mathematics", "Biology" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2025.07.027" }, { "id": "https://openalex.org/W4401406582", "doi": "10.1016/j.ijdrr.2024.104730", "title": "Emergency water distribution systems to improve spatial equality and spatial equity in a heterogeneous community with differing mobility characteristics", "year": 2024, "publication_date": "2024-08-06", "type": "article", "language": "en", "authors": [ "Jooho Kim", "Dagyo Kweon", "Sang Jin Kweon" ], "first_author": "Jooho Kim", "venue": "International Journal of Disaster Risk Reduction", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Equity (law)", "Truck", "Population", "Socioeconomic status", "Computer science", "Spatial distribution", "Transport engineering", "Environmental science", "Environmental economics", "Engineering", "Statistics", "Mathematics" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ijdrr.2024.104730" }, { "id": "https://openalex.org/W4308728671", "doi": "10.21203/rs.3.rs-1016849/v1", "title": "Matheuristics to solve an integrated scheduling and vehicle routing problem in a cross-docking center", "year": 2022, "publication_date": "2022-11-10", "type": "preprint", "language": "en", "authors": [ "Imen Hamdi" ], "first_author": "Imen Hamdi", "venue": "Research Square", "publisher": null, "abstract": null, "keywords": [ "Job shop scheduling", "Computer science", "Vehicle routing problem", "Truck", "Scheduling (production processes)", "Mathematical optimization", "Linear programming", "Operations research", "Routing (electronic design automation)", "Algorithm", "Computer network", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.researchsquare.com/article/rs-1016849/latest.pdf" }, { "id": "https://openalex.org/W922608605", "doi": null, "title": "Optimisation et simulation d’une plate-forme gérée en cross-dock", "year": 2016, "publication_date": "2016-03-18", "type": "dissertation", "language": "fr", "authors": [ "Lijuan Zhang" ], "first_author": "Lijuan Zhang", "venue": "HAL (Le Centre pour la Communication Scientifique Directe)", "publisher": "Centre National de la Recherche Scientifique", "abstract": "Cross docking is an efficient and dynamic logistic process that directly transfers goods from a supplier to a customer. This thesis addresses the door assignment and resource management problem with truck time windows constraints for a specific cross dock. The problems are formulated as mixed integer programming (MIP) models. The objective is to minimize the weighted sum of the total travel distance and cost which includes labor cost and penalty cost. A heuristic based on genetic algorithm (GA) is developed to solve the problems. Two gene repair methods are proposed to repair infeasible solutions. The computational results show that genetic algorithms outperforms the solution of MIP model with CPLEX in a given CPU time, for medium and large size instances, and that the second gene repair method outperforms the first one. In order to describe the behavior and gather information on the cross dock, a model based on Petri net is built to study the cross docks and simulations are carried out with Tina. The simulation results for different resource number lead us to obtain the relevant times to improve the original time windows, the makespan at each work station, the free time interval in the cross dock and the free resource number at each time period, which provide relevant information on the resource management. Besides, according to the simulation results, the original MIP formulations are improved. Then we propose a new MIP formulation, which determine not only door assignment, but also resources at each time period at each work station. Computational results reveal that the new MIP model control resources in cross dock more efficiently and outperforms the first model.", "keywords": [ "Humanities", "DOCK", "Political science", "Philosophy", "Biology" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://theses.hal.science/tel-01443558/document" }, { "id": "https://openalex.org/W2561604926", "doi": "10.6838/yzu.2013.00197", "title": "A two-phase algorithm for the Sequential Vehicle Routing Problem with Cross Docking (SVRPCD)", "year": 2013, "publication_date": "2013-01-01", "type": "article", "language": "en", "authors": [ "馬荷心" ], "first_author": "馬荷心", "venue": null, "publisher": null, "abstract": "Today’s customer-driven economic environment shifts from “supply chain” to “demand chain”. To successfully compete, companies are faced with the challenge of minimizing inventory and reducing warehouse costs whenever possible while keeping retailers’ shelves full. Cross Docking is a strategy whose ability to reduce lead times, control inventory carrying costs and deliver just-in-time service with a minimal investment makes it an attractive option for many companies responding to economic pressures. In a cross docking strategy, warehouses and distribution centers serve as transfer points for inventory, but no inventory is held at these transfer points. One of the keys to keeping a Cross Docking facility synchronized is to design a system and schedule that are obtainable, taking into account travel times and expectations for how much freight will actually fit on a truck; therefore, Vehicle Routing should be considered.\n\nThis research examines a Vehicle Routing Problem with Cross Docking (VRPCD) considering cross docking operational characteristics such as assignment restrictions, deadlines and door environment. A sequential operational VRPCD model is presented. Its objective is to determine the best route that minimizes operational costs of shipment, and the minimum operational cost within the cross docking facility.\nA two-phase algorithm using Variable Neighborhood Search (VNS) has been proposed. The experimental results show that the VNS algorithm is capable of finding good solutions in a much shorter computation time when compared with Gurobi Optimizer solutions. Good quality of solutions is obtained in all the experiments developed.", "keywords": [ "Vehicle routing problem", "Schedule", "Operations research", "Computer science", "Simulated annealing", "Supply chain", "Inventory control", "Mathematical optimization", "Routing (electronic design automation)", "Algorithm", "Engineering", "Business" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.airitilibrary.com//Publication/Index?FirstID=U0009-2801201415030842" }, { "id": "https://openalex.org/W4283071618", "doi": "10.3390/agriengineering4020037", "title": "Central Control for Optimized Herbaceous Feedstock Delivery to a Biorefinery from Satellite Storage Locations", "year": 2022, "publication_date": "2022-06-17", "type": "article", "language": "en", "authors": [ "Jonathan P. Resop", "John S. Cundiff", "Robert D. Grisso" ], "first_author": "Jonathan P. Resop", "venue": "AgriEngineering", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "The delivery of herbaceous feedstock from satellite storage locations (SSLs) to a biorefinery or preprocessing depot is a logistics problem that must be optimized before a new bioenergy industry can be realized. Both load-out productivity, defined as the loading of 5 × 4 round bales into a 20-bale rack at the SSL, and truck productivity, defined as the hauling of bales from the SSLs to the biorefinery, must be maximized. Productivity (Mg/d) is maximized and cost (USD/Mg) is minimized when approximately the same number the loads is received each day. To achieve this, a central control model is proposed, where a feedstock manager at the biorefinery can dispatch a truck to any SSL where a load will be available when the truck arrives. Simulations of this central control model for different numbers of simultaneous load-out operations were performed using a database of potential production fields within a 50 km radius of a theoretical biorefinery in Gretna, VA. The minimum delivered cost (i.e., load-out plus truck) was achieved with nine load-outs and a fleet of eight trucks. The estimated cost was 11.24 and 11.62 USD/Mg of annual biorefinery capacity (assuming 24/7 operation over 48 wk/y for a total of approximately 150,000 Mg/y) for the load-out and truck, respectively. The two costs were approximately equal, reinforcing the desirability of a central control to maximize the productivity of these two key operations simultaneously.", "keywords": [ "Truck", "Biorefinery", "Raw material", "Environmental science", "Productivity", "Haulage", "Engineering", "Automotive engineering", "Waste management", "Biofuel", "Mechanical engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2624-7402/4/2/37/pdf?version=1655807875" }, { "id": "https://openalex.org/W157928050", "doi": "10.1007/978-3-642-33012-4_30", "title": "Studying Two-Stage Vehicle Scheduling at Distribution Center Based on Cross-Docking Model", "year": 2012, "publication_date": "2012-11-28", "type": "conference-paper", "language": "en", "authors": [ "Jing Gao", "Ju-hong Gao", "Ju-hong Gao", "Ju-hong Gao" ], "first_author": "Jing Gao", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Truck", "Sorting", "Scheduling (production processes)", "Distribution center", "Computer science", "Operations research", "Real-time computing", "Engineering", "Automotive engineering", "Algorithm", "Operations management", "Business" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-642-33012-4_30" }, { "id": "https://openalex.org/W2586568294", "doi": "10.1109/smc.2016.7844300", "title": "A technique for the optimal management of containers' drayage at intermodal terminals", "year": 2016, "publication_date": "2016-10-01", "type": "conference-paper", "language": "en", "authors": [ "Mariagrazia Dotoli", "Nicola Epicoco" ], "first_author": "Mariagrazia Dotoli", "venue": null, "publisher": null, "abstract": "This paper focuses on optimizing one of the most critical activities in door-to-door intermodal transportation, i.e., the containers' drayage by road. We present a technique to solve in an exact and optimal way the pick-up and delivery problem under the typical assumptions of intermodal transportation: full truck load, split delivery, clustered backhauls, and time windows. The method allows limiting the distance traveled by road, enabling to match a delivery with a pick-up request, while respecting customers' service time windows, vehicles availability, and rental needs. Thus, intermodal companies can manage vehicle routing and scheduling problems in an integrated way. The technique effectiveness is shown by a real case study.", "keywords": [ "Truck", "Renting", "Vehicle routing problem", "Limiting", "Computer science", "Scheduling (production processes)", "Transport engineering", "Routing (electronic design automation)", "Service (business)", "City logistics", "Operations research", "Computer network" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/smc.2016.7844300" }, { "id": "https://openalex.org/W3027871297", "doi": "10.1155/2020/8868892", "title": "Addressing the Bike Repositioning Problem in Bike Sharing System: A Two-Stage Stochastic Programming Model", "year": 2020, "publication_date": "2020-05-20", "type": "article", "language": "en", "authors": [ "Qiong Tang", "Fu Zhuo", "Dezhi Zhang", "Hao Guo", "Minyi Li" ], "first_author": "Qiong Tang", "venue": "Scientific Programming", "publisher": "Hindawi Publishing Corporation", "abstract": "In this paper, a bike repositioning problem with stochastic demand is studied. The problem is formulated as a two-stage stochastic programming model to optimize the routing and loading/unloading decisions of the repositioning truck at each station and depot under stochastic demands. The goal of the model is to minimize the expected total sum of the transportation costs, the expected penalty costs at all stations, and the holding cost of the depot. A simulated annealing algorithm is developed to solve the model. Numerical experiments are conducted on a set of instances from 20 to 90 stations to demonstrate the effectiveness of the solution algorithm and the accuracy of the proposed two-stage stochastic model.", "keywords": [ "Stochastic programming", "Computer science", "Mathematical optimization", "Simulated annealing", "Truck", "Bike sharing", "Set (abstract data type)", "Dynamic programming", "Stage (stratigraphy)", "Operations research", "Stochastic modelling", "Vehicle routing problem" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/sp/2020/8868892.pdf" }, { "id": "https://openalex.org/W2249065780", "doi": "10.1007/978-3-319-20863-3_18", "title": "An Adaptive Large Neighborhood Search for the Reverse Open Vehicle Routing Problem with Time Windows", "year": 2015, "publication_date": "2015-08-08", "type": "book-chapter", "language": "en", "authors": [ "Kristian Schopka", "Herbert Kopfer" ], "first_author": "Kristian Schopka", "venue": "Lecture notes in logistics", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Vehicle routing problem", "Benchmark (surveying)", "Computer science", "Set (abstract data type)", "Routing (electronic design automation)", "Extension (predicate logic)", "Position (finance)", "Mathematical optimization", "Mathematics", "Computer network", "Geography", "Economics" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-20863-3_18" }, { "id": "https://openalex.org/W7119223906", "doi": "10.1080/21680566.2025.2611113", "title": "Truck trip and long-haul truck tour identification based on national-level truck GPS data", "year": 2026, "publication_date": "2026-01-08", "type": "article", "language": "en", "authors": [ "Yixuan Pan", "Aliakbar Kabiri", "Aref Darzi", "Mohammad Ashoori", "Qianqian Sun", "Lei Zhang" ], "first_author": "Yixuan Pan", "venue": "Transportmetrica B Transport Dynamics", "publisher": "Taylor & Francis", "abstract": "Truck Global Positioning System (GPS) data provide continuous location observations for a large sample of trucks and thus are valuable inputs for truck travel demand estimation. However, truck GPS data only record where and when each truck was observed instead of the actual loading and unloading stays, maintenance stops, and rest breaks. In particular, long-haul truck depots and tours lack sufficient investigation for a coherent estimation of long-term large-scale truck travel demand. To facilitate the GPS data-driven truck travel demand estimation, this study proposes a comprehensive framework of both heuristic rules and data-driven methods for imputing trips using spatial-temporal features of the GPS pings, constructing trip chains using truck stay features and point-of-interest data, and revealing tours for four types of long-haul trucks based on the existence of fixed depots. The framework is proven efficient when it uses a one-month nationwide truck GPS dataset in the United States.", "keywords": [ "Truck", "Global Positioning System", "Identification (biology)", "Data collection", "Assisted GPS" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/21680566.2025.2611113" }, { "id": "https://openalex.org/W2294216356", "doi": "10.1016/b978-1-78242-366-9.00015-0", "title": "Solving the woody supply chain for Ireland's expanding biomass sector", "year": 2016, "publication_date": "2016-01-01", "type": "book-chapter", "language": "en", "authors": [ "Ger J. Devlin", "Amanda Sosa", "Mauricio Acuña" ], "first_author": "Ger J. Devlin", "venue": "Elsevier eBooks", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Supply chain", "Heuristics", "Engineering", "Scheduling (production processes)", "Supply chain optimization", "Travelling salesman problem", "Transport engineering", "Schedule", "Operations research", "Automotive engineering", "Operations management" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/b978-1-78242-366-9.00015-0" }, { "id": "https://openalex.org/W2316568129", "doi": "10.1061/41064(358)383", "title": "Optimization of Vehicle Routing for Plowing and Snow Disposal", "year": 2009, "publication_date": "2009-07-23", "type": "conference-paper", "language": "en", "authors": [ "Dali Zhang" ], "first_author": "Dali Zhang", "venue": null, "publisher": null, "abstract": "Plowing, snow loading, and hauling operations involve a number of vehicle routing problems where roads have to be traversed by plows, snow blowers, and trucks. This paper analyzes the problem of designing efficient routes for plowing and hauling trucks in snow emergencies. The plow routing and haul routing problems are determining a set of routes, each performed by a vehicle that starts and ends at its own depot, so that all the road segments are serviced, all the operational constraints are satisfied, and the total deadhead distance is minimized. Firstly, the typical characteristics of vehicle routing problems related to plowing and snow disposal operations are analyzed by considering their main components. Then, by using network transformation, a Capacitated Arc Routing Problem (CARP) is formulated to find the routes for vehicles. Heuristic procedures are applied because the problem has been shown to be NP-hard..", "keywords": [ "Arc routing", "Truck", "Routing (electronic design automation)", "Snow", "Snow removal", "Computer science", "Vehicle routing problem", "Transport engineering", "Heuristic", "Engineering", "Computer network", "Automotive engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1061/41064(358)383" }, { "id": "https://openalex.org/W1818014559", "doi": null, "title": "Schenker's Box Handling Processes for Dell Computers at a Cross-Docking Centre in Copenhagen.", "year": 2002, "publication_date": "2002-01-01", "type": "other", "language": "en", "authors": [ "Henrik Jan Persson", "Håkan Persson" ], "first_author": "Henrik Jan Persson", "venue": "Lund University Publications Student Papers (Lund University)", "publisher": "Lund University", "abstract": "The 17th September 2001 the distributor Schenker started to cooperate with the computer systems manufacturer Dell to deliver Dell's products to the Nordic market. In the beginning of a new cooperation new processes are formed and they are often developed to solve the local, immediate problems without considering the overall picture. In the distribution network from Dell's plants in Ireland and Holland to the Nordic customers, the cross-docking centre in Copenhagen is a central part as a hub in the network. Almost all boxes are distributed through this hub in order to be sorted to one of the nine split point destinations located in Norway, Denmark, Sweden or Finland. In order to improve the packet hand ling and the effectiveness at the cross docking centre in Copenhagen different scenarios have been developed with the simulation tool AutoMod1 within the boundaries of this master thesis. On the basis of the simulation models various changes and how they affect the flow have been studied in order to find a packet handling that improves the effectiveness at the cross-docking centre. Eight different models have been studied. One original model that shows how the material flow is working today, three basic models that include one alteration each in comparison to the original model and four models that include all possible combinations of the basic models. Today the cross-docking process is divided in three sub processes, one for each of the box sizes; small, medium and large. Only the medium sized boxes can use the sorting conveyor while the small and large boxes are scanned, sorted and transported manually. The basic models are: Ø The Värnamo model, which, via an extra conveyor, enables a faster cross-docking of the boxes that are going to the split-point in Värnamo, Sweden. Ø The Single Process model, where all boxes are sorted by the conveyor. Ø The RFID2 model, where all scanning of the boxes is made automatically. The flow of Dell's computers from Ireland to the Nordic market has been studied but only the cross-docking centre in Copenhagen has been modelled in Automod. That means that the manufacturing sites and the transport ways have not been included in the model. The different models? cross-docking time and need of resources have been compared, but no thorough comparisons between the costs of the different packet handling strategies have been made. The Original model is somewhat optimized to the basic conditions that are equal for all the models. Therefore the original model handles the competition from the other models well in terms of cross-docking time. On the other hand several of the new models require less resources and by that holds potential to enhance their performance. In a short-term point of vie w it is realistic to implement the Single Process model if it is possible to increase the velocity of the conveyor and do a complete identification of the new bottlenecks that will arise. The model uses four resources less tha n the original model but gives a longer cross-docking time due to that only one truck is unloaded at a time. A great advantage by loading all boxes on the conveyor is that the cross-docking process is equal for all box sizes. 1 See Section 3.1.2 for a presentation of the software Automod 2 Radio Frequency Identification. The RFID model has the best performance of all simulation models and uses five resources less than the original model. Today the technology for RFID is too expensive and the performance is not good enough, but when the day comes that the price and performance on RFID is at a realistic level, the organisation and the technologies should be prepared for the RFID technology. In a long-term point of view the RFID-Single Process combination is the future for the crossdocking centre. One process for all box sizes and automatic radio frequency scanning ensures that the human errors will decrease dramatically. The potential in increasing the velocity on the conveyor and reducing the cross-docking time even more seems to be good. The Värnamo model uses one more resource and has the same cross-docking time as the Original model. All combinations involving the Värnamo concept can therefore be discarded. The adding of an extra conveyor cost money and does not result in higher capacity.", "keywords": [ "Destinations", "Engineering", "Network packet", "Operations research", "Computer science", "Geography", "Computer network" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://lup.lub.lu.se/student-papers/record/1318810" }, { "id": "https://openalex.org/W2485456934", "doi": "10.1108/s2044-994120140000006003", "title": "Comparison of Vehicle Miles Traveled and Pollution from Three Goods Movement Strategies", "year": 2014, "publication_date": "2014-12-03", "type": "book-chapter", "language": "en", "authors": [ "Erica Wygonik", "Anne Goodchild" ], "first_author": "Erica Wygonik", "venue": null, "publisher": null, "abstract": "Abstract Purpose To provide insight into the role and design of delivery services to address CO2, NOx, and PM10 emissions from passenger travel. Methodology/approach A simulated North American data sample is served with three transportation structures: last-mile personal vehicles, local-depot-based truck delivery, and regional-warehouse-based truck delivery. CO2, NOx, and PM10 emissions are modeled using values from the US EPA’s MOVES model and are added to an ArcGIS optimization scheme. Findings Local-depot-based truck delivery requires the lowest amount of vehicle miles traveled (VMT), and last-mile passenger travel generates the lowest levels of CO2, NOx, and PM10. While last-mile passenger travel requires the highest amount of VMT, the efficiency gains of the delivery services are not large enough to offset the higher pollution rate of the delivery vehicle as compared to personal vehicles. Practical implications This research illustrates the clear role delivery structure and logistics have in impacting the CO2, NOx, and PM10 emissions of goods transportation in North America. Social implications This research illustrates tension between goals to reduce congestion (via VMT reduction) and CO2, NOx, and PM10 emissions. Originality/value This chapter provides additional insight into the role of warehouse location in achieving sustainability targets and provides a novel comparison between delivery and personal travel for criteria pollutants.", "keywords": [ "Movement (music)", "Transport engineering", "Business", "Advertising", "Engineering", "Art" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/s2044-994120140000006003" }, { "id": "https://openalex.org/W4413009044", "doi": "10.1016/j.tre.2025.104347", "title": "The traveling salesman problem with drone based on vehicle mobile parking for customer self-pickup", "year": 2025, "publication_date": "2025-08-06", "type": "article", "language": "en", "authors": [ "Lingrui Hong", "Lin Zhou", "Roberto Baldacci" ], "first_author": "Lingrui Hong", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Pickup", "Travelling salesman problem", "Computer science", "Engineering", "Transport engineering", "Artificial intelligence" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1366554525003886?via=ihub" }, { "id": "https://openalex.org/W2182412287", "doi": "10.1117/12.2202331", "title": "Tuck scheduling in cross-docking systems: review and modeling considering cargo loading/unloading sequences", "year": 2015, "publication_date": "2015-12-03", "type": "conference-paper", "language": "en", "authors": [ "Yan Ye", "Jingfeng Li", "Hui Fu" ], "first_author": "Yan Ye", "venue": "Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE", "publisher": "SPIE", "abstract": "In a cross-docking system, truck scheduling problem involves determining the sequence of inbound and/or outbound trucks at the dock doors. It is very important for realizing rapid transshipment of cargos and has attracted the attention of many researchers. This paper presents a review of existing literature and then identifies several future research opportunities. Finally, a mathematical model is developed for one unexplored area, which is the truck scheduling problem with the requirement of cargo loading/unloading sequences.", "keywords": [ "Truck", "Transshipment (information security)", "Doors", "Scheduling (production processes)", "Computer science", "Job shop scheduling", "Docking (animal)", "DOCK", "Operations research", "Distributed computing", "Engineering", "Computer network" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1117/12.2202331" }, { "id": "https://openalex.org/W2181954788", "doi": null, "title": "FLORAL, FAUNAL AND WETLAND ECOLOGICAL ASSESSMENT AS PART OF THE SECTION 24G APPLICATION PROCESS FOR THE IZUSA TRUCK DEPOT NEAR KOMATIPOORT, MPUMALANGA PROVINCE.", "year": 2014, "publication_date": "2014-01-01", "type": "article", "language": "en", "authors": [ "E. B. van der Westhuizen" ], "first_author": "E. B. van der Westhuizen", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Section (typography)", "Wetland", "Geography", "Process (computing)", "Ecology", "Archaeology", "Biology", "Computer science" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.srk.co.za/files/File/South-Africa/publicDocuments/Izusa/Appendices/471550.2014.08.25_SAS_Izusa_Truck_Depot_S24G_Ecological_Assessment.pdf" }, { "id": "https://openalex.org/W4205698407", "doi": "10.18664/1994-7852.158.2015.63591", "title": "INTRODUCTION AND ADAPTATION OF HIGH TECHNICAL EQUIPMENT FOR SERVICING TRUCKS OF PASSENGER CARS NEW GENERATION IN TERMS DEPOT «ZAPOROZ’E-1» THE PREDNIPROVSKAYA RAILWAY", "year": 2015, "publication_date": "2015-10-30", "type": "article", "language": "en", "authors": [ "Ruslan Ivanovich Visnyak", "Reva Irina Vladimirivna" ], "first_author": "Ruslan Ivanovich Visnyak", "venue": "Collected scientific works of Ukrainian State University of Railway Transport", "publisher": "Ukrainian State University of Railway Transport", "abstract": "This article deals with the maintenance of the new structural performance of new construction bogieswith non-cradle spring suspension. A special stand for mounting and dismounting bogies in a passengerDepots is suggest.", "keywords": [ "Bogie", "Truck", "Depot", "Suspension (topology)", "Automotive engineering", "Adaptation (eye)", "Engineering", "Transport engineering", "Computer science", "Structural engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://csw.kart.edu.ua/article/download/63591/59061" }, { "id": "https://openalex.org/W7113527287", "doi": null, "title": "Cross-Dock Consolidation for European Distribution: Case Study of Covestro's Barcelona Manufacturing Network", "year": 2024, "publication_date": "2024-10-03", "type": "dissertation", "language": "en", "authors": [ "Colli, Aurora" ], "first_author": "Colli, Aurora", "venue": "UPCommons institutional repository (Universitat Politècnica de Catalunya)", "publisher": "Universitat Politècnica de Catalunya", "abstract": "This thesis has been developed to investigate the potential implementation of a crossdocking model for Covestro Spain, a multinational corporation specializing in polymeric materials. The primary objective is to enhance supply chain efficiency and reduce costs across the European network, with a focused analysis of three production plants located around Barcelona. The study addresses inefficiencies in the current logistics operations, specifically the underutilization of truck capacities, which inflates logistical costs and undermines competitive positioning. The research encompasses a thorough evaluation of the existing logistics framework using historical shipment data from previous years. It includes a simulation of cross-docking implementation to contrast with the current system and identify potential cost benefits. The analysis aims to provide a detailed comparison of historical versus hypothetical costs and assess the economic feasibility of adopting a cross-docking system. The specific objectives involve analyzing the existing logistics system, simulating the implementation of a cross-docking model, comparing the current system with the proposed cross-docking scenario, and forecasting future shipping costs to assess potential cost savings and the overall financial viability of the new logistics strategy. The outcomes of this study are intended to inform on the practicality and advantages of integrating a cross-docking strategy, ultimately aiming to optimize logistics operations and achieve long-term economic efficiency.", "keywords": [ "Consolidation (business)", "Truck", "Supply chain", "Multinational corporation", "Corporation", "Production (economics)", "Humanitarian Logistics", "Supply chain management" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/2117/425945" }, { "id": "https://openalex.org/W2984899444", "doi": "10.1007/s41604-019-00016-3", "title": "On a multi-trip vehicle routing problem with time windows integrating European and French driver regulations", "year": 2019, "publication_date": "2019-10-31", "type": "article", "language": "en", "authors": [ "N. Benkebir", "M. Le Pouliquen", "J-F. Trévien", "Ahcène Bounceur", "Reinhardt Euler", "E. Pardiac", "Marc Sevaux" ], "first_author": "N. Benkebir", "venue": "Journal on Vehicle Routing Algorithms", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Truck", "Vehicle routing problem", "TRIPS architecture", "Transport engineering", "Scheduling (production processes)", "Operations research", "European union", "Computer science", "Working time", "Cruise", "Set (abstract data type)", "Service (business)" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s41604-019-00016-3" }, { "id": "https://openalex.org/W136842434", "doi": "10.1007/978-3-642-00142-0_49", "title": "A Branch-and-Cut Approach to the Vehicle Routing Problem with Simultaneous Delivery and Pick-up", "year": 2009, "publication_date": "2009-01-01", "type": "book-chapter", "language": "en", "authors": [ "Julia Rieck", "Jürgen Zimmermann" ], "first_author": "Julia Rieck", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Computer network" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-642-00142-0_49" }, { "id": "https://openalex.org/W103691651", "doi": null, "title": "The Environmental, Social, and Cultural Impacts of Sprawl", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Patrick Gallagher", "Edward Abbey's" ], "first_author": "Patrick Gallagher", "venue": null, "publisher": null, "abstract": "I latch on to the tail draft of a forty-ton Mayflower moving van and let it suck me like a bug through the nearcontinuous development gas stations, boxfood joints, suburban box homes, condominiums, truck stops, shopping centers, redlight greenlight intersections, office buildings of pink cement and dark glass, assembly plants with walls of slump block and no windows at all, blocklong warehouses and storage depots of bolted-together sheet metal that walls in the four-lane superhighway from Emporta to Kansas City.", "keywords": [ "Adobe", "Truck", "Urban sprawl", "Block (permutation group theory)", "Engineering", "Civil engineering", "Mining engineering", "Geography", "Land use" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.jstor.org/stable/pdfplus/40924406.pdf" }, { "id": "https://openalex.org/W2048673534", "doi": "10.3141/2100-09", "title": "Operational Development of Marine Highways to Serve the U.S. Pacific Coast", "year": 2009, "publication_date": "2009-01-01", "type": "article", "language": "en", "authors": [ "Dan Bagnell", "Carin Saunders", "Ron Silva", "Matthew Tedesco" ], "first_author": "Dan Bagnell", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "This paper examines the market volumes, service times, vessel characteristics, and economics for marine highways that would serve the U.S. Pacific Coast. This work was performed under contract to the Center for Commercial Deployment of Transportation Technologies. Market volumes were assessed by routes of interest and by filtering for cargo that would be eligible for marine highway service on the basis of the drayage distance and other factors. Sufficient daily truckload volumes exist in the Northern California to Southern California route to justify marine highways with multiple daily sailings of vessels with capacities of 450 to 700 trailers, should service times and economics prove to be competitive enough to divert cargo. Market volumes in the California to Pacific Northwest route are sufficient for daily sailings of smaller vessels with capacities of approximately 150 to 200 trailers. A door-to-door supply chain perspective was maintained, and discrete-event simulation was used to assess the service times and the vessel speeds required. The resulting voyage analysis served as input to both a parametric analysis of vessel characteristics and an economic analysis of marine highways by considering all maritime and land-side cost elements associated with the door-to-door movement of trailers. It was concluded that current truck rates are not high enough for marine highways to compete on the basis of cost in short next-day-turnaround markets, such as Northern California to Southern California. Marine highways are viable for longer routes such as those from California to the Pacific Northwest, where truck rates are higher and both distance and trucking hours-of-service regulations permit vessels to be time competitive at lower speeds.", "keywords": [ "Truck", "Service (business)", "Transport engineering", "Software deployment", "Work (physics)", "Pacific ocean", "Fishery", "Environmental science", "Business", "Engineering", "Oceanography" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/2100-09" }, { "id": "https://openalex.org/W4410721420", "doi": "10.3390/app15115937", "title": "An Improved Large Neighborhood Search Algorithm for the Comprehensive Container Drayage Problem with Diverse Transport Requests", "year": 2025, "publication_date": "2025-05-25", "type": "article", "language": "en", "authors": [ "Xuhui Yu", "Cong He" ], "first_author": "Xuhui Yu", "venue": "Applied Sciences", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Container drayage, as a pivotal element of door-to-door intermodal transportation, has garnered increasing attention due to its significant influence on container logistics costs. Although various types of transport requests have been defined in the literature, no comprehensive study has addressed all of them together yet, due to the lack of an efficient model and corresponding algorithms. Furthermore, existing research on container drayage often neglects the simultaneous incorporation of two trucking operation modes, two empty container repositioning strategies, and the availability of empty containers across multiple depots. To address these issues, this study proposes a comprehensive container drayage problem (CDP) and mathematically formulates it as an innovative mixed integer linear programming (MILP) model, capturing the uncertainty and unpredictability inherent in empty container allocation, truck dispatching, and route planning. Given the problem’s complexity, obtaining an exact solution for large instances is not feasible. Therefore, an improved large neighborhood search (LNS) algorithm is tailored by incorporating the “Sequential insertion” and the “Solution re-optimization” operations. Extensive numerical experiments using randomly generated instances of varying scales validate the correctness of the proposed model and demonstrate the performance of the proposed algorithm. Additionally, sensitivity analysis on the number and distribution of depots and empty containers offers valuable managerial insights for the development of an effective container drayage system.", "keywords": [ "Container (type theory)", "Computer science", "Algorithm", "Engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2076-3417/15/11/5937/pdf?version=1748159135" }, { "id": "https://openalex.org/W4381996337", "doi": "10.1016/j.biombioe.2023.106884", "title": "Enhancement of quality and quantity of woody biomass produced in forests using machine learning algorithms", "year": 2023, "publication_date": "2023-06-24", "type": "article", "language": "en", "authors": [ "Wei Peng", "Omid Karimi Sadaghiani" ], "first_author": "Wei Peng", "venue": "Biomass and Bioenergy", "publisher": "Elsevier BV", "abstract": "Forest is considered a significant source of woody biomass production . Sustainable production of wood, lower emittance of CO2 from burning, and lower amount of sulfur and heavy metals are the advantages of wood rather than fossil fuels . The quality and quantity of woody biomass production are a function of some operations including genetic modifications, high-quality forestry , evaluation, monitoring, storage, and transportation. Due to surveying numerous related works, it was found that there is a considerable reviewing gap in analyzing and collecting the applications of Machine Learning in the quality and quantity of woody biomass. To fill this gap in the current work, the above-mentioned operations are explained followed by the applications of Machine Learning algorithms. Conclusively, Machine Learning and Deep Learning can be employed in estimating main effective factors on trees growth , classification of seeds, trees, and regions, as well as providing decision-making tools for farmers or governors, evaluation of biomass, understanding the relation between the woody bimass internal structure and bio-fuel production, the ultimate and proximate analyses, prediction of wood contents and dimensions, determination of the proportion of mixed woody materials, monitoring for early disease identification and classification, classifying trees diseases, estimating evapotranspiration , collecting information about forest regions and its quality, nitrogen concentration in trees, choosing viable storage sites for storage depots and improving the solution, classifying different filling levels in silage, estimating acetic acid synthesis and aerobic reactions in silage, determining crop quantity in silo, estimating the methane production, and monitoring and predicting water content, quality and quantity of stored biomass, forecasting the demand, path way and on-time performance predicting, truck traffic predicting, and behavioral analysis and facility planning.", "keywords": [ "Biomass (ecology)", "Environmental science", "Agricultural engineering", "Silage", "Bioenergy", "Production (economics)", "Quality (philosophy)", "Machine learning", "Computer science", "Agronomy", "Engineering", "Waste management" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.biombioe.2023.106884" }, { "id": "https://openalex.org/W4281692793", "doi": "10.1155/2022/4100049", "title": "Concrete Vehicle Scheduling Based on Immune Genetic Algorithm", "year": 2022, "publication_date": "2022-06-03", "type": "article", "language": "en", "authors": [ "Jie Yang", "Bin Yue", "Feifei Feng", "Jinfa Shi", "Haoyang Zong", "Junxu Ma", "Linjian Shangguan", "Shuai Li" ], "first_author": "Jie Yang", "venue": "Mathematical Problems in Engineering", "publisher": "Hindawi Publishing Corporation", "abstract": "At present, the demand for ready-mixed concrete (RMC) in construction industry is increasing day by day, and the supply mode of multiple delivery depots corresponding to multiple construction sites has been widely used. In order to further improve the joint distribution efficiency between various delivery depots, this research establishes a multiobjective optimal distribution model with time window constraints and demand postponement attributes for the problem that the subbatching plants need to work together. The model divides the reasons for demand postponement into two types: the constraint for timely unloading of trucks cannot be met on time and the constraint for timely pouring at the construction site cannot be met on time. This work improved the coding method of genetic algorithm based on the characteristics of the distribution model. Using hierarchical real-coding form, the coding operator of each layer can be evolved separately, which ensures the globality of the search, and, at the same time, an improved immune operator is added to ensure the local search performance. By comparison, the results obtained by improved GA are 7.05% higher than those of the standard GA, and the early convergence speed of improved GA is obviously better than that of the standard GA. The simulation experiments show that the total trucks’ waiting time during the process of providing delivery services from 5 concrete plants to 8 construction sites is 769 minutes, and the total waiting time of 8 construction sites is 507 minutes. Through practical case analysis, this work can enable RMC production enterprises and construction sites to effectively reduce the waiting time of corresponding operations, and the obtained results are close to the simulation results. The proposed method indeed improves the efficiency of RMC distribution.", "keywords": [ "Postponement", "Coding (social sciences)", "Truck", "Computer science", "Scheduling (production processes)", "Tardiness", "Genetic algorithm", "Mathematical optimization", "Operations research", "Job shop scheduling", "Engineering", "Operations management" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/mpe/2022/4100049.pdf" }, { "id": "https://openalex.org/W1579656257", "doi": "10.1596/16153", "title": "Logistics Chain Management for Emergency Supplies", "year": 2012, "publication_date": "2012-09-01", "type": "book", "language": "en", "authors": [ "Makoto Okumura" ], "first_author": "Makoto Okumura", "venue": "World Bank, Washington, DC eBooks", "publisher": null, "abstract": "In response to the Great East Japan Earthquake (GEJE) disaster, relief goods were distributed and delivered through prefectural- and municipal-level depots. This delivery system faced several problems including fuel shortages, interruption of telecommunication services, and supply and demand mismatches, resulting in stockpiling of the goods in depots and delayed delivery to the people in need. Several measures can be taken to address these issues, including prior surveys of depot facilities, estimating in advance the quantities of emergency goods that will be required, enlisting the support of professional logistics specialists, and promoting logistics information management in unaffected areas, among others. Delivery of relief goods was planned to be executed through depots at two levels-prefectural and municipal. Especially in the first two weeks, fuel shortages made downstream deliveries from prefectural depots very difficult. Also, manpower shortages and the inconvenient building specifications of depots were the main causes of unnecessary stockpiling in depots. Delivering several kinds of goods, such as food, drinking water, clothing, and bedding, either to people's homes or to more than 2,000 shelters, was a challenge, especially in the first several weeks when fuel was in short supply. By the end of June, 1,800, 1,400, and 2,400 trucks were dedicated to transporting goods from prefectural depots to municipal depots in Iwate, Miyagi, and Fukushima, respectively.", "keywords": [ "Truck", "Economic shortage", "Business", "Supply chain", "Operations management", "Transport engineering", "Engineering", "Government (linguistics)", "Marketing" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/10986/16153" }, { "id": "https://openalex.org/W3156359523", "doi": "10.1155/2021/5531500", "title": "Vehicle Routing Problem for Collaborative Multidepot Petrol Replenishment under Emergency Conditions", "year": 2021, "publication_date": "2021-04-17", "type": "article", "language": "en", "authors": [ "Guangcan Xu", "Qiguang Lyu" ], "first_author": "Guangcan Xu", "venue": "Journal of Advanced Transportation", "publisher": "Hindawi Publishing Corporation", "abstract": "In recent years, emergency events have affected urban distribution with increasing frequency. For example, the 2019 novel coronavirus has caused a considerable impact on the supply guarantee of important urban production and living materials, such as petrol and daily necessities. On this basis, this study establishes a dual-objective mixed-integer linear programming model to formulate and solve the cooperative multidepot petrol emergency distribution vehicle routing optimization problem with multicompartment vehicle sharing and time window coordination. As a method to solve the model, genetic variation of multiobjective particle swarm optimization algorithm is considered. The effectiveness of the proposed method is analyzed and verified by first using a small-scale example and then investigating a regional multidepot petrol distribution network in Chongqing, China. Cooperation between petrol depots in the distribution network, customer clustering, multicompartment vehicle sharing, time window coordination, and vehicle routing optimization under partial road blocking conditions can significantly reduce the total operation cost and shorten the total delivery time. Meanwhile, usage of distribution trucks is optimized in the distribution network, that is, usage of single- and double-compartment trucks is reduced while that of three-compartment trucks is increased. This approach provides theoretical support for relevant government departments to improve the guarantee capability of important materials in emergencies and for relevant enterprises to improve the efficiency of emergency distribution.", "keywords": [ "Truck", "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "Genetic algorithm", "Operations research", "Transport engineering", "Particle swarm optimization", "Engineering", "Computer network", "Automotive engineering" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/jat/2021/5531500.pdf" }, { "id": "https://openalex.org/W4379053710", "doi": "10.1186/s41072-023-00146-9", "title": "Automation in cargo loading/unloading processes: do unmanned loading technologies bring benefits when both purchase and operational cost are considered?", "year": 2023, "publication_date": "2023-06-02", "type": "article", "language": "en", "authors": [ "Valentin Carlan", "David Ceulemans", "Edwin van Hassel", "Stijn Derammelaere", "Thierry Vanelslander" ], "first_author": "Valentin Carlan", "venue": "Journal of Shipping and Trade", "publisher": "Springer Nature", "abstract": "Abstract The use of technologies that automate handling goods and loading units in warehouses and depots is not new. Yet, the purchase process of these technologies issues troubles and the estimation of the economic advantages brought by one or another technology to the entire chain of operations in logistics are not always known. Faults or not documented decisions put pressure on managers and prices for services. They can cause a drop in the competitiveness of warehouse operators, particularly in uncertain conditions. Academia documented the cost of warehouse storage well. Yet, little research has looked into the economic justification of implementing automatic systems for loading or unloading activities and the impact on complementary operations. For this reason, a model is needed to calculate the cost of operations when different technical equipment is used. This research further investigates the cost categories that must be considered when purchasing automated loading/unloading technologies. The model includes the purchase and operational loading costs that new technologies generate and the cost of adjacent operations to loading activity. The case study uses forklifts as the reference scenario and provides an overview of the return on investment and a break-even period when other technologies are in use. The calculation model shows that increasing cargo volume leads to a better RoI. The same observation is also made regarding the rise in labour costs. For the latter, using human operators to handle pallets on a one-by-one basis generates an exponential increase in operational cost due to delays and faults. On the other side, the cost of implementing automated loading/unloading technologies and the consideration of technology risk determine the low economic advantages. An in-depth cost and benefit analysis shows in which situation a technology generates greater benefits. Further results of this paper show that better use of trucks' loading capacity can positively impact the financial performance of automated loading technologies, as a higher volume of cargo is moved (at once) without human intervention.", "keywords": [ "Pallet", "Purchasing", "Automation", "Process (computing)", "Operational costs", "Operations research", "Computer science", "Finished good", "Investment (military)", "Emerging technologies", "Operations management", "Risk analysis (engineering)" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://jshippingandtrade.springeropen.com/counter/pdf/10.1186/s41072-023-00146-9" }, { "id": "https://openalex.org/W3094207985", "doi": "10.1155/2020/8843397", "title": "Collaborative Multidepot Petrol Station Replenishment Problem with Multicompartments and Time Window Assignment", "year": 2020, "publication_date": "2020-10-20", "type": "article", "language": "en", "authors": [ "Guangcan Xu", "Maozeng Xu", "Yong Wang", "Yong Liu", "Qiguang Lv" ], "first_author": "Guangcan Xu", "venue": "Journal of Advanced Transportation", "publisher": "Hindawi Publishing Corporation", "abstract": "Energy supply is an important system that affects the overall efficiency of urban transportation. To improve the system operational efficiency and reduce costs, we formulate and solve a collaborative multidepot petrol station replenishment problem with multicompartments and time window assignment by establishing a mixed-integer linear programming model. The hybrid heuristic algorithm composed of genetic algorithm and particle swarm optimization is used as a solution, and then the Shapley value method is applied to analyze the profit allocation of each petrol depot under different coalitions. The optimal membership sequence of the cooperation is determined according to the strict monotone path. To analyze and verify the effectiveness of the proposed method, a regional petrol supply network in Chongqing city in China is investigated. Through cooperation between petrol depots in the supply network, the utilization of customer clustering, time window coordination, and distribution truck sharing can significantly reduce the total operation costs and improve the efficiency of urban transportation energy supply. This approach can provide theoretical support for relevant government departments and enterprises to make optimal decisions. The implementation of the joint distribution of energy can promote the sustainable development of urban transportation.", "keywords": [ "Shapley value", "Computer science", "Operations research", "Mathematical optimization", "Particle swarm optimization", "Heuristic", "Profit (economics)", "Transport engineering", "Engineering", "Game theory", "Economics" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/jat/2020/8843397.pdf" }, { "id": "https://openalex.org/W4414449054", "doi": "10.1080/00207543.2025.2557530", "title": "An innovative framework integrating MILP and a parallel optimal algorithm for UAV-Enabled last-Mile delivery", "year": 2025, "publication_date": "2025-09-23", "type": "article", "language": "en", "authors": [ "Arash Amirteimoori", "Reza Kia", "Moataz Mohamed", "Gerhard‐Wilhelm Weber" ], "first_author": "Arash Amirteimoori", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "Urban last-mile delivery faces scalability, cost, and environmental challenges due to truck-based systems’ congestion and emissions. This study proposes a Customer-Centric UAV Last-Mile Delivery (CULMD) framework, eliminating truck dependency by optimising UAV routing, charging infrastructure, and sequencing for sustainable urban logistics. We introduce the Parallel Optimal Algorithm with MILP (POAM), a novel approach that decomposes the problem into two sub-problems: parallelised exact combinatorial optimisation for tour and parcel allocation, and MILP-based routing. POAM leverages multi-core CPU parallelisation to solve tour allocation across multiple regions and delivery windows concurrently, ensuring global optimality while reducing runtime by 21.5% compared to the Two-Stage Model (TSM) and 16-fold compared to the Integrated Model (IM). It outperforms metaheuristics like the Artificial Lemming Algorithm (ALA) and Hybrid Genetic Algorithm with Type-Aware Chromosomes (HGATAC+) by 12% and 11% in objective value, respectively. Sensitivity analyses show a 20% increase in regions cuts runtime by 68%, and a 20% increase in UAV load capacity reduces it by 22%. The CULMD framework, powered by POAM, advances sustainable logistics by minimising costs and environmental impacts, offering scalable solutions for urban delivery systems.", "keywords": [ "Optimal design", "Production (economics)", "Minification", "Key (lock)", "Algorithm design", "Efficient algorithm" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2025.2557530" }, { "id": "https://openalex.org/W1903209580", "doi": "10.1287/trsc.11.2.124", "title": "The “Hub” and “Wheel” Scheduling Problems", "year": 1977, "publication_date": "1977-05-01", "type": "article", "language": "en", "authors": [ "Sanji Arisawa", "Salah E. Elmaghraby" ], "first_author": "Sanji Arisawa", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "The problem is that of scheduling truck movement (loaded and empty) between a central depot (the hub) and a number of outlying cities. Current demand is known deterministically, but future demand is uncertain. The myopic case treats two periods only: the current period and one future period. The objective is to minimize the expected total operating penalty, consisting of the costs of moving empties and the costs of delaying shipments. In two special cases the procedures of solution reduce to simple marginal analysis that has been previously solved by Minas and Mitten. In the general case, a network flow model is proposed that is easily solved.", "keywords": [ "Scheduling (production processes)", "Mathematical optimization", "Truck", "Flow network", "Operations research", "Computer science", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.11.2.124" }, { "id": "https://openalex.org/W573111884", "doi": null, "title": "The impact of truck noise", "year": 1985, "publication_date": "1985-01-01", "type": "article", "language": "en", "authors": [ "R T Benbow" ], "first_author": "R T Benbow", "venue": null, "publisher": null, "abstract": "The impact of truck noise on the acoustic amenity of residential areas is an environmental issue that remains unsolved in many suburban areas of Sydney. The many aspects associated with the impact of truck noise are illustrated by discussing three sites that depend on the use of trucks. The three examples are: 1. A quarry operating since 1965 and now surrounded by high density residential areas. 2. A major source of concrete construction materials uses a large fleet of semi trailers to transport these materials throughout metropolitan areas of Sydney. Until recently truck movements were along traffic routes relatively free of residences. 3. The proposed operation of a combined quarry and waste disposal depot has necessitated the prediction of the impact of truck movements. The existing traffic routes to the site do have residential areas along one or both sides of the roadway. The use of the doe method, the practical difficulties in ameliorating the impact and the noise control options available are discussed.", "keywords": [ "Truck", "Metropolitan area", "Amenity", "Noise control", "Noise (video)", "Residential area", "Transport engineering", "Roadway noise", "Noise pollution", "Traffic noise", "Civil engineering", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1193558" }, { "id": "https://openalex.org/W2891563770", "doi": null, "title": "Optimization and Comparison of Manual and Semi-Automated Material Handling in a Cross-Dock Using Discrete-Event Simulation", "year": 2018, "publication_date": "2018-08-21", "type": "dissertation", "language": "en", "authors": [ "Saravanan Natarajan" ], "first_author": "Saravanan Natarajan", "venue": "UWSpace (University of Waterloo)", "publisher": "University of Waterloo", "abstract": "A Cross-Dock (CD) is a synchronized unit of a supply chain network, used to sort the goods received from inbound trucks (from a warehouse or factory), and load those products to outbound trucks (for delivery of the goods to retail stores in the supply chain \\nnetwork). Most cross-docks use forklifts, and other manual material handling equipment (MHE) to process the goods on pallets received from inbound trucks. Those pallets are sorted and loaded onto outbound trucks. With the advancements in robotics, it could be bene cial to employ semi-automated material handling techniques in a CD, rather than solely relying on manual material handling. In this thesis, the scope of self-driving vehicles (SDVs) in one such semi-automated cross-dock facility is studied. We compare the cases of purely manual and semi-automated material handling in a cross-dock. \\n \\nUsing simulation, we modelled two cross-dock facilities, one with forklifts only and with a mixture of forklifts and SDVs. Simulation was thus employed to mimic the CD's material handling process, to compare the two MHE con gurations. Then the built cross-dock simulation models were optimized using the response surface methodology and mixed integer non-linear programming (MINLP), to achieve the optimal MHE con guration for those facilities operating with the desired levels of performance metrics. \\n \\nThereby the manual and semi-automated cross-dock with similar performance (and optimal MHE con gurations) are compared and the scope of SDVs in a cross-dock is evaluated. Conclusions are given, and opportunities for further research are presented.", "keywords": [ "DOCK", "Discrete event simulation", "Event (particle physics)", "Computer science", "Discrete modelling", "Engineering", "Simulation", "Discrete system", "Algorithm", "Physics", "Marine engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10012/13626" }, { "id": "https://openalex.org/W4413419721", "doi": "10.21872/2024iise_7899", "title": "Covering Routing Problem with Robots and Parcel Lockers: A Sustainable Last-Mile Delivery Approach", "year": 2024, "publication_date": "2024-10-01", "type": "conference-paper", "language": "en", "authors": [ "Nima Moradi", "Fereshteh Mafakheri", "Université du Québec", "Chun Wang" ], "first_author": "Nima Moradi", "venue": null, "publisher": null, "abstract": "This study presents the Covering Routing Problem with Robots and Parcel Lockers (CRP-R-PL), a challenge arising in sustainable last-mile delivery contexts such as e-commerce and city distribution. In this problem, trucks depart from a central depot, delivering parcels directly to a subset of customers or a subset of parcel lockers. With these parcel lockers, the remaining customers could pick up items if they prefer the pick-up delivery method. In addition, each truck is equipped with an electric-powered Sidewalk Autonomous Delivery Robot (SADR), a sustainable delivery solution used in the U.S. and Canada by Uber and Amazon. This zero-emission vehicle is deployed to get off the truck, serve one or multiple customers, and then return to the same truck for battery swap and package retrieval. For the routing of SADRs, the trucks act as a moveable satellite depot to serve the remaining customers. The CRP-R-PL seeks cost-minimizing solutions by determining optimal parcel locker locations and routes of trucks and SADRs to serve all customers. We offer a mixed-integer programming formulation and a greedy heuristic to solve it. The CRP-R-PL includes three decisions: 1) finding the location of parcel lockers, 2) routing the trucks to visit the customers and parcel lockers, and 3) routing the SADRs to serve the remaining customers. Since this problem has yet to be studied in the literature, a new set of benchmark instances is introduced for the CRP-R-PL and solved by Gurobi alongside the parameter's sensitivity analysis.", "keywords": [ "Last mile (transportation)", "Robot", "Mile", "Routing (electronic design automation)", "Computer science", "Computer network", "Geography", "Artificial intelligence" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.21872/2024iise_7899" }, { "id": "https://openalex.org/W7166610800", "doi": null, "title": "Improvement of the organization of international road transportation of gasoline by tank trucks from the ORLEN oil refining complex (Płock, Poland) to an oil depot near Ternopil", "year": 2026, "publication_date": "2026-06-01", "type": "dissertation", "language": "uk", "authors": [ "Назар Володимирович Войтович", "Nazar Voytovych" ], "first_author": "Назар Володимирович Войтович", "venue": "ELARTU (Ternopil National Technical University)", "publisher": "Ternopil Ivan Pul'uj National Technical University", "abstract": "Кваліфікаційна робота присвячена удосконаленню транспортного процесу міжнародного автомобільного перевезення бензину автоцистернами у сполученні Польща–Україна на прикладі доставки з комплексу ORLEN (м. Плоцьк) до нафтобази поблизу м. Тернопіль. Актуальність роботи зумовлена високою пожежо- та вибухонебезпекою бензину як вантажу класу 3 за ADR, необхідністю дотримання вимог безпеки, а також обмеженнями щодо повної маси автопоїзда і осьових навантажень, які безпосередньо впливають на допустимий обсяг наливу та економічність перевезення.", "keywords": [ "Depot", "Gasoline", "Truck", "Oil refinery", "Refining (metallurgy)", "Petroleum" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://elartu.tntu.edu.ua/handle/lib/52845" }, { "id": "https://openalex.org/W2013845376", "doi": "10.1111/j.1540-5915.1975.tb01000.x", "title": "A SIMULATION OF INTERACTIVE MAINTENANCE DECISIONS", "year": 1975, "publication_date": "1975-01-01", "type": "article", "language": "en", "authors": [ "S. T. Hardy", "Lee J. Krajewski" ], "first_author": "S. T. Hardy", "venue": "Decision Sciences", "publisher": "Wiley", "abstract": "In this day of automation, effective maintenance decisions are a legitimate concern. This paper broadens the traditional concept of maintenance to include any policies which tend to reduce the frequency or severity of failures. A simulation model is used to demonstrate the inter‐relatedness of multiple maintenance policies for a truck depot. It is demonstrated that the proper selection of a maintenance policy set should consider the variability of the system outputs due to the daily dynamics, as well as the transient behavior of the system. It is also shown that the choice of an appropriate maintenance policy should recognize the distribution of total annual costs and should not base the analysis solely upon average total annual costs.", "keywords": [ "Computer science", "Truck", "Set (abstract data type)", "Operations research", "Selection (genetic algorithm)", "Preventive maintenance", "Transient (computer programming)", "Maintenance actions", "Risk analysis (engineering)", "Automation", "Operations management", "Reliability engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1111/j.1540-5915.1975.tb01000.x" }, { "id": "https://openalex.org/W3180758281", "doi": "10.1016/j.ejor.2021.07.001", "title": "Optimizing consolidation processes in hubs: The hub-arrival-departure problem", "year": 2021, "publication_date": "2021-07-10", "type": "article", "language": "en", "authors": [ "Johannes Rupp", "Nils Boysen", "Dirk Briskorn" ], "first_author": "Johannes Rupp", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Transshipment (information security)", "Consolidation (business)", "Computer science", "Operations research", "Container (type theory)", "Air cargo", "Consignment", "Context (archaeology)", "Train", "Transport engineering", "Containerization" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2021.07.001" }, { "id": "https://openalex.org/W589941224", "doi": null, "title": "A Preliminary Demonstration of \"Virtual Warehousing\" and Cross-Docking Technique with Active RFID Combined with Asset Tracking Equipment", "year": 2010, "publication_date": "2010-11-01", "type": "article", "language": "en", "authors": [ "Patrick J. Sherry", "Rocque Kramer" ], "first_author": "Patrick J. Sherry", "venue": null, "publisher": null, "abstract": "The University of Denver’s Intermodal Transportation Institute (ITI) and System Planning Corporation’s GlobalTrak system have successfully demonstrated the integration of Global Positioning System (GPS) tracking and active radio frequency identification (RFID) monitoring of simulated cargo of pallet and carton sizes by a mobile data collection and reporting device during a cross-country, intermodal transit involving truck and rail segments for two containers. The success of this test indicates that it is possible to receive information about the location and condition of cargo throughout the transportation cycle, not just at nodes like transshipment or distribution centers. The use of RFID-tagged cartons and pallets with a GPS tracking device means that less than containerload/less than truckload (LCL/LTL) loads as well as container/trailer-loads can be tracked and monitored during transit, extending the warehouse onto the road. The pallets and cartons comprising the simulated cargo were tagged, placed in 53’ containers, transported, and brought together in Denver for a cross-docking maneuver. The tagged “cargo” was moved from one conveyance to the other and then associated with that new conveyance’s tracking device. The tag reads were reported by the respective devices and presented as meaningful cargo data on the GlobalTrak Information Management Bureau network site established for the National Center for Intermodal Transportation (NCIT). In this test, one 53’ container was loaded near the GlobalTrak facility in Arlington, VA and trucked to Harrisburg, PA where it was placed on CSX double stacked railcars and moved to the CSX intermodal yard south of Chicago. The container was then trucked, as is normally done, to the UP yard in western Chicago and double stacked on a railcar for the completion of the journey to Denver. From the Denver UP yard it was drayed to a hub in North Denver. A second 53’ container was obtained in Denver and trucked to the hub for a cross-docking event to occur with the containers within 8’ of each other. Cartons and simulated pallets loaded in Denver and associated with the Denver GlobalTrak asset management unit, or AMU, were then switched with the cargo that had just arrived from Arlington VA. The Denver cargo was associated with the Arlington VA-origin AMU. The Arlington VA cargo was associated with the Denver AMU in its new container. Both AMUs reported their tagged cargo to the GlobalTrak Information Management Bureau as new cargo but also recognized the movement from one container to another. The container loaded in and sent from Arlington VA initially reported its door open and closed during the loading cycle; and reported its location every hour and the status of the active RFID tags within the container more often. No alarms were reported until door opening in Denver at the cross-docking operation. On completing the cross-docking, both containers were pulled off the docks and stored in the yard for one day. The Arlington VA container with new RFID tagged cargo was sent back to Virginia. The Denver container was driven around Denver where one pallet was unloaded to test a last mile delivery scenario. The cargo which was loaded in Arlington VA and cross-docked to the second container in Denver was eventually off-loaded and stored at the University of Denver campus where it remains today. It continues to report its location and status within the facilities of ITI to an AMU. This test demonstrated the availability of improved delivery speeds through the coordination and scheduling of multiple containers from long-haul locations for cross-docking; a potential reduction in the costs of both inventory and materials handling; and a potential reduction in warehouse storage space requirements.", "keywords": [ "Pallet", "Global Positioning System", "Truck", "Container (type theory)", "Radio-frequency identification", "Transit (satellite)", "Transport engineering", "Computer science", "Engineering", "Automotive engineering", "Telecommunications", "Computer security" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://rosap.ntl.bts.gov/view/dot/28370" }, { "id": "https://openalex.org/W3211527740", "doi": "10.11594/nstp.2021.1435", "title": "Determining the Shortest Route of Distribution to Reduce Environmental Emissions Using Saving Matrix and Nearest Neighbor Methods", "year": 2021, "publication_date": "2021-11-12", "type": "conference-paper", "language": "en", "authors": [ "Farida Pulansari", "Isna Nugraha", "Sinta Dewi" ], "first_author": "Farida Pulansari", "venue": "Nusantara Science and Technology Proceedings", "publisher": null, "abstract": "One of the problems with the Vehicle Routing Problem (VRP) is the problem of fulfilling customer requests according to the location that must be supplied from depots that have limited vehicle capacity. This also happened to Distributor PT. XYZ is located in Lamongan. Every day the distributor of PT. XYZ distributes fertilizer to several cities in East Java, one of which is in the city of Blitar. The problem that happened to the distributor of PT. XYZ does not yet have an optimal distribution route, resulting in delays in the delivery process. Optimization of distribution routes can be done by finding the shortest route in fertilizer distribution in the Blitar area. With the saving matrix and nearest neighbor method, the best route arrangement can shorten the distance and product delivery time. The final result will be savings in distribution costs because it can reduce fuel consumption for fertilizer trucks, reducing the company's variable costs and reducing environmental emissions.", "keywords": [ "Truck", "Distributor", "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "Mathematical optimization", "Distribution (mathematics)", "Process (computing)", "Variable (mathematics)", "Product (mathematics)", "Operations research", "Automotive engineering" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://nstproceeding.com/index.php/nuscientech/article/download/512/490" }, { "id": "https://openalex.org/W3122291437", "doi": null, "title": "Vis-à-vis vs. mixed dock door assignment: A comparison of different cross dock layouts", "year": 2010, "publication_date": "2010-08-18", "type": "preprint", "language": "en", "authors": [ "Konrad Stephan", "Nils Boysen" ], "first_author": "Konrad Stephan", "venue": "RePEc: Research Papers in Economics", "publisher": "Federal Reserve Bank of St. Louis", "abstract": "An important decision problem during the layout phase of a cross dock is related to the arrangement of inbound and outbound operations within a terminal. Either one side of the terminal is exclusively dedicated to inbound and the other to outbound destinations (vis-a-vis policy) or inbound and outbound destinations can facultatively be assigned all around the terminal (mix policy). The latter policy promises more flexibility, when finally assigning dock doors to truck destinations during operational planning, but comes for the price of ambiguous material flows and potential congestions inside the terminal. Both policies are compared with regard to their impact on operational planning, where deterministic, stochastic and unknown inbound loads are differentiated. Our results show the mix policy being superior in most cases except for unknown inbound loads.", "keywords": [ "DOCK", "Terminal (telecommunication)", "Doors", "Destinations", "Flexibility (engineering)", "Truck", "Business", "Computer science", "Operations research", "Operations management", "Economics", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://econpapers.repec.org/RePEc:jen:jenjbe:2010-12" }, { "id": "https://openalex.org/W4406101566", "doi": "10.1016/j.est.2024.115269", "title": "A mathematical model for the development of distributed energy storage devices in the V2V charging process systems based on fuzzy graph theory", "year": 2025, "publication_date": "2025-01-06", "type": "article", "language": "en", "authors": [ "Rayid Ghani", "Ebrahim Farjah", "Mohammad Reza Oboudi" ], "first_author": "Rayid Ghani", "venue": "Journal of Energy Storage", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Graph theory", "Process (computing)", "Computer science", "Fuzzy logic", "Energy storage", "Graph", "Distributed computing", "Theoretical computer science", "Mathematics", "Artificial intelligence", "Physics" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.est.2024.115269" }, { "id": "https://openalex.org/W6981913811", "doi": null, "title": "Formulations mathématiques et algorithmes pour le problème d'affectation des quais du cross-dock", "year": 2020, "publication_date": "2020-06-29", "type": "dissertation", "language": "en", "authors": [ "Nduwayo, Placide" ], "first_author": "Nduwayo, Placide", "venue": "HAL (Le Centre pour la Communication Scientifique Directe)", "publisher": "Centre National de la Recherche Scientifique", "abstract": "Cross-docking is a strategy originally introduced to optimize operations inside a warehouseas part of the optimization of the Supply Chain. Like traditional warehouses, productsare collected from numerous freight yards such that suppliers, factories, manufactures,etc., usingtrucks, and are moved towards processing centers named cross-docks. At cross-dock yard, productsfirst get unloaded on inbound dock doors. Afterwards, they are sorted according to theirdestinations and are immediately transferred, using handling devices, to appropriate outbounddock doors to be sometimes consolidated with other products of the same destination and arereloaded into shipping trucks. Unlike traditional warehouse where storage period of productsis indefinite, for cross-dock, goods are unloaded and reloaded the same day without waiting intemporary storage area or can wait less than one day. In this PhD thesis, we study an NP-hardoptimization problem raised by cross-dock referred to “Cross-dock Door Assignment Problem(CDAP)”. The CDAP consists in assignment of incoming and outgoing trucks to inbound andoutbound dock doors of cross-dock, respectively. The goal is to minimize the total transportationcost inside the cross-dock. The standard quadratic formulation of the CDAP includes theGeneralized Assignment Problem as subproblem. In this dissertation, we perform an extensivecross-docking literature review. Then, we carry out a broad analysis of the standard quadraticformulation as well as the standard linearization of the CDAP. From this in-deph study, wepropose several new non standard Mixed Integer Linear Programming models for the CDAP. Todetect the best linear model among those we propose and those existing, we compare the performanceof these models on instances proposed in the literature. We next propose a LagrangianRelaxation approach to produce the best new lower bounds to optimal solution value. This LagrangianRelaxation is applied to the model that produces the best LP relaxation bounds. TheLagrangian dual is solved using a subgradient algorithm. According to the experiments it seemsthat large-scale instances cannot be solved with an exact method in reasonable running times andmemory requirements. Thus, we propose and implement two heuristics based on “ProbabilisticTabu Search” to operate efficiently with larger instances of the CDAP. To assess the effectivenessof these proposed heuristics, we compare their performance, first between them and thenwith recent heuristics in the literature. The results demonstrate the efficiency of the proposedapproaches on data sets from the literature", "keywords": [ "Doors", "Linearization", "Truck", "Integer programming", "Linear programming", "DOCK", "Sorting" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://theses.hal.science/tel-03202077v1/document" }, { "id": "https://openalex.org/W4390419125", "doi": "10.1109/iiai-aai59060.2023.00122", "title": "An Efficient Pallet Layout Planning of Conveyor-Like AGV System in the Omni-Channel Cross-Docking Operation", "year": 2023, "publication_date": "2023-07-08", "type": "conference-paper", "language": "en", "authors": [ "Teng-Sheng Su", "Shi-Pei Lin", "Shan-Ru Hu", "Hui-ting Liang" ], "first_author": "Teng-Sheng Su", "venue": null, "publisher": null, "abstract": "In a cross-docking of the omni-channel retailing distribution center, how to de-sign an intelligent goods staging and pallets layout strategy with multi-time window to make loaded trucks on-time delivery has become a mainstream in the omni-channel logistics system. In this study, a fuzzy-set-based method adopted to solve movable pallets layout problem in an onmi-channel cross-docking with conveyor-like AGV systems is developed. Three tasks of the layout design are presented. Firstly, the movable pallets zone formation in a cross-dock warehouse is generated based on the workload balance of inbound and outbound docks and the material flow configuration. Secondly, the flow ranking of movable pallets in zones is calculated to generate conveyor-AGV cross-dock transporting blocks. Thirdly, each of movable pallets within zones is ordered to explore the exact initial layout. An experimental example is to demonstrate and validate the proposed layout methods in improving the material flow and increasing cross-dock operations efficiency of an omni-channel distribution center with conveyor-like AGV systems.", "keywords": [ "Pallet", "Truck", "Computer science", "Page layout", "Channel (broadcasting)", "DOCK", "Conveyor system", "Material flow", "Automated guided vehicle", "Simulation", "Engineering", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://dx.doi.org/10.1109/iiai-aai59060.2023.00122" }, { "id": "https://openalex.org/W4311902035", "doi": "10.1016/j.scitotenv.2022.161024", "title": "An assessment of higher-value recyclable wastes in Mexico City households using a novel waste collector citizen science approach", "year": 2022, "publication_date": "2022-12-19", "type": "article", "language": "en", "authors": [ "V.C. Shruti", "Gurusamy Kutralam-Muniasamy", "Fermín Pérez‐Guevara", "Priyadarsi Debajyoti Roy" ], "first_author": "V.C. Shruti", "venue": "The Science of The Total Environment", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "cardboard", "Municipal solid waste", "Household waste", "Waste collection", "Waste management", "Business", "Distribution (mathematics)", "Environmental science", "Engineering" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.scitotenv.2022.161024" }, { "id": "https://openalex.org/W4390058306", "doi": "10.3390/a17010004", "title": "Comparing Direct Deliveries and Automated Parcel Locker Systems with Respect to Overall CO2 Emissions for the Last Mile", "year": 2023, "publication_date": "2023-12-21", "type": "article", "language": "en", "authors": [ "Kai Gutenschwager", "Markus Rabe", "Jorge Chicaiza-Vaca" ], "first_author": "Kai Gutenschwager", "venue": "Algorithms", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Fast growing e-commerce has a significant impact both on CEP providers and public entities. While service providers have the first priority on factors such as costs and reliable service, both are increasingly focused on environmental effects, in the interest of company image and the inhabitants’ health and comfort. Significant additional factors are traffic density, pollution, and noise. While in the past direct delivery with distribution trucks from regional depots to the customers might have been justified, this is no longer valid when taking the big and growing numbers into account. Several options are followed in the literature, especially variants that introduce an additional break in the distribution chain, like local mini-hubs, mobile distribution points, or Automated Parcel Lockers (APLs). The first two options imply a “very last mile” stage, e.g., by small electrical vehicles or cargo bikes, and APLs rely on the customers to operate the very last step. The usage of this schema will significantly depend on the density of the APLs and, thus, on the density of the population within quite small regions. The relationships between the different elements of these technologies and the potential customers are studied with respect to their impact on the above-mentioned factors. A variety of scenarios is investigated, covering different options for customer behaviors. As an additional important point, reported studies with APLs only consider the section up to the APLs and the implied CO2 emission. This, however, fully neglects the potentially very relevant pollution created by the customers when fetching their parcels from the APL. Therefore, in this paper this impact is systematically estimated via a simulation-based sensitivity analysis. It can be shown that taking this very last transport step into account in the calculation significantly changes the picture, especially within areas in outer city districts.", "keywords": [ "Last mile (transportation)", "Truck", "Service provider", "Computer science", "Business", "Population", "Transport engineering", "Service (business)", "Environmental economics", "Mile", "Marketing", "Geography" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/1999-4893/17/1/4/pdf?version=1703151759" }, { "id": "https://openalex.org/W4396591069", "doi": "10.1080/00207543.2024.2337109", "title": "Current research and future challenges in parcel hub towards logistics 4.0: a systematic literature review from a decision-making perspective", "year": 2024, "publication_date": "2024-05-01", "type": "review", "language": "en", "authors": [ "James C. Chen", "Dewanti Anggrahini", "Tzu‐Li Chen" ], "first_author": "James C. Chen", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "Parcel hub (PH), as one of the logistic system entities, plays a significant role in delivering packages. PH operations are identical to a cross-docking system. Numerous studies were conducted to examine solutions in PH and cross-docking in general. This paper aims to investigate scientific references published within the last fifteen years through a systematic literature review (SLR). The objectives are to determine the critical decisions related to PH problems, classify the applied solution approach, and identify the future challenges regarding the transformation towards intelligent logistics. This study implements an SLR methodology that consists of five stages: planning, searching, screening, analysing, and reporting. This study utilises two publication databases and one reference management system. More than four thousand documents were collected in the searching stage. Then, five assessments are conducted to sort the most relevant papers. One hundred and forty-six articles are included in the further analysis. This study classifies four important decisions associated with PH problems: truck scheduling, internal process planning, facility planning, and technology selection. In addition, this study categorises ten solution approaches employed to find the best decision in the prior research. Moreover, this study explains the future research directions and managerial implications of managing parcel hub systems.", "keywords": [ "Perspective (graphical)", "Management science", "Systematic review", "Knowledge management", "Operations research", "Business", "Engineering", "Process management", "Computer science", "Political science", "Artificial intelligence" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2024.2337109" }, { "id": "https://openalex.org/W7128818377", "doi": "10.52072/arti.v21i1.1842", "title": "Penerapan Cross-Docking untuk Efisiensi Logistik Shopee di Era Lonjakan Transaksi E-Commerce", "year": 2026, "publication_date": "2026-02-13", "type": "article", "language": null, "authors": [ "Khairunnisa -", "Ahmad Shalihin", "Surya Indrawan" ], "first_author": "Khairunnisa -", "venue": "Jurnal ARTI (Aplikasi Rancangan Teknik Industri)", "publisher": null, "abstract": "Pertumbuhan pesat e-commerce di Indonesia, khususnya dominasi Shopee, menghadirkan tantangan besar dalam pengelolaan logistik, terutama pada saat lonjakan transaksi seperti kampanye 11.11 dan 12.12. Permasalahan utama yang muncul meliputi backlog pengiriman, tingginya inventory di gudang sortir, serta keterlambatan pemenuhan pesanan. Penelitian ini mengusulkan penerapan strategi cross-docking berbasis formulasi Truck Sequencing Problem (TRSP) sebagai solusi untuk meningkatkan efisiensi distribusi. Metode yang digunakan berupa simulasi perbandingan antara sistem konvensional dan sistem cross-docking dengan parameter waktu tinggal (dwell time), jumlah inventory puncak, serta rentang operasi (operation span). Hasil penelitian menunjukkan bahwa cross-docking mampu menurunkan rata-rata dwell time sebesar 86,4%, mengurangi inventory maksimum hingga 68,1%, dan memperpendek operation span sebesar 28,6% dibandingkan sistem konvensional. Temuan ini membuktikan bahwa integrasi TRSP dengan strategi cross-docking berpotensi meningkatkan kecepatan distribusi, mengurangi biaya logistik, serta meningkatkan kepuasan konsumen Shopee. Penelitian selanjutnya disarankan menggunakan data operasional riil Shopee, mempertimbangkan multi-dock, heterogenitas produk, serta integrasi dengan sistem last-mile delivery untuk memperoleh hasil yang lebih komprehensif.", "keywords": [], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.52072/arti.v21i1.1842" }, { "id": "https://openalex.org/W4413143864", "doi": "10.1016/j.tre.2025.104351", "title": "The multi-visit parallel drone scheduling pickup and delivery problem considering multiple trips and time windows", "year": 2025, "publication_date": "2025-08-08", "type": "article", "language": "en", "authors": [ "Shanshan Meng" ], "first_author": "Shanshan Meng", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Pickup", "TRIPS architecture", "Drone", "Scheduling (production processes)", "Computer science", "Vehicle routing problem", "Job shop scheduling", "Operations research", "Engineering", "Simulation", "Operations management", "Parallel computing" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2025.104351" }, { "id": "https://openalex.org/W567212174", "doi": null, "title": "INFORMATION TECHNOLOGY OF COMMERCIAL VEHICLES IN THE JAPANESE PARCEL SERVICE BUSINESS", "year": 1992, "publication_date": "1992-01-01", "type": "article", "language": "en", "authors": [ "Hiroo Kawata" ], "first_author": "Hiroo Kawata", "venue": null, "publisher": null, "abstract": "This paper describes a highly successful parcel door to door delivery service in Japan which involves the following components: a Takkyubin truck with technologically advanced design, truck information systems traffic control system, and digital driving pattern monitors.", "keywords": [ "Truck", "Service (business)", "Transport engineering", "Business", "Information system", "Control (management)", "Computer science", "Telecommunications", "Computer security", "Engineering", "Automotive engineering", "Marketing" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/493682" }, { "id": "https://openalex.org/W2741022933", "doi": null, "title": "Quantifying Supply Risk at a Cellulosic Biorefinery", "year": 2015, "publication_date": "2015-07-01", "type": "article", "language": "en", "authors": [ "Jason Hansen", "Jacob J. Jacobson", "Kara Cafferty", "Patrick Lamers", "Mohammad Roni" ], "first_author": "Jason Hansen", "venue": "OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)", "publisher": "Office of Scientific and Technical Information", "abstract": "In order to increase the sustainability and security of the nation’s energy supply, the U.S. Department of Energy through its Bioenergy Technology Office has set a vision for one billion tons of biomass to be processed for renewable energy and bioproducts annually by the year 2030. The Renewable Fuels Standard limits the amount of corn grain that can be used in ethanol conversion sold in the U.S, which is already at its maximum. Therefore making the DOE’s vision a reality requires significant growth in the advanced biofuels industry where currently three cellulosic biorefineries convert cellulosic biomass to ethanol. Risk mitigation is central to growing the industry beyond its infancy to a level necessary to achieve the DOE vision. This paper focuses on reducing the supply risk that faces a firm that owns a cellulosic biorefinery. It uses risk theory and simulation modeling to build a risk assessment model based on causal relationships of underlying, uncertain, supply driving variables. Using the model the paper quantifies supply risk reduction achieved by converting the supply chain from a conventional supply system (bales and trucks) to an advanced supply system (depots, pellets, and trains). Results imply that the advanced supply system reduces supply system risk, defined as the probability of a unit cost overrun, from 83% in the conventional system to 4% in the advanced system. Reducing cost risk in this nascent industry improves the odds of realizing desired growth.", "keywords": [ "Supply chain", "Energy supply", "Biorefinery", "Cellulosic ethanol", "Renewable energy", "Supply chain risk management", "Supply and demand", "Sustainability", "Bioenergy", "Environmental economics", "Biofuel", "Risk analysis (engineering)" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.osti.gov/servlets/purl/1357903" }, { "id": "https://openalex.org/W2898871818", "doi": "10.1109/hpcs.2018.00156", "title": "Experiments in Routing Vehicles for Municipal Services", "year": 2018, "publication_date": "2018-07-01", "type": "conference-paper", "language": "en", "authors": [ "Imran Mahmood", "Sahar Idwan", "Izzeddin Matar", "Junaid Ahmed Zubairi" ], "first_author": "Imran Mahmood", "venue": null, "publisher": null, "abstract": "In this paper, route planning of waste collection trucks using R&R (Ruin and Recreate) approach is explored. We assume the trucks are guided by the central depot in selecting the optimal route for waste collection. Heuristic algorithms are simulated to find the optimal routes for the waste management fleet. Through the use of smart dumpsters that can communicate the current level of waste using sensors and communication modules, we aim to reduce the number of trucks used, the total time taken and total distance traveled by the fleet in a day. Our work is based on variations of CVRPTW (Capacitated Vehicle Routing Problem with Time Window Constraint). The central management system selects the dumpsters, based on their waste levels, in descending order, and dispatches appropriate number of trucks, with path assignments using Ruin and Recreate (R&R) approach of the VRPTW strategy. The municipal authority saves transit time, fuel cost and service time by using our approach, through a simulation of smart waste collection.", "keywords": [ "Truck", "Vehicle routing problem", "Waste collection", "Routing (electronic design automation)", "Fleet management", "Computer science", "Operations research", "Heuristic", "Transport engineering", "Service (business)", "Route planning", "Constraint (computer-aided design)" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/hpcs.2018.00156" }, { "id": "https://openalex.org/W577244856", "doi": null, "title": "Logistics of empty marine containers", "year": 2007, "publication_date": "2007-03-31", "type": "dissertation", "language": "en", "authors": [ "S.J. Mol" ], "first_author": "S.J. Mol", "venue": "Research Repository (Delft University of Technology)", "publisher": "Delft University of Technology", "abstract": "A research on strategies for port planning, concerning the storage and flow of empty marine containers in the port of Rotterdam. The aim of this research is to give insight in the effects of port planning strategies of the Rotterdam Port Authority (RPA), regarding storage facilities for empty containers (empty depots) at the Port of Rotterdam (PoR). Empty depots generate transport of empty containers (often by truck), and increasingly require port terrain. Given the expected growth of trade volumes, the environmental regulations and the quality of the accessibiliy of the PoR requires a planning strategy for empty depots. In the allocation of storage areas for empty containers the RPA needs to decide upon the location, the quantity, the dimensions of the required area, the related infrastructure (which impacts the accessibility of the port) and the lease price of empty depot terrain.", "keywords": [ "Port (circuit theory)", "Lease", "Terrain", "Truck", "Transport engineering", "Business", "Operations research", "Operations management", "Engineering", "Finance", "Geography" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "http://resolver.tudelft.nl/uuid:5677048f-b672-40b9-b5d4-0d7ad4d74bd9" }, { "id": "https://openalex.org/W4382751234", "doi": "10.5267/j.msl.2023.6.004", "title": "K-means clustering for optimization of spare parts delivery", "year": 2023, "publication_date": "2023-01-01", "type": "article", "language": "en", "authors": [ "Kaushik D Ramgude", "Neela Rajhans" ], "first_author": "Kaushik D Ramgude", "venue": "Management Science Letters", "publisher": "Growing Science", "abstract": "Transhipment is an important logistics strategy that helps to improve supply chain efficiency and reduce transportation costs. It enables cargo to be transported to multiple destinations using different modes of transportation, such as ships, trains, trucks, and planes. This can help to reduce the overall transportation time and cost, as well as improve inventory management and distribution. In addition to its use in logistics and transportation, transhipment can also be used in other industries such as manufacturing, where it can be used to transfer raw materials or finished products between different facilities or production lines. This research paper examines the role of transhipment in improving the efficiency of spare part delivery systems to the PMPML depots from central workshop Swargate. PMPML has 12 depots in total (including central workshop). In many industries, the supply chain for spare parts is complex, with multiple suppliers, warehouses, and service centres involved. Transhipment, or the transfer of inventory between locations, can help to reduce lead times and improve inventory availability. In this paper, we analyze the impact of transhipment on key performance metrics such as order fulfilment, inventory turnover, and transportation costs. We also discuss the challenges associated with implementing transhipment in spare part delivery systems, including coordination between different parties, data sharing, and system integration.", "keywords": [ "Spare part", "Supply chain", "Truck", "Computer science", "Business", "Inventory theory", "Service (business)", "Order (exchange)", "Delivery Performance", "Transport engineering", "Operations research", "Operations management" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5267/j.msl.2023.6.004" }, { "id": "https://openalex.org/W4402147028", "doi": "10.15483/2429432", "title": "Dataset of U.S. School Bus Depots", "year": 2025, "publication_date": "2025-01-01", "type": "article", "language": "en", "authors": [ "Yang Shao" ], "first_author": "Yang Shao", "venue": "OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)", "publisher": "Office of Scientific and Technical Information", "abstract": "A large body of public health literature describes how undesirable or dangerous facilities, such as truck depots and industrial plants, located in or near communities can lead to health harms. Research also describes the high levels of traffic-related air and noise pollution that is linked to health harms and may be disproportionately distributed near many schools. Therefore, a primary use case for this dataset is to analyze the location of school bus depots and to create an evidence base that would better enable the work of community members, advocates, and other stakeholders toward improving air quality and public health. Other possible uses for this school bus depot dataset include electricity grid planning and reliability, given recent momentum toward school bus electrification. This dataset was created using an object-based approach with remote sensing data. The primary source of aerial imagery was the National Agriculture Imagery Program (NAIP) dataset. NAIP imagery was analyzed to locate individual school buses based on their color and size, and then classified clusters of school buses as potential depots, which were then verified visually. The resulting dataset contains 11,309 depots across the 48 contiguous U.S. states and Washington, D.C. Fifty-one percent (5,730 depots) are at schools, defined as being 350 meters or less from the nearest school. The accuracy of the dataset was assessed by comparing it with independent reference datasets containing 506 depots from the records of two school transportation companies. We found good agreement, with an omission error rate of 15.2% (77 depots). This dataset represents one of the only remote sensing projects to conduct object detection using data at the sub-meter to 1-meter resolution for a continental-scale application.", "keywords": [ "School bus", "Computer science", "Transport engineering", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.15483/2429432" }, { "id": "https://openalex.org/W2209223970", "doi": null, "title": "작업시간창이 주어진 크로스토킹 터미널에서 미 선적 물량 최소화를 위한 입출고 트럭 일정계획", "year": 2011, "publication_date": "2011-12-01", "type": "article", "language": "ko", "authors": [ "주철민", "김병수" ], "first_author": "주철민", "venue": null, "publisher": null, "abstract": "This paper considers the inbound and outbound truck scheduling problem in a cross docking terminal. The unloading process from inbound trucks and loading process to outbound trucks are assumed to be performed within a time window. If some items are not able to be loaded to their scheduled outbound trucks within the time window, they are stored in the terminal and shipped using the truck visiting the next time window. The objective of this paper is to schedule inbound and outbound trucks to minimize the number of items unable to ship within the time window. A mathematical model for an optimal solution is derived, and a rule-based local search heuristic algorithm and genetic algorithm (GA) are proposed. The performance of the algorithms are evaluated using randomly generated several examples.", "keywords": [ "Truck", "Window (computing)", "Computer science", "Scheduling (production processes)", "Terminal (telecommunication)", "Heuristic", "Job shop scheduling", "Schedule", "Operations research", "Real-time computing", "Mathematical optimization", "Engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.dbpia.co.kr/Journal/ArticleDetail/NODE01907738?q=(%5BBosch%C2%A7coldb%C2%A72%C2%A751%C2%A73%5D)&fCategory=76%5E_ND%5E_%EA%B3%B5%ED%95%99&Multimedia=0&SearchAll=Bosch&isFullText=0&specificParam=0&SearchMethod=0&Sort=1&SortType=desc" }, { "id": "https://openalex.org/W2027885272", "doi": "10.2166/wst.2007.756", "title": "An investigation of wash-off controlling parameters at urban and commercial monitoring sites", "year": 2007, "publication_date": "2007-12-01", "type": "article", "language": "en", "authors": [ "Christian Berretta", "Ilaria Gnecco", "Luca G. Lanza", "P. La Barbera" ], "first_author": "Christian Berretta", "venue": "Water Science & Technology", "publisher": "Pergamon Press", "abstract": "The relationship between the parameters of the wash-off function and the controlling hydrologic variables are investigated in this paper, assuming that the pollutant generation process basically depends on the watershed rainfall-runoff response characteristics. Data collected during an intense monitoring program carried out by the Department of Environmental Engineering of the University of Genova (Italy) within a residential area, an auto dismantler facility, a tourism terminal and a urban waste truck depot are used to this aim. The observed runoff events are classified into different TSS mass delivery processes and the occurrence of the first flush phenomenon is also investigated. The correlation between the mathematical parameters describing the exponential process and the hydrological parameters of the corresponding rainfall-runoff event is analysed: runoff parameters and in particular the maximum flow discharge over the time of concentration of the drainage network are proposed as the controlling factor for the total mass of pollutant that is made available for wash-off during each runoff event.", "keywords": [ "Surface runoff", "Environmental science", "First flush", "Pollutant", "Hydrology (agriculture)", "Watershed", "Urban runoff", "Time of concentration", "Total suspended solids", "Truck", "Environmental engineering", "Stormwater" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2166/wst.2007.756" }, { "id": "https://openalex.org/W7014647776", "doi": null, "title": "Planification temps réel de camions en cross-docking : un cadre de simulation hybride multi-agents", "year": 2023, "publication_date": "2023-11-28", "type": "dissertation", "language": "en", "authors": [ "Ayse Bilge Torbali" ], "first_author": "Ayse Bilge Torbali", "venue": "HAL (Le Centre pour la Communication Scientifique Directe)", "publisher": "Centre National de la Recherche Scientifique", "abstract": "In this thesis we propose a novel framework for real-time truck scheduling in cross-dock warehouses. Cross-docking is a logistics technique that enables fast material flows with minimal (less than 24 hours) or no intermediate storage by efficiently orchestrating the inbound and outbound activities together with the internal operations. Through a comprehensive literature review, we first highlight the need to explore real-time approaches for cross-docking.The proposed framework for real-time truck scheduling problem is based on a hybrid model combining multi-agent-based simulation (MAS) and discrete-event simulation (DES). We propose to use the MAS for truck scheduling decisions and DES for the execution of internal operations inside the cross-dock to benefit from the strengths of both techniques: The multi-agent approach practices the autonomous, reactive and thus distributed responsibility characteristics of the agents to realise shared computation and respond flexibly to dynamic events such as truck arrivals. The process-oriented DES enables central control of internal operations. The framework is implemented on three different settings.We first focus on the single inbound and outbound cross-dock setting, for a better understanding of the complex dynamics of the system and the mechanisms involved in multi-agent-based real-time truck scheduling. This initial model is then scaled up to multiple inbound and outbound door cross-dock settings by gradually increasing the number of doors. To this end, the decision mechanisms on truck selection are scaled up, and new decision mechanisms (i.e. door selection) are added to the model. Similarly, the internal configuration of the platform is adapted towards the requirements of the multiple-door settings (e.g. distributed temporary storage). For both model settings, the performance of the proposed models is evaluated by employing a combination of different traffic levels and various truck-to-door assignment strategies. The significance of the results is attested using ANOVA (analysis of variance) tests. In addition, model behaviour and computational complexity analyses are performed as the model scales up. Finally, a third model is developed to illustrate that the proposed approach can successfully apply to other truck scheduling problem configurations. To this end, an existing truck scheduling problem in the cross-docking literature, which employs a mathematical optimisation, is selected. The problem instances of the chosen study are used for comparison purposes. The analysis of the results on the performance metrics is presented from a comparative point of view.The proposed multi-agent-based hybrid approach reveals its efficacy in enabling fast synchronisation of cross-docks against uncertainty. It paves the way for future real-time applications in this field.", "keywords": [ "Truck", "Scheduling (production processes)", "Computation", "Focus (optics)", "Decision support system", "Selection (genetic algorithm)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://theses.hal.science/tel-04812226v1/document" }, { "id": "https://openalex.org/W2136841972", "doi": null, "title": "Safety review of a dangerous goods transport company: a case study", "year": 2010, "publication_date": "2010-09-01", "type": "review", "language": "en", "authors": [ "Lori Mooren", "Raphael H. Grzebieta" ], "first_author": "Lori Mooren", "venue": null, "publisher": null, "abstract": "A twelve-element fleet safety management model system was used to conduct a gap analysis of fleet safety management practices of transport and depot operations of a dangerous goods transport company. This formed part of a holistic and systematic review, leading to the preparation of a safety management improvement plan. The review took a systems approach to identify and analyse elements of the company's management system to assess if there were any deficiencies. The review method included a fleet safety 'maturity' survey of drivers, managers and executives of the company, in-depth interviews with a selection of staff, driver and manager focus groups, and specialist inspections of truck fleet purchasing and maintenance practices and fatigue risk management practices. The results and recommendations were fully embraced by the company. The 67 recommendations were adopted and programmed for implementation. Achievements after two years since the review are reported. While the study has methodological limitations, important lessons about how to use data gathering for organisation improvement, have been gained.", "keywords": [ "Purchasing", "Truck", "Business", "Operations management", "Safety management systems", "Plan (archaeology)", "Engineering", "Transport engineering", "Management system", "Marketing", "Process management" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://casr.adelaide.edu.au/rsr/RSR2010/MoorenL.pdf" }, { "id": "https://openalex.org/W641625085", "doi": null, "title": "USE OF LIFT TRUCKS IN PORT HANDLING WORK. 12TH DISCUSSION WITH FORK LIFT TRUCK MANUFACTURERS", "year": 1970, "publication_date": "1970-01-01", "type": "article", "language": "en", "authors": [ "G. Haussmann" ], "first_author": "G. Haussmann", "venue": null, "publisher": null, "abstract": "The article discusses the handling of transcontainers at port terminals, using straddle carriers, straddle loaders and fork trucks. Reference is made to the employment of special equipment at containership and semicontainership landing places for roll-on/roll-off service, in empty-container depots, and for loading and unloading containers in collective freight traffic. Finally, the handling of piece-goods as unit loads was discussed.", "keywords": [ "Straddle", "Truck", "Engineering", "Lift (data mining)", "Fork (system call)", "Container (type theory)", "Port (circuit theory)", "Automotive engineering", "Transport engineering", "Aeronautics", "Marine engineering", "Computer science" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/899" }, { "id": "https://openalex.org/W4409563385", "doi": "10.1016/j.tre.2025.104145", "title": "Optimizing battery swapping for city-scale e-bike sharing systems: A three-stage spatial–temporal cluster-based approach", "year": 2025, "publication_date": "2025-04-18", "type": "article", "language": "en", "authors": [ "Siyu Shao", "Deyi Li", "Yaoming Zhou", "Jiuh‐Biing Sheu" ], "first_author": "Siyu Shao", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Bike sharing", "Cluster (spacecraft)", "Scale (ratio)", "Stage (stratigraphy)", "Computer science", "Battery (electricity)", "Transport engineering", "Engineering", "Geography", "Cartography", "Computer network", "Geology" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2025.104145" }, { "id": "https://openalex.org/W4412785130", "doi": "10.3390/s25144439", "title": "An Inexpensive AI-Powered IoT Sensor for Continuous Farm-to-Factory Milk Quality Monitoring", "year": 2025, "publication_date": "2025-07-16", "type": "article", "language": "en", "authors": [ "Kaneez Fizza", "Abhik Banerjee", "Dimitrios Georgakopoulos", "Prem Prakash Jayaraman", "Ali Yavari", "Anas Dawod" ], "first_author": "Kaneez Fizza", "venue": "Sensors", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "The amount of protein and fat in raw milk determines its quality, value in the marketplace, and related payment to suppliers. Technicians use expensive specialized laboratory equipment to measure milk quality in specialized laboratories. The continuous quality monitoring of the milk supply in the supplier's tanks enables the production of higher quality products, better milk supply chain optimization, and reduced milk waste. This paper presents an inexpensive AI-powered IoT sensor that continuously measures the protein and fat in the raw milk in the tanks of dairy farms, pickup trucks, and intermediate storage depots across any milk supply chain. The proposed sensor consists of an in-tank IoT device and related software components that run on any IoT platform. The in-tank IoT device quality incorporates a low-cost spectrometer and a microcontroller that can send milk supply measurements to any IoT platform via NB-IoT. The in-tank IoT device of the milk quality sensor is housed in a food-safe polypropylene container that allows its deployment in any milk tank. The IoT software component of the milk quality sensors uses a specialized machine learning (ML) algorithm to translate the spectrometry measurements into milk fat and protein measurements. The paper presents the design of an in-tank IoT sensor and the corresponding IoT software translation of the spectrometry measurements to protein and fat measurements. Moreover, it includes an experimental milk quality sensor evaluation that shows that sensor accuracy is ±0.14% for fat and ±0.07% for protein.", "keywords": [ "Factory (object-oriented programming)", "Supply chain", "Raw milk", "Software", "Quality (philosophy)", "Microcontroller", "Internet of Things", "Engineering", "Computer science", "Process engineering", "Embedded system", "Food science" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/1424-8220/25/14/4439/pdf?version=1752837371" }, { "id": "https://openalex.org/W4416795274", "doi": "10.1016/j.energy.2025.139441", "title": "Cost-optimization of battery electric heavy duty vehicles from Nordic perspective: Comparative cost-analysis of two separate charging solutions", "year": 2025, "publication_date": "2025-11-28", "type": "article", "language": "en", "authors": [ "Esa Tuviala", "Altti Meriläinen", "Teemu Hiltunen", "Tuomo Lindh", "Pertti Kauranen", "Jero Ahola" ], "first_author": "Esa Tuviala", "venue": "Energy", "publisher": "Elsevier BV", "abstract": "Road freight transportation causes 8 % of total greenhouse gas emissions globally. Therefore there is great potential to reduce the global greenhouse gas emissions by adopting low-emission alternative propulsion methods. Economic feasibility of these alternative propulsion methods can accelerate this shift. This study presents a multi-layer optimization tool to model and cost-optimize charging methods for battery electric trucks (BETs). Two scenarios are analyzed: (1) depot charging and (2) en route charging. The tool simulates heavy-duty vehicle (HDV) movement and calculates energy consumption based on gross vehicle weight (GVW). Cost-optimization includes charging station location, number of chargers, charger rated power and battery capacity. Electricity spot market prices and diesel prices in Finland from 2020 to 2024 are used to evaluate energy costs. This simulation tool is used to examine a case study set in southeastern Finland where four HDVs transport goods between Hamina and Joutseno (125 km apart). These HDVs are considered to depart with full payload having GVW of 68 000 kg and return with empty payload having GVW of 24 000 kg Both charging methods can achieve lower Levelized cost of Driving (LCOD) compared to using a diesel equivalent. The results show that depot charging achieves slightly lower LCOD compared to en route charging due to lower requirements for the infrastructure. However, when the results are compared to battery swapping BETs, it can be seen that battery swapping allows lower dimensioning of charging station and utilization of lower electricity spot market prices, resulting in lower infrastructure and energy costs.", "keywords": [ "Truck", "Battery (electricity)", "Greenhouse gas", "Diesel fuel", "Charging station", "Electricity", "Dimensioning", "Heavy duty", "Payload (computing)", "Electrification" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.energy.2025.139441" }, { "id": "https://openalex.org/W4413920363", "doi": "10.1016/j.jtrangeo.2025.104386", "title": "Terminal-centric logistics for integrated and profitable intermodal transport networks", "year": 2025, "publication_date": "2025-09-02", "type": "article", "language": "en", "authors": [ "Jason Monios", "Rickard Bergqvist" ], "first_author": "Jason Monios", "venue": "Journal of Transport Geography", "publisher": "Elsevier BV", "abstract": "This paper elaborates the need for intermodal terminals to pursue logistics integration in order to support the balance of flows on their rail shuttles and ultimately achieve a successful business. Port container shuttles in Europe are often marginal due to insufficient distances, short trains and import-dominated flows. The case study of a successful intermodal terminal in Sweden shows how various strategies can secure outbound full flows: an empty depot to provide containers for exporters and save the cost of sending empties to the port; dedicated rail-connected warehousing to provide containerisation of export flows that are then sent full to the port; balancing road haulage from terminal to warehouse with secondary distribution from warehouse to stores. On the sustainability side, this model has enabled the introduction of electric trucks because the company manages their own trucking and charging provision at the intermodal terminal, warehouse and stores. The conclusion of this study is that this success is only possible if all of these activities (rail shuttle, intermodal terminal, warehousing and haulage) are integrated within a single operator who is able to obtain these synergies both in long-term planning and in operations and revenue management. Thus, for increased modal share of intermodal transport as desired by policy makers, we need to favour such strategies of integration based on a model of terminal-centric logistics.", "keywords": [ "Transport engineering", "Terminal (telecommunication)", "Business", "Engineering", "Computer science", "Telecommunications" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.jtrangeo.2025.104386" }, { "id": "https://openalex.org/W2957508798", "doi": "10.1016/j.orp.2019.100126", "title": "Output maximization container loading problem with time availability constraints", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Pedro Belin Castellucci", "Franklina M. B. Toledo", "Alysson Machado Costa" ], "first_author": "Pedro Belin Castellucci", "venue": "Operations Research Perspectives", "publisher": "Elsevier BV", "abstract": "Research on container loading problems has been proved effective in increasing the filling rate of containers in different practical situations. However, the broader logistic context might pressure the loading process, leading to sub-optimal solutions. Some facilities like cross-docks have reduced storage space which might force early loading activities. We propose a container loading problem which accounts for this limited storage by explicitly considering the schedule of arrival for the boxes and the departure time of the trucks. Also, we design a framework which handles the geometric and temporal characteristics of the problem separately, enabling the use of methods found in the literature for solving the extended problem. Our framework can handle uncertainty in the schedule and be used to quantify the impact of delays on capacity utilization and departure time of trucks.", "keywords": [ "Container (type theory)", "Truck", "Schedule", "Computer science", "Context (archaeology)", "Maximization", "Mathematical optimization", "Process (computing)", "Operations research", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.orp.2019.100126" }, { "id": "https://openalex.org/W4313800182", "doi": "10.1007/s00291-022-00702-y", "title": "The parcel hub scheduling problem with limited conveyor capacity and controllable unloading speeds", "year": 2023, "publication_date": "2023-01-09", "type": "article", "language": "en", "authors": [ "Stefan Bugow", "Carolin Kellenbrink" ], "first_author": "Stefan Bugow", "venue": "OR Spectrum", "publisher": "Springer Science+Business Media", "abstract": "Abstract We investigate a specific truck scheduling problem at cross-docks in the postal service industry on an operational level aiming to maximise the number of duly parcels assuming fixed departure times of the outbound trucks. The inbound gates and the conveyors as means of transportation inside the hub constitute the bottleneck resources. As a novel extension, we propose flexible unloading speeds to efficiently utilise the scarce resources. We formalise the problem with a mixed integer program and explicitly incorporate controllable unloading speeds of the inbound trucks. We determine the computational complexity and develop a genetic algorithm to efficiently solve the problem. Our investigation focuses on both the performance of the genetic algorithm and the applicability of the results in a real-world environment by implementing scheduling policies in a simulation model that considers individual parcel interactions. Based on our experimental results, we can state that especially in problem settings with scarce conveyor capacities, our approach to incorporate controllable unloading speeds has the potential of significantly increasing the number of duly parcels.", "keywords": [ "Bottleneck", "Truck", "Computer science", "Scheduling (production processes)", "Job shop scheduling", "Mathematical optimization", "Operations research", "Genetic algorithm", "Distributed computing", "Routing (electronic design automation)", "Computer network", "Engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s00291-022-00702-y.pdf" }, { "id": "https://openalex.org/W3132325410", "doi": null, "title": "Facility and Routing Decisions in Truck-Drone Distribution", "year": 2020, "publication_date": "2020-08-06", "type": "other", "language": "en", "authors": [ "Vu Bich Na Doan", "Amr Mohammad Taiyeb" ], "first_author": "Vu Bich Na Doan", "venue": "DSpace@MIT (Massachusetts Institute of Technology)", "publisher": "Massachusetts Institute of Technology", "abstract": "Drones have the potential to be major players in the field of last-mile delivery, especially with the rise of e-commerce. However, they face several technological and regulatory restrictions for large-scale implementation. Combining drones with traditional ground delivery vehicles can bridge this gap while achieving significant improvements in distribution cost and speed over vehicle delivery alone. This research project focuses on modeling and solving the Location-Routing Problem with drones as an ancillary mode of delivery. The goal is to develop a model that identifies the optimal locations for the distribution facilities, as well as the set of combined routes that the trucks and drones will follow to deliver parcels to customers. To solve this problem, a two-steps metaheuristic approach is developed and implemented. The customer locations are first grouped into clusters with centroid positions where trucks would park, dispatch, and retrieve the onboard drones that perform the last step of the delivery. Once the optimal truck parking locations are identified, the selection of the optimal distribution facilities and the truck routes are determined simultaneously, by implementing the Multiple Ant Colony Optimization algorithm. The validation of the model revealed high reliability with a 1% average optimality gap from the exact solution. When applying the model to a real road network, with 200 customers and 5 candidate depot locations, the model confirmed a 24% saving in daily distribution costs from adding 3 drones to every delivery truck. The savings opportunity is less sensitive to the number of drones per truck and the drones’ speed, and more sensitive to the trucks’ speed and the drones’ traveling cost per mile. The analysis reveals that adding drones will generate savings as long as the traveling cost of drones is lower than that of trucks at around $4.00 on average for last-mile delivery.", "keywords": [ "Drone", "Truck", "Routing (electronic design automation)", "Distribution (mathematics)", "Computer science", "Aeronautics", "Operations research", "Business", "Transport engineering", "Engineering", "Automotive engineering", "Mathematics" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/1721.1/126493" }, { "id": "https://openalex.org/W4402958310", "doi": "10.1007/978-981-97-3690-4_45", "title": "Optimizing Parcel Delivery Routes", "year": 2024, "publication_date": "2024-01-01", "type": "conference-paper", "language": "en", "authors": [ "Sulabh Bansal", "Priyanshi Vyas" ], "first_author": "Sulabh Bansal", "venue": "Smart innovation, systems and technologies", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Computer science" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-981-97-3690-4_45" }, { "id": "https://openalex.org/W3124182142", "doi": "10.4324/9781315263052-26", "title": "The Air Cargo Industry", "year": 2016, "publication_date": "2016-12-05", "type": "book-chapter", "language": "en", "authors": [ "Peter S. Morrell" ], "first_author": "Peter S. Morrell", "venue": null, "publisher": null, "abstract": "The air cargo industry includes the movement of freight, express packages, mail and courier bags by air. The term ‘air cargo’ is often used for the combination of freight and mail, but the emergence of the express package sector and the decline of courier bags has led to a blurring of types of traffic carried. The demand for air cargo is for a door-to-door product, whether from manufacturer to final user, or between the various intermediaries in the supply chain. This will involve trucking and flights and possible a part of the trip by rail. Integrated carriers such as FedEx and DHL offer a door-to-door service while airlines generally only offer an airport to airport service, with other parties providing delivery to the airport and collection at the destination airport. Air cargo is a key ingredient of the trade in goods, whether internationally or between different regions of the same country, although the latter tends to be carried by truck or rail. Air cargo accounts for 34.6 per cent of the value of non-land international trade in goods, but only six per cent of the weight (Kararda, 2006). The average value to weight ratio of air shipped goods is 31 times as that of vessel shipped goods. This enables such items to bear the higher cost of shipment by air. Air cargo can thus be described as a derived industrial product. Some countries such as India have been very successful in developing services industries which are much less dependent on air transport. China on the other hand has a substantial manufacturing base and generates substantial air cargo flows both to North America and Europe. Air cargo rates tend to be significantly higher than those for surface transport. Thus high value-to-weight ratio products tend to be better able to support such rates. Companies do not want high value inventory in transit and take advantage of air cargo’s shorter transit times.", "keywords": [ "Air cargo", "Business", "Aeronautics", "Engineering", "Transport engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.4324/9781315263052-26" }, { "id": "https://openalex.org/W2617883695", "doi": "10.14416/j.ijast.2017.05.007", "title": "Solving the Location Routing Problem of the Central Rubber Market by Tabu Search", "year": 2017, "publication_date": "2017-05-29", "type": "article", "language": "en", "authors": [ "Somsak Kaewploy", "Sombat Sindhuchao" ], "first_author": "Somsak Kaewploy", "venue": "King Mongkut’s University of Technology North Bangkok International Journal of Applied Science and Technology", "publisher": null, "abstract": "The central rubber market of Songkhla province is the center of the collection and distribution of rubber production from sellers to purchasers. It is considered ineffective because sellers need to deliver whole raw rubber to the market, resulting in high transport costs, especially for those who came a great distance and had little quantity. This research applied the tabu search method to solve the location selection problem of the rubber purchasing depot and manage transport routes to the market. Results found that there were 16 purchasing depots. The central rubber market had unlimited purchasing capacity while the other purchasing depots limited the quantity of rubber to 10 tons. There were five transport routes and five trucks (four ten-wheeled trucks and one ten-wheeled truck with a trailer). The total delivery costs were 53,313.89 baht per day. The answers about efficiency from the Lingo 13 program with small, medium, and large problems and real problems were not significantly statistically different at a significance level of 0.05.", "keywords": [ "Tabu search", "Vehicle routing problem", "Mathematical optimization", "Routing (electronic design automation)", "Computer science", "Mathematics", "Computer network" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.14416/j.ijast.2017.05.007" }, { "id": "https://openalex.org/W1569294088", "doi": null, "title": "A HYBRID SA ALGORITHM FOR INLAND CONTAINER TRANSPORTATION", "year": 2013, "publication_date": "2013-04-07", "type": "article", "language": "en", "authors": [ "Wen Fei Wang", "Won Young Yun", "Byung Hyun Ha" ], "first_author": "Wen Fei Wang", "venue": "International journal of industrial engineering", "publisher": "University of Texas at El Paso", "abstract": "Inland container transportation refers to container movements among customer’s locations, container terminals, and depots in a local area. In this paper, containers are defined as four types according to the destination (inbound vs. outbound containers) and the container states (full vs. empty containers). Additionally, they can be delivered not only by truck but also by train if the time windows of them can be satisfied. A graph model is designed to represent and analyze the network of the problem. Then, a mathematical model is developed based on such a graph model and a hybrid SA algorithm is proposed to obtain the near-optimal transportation schedule of containers. The performance of the proposed algorithm is investigated by numerical examples.", "keywords": [ "Container (type theory)", "Truck", "Computer science", "Schedule", "Graph", "Transportation theory", "Mathematical optimization", "Algorithm", "Transport engineering", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://journals.sfu.ca/ijietap/index.php/ijie/article/view/515" }, { "id": "https://openalex.org/W4401852425", "doi": "10.35568/abdimas.v7i2.4622", "title": "Testing the Electrical Safety Aspects of The Emergency Shut Down Multi Indicator (Esin) Innovation Tool for Refueling De-Refueling Trucks (RDT) at The Mutiara Palu Aircraft Filling Depot", "year": 2024, "publication_date": "2024-04-30", "type": "article", "language": "en", "authors": [ "Ratih Mar’atus Sholihah", "Irwan Mahmudi", "Lutfiyana Andi Anshar" ], "first_author": "Ratih Mar’atus Sholihah", "venue": "ABDIMAS Jurnal Pengabdian Masyarakat", "publisher": null, "abstract": "As the commercial and trading subholding of PT Pertamina (Persero), Pertamina Patra Niaga also provides aviation fuel to airlines. The aviation fuel refueling place is called the Aircraft Refueling Depot. One of the aircraft filling depots in Palu is the Mutiara Aircraft Filling Depot, located in the Mutiara Sis Al-Jufri Airport Area. The Mutiara Aircraft Refueling Depot uses a Refueling De-Refueling Truck (RDT) to fill aircraft with fuel while on the ground. This refueler unit can also pump and store fuel from aircraft. One of the problems when refueling aviation fuel by RDT at the Mutiara Aircraft Filling Depot was the activation of the emergency stop when the Certified Refueler Operator (CRO) was carrying out the service. The aviation fuel-filling system stopped without anyone realizing it, causing flight delays. The active emergency stop without a clear indicator initiates the FT Prove Pin Point group to create an Emergency Shut-Down Multi-Indicator (ESIn) tool that can monitor the active status of the emergency fuel or engine stop. Before the ESIn tool is used, one of the steps that must be carried out is a feasibility test on electrical safety aspects. Testing is carried out using three criteria, namely visual testing, component electrical parameters, and performance. Based on visual and performance testing, the tool is in good condition and can operate according to the planned purpose. Likewise, when testing component electrical parameters, the measured parameter values show values according to applicable electrical standards.", "keywords": [ "Truck", "Automotive engineering", "Shut down", "Computer science", "Engineering", "Operating system" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://dx.doi.org/10.35568/abdimas.v7i2.4622" }, { "id": "https://openalex.org/W4407854709", "doi": "10.2139/ssrn.5149772", "title": "Hydrogen Refuelling and Charging Infrastructure for Trucks in Europe - a Cost Comparison", "year": 2025, "publication_date": "2025-01-01", "type": "preprint", "language": "en", "authors": [ "Patrick Plötz", "Antonio Sgaramella", "Daniel Speth", "Steffen Link", "Till Gnann", "Livio de Santoli" ], "first_author": "Patrick Plötz", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Truck", "Transport engineering", "Business", "Hydrogen", "Automotive engineering", "Engineering", "Chemistry" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.5149772" }, { "id": "https://openalex.org/W2082522365", "doi": "10.5465/ambpp.1973.4981687", "title": "MULTIPOLICY MAINTENANCE DECISIONS.", "year": 1973, "publication_date": "1973-08-01", "type": "conference-abstract", "language": "en", "authors": [ "Stanley T. Hardy", "LeRoy J. Krajewski" ], "first_author": "Stanley T. Hardy", "venue": "Academy of Management Proceedings", "publisher": "Academy of Management", "abstract": "The article reports on the making of effective maintenance decisions pertinent to industrial organizations. The author focuses on determining which decision will adequately maintain the organization's operating system while leaving the system functional. The author endeavors to convert reliability into a measurable asset. A study investigating the maintenance procedures utilized at truck depots leads to the development of a mathematical model for maintenance decisions. The function served by preventative maintenance procedures is compared to that of procedures designed to reduce the severity of system failures. Risk management is also discussed.", "keywords": [ "Risk analysis (engineering)", "Preventive maintenance", "Function (biology)", "Reliability (semiconductor)", "Asset (computer security)", "Computerized maintenance management system", "Planned maintenance", "Computer science", "Truck", "Operations management", "Reliability engineering", "Operations research" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5465/ambpp.1973.4981687" }, { "id": "https://openalex.org/W4223955535", "doi": "10.1061/jtepbs.0000669", "title": "Sustainable Transportation Networks Incorporating Green Modes for Urban Freight Delivery", "year": 2022, "publication_date": "2022-04-15", "type": "article", "language": "en", "authors": [ "MohammadHossein Shojaei", "Fatemeh Fakhrmoosavi", "Ali Zockaie", "Mehrnaz Ghamami", "Archak Mittal", "James Fishelson" ], "first_author": "MohammadHossein Shojaei", "venue": "Journal of Transportation Engineering Part A Systems", "publisher": "American Society of Civil Engineers", "abstract": "The sustainability of transportation networks is threatened by growing amounts of emissions generated by vehicles. Urban freight delivery is one of the major sources of these emissions. Cargo cycles are attracting increasing attention for urban delivery owing to their numerous benefits, such as being less pollutant, requiring less space on roads, and high maneuverability. Electric vans have also been proposed as another green mode of freight delivery with a larger delivery capacity and range relative to cargo cycles. In this study, urban freight delivery is targeted through a heterogeneous fleet vehicle routing problem. The proposed framework is used to capture the optimal configuration of a mixed freight delivery fleet offering cargo cycles (i.e., pedal-assisted bikes and trikes as well as electric bikes and trikes) alongside the often-used diesel or gasoline vans or small trucks and electric vans. The formulated problem aims to minimize the delivery costs for companies, including maintenance, purchase, fuel, and labor costs and noise and emission taxes. The methodological contribution of this study is to develop a new metaheuristic algorithm, based on variable neighborhood search and simulated annealing, that finds a better solution with up to 7% lower objective function value and 50% to 80% lower solution times relative to the existing approaches in the literature. This study also demonstrates that bikes and trikes are selected at short delivery distances in the Chicago downtown network. Electric vans are more suitable for large distances, while cargo vans are selected for medium distances. Imposing an emission tax would change the model from cargo vans to electric vans. The results also show that increasing tax levels does not necessarily reduce societal costs because the delivery company tends to maintain its profit margin by increasing delivery costs for customers.", "keywords": [ "Truck", "Transport engineering", "City logistics", "Sustainable transport", "Sustainability", "Simulated annealing", "Vehicle routing problem", "Traffic management", "Environmental economics", "Routing (electronic design automation)", "Computer science", "Engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1061/jtepbs.0000669" }, { "id": "https://openalex.org/W2590653249", "doi": "10.1007/978-3-319-53480-0_88", "title": "An ILS Heuristic for the Waste Collection Vehicle Routing Problem with Time Windows", "year": 2017, "publication_date": "2017-01-01", "type": "conference-paper", "language": "en", "authors": [ "Alba Assis Campos", "José Elias Claudio Arroyo" ], "first_author": "Alba Assis Campos", "venue": "Advances in intelligent systems and computing", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Vehicle routing problem", "Variable neighborhood search", "Iterated local search", "Tabu search", "Computer science", "Garbage", "Heuristics", "Benchmark (surveying)", "Truck", "Solver", "Mathematical optimization", "Variable (mathematics)" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-53480-0_88" }, { "id": "https://openalex.org/W2185251448", "doi": "10.19030/jbcs.v4i1.4747", "title": "Cargo Handling By Truckers And Competitive Advantage: Is There A Relationship?", "year": 2011, "publication_date": "2011-06-27", "type": "article", "language": "en", "authors": [ "Jeff Kennedy" ], "first_author": "Jeff Kennedy", "venue": "Journal of Business Case Studies (JBCS)", "publisher": null, "abstract": "The transportation industry is one of the largest employers in the United States. In fact, employment in the transportation industry is expected to increase from 4,205,000 jobs in 2002 to 5,120,000 jobs in 2012, an increase of 914,000 jobs, with truck drivers, including heavy and tractor-trailer drivers adding 337,000 new jobs (U.S. Bureau of Labor Statistics, 2006 and NAICS Industry Data, 2004). Truck drivers are a valuable and unique resource in today's economy because companies rely on trucks to pick up and deliver merchandise. No other mode of transportation delivers door-to-door. While some goods may travel most of the way by ship, train, or airplane, almost every good is carried by truck at some point en route to its destination. (West, 1-46)", "keywords": [ "Truck", "Business", "Transport engineering", "Transportation industry", "Point (geometry)", "Trucking industry", "Trailer", "Industrial organization", "Computer science", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://clutejournals.com/index.php/JBCS/article/download/4747/4837" }, { "id": "https://openalex.org/W2903413505", "doi": null, "title": "Warner Robins, Georgia. Air Service Command, Robins Field. Part of the training of the truck drivers of the depot group consists of driving many times through an obstacle course in the woods", "year": 1943, "publication_date": "1943-01-01", "type": "other", "language": "en", "authors": [ "Jack Delano" ], "first_author": "Jack Delano", "venue": "Library of Congress eBooks", "publisher": null, "abstract": null, "keywords": [ "Aeronautics", "Training (meteorology)", "Truck", "Course (navigation)", "Service (business)", "Operations management", "Transport engineering", "Operations research", "Engineering", "Geography", "Business", "Meteorology" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://picryl.com/media/warner-robins-georgia-air-service-command-robins-field-part-of-the-training-4" }, { "id": "https://openalex.org/W1524417344", "doi": null, "title": "La capacità delle aree di sosta nei terminal container", "year": 1997, "publication_date": "1997-01-01", "type": "article", "language": "it", "authors": [ "Paolo Sartor" ], "first_author": "Paolo Sartor", "venue": "OpenstarTs (Univeristy of Trieste https://www.units.it/)", "publisher": "University of Trieste", "abstract": "Intermodal rail-truck transportation is a service in which rail and truk services are combined to complete a door to door movement. The purpose of this paper is to present a methodology for determine and planning the capacity of intermodal terminal and to identify the critical point of the service.", "keywords": [ "Terminal (telecommunication)", "Container (type theory)", "Computer science", "Engineering", "Computer network" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10077/8401" }, { "id": "https://openalex.org/W2982337193", "doi": "10.1088/1757-899x/639/1/012017", "title": "Resource Scheduling Problem in Distribution Center", "year": 2019, "publication_date": "2019-10-01", "type": "conference-paper", "language": "en", "authors": [ "Chaowalit Hamontree", "S. Prompakdee", "J. Koiwanit" ], "first_author": "Chaowalit Hamontree", "venue": "IOP Conference Series Materials Science and Engineering", "publisher": "IOP Publishing", "abstract": "Abstract Due to the rapid growth of the retail shop trend recently, the Distribution Center (DC) or warehouse had become to be a vital part in the supply chain in order to store goods from multiple suppliers and deliver to multiple retailers. Cross docking is a relatively the logistics technique used in the DC in order to move materials from inbound trailers to outbound trailers as quickly as possible. From the following problem, an ineffectual DC management leads to the resources utilization problem such as machine, forklift, industrial trucks, etc. The main objective of this research is to study and solve the scheduling problem of the usage of the forklift in the Cross docking of DC and to manage the inbound and outbound docks in order to minimize Tardiness jobs, and also to maximize the efficiency of machine utilization. This study has provided the scheduling, comparison from genetic algorithm and heuristic method. As the result came out we found that the forklift scheduling by the genetic algorithm method is given the better management result better than heuristic method.", "keywords": [ "Tardiness", "Computer science", "Distribution center", "Truck", "Scheduling (production processes)", "Job shop scheduling", "Genetic algorithm", "Operations research", "Mathematical optimization", "Engineering", "Business", "Automotive engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://iopscience.iop.org/article/10.1088/1757-899X/639/1/012017/pdf" }, { "id": "https://openalex.org/W4411019380", "doi": "10.46254/an15.20250087", "title": "Optimization of Collaborative Truck-Drone-Subway Delivery for Urban Logistics", "year": 2025, "publication_date": "2025-02-18", "type": "conference-paper", "language": "en", "authors": [ "So Rim Han", "Byung Duk Song" ], "first_author": "So Rim Han", "venue": null, "publisher": null, "abstract": "The truck-drone hybrid delivery system has been proposed as an alternative for urban logistics due to its advantages in fast delivery, cost-efficiency, and environmental benefits. However, UAVs face limitations in battery capacity and payload, which make it challenging to meet the increasing demand for logistics services. Additionally, there are constraints in building new logistics facilities in urban areas. Underground logistics has emerged as an alternative solution to address these problems. By utilizing the subway network, the system can avoid urban traffic congestion and manage logistics flows efficiently. Moreover, it minimizes the cost of establishing new facilities by making the most of existing infrastructure. In this study, we propose a new urban delivery system that combines the existing truck-drone hybrid model with the subway network. The established subway network and stations are used to transport goods from suburban areas to urban areas, where they also function as urban logistics hubs. A truck and drones handle the last-mile delivery to customers from the subway stations. Both the truck and multiple drones operate independently; the truck does not act as a mothership for the drones, and they perform deliveries across multiple logistics depots. We developed a mathematical optimization model for a multi-depot, multi-trip vehicle routing problem with time windows. The developed model was validated through numerical experiments, demonstrating its practical applicability to urban delivery services.The truck-drone hybrid delivery system has been proposed as an alternative for urban logistics due to its advantages in fast delivery, cost-efficiency, and environmental benefits. However, UAVs face limitations in battery capacity and payload, which make it challenging to meet the increasing demand for logistics services. Additionally, there are constraints in building new logistics facilities in urban areas. Underground logistics has emerged as an alternative solution to address these problems. By utilizing the subway network, the system can avoid urban traffic congestion and manage logistics flows efficiently. Moreover, it minimizes the cost of establishing new facilities by making the most of existing infrastructure. In this study, we propose a new urban delivery system that combines the existing truck-drone hybrid model with the subway network. The established subway network and stations are used to transport goods from suburban areas to urban areas, where they also function as urban logistics hubs. A truck and drones handle the last-mile delivery to customers from the subway stations. Both the truck and multiple drones operate independently; the truck does not act as a mothership for the drones, and they perform deliveries across multiple logistics depots. We developed a mathematical optimization model for a multi-depot, multi-trip vehicle routing problem with time windows. The developed model was validated through numerical experiments, demonstrating its practical applicability to urban delivery services.", "keywords": [ "Truck", "Drone", "Transport engineering", "City logistics", "Computer science", "Aeronautics", "Engineering", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ieomsociety.org/proceedings/singapore2025/87.pdf" }, { "id": "https://openalex.org/W2142093154", "doi": "10.5220/0004256702480254", "title": "Optimal Decision Making in Agent-based Autonomous Groupage Traffic", "year": 2013, "publication_date": "2013-01-01", "type": "conference-paper", "language": "en", "authors": [ "Stefan Edelkamp", "Max Gath" ], "first_author": "Stefan Edelkamp", "venue": null, "publisher": null, "abstract": "Abstract: The dynamics and complexity of planning and scheduling processes in groupage traffic require efficient, proac-tive, and reactive system behavior to improve the service quality while ensuring time and cost efficient trans-portation. We implemented a multiagent-system to emerge an adequate system behavior and focus on the decision making processes of agents that is based on the Traveling Salesman Problem (TSP) with aspects like contract time windows, individual restricted capacities of trucks, premium services and varying priorities of dynamically incoming orders. We present an optimal depth-first branch-and-bound asymmetric TSP solver with constraints on tour feasibility and depot reachability at any step of the process. To evaluate our approach, we use established benchmarks as well as its inclusion in a real-life multiagent-based simulation. Simulated scenarios are based on real customer orders of our industrial partner Hellmann Worldwide Logistics GmbH & Co. KG and are applied on real world infrastructures. The results reveal that efficient optimal decision making in multiagent systems increases the service quality and meets the requirements and challenges in logistics. 1", "keywords": [ "Computer science", "Scheduling (production processes)", "Solver", "Travelling salesman problem", "Reachability", "Multi-agent system", "Operations research", "Job shop scheduling", "Truck", "Quality of service", "Process (computing)", "Distributed computing" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5220/0004256702480254" }, { "id": "https://openalex.org/W3004562173", "doi": null, "title": "Using drones in the last-mile logistics processes of medical product delivery: A feasibility case study in Rotterdam", "year": 2020, "publication_date": "2020-01-12", "type": "conference-paper", "language": "en", "authors": [ "Irene Zubin", "Bart van Arem", "Bart Wiegmans", "Ron van Duin" ], "first_author": "Irene Zubin", "venue": "Research Repository (Delft University of Technology)", "publisher": "Delft University of Technology", "abstract": "The term last-mile delivery refers to the final leg of a business-to-customer service, in which products are shipped from a depot to a destination point bymeans of land transportation, such as vans and small trucks. Although these vehicles provide a common and easy way to consign products, companies are striving for new transport technologies to reduce congestion, infrastructure limitations and air pollution. An alternative to road-bounded vehicles that has recently gained attention is the adoption of drones in parcel delivery. Drone applications range from military training, surveillance, path recognition and shipment of perishable products in emergency situations. Research on drones as delivery vehicles is still in its early stages, with some practical trials carried out by leader companies such as Google and Amazon. However, the application of drones in the pharmaceutical sector for home deliveries of medical products, has not been investigated yet. To gain new insights into the feasibility of introducing drones in the delivery fleet, drone applications were studied for the delivery operations of the pharmacy BENU ’t Slag, in Rotterdam. Two scenario alternatives were tested using the Vehicle Routing Problem formulation. A Large-scale Neighborhood Search algorithm was implemented to solve the problem and derive the performance indicators associated with each scenario. Performances were then analyzed through a comparative analysis. When drones were introduced in the delivery fleet, indicators showed improvements in environmental aspects, service time and delivery costs, with a reduction of 9% in CO2 emissions, 12% in service time and 5.6% in cost per item.", "keywords": [ "Drone", "Service (business)", "Last mile (transportation)", "Truck", "Product (mathematics)", "Transport engineering", "Business", "Computer science", "Operations research", "Marketing", "Mile", "Engineering" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "http://resolver.tudelft.nl/uuid:9ccd09cd-608a-489e-b50d-5dbe3483a80e" }, { "id": "https://openalex.org/W2369921003", "doi": null, "title": "Truck Dock Assignment Problem for Crossdocks in Supply Networks", "year": 2011, "publication_date": "2011-01-01", "type": "article", "language": "en", "authors": [ "Weimin Wu" ], "first_author": "Weimin Wu", "venue": "Industrial Engineering and Engineering Management", "publisher": null, "abstract": "An effective supply chain can help companies achieve international competitiveness.Many companies have tried to optimize their distribution activities in their supply chains by adopting the cross-docking logistics strategy.This strategy can effectively integrate inventory management and distribution activities.Cross-docking is a logistics practice of unloading materials from incoming transportation vehicles(e.g.truck,trailer or rail car) and loading these materials directly into outgoing transportation vehicles without holding storage in between.Cross-docking can significantly reduce inventory levels,inventory costs and cargo loss rates,speed up cash flows,and increase response time to market demand.Consequently,an effective cross-docking strategy can improve customer satisfaction and have significant,lasting impacts on the operational efficiency of supply chains.This study investigates cross-docking problems limited with a set of constraints.An Integer Programming Model is setup to analyze cross-docking problems.A Hybrid Meta-heuristic Algorithm(HMA) is designed to help solve these problems.A few constraints are constructed in order to effectively use these models to solve cross-docking problems.Each truck has a service time window,only within which the truck can occupy a dock.The number of docks is limited.The distance between docks varies.The number of cargos and the time window for each truck are different.The shipping distance between docks needs to be kept at the minimum level.The goals of these models are to assign docks to trucks so that cargos can be processed as efficiently as possible.Constraints,such as capacity and time window,will cause some cargos not to be shipped out.Resultant delayed deliveries can increase total logistics costs.An effective assignment of trucks can have impact on cross-docking operational efficiency and cost.The objective of this study is to design a cross-docking assignment strategy so that the optimal efficiency of cross-docking operations can be achieved while meeting operation constraints.We first describe cross-docking assignment problems for trucks,constraints and assumptions.We then introduce an an Integer Programming Model,its notations and decision variables.Second,we introduce the idea of designing a HMA and apply a Genetic Algorithm(GA) to locate a near optimal solution.Neighborhood Search(NS) and Tabu Search(TS) are applied in order to solve problems and improve the quality of solutions to these problems.After doing so,we explain how HMA works,including single-point crossover operator,two-point crossover operator,exchange mutation operator,repair strategy,neighborhood search strategy,etc.Numerical examples are used to compare the performance of HMA,CPLEX,GA and TS with respect to the efficiency of HMA.We not only show the setting of all parameters,but also develop three categories of experiments including large,medium and small scale instances.The results show that all of these four methods have similar performance for small scale problems in conditions that the time consumed of HMA is as much as GA,a little bit longer than TS,but shorter than CPLEX.For medium scale problems,the solution quality of HMA outperforms the others,and the ranking of time consumed is as the same as that of small scale problems.For large scale problems,HMA is slower than TS and GA,but still much faster than CPLEX.Moreover,both HMA and TS have the highest solution quality.In general,HMA has the best performance in the solution quality,and the time consumed by it is as much as GA,longer than TS,but much shorter than CPLEX.In summary,this paper investigates cross-docking assignment problems with the constraints of limited time window and cross-docking capacity constraints.Our proposed model develops an efficient HMA to overcome the weakness of previous cross-docking models.The numerical experiments show that HMA has the best performance in the solution quality.The finding indicates that this HMA is an efficient way to solve cross-docking problems,especially for a large numbers of trucks and docks.", "keywords": [ "Truck", "Supply chain", "DOCK", "Integer programming", "Computer science", "Customer satisfaction", "Transport engineering", "Operations research", "Business", "Engineering", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://en.cnki.com.cn/Article_en/CJFDTOTAL-GLGU201101033.htm" }, { "id": "https://openalex.org/W1972455750", "doi": "10.1016/0038-0121(72)90008-0", "title": "Loading strategies for a freight transport system", "year": 1972, "publication_date": "1972-02-01", "type": "article", "language": "en", "authors": [ "Ross H. Johnson" ], "first_author": "Ross H. Johnson", "venue": "Socio-Economic Planning Sciences", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Decision maker", "Graph", "Operations research", "Dynamic programming", "Computer science", "Ideal point", "Graph theory", "Variable (mathematics)", "Point (geometry)", "Mathematical optimization", "Transport system" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/0038-0121(72)90008-0" }, { "id": "https://openalex.org/W1766124316", "doi": null, "title": "Análisis de estrategias eficientes en la logística de distribución de paquetería", "year": 2007, "publication_date": "2007-12-18", "type": "dissertation", "language": "es", "authors": [ "Estrada Romeu", "Miquel Àngel" ], "first_author": "Estrada Romeu", "venue": "TDX (Tesis Doctorals en Xarxa)", "publisher": null, "abstract": "La tesis doctoral propone una nueva metodologia de optimizacion del problema de diseno rutas de distribucion de muchos origenes a muchos destinos en paqueteria. La optimizacion minimiza los costes de transporte del sistema y combina algoritmos heuristicos con el metaheuristico Busqueda Tabu. Se han considerado tres estrategias para realizar el envio de un volumen de mercancia entre un origen y un destino [envio directo, paradas multiples (peddling) y envio a traves de una terminal de consolidacion o almacen de cross-docking (hub)] adaptandose como restricciones a la capacidad de los vehiculos, los plazos temporales para realizar en envio y el numero de muelles de cross-docking en cada terminal. El problema de optimizacion combinatoria se resuelve eficazmente mediante Busqueda Tabu, consiguiendo una reduccion del coste del sistema en relacion a otros procedimientos heuristicos del 7% en problemas a carga completa (Full Truck Load, FTL) y superior al 12% en problemas a carga fraccionada (Less than Truck Load, LTL). A nivel heuristico, el criterio de parada y el criterio de reinicializacion del procedimiento de busqueda han condicionado en gran medida la bondad de la solucion. Adicionalmente, se ha desarrollado una estrategia de aceptacion de envios de paradas multiples (peddling) basada en criterios probabilisticos que conlleva una reduccion media del 10% sobre el coste del sistema. Aplicaciones a baterias de problemas, algunos de ellos basados en datos reales, certifican la bondad del modelo desarrollado. El modelo determina en cada caso el tamano del vehiculo mas competitivo en costes en funcion de la carga media de los envios (en volumen) y de los costes de transporte y de las paradas. Unicamente en casos puntuales las flotas de tamano intermedio son competitivas en costes. La determinacion del numero optimo de hubs depende del tamano medio de envio. El numero de terminales hub para pocos puntos y envios medios grandes (>30m3) es entre 1 y 2 y este numero crece casi linealmente con el numero de puntos. Para envios mas pequenos ( Finalmente, la congestion en la red de transporte afecta de forma relevante los costes de distribucion del sistema. En la congestion de los muelles de cross-docking de las terminales, los costes son mas importantes en escenarios de envios a carga completa que en problemas LTL. En relacion a la congestion en los arcos de la red, se constatan variaciones de costes poco relevantes para reducciones de velocidad acotadas. Finalmente, se sugieren extensiones de la investigacion y del modelo desarrollado.", "keywords": [ "Humanities", "Mathematics", "Philosophy" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://upcommons.upc.edu/bitstream/2117/93936/1/01MER_Portada_Resum_Index.pdf" }, { "id": "https://openalex.org/W4226468964", "doi": "10.32604/cmc.2022.027967", "title": "A Truck Scheduling Problem for Multi-Crossdocking System with Metaheuristics", "year": 2022, "publication_date": "2022-01-01", "type": "article", "language": "en", "authors": [ "Phan Nguyen Ky Phuc", "Nguyễn Văn Thành", "Duong Bao Tram" ], "first_author": "Phan Nguyen Ky Phuc", "venue": "Computers, materials & continua/Computers, materials & continua (Print)", "publisher": null, "abstract": "The cross-docking is a very important subject in logistics and supply chain managements. According to the definition, cross-docking is a process dealing with transhipping inventory, in which goods and products are unloaded from an inbound truck and process through a flow-center to be directly loaded onto an outbound truck. Cross-docking is favored due to its advantages in reducing the material handing cost, the needs to store the product in warehouse, as well decreasing the labor cost by eliminating packaging, storing, pick-location and order picking. In cross-docking, products can be consolidated and transported as a full load, reducing overall distribution costs. In this paper, we focus on a truck scheduling at the multi-door, multi-crossdocking network with inventory constraints and process capability constraints. In this model, a truck can visit severals docks for loading or unloading many types products. This situation is very common in reality. This study also developed an exact mathematical model using mixed-integer linear programming (MILP) with the objective of minimizing the makespan to obtaint the benchmark in small scale problems. Large scale problems are solved through Simulated Annealing (SA) algorithm and Tabu Search (TS) algorithm. Performance of these algorithms will be compared to benchmarks obtained from solver as well as to each other.", "keywords": [ "Truck", "Tabu search", "Computer science", "Job shop scheduling", "Metaheuristic", "Simulated annealing", "Solver", "Scheduling (production processes)", "Integer programming", "Supply chain", "Mathematical optimization", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://file.techscience.com/ueditor/files/cmc/TSP_CMC-72-3/TSP_CMC_27967/TSP_CMC_27967.pdf" }, { "id": "https://openalex.org/W644080827", "doi": null, "title": "A Robust Heuristic for Scheduling the Loading and Unloading of Trucks", "year": 2011, "publication_date": "2011-01-01", "type": "article", "language": "en", "authors": [ "Kanthimathi Sathasivan", "ManWo Ng", "Steven Travis Waller" ], "first_author": "Kanthimathi Sathasivan", "venue": "Transportation Research Board 90th Annual MeetingTransportation Research Board", "publisher": null, "abstract": "In this paper, the authors present a robust scheduling optimization model for the loading or unloading of trucks at cross-docks. The problem considers different scenarios at a given time. A formulation of the scenario-based robust optimization problem is given and a robust surrogate heuristic algorithm is developed to solve the problem. The authors include numerical examples and the computational results of the experiments conducted. The computational results from the algorithm are tested against the actual solution of the optimization problem using the robust measures discussed in the paper. The bounds and worst case scenarios are discussed as well. The authors find that the surrogate heuristic is easy to use and it provides solutions closer to the optimal solution.", "keywords": [ "Mathematical optimization", "Truck", "Heuristic", "Computer science", "Scheduling (production processes)", "Robust optimization", "Optimization problem", "Job shop scheduling", "Robustness (evolution)", "Mathematics", "Engineering", "Schedule" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1092521" }, { "id": "https://openalex.org/W4405355597", "doi": null, "title": "Estimating Electrification Potential for Class 8 Regional-Haul Trucks", "year": 2024, "publication_date": "2024-11-25", "type": "article", "language": "en", "authors": [ "Andrew J. Kotz" ], "first_author": "Andrew J. Kotz", "venue": "OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)", "publisher": "Office of Scientific and Technical Information", "abstract": "This one-page highlight details the key takeaways from a project that utilized NREL's Fleet Research, Energy Data, and Insights (FleetREDI) data analysis pipeline. As part of the North American Council for Freight Efficiency's (NACFE's) Run on Less Depot data workshop, NREL sought to understand how Tesla semi-trucks would perform in real-world regional haul applications. Analysis reveals that the modeled Tesla trucks, with an average efficiency of 1.78 kWh/mi, struggle to achieve full operational coverage using current battery and charging configurations assuming operations remain unchanged. However, in an extreme case where ubiquitous charging exists, 100% EV coverage is possible for the given drive cycles. These findings highlight the trade-off between battery size and charge rate in electrification potential and emphasize the necessity for advancements in charging infrastructure to enable electric trucks for regional haul operations.", "keywords": [ "Truck", "Electrification", "Class (philosophy)", "Transport engineering", "Environmental science", "Computer science", "Engineering", "Automotive engineering", "Electrical engineering", "Electricity", "Artificial intelligence" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.osti.gov/servlets/purl/2478235" }, { "id": "https://openalex.org/W4410322225", "doi": "10.1145/3722150.3722168", "title": "Capacity Freight Volume Prediction for Metro Depot and Transport", "year": 2025, "publication_date": "2025-01-16", "type": "conference-paper", "language": "en", "authors": [ "Hansi Denis", "Ngoc-Quang Luong", "Andreas Gavrielides", "Siegfried Mercelis" ], "first_author": "Hansi Denis", "venue": null, "publisher": null, "abstract": "We investigate a temporal prediction model to forecast freight volumes and labor hours for off-hours transportation of goods for city metro logistics operations. The study is performed on a metro network in the city of Madrid with continued support and feedback from trusted industry partners, namely DHL. The aim of this work is to showcase the relevance of replacing the truck last-mile transport of parcel by nighttime carrying through the metro network. A detailed structure of the prospective delivery system modeled on the basis of the current metro network is provided and leveraged to depict an accurate picture of the downstream movement of parcels. The predictions are performed at various levels of granularity, thereby aiding in the optimization of resource planning for depots and trains. The results demonstrate that our models exhibit significantly improved performance when trained on an augmented dataset spanning four years, indicating that sufficient seasonality patterns have been effectively captured.", "keywords": [ "Depot", "Transport engineering", "Volume (thermodynamics)", "Computer science", "Automotive engineering", "Engineering", "Physics", "Geography" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://dl.acm.org/doi/pdf/10.1145/3722150.3722168" }, { "id": "https://openalex.org/W4405198142", "doi": "10.51219/urforum.2024.vladimir-linkov", "title": "Green Hydrogen Transport Value Chain: Movable Sustainable Solution for Large Construction Sites, applicable for Taxi Ranks, Bus Terminals and Truck Depots, including Campuses and Airport Ground Transportation", "year": 2024, "publication_date": "2024-12-06", "type": "conference-abstract", "language": "en", "authors": [ "Vladimir Linkov" ], "first_author": "Vladimir Linkov", "venue": null, "publisher": null, "abstract": "Introduction: The Green Hydrogen Transport Value Chain (GHTVC) is a fully integrated, easy-to-move highly compact infrastructure system representing practical outcomes of HySA Systems/SAIAMC RDI activities in Hydrogen Economy.It generates and conditions renewable energy, produces, compresses, dispenses green H2 and supplies it to a small fleet of fuel cell operated vehicles, all on the basis of a locally built mobile platform that can be deployed within days or weeks anywhere in South Africa or wider African Continent.This project will leverage HySA Systems/SAIAMC manufactured prototypes, expertise, know-how and intellectual property accumulated through the past 20 years of dedicated efforts in the hydrogen, fuel cell and renewable energy domain, providing the much needed trust for industry early adopters in South Africa and beyond.GHTVC represents a robust South African response to the urgent need to accelerate renewable energy adoption locally, and not the least to forthcoming economic challenges associated with European Union's Carbon Border Adjustment Mechanism (CBAM).The components within the system are schematically presented in Figure 1 and briefly described below.", "keywords": [ "Renewable energy", "Truck", "Leverage (statistics)", "Hydrogen vehicle", "Sustainable transport", "Transport engineering", "Environmental economics", "Efficient energy use", "European union", "Business", "Computer science", "Hydrogen fuel" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.51219/urforum.2024.vladimir-linkov" }, { "id": "https://openalex.org/W4393146015", "doi": "10.1109/itec-india59098.2023.10471444", "title": "Optimal Transition of Fleets to Electric Vehicle using Mathematical Optimization", "year": 2023, "publication_date": "2023-12-12", "type": "conference-paper", "language": "en", "authors": [ "Abhay Kumar", "Deepak Nagar", "Vinay Ramanath", "Smaran B.G Subbaiah" ], "first_author": "Abhay Kumar", "venue": null, "publisher": null, "abstract": "Due to sustainability push around the world, lot of depot operators are transitioning their vehicle fleet to electric vehicles. A depot often comprises of hundreds of diesel-powered vehicles, such as buses, trucks, last-mile delivery vans, etc. Before depot owners begin the move to sustainable transportation, there are many questions that need to be addressed. What kind of vehicle and charging infrastructure are needed. How to reduce the capital investment and daily operational cost. This paper proposes a methodology for optimal transition of fleet to electric vehicles. Dispatching and charging are the two sub-problems that make up the main issue. The method of mixed integer linear programming has been used to create two distinct algorithms. In order to maximize the use of electric vehicles, dispatch optimizes the vehicle to route mapping, which also optimizes the vehicle infrastructure. Its charge schedules are developed based on the vehicle route mapping and provided as input to the charging algorithm. Where power requirement is optimized for minimum depot peak power and charging cost, thus minimizing the charging infrastructure and daily operational cost.", "keywords": [ "Transition (genetics)", "Computer science", "Electric vehicle", "Physics", "Chemistry", "Thermodynamics" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/itec-india59098.2023.10471444" }, { "id": "https://openalex.org/W3080793510", "doi": null, "title": "Models and Algorithms for Inbound and Outbound Truck to Door Scheduling", "year": 2019, "publication_date": "2019-06-01", "type": "dissertation", "language": "en", "authors": [ "Sayed Ibrahim Sayed" ], "first_author": "Sayed Ibrahim Sayed", "venue": "Spectrum Research Repository (Concordia University)", "publisher": "Concordia University", "abstract": "Cross-docking is a logistic strategy that facilitates rapid movement of consolidated products between suppliers and retailers within a supply chain. It is also a warehousing strategy that aims at reducing or eliminating storage and order picking, two of which are known to be major costly operations of any typical warehouse. This strategy has been used in the retailing, manufacturing, and automotive industries. In a cross-dock, goods are unloaded from incoming trucks, consolidated according to their destinations, and then, loaded into outgoing trucks with little or no storage in between. \\nIn this thesis, we address an integrated cross-dock door assignment and truck scheduling problem in which the assignment and sequencing of incoming trucks to strip doors and outgoing trucks to stack doors is optimized to minimize the total time to process all trucks. We present a mixed integer programming formulation to model this problem and some valid inequalities to strengthen the formulation. We also present two metaheuristics to obtain high quality solutions in reasonable CPU times. These algorithms use a mix of composite dispatching rules, constructive heuristics, local search heuristics which are embedded into a greedy randomized adaptive search procedure (GRASP) and an iterated local search (ILS). Results of computational experiments are presented to assess the performance of the proposed algorithms, in comparison with a general purpose solver.", "keywords": [ "Truck", "Doors", "Metaheuristic", "Iterated local search", "Heuristics", "Automotive industry", "Greedy randomized adaptive search procedure", "Solver", "Integer programming", "Computer science", "Vehicle routing problem", "GRASP" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://spectrum.library.concordia.ca/985524/1/Sayed_MASc_F2019.pdf" }, { "id": "https://openalex.org/W26296436", "doi": "10.1007/978-3-642-24660-9_29", "title": "Applying Military Telematic Solutions for Logistics Purposes", "year": 2011, "publication_date": "2011-01-01", "type": "conference-paper", "language": "en", "authors": [ "Andrzej Bujak", "Mirosław Smolarek", "Alicja Gębczyńska" ], "first_author": "Andrzej Bujak", "venue": "Communications in computer and information science", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Telematics", "Truck", "Computer science", "Computer security", "Train", "SWOT analysis", "Robot", "Transport engineering", "Telecommunications", "Engineering", "Business", "Artificial intelligence" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-642-24660-9_29" }, { "id": "https://openalex.org/W2080636104", "doi": "10.1016/0360-8352(94)90283-6", "title": "Heuristic approach to allocation of trucks in a transportation system", "year": 1994, "publication_date": "1994-09-01", "type": "article", "language": "en", "authors": [ "Takeo Takeno", "Kenichiro Matsui", "Genji Yamazaki", "Toshihiro Ishikawa" ], "first_author": "Takeo Takeno", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Schedule", "Heuristic", "Operations research", "Computer science", "Work (physics)", "Measure (data warehouse)", "Transport engineering", "Transportation theory", "Engineering", "Mathematical optimization", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/0360-8352(94)90283-6" }, { "id": "https://openalex.org/W2081199361", "doi": "10.3182/20130619-3-ru-3018.00640", "title": "Planning and Scheduling in Intermodal Transport", "year": 2013, "publication_date": "2013-01-01", "type": "conference-paper", "language": "en", "authors": [ "Jenny Nossack", "Erwin Pesch" ], "first_author": "Jenny Nossack", "venue": "IFAC Proceedings Volumes", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Scheduling (production processes)", "Container (type theory)", "Operations research", "Homogeneous", "Pickup", "Heuristic", "Transport engineering", "Computer science", "Transportation theory", "Job shop scheduling", "Engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3182/20130619-3-ru-3018.00640" }, { "id": "https://openalex.org/W3096875825", "doi": "10.1088/1757-899x/943/1/012039", "title": "Multi-Compartment Vehicle Routing Problem to Find the Alternative Distribution Route of Petroleum Product Delivery", "year": 2020, "publication_date": "2020-10-01", "type": "conference-paper", "language": "en", "authors": [ "I F Febriandini", "Yuniaristanto Yuniaristanto", "Wahyudi Sutopo" ], "first_author": "I F Febriandini", "venue": "IOP Conference Series Materials Science and Engineering", "publisher": "IOP Publishing", "abstract": "Abstract Distribution is an activity that the firm has to do to deliver their product to the customers. The product has to deliver to the customers on the right condition, at the right time, and with the minimal cost of delivery. This paper focuses to solve the planning distribution problem on petrol product delivery or Petrol Station Replenishment Problem. One of the ways to solve the planning distribution is VRP (Vehicle Routing Problem). VRP aims to find the minimal total cost delivery with some constraints depend on the factory. In this research, VRP is used by the distribution center to find the optimal route of distribution of petrol products. Using Multi-Compartment Vehicle Routing Problem (MC-VRP) that considers the demand for the petrol product, tank-truck capacity, distribution cost, and the number of the compartment. In this work, a mathematical formulation for MC-VRP is developed in the Mixed Integer Linear Programming (MILP) model. Using Ilog Cplex with branch and bound algorithm to solve this distribution problem with the minimum total distribution cost. There are 10 customers with different distances, different time deliveries and different travel costs in this research. The mathematic formulation produces the best alternative that is Rp 1.898.584 to deliver products from depot to the customers.", "keywords": [ "Vehicle routing problem", "Product (mathematics)", "Truck", "Routing (electronic design automation)", "Distribution (mathematics)", "Computer science", "Total cost", "Integer programming", "Mathematical optimization", "Operations research", "Product distribution", "Linear programming" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://iopscience.iop.org/article/10.1088/1757-899X/943/1/012039/pdf" }, { "id": "https://openalex.org/W623642499", "doi": null, "title": "EFFECT OF PIGGYBACK OPERATION ON VOLUME OF HIGHWAY TRUCK TRAFFIC", "year": 1967, "publication_date": "1967-01-01", "type": "article", "language": "en", "authors": [ "Allan C Flott" ], "first_author": "Allan C Flott", "venue": "Highway Research Record", "publisher": "National Research Council", "abstract": "DETERMINATION IS ATTEMPTED OF WHAT EFFECT, IF ANY, THE GROWTH OF TRAILER-ON-FLAT-CAR /TOFC/ OR PIGGYBACK SERVICE WILL HAVE ON THE VOLUME OF TRUCK TRAFFIC ON OUR HIGHWAYS. IT WAS DETERMINED THAT PIGGYBACK SERVICE WILL AFFECT THE VOLUME OF INTERCITY TRUCK TRAFFIC ON OUR HIGHWAYS. ITS PRINCIPAL EFFECT WILL BE TO INHIBIT THE GROWTH OF TRAFFIC BETWEEN MAJOR POPULATION CENTERS, PARTICULARLY WHERE SUCH CENTERS ARE FAIRLY FAR APART. THE DAMPENING EFFECT ON TRAFFIC, HOWEVER, WILL NOT BE GREAT ENOUGH TO REDUCE HIGHWAYS NEEDS IN ANY AREA FOR THE FORESEEABLE FUTURE. IF A SUBSTANTIAL AMOUNT OF RAIL BOX AND REFRIGERATOR CAR TRAFFIC IS TO BE DIVERTED TO HIGHWAYS IN THE FUTURE, THIS COULD HAVE SERIOUS IMPLICATIONS FOR THE HIGHWAYS. SINCE THE PRINCIPAL REASON FOR THE SHIFT WOULD BE TO PERMIT FASTER DOOR-TO-DOOR SERVICE BETWEEN METROPOLITAN AREAS THERE WOULD BE A SIGNIFICANT INCREASE IN THE AMOUNT OF TRACTOR-SEMITRAILER MOVEMENTS IN THESE AREAS. THIS IS WHERE THE GREATEST TRAFFIC PROBLEMS EXIST.", "keywords": [ "Transport engineering", "Truck", "Traffic volume", "Metropolitan area", "Trailer", "Service (business)", "Principal (computer security)", "Level of service", "Engineering", "Business", "Automotive engineering", "Geography" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/92705" }, { "id": "https://openalex.org/W619212948", "doi": null, "title": "SELF-HELP IS THE KEY TO TACKLING TRUCK THIEVES", "year": 2002, "publication_date": "2002-11-01", "type": "article", "language": "en", "authors": [ "G Grace" ], "first_author": "G Grace", "venue": null, "publisher": null, "abstract": "Approximately 3,500 thefts are logged by the National Stolen Lorry Load Desk each year in the UK. RemGuard Visual Management specialises in guarding vehicle yards and depots outside normal business hours using intrusion detectors and video cameras. The Motor Insurance Repair Research Centre is to test and rate all new HGVs against security criteria. Ford has designed a 'lock-in-latch' door lock for Transit vans, a keyless remote entry solution, and a passive anti theft system that includes the engine's electronic control and fuel system in the disabling circuit. Other developments include the VanLoxx system for parcel delivery vans from Deister Electronic UK, the Protekdor system to prevent entry through a cab door or window, LiniLock from CMT Tube Fittings for disabling a trailer's brakes, the Orchid vehicle management system from Thales Telematics, and NavTrak tracking systems.", "keywords": [ "Telematics", "Truck", "Trailer", "Desk", "Lock (firearm)", "Key (lock)", "Computer security", "Engineering", "Transport engineering", "Automotive engineering", "Computer science", "Telecommunications" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/644710" }, { "id": "https://openalex.org/W7165631533", "doi": "10.3390/drones10070476", "title": "Data-Driven Optimization of Truck–Drone Collaborative Delivery with Shared Fleet Allocation", "year": 2026, "publication_date": "2026-06-23", "type": "article", "language": "en", "authors": [ "Didem Cicek", "Murat Şimşek", "Burak Kantarcı" ], "first_author": "Didem Cicek", "venue": "Drones", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Truck–drone collaborative delivery (TDCD) refers to a coordinated logistics paradigm in which drones are deployed from delivery trucks to serve nearby customers, enabling parallelized last-mile operations. Much of the existing TDCD literature relies on synthetic datasets and manufacturer-declared drone specifications, which may overestimate performance in real-world operations. This study develops an empirically informed, route-based Mixed-Integer Linear Programming (MILP) framework that integrates empirically derived drone performance models with constrained fleet allocation decisions. Using delivery routes from the Amazon Last Mile Routing Dataset (2021), we consider three electric trucks departing from a common depot, each equipped with drones drawn from a shared fleet of 10 units. Drone flight time and energy consumption are modeled using regression functions calibrated with real flight test data from a DJI Matrice 100 platform, capturing observed variations due to payload and operational conditions. The optimization jointly determines truck stop selection, customer assignments, and drone allocation while minimizing a weighted combination of route makespan, total energy consumption, and fleet size under operational and energy constraints. The results indicate that coordinated truck–drone delivery can achieve substantial reductions in both delivery completion time and energy consumption relative to conventional truck-only delivery. These findings demonstrate the effectiveness of coordinated truck–drone operations under realistic constraints and highlight the importance of data-driven modeling and fleet-level resource allocation in improving last-mile delivery performance.", "keywords": [ "Drone", "Truck", "Payload (computing)", "Resource allocation", "Energy consumption", "Routing (electronic design automation)", "Linear programming", "Last mile (transportation)", "Fuel efficiency" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3390/drones10070476" }, { "id": "https://openalex.org/W4285310683", "doi": "10.2139/ssrn.4125865", "title": "Coordinated Trucks and Drones for Early Fire Detection", "year": 2022, "publication_date": "2022-01-01", "type": "preprint", "language": "en", "authors": [ "Maryam Momeni", "Hamed Soleimani", "Shahrooz Shahparvari", "Behrouz Afshar-Nadjafi" ], "first_author": "Maryam Momeni", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Drone", "Truck", "Aeronautics", "Computer security", "Forensic engineering", "Engineering", "Computer science", "Automotive engineering", "Biology" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.4125865" }, { "id": "https://openalex.org/W4394714276", "doi": "10.21203/rs.3.rs-4217850/v1", "title": "Multi-depot vehicle routing problem with drones in emergency logistics", "year": 2024, "publication_date": "2024-04-11", "type": "preprint", "language": "en", "authors": [ "Xun Weng", "Wenke She", "Hong-Qiang Fan", "Jingtian Zhang", "Lifen Yun" ], "first_author": "Xun Weng", "venue": "Research Square", "publisher": null, "abstract": "Abstract In order to expand the application of truck-drone cooperative delivery in emergency logistics, this paper investigates the multi-depot vehicle routing problem with drones for emergency logistics scheduling. A mixed-integer programming model with the objective of minimizing the maximum expected rescue time from urban distribution centres to temporary distribution stations is proposed. To address this problem, a new two-stage hybrid heuristic algorithm is proposed. In the first stage, we employ an improved K-means clustering to cluster the temporary distribution stations. In the second stage, a combination of Tabu search (TS), enhanced genetic algorithm (GA), and simulated annealing (SA) is applied to optimize the routes of both trucks and drones. The numerical study involves the validation of the model using real-world cases. Through comparison experiments with the Gurobi solver, we demonstrate the significant advantages of the proposed heuristic algorithm in terms of solution quality and efficiency.", "keywords": [ "Vehicle routing problem", "Drone", "Depot", "Routing (electronic design automation)", "Business", "Transport engineering", "Computer science", "Operations research", "Engineering", "Computer network", "Political science" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.researchsquare.com/article/rs-4217850/latest.pdf" }, { "id": "https://openalex.org/W4411234722", "doi": "10.3390/agriengineering7060188", "title": "Implementation of Modular Depot Concept for Switchgrass Pellet Production in the Piedmont", "year": 2025, "publication_date": "2025-06-12", "type": "article", "language": "en", "authors": [ "Jonathan P. Resop", "John S. Cundiff", "Shahabaddine Sokhansanj" ], "first_author": "Jonathan P. Resop", "venue": "AgriEngineering", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "In the bioenergy industry, highway hauling cost is typically 30%, or more, of the average cost of feedstock delivered to a biorefinery. Thus, truck productivity, in terms of Mg/d/truck, is a key issue in the design of a logistics system. One possible solution to this problem that is being explored is the utilization of modular pellet depots. In such a logistics system, raw biomass (i.e., low-bulk-density product) is converted into pellets (i.e., high-bulk-density product) by several smaller-scale modular pellet depots instead of by a single larger-capacity pellet depot. A truckload of raw biomass (e.g., round bales) is 16 Mg and a load of pellets is 34 Mg. The distribution of depots across a feedstock production area can potentially have an impact on the total truck operating hours (i.e., raw biomass hauling to a depot + pellet hauling from the depot to the biorefinery) required to deliver feedstock for annual operation of a biorefinery. This study examined three different distributions of depots across five feedstock production areas. The numbers of depots were one, two, and four per production area for totals of five, ten, and twenty depots. Increasing the number of depots from five to ten reduced raw biomass hauling hours by 12%, and increasing from five to twenty reduced these hours by 30%. Total hauling hours (raw biomass + pellets) were reduced by less than 1% with an increase from five to ten and by about 11% with an increase from five to twenty. The modular pellet depot concept demonstrated potential for providing improvements to biorefinery logistics systems, but more research is needed to optimize this balance.", "keywords": [ "Depot", "Pellet", "Modular design", "Production (economics)", "Business", "Environmental science", "Computer science", "Economics", "Geography", "Materials science", "Operating system", "Microeconomics" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2624-7402/7/6/188/pdf?version=1749728873" }, { "id": "https://openalex.org/W4283375253", "doi": "10.7737/jkorms.2022.47.2.001", "title": "Group Search Optimization for Truck-Drone Scheduling", "year": 2022, "publication_date": "2022-05-31", "type": "article", "language": "en", "authors": [ "Sung-Soo Kim", "Min-Seop Shin" ], "first_author": "Sung-Soo Kim", "venue": "한국경영과학회지", "publisher": null, "abstract": "In parallel drone scheduling traveler salesman problem, the customer can be served by a single truck or by a fleet of one or more identical drones to minimize the completion time. The vehicle routes customer locations, while the drone fly back and forth between depot and customers. The objective of this paper is to propose novel Routing Group Search Optimization (RGSO) for truck-drone scheduling to find the best schedule and routing of a truck and a droneto better balance vehicle and drone delivery. The RGSO based on Group Search Optimization (GSO) is proposed for truck-drone system with scheduling solution representation. Our proposed RGSO is very effective in finding group which are generated by relative distances of customer locations for routing of truck. Our simulation results show that RGSO is very effective comparing to standard GSO based on the several experiments and analysis.", "keywords": [ "Drone", "Truck", "Vehicle routing problem", "Scheduling (production processes)", "Computer science", "Travelling salesman problem", "Schedule", "Job shop scheduling", "Operations research", "Routing (electronic design automation)", "Engineering", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.7737/jkorms.2022.47.2.001" }, { "id": "https://openalex.org/W2337166013", "doi": "10.7470/jkst.2014.32.3.227", "title": "A Study on Railroad Yard Reform for Vitalizing Freight Movement by Railroad: Focused on the Introduction of Piggy Back System", "year": 2014, "publication_date": "2014-06-30", "type": "article", "language": "en", "authors": [ "Il Ha Park", "Yong Gul Park", "Sigon Kim", "Yeon Kyu Kim" ], "first_author": "Il Ha Park", "venue": "대한교통학회지", "publisher": null, "abstract": "철도투자의 필요성은 누구나 공감하고 정부에서도 지속 투자를 시행하고 있으나 철도의 화물수송 분담률은 오히려 감소하고 있는 실정이다. 이는 다빈도, 신속, 신뢰성을 요구하는 즉시인도(Just In Time: JIT)와 문전수송 (Door to Door) 등 고도화되는 고객의 욕구를 충족시키지 못하였기 때문이다. 결과적으로 지난 114년 동안 구축된 철도인프라 시설이 점점 효용가치를 잃어 가고 있다. 이에 본 연구에서는 철도수송의 근본적인 문제점인 문전수송(Door to Door)을 해결하지 않고는 도로수송을 철도수송으로 전환하는 것은 어렵다고 보고 도로에서 철도로의 전환(Modal Shift)이 가능하도록 철도수송 시 철도화물역에서 최종목적지로 환적없이 화물자동차를 직접 운반하는 피기백(Piggy Back)시스템이라는 신개념을 정립함으로써 문전수송(Door to Door)에 의한 철도화물 수송의 경쟁력 확보 및 활성화 방안을 제시하고자 한다. 피기백(Piggy Back)시스템 적용방안으로는 짧은 기간 내에 적은 투자비로 즉각 시행이 가능하도록 지난 114년 동안 구축된 기존 철도인프라를 활용하는 정거장 배선계획을 제시하고, 이에 따른 세부 열차운행방안 및 피기백시스템 도입시 건축한계 등 기술적인 검토를 시행함으로써 연간 국가 물류비를 약7조원이상 절감할 수 있는 획기적인 방안을 우리나라 최초로 제시하였다. There is no question that railroad investment is crucial for better transport systems and the Korean government has continued to invest in railroad facilities. Nevertheless, the modal share of railroad, in particular, for freight has decreased. This is because rail freight transport can hardly meet customer needs such as just-in-time(JIT), a door-to-door service, compared to road transport, to be specific, trucking which can directly carry the freights to the final destinations. This has made the value of the railroad infrastructure less, which has been operated for the past 114 years. This study proposes a new freight movement concept called Piggy Back System. This system can carry freight trucks on the trains and deliver the freights to the final destinations. It can make a door-to-door deliver system possible for railroad transportation, which is the key factor for modal shift from road to railroad. For implementing this, this study proposes three important things: the cost-efficient reforming way of railroad yard that has been used for the past 114 years, the diagram plan of train services, and some technical reviews like clearance limits. This is the first study with practical proposals and solutions on this topic in Korea. The suggestions of this study cut down distribution costs by more than seven trillion won.", "keywords": [ "Train", "Truck", "Transport engineering", "Rail freight transport", "Yard", "Destinations", "Modal shift", "Freight trains", "Plan (archaeology)", "Investment (military)", "Service (business)", "Modal" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "http://koreascience.or.kr:80/article/JAKO201421260096963.pdf" }, { "id": "https://openalex.org/W4417338253", "doi": "10.1109/upec65436.2025.11279875", "title": "Optimising Fleet Charging Loads at Depots for Battery Electric Heavy Goods Vehicles", "year": 2025, "publication_date": "2025-09-02", "type": "conference-paper", "language": null, "authors": [ "Chandima Dedduwa Pathiranage", "Liana Cipcigan", "Fahd Alharbi", "Abderrahmane Manu Haddad", "Abdar Ali" ], "first_author": "Chandima Dedduwa Pathiranage", "venue": null, "publisher": null, "abstract": "The electrification of heavy goods vehicle (HGV) fleets presents a significant opportunity for decarbonising freight transport, yet it introduces new challenges for depot-level charging infrastructure and power systems. This paper investigates optimal charging strategies for Battery Electric Heavy Goods Vehicles (BEHGVs) at depots to minimize peak grid loads, transformer overloading, and line congestion, while ensuring vehicles meet operational schedules. Using real-world technical specifications of Scania electric trucks categorized by Gross Train Weight (GTW) and battery capacity, three operational range scenarios (baseline, extended, and long-haul) were modeled for fleet sizes of 25, 50, and 100 vehicles. A simulation framework was developed to optimize the number and rating of chargers, resulting in optimal vehicle-to-charger ratios and depot load profiles. Results demonstrate that managed charging strategies significantly reduce peak load demand compared to unmanaged charging, with a notable improvement in infrastructure utilization (achieving optimal 2.5:1 vehicle-to-charger ratio). The study concludes that strategic scheduling and charger sizing can balance grid constraints, infrastructure costs, and fleet availability, ensuring sustainable large-scale deployment of BEHGVs.", "keywords": [ "Electrification", "Truck", "Sizing", "Software deployment", "Grid", "Scheduling (production processes)", "Battery (electricity)", "Electric vehicle", "Total cost of ownership" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/upec65436.2025.11279875" }, { "id": "https://openalex.org/W7213584876", "doi": "10.1016/j.trd.2026.105631", "title": "Route-informed planning for medium- and heavy-duty truck charging infrastructure in California", "year": 2026, "publication_date": "2026-09-18", "type": "article", "language": "en", "authors": [ "Runhua Ivan Xiao", "Miguel Jaller", "Anmol Pahwa", "Cláudio Barbieri da Cunha" ], "first_author": "Runhua Ivan Xiao", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": "California freight electrification depends as much on charging access and corridor planning as on vehicle adoption. Public agencies and fleets need evidence on whether depot and public charging networks can support truckload operations without increasing empty repositioning, modeled charging-stop requirements, and route infeasibility. This study develops an operations-based freight charging assessment for mixed diesel and battery-electric truck operations and applies it to controlled California truckload scenarios. Rather than optimizing final station sites, the framework evaluates predefined depot-adjacent and public fast-charging sites through route feasibility, total and deadhead VMT, modeled charging stop rows, active charging locations, and cost-accounting indicators. The results are scenario-level route-record comparisons and do not reflect observed daily truck operations or session-level charging dwell measurements.", "keywords": [ "Truck", "Vehicle miles of travel", "Transportation planning" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2026.105631" } ]