[ { "id": "https://openalex.org/W2997877482", "doi": null, "title": "A Research on Dock Assignment and Truck Sequence in a Cross-docking System Considering the Unloading/Loading Sequences of Cargos", "year": 2016, "publication_date": "2016-04-30", "type": "article", "language": "en", "authors": [ "LI Jing-feng", "Yan Ye", "Hui Fu" ], "first_author": "LI Jing-feng", "venue": null, "publisher": null, "abstract": null, "keywords": [ "DOCK", "Docking (animal)", "Truck", "Sequence (biology)", "Computer science", "Engineering", "Automotive engineering", "Chemistry", "Marine engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://manu49.magtech.com.cn/jwk_gygc/EN/Y2016/V19/I2/112" }, { "id": "https://openalex.org/W2807732854", "doi": "10.1134/s0005117918060127", "title": "Application of Multiagent Technologies to Multiple Depot Vehicle Routing Problem with Time Windows", "year": 2018, "publication_date": "2018-06-01", "type": "article", "language": "en", "authors": [ "В. В. Сазонов", "Petr Olegovich Skobelev", "Alexander Lada", "Igor Mayorov" ], "first_author": "В. В. Сазонов", "venue": "Automation and Remote Control", "publisher": "Pleiades Publishing", "abstract": "In this paper, a multiagent approach to the Multiple Depot Vehicle Routing Problem with Time Windows (MDVRPTW) is presented. A multiagent system of interacting trucks, depots and orders is considered. For limiting the intensity of negotiations, a Delaunay triangulation-based scene structure is proposed. As demonstrated below, the solutions obtained by the new algorithm vary by 10–30% from the well-known best counterparts; however, the speed of calculations is considerably higher, and hence the new algorithm can be applied in real-time systems.", "keywords": [ "Delaunay triangulation", "Depot", "Vehicle routing problem", "Computer science", "Limiting", "Truck", "Routing (electronic design automation)", "Multi-agent system", "Mathematical optimization", "Distributed computing", "Computer network", "Algorithm" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1134/s0005117918060127" }, { "id": "https://openalex.org/W3108369926", "doi": "10.1155/2020/8813372", "title": "Mathematical Optimization Model for Truck Scheduling in a Distribution Center with a Mixed Service-Mode Dock Area", "year": 2020, "publication_date": "2020-11-27", "type": "article", "language": "en", "authors": [ "Gustavo Correa Issi", "Rodrigo Linfati", "John Willmer Escobar" ], "first_author": "Gustavo Correa Issi", "venue": "Journal of Advanced Transportation", "publisher": "Hindawi Publishing Corporation", "abstract": "Cross-docking is a logistics strategy in which products arriving at a distribution center are unloaded from inbound trucks and sorted for transfer directly to outbound trucks, reducing costs and storage and product handling times. This paper addresses a cross-docking problem by designing a mixed-integer linear programming (MILP) model to determine a schedule for inbound and outbound trucks in a mixed service-mode dock area that minimizes the time from when the first inbound truck arrives until the last outbound truck departs (makespan). The model is developed using AMPL software with the CPLEX and Gurobi solvers, which provide results for different instances, most of these with actual shift data from an integrated distribution center of a multinational food company located in Concepción, Chile. The results obtained from the case study are notable and show the effectiveness of the proposed mathematical model.", "keywords": [ "Truck", "DOCK", "Distribution center", "Integer programming", "Scheduling (production processes)", "Computer science", "Job shop scheduling", "Software", "Schedule", "Operations research", "Linear programming", "Transport engineering" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/jat/2020/8813372.pdf" }, { "id": "https://openalex.org/W2089325038", "doi": "10.1109/melcon.2014.6820575", "title": "Scatter search algorithm for the cross-dock door assignment problem", "year": 2014, "publication_date": "2014-04-01", "type": "conference-paper", "language": "en", "authors": [ "Abbas A. Tarhini", "Jawad Makki", "Mohamad Mohamad Jaafar Chamseddine" ], "first_author": "Abbas A. Tarhini", "venue": null, "publisher": null, "abstract": "Cross-docking is a practice in logistics in which shipments are directly moved from an inbound truck into an outbound truck. A recognized problem in this domain is the assignment of trucks to doors in a way that the distance to be traveled between the doors is minimized. This problem is known as the Cross-Dock Door Assignment Problem (CDAP). A lot of research has been conducted regarding this topic still, up to our knowledge, none used Scatter Search (SS). In this paper, we implemented this evolutionary metaheuristic algorithm and tested it, then compared the results with those of another evolutionary algorithm, Genetic Algorithm (GA). The results indicate that the SS outperformed the GA.", "keywords": [ "Doors", "DOCK", "Truck", "Computer science", "Metaheuristic", "Genetic algorithm", "Algorithm", "Domain (mathematical analysis)", "Assignment problem", "Mathematical optimization", "Artificial intelligence", "Machine learning" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/melcon.2014.6820575" }, { "id": "https://openalex.org/W2888395703", "doi": "10.3846/transport.2018.1558", "title": "REBALANCING STATIC BIKE-SHARING SYSTEMS: A TWO-PERIOD TWO-COMMODITY MULTI-DEPOT MATHEMATICAL MODEL", "year": 2018, "publication_date": "2018-08-20", "type": "article", "language": "en", "authors": [ "S. Mohammad Arabzad", "Hadi Shirouyehzad", "Mahdi Bashiri", "Reza R. Tavakkoli-Moghaddam", "Esmaeil Najafi" ], "first_author": "S. Mohammad Arabzad", "venue": "Transport", "publisher": "Vilnius Gediminas Technical University", "abstract": "In this paper, an Integer Linear Programming (ILP) has been developed for rebalancing the stations of a Periodic Bike Relocation Problem (PBRP) in multiple periods. The objective function of the mathematical model is reducing costs of implementing trucks, transportation between stations and holding bikes on trucks during rebalancing. The variables we are following them in this model are conducting the optimal route in several periods, using the most appropriate trucks for these routes, and determining the best program for loading/unloading bikes for stations. The distinguishing features of the proposed model are considering several bike types, several exclusive trucks and several time periods. Finally, a numerical example confirms the applicability of the proposed model.", "keywords": [ "Truck", "Relocation", "Integer programming", "Mathematical model", "Computer science", "Transport engineering", "Integer (computer science)", "Linear programming", "Function (biology)", "Operations research", "Mathematical optimization", "Simulation" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://journals.vgtu.lt/index.php/Transport/article/download/1558/1220" }, { "id": "https://openalex.org/W4411133625", "doi": "10.3934/jimo.2025101", "title": "Cross-docking scheduling for fresh produce with heterogeneous quality decay under interrupt modes", "year": 2025, "publication_date": "2025-01-01", "type": "article", "language": "en", "authors": [ "Fei Pan", "Chunyang Fan" ], "first_author": "Fei Pan", "venue": "Journal of Industrial and Management Optimization", "publisher": "American Institute of Mathematical Sciences", "abstract": "Traditional cross-docking scheduling models for fresh produce have commonly employed non-interrupt loading/unloading modes with the objective of minimizing makespan. However, this approach may cause an undesired loading/unloading process and fail to consider issues such as the heterogeneous quality decay rate characteristics among products. To address these two critical issues, we make the following contributions: 1) introducing a novel optimization metric, Total Quality Decay (TQD), which quantifies the heterogeneous perishability attributes of fresh produce in addition to temporal dimension; 2) establishing the cross-docking model with more flexible interrupt scheduling mode during the inbound/outbound truck loading/unloading processes; 3) Due to the problem's nature as a strongly NP-hard problem, an adaptive genetic algorithm based on batch unloading/loading quantity is constructed and solved. Numerical experimental results demonstrate that the inbound (outbound) truck interrupt mode can achieve an average reduction of 15.8% (22.1%) in TQD compared to the traditional non-interrupt mode. Moreover, this advantage becomes more pronounced with decreasing truck changeover time, transit time, batch loading/unloading quantity, and the proportion of high-quality decay rate of fresh produce. This study not only theoretically provides the mathematical expressions for calculating TQD, and establishing models and algorithms under interrupt mode, but also practically reduces fresh produce losses, improves consumer satisfaction, and enhances enterprise competitiveness.", "keywords": [ "Interrupt", "Computer science", "Scheduling (production processes)", "Docking (animal)", "Mathematical optimization", "Embedded system", "Medicine", "Mathematics", "Nursing" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.aimsciences.org/data/article/export-pdf?id=6846b19bb924fa00d9d4bb5a" }, { "id": "https://openalex.org/W2066780679", "doi": "10.1016/j.tre.2015.01.003", "title": "Optimization of postal express line network under mixed driving pattern of trucks", "year": 2015, "publication_date": "2015-03-26", "type": "article", "language": "en", "authors": [ "Li Gang Sun", "Lindu Zhao", "Jing Hou" ], "first_author": "Li Gang Sun", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Line (geometry)", "Computer science", "Transport engineering", "Automotive engineering", "Business", "Computer network", "Engineering", "Mathematics" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2015.01.003" }, { "id": "https://openalex.org/W2770820547", "doi": "10.1073/pnas.1700035114", "title": "Using deep learning and Google Street View to estimate the demographic makeup of neighborhoods across the United States", "year": 2017, "publication_date": "2017-11-28", "type": "article", "language": "en", "authors": [ "Timnit Gebru", "Jonathan Krause", "Yilun Wang", "Duyun Chen", "Jia Hao Deng", "Erez Lieberman Aiden", "Li Fei-Fei" ], "first_author": "Timnit Gebru", "venue": "Proceedings of the National Academy of Sciences", "publisher": "National Academy of Sciences", "abstract": "The United States spends more than $250 million each year on the American Community Survey (ACS), a labor-intensive door-to-door study that measures statistics relating to race, gender, education, occupation, unemployment, and other demographic factors. Although a comprehensive source of data, the lag between demographic changes and their appearance in the ACS can exceed several years. As digital imagery becomes ubiquitous and machine vision techniques improve, automated data analysis may become an increasingly practical supplement to the ACS. Here, we present a method that estimates socioeconomic characteristics of regions spanning 200 US cities by using 50 million images of street scenes gathered with Google Street View cars. Using deep learning-based computer vision techniques, we determined the make, model, and year of all motor vehicles encountered in particular neighborhoods. Data from this census of motor vehicles, which enumerated 22 million automobiles in total (8% of all automobiles in the United States), were used to accurately estimate income, race, education, and voting patterns at the zip code and precinct level. (The average US precinct contains ∼1,000 people.) The resulting associations are surprisingly simple and powerful. For instance, if the number of sedans encountered during a drive through a city is higher than the number of pickup trucks, the city is likely to vote for a Democrat during the next presidential election (88% chance); otherwise, it is likely to vote Republican (82%). Our results suggest that automated systems for monitoring demographics may effectively complement labor-intensive approaches, with the potential to measure demographics with fine spatial resolution, in close to real time.", "keywords": [ "American Community Survey", "Socioeconomic status", "Census", "Demographics", "Precinct", "Geography", "Race (biology)", "Voting", "Business", "Advertising", "Demography", "Political science" ], "cited_by_count": 509, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1073/pnas.1700035114" }, { "id": "https://openalex.org/W3089488377", "doi": "10.48295/et.2020.79.3", "title": "Cross-docks scheduling with multiple doors using fuzzy approach", "year": 2020, "publication_date": "2020-09-01", "type": "article", "language": "en", "authors": [ "Mitra Movassaghi" ], "first_author": "Mitra Movassaghi", "venue": "European Transport/Trasporti Europei", "publisher": "University of Trieste", "abstract": "One of the most important practices in logistics is Cross-Docking which sets its goals as inventory reduction and customer satisfaction increase. Customers receive goods through docks. Docks are responsible to provide a place for goods before being delivered to the customers. Then, these materials are directly loaded into outbound trucks with little or no storage in between to send to customers in the shortest possible time. This paper is mainly aimed at introducing a mixed integer, non-linear programming model to solve scheduling several cross-docking problems. The proposed model is highly facilitated to allocate the most optimal destinations to storage doors and truck scheduling in docks while selecting the collection and delivery routes. Using optimization approaches at uncertainty conditions is also of great importance. Mathematical programming techniques vividly fail to solve transportation problems that include fuzzy objective function coefficients. A fuzzy multi-objective linear programming model is proposed to solve the transportation decision-making with fuzzy objective function coefficients.", "keywords": [ "Doors", "Truck", "Computer science", "Fuzzy logic", "Mathematical optimization", "Operations research", "Linear programming", "Scheduling (production processes)", "Integer programming", "Engineering", "Mathematics", "Artificial intelligence" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.48295/et.2020.79.3" }, { "id": "https://openalex.org/W7104022509", "doi": "10.1016/j.aei.2025.104008", "title": "Multi-depot electric vehicle routing problem with drones considering time-dependent traffic", "year": 2025, "publication_date": "2025-11-05", "type": "article", "language": "en", "authors": [ "Hao Fan", "Kai Liu", "Jiangbo Wang", "Jian Zhao" ], "first_author": "Hao Fan", "venue": "Advanced Engineering Informatics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Initialization", "Vehicle routing problem", "Population", "Particle swarm optimization", "Genetic algorithm", "Crossover", "Electric vehicle" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.aei.2025.104008" }, { "id": "https://openalex.org/W4413353913", "doi": "10.1016/j.tre.2025.104375", "title": "Multi-objective optimization of truck-drone cooperative routing problem based on customer classification and fuzzy time windows", "year": 2025, "publication_date": "2025-08-20", "type": "article", "language": "en", "authors": [ "Xianlong Ge", "Qiushuang Yin", "Md. Abdul Moktadir", "Jingzheng Ren" ], "first_author": "Xianlong Ge", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Drone", "Vehicle routing problem", "Fuzzy logic", "Routing (electronic design automation)", "Computer science", "Engineering", "Operations research", "Transport engineering", "Automotive engineering", "Artificial intelligence", "Computer network" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2025.104375" }, { "id": "https://openalex.org/W2902128960", "doi": null, "title": "Time-indexed Formulations of the Truck-to-door Scheduling Problem at Multi-door Cross-docking Terminals with Temporary Storage", "year": 2018, "publication_date": "2018-01-01", "type": "conference-paper", "language": "en", "authors": [ "Shunji Tanaka", "Boris Detienne", "Ruslan Sadykov" ], "first_author": "Shunji Tanaka", "venue": "HAL (Le Centre pour la Communication Scientifique Directe)", "publisher": "Centre National de la Recherche Scientifique", "abstract": "International audience", "keywords": [ "Truck", "Computer science", "Scheduling (production processes)", "Docking (animal)", "Job shop scheduling", "Automotive engineering", "Embedded system", "Engineering", "Operations management", "Routing (electronic design automation)" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hal.science/hal-01937146" }, { "id": "https://openalex.org/W4408131884", "doi": "10.1080/00207543.2025.2469164", "title": "Robust cross-dock assignment problem with uncertain cost parameters", "year": 2025, "publication_date": "2025-03-04", "type": "article", "language": "en", "authors": [ "Amna Altaf", "Adnen El Amraoui", "François Delmotte", "Christophe Lecoutre" ], "first_author": "Amna Altaf", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "Amidst the unprecedented macroeconomic uncertainty following the pandemic, stakeholders in global supply chains face significant disruptions, necessitating robust decision-making frameworks. In this study, we present an enhanced solution approach to the Truck Dock Assignment with Temporary Storage (TDATS) problem, addressing critical uncertainties in supply chain and logistics operations. This deterministic model, TDATS, integrates operational, penalty, and storage costs, accounting for complex scenarios such as varying arrival times and temporary storage requirements. Additionally, we introduce a robust optimisation framework: Robust Truck Dock Assignment with Temporary Storage (R-TDATS), to effectively handle uncertainties in cost coefficients. Using polyhedral representations of uncertainty sets and the Bertsimas and Sim optimisation approach, the proposed solution provides decision-makers with conservative yet realistic solutions. Numerical experiments demonstrate the effectiveness of this method, showcasing its applicability to real-world instances of the problem. Moreover, the study also analyses the system's performance under higher levels of uncertainty by increasing the deviation of input variables to 25% and 50%. The results show a significantly increased Price of Robustness(PR) up to 39%, a Relative Increase (RI) in cost up to 88%, and Risk values up to 71%, particularly notable for the combined variation in all three cost coefficients (Co, Cp, Cs). Despite this, the magnitude of the cost increase remains relatively small, underscoring the importance of carefully adjusting and optimising input variables, such as demand forecasts and transportation schedules, to mitigate the impacts of uncertainty. An extensive sensitivity analysis using Monte Carlo simulations identifies a threshold point where increasing operational and storage costs reach a saturation level. Beyond this point, further increase in these costs have minimal impact, prompting a strategic shift towards penalty cost management. This includes nuanced trade-off analysis between operational/storage costs and penalty costs, guiding resource allocation and cost management strategies. Additionally, the analysis reveals a linear relationship between penalty costs and the unit penalty cost coefficient, facilitating the development of optimised penalty cost management strategies. The study offers valuable insights for decision-makers in the cross-docking sector, empowering them to make informed decisions that enhance the efficiency and resilience of supply chain networks amidst uncertainty.", "keywords": [ "Truck", "Robustness (evolution)", "Supply chain", "Operations research", "Monte Carlo method", "Computer science", "Mathematical optimization", "DOCK", "Sensitivity (control systems)", "Engineering", "Mathematics", "Statistics" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2025.2469164" }, { "id": "https://openalex.org/W3203686738", "doi": "10.3934/jimo.2021151", "title": "Lagrangian relaxation algorithm for the truck scheduling problem with products time window constraint in multi-door cross-dock", "year": 2021, "publication_date": "2021-09-24", "type": "article", "language": "en", "authors": [ "Binghai Zhou", "Yuanrui Lei", "Shi Zong" ], "first_author": "Binghai Zhou", "venue": "Journal of Industrial and Management Optimization", "publisher": "American Institute of Mathematical Sciences", "abstract": "Cross-docking is a kind of process that products are unloaded in front of the inbound doors, consolidated based on the downstream demand, and then directly transferred to the outbound doors without a long storage process during the transportation. In this paper, a multi-door cross-dock truck scheduling problem is investigated in which the scheduling and sequencing assignment of trucks need to be considered, with the objectives of minimizing the inner transportation cost in the cross-dock and the total truck waiting cost. The major contribution of this paper is that a novel product-related time window constraint and the temporary storage area are firstly introduced to adapt to different physical conditions of goods considering real-world requirements. Then, a Lagrangian relaxation algorithm is proposed which aims to decompose the relaxed problem into several easy-to-be-solved sub-problems. Besides, a subgradient algorithm is used at each iteration to further deal with these sub-problems. Finally, theory analysis and simulation experiments of different problem scales are carried out during the comparison with a Greedy algorithm to evaluate the performance of the proposed algorithm. Results indicate that the Lagrangian relaxation algorithm is able to achieve more satisfactory near-optimal solutions within an acceptable time.", "keywords": [ "Lagrangian relaxation", "Truck", "Computer science", "Mathematical optimization", "Doors", "Subgradient method", "DOCK", "Scheduling (production processes)", "Greedy algorithm", "Job shop scheduling", "Algorithm", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3934/jimo.2021151" }, { "id": "https://openalex.org/W4280625240", "doi": "10.1155/2022/6599089", "title": "Truck and Unmanned Vehicle Routing Problem with Time Windows: A Satellite Synchronization Perspective", "year": 2022, "publication_date": "2022-05-12", "type": "article", "language": "en", "authors": [ "Hongqi Li", "Jiamin Zhao", "Zhuopeng Zhan" ], "first_author": "Hongqi Li", "venue": "Journal of Advanced Transportation", "publisher": "Hindawi Publishing Corporation", "abstract": "We consider an important feature of satellite synchronization in the practical scenario of using unmanned vehicles (UVs) carried by trucks for “last-meter” delivery and introduce the truck and UV routing problem with time windows (TUVRP-TW) for optimizing the routes of a homogeneous fleet of truck-UV combinations. A UV that has been dispatched from its truck must be picked up by the same truck or must return by itself to the depot. Customers with time windows are classified into two types: truck-UV customers (TUCs) and UV customers (UCs). The TUCs where trucks dispatch or pick up the carried UVs are regarded as satellites. Fleet coordination and satellite synchronization are essential for modelling the TUVRP-TW. We classify satellite synchronization into inner-satellite synchronization and intersatellite synchronization. The inner-satellite synchronization generally considered in the literature focuses on synchronization operations at the same satellite. Intersatellite synchronization, which focuses on synchronization operations at various satellites, allows UVs to not return to the dispatched locations, if necessary. In the mixed-integer linear programming model of the TUVRP-TW, both binary variables for identifying the appointed satellites and continuous variables for time continuity constraints are introduced to ensure the interaction between truck routes and UV routes. A hybrid algorithm based on a greedy randomized adaptive search procedure (GRASP) and a variable neighborhood search (VNS) is provided. Based on generated instances and benchmark instances, computational experiments are conducted to evaluate the performance of the intersatellite synchronization, the performance of the developed formulation, and the applicability of the hybrid algorithm.", "keywords": [ "Truck", "Synchronization (alternating current)", "Real-time computing", "Computer science", "Satellite", "Benchmark (surveying)", "Simulation", "Engineering", "Computer network", "Automotive engineering", "Aerospace engineering" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/jat/2022/6599089.pdf" }, { "id": "https://openalex.org/W100953616", "doi": "10.1007/978-3-642-17020-1_6", "title": "Collection of Waste with Single Load Trucks: A Real Case", "year": 2005, "publication_date": "2005-01-01", "type": "book-chapter", "language": "en", "authors": [ "Claudia Archetti", "Maria Grazia Speranza" ], "first_author": "Claudia Archetti", "venue": "Lecture notes in economics and mathematical systems", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Waste management", "Business", "Automotive engineering", "Operations management", "Engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-642-17020-1_6" }, { "id": "https://openalex.org/W2946495420", "doi": null, "title": "Strong and Weak Mutation Mechanisms within Evolutionary Algorithms: a Case Study for the Truck Scheduling Problem at a Cross-Docking Facility", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Maxim A. Dulebenets" ], "first_author": "Maxim A. Dulebenets", "venue": "Transportation Research Board 98th Annual MeetingTransportation Research Board", "publisher": null, "abstract": null, "keywords": [ "Docking (animal)", "Computer science", "Scheduling (production processes)", "Truck", "Algorithm", "Job shop scheduling", "Mathematical optimization", "Engineering", "Mathematics", "Medicine", "Automotive engineering", "Schedule" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1572506" }, { "id": "https://openalex.org/W2137749386", "doi": "10.1002/nav.3800140409", "title": "The truck assignment problem", "year": 1967, "publication_date": "1967-01-01", "type": "article", "language": "en", "authors": [ "Włodzimierz Szwarc" ], "first_author": "Włodzimierz Szwarc", "venue": "Naval Research Logistics Quarterly", "publisher": "Wiley", "abstract": "Abstract Let us consider the following problem: A group of cement factories produces several types of cement, but each factory produces only one type. There is also a group of purchasers and each purchaser may need several types of cement. The amounts supplied and the demands are assumed to be known for each cement factory and each purchaser. Each cement factory has several trucks, but there is only one dispatcher for ail of the trucks from all of the factories. It is assumed that the entire lcad of each truck is for one purchaser only. A truck begins its workday by leaving its base depot loaded and ends its day by returning to it empty. During the day it may be required to transport cement from any of the cement factories. The distances from various factories to individual purchasers are known. The problem to be solved is that of finding a truck schedule such that cement in the needed quantities is delivered daily to the individual purchasers and in such a manner that the total truck‐kilometers traveled will be as small as possible. This paper presents the method of solution, though the assumption of an 8‐hour workday may not be met. On the other hand, there are methods developed for effecting a variety of cyclic routings which can be used to lend considerable flexibility to the schedules.", "keywords": [ "Truck", "Factory (object-oriented programming)", "Cement", "Flexibility (engineering)", "Schedule", "Transport engineering", "Computer science", "Operations management", "Operations research", "Business", "Engineering", "Automotive engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/nav.3800140409" }, { "id": "https://openalex.org/W4390643725", "doi": "10.1016/j.procs.2023.12.118", "title": "Design and Optimization of an Eco-Efficient Vehicle Routing Model for Heterogeneous Fleets and Multi Depot Systems", "year": 2023, "publication_date": "2023-01-01", "type": "conference-paper", "language": "en", "authors": [ "Shreeyash Vyakarnam", "Gokulakrishnan Jayakumar", "Joseph Augustine Cherukara" ], "first_author": "Shreeyash Vyakarnam", "venue": "Procedia Computer Science", "publisher": "Elsevier BV", "abstract": "In the dynamic landscape of vehicle routing problems (VRP), the traditional focus on cost minimization has significantly evolved due to the pressing need to address environmental concerns. With the logistics industry experiencing exponential growth and increased vehicle utilization, sustainability has become a central consideration both globally and in strategic planning. The Vehicle Routing Problem (VRP) remains a key challenge in logistics and transportation management, aiming to optimize routes and vehicle allocation to minimize transportation costs. This study introduces an innovative VRP model that intricately balances economic efficiency with ecological responsibility, addressing the urgent call for sustainable solutions amidst the ongoing environmental crisis. The proposed model features a diverse fleet of trucks, each designated for specific product types, creating a heterogeneous fleet. Originating from multiple depots, these trucks ensure comprehensive geographic coverage and enhance logistical efficiency. The core objective of the model is twofold: minimizing the financial transportation costs associated with supplying multiple products from multiple depots to customers and significantly reducing the carbon footprint, thereby addressing environmental sustainability. Two distinct solutions are proposed: one based on mixed-integer linear programming (MILP) and the other utilizing a heuristic approach. The choice of mixed-integer linear programming instead of linear programming is due to the need to make binary route decisions. Results are compared, focusing on outcome variation and computation time. Additionally, the solution demonstrates upto 100% variation in results when comparing the heuristic model with the optimal values derived from mixed-integer linear programming, though it requires less computation time. This research underscores the importance of seamlessly integrating economic and environmental considerations in the logistics industry. The proposed model embodies this principle, representing a substantial step towards a more sustainable future. By aligning objectives with global sustainability goals set by the United Nations in 2015, this research contributes to the discourse on sustainable development. It lays the foundation for future innovations in vehicle routing and logistics.", "keywords": [ "Computer science", "Vehicle routing problem", "Truck", "Sustainability", "Integer programming", "Heuristic", "Operations research", "Linear programming", "Carbon footprint", "Routing (electronic design automation)", "Mathematical optimization", "Greenhouse gas" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.procs.2023.12.118" }, { "id": "https://openalex.org/W2521518543", "doi": null, "title": "Methodology for Tour-Based Truck Demand Modeling", "year": null, "publication_date": null, "type": "dissertation", "language": "en", "authors": [ "Soyoung Iris You" ], "first_author": "Soyoung Iris You", "venue": "ProQuest Demo Repository", "publisher": null, "abstract": "Freight truck movements exhibit extensive trip interaction between shippers, receivers, and carriers of goods, logistics constraints, and use of advanced information technology. Such characteristics cannot be accurately captured by the traditional four-step approach which has been widely used in state and regional government agencies under the assumption that trips are independent. In this dissertation, it is possible to develop tour-based models using with two main approaches, in order to properly capture the trip-chaining behavior of clean drayage truck movements at the San Pedro Bay Ports (SPBP): 1) disaggregate level tour-based model using the Sequential Selective Vehicle Routing Problem (SSVRP) providing a utility-maximizing decision-making optimization framework and 2) aggregate level tour-based model using Entropy Maximization Algorithm. Before discussing the two different tour-based models, the first step is to analyze GPS data for interpreting the drayage trucks' characteristics and providing model inputs. The brief background of GPS data is as follows: In recent years the Clean Trucks Program (CTP) has been implemented at California's San Pedro Bay Ports (SPBPs) of Long Beach and Los Angeles to help address major environmental issues associated with port operations. \"Clean trucks\" (meeting 2007 model year emission standards) that utilized public funds to replace older polluting drayage trucks were required to be fitted with GPS units for compliance monitoring. In late 2010, 94% of cargo moves at the SPBPs were reportedly made by clean trucks. The study reported in this dissertation is based on a year of such GPS data for a sample that in 2010 comprised 545 clean drayage trucks. With the background, an analytical framework is introduced for processing GPS data to both interpret the trip chaining (or tour behavior) of the clean drayage trucks, and to prepare sufficient tour data for clean truck modeling at the SPBPs. After analyzing the data using the toolkit, one of the significant findings on the clean drayage truck operations is that the tours could be classified under four types, three of which contain repetitive trip patterns in a tour while the fourth tends to show travel in circulatory patterns. This analysis amply demonstrated why current models cannot address drayage truck behavior and why tour-based modeling of the drayage trucks is needs to be developed with sufficient care towards the type of routes the trucks operation. Two other theoretical advances in the research are the development of tour-based models using an Entropy Maximization Algorithm and a Selective Vehicle Routing Problem (SVRP). For the aggregate level, the revised tour-based entropy maximization model upgrades the tour-based entropy maximization model by Wang and Holguín-Veras (2009) which mostly focuses on general commercial vehicles. After introducing new constraints regarding sequential stops to Traffic Analysis Cells (TACs), the clean drayage truck tour behavior can be addressed with complex tour patterns. The revised tour-based entropy maximization model with a Primal Dual Convex Optimization (PDCO) algorithm is seen to converge very quickly. At the disaggregate level, the SSVRP model provides a utility-maximizing decision-making optimization framework under spatial-temporal constraints to explain observed truck patterns as activity participation analogous to household activity patterns. This would be impossible without the ability of Inverse Sequential Selective Vehicle Routing Problem (InvSSVRP) to calibrate the objective coefficients and arrival time constraints such that observed patterns are optimal values. The nodes (or TACs) are sequence-expanded to allow multiple stops at each node and divided into two arrival states (from depot or not from depot) in SSVRP, which provides for much more realism in capturing the drayage truck behavior. To make better use of the two proposed models, the framework of each tour-based model estimation and forecasting process is illustrated. Lastly, several future topics of relevance to improving the tour-based models are discussed.", "keywords": [ "Truck", "Computer science", "Engineering", "Automotive engineering" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "http://pqdtopen.proquest.com/#viewpdf?dispub=3502491" }, { "id": "https://openalex.org/W1517146898", "doi": "10.17485/ijst/2015/v8i12/71433", "title": "A Hybrid Approach for Cross-Docking Scheduling", "year": 2015, "publication_date": "2015-06-07", "type": "article", "language": "en", "authors": [ "Nafiseh Tokhmehchi", "Makui Ahmad" ], "first_author": "Nafiseh Tokhmehchi", "venue": "Indian Journal of Science and Technology", "publisher": "Indian Society for Education and Environment", "abstract": "Background/Objectives: Cross-docking is an innovative logistical strategy, which means discharging the cargos from in-bound trucks into the warehouse directly and saved automatically. This article investigates the scheduling of a distribution system consisting of suppliers, cross-docks and the ultimate destinations. The aim of analyzing this problem is presenting a scheduling model so that lateness, earliness and holding costs will be minimized. Methods/Statistical Analysis: Restrictions are applied on the number of arrival and exit doors, departure time, release time, earliness, lateness, and the required space for discharging. Since the offered model is NP-Hard and highly complicated, the hybrid form of firefly and genetic algorithms is applied to solve the model. Results: Tuning the parameters performed and several numerical examples shows the appliance of this model. Comparisons via ANOVA and interval plot show that hybrid form can act better than GA and FF in large sizes. Conclusion/Application: The innovation of this article is thanks to its model type and solution method. Keywords: Crossdocking, Hybrid Firefly and Genetic Algorithms, Logistics, Metaheuristic, Scheduling", "keywords": [ "Computer science", "Scheduling (production processes)", "Mathematical optimization", "Firefly algorithm", "Metaheuristic", "Firefly protocol", "Genetic algorithm", "Job shop scheduling", "Doors", "Operations research", "Algorithm", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.17485/ijst/2015/v8i12/71433" }, { "id": "https://openalex.org/W2327428990", "doi": "10.1007/978-3-319-23512-7_18", "title": "New Design of a Truck Load Network", "year": 2015, "publication_date": "2015-12-21", "type": "book-chapter", "language": "en", "authors": [ "Andy Apfelstädt", "Matthias Gather" ], "first_author": "Andy Apfelstädt", "venue": "Lecture notes in logistics", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Truck", "Transport engineering", "Production (economics)", "Transport network", "Reliability (semiconductor)", "Process (computing)", "Trailer", "Relation (database)", "Engineering", "Computer science", "Operations research", "Automotive engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-23512-7_18" }, { "id": "https://openalex.org/W4400473926", "doi": "10.1007/s11590-024-02137-6", "title": "Stability approach to CDC truck scheduling problem under uncertainty", "year": 2024, "publication_date": "2024-07-09", "type": "article", "language": "en", "authors": [ "Gabriela B. Fonseca", "Thiago Henrique Nogueira", "Martı́n Gómez Ravetti" ], "first_author": "Gabriela B. Fonseca", "venue": "Optimization Letters", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Computational intelligence", "Truck", "Scheduling (production processes)", "Computer science", "Stability (learning theory)", "Job shop scheduling", "Operations research", "Mathematical optimization", "Mathematics", "Artificial intelligence", "Engineering", "Machine learning" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s11590-024-02137-6" }, { "id": "https://openalex.org/W2810238503", "doi": "10.1002/9781119425526.ch21", "title": "Are Cities' Delivery Spaces in the Right Places? Mapping Truck Load/Unload Locations", "year": 2018, "publication_date": "2018-05-30", "type": "other", "language": "en", "authors": [ "Anne Goodchild", "Barb Ivanov", "Ed McCormack", "Anne Vernez Moudon", "Jason Y. Scully", "José Machado Leon", "Gabriela Giron Valderrama" ], "first_author": "Anne Goodchild", "venue": null, "publisher": null, "abstract": "Two converging trends – the rise of e-commerce and urban population growth – challenge cities facing competing uses for road, curb and alley space. The University of Washington has formed a living Urban Freight Lab to solve city logistics problems that cross private and public sector boundaries. To assess the capacity of the city's truck load/unload spaces, the lab collected GIS coordinates for private truck loading bays, and combined them with public GIS layers to create a comprehensive map of the city's truck parking infrastructure. The chapter offers a practical approach to identify useful existent urban GIS data for little or no cost; collect original granular urban truck data for private freight bays and loading docks; and overlay the existing GIS layers and a new layer to study city-wide truck parking capacity. The Urban Freight Lab's first research project is addressing the \"Final 50 Feet\" of the urban delivery system.", "keywords": [ "Truck", "Transport engineering", "Alley", "Geographic information system", "Overlay", "Population", "Civil engineering", "Geography", "Environmental planning", "Engineering", "Business", "Computer science" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/9781119425526.ch21" }, { "id": "https://openalex.org/W2054862321", "doi": "10.1016/j.endm.2013.05.073", "title": "Strategic planning in LTL logistics – increasing the capacity utilization of trucks", "year": 2013, "publication_date": "2013-06-01", "type": "article", "language": "en", "authors": [ "J. Fabian Meier", "Uwe Clausen" ], "first_author": "J. Fabian Meier", "venue": "Electronic Notes in Discrete Mathematics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Transshipment (information security)", "Heuristic", "Bundle", "Economies of scale", "Operations research", "Scale (ratio)", "Computer science", "Plan (archaeology)", "Transport engineering", "Business", "Mathematics" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.endm.2013.05.073" }, { "id": "https://openalex.org/W2792734597", "doi": "10.1007/978-3-319-75792-6_10", "title": "Multi-capacity, Multi-depot, Multi-product VRP with Heterogeneous Fleets and Demand Exceeding Depot Capacity", "year": 2018, "publication_date": "2018-01-01", "type": "conference-paper", "language": "en", "authors": [ "Gabriel Alemany", "Angel Alejandro Juan", "Roberto García", "Alvaro de Garcia", "Miguel Ortega" ], "first_author": "Gabriel Alemany", "venue": "Advances in intelligent systems and computing", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Truck", "Vehicle routing problem", "Product (mathematics)", "Depot", "Computer science", "On demand", "Set (abstract data type)", "Operations research", "Routing (electronic design automation)", "Metaheuristic", "Transport engineering", "Automotive engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-75792-6_10" }, { "id": "https://openalex.org/W4364380138", "doi": "10.1016/j.cie.2023.109238", "title": "The Profitable Single Truck and Trailer Routing Problem with Time Windows: Formulation, valid inequalities and branch-and-cut algorithms", "year": 2023, "publication_date": "2023-04-11", "type": "article", "language": "en", "authors": [ "Henrique Favarini Alves da Cruz", "Alexandre Salles da Cunha" ], "first_author": "Henrique Favarini Alves da Cruz", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": "The Profitable Single Truck and Trailer Routing Problem with Time Windows (PSTTRPTW) is defined by a fleet of trucks and trailers and a set of customers that reward a profit if their supply is collected within a time window. Trailers can be attached to trucks in order to raise capacity, at the expense of increasing travel time and cost. Trailers can be decoupled from trucks at satellite depots, after which the truck performs subtours, visiting customers inaccessible by trailers. A route may include any number of subtours, as long as the vehicle’s capacity is respected. The goal is to find a route for a single choice of truck and trailer maximizing the difference between the collected profit and the route cost. We introduce an Integer Programming formulation, preprocessing tests, valid inequalities and investigate two PSTTRPTW Branch-and-cut (BC) algorithms, one of them based on the basic formulation and the other, on the strengthened model. Our numerical results show that these preprocessing tests reduced the number of variables by about 30%. In addition, the Linear Programming relaxations provided by the strongest model are, on average, 25% sharper than those given by the basic model. As a result, the reinforced BC algorithm has the edge: it is faster, solves all instances solved by its competitor and 13 additional ones, and provides optimality gaps 14% smaller when optimality is not certified. • We investigate a routing problem arising in the dairy industry. • Trailers can be detached from trucks to implement subtours and access some customers. • Routes implement as many subtours as needed provided truck’s capacities are enforced. • Integer programming formulation, preprocessing and valid inequalities are proposed. • A branch-and-cut algorithm based on the reinforced model outperforms the basic one.", "keywords": [ "Truck", "Trailer", "Preprocessor", "Integer programming", "Linear programming", "Profit (economics)", "Computer science", "Vehicle routing problem", "Routing (electronic design automation)", "Mathematical optimization", "Operations research", "Mathematics" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2023.109238" }, { "id": "https://openalex.org/W1597163128", "doi": null, "title": "FATIGUE AND FITNESS FOR DUTY OF NEW ZEALAND TRUCK DRIVERS", "year": 1998, "publication_date": "1998-01-01", "type": "article", "language": "en", "authors": [ "Samuel G. Charlton", "Peter H. Baas" ], "first_author": "Samuel G. Charlton", "venue": null, "publisher": null, "abstract": "The effects of driver fatigue have been implicated in a large number of truck crashes and road fatalities in other countries. While there are no extensive studies of fatigue-related road accidents in New Zealand, the road characteristics and driving environment here make any decrease in performance due to driver fatigue a significant potential threat to road safety. This paper describes an on-going Road Safety Trust-sponsored study of how common driver fatigue is in New Zealand and the degree to which NZ truck drivers suffer from fatigue related effects. Using a portable driving simulator installed in a caravan, volunteer truck drivers are asked to complete a brief survey (about their driving hours and their amount of sleep in the past 48 hours, how sleepiness affects them, and the level of fatigue they feel at that moment), and go for a drive on the driving simulator (measuring their vehicle control and reaction times) as they stop their trucks at depots, rest stops, and cargo terminals throughout the day and night. In comparison to indirect measures of fatigue, such as inspection of driving hours in log books, the fitness-for-duty test has obvious job relevance (measuring actual driving performance) and enjoys a high degree of driver acceptance. (a) For the covering entry of this conference, please see IRRD abstract no. E200232.", "keywords": [ "Truck", "Transport engineering", "Engineering", "Aeronautics", "Sleep deprivation", "Applied psychology", "Psychology", "Automotive engineering" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/651383" }, { "id": "https://openalex.org/W1482772488", "doi": null, "title": "A simulated annealing algorithm to solve the log-truck scheduling problem", "year": 2014, "publication_date": "2014-01-01", "type": "conference-paper", "language": "en", "authors": [ "Mauricio Acuña", "Mohammad Reza Ghaffariyan", "Luke Mirowski", "Mark William Brown" ], "first_author": "Mauricio Acuña", "venue": "eCite Digital Repository (University of Tasmania)", "publisher": "University of Tasmania", "abstract": "In this paper, we present a simulated annealing (SA) approach for solving the log-truck scheduling problem, which is an extension of the timber transport vehicle routing problem with time windows(TTVRPTW). The problem is characterized by a heterogeneous fleet of trucks that depart from their corresponding depots and must perform a number of daily transport tasks to move log products between wood pickup (harvest areas) locations and industrial customers, such as pulpmills and sawmills. Commencing at their depots, each truck must perform a number of successive transport tasks, each one characterized by a trip between a designated harvest area and an industrial customer, until the number of daily working hours is completed. The objective of the model is to minimize total empty travel time for the whole fleet as well as waiting times at wood pickup locations. In addition, time", "keywords": [ "Truck", "Vehicle routing problem", "Simulated annealing", "Pickup", "Scheduling (production processes)", "Transport engineering", "Computer science", "Operations research", "Running time", "Routing (electronic design automation)", "Engineering", "Operations management" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "http://academic.sun.ac.za/forestry/PF 2014/PF PDfs/Mauricio Acuna.pdf" }, { "id": "https://openalex.org/W3074415737", "doi": "10.1007/s40974-020-00184-0", "title": "Evaporative quality of Nigeria’s gasoline: truck loading perspective", "year": 2020, "publication_date": "2020-08-18", "type": "article", "language": "en", "authors": [ "Obindah Gershon", "Kolawole Asaolu" ], "first_author": "Obindah Gershon", "venue": "Energy Ecology and Environment", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Gasoline", "Perspective (graphical)", "Quality (philosophy)", "Business", "Environmental science", "Automotive engineering", "Waste management", "Engineering", "Computer science", "Physics" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s40974-020-00184-0" }, { "id": "https://openalex.org/W4247116065", "doi": "10.1109/wsc.2016.7822419", "title": "Empty container stacking operations: Case study of an Empty Container Depot in Valparaiso Chile", "year": 2016, "publication_date": "2016-12-01", "type": "conference-paper", "language": "en", "authors": [ "Jimena Pascual", "Diego F. Aranda", "Felipe Hidalgo", "Alice E. Smith", "Erhan Karakaya", "Rosa G. González‐Ramírez" ], "first_author": "Jimena Pascual", "venue": null, "publisher": null, "abstract": "This study analyzes the handling operations performance at an Empty Container Depot that serves different shipping lines operating with the port of Valparaíso, Chile. With the aid of a discrete event simulation model built in Simio that interacts with an SQL Server database, we seek to improve container stacking policies and to redesign the depot's layout such that truck turn-around times decrease.", "keywords": [ "Container (type theory)", "Depot", "Stacking", "Port (circuit theory)", "Truck", "Computer science", "Sql server", "Engineering", "Database", "Automotive engineering", "Electrical engineering", "Geography" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/wsc.2016.7822419" }, { "id": "https://openalex.org/W2234586263", "doi": "10.4271/2015-01-9019", "title": "Chassis Dynamometer Testing of a Class 5 Battery Electric Commercial Truck", "year": 2015, "publication_date": "2015-10-01", "type": "article", "language": "en", "authors": [ "Jean-Baptiste Gallo", "Robert L. Russell", "Kent C. Johnson", "Thomas D. Durbin" ], "first_author": "Jean-Baptiste Gallo", "venue": "SAE International journal of commercial vehicles", "publisher": null, "abstract": "With funding from the California Energy Commission, the California Hybrid, Efficient and Advanced Truck Research Center, contracted with the University of California, Riverside's College of Engineering to evaluate the performance of a Class 5 battery electric urban delivery vehicle over two standardized driving cycles and a steady state range test on a chassis dynamometer. The test vehicle, a Smith Electric Newton Step Van, was equipped with a proprietary data acquisition system which was set to record a wide variety of vehicle parameters at a 1 Hz sampling period. In addition, the chassis dynamometer was set to measure and record additional parameters. Lastly, a portable J1772 EVSE recorded both grid energy and power at 15-minute intervals. This project provides a controlled test evaluation of the Smith Electric Newton Step Van. It recognizes the vehicle's potential for a successful delivery vehicle and identifies several important findings and areas that will need further research. The Newton Step Van is an efficient and clean alternative to equivalent diesel vehicles. The Newton Step Van showed an equivalent fuel economy between 38.4 and 46.4 MPGe on the three cycles used for this project. While Smith Electric Vehicles advertises a total driving range of up to 80 miles for the Newton Step Van, the chassis dynamometer testing estimated total driving range superior to 100 miles on both the HTUF4 and OCBC cycles.", "keywords": [ "Truck", "Chassis", "Automotive engineering", "Dynamometer", "Battery (electricity)", "Commercial vehicle", "Engineering", "Mechanical engineering", "Power (physics)" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.4271/2015-01-9019" }, { "id": "https://openalex.org/W2149907300", "doi": "10.1142/s0217595907001346", "title": "A HEURISTIC APPROACH FOR SOLVING SERIALLY DISTRIBUTED STORAGE DEPOTS UNDER GENERAL-INTEGER POLICY", "year": 2007, "publication_date": "2007-08-01", "type": "article", "language": "en", "authors": [ "Fang-Chuan Lee", "Ue‐Pyng Wen" ], "first_author": "Fang-Chuan Lee", "venue": "Asia Pacific Journal of Operational Research", "publisher": "World Scientific", "abstract": "In this study, we present the problems of shipping a single product from a single supply origin, through a serial system of storage depots, to a single demand destination by trucks or ships, and aim to minimize the sum of ordering, inventory and transportation costs over an infinite time horizon. We formulate the problem consisting of general-integer (GI), stationary and nested replenishment policies for the multistage inventory/distribution system. This paper presents the near-optimal cost-curve structure analysis for this serially distributed storage depot problem (SDSDP) and show that the ordering quantities for each storage depot always comply with the GI replenishment policy. Moreover, we develop a heuristic approach, which is based on an efficient search procedure to obtain satisfactory results. A comparison of the results obtained from the proposed heuristic method has been made with that from the LINGO® software on randomly generated problems. The proposed heuristic is the first solution approach in the literature to solve the single link problems based on the cost-curve structure analysis. Furthermore, we provide an important foundation for carrying out investigations on lot sizing and distribution problems with other supply chain configurations.", "keywords": [ "Heuristic", "Mathematical optimization", "Sizing", "Computer science", "Supply chain", "Integer (computer science)", "Truck", "Time horizon", "Operations research", "Mathematics", "Engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1142/s0217595907001346" }, { "id": "https://openalex.org/W4205655597", "doi": "10.1007/978-3-030-86841-3_13", "title": "A Two-Echelon Truck-and-Drone Distribution System: Formulation and Heuristic Approach", "year": 2021, "publication_date": "2021-01-01", "type": "book-chapter", "language": "en", "authors": [ "Maurizio Boccia", "Andrea Mancuso", "Adriano Masone", "Antonio Sforza", "Claudio Sterle" ], "first_author": "Maurizio Boccia", "venue": "AIRO Springer series/AIRO Springer Series", "publisher": "Springer International Publishing", "abstract": null, "keywords": [ "Drone", "Truck", "Context (archaeology)", "Heuristic", "Computer science", "Integer programming", "Linear programming", "Parking lot", "TRIPS architecture", "Exploit", "Operations research", "Operator (biology)" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-030-86841-3_13" }, { "id": "https://openalex.org/W3014947253", "doi": "10.1051/matecconf/202031202005", "title": "Container truck transportation routing as a Mixed Fleet Heterogeneous Dial-a-Ride Problem", "year": 2020, "publication_date": "2020-01-01", "type": "conference-paper", "language": "en", "authors": [ "Mohamed Amine Masmoudi", "Katarzyna Anna Kuźmicz", "Erwin Pesch", "Emrah Demir", "Manar Hosny" ], "first_author": "Mohamed Amine Masmoudi", "venue": "MATEC Web of Conferences", "publisher": "EDP Sciences", "abstract": "In this paper, a new variant of the Heterogeneous Dial-a-Ride Problem (HDARP) is innovatively applied to a routing problem of trucks picking up and delivering full and empty containers in the logistic chain, including container depots, importers demanding full containers and exporters requesting empty containers. On the route different types of trucks pick-up and deliver full and empty 20- and 40-foot containers. We consider trucks that are operated by alternative fuel, as well as the need for refuelling of trucks in any alternative fuel station to eliminate the risk of running out of fuel during its route. The objective of the paper is to contribute to the optimization of container truck transport routing with multiple pick¬ups and deliveries by providing a mathematical programming model aiming at minimizing the transportation cost as well as the negative environmental impacts.", "keywords": [ "Truck", "Container (type theory)", "Transport engineering", "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "Operations research", "Automotive engineering", "Engineering", "Computer network" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.matec-conferences.org/articles/matecconf/pdf/2020/08/matecconf_eppm2018_02005.pdf" }, { "id": "https://openalex.org/W4285524191", "doi": "10.1504/ijor.2021.119932", "title": "Exact and heuristic methods to solve the two-machine cross-docking flow shop scheduling problem", "year": 2021, "publication_date": "2021-01-01", "type": "article", "language": "en", "authors": [ "Imen Hamdi", "Yosr Hazgui" ], "first_author": "Imen Hamdi", "venue": "International Journal of Operational Research", "publisher": "Inderscience Publishers", "abstract": "In this paper we study the two-machine cross-docking flowshop scheduling problem. Cross-docking is an innovative logistical strategy in which a truck is unloaded from inbound (supplier) vehicles and directly loaded into outbound (customer) vehicules without storage in between or in less than 24 hours. We aim to determine the schedules of the inbound and outbound trucks in the crossdock while minimising the makespan. This problem is known to be NP-hard in the strong sense. We propose a mixed integer linear programming (MILP) which is tightened by adding valid inequalities. Also, we develop some heuristic methods which are based on some known and new priority rules. Then, we report the results of computational experiments on randomly generated problems.", "keywords": [ "Job shop scheduling", "Computer science", "Truck", "Integer programming", "Mathematical optimization", "Scheduling (production processes)", "Heuristic", "Flow shop scheduling", "Operations research", "Algorithm", "Mathematics", "Artificial intelligence" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijor.2021.119932" }, { "id": "https://openalex.org/W4405697424", "doi": "10.3390/app142411958", "title": "A Branch-and-Price-and-Cut Algorithm for the Inland Container Transportation Problem with Limited Depot Capacity", "year": 2024, "publication_date": "2024-12-20", "type": "article", "language": "en", "authors": [ "Yujian Song", "Yuting Zhang" ], "first_author": "Yujian Song", "venue": "Applied Sciences", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "As an effective solution to the first- and last-mile logistics of door-to-door intermodal container transportation, inland container transportation involves transporting containers by truck between terminals, depots, and customers within a local area. This paper is the first to focus specifically on the inland container transportation problem with limited depot capacity, where the storage of empty containers is constrained by physical space limitations. To reflect a more realistic scenario, we also consider the initial stock levels of empty containers at the depot. The objective of this problem is to schedule trucks to fulfill inland container transportation orders such that the overall cost is minimum and the depot is neither out of stock or over stocked at any time. A novel graphical representation is introduced to model the constraints of empty containers and depot capacity in a linear form. This problem is then mathematically modeled as a mixed-integer linear programming formulation. To avoid discretizing the time horizon and effectively achieve the optimal solution, we design a tailored branch-and-price-and-cut algorithm where violated empty container constraints for critical times are dynamically integrated into the restricted master problem. The efficiency of the proposed algorithm is enhanced through the implementation of several techniques, such as a heuristic label-setting method, decremental state-space relaxation, and the utilization of high-quality upper bounds. Extensive computational studies are performed to assess the performance of the proposed algorithm and justify the introduction of enhancement strategies. Sensitivity analysis is additionally conducted to investigate the implications of significant influential factors, offering meaningful managerial guidance for decision-makers.", "keywords": [ "Depot", "Mathematical optimization", "Computer science", "Container (type theory)", "Operations research", "Algorithm", "Transport engineering", "Mathematics", "Engineering", "Geography" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2076-3417/14/24/11958/pdf?version=1734702695" }, { "id": "https://openalex.org/W3215682014", "doi": "10.1109/crc52766.2021.9620157", "title": "Research on Application of Airport Tanker Truck Scheduling Based on Particle Swarm Optimization", "year": 2021, "publication_date": "2021-10-09", "type": "conference-paper", "language": "en", "authors": [ "Yuyuan Wang", "Junqing Sun", "Bin Yu Sun", "Meiling Feng" ], "first_author": "Yuyuan Wang", "venue": null, "publisher": null, "abstract": "Airport special vehicles can efficiently and orderly complete a series of ground support services, which play a key role in the normal operation of flights. Take an airport as an example, the problem of airport special vehicle scheduling is studied and analyzed, and an airport tanker truck scheduling model with time windows is established. The model aims at the minimum number of tanker truck performing tasks and the shortest total travel path of the vehicle. Each flight can only be served once and only by one vehicle. The starting point of each sub-path is the fuel truck depot. The fuel demand of each sub-route cannot exceed the maximum load capacity of the tanker truck. The aircraft must be served within the time window. Using particle swarm algorithm to solve the problem of airport tanker truck scheduling, take flight data from a domestic airport as an example for simulation experiment, compare with saving algorithm and genetic algorithm under the same experimental conditions, experiments show that the designed algorithm is more effective and more resource-saving in solving the problem of airport fuel truck scheduling.", "keywords": [ "Truck", "Particle swarm optimization", "Scheduling (production processes)", "Genetic algorithm", "Engineering", "Computer science", "Transport engineering", "Operations research", "Automotive engineering", "Operations management", "Algorithm" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/crc52766.2021.9620157" }, { "id": "https://openalex.org/W2339883959", "doi": "10.1007/978-3-319-23512-7_19", "title": "Costs and Travel Times of Cooperative Networks in Full Truck Load Logistics", "year": 2015, "publication_date": "2015-12-21", "type": "book-chapter", "language": "en", "authors": [ "Sergey N. Dashkovskiy", "Bernd Nieberding" ], "first_author": "Sergey N. Dashkovskiy", "venue": "Lecture notes in logistics", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Truck", "Productivity", "Transport engineering", "Network structure", "Industrial organization", "Business", "Simple (philosophy)", "Operations research", "Computer science", "Engineering", "Automotive engineering", "Economics" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-23512-7_19" }, { "id": "https://openalex.org/W3192147792", "doi": "10.5267/j.dsl.2021.7.002", "title": "A mixed-integer linear programming model for the selective full-truckload multi-depot vehicle routing problem with time windows", "year": 2021, "publication_date": "2021-01-01", "type": "article", "language": "en", "authors": [ "Karim El Bouyahyiouy", "Adil Bellabdaoui" ], "first_author": "Karim El Bouyahyiouy", "venue": "Decision Science Letters", "publisher": "Growing Science", "abstract": "This article has studied a full truckload transportation problem in the context of an empty return scenario, particularly an order selection and vehicle routing problem with full truckload, multiple depots and time windows (SFTMDVRPTW). The aim is to develop a solution where a set of truck routes serves a subset of selected transportation demands from a number of full truckload orders to maximize the total profit obtained from those orders. Each truck route is a chain of selected demands to serve, originating at a departure point and terminating at an arriving point of trucks in a way that respects the constraints of availability and time windows. It is not mandatory to serve all orders, and only the profitable ones are selected. In this study, we have formulated the SFTMDVRPTW as a mixed-integer linear programming (MILP) model. Finally, Computational results are conducted on a new data set that contains thirty randomly generated problem instances ranging from 16 to 30 orders using the CPLEX software. The findings prove that our model has provided good solutions in a reasonable time.", "keywords": [ "Truck", "Vehicle routing problem", "Integer programming", "Mathematical optimization", "Computer science", "Context (archaeology)", "Linear programming", "Profit (economics)", "Set (abstract data type)", "Operations research", "Routing (electronic design automation)", "Transport engineering" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5267/j.dsl.2021.7.002" }, { "id": "https://openalex.org/W1574071528", "doi": null, "title": "TRUCK DRIVERS' SUGGESTIONS AND PREFERENCES FOR INSTRUMENT PANEL SYMBOLS", "year": 1981, "publication_date": "1981-06-01", "type": "article", "language": "en", "authors": [ "M. Gingold", "S Shteingart", "P Green" ], "first_author": "M. Gingold", "venue": null, "publisher": null, "abstract": "Ideas and preferences for symbols to label truck controls and displays were collected in two experiments. In the first, 31 tractor-semitrailer drivers were interviewed at a truck stop near Detroit, Michigan. They drew pictures representing 18 functions: cab lock down, dump load, engine oil temperature, engine oil filter, brake fluid level, air pressure, retarder, air filter, loading light, axle lift, gearbox malfunction, winch, power take off, trailer connection/lock-up, engine stop, fuel shutoff, differential lock, and third (interaxle) differential lock. From those drawings and manufacturers' suggestions 125 candidate symbols were developed. In the second experiment, 33 other truck drivers at a restaurant and at a truck depot in the Detroit area ranked those candidates, by function, from best to worst. The rankings identified some candidates as not being meaningful and others as being worthy of testing on an international scale.", "keywords": [ "Truck", "Brake", "Tractor", "Automotive engineering", "Trailer", "Engineering", "Axle", "Winch", "Lift (data mining)", "Oil pressure", "Lock (firearm)", "Track (disk drive)" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/178880" }, { "id": "https://openalex.org/W3014244852", "doi": "10.48550/arxiv.2004.02275", "title": "The two-echelon routing problem with truck and drones", "year": 2020, "publication_date": "2020-04-05", "type": "preprint", "language": "en", "authors": [ "Minh Hoàng Hà", "Lam Vu", "Duy Manh Vu" ], "first_author": "Minh Hoàng Hà", "venue": "arXiv (Cornell University)", "publisher": "Cornell University", "abstract": "In this paper, we study novel variants of the well-known two-echelon vehicle routing problem in which a truck works on the first echelon to transport parcels and a fleet of drones to intermediate depots while in the second echelon, the drones are used to deliver parcels from intermediate depots to customers. The objective is to minimize the completion time instead of the transportation cost as in classical 2-echelon vehicle routing problems. Depending on the context, a drone can be launched from the truck at an intermediate depot once (single trip drone) or several times (multiple trip drone). Mixed Integer Linear Programming (MILP) models are first proposed to formulate mathematically the problems and solve to optimality small-size instances. To handle larger instances, a metaheuristic based on the idea of Greedy Randomized Adaptive Search Procedure (GRASP) is introduced. Experimental results obtained on instances of different contexts are reported and analyzed.", "keywords": [ "Drone", "Vehicle routing problem", "Truck", "Context (archaeology)", "Computer science", "Integer programming", "Routing (electronic design automation)", "Mathematical optimization", "Linear programming", "GRASP", "Metaheuristic", "Heuristic" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://arxiv.org/pdf/2004.02275" }, { "id": "https://openalex.org/W4384163497", "doi": "10.1016/j.tre.2023.103219", "title": "Note: Demonstrating analytics in a low-tech context–truck-routing for solid-waste collection in an Indian metropolis", "year": 2023, "publication_date": "2023-07-13", "type": "article", "language": "en", "authors": [ "Kaveri Kala", "ManMohan S. Sodhi" ], "first_author": "Kaveri Kala", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Context (archaeology)", "Vehicle routing problem", "Waste collection", "Computer science", "Cluster analysis", "Analytics", "Integer programming", "Routing (electronic design automation)", "Operations research", "Data mining", "Algorithm" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://openaccess.city.ac.uk/id/eprint/30965/1/Accepted%20Version%2010_July_2023_Accepted.pdf" }, { "id": "https://openalex.org/W2170750256", "doi": "10.1080/07408179808966487", "title": "Routing orderpickers in a warehouse: a comparison between optimal and heuristic solutions", "year": 1998, "publication_date": "1998-05-01", "type": "article", "language": "en", "authors": [ "René B.M. de Koster", "EDO VAN DER POORT" ], "first_author": "René B.M. de Koster", "venue": "IIE Transactions", "publisher": "Taylor & Francis", "abstract": "In this paper the problem of finding efficient orderpicking routes is studied for both conventional warehouses, where pickers have a central depot for picking up and depositing carts and pick lists, and modern warehouses, where orderpicking trucks can pick up and deposit pallets at the head of every aisle without returning to the depot. Such environments can be found in many warehouses where paperless picking is performed from pallet locations with pickers having mobile terminals receiving instructions one by one. In order to find orderpicking routes with a minimal length in both the situations of a central depot or decentralized depositing, we extend the well-known polynomial algorithm of Ratliff and Rosenthal [1] that considered warehouses with a central depot. In practice, the problem is mainly solved by using the so-called S-shape heuristic in which orderpickers move in a S-shape curve along the pick locations. The performance of the new algorithm and the S-shape heuristic are compared in three realistic orderpicking systems: (1) narrow-aisle high-bay pallet warehouse; (2) picking in shelf area with decentralized depositing of picked items; and (3) conventional orderpicking from wide-aisle pallet locations. The new algorithm gives a reduction in travel time per route of between 7 and 34%. It turns out that the reduction in travel time strongly depends on the lay-out and operation of the warehouse.", "keywords": [ "Aisle", "Pallet", "Warehouse", "Heuristic", "Routing (electronic design automation)", "Order picking", "Truck", "Computer science", "Reduction (mathematics)", "Operations research", "Engineering", "Simulation" ], "cited_by_count": 231, "is_retracted": false, "is_paratext": false, "open_access_url": "https://research.wur.nl/en/publications/routing-orderpickers-in-a-warehouse-a-comparison-between-optimal-" }, { "id": "https://openalex.org/W3192337325", "doi": "10.1088/1755-1315/267/2/022040", "title": "A Reference to Sea Water in Oil Tank Fire of Coastal Oil Depot", "year": 2019, "publication_date": "2019-05-01", "type": "conference-paper", "language": "en", "authors": [ "Lin Jiang", "Dandan Yin" ], "first_author": "Lin Jiang", "venue": "IOP Conference Series Earth and Environmental Science", "publisher": "IOP Publishing", "abstract": "With the rapid development of China's economy, China has become the second oil consumption country which ranks only second to the America, strategic oil petroleum reserve has also become the most essential link of national energy security system. The reserve fuel quantity excursion brings a great challenge to the safety of depot. In recent years, accidental explosions of oil and gas happened constantly. Effectively control and successfully rescue of large floating roof tank seal ring fire is the core of fire safety. When in case a fire occurs in a floating roof sealing ring, the existing fixed fire extinguishing equipment is unable to put out fire quickly and effectively, usually it needs a lot of firefighting truck rushing to the scene, firefighters have to board on roof to do artificial saves, this will cost large amount water. For this reason, this article puts forward a kind of nitrogen and integration of sea water mist fire extinguishing system, with functions of lightning fire prevention and quickly put out a fire without delay, the reference of sea water enhances the usability of location, and also improves the security of the floating roof tank.", "keywords": [ "Firefighting", "Roof", "Fire protection", "Pipeline transport", "Environmental science", "Fire prevention", "Engineering", "Truck", "Petroleum", "Waste management", "Civil engineering", "Environmental engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://iopscience.iop.org/article/10.1088/1755-1315/267/2/022040/pdf" }, { "id": "https://openalex.org/W2624476694", "doi": "10.1590/0101-7438.2017.037.01.0029", "title": "AN APPROXIMATE COST-INTEGRATED MODELLING APPROACH TO CROSS DOCK DESIGN", "year": 2017, "publication_date": "2017-01-01", "type": "article", "language": "en", "authors": [ "Antônio Galvão Novaes", "Edson T. Bez", "Daniel Domingos Adriano" ], "first_author": "Antônio Galvão Novaes", "venue": "Pesquisa Operacional", "publisher": "Sociedade Brasileira de Pesquisa Operacional", "abstract": "Cross docking is a form of operating break-bulk freight terminals in which the receiving products are not stocked but, instead, the incoming cargo is internally transferred to be immediately shipped in distribution trucks. With this approach, inventory costs and lead-times are significantly reduced. In this work, an approximate, continuous, non-stationary queueing model is established to estimate the number of cargo discharging doors in the receiving dock. Since the traditional first-come, first-served queueing discipline is not applicable to this specific problem, an alternative formulation, called least-distance, firstserved queue discipline, is adopted and analysed with a simulation approach. The problem is modelled to support a preliminary design of a cross-dock terminal. The objective function, to be minimized, is the sum of the rent cost of the terminal facility, the waiting cost of inbound trailers when being attended at the terminal, and the cost of handling and moving freight inside the terminal.", "keywords": [ "DOCK", "Doors", "Terminal (telecommunication)", "Truck", "Computer science", "Queueing theory", "Queue", "Operations research", "Mathematical optimization", "Computer network", "Mathematics", "Engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.scielo.br/pdf/pope/v37n1/1678-5142-pope-37-01-00029.pdf" }, { "id": "https://openalex.org/W2420480469", "doi": "10.32657/10356/68868", "title": "Integrated vehicle scheduling and routing policies for cross-dock systems", "year": 2016, "publication_date": "2016-01-01", "type": "dissertation", "language": "en", "authors": [ "Dwi Agustina" ], "first_author": "Dwi Agustina", "venue": null, "publisher": null, "abstract": "Cross-docking has become an increasingly popular logistics strategy in which products from several suppliers are consolidated into a single shipment to enable FTL, rather than LTL, shipments.The cross-dock warehouse ships the received goods directly to the customers, with little or no storage in between.The advantages of implementing cross-docking include shortened delivery time, improved customer satisfaction, and increased cost savings.Cross-docking depends heavily on the use of information technology and sophisticated planning software that coordinate the physical product flows and information flows.However, unavailability of effective IT systems is one of the biggest barriers faced by companies implementing cross-docking.In addition, contemporary research only considers vehicle scheduling, product consolidation and routing issues separately, leading to sub-optimal solutions.This research takes a step towards integrating operations planning issues at a cross-dock, and develops vehicle scheduling and routing policies at a cross dock warehouse using an integrated model.There are four key contributions of this research.(1) First is a comprehensive literature review of cross-dock operations planning issues.Extensive literature review in cross-docking is done and research gap identified.The main research gap identified and addressed in this research is the integration of scheduling and vehicle routing policies at cross docks.This research focuses on delivery vehicle scheduling and routing problem at a cross-dock facility by combining these two problems, and considering the customer delivery time window and the product consolidation decision.(2) Second contribution of this research is a model for vehicle routing and scheduling problems at a cross-dock, namely VRSP, and modelled as a MILP.The model consists of suppliers, inbound trucks, cross-dock facility, outbound trucks, and customers, and tries to determine the vehicle routing and scheduling policies jointly.The objective of VRSP ABSTRACT II is to determine the schedule of inbound and outbound vehicles at the cross-dock and the routing of outbound vehicles to deliver products within customer specified time windows.VRSP aims to minimize the total cost, which consists of the earliness penalty cost, the tardiness penalty cost, the inventory holding cost, and the transportation cost of deliveries.The performance of VRSP is experimented using CPLEX Solver version 12.3 running on an Intel® Celeron® CPU N2840 2.16 GHz computer.The experiments show that CPLEX Solver can solve the VRSP in a reasonable and acceptable time only for small scale problems.The CPLEX Solver takes a long time to solve medium size problems, and is unable to solve large-scale, real-life size problems.(3) The third contribution of this research is a modified model incorporating customer zones and hard-time windows to eliminate late and early delivery costs and substantially reduce the solution space.Through experiments using the same software and computer platform as VRSP, it is shown that the modified model (VRSP-CZHTW) can be solved for medium to large scale, real-life problems within an acceptable time.Only when the number of customers reaches five hundred or higher does the Solver reach its time limit without a solution.(4) The fourth and final contribution of this research is a meta-heuristics (TS algorithm) based approach to solve the original VRSP.Further experiments are done to validate and test the TSA-VRSP on an Intel® Celeron® CPU N2840 2.16 GHz computer.The algorithm is coded using MATLAB version 7.9.0.The experiments show that TSA-VRSP can be solved even for large scale problems in an acceptable time.The experiments also show that TSA-VRSP has better performance than the two previously developed methods (VRSP and VRSP-CZHTW, using CPLEX Solver).Thus, TSA-VRSP has the potential to be the foundation of a decision support tool for cross-dock managers, and help develop effective and integrated vehicle routing and scheduling policies for day-to-day operations.", "keywords": [ "Vehicle routing problem", "DOCK", "Scheduling (production processes)", "Operations research", "Unavailability", "Computer science", "Engineering", "Distributed computing", "Computer network", "Routing (electronic design automation)", "Operations management", "Reliability engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://dr.ntu.edu.sg/bitstream/10356/68868/1/FINAL_THESIS_DWIAGUSTINA_OK.pdf" }, { "id": "https://openalex.org/W2328295392", "doi": "10.1061/40632(245)34", "title": "Intermodal Transportation and Optimum Depot Selection", "year": 2002, "publication_date": "2002-07-31", "type": "conference-paper", "language": "en", "authors": [ "Hamid Reza Ahadi" ], "first_author": "Hamid Reza Ahadi", "venue": null, "publisher": null, "abstract": "Intermodal transportation activities have seen fundamental changes in technology, operation, management and organization in the past three decades. A transportation carrier deliver products to its clients using containers in various transportation modes such as railcars and trucks. After delivery and unloading by the customers, the empty containers are shipped back to a depot or warehouse designated by the carrier for subsequent shipment to other customers. After loading the new customer's products, the containers are transported directly to their destinations or through some intermediate depots. Under this type of logistic networks, containers spend a significant amount of time in empty movements. For example in the US rail system it is estimated that a railcar is empty during 40% of its average car cycle. The importance of empty container movement in carriers cost structure has inspired a number of studies directed at managing empty container fleets for railroad, liner shipping operators, and truckers. A fundamental questions these studies address is: Given an inland logistic network, how should the carrier dispatch empty containers to meet shippers' demand, to relocate empty containers among depots and warehouses, and to lease on/off containers in preparation for future demand. While these studies have achieved some degree of success in reducing empty container related operational costs, a more fundamental and strategic question is how to design the underlying logistics network; namely, how to determine the location and capacity of depots and warehouses in order to achieve a broader and more significant cost reduction. This paper addresses the above question by developing a decision support tool to assist transportation carriers in determining their inland logistic network, the location and the capacity of each depot.", "keywords": [ "Truck", "Container (type theory)", "Transport engineering", "Transshipment (information security)", "Lease", "Operations research", "Destinations", "Payload (computing)", "Computer science", "Cost reduction", "Order (exchange)", "Business" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1061/40632(245)34" }, { "id": "https://openalex.org/W76045733", "doi": "10.33915/etd.398", "title": "Robust Cross-dock Location Model Accounting for Demand Uncertainty", "year": 2013, "publication_date": "2013-12-01", "type": "dissertation", "language": "en", "authors": [ "Stephanie Spangler" ], "first_author": "Stephanie Spangler", "venue": null, "publisher": null, "abstract": "The objective of this thesis was to develop optimization models to locate cross-docks in supply chain networks. Cross-docks are a type of intermediate facility which aid in the consolidation of shipments, in which the goods spend little or no time in storage. Instead, the goods are quickly and efficiently moved from the inbound trucks to the outbound docks. Two deterministic facility location models were developed. One followed the p-median facility problem type, where only p facilities were opened in order to minimize total network costs. In the second model, as many cross-docks as necessary were opened and facility location costs were considered while minimizing total network costs. In order to account for uncertainty in demands, a robust optimization model was created based on the initial deterministic one. Robust counterparts were developed for each equation that contained the demand term. The robust model allowed for the creation of a network with the ability to handle variations in demand due to factors such as inclement weather, seasonal variations, and fuel prices. Numerical analysis was performed extensively on both the deterministic and robust models, following the p-median facility problem type, using three networks and parameters coherent with industry standards. The results showed that accounting for uncertainty in demands had a real effect on the facilities which were opened and total network costs. While the deterministic network was less expensive, it was unable to handle increases in demand due to uncertainty, whereas the robust network had no capacity shortages in any scenario. Simple demand inflation, along with the use of a robust model for baseline comparison, also proved to be a legitimate strategy to account for uncertainties in demand among small freight carriers.", "keywords": [ "Facility location problem", "Truck", "Robust optimization", "Operations research", "Supply chain network", "Computer science", "Engineering", "Supply chain", "Mathematical optimization", "Supply chain management", "Business", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://researchrepository.wvu.edu/cgi/viewcontent.cgi?article=1401&context=etd" }, { "id": "https://openalex.org/W4381951805", "doi": "10.1016/j.seps.2023.101667", "title": "A location-routing model for free-floating shared bike collection considering manual gathering and truck transportation", "year": 2023, "publication_date": "2023-06-25", "type": "article", "language": "en", "authors": [ "Xiaozhou He", "Qingyi Wang" ], "first_author": "Xiaozhou He", "venue": "Socio-Economic Planning Sciences", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Transport engineering", "Beijing", "Data collection", "Computer science", "Routing (electronic design automation)", "Heuristic", "Process (computing)", "Operations research", "Vehicle routing problem", "Simulation", "Engineering" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.seps.2023.101667" }, { "id": "https://openalex.org/W2144111703", "doi": "10.1287/mnsc.35.12.1443", "title": "Multi-Level Production and Distribution Planning with Transportation Fleet Optimization", "year": 1989, "publication_date": "1989-12-01", "type": "article", "language": "en", "authors": [ "Tony J. Van Roy" ], "first_author": "Tony J. Van Roy", "venue": "Management Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "We present an application of mathematical programming for solving a complex multi-level production and distribution network optimization problem faced by a petrochemical company. Two liquified petroleum gas (LPG) products, propane and butane, are produced at refineries, from where they are shipped in bulk to plants for bottling. Then the company distributes the gas bottles to the customers either directly or via depots and transportation breakpoints. Transportation is carried out by the company's own truck fleet or by contract carriers. The own trucks can operate on different shift systems allowing for overtime. The problem is to find the location of the bottling plants and the depots, the production levels at the refineries and the plants, the stock levels at the plants and the depots, the transportation volumes on each link of the distribution network, the number of trucks and drivers, the transportation shift systems and schedules, and the customer assignments so as to meet LPG demand at minimal cost. The actual problem has 2 commodities, 2 refineries, 10 potential bottling plant locations, 40 potential depot locations, 40 breakpoints (transporters), and 200 customer regions. The problem was solved using a matrix generator designed for network-like problems and MPSARX, a state-of-the-art general-purpose mathematical programming software system augmented with advanced automatic reformulation and cut generation features.", "keywords": [ "Truck", "Bottling line", "Oil refinery", "Supply chain optimization", "Petrochemical", "Operations research", "Computer science", "Transport engineering", "Engineering", "Waste management", "Supply chain", "Business" ], "cited_by_count": 50, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/mnsc.35.12.1443" }, { "id": "https://openalex.org/W4406665498", "doi": "10.3390/stats8010009", "title": "Predicting and Mitigating Delays in Cross-Dock Operations: A Data-Driven Approach", "year": 2025, "publication_date": "2025-01-20", "type": "article", "language": "en", "authors": [ "Amna Altaf", "Adeel Mehmood", "Adnen El Amraoui", "François Delmotte", "Christophe Lecoutre" ], "first_author": "Amna Altaf", "venue": "Stats", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Cross-docking operations are highly dependent on precise scheduling and timely truck arrivals to ensure streamlined logistics and minimal storage costs. Predicting potential delays in truck arrivals is essential to avoiding disruptions that can propagate throughout the cross-dock facility. This paper investigates the effectiveness of deep learning models, including Convolutional Neural Networks (CNN), Multilayer Perceptrons (MLPs), and Recurrent Neural Networks (RNNs), in predicting late arrivals of trucks. Through extensive comparative analysis, we evaluate the performance of each model in terms of prediction accuracy and applicability to real-world cross-docking requirements. The results highlight which models can most accurately predict delays, enabling proactive measures for handling deviations and improving operational efficiency. Our findings support the potential for deep learning models to enhance cross-docking reliability, ultimately contributing to optimized logistics and supply chain resilience.", "keywords": [ "DOCK", "Computer science", "Engineering", "Marine engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2571-905X/8/1/9/pdf?version=1737381255" }, { "id": "https://openalex.org/W4390017204", "doi": "10.1504/ijvcm.2023.135621", "title": "Improving cross-docking systems by load integration: meta-heuristics approach", "year": 2023, "publication_date": "2023-01-01", "type": "article", "language": "en", "authors": [ "Zohreh Khalilpourshiraz", "Mahdi Yousefi Nejad Attari", "Sajjad Gozalzadeh" ], "first_author": "Zohreh Khalilpourshiraz", "venue": "International Journal of Value Chain Management", "publisher": "Inderscience Publishers", "abstract": "In order to reduce costs and increase the efficiency of the supply chain system, cross-docking is one of the essential warehousing management strategies to combine products from different suppliers to different customers. In this study, a particular state of cross-docking is considered in which inbound trucks can also be used as outbound trucks while it brings benefits such as reduced unloading, loading, and truck rental costs. In this state of the problem, a mathematical model has been developed to obtain the appropriate answer. Also, we solve the model and determine the accuracy of modelling from optimisation software such as GAMS and MATLAB. Also, we consider meta-heuristic algorithms, and the experimental results demonstrate the ability to compete with the proposed different meta-heuristic algorithms. They can improve the best-known solutions for occurrences inbound and obtain better outcomes for the ant lion optimiser than two other algorithms, with an average improvement of 53.6%. The proposed meta-heuristic outperforms a standard ant lion optimiser algorithm on more significant capacity instances, maintaining solution quality within reasonable CPU times.", "keywords": [ "Heuristics", "Computer science", "Truck", "Renting", "MATLAB", "Meta heuristic", "Software", "Metamodeling", "Ant colony optimization algorithms", "Mathematical optimization", "Operations research", "Algorithm" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijvcm.2023.135621" }, { "id": "https://openalex.org/W4235957324", "doi": "10.1504/ijlsm.2020.110579", "title": "Auction-based algorithm for solving scheduling problem in cross-docking centres", "year": 2020, "publication_date": "2020-01-01", "type": "article", "language": "en", "authors": [ "Eldho Paul", "Brijesh Paul" ], "first_author": "Eldho 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", "Operations research", "Schedule", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijlsm.2020.110579" }, { "id": "https://openalex.org/W4415424785", "doi": "10.1016/j.cie.2025.111624", "title": "Deep reinforcement learning for drone-assisted truck delivery route optimization in a time-dependent network with time windows", "year": 2025, "publication_date": "2025-10-22", "type": "article", "language": "en", "authors": [ "Yong Peng", "Jing Huang", "Dennis Z. Yu", "Ajinkya N. Tanksale", "Pengfei Gu" ], "first_author": "Yong Peng", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Reinforcement learning", "Truck", "Flexibility (engineering)", "Traffic congestion", "Markov decision process", "Vehicle routing problem", "Routing (electronic design automation)", "Drone", "Variable neighborhood search" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2025.111624" }, { "id": "https://openalex.org/W4399680900", "doi": "10.5267/j.ijiec.2024.5.005", "title": "Collaborative truck-robot routing problem with meal delivery for the elderly on the personalized needs", "year": 2024, "publication_date": "2024-01-01", "type": "article", "language": "en", "authors": [ "Wei Hong", "Wenjing Yin", "Shuling Xu" ], "first_author": "Wei Hong", "venue": "International Journal of Industrial Engineering Computations", "publisher": "Growing Science", "abstract": "With the development of a new generation of information technology, smart elderly care plays an important role in promoting the construction of elderly care services. The emerging application tools provide door-to-door meal service for urban elderly groups, solving meal problems for special and ordinary elderly with different priority levels and penalty costs of violating time windows. Based on this, considering the personalized needs of the elderly group, this study examines the route optimization problem of cooperative delivery of elderly meals by trucks and robots, and builds a mixed integer programming model to minimize the total cost of the system. For large-scale problems, this study designs an improved adaptive large neighbourhood search algorithm that incorporates simulated annealing algorithm and artificial bee colony algorithm to avoid falling into local optimality. Experiments have proved feasibility and effectiveness of the algorithm and proposed the corresponding management insights from the aspects of delivery efficiency and service quality.", "keywords": [ "Truck", "Robot", "Routing (electronic design automation)", "Meal", "Computer science", "Engineering", "Simulation", "Manufacturing engineering", "Automotive engineering", "Embedded system", "Artificial intelligence", "Food science" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "http://dx.doi.org/10.5267/j.ijiec.2024.5.005" }, { "id": "https://openalex.org/W2599291094", "doi": null, "title": "CROSS-DOCKING TRANSSHIPMENT PROBLEM APPROACHED BY NON LINEAR PROGRAMMINGAND SIMULATION ANALYSIS", "year": 2012, "publication_date": "2012-09-01", "type": "conference-paper", "language": "en", "authors": [ "G. Aiello", "Mario Enea", "Cinzia Muriana" ], "first_author": "G. Aiello", "venue": "Nova Science Publishers (Nova Science Publishers, Inc.)", "publisher": null, "abstract": "The need for fast product delivery causes the attention of supply chain is addressed to strategies able to optimize the distribution process. In this field the crossdocking seems to be an efficient strategy which makes possible to reduce or eliminate the storage phase by meeting customer demand. In this paper a transshipment problem for cross-docking strategy is considered by means of a deterministic model studied through the non linear programming technique. The solution found allows to determine the optimal quantities to ship, the number of routes activated and the optimal truck number when the constraint on truck capacity is enforced. The influence of the demand fluctuation is also addressed through a simulation tool representing the cross-docking system. Finally the comparison between the cross-docking strategy and the direct delivery one is considered in terms of cost efficiency and trucks utilization.", "keywords": [ "Transshipment (information security)", "Computer science", "Operations research", "Mathematical optimization", "Mathematics", "Computer security" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10447/72946" }, { "id": "https://openalex.org/W1508061822", "doi": "10.7282/t3z89ck4", "title": "Inbound and outbound trucks scheduling at crossdocks", "year": 2009, "publication_date": "2009-01-01", "type": "dissertation", "language": "en", "authors": [ "Zhang Ti" ], "first_author": "Zhang Ti", "venue": "Rutgers University Community Repository (Rutgers University)", "publisher": "Rutgers, The State University of New Jersey", "abstract": "In today’s customer driven economy, moving products quickly, efficiently, and cost effectively offers crucial advantages to companies. To achieve these goals, more and more companies are finding that cross-docking can play an integral part in their distribution model by partially replacing or complementing existing warehousing facilities. Crossdocking is a material handling and distribution operation, which moves products quickly and directly from inbound trucks (ITs) to outbound trucks (OTs) through the crossdock facility where products are being resorted or consolidated, without being stored or only with a short-term storage, usually within 24 hours or sometimes only within one hour. This research deals with the scheduling of both ITs and OTs at a crossdocking facility where three objectives are considered: The first objective is to minimize the starting and handling time of all ITs; the second objective is to minimize the total weighted distance of pallets traveled inside the crossdock facility; and the third objective is to minimize the total departure time of all OTs. Multi-objective mixed-integer program formulations are built in order to address the problem. Justification for the use of these objectives in optimizing cross-dock operations is given. Different models are built for three different door layouts at crossdocking facility. Since the problems are NP-hard, we consider the problem size limitations to obtain an exact solution. In addition, a restriction-approximation approach to solve the models is proposed and the efficiency of our approximation method is proved based on generated data. Finally, numerical examples are provided using the mathematical models built and the approximation approaches. Results for different layouts and scenarios are compared to evaluate the characteristics of different crossdock layouts.", "keywords": [ "Truck", "Business", "Computer science", "Scheduling (production processes)", "Operations management", "Engineering", "Automotive engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.7282/t3z89ck4" }, { "id": "https://openalex.org/W53562067", "doi": "10.1007/978-3-642-60744-8_90", "title": "Locating Depots for a Food Producer by Solving Uncapacitated Facility Location Problems", "year": 1997, "publication_date": "1997-01-01", "type": "book-chapter", "language": "en", "authors": [ "Ulrich Tüshaus", "Stefan Wittmann" ], "first_author": "Ulrich Tüshaus", "venue": "Operations research proceedings", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Truck", "Facility location problem", "Mode (computer interface)", "Location model", "Stage (stratigraphy)", "Operations research", "Computer science", "Transport engineering", "Mathematical optimization", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-642-60744-8_90" }, { "id": "https://openalex.org/W3201391186", "doi": "10.1109/mmar49549.2021.9528480", "title": "Evaluation of Hybrid Particle Swarm Optimization in the Multi-door Cross-docking Problem", "year": 2021, "publication_date": "2021-08-23", "type": "conference-paper", "language": "en", "authors": [ "Kamil Pasko", "Edyta Kucharska", "Jerzy Baranowski" ], "first_author": "Kamil Pasko", "venue": null, "publisher": null, "abstract": "The paper deals with a cross-docking problem which is an example of real-word logistics problem and belongs to the class of NP-hard optimization problems. Cross-docking is a transshipment platform, where products from suppliers to several destinations are deconsolidated, sorted, consolidated based on the customer's orders, and shipped out to the end customers using outbound trucks. In particular, multiple inbound and outbound doors cross-docking is under consideration. The aim is to optimize the sequence of inbound and outbound trucks and truck dock assignment in cross-docking systems with multiple inbound and outbound dock doors. A particle swarm optimization hybridized with simulated annealing is proposed to solve this problem. The paper also presents the results of computational experiments.", "keywords": [ "DOCK", "Doors", "Truck", "Particle swarm optimization", "Transshipment (information security)", "Computer science", "Docking (animal)", "Simulated annealing", "Mathematical optimization", "Engineering", "Algorithm", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/mmar49549.2021.9528480" }, { "id": "https://openalex.org/W3105758992", "doi": "10.23919/sice48898.2020.9240405", "title": "Reactive Tabu Search for Optimal Vehicle Routing Method of Trucks Considering Allocation of Secondary Depots in Case of Natural Disaster", "year": 2020, "publication_date": "2020-09-23", "type": "conference-paper", "language": "en", "authors": [ "Sara Onoda", "Yoshikazu Fukuyama" ], "first_author": "Sara Onoda", "venue": null, "publisher": null, "abstract": "In recent years, large earthquakes such as the Great East Japan Earthquake have occurred in Japan. Unfortunately, large-scale disasters are expected to occur in the near future. In such a case, logistics of emergency relief supplies is so important for us to survive in the situation. This paper proposes a reactive tabu search based optimal vehicle routing method in the distribution area when natural disaster occurs. The effectiveness of the proposed method is verified using the actual evacuation facility data of Chiba city, Japan, which are actually planned to utilize when a natural disaster occurs, by comparing with the conventional tabu search based method.", "keywords": [ "Tabu search", "Natural disaster", "Truck", "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "Scale (ratio)", "Transport engineering", "Operations research", "Engineering", "Geography", "Computer network" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.23919/sice48898.2020.9240405" }, { "id": "https://openalex.org/W4237174365", "doi": "10.1016/s1464-2859(19)30451-1", "title": "Cummins showcases hydrogen fuel cell heavy-duty truck", "year": 2019, "publication_date": "2019-11-01", "type": "article", "language": "en", "authors": [], "first_author": null, "venue": "Fuel Cells Bulletin", "publisher": "Elsevier BV", "abstract": "US-based Cummins unveiled its heavy-duty truck with fuel cell and battery electric power, at the recent 2019 North America Commercial Vehicle Show (NACV) in Atlanta, Georgia. The zero-emissions Class 8, 6×4 day-cab tractor is a technology demonstrator suitable for applications including regional haul, urban delivery operations, port drayage, and terminal container handling.", "keywords": [ "Truck", "Heavy duty", "Engineering", "Gallon (US)", "Automotive engineering", "Battery (electricity)", "Fuel cells", "Container (type theory)", "Miles per gallon gasoline equivalent", "Waste management", "Power (physics)", "Fuel efficiency" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/s1464-2859(19)30451-1" }, { "id": "https://openalex.org/W4392728627", "doi": "10.1016/j.biombioe.2024.107162", "title": "Nth-plant scenario for blended pellets of Miscanthus, Switchgrass, and Corn Stover using multi-modal transportation: Biorefineries and depots in the contiguous U.S.", "year": 2024, "publication_date": "2024-03-12", "type": "article", "language": "en", "authors": [ "T. M. A. Hossain", "Daniela Jones", "Edward E. Godfrey", "Daniel E. Saloni", "Mahmoud A. Sharara", "Damon S. Hartley" ], "first_author": "T. M. A. Hossain", "venue": "Biomass and Bioenergy", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Miscanthus", "Corn stover", "Biorefinery", "Cellulosic ethanol", "Stover", "Biofuel", "Bioenergy", "Biomass (ecology)", "Truck", "Raw material", "Environmental science", "Energy crop" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.biombioe.2024.107162" }, { "id": "https://openalex.org/W4400121013", "doi": "10.3390/math12132004", "title": "Robust Truck Transit Time Prediction through GPS Data and Regression Algorithms in Mixed Traffic Scenarios", "year": 2024, "publication_date": "2024-06-28", "type": "article", "language": "en", "authors": [ "Adel Ghazikhani", "Samaneh Davoodipoor", "Amir M. Fathollahi‐Fard", "Mohammad Gheibi", "Reza Moezzi" ], "first_author": "Adel Ghazikhani", "venue": "Mathematics", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "To enhance safety and efficiency in mixed traffic scenarios, it is crucial to predict freight truck traffic flow accurately. Issues arise due to the interactions between freight trucks and passenger vehicles, leading to problems like traffic congestion and accidents. Utilizing data from the Global Positioning System (GPS) is a practical method to enhance comprehension and forecast the movement of truck traffic. This study primarily focuses on predicting truck transit time, which involves accurately estimating the duration it will take for a truck to travel between two locations. Precise forecasting has significant implications for truck scheduling and urban planning, particularly in the context of cross-docking terminals. Regression algorithms are beneficial in this scenario due to the empirical evidence confirming their efficacy. This study aims to achieve accurate travel time predictions for trucks by utilizing GPS data and regression algorithms. This research utilizes a variety of algorithms, including AdaBoost, GradientBoost, XGBoost, ElasticNet, Lasso, KNeighbors, Linear, LinearSVR, and RandomForest. The research provides a comprehensive assessment and discussion of important performance metrics, including Mean Squared Error (MSE), Root Mean Squared Error (RMSE), Mean Absolute Error (MAE), and R-squared (R2). Based on our research findings, combining empirical methods, algorithmic knowledge, and performance evaluation helps to enhance truck travel time prediction. This has significant implications for logistical efficiency and transportation dynamics.", "keywords": [ "Global Positioning System", "Truck", "Computer science", "Transit (satellite)", "Regression analysis", "Algorithm", "Regression", "Data mining", "Transport engineering", "Statistics", "Machine learning", "Engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3390/math12132004" }, { "id": "https://openalex.org/W2624139243", "doi": "10.9734/bjast/2017/32755", "title": "Characterization of Depotted Faecal Sludge into the Environment and Design of a Suitable Treatment System: Case of Nomayos Area in Yaounde City", "year": 2017, "publication_date": "2017-01-10", "type": "article", "language": "en", "authors": [ "André Talla", "Raymond Sezawo", "Paul-Salomon Ngohe-Ekam" ], "first_author": "André Talla", "venue": "British Journal of Applied Science & Technology", "publisher": "Sciencedomain International", "abstract": "Aims: The aim of this study is to contribute to the establishment of a sustainable system of treating faecal sludge derived from autonomous sanitation system; this through co-composting with sawdust, using an analytical formula to obtain the appropriate ratio of mixing sludge and sawdust. Study Design:In other to meet that objective, we have spent eight weeks in the site of Nomayos, area in Yaounde city, support of the present study.For this period, we followed the movement of the depotted trucks of faecal sludge then recorded the quantities these waste and taken samples for the analysis laboratory.", "keywords": [ "Environmental science" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://journalcjast.com/index.php/CJAST/article/download/1556/3112" }, { "id": "https://openalex.org/W4412450620", "doi": "10.1016/j.est.2025.117626", "title": "Low-carbon routing and charging planning for electric freight trucks utilizing local surplus solar power", "year": 2025, "publication_date": "2025-07-15", "type": "article", "language": "en", "authors": [ "Ryoji Miyabe", "Yu Fujimoto", "Yasuhiro Hayashi" ], "first_author": "Ryoji Miyabe", "venue": "Journal of Energy Storage", "publisher": "Elsevier BV", "abstract": "The decarbonization of freight transport via electric vehicles (EVs) is hampered not only by operational constraints but also by the CO 2 emission factor of charging electricity. This study addresses this challenge by proposing a novel Electric Vehicle Routing Problem (EVRP) framework that strategically absorbs local, spatiotemporally variable surplus photovoltaic (PV) power, based on transport-side access to surplus information. Unlike prior studies that passively assume the availability of renewable energy , our approach enables delivery operators to proactively adjust both the timing and location of charging in response to surplus forecasts, thereby optimizing charging behavior accordingly. Our primary innovation is a mixed-integer programming model with an objective function that directly minimizes CO 2 emissions by distinguishing between carbon-intensive grid power and low-carbon surplus PV based on smart metering data. The model optimizes delivery routes and en-route charging schedules by integrating day-ahead forecasts of regional surplus power. Through a data-driven case study in Utsunomiya, Japan , our method demonstrated a 16.6 % average reduction in CO 2 emissions from charging compared to conventional depot-only charging strategies. In high-surplus scenarios, reductions exceeded 60 %. Crucially, these reductions were achieved while satisfying delivery time window constraints and maintaining efficient routing in terms of total delivery time and travel distance. Our findings illustrate that commercial EV fleets can be leveraged as mobile assets to support local energy sustainability , providing a viable pathway to simultaneously decarbonize logistics and enhance grid stability.", "keywords": [ "Truck", "Automotive engineering", "Environmental science", "Transport engineering", "Engineering", "Business" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.est.2025.117626" }, { "id": "https://openalex.org/W2763350440", "doi": "10.18535/jmscr/v5i10.36", "title": "The Prevalence of Refractive Error and Color Blindness in Truck Drivers", "year": 2017, "publication_date": "2017-10-08", "type": "article", "language": "en", "authors": [ "Anjali Slathia" ], "first_author": "Anjali Slathia", "venue": "Journal of Medical Science And clinical Research", "publisher": null, "abstract": "Introduction: There has been a steep increase in Road traffic accidents in the last two decades in developing nations such as India.Driving has become a visually intensive task which requires sensory ability (mainly visual), mental ability and compensatory abilities.As per the Motor Vehicles Act,1988.and Central Motor Vehicles Rules, 1989, a medical certificate from a registered medical practitioner is sufficient to qualify for driving license.Truck drivers are most vulnerable for highway accidents.This might be due to many reasons but impaired visual function can be one of the major causes for mishaps.In view of the importance of good vision, this study was conducted to assess the ocular status of interstate truck drivers.Aim and objectives: Assessment of prevalence of refractive error and color blindness among the interstate truck drivers.Materials and Methods: A study was carried out in collaboration with Indian Oil Corporation, India at Jammu in Indian Oil Depot in which 140 interstate truck drivers were included.All the respondents had their visual acuities and color vision evaluated with the aid of Snellen's and E-chart(in case of illiterates) and Ischiara pseudochromatic plates respectively.The subjects had their eyes examined with the help of torch and direct ophthalmoscope.Presbyopic correction was given on the spot.All those with ocular problems were referred to Deptt of Ophthalmology, ASCOMS for further evaluation Results: In all 140 drivers were examined out of which 116(82.8%) were found to have visual acuity 6/6(normal vision) while 24(17.14%)drivers had refractive errors.Of the 24 truck drivers with refractive errors;12 drivers were having hypermetropia, 9 drivers were having myopia and 3 drivers were found to have astigmatism.None of the drivers had color blindness.Irrespective of refractive error,74(52.8%)drivers were found to have presbyopia.Conclusion: Most of the truck drivers having defective vision were in the age group of 41-50 years.Hence, drivers in this age group should be screened frequently to detect visual defects and they should be encouraged to wear corrective spectacles to have normal visual acuity.", "keywords": [ "Medicine", "Blindness", "Optometry", "Truck", "Refractive error", "Ophthalmology", "Automotive engineering", "Engineering", "Visual acuity" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.18535/jmscr/v5i10.36" }, { "id": "https://openalex.org/W4415482552", "doi": "10.1007/s12351-025-00968-4", "title": "Robust cross-dock assignment problem with fuzzy chance constrained optimization approach", "year": 2025, "publication_date": "2025-10-23", "type": "article", "language": "en", "authors": [ "Amna Altaf", "Adnen El Amraoui", "François Delmotte", "Christophe Lecoutre" ], "first_author": "Amna Altaf", "venue": "Operational Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Fuzzy logic", "Robust optimization", "Computational intelligence", "Constraint (computer-aided design)", "Assignment problem", "Fuzzy number", "Optimization problem" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s12351-025-00968-4" }, { "id": "https://openalex.org/W4383221781", "doi": "10.31181/dmame622023640", "title": "Providing an integrated multi-depot vehicle routing problem model with simultaneous pickup and delivery and package layout under uncertainty with fuzzy-robust box optimization method", "year": 2023, "publication_date": "2023-07-05", "type": "article", "language": "en", "authors": [ "Mohammad Khodashenas", "Esmaeil Najafi", "Hamed Kazemipoor", "M. Sobhani" ], "first_author": "Mohammad Khodashenas", "venue": "Decision Making Applications in Management and Engineering", "publisher": null, "abstract": "This paper modeled and solved an integrated multi-depot vehicle routing problem (MDVRP) with simultaneous pickup and delivery (SPD) with package layout under unpredictable pickup, delivery, and transfer costs. The model described in this paper is divided into two stages. In the first stage, the SCA algorithm is used to optimize the package dimensions (a collection of commodities consumers need). The NSGA II and MOALO algorithms are used in the second stage to optimize the three objective functions of 1 simultaneously) minimizing total costs, 2) minimizing co2 emissions, and 3) minimizing the maximum working hours of drivers based on the optimal dimensions (length, width, and height) obtained from solving the first stage model. Determining the quantity and ideal location of possible warehouses, the best route for trucks to take to deliver and collect customer items, and the distribution of customers to warehouses are the key goals of the second stage. Since the model is unclear, the problem's uncertainty parameters are controlled using a novel fuzzy-robust box optimization (FRBO) technique. This technique, which combines the advantages of fuzzy programming with robust box-based optimization, produces excellent results when used to optimize objective functions. The numerical calculations in the numerical example show that the total network costs and CO2 emissions increased in the second stage in the presented model with an increasing uncertainty rate. At the same time, the maximum working hours of drivers decreased due to the shortened communication route and the number of vehicles increasing. Finally, the MOALO algorithm was used to resolve a case study at Safir Broadcasting Company because of its excellent efficiency in resolving the created model, the findings of which revealed the presence of 13 potential effective solutions. The quantity of greenhouse gas emissions rose by 1.11%, the overall expenditures climbed by 1.72%, and the number of hours that drivers worked fell by 11.98% when the uncertainty rate was raised from 0.5 to 0.7, according to research on the FRBO.", "keywords": [ "Pickup", "Mathematical optimization", "Truck", "Fuzzy logic", "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Key (lock)", "Robust optimization", "Operations research", "Engineering", "Automotive engineering" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.dmame-journal.org/index.php/dmame/article/download/640/168" }, { "id": "https://openalex.org/W3134564965", "doi": "10.1007/978-3-030-69373-2_33", "title": "Multi-objective Cross-Docking in Physical Internet Hubs Under Arrival Time Uncertainty", "year": 2021, "publication_date": "2021-01-01", "type": "conference-paper", "language": "en", "authors": [ "Tarik Chargui", "Fatma Essghaier", "Abdelghani Bekrar", "Hamid Allaoui", "Damien Trentesaux", "Gilles Gonçalves" ], "first_author": "Tarik Chargui", "venue": "Studies in computational intelligence", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Truck", "Tardiness", "Lexicographical order", "Integer programming", "Computer science", "Scheduling (production processes)", "Mathematical optimization", "Operations research", "Transport engineering", "Job shop scheduling", "Engineering", "Computer network" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-030-69373-2_33" }, { "id": "https://openalex.org/W2544927530", "doi": null, "title": "Multi-objective two-depot traveling salesman problem with uncertain fleet size for hazardous materials", "year": 2010, "publication_date": "2010-10-01", "type": "conference-paper", "language": "en", "authors": [ "Huiling Zhong", "Nan Zhuang", "Wenxue Cai", "Guanxiang Zhang", "Zongkun Wu" ], "first_author": "Huiling Zhong", "venue": "International Conference on Supply Chain Management and Information", "publisher": null, "abstract": "This paper proposes a multi-objective two-depot traveling salesman problem with uncertain fleet size (MTTSP), which determines optimal distribution route for hazardous materials (hazmat). It actually aims to identify nondominated paths from two given depots to some given destinations under the premise of minimizing the number of mix trucks, that is, deploy as few resources as possible to meet the need effectively and efficiently. An effective genetic algorithm based on ranking is then developed. In addition, a case study is carried out to demonstrate the methodology proposed in this paper.", "keywords": [ "Travelling salesman problem", "Truck", "Mathematical optimization", "Hazardous waste", "Computer science", "Genetic algorithm", "Ranking (information retrieval)", "Premise", "Operations research", "Engineering", "Mathematics", "Artificial intelligence" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005681786" }, { "id": "https://openalex.org/W4409805109", "doi": "10.33042/2522-1809-2025-1-189-475-481", "title": "DETERMINING THE NUMBER OF VEHICLES FOR CROSS-DOCKING IN CONDI-TIONS OF UNCERTAINTY AND LIMITED RESOURCES", "year": 2025, "publication_date": "2025-04-02", "type": "article", "language": "en", "authors": [ "O. Kalinichenko", "Viktoriia Sevidova" ], "first_author": "O. Kalinichenko", "venue": "Municipal economy of cities", "publisher": "O.M. Beketov National University of Urban Economy in Kharkiv", "abstract": "The article analyzes the existing methods of building cargo handling technologies in warehouses using cross-docking technology. The chosen topic is quite relevant, since the use of cross-docking technology is one of the most promising areas for improving the efficiency of international cargo transportation. The article presents a methodology for determining the optimal number of vehicles required for efficient cross-docking operations under conditions of uncertainty and limited resources. The proposed approach takes into account the key parameters of logistics processes, including the dynamics of incoming and outgoing cargo flows, restrictions on the capacity of logistics hubs, variability of transportation demand and possible delays in delivery. The proposed methodology is based on the use of mathematical optimization models that minimize the operating costs of truck maintenance and reduce the risks of penalties in case of violation of contractual terms and conditions regarding the timing and quality of logistics operations. The study considers various scenarios of loading and unloading processes, taking into account the uneven distribution of cargo flows, limited warehouse and transshipment capacities, possible disruptions in delivery schedules, and other uncertain factors. Effective cross-docking operations require perfect coordination of incoming and outgoing flows on logistics platforms. This is because cross-docking involves minimizing the time for cargo handling without long-term storage, which requires clear synchronization between all participants in the logistics process - suppliers, carriers, customs authorities and recipients of goods. The factors that determine the conditions of uncertainty in the organization of cross-docking in international transportation are outlined. The obtained results can be used to improve the efficiency of logistics systems, optimize the use of the vehicle fleet, reduce operating costs and improve the overall quality of service in the field of international transportation. The proposed methodology is useful for logistics operators, transport companies, and analysts involved in transportation management and the development of strategies to improve logistics processes in the context of cross-docking.", "keywords": [ "Docking (animal)", "Computer science", "Medicine" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://khg.kname.edu.ua/index.php/khg/article/download/6505/6425" }, { "id": "https://openalex.org/W1994029369", "doi": "10.1057/jors.1969.101", "title": "Expected Distances in Distribution Problems", "year": 1969, "publication_date": "1969-12-01", "type": "article", "language": "en", "authors": [ "Nicos Christofides", "Samuel Eilon" ], "first_author": "Nicos Christofides", "venue": "Journal of the Operational Research Society", "publisher": "Palgrave Macmillan", "abstract": "In many problems in distribution management it is necessary to take account of the expected distances that result from dispatching vehicles to meet customer demand. For example, in mathematical models for determining the optimal location of depots, the sum of radial distances (between customers and the depot), or the sum of the weighted distances, is used as a measure of the delivery \"costs\". Since actual delivery operations from the depot usually consist of truck-routes with each truck delivering to more than one customer at a time, it is important to know to what extent the above simplification is valid, namely to find a relationship between the actual route-distances and the sum of the radial distances.This paper makes use of an algorithm which plans optimal or near optimal routes to estimate this relationship by solving a large number of randomly generated problems. The discrepancies between the two methods are shown to be significant under certain circumstances.", "keywords": [ "Truck", "Computer science", "Operations research", "Purchasing", "Mathematical optimization", "Scheduling (production processes)", "Measure (data warehouse)", "Distribution (mathematics)", "Project management", "Mathematics", "Operations management", "Data mining" ], "cited_by_count": 114, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1057/jors.1969.101" }, { "id": "https://openalex.org/W4416902085", "doi": "10.3390/su172310775", "title": "Hybrid Drone and Truck Delivery Optimization in Remote Areas Using Geospatial Analytics", "year": 2025, "publication_date": "2025-12-01", "type": "article", "language": "en", "authors": [ "Md Abdul Quddus", "Md Fashiar Rahman", "Mahathir Mohammad Bappy" ], "first_author": "Md Abdul Quddus", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "This study introduces a novel strategy for optimizing hybrid drone-and-truck delivery systems in remote areas by leveraging geospatial analytics. Geospatial methods are employed to identify optimal depot and drone nest locations, which serve as critical nodes for efficient delivery operations. After determining these locations, a customized Vehicle Routing Problem (VRP) model is applied to solve the routing problem. We use Network Analyst (NA) from ArcGIS Pro to solve the VRP problem and improve the solution by customizing the algorithm so that all delivery orders for a vehicle are geographically clustered within the service area. Comparative analysis between truck-only and hybrid truck-and-drone scenarios reveals significant efficiency gains, including reductions in delivery routes, on-road minutes, and total miles traveled. A case study conducted in parts of Wyoming, Idaho, Nevada, Utah, and Colorado validates these findings. The results demonstrate a 10.5% reduction in delivery routes, a 15% reduction in on-road minutes, and a 28% decrease in total miles. Further improvements were achieved through spatial clustering, optimizing delivery routes by grouping orders geographically. These findings emphasize the potential of hybrid delivery systems to improve logistics in remote areas, providing actionable insights for supply chain decision-makers, highlighting the robustness of the proposed method.", "keywords": [ "Geospatial analysis", "Drone", "Truck", "Vehicle routing problem", "Robustness (evolution)", "Analytics", "Routing (electronic design automation)", "Geographic information system" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3390/su172310775" }, { "id": "https://openalex.org/W1984241791", "doi": "10.1353/aph.2003.0099", "title": "Sundays at Payne's Depot", "year": 2003, "publication_date": "2003-03-01", "type": "article", "language": "en", "authors": [ "Jean Harding" ], "first_author": "Jean Harding", "venue": "Appalachian heritage", "publisher": "University of North Carolina Press", "abstract": "MEMOIR Sundays at Payne's Depot Jean Harding NO ONE EVER WORKED on Sunday in the little neighborhood of Payne's Depot where I lived as a child. Most of the families were tenant farmers just like Grandpa and Daddy back in the late 1930s. The men worked in the tobacco, hay and cornfields all week, and on Sundays we would get together and enjoy one another's company. The men were young and strong, and they enjoyed competing in games of horseshoes, baseball or marbles. The women and children liked cheering them on. Nearly all of them liked playing marbles. They would put their brown, cream, gray, and blue stone marbles plus a few glass cat eyes, swirleys and milk agates in an empty Bull Durham tobacco bag, then pull the yellow string tight. They carried the bags of marbles in their pockets along with their pocketknives. Usually they'd play in our backyard near the center of the neighborhood. I remember one of those days in particular. Some days they played marbles just for fun, but that day they had decided they were playing for keeps. To start the game Daddy drew a straight line called a lag line. Five or six feet behind the lag line John Lyman drew another line. All the players took turns shooting from that line toward the center of the lag line. The one who got closest to the center got to shoot first. That day Bill Bruin would shoot first. One of them drew a large round circle on the ground with a smaller circle in the center. \"Okay, men, put your marbles in,\" Zack Brandenburg said. They each put in five marbles. Taking turns, they would each aim to knock out as many marbles as they could. As long as a player's shooter stayed inside the large circle, he could continue to shoot. When the shooter went on through the large circle, that man was out, and the next man took his turn. This would continue until all the marbles were gone. After the game started, there was all this whooping and hollering a-going on. Land sakes alive, you never heard such a commotion as five or six men down on their knees shooting marbles. They sure knew how to enjoy the game. \"Silas got my green cat. That was one of my favorites too.\" \"Yeah, Sam got my blue swirley,\" Grandpa mumbled. Then he added, smiling, \"That man's a good shot.\" 46 Meanwhile Daddy and Monroe were looking at their marbles. Daddy had won two slags but had lost a red cat eye and a couple of blue agates. Each man had won some marbles and had also lost some. But there would be other marbles games and a chance to win them back. All the men were in a good mood. No one ever got mad; they remained good friends as long as we lived there. On other Sunday afternoons when the weather was hot and dry in the summer, rather than playing marbles nearly everyone would walk about a half-mile up the road to watch or play baseball. On a large flat field that belonged to one of the farmers, the men would split up in two teams. Daddy always had a good arm and got to pitch for his team. After they took their positions Zack would yell, \"Batter up!\" \"Watch that man on second base!\" \"There goes John; he's a sure hitter.\" And on it went. It was always exciting. The men loved playing as much as we loved watching. The women and children would stay on the sidelines under a sparse clump of small trees. The women talking about canning tomatoes, blackberries and stringing beans as they were rooting each team on. Us children played tag and kicked up dust with our bare feet. We just couldn't be still very long at a time. You never heard such yelling, hollering, and yahooing. After awhile, we would all be so hot and dusty, folks a-sweating something awful. Right about then a neighbor would pull his old farm truck up near the trees. He had tubs filled with blocks...", "keywords": [ "Depot", "History", "Archaeology" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1353/aph.2003.0099" }, { "id": "https://openalex.org/W3178793148", "doi": "10.1145/3449726.3463184", "title": "A heuristic approach to feasibility verification for truck loading", "year": 2021, "publication_date": "2021-07-07", "type": "conference-paper", "language": "en", "authors": [ "Vínicius Gandra Martins Santos", "Hatice Çalık", "Tony Wauters", "Greet Vanden Berghe" ], "first_author": "Vínicius Gandra Martins Santos", "venue": "Proceedings of the Genetic and Evolutionary Computation Conference Companion", "publisher": null, "abstract": "This paper introduces an industrial decision problem emerging from daily operations of a company which provides its clients in Europe and Latin America with machine rentals. The company faces several challenges in distribution of these machines using a fleet of trucks. The trucks with a non-convex loading surface are loaded with multiple machines of irregular shapes to be picked up or delivered to/from customer or depot locations. Within the algorithmic framework utilized by the company, for each route generated, one must verify whether or not it is possible to load the corresponding machines onto the truck without violating certain restrictions.", "keywords": [ "Truck", "Heuristic", "Computer science", "Automotive engineering", "Engineering", "Artificial intelligence" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://lirias.kuleuven.be/retrieve/25d50dc6-bfb1-4755-948e-31028d470969" }, { "id": "https://openalex.org/W4392624235", "doi": "10.2172/2319200", "title": "Depot-Based Vehicle Data for National Analysis of Medium- and Heavy-Duty Electric Vehicle Charging", "year": 2024, "publication_date": "2024-02-29", "type": "report", "language": "en", "authors": [ "Matthew Bruchon", "USDOE Office of Energy Efficiency and Renewable Energy (EERE)", "U.S. Environmental Protection Agency", "Brennan Borlaug", "Bo Liu", "Tim Jonas", "Jiayun Sun", "Nhat Le", "Eric W. Wood" ], "first_author": "Matthew Bruchon", "venue": null, "publisher": null, "abstract": "Medium-and heavy-duty vehicles (MHDVs) are a major source of greenhouse gases and local criteria air pollutants.Electrifying MHDVs may reduce these harmful emissions, which disproportionately impact disadvantaged communities.Due to their relatively high per-vehicle energy needs, consistent fleet operations, and frequent colocation of multiple vehicles at depots, MHDVs may have more spatially and temporally concentrated charging demands than light-duty passenger electric vehicles.That charging concentration means their electrification may require careful advance planning and coordination to manage potential impacts to the electrical grid via charge management or infrastructure upgrades.However, MHDV duty cycles and parking schedules are highly variable across vocations of operation, and there is a shortage of nationally representative, vocationally diverse public data describing typical MHDV operations.This report summarizes the methodology-designed with national representativeness in mind-used to create a new set of data describing typical daily driving distances, dwell durations, and normalized electric vehicle depot charging load curves for MHDVs.The dataset reflects the subset of MHDV operating patterns that may originate from a consistent depot each day and rely on the same depot for charging.In addition to trucks with depot-centric vocational patterns, the data describes operations of transit buses and school buses, each with a depot-centric focus.The dataset is available to the public and suitable for national analysis.It can inform research, infrastructure planning, and policymaking regarding the electrification of MHDVs.v", "keywords": [ "Electrification", "Truck", "Transport engineering", "Public transport", "Electricity", "Automotive engineering", "Computer science", "Engineering", "Operations research", "Electrical engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2172/2319200" }, { "id": "https://openalex.org/W1522073107", "doi": null, "title": "Strategic Inventory Positioning of Navy Depot Level Repairable", "year": 2005, "publication_date": "2005-06-01", "type": "article", "language": "en", "authors": [ "Larry D. Burton" ], "first_author": "Larry D. Burton", "venue": "Defense Technical Information Center (DTIC)", "publisher": null, "abstract": "Navy Inventory Control Point (NAVICP) is the principle controller of the Navy's inventory consisting of over 470,000 line items valued at over $30B. NAVICP provides the Fleet the parts necessary to maintain weapons systems. In 2003, NAVICP spent over $444M in transportation charges to fulfill customer requests for repair parts. The research in this thesis is the result of an initiative by NAVICP to study the benefits in modifying their current inventory positioning policy for repairable items. NAVICP wishes to incorporate a strategic inventory positioning policy that reduces transportation costs. This thesis develops the Strategic Inventory Positioning (SIP) model that looks at historical inventory demand and determines the optimal storage locations for NAVICP's inventory of repairable items. SIP provides NAVICP an optimization-based tool to aid in determining the strategic inventory location for each repairable item. Using results from SIP and historical transaction data, a cost comparative analysis of 176 of the highest cost and demand volume items shows that using a new synchronized and scheduled truck delivery system combined with strategically locating both new procurements and returns from repair in depots near high demand concentrations, enables NAVICP to reduce annual transportation costs by an average of $110K per repairable item.", "keywords": [ "Navy", "Operations research", "Inventory control", "Procurement", "Truck", "Inventory theory", "Operations management", "Reorder point", "Computer science", "Control (management)", "Inventory cost", "Business" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA435588" }, { "id": "https://openalex.org/W4386708336", "doi": "10.1002/bbb.2537", "title": "Optimization of herbaceous feedstock delivery to a network of supply depots for a biorefinery in the Piedmont, USA", "year": 2023, "publication_date": "2023-09-13", "type": "article", "language": "en", "authors": [ "Jonathan P. Resop", "John S. Cundiff" ], "first_author": "Jonathan P. Resop", "venue": "Biofuels Bioproducts and Biorefining", "publisher": "Wiley", "abstract": "Abstract The southeastern USA has the potential to be a significant producer of bio‐based products; however, research is still needed to demonstrate the most cost‐effective feedstock delivery system for this region. A logistic system that has shown promise is one utilizing a network of supply depots. This study calculated the cost to produce a stream of size‐reduced herbaceous biomass (i.e., switchgrass) for five theoretical depots in the Piedmont province. Three depots were located in south central Virginia and two in north central North Carolina. A logistics system with a 20‐bale handling unit was used for load‐out operations at 199 theoretical satellite storage locations (SSLs) within a 48 km radius of each depot location. The distribution of potential production fields and the transportation distance from SSLs to the depots were determined with spatial and network analyses. Based on an analysis of potential land cover available for feedstock production, the annual capacity per depot ranged from 80 839 to 170 830 Mg, resulting in a total annual capacity of 555 195 Mg for all five depots. Cost to deliver feedstock for 24/7 operation, 48 weeks per year ranged from 46.03 to 62.86 USD Mg−1 annual capacity. At the low end, these costs were: SSL operation (22%), truck (29%), receiving facility (26%), and debaling‐size‐reduction (23%). The principle economy‐of‐scale factors were the receiving facility and debaling‐size‐reduction costs. To minimize per‐Mg cost, depot capacity should be chosen such that equipment can be operated as close to 80% of design capacity as possible.", "keywords": [ "Raw material", "Environmental science", "Truck", "Total cost", "Biorefinery", "Biomass (ecology)", "Environmental engineering", "Engineering", "Business", "Ecology" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/bbb.2537" }, { "id": "https://openalex.org/W2154418786", "doi": "10.1016/j.trb.2004.11.004", "title": "A shortest path approach to the multiple-vehicle routing problem with split pick-ups", "year": 2005, "publication_date": "2005-12-08", "type": "article", "language": "en", "authors": [ "Chi-Guhn Lee", "Marina A. Epelman", "Chelsea C. White", "Yavuz A. Bozer" ], "first_author": "Chi-Guhn Lee", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Shortest path problem", "Vehicle routing problem", "Routing (electronic design automation)", "Mathematical optimization", "Computer science", "Path (computing)", "State (computer science)", "Simple (philosophy)", "Mathematics", "Algorithm", "Engineering" ], "cited_by_count": 106, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trb.2004.11.004" }, { "id": "https://openalex.org/W4280559245", "doi": "10.1007/s00291-022-00680-1", "title": "The traveling salesman problem with drone resupply", "year": 2022, "publication_date": "2022-05-11", "type": "article", "language": "en", "authors": [ "Michael Dienstknecht", "Nils Boysen", "Dirk Briskorn" ], "first_author": "Michael Dienstknecht", "venue": "OR Spectrum", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Travelling salesman problem", "Drone", "Truck", "Context (archaeology)", "Computer science", "Operations research", "Schedule", "Traveling purchaser problem", "Aeronautics", "2-opt", "Engineering", "Automotive engineering" ], "cited_by_count": 42, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00291-022-00680-1" }, { "id": "https://openalex.org/W2269840782", "doi": null, "title": "High-risk sexual partnerships and condom use among truckers entering Mumbai city", "year": 2011, "publication_date": "2011-11-01", "type": "article", "language": "en", "authors": [ "Quazi Syed Zahiruddin", "Abhay Motiramji Gaidhane", "Sunita S. Shanbhag", "Sanjoy P Zodpey" ], "first_author": "Quazi Syed Zahiruddin", "venue": null, "publisher": null, "abstract": "Background: India has one of largest road networks in the world and an estimated 5 million truckers. These men are away from their homes, spouse, families for long durations, this lead them to lead a risky lifestyle making them more susceptible to exposure to STIs including HIV/AIDS.\r\nMethods: Present study design is a cross-sectional one and was undertaken among truckers entering Mumbai city. The study was conducted at truck depots, which are check post where trucks enter Mumbai city.\r\nResults: Mean age of 667 truckers was 33.85 years. 69.1 % of respondents were married, and 16.2 % were illiterate. 45.5 % of truck driver were having experience less than 5 years in their job, 78.4 % of truckers interviewed were staying away from home for more than 15 days per trip, 503 (75.4 %) had heard about HIV/AIDS, 66.1 % of truckers were having sexual relationship with casual partners. Only 14 (2%) were using condom regularly while sexual relationship with casual partners.\r\nConclusions: Education is backbone of any behavioral change as this is first process needed to reduce risk taking behavior of migration. Provision of syndrome management of STIs and HIV counseling is recommended at strategic points along major trucking routes to allow easy access to care and counseling.", "keywords": [ "Casual", "Condom", "Spouse", "Demography", "Medicine", "Environmental health", "Human immunodeficiency virus (HIV)", "Psychology", "Family medicine", "Sociology", "Political science" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.biomedscidirect.com/307/high_risk_sexual_partnerships_and_condom_use_among_truckers_entering_mumbai_city/archives" }, { "id": "https://openalex.org/W4313300465", "doi": "10.2139/ssrn.4314527", "title": "Drone Resupply with Multiple Trucks and Drones for On-Time Delivery Along Given Truck Routes", "year": 2022, "publication_date": "2022-01-01", "type": "preprint", "language": "en", "authors": [ "Wenqian Liu", "Lindong Liu", "Xiangtong Qi" ], "first_author": "Wenqian Liu", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Drone", "Truck", "Aeronautics", "Engineering", "Computer science", "Aerospace engineering", "Biology" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.4314527" }, { "id": "https://openalex.org/W4413974956", "doi": "10.1016/j.swevo.2025.102148", "title": "A bi-objective routing problem for cooperated trucks and drones in river water quality monitoring", "year": 2025, "publication_date": "2025-09-04", "type": "article", "language": "en", "authors": [ "Shuo Dang", "Zhihao Luo", "Zhong Liu", "Yuzhen Zhou", "Jianmai Shi" ], "first_author": "Shuo Dang", "venue": "Swarm and Evolutionary Computation", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Drone", "Truck", "Routing (electronic design automation)", "Quality (philosophy)", "Water quality", "Automotive engineering", "Computer network" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.swevo.2025.102148" }, { "id": "https://openalex.org/W4409764651", "doi": "10.1177/03611981251318338", "title": "Dynamic Freight Planning with Hybrid Cross-Docking under Carbon Tax and Bounded Storage Age", "year": 2025, "publication_date": "2025-04-24", "type": "article", "language": "en", "authors": [ "Atıl Kurt", "Mehmet Gümüş" ], "first_author": "Atıl Kurt", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "This paper discusses the dynamics of supply chain network optimization, specifically focusing on the role of cross-docking. As experienced by the disruptions of the COVID-19 era, external events can trigger supply chain interruptions, necessitating temporary storage solutions. The study examines a network with diverse suppliers, retailers, products, and hybrid cross-docking (HCD) facilities, wherein both transshipment and short-term inventory with restricted storage-age are permitted. Routing of goods from suppliers to retailers encompasses both direct paths and intermediate HCD points, involving multiple truck types. Importantly, all shipments are subject to a carbon tax, factoring in the imperative of mitigating carbon emissions. A dynamic mixed-integer linear programming model is formulated, alongside a greedy-type heuristic algorithm, to optimize the system’s total cost. Various computational experiments are used to evaluate the efficacy and solution quality of these methods. Extensive sensitivity analysis, complemented by statistical tests, dissects the impact of various model parameters within the computational experiments. Findings show that allowing storage at HCD facilities, with limited holding time, does not increase system-wide costs but instead bolsters supply chain flexibility. Moreover, carbon tax requires a shift in truck-type selection and plays an important role in reducing the total load-distance traveled, and, therefore, the total carbon emissions.", "keywords": [ "Supply chain", "Carbon tax", "Truck", "Transshipment (information security)", "Computer science", "Flexibility (engineering)", "Operations research", "Greedy algorithm", "Integer programming", "Greenhouse gas", "Holding cost", "Environmental economics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/20.500.12868/5128" }, { "id": "https://openalex.org/W2995228053", "doi": "10.1145/3368926.3369721", "title": "A New Variant of Truck Scheduling for Transporting Container Problem", "year": 2019, "publication_date": "2019-01-01", "type": "conference-paper", "language": "en", "authors": [ "Nguyen Van Son", "Pham Quang Dung" ], "first_author": "Nguyen Van Son", "venue": null, "publisher": null, "abstract": "We consider in this paper the truck scheduling for container transportation problem in which trucks and trailers are separate objects which can attach together for transporting containers. It is called Truck-Trailer-Container Routing Problem (TTCRP). In this context, trucks, trailers, and containers are located in different places. A truck can be scheduled to take a trailer, and then transports different containers from depots to customers or from customers to terminals or from terminals to customers or from customers to depots. In a planning, a truck can carry one 40ft container or two 20ft containers at a time. Moreover, in case of a long waiting time for unloading, a truck can be detached from a trailer at a customers and attached to another trailer for other itineraries. We describe the problem formulation and propose heuristics algorithms for solving large instances of the problem. We analyze the efficiency of the proposed algorithms in different problem instances.", "keywords": [ "Truck", "Trailer", "Container (type theory)", "Heuristics", "Computer science", "Scheduling (production processes)", "Vehicle routing problem", "Context (archaeology)", "Job shop scheduling", "Transport engineering", "Routing (electronic design automation)", "Operations research" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1145/3368926.3369721" }, { "id": "https://openalex.org/W4293721318", "doi": "10.5604/01.3001.0015.9177", "title": "Determination of Truck Maintenance Allocation Scheme Based on SA-GA", "year": 2022, "publication_date": "2022-06-30", "type": "article", "language": "en", "authors": [ "Jiandong Qiu", "Wei Ren", "Minan Tang", "Panpan Ma", "Yang Zhang" ], "first_author": "Jiandong Qiu", "venue": "Archives of Transport", "publisher": "Index Copernicus International S.A.", "abstract": "As an important department of railway transportation and production, large freight train depot is responsible for the regular overhaul and maintenance of railway trucks. The shunting operation of freight train depot covers the whole process of railway trucks entering, storing, overhauling and leaving the depot. It is an important step in the implemen-tation of the maintenance operation. Usually, shunting personnel in the depot transport the trucks to be overhauled to the maintenance line by relying on the shunting operation plan, which is the key to determine the shunting operation plan according to the distribution relationship between vehicles and maintenance. Firstly, this paper analyzes the process of centralized shunting operation in the freight train depot and the factors affecting the time-consuming based on the research idea of flexible workshop scheduling problem. Then, on the premise that the proportion of the weight coefficient will have an impact on the time-consuming of truck busy and shunting in the shunting process, and with the goal of minimizing the time-consuming of truck maintenance busy and shunting, the allocation model between trucks and maintenance lines is established; In addition, an improved genetic algorithm is proposed to solve the established model; Finally, combined with the maintenance of railway trucks in a large freight train depot, an example analysis is carried out on this basis. The results demonstrate that using simulated annealing genetic algorithm to solve the model can obtain the allocation scheme between railway trucks and maintenance operation line. Under the influence of three different coefficients, compared with genetic algorithm, simulated annealing genetic algorithm can reduce the deten-tion time of railway trucks in depot by 0.21%, 0.09% and 0.12% respectively, which is beneficial to reducing the deten-tion time of maintenance vehicles in depot, It plays a positive role in improving the maintenance efficiency of trucks in the depot, and also provides new ideas for the research of railway truck shunting operation.", "keywords": [ "Truck", "Shunting", "Scheduling (production processes)", "Transport engineering", "Genetic algorithm", "Engineering", "Operations research", "Process (computing)", "Computer science", "Automotive engineering", "Reliability engineering", "Operations management" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5604/01.3001.0015.9177" }, { "id": "https://openalex.org/W3016666592", "doi": "10.25394/pgs.12132867.v1", "title": "OPTIMIZATION MODELS AND ANALYSIS OF TRUCK-DRONE HYBRID ROUTING FOR LAST MILE DELIVERY", "year": 2020, "publication_date": "2020-04-17", "type": "dissertation", "language": "en", "authors": [ "Patchara Kitjacharoenchai" ], "first_author": "Patchara Kitjacharoenchai", "venue": "Purdue e-Pubs (Purdue University System)", "publisher": "Purdue University System", "abstract": "E-commerce and retail companies are seeking ways to cut delivery time and cost by exploring opportunities to use drones for making last-mile deliveries. In recent years, drone routing and scheduling have become a highly active area of research. This research addresses the concept of a truck-drone combined delivery by allowing autonomous drones to fly from delivery trucks, make deliveries, and fly to delivery trucks nearby. The first part of the research considers the synchronized truck drone routing model by allowing multiple drones to fly from any truck, serve customers and immediately return to any available truck or depot in the system. The goal is to find the optimal routes of both trucks and drones which minimize the arrival time of both trucks and drones at the depot after completing the deliveries. The problem can be solved by the formulated Mixed Integer Programming (MIP) for the small-size problems and our proposed heuristic called Adaptive Insertion Heuristics (ADI) which is based on the insertion technique for the medium/large-size problems. The second part of the research extends the first studied problem by allowing drones to serve multiple customers before merging with trucks as well as considering the capacity requirement for both vehicles. The problem is mathematically formulated and two efficient heuristic algorithms are designed to solve the large-size problems: Drone Truck Route Construction (DTRC) and Large Neighborhood Search (LNS). In the third study, the goal is to study the potential benefits of combining different types of fleet vehicles to deliver packages to the customers. Three types of vehicles are considered in this study including large drones, traditional trucks and hybrid trucks. The problem can be optimally solved by a mathematical formulation on a small scale. Two efficient metaheuristics based on Variable Neighborhood Search (VNS) and Large Neighborhood Search (LNS) are proposed to solve for approximate solutions of the large-size problems. A case study and numerical analysis demonstrate the better delivery time of the proposed model when compared with the delivery time of other delivery models with a single fleet type.", "keywords": [ "Drone", "Truck", "Heuristics", "Vehicle routing problem", "Integer programming", "Routing (electronic design automation)", "Heuristic", "Computer science", "Transport engineering", "Scheduling (production processes)", "Operations research", "Last mile (transportation)" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://figshare.com/articles/thesis/OPTIMIZATION_MODELS_AND_ANALYSIS_OF_TRUCK-DRONE_HYBRID_ROUTING_FOR_LAST_MILE_DELIVERY/12132867" }, { "id": "https://openalex.org/W2168595590", "doi": null, "title": "The design principles and success factors for the operation of cross dock facilities in grocery and retail supply chains", "year": 2004, "publication_date": "2004-12-01", "type": "dissertation", "language": "en", "authors": [ "John Joseph Vogt" ], "first_author": "John Joseph Vogt", "venue": "SUNScholar (Stellenbosch University)", "publisher": "Stellenbosch University", "abstract": "ENGLISH ABSTRACT: The dissertation reflects the research done on the design principles and success factors for the operation of cross dock facilities in grocery and retail supply chains. The cross dock is a particular facility in the supply chain where goods are received from suppliers, sorted without storage of the goods, and then efficiently moved to downstream customers. Cross docks are not a new operation. However, the use in high volume grocery and retail operational capabilities is poorly understood and is not uniquely defined. The problem is that cross docks are often seen as extensions of warehouses. The same personnel, systems and processes are applied and the efficiency potential of the cross dock is not achieved. Warehouses are orientated towards storing the full range of product and allowing the pick to be done from this storage buffer to provide any or all of these products to a customer. Cross docks will only handle products that are used in larger quantities and that are sent to most, if not all, the customers. The cross dock is therefore distinct and very different from the traditional warehouse. The published research tends to focus on the technical aspects of the cross dock layout. This research is primarily in the scheduling of the trucks into the yard of the facility; the allocation of trucks to specific doors of the facility; and the allocation of doors to receiving and despatch functions within the facility. Very little information or research reflects the design principles and success factors for the cross dock and its supply chain. The only classification of the cross dock in the literature is whether the barcode is added to the item before or after receipt at the cross dock. For this research work a literature survey was conducted and five major operations were reviewed, in South Africa and the USA. The research empirically drew logical conclusions, which were tested in the operations and found to be correct. This allowed the design principles and success factors to be determined for a successful cross dock. The research extends the knowledge of the cross dock operation and design: - • A new classification for the feasible types of cross docks in the supply chain was developed. Three factors are shown to be of primary importance: - o Where in the supply chain the identification of specific items for a customer is done; o Where the sort is done for the items to be delivered to a customer; and o Whether the supplier is providing one product or multiple products to the sort. From these three factors, eight potential classifications could be defined. However, only three practical types of cross dock can be determined from these eight alternatives. These are named in this research as Cross Dock Managed Load (CML); Joint Managed Load (JML); and the Supplier Managed Load (SML). The cross dock is far more effective than the warehouse when the total work (excluding inventory) is considered. The earlier in the supply chain the product is identified for the use of the entire downstream supply chain, the more effective will be the total supply chain. Thus the greatest supply chain effectiveness possible is with the SML, then the JML and finally the CML. • The operation of a cross dock is very similar to a continuous manufacturing process. There is no buffer of stock to decouple the inbound and outbound processes, and the operation takes place in a restricted area. However, in the retail chain, the workload alters with different orders and different days. Daily load differences vary by as much as 90%. This results in vastly different workloads and variations of throughput. This is similar to a batch operation with highly variable workloads between batches. The literature recommends the use of Just in Time (JIT) practice for cross docks. This is inappropriate as its primary requirements are continuous full volume operation and continuous small improvements to achieve a balanced operation. The most appropriate method of process improvement is the Theory of Constraints (TO C) and not JlT. • The management must have a detailed, disciplined approach. This implies standardised methods of operation, and a high degree of training. Equally there is the requirement for a special type of personnel to operate the cross dock. These operating personnel must be able to operate with precision (i.e. very low error rates) and be able to maintain this capability for continuous periods. • The systems required for a successful operation must include the capabilities of Yard Management, WMS for cross docking, Order Management with Advanced Shipping Notice (ASN) capability and Track and Trace across the supply chain. The items need to be identified by a barcode. The information required on the barcode will be determined by. the information systems capability of the least advanced service provider in the supply chain. If this service provider can receive and transmit all the data required for the supply chain from and to the other members, then the barcode need only be an identification number of the specific item. The data pertaining to the items is then passed from system to system in the supply chain. If data movement is not possible between all the parties in the entire supply chain, then the barcode must contain the information that will identify the item, the origin and the final delivery destination. If the items are delivered as part of a consignment, a further quantum of information is required to identify the total number of items in the consignment and the specific item within the consignment. • The research shows that the overall capability of the cross dock or its maximum capacity is the combination of the capability of the personnel and the cross dock design. Restrictions on either the personnel capability or the design of the cross dock, or both, severely reduces the effectiveness of the cross dock. • The previous research on the sequence of allocation of trucks to specific doors with", "keywords": [ "DOCK", "Business", "Retail trade", "Supply chain", "Retail industry", "Operations management", "Transport engineering", "Engineering", "Marketing", "Commerce", "Marine engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10019.1/50133" }, { "id": "https://openalex.org/W2969999343", "doi": "10.1016/j.trip.2019.100024", "title": "Innovative scenarios for modeling intra-city freight delivery", "year": 2019, "publication_date": "2019-08-24", "type": "article", "language": "en", "authors": [ "Amy M. Moore" ], "first_author": "Amy M. Moore", "venue": "Transportation Research Interdisciplinary Perspectives", "publisher": "Elsevier BV", "abstract": "There has been a shift in the focus of freight modeling to the short-haul (or last-mile) due to an increase in online shopping. This study considers innovative freight delivery modes and multi-modal shifts, especially for the last-mile portion of intra-city freight delivery. For this study, GPS data were obtained from a truck fleet from a major parcel delivery company's depot near Columbus, Ohio and used to develop a freight delivery demand estimation model. Freight delivery tours were modeled in TransCAD and used to develop scenarios to incorporate various modal shifts to compare energy usage in kilowatt-hour estimates. Innovative modes of freight delivery were considered for the scenarios and were compared to a class six truck: electric class six trucks, electric delivery vans, parcel delivery lockers, drones, and electric passenger vehicles. Initial findings suggest that electric trucks reduce energy usage when the majority of miles traveled are in the long-haul, or stem portion of the route. Parcel delivery lockers reduced energy usage in suburban areas, especially those with large neighborhoods with cul-de-sacs. The findings from this study were intended to provide decision makers, both in government and industry, with information to consider when determining suitable alternatives for energy-efficient intra-city freight transport.", "keywords": [ "Truck", "Transport engineering", "City logistics", "Last mile (transportation)", "Mile", "Traffic management", "Engineering", "Geography", "Automotive engineering" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trip.2019.100024" }, { "id": "https://openalex.org/W4391989784", "doi": "10.1299/jamdsm.2024jamdsm0021", "title": "Drone scheduling for parcel delivery with an access grade to stops on a fixed truck route", "year": 2024, "publication_date": "2024-01-01", "type": "article", "language": "en", "authors": [ "Kotaro YAMADA", "Yoshiyuki Karuno", "Riki Kataoka", "Sota SAWADA" ], "first_author": "Kotaro YAMADA", "venue": "Journal of Advanced Mechanical Design Systems and Manufacturing", "publisher": "Japan Society Mechanical Engineers", "abstract": "In this paper, we consider a parcel delivery scheduling problem of minimizing the total duration for a truck-drone distribution system to serve a given set of customers. The single carrier truck plays the role of a mobile depot of multiple identical drones, and the drones with unit capacity perform the last-mile delivery from the carrier truck to each customer. An ordered set of truck stops for launching/retrieving drones is also given, and it constitutes a fixed route of the carrier truck. For the last-mile delivery of a drone to a customer, the launching stop and the retrieving stop of the drone must be the same. We newly introduce an integral parameter of access grade to an underlying parcel delivery model in order to obtain a flight time bound for each customer. By the flight time bound as a threshold, the given set of truck stops is partitioned into two disjoint subsets, namely sets of nearer stops and of farther stops. The carrier truck is required to choose a stop from the set of nearer stops for launching a drone to each customer. The access grade of nearer stops yields a generalized parcel delivery model, since it involves the case with a sufficiently large bound on the flight time as the underlying parcel delivery model with no access restriction to truck stops. In this paper, we first review an integer programming (IP) formulation of the underlying parcel delivery model, and then we modify it into the generalized version with the access grade of nearer stops. We also conduct numerical experiments to demonstrate the solution quality of the generalized version by utilizing an IP solver, and report the results.", "keywords": [ "Drone", "Truck", "Last mile (transportation)", "Disjoint sets", "Scheduling (production processes)", "Computer science", "Delivery Performance", "Set (abstract data type)", "Integer programming", "Transport engineering", "Operations research", "Computer network" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.jstage.jst.go.jp/article/jamdsm/18/2/18_2024jamdsm0021/_pdf" }, { "id": "https://openalex.org/W2004172259", "doi": "10.1108/eum0000000000411", "title": "The Shortage of Truck Drivers in Japan", "year": 1992, "publication_date": "1992-03-01", "type": "article", "language": "en", "authors": [ "Yukio Ozawa", "Yutaka Karasawa", "Eiichi Moriya" ], "first_author": "Yukio Ozawa", "venue": "International Journal of Physical Distribution & Logistics Management", "publisher": "Emerald Publishing Limited", "abstract": "Japan suffers from a serious labour shortage, particularly in the carrier industry. Analyses the deviation between the demand and supply of truck drivers through a forecasting model based on multiple regression analysis. Proposes the following solutions: establish co‐operative terminals on a basis of regional economic blocks; design optimal sites of terminal depots; and promote both modal linkage and modal shift to arrange infrastructure.", "keywords": [ "Truck", "Economic shortage", "Linkage (software)", "Modal", "Business", "Regression analysis", "Terminal (telecommunication)", "Operations management", "Industrial organization", "Transport engineering", "Computer science", "Economics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/eum0000000000411" }, { "id": "https://openalex.org/W4401098706", "doi": null, "title": "MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH DRONE COLLABORATION IN HUMANITARIAN LOGISTIC", "year": 2023, "publication_date": "2023-12-23", "type": "article", "language": "en", "authors": [ "Zeynep Yüksel", "Dursun Emre Epcim", "Süleyman Mete" ], "first_author": "Zeynep Yüksel", "venue": "DergiPark (Istanbul University)", "publisher": "Istanbul University", "abstract": "Routing problems are used in many areas to obtain the most appropriate results in terms of time and cost. An attempt is made to address the issue by formulating mathematical models that incorporate multiple variables such as capacity, time, cost, and demand, tailored to the specific area of application. Natural disasters are one of these applications. In natural disasters, especially time management is a critical issue. For this reason, routing models play a crucial role in delivering aid to disaster victims and transporting disaster victims to hospitals. In this study, a mathematical model is proposed to be applied in post-disaster humanitarian aid logistics. The model, which aims to minimize the total distribution time, also considers the distribution of perishable commodities. Drones are integrated into this operational framework to facilitate the dissemination of perishable commodities. Thus, a new mathematical model for the multi-depot vehicle routing problem, which includes both truck-drone collaboration and perishable commodities, has been introduced to the literature. The proposed model is solved with an illustrative example using GAMS/CPLEX software and the results are tested.", "keywords": [ "Drone", "Vehicle routing problem", "Depot", "Routing (electronic design automation)", "Operations research", "Computer science", "Aeronautics", "Engineering", "Computer network", "Political science", "Law" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://dergipark.org.tr/en/download/article-file/3616334" }, { "id": "https://openalex.org/W2543630602", "doi": null, "title": "Using Measures of Agreement to Evaluate a Chronic Problem of Congestion in the Empty Container Depots", "year": 2016, "publication_date": "2016-10-25", "type": "article", "language": "en", "authors": [ "Rosmaizura Mohd Zain", "Mohd Nizam Ab Rahman", "Ainon Ramli", "Zulkifli Mohd Nopiah", "Nizaroyani Saibani" ], "first_author": "Rosmaizura Mohd Zain", "venue": "RePEc: Research Papers in Economics", "publisher": "Federal Reserve Bank of St. Louis", "abstract": "Container-based transportation through a combination of truck, rail and ocean shipping services has become an important part of supporting local and international cargo flows. However, congestion or bottlenecks of empty container-trucks may hinder the supply chain and logistics performance of the country in hinterland transport. The factors causing the bottlenecks of empty container-trucks at the depots around Port Klang, Malaysia, were first derived from interviews conducted with 30 participants working in different logistics companies. This paper intends to describe the application of Fleiss kappa to evaluate or validate the congestion factors and involves six experienced evaluators from the field of empty container logistics. Therefore, key steps and procedures are presented by extracting the qualitative data from a previous study that addressed this phenomenon. A resulting Fleiss generalised kappa value of 0.8203, which can be assumed as satisfactory and reflecting the strength of the congestion factors, as well as it demonstrated the real situation. Truly, Fleiss kappa has proved to be an efficient and useful approach to measure the agreements for many purposes, including validating the chronic congestion factors. Keywords: Interrater Agreement; Congestion; Empty Container-Truck JEL Classifications: L90, L91, L92", "keywords": [ "Container (type theory)", "Truck", "Port (circuit theory)", "Business", "Operations management", "Supply chain", "Traffic congestion", "Transport engineering", "Computer science", "Value (mathematics)", "Operations research", "Marketing" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://dergipark.org.tr/en/download/article-file/367411" }, { "id": "https://openalex.org/W2316580477", "doi": "10.1061/40630(255)64", "title": "Intermodal Transportation and Inland Depot Selection", "year": 2002, "publication_date": "2002-07-10", "type": "conference-paper", "language": "en", "authors": [ "Hamid Reza Ahadi" ], "first_author": "Hamid Reza Ahadi", "venue": null, "publisher": null, "abstract": "Since 1970's, freight transportation activities have seen fundamental changes in technology, operation, management and organization. In particular the increasing use of Intermodal transportation operation. A transportation carrier deliver products to its clients using containers in various transportation modes such as railcars, trucks, etc. After delivery and unloading by the customers, the empty containers are shipped back to a depot or warehouse designated by the carrier for subsequent shipment to other customers. After loading the new customer's products, the containers are transported directly to their destinations or through some intermediate depots. Under this type of logistic networks, containers spend a significant amount of time in empty movements. For example in the US rail system it is estimated that a railcar is empty during 40% of its average car cycle. A fundamental question is, given an inland logistic network, how should the carrier dispatch empty container to meet shipper's demand to relocate empty containers among depots and warehouses and to lease on/off vehicles in preparation for future demand. The purpose of this paper is to answer the above question by developing a decision support tool to assist transportation carriers in determining their inland network, the location and capacity of each depot and warehouse.", "keywords": [ "Truck", "Transport engineering", "Container (type theory)", "Lease", "Transshipment (information security)", "Destinations", "Business", "Operations research", "Computer science", "Engineering", "Tourism" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1061/40630(255)64" }, { "id": "https://openalex.org/W3014581560", "doi": "10.1051/matecconf/202031202004", "title": "Container depot location problem in the frame of the Polish part of the New Silk Road", "year": 2020, "publication_date": "2020-01-01", "type": "conference-paper", "language": "en", "authors": [ "Katarzyna Anna Kuźmicz", "Erwin Pesch" ], "first_author": "Katarzyna Anna Kuźmicz", "venue": "MATEC Web of Conferences", "publisher": "EDP Sciences", "abstract": "The Chinese project One Belt One Road, in Europe often referred to as the New Silk Road, triggers infrastructural investments enabling seamless transportation of goods on the Eurasian route. Since most of these goods are transported in containers, the optimal location of inland container depots, where containers wait for future repositioning after they had been emptied at the importers, is an interesting problem. In this paper conditions determining the optimal location of inland container depots in the Polish part of the NSR are analysed. They include proximity of container transhipment terminals located on the Polish stretch of the NSR, structure of highway network enabling distribution of containers by trucks to other destinations, as well as green aspects mainly referring to avoidance of city congestion caused by trucks transporting containers.", "keywords": [ "Container (type theory)", "Truck", "Transport engineering", "Destinations", "Frame (networking)", "Business", "Terminal (telecommunication)", "Computer science", "Engineering", "Telecommunications", "Geography", "Tourism" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.matec-conferences.org/articles/matecconf/pdf/2020/08/matecconf_eppm2018_02004.pdf" }, { "id": "https://openalex.org/W2335787999", "doi": null, "title": "In-truck cameras at Toll NQX", "year": 2016, "publication_date": "2016-02-01", "type": "article", "language": "en", "authors": [ "Greg Smith", "Sarah Bruyn Jones" ], "first_author": "Greg Smith", "venue": "DOAJ (DOAJ: Directory of Open Access Journals)", "publisher": null, "abstract": "Toll NQX is a business unit within Toll Group that specialises in long distance road freight solutions for Australia's northern routes. The operating environment is characterised by remoteness, harsh conditions, limited supporting infrastructure such as rest bays, and longer response times if things go wrong. Long distance, or `linehaul', operations utilise high productivity vehicles such as B-doubles and road trains. It is not unusual for vehicle combinations to weigh up to 130 tonnes and represent a million dollar investment. Typically, vehicles are loaded within Toll NQX depots (of which there are 24) by loading staff, leaving drivers fresh for the task of driving. Unlike pick-up and delivery work which has the inherent stimulus of multiple drop-offs, interaction with customers and urban traffic flows, linehaul driving involves long stretches of one, single task: driving.", "keywords": [ "Toll", "Transport engineering", "Truck", "Business", "Engineering", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doaj.org/article/bfeba58211a54f42820d57b717901bca" }, { "id": "https://openalex.org/W3212695509", "doi": null, "title": "Optimization for a truck scheduling problem in multi-door cross dokcing with learning effect and deteriorating jobs", "year": 2020, "publication_date": "2020-11-14", "type": "article", "language": "en", "authors": [ "Iman Seyedi", "Maryam Hamedi", "Reza R. Tavakkoli-Moghaddam" ], "first_author": "Iman Seyedi", "venue": null, "publisher": null, "abstract": "In general, each supply chain consists of three main stages of procurement, production and distribution. The use of the cross-docking system is a new strategy at the distribution stage to improve customer response time by moving products directly from pickup trucks to delivery trucks. Generally, for an activity to be done both machine and human resources are needed. Many researchers have already developed numerous planning methods for cross-docking systems, but human resource constraints have largely ignored. In this paper, for the first time, we examine the problem of truck scheduling in multi-door cross-dock considering the learning effects and the deterioration of tasks to fill the gap between theoretical planning models and what is happening in the real world. We have proposed a mixed integer programming model for this problem. According to the research literature, with increasing the size of the problem, the complexity of integer programming model is expanding rapidly so that the exact methods can hardly achieve the optimal solution. To solve large-scale problems, five meta-heuristic algorithms are used including Genetic Algorithms (GA), Imperial Competitive Algorithm (ICA), Keshtel Algorithm (KA), and Social Engineering Optimization (SEO). Finally, the numerical results obtained from all meta-heuristic algorithms are analyzed. We compare the meta- heuristic algorithms based on the best, average, Rpd and time criteria. As a result, the SEO and KA algorithm performed better than the other algorithms in terms of solution quality.", "keywords": [ "Truck", "Computer science", "Integer programming", "Job shop scheduling", "Mathematical optimization", "Scheduling (production processes)", "Operations research", "Algorithm", "Engineering", "Schedule", "Mathematics" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.trijournal.ir/article_119317.html?lang=en" }, { "id": "https://openalex.org/W4281716338", "doi": "10.1016/j.ejor.2022.06.004", "title": "The multiple traveling salesman problem in presence of drone- and robot-supported packet stations", "year": 2022, "publication_date": "2022-06-06", "type": "article", "language": "en", "authors": [ "Konstantin Kloster", "Mahdi Moeini", "Daniele Vigo", "Oliver Wendt" ], "first_author": "Konstantin Kloster", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Travelling salesman problem", "Drone", "Computer science", "Network packet", "Truck", "Robot", "Energy consumption", "Mathematical optimization", "Set (abstract data type)", "Algorithm", "Mathematics", "Artificial intelligence" ], "cited_by_count": 101, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0377221722004593" }, { "id": "https://openalex.org/W3111422325", "doi": "10.1016/j.cor.2020.105170", "title": "The traveling salesman problem with release dates and drone resupply", "year": 2020, "publication_date": "2020-12-16", "type": "article", "language": "en", "authors": [ "Juan C. Pina-Pardo", "Daniel F. Silva", "Alice E. Smith" ], "first_author": "Juan C. Pina-Pardo", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Travelling salesman problem", "Drone", "Computer science", "Operations research", "Traveling purchaser problem", "Mathematical optimization", "2-opt", "Mathematics", "Algorithm", "Biology", "Botany" ], "cited_by_count": 82, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2020.105170" }, { "id": "https://openalex.org/W4389486368", "doi": "10.1007/s11067-023-09611-1", "title": "Selective Backhauls in Truck Transport with Risk Mitigation: Large Belgian Retailer Case Study", "year": 2023, "publication_date": "2023-12-08", "type": "article", "language": "en", "authors": [ "Kenneth Stoop", "Mario Pickavet", "Didier Colle", "Pieter Audenaert" ], "first_author": "Kenneth Stoop", "venue": "Networks and Spatial Economics", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Profit (economics)", "Intuition", "Operations research", "Linear programming", "Vendor", "Computer science", "Business", "Mathematical optimization", "Transport engineering", "Microeconomics", "Economics" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s11067-023-09611-1" }, { "id": "https://openalex.org/W2905170691", "doi": "10.1109/itsc.2018.8569278", "title": "Cluster Analysis of On-Board-Unit Truck Big Data from the Brussels Capital Region", "year": 2018, "publication_date": "2018-11-01", "type": "conference-paper", "language": "en", "authors": [ "Giovanni Buroni", "Yann‐Aël Le Borgne", "Gianluca Bontempi", "Karl Determe" ], "first_author": "Giovanni Buroni", "venue": null, "publisher": null, "abstract": "Freight mobility significantly contributes to urban traffic congestion and atmospheric pollutants emission in European capitals [4], [10]. Understanding better the spatio-temporal dynamics of goods transportation could not only improve the freight system efficiency, but also return valuable information for policymakers. The paper focuses on the analysis of On-Board Unit (OBU) truck data to improve the understanding of freight movements in the Brussels Capital Region (BCR). The methodology relies on density-based spatial clustering of 30 days OBU data stored in a big data platform. The clustering algorithm identified four meaningful insights: (1) entry and (2) exit road segments in BCR, (3) base depots in the Brussels-Antwerp industrial axle and (4) the outer ring road segments crossing BCR boundaries. A visual and quantitative assessment of two clustering techniques are presented together with the implementation on a big data analytics platform.", "keywords": [ "Truck", "Cluster analysis", "Big data", "Axle", "Unit (ring theory)", "Computer science", "Transport engineering", "Cluster (spacecraft)", "Capital (architecture)", "Analytics", "Business", "Data science" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/itsc.2018.8569278" }, { "id": "https://openalex.org/W2294259353", "doi": "10.1016/j.ijpe.2016.03.005", "title": "Optimization of drayage operations with time-window constraints", "year": 2016, "publication_date": "2016-03-11", "type": "article", "language": "en", "authors": [ "Samaneh Shiri", "Nathan N. Huynh" ], "first_author": "Samaneh Shiri", "venue": "International Journal of Production Economics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Travelling salesman problem", "Container (type theory)", "Terminal (telecommunication)", "Tabu search", "Computer science", "Window (computing)", "Mathematical optimization", "Operations research", "Set (abstract data type)", "Mathematics", "Engineering" ], "cited_by_count": 85, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ijpe.2016.03.005" }, { "id": "https://openalex.org/W7162282956", "doi": "10.1016/j.tre.2026.104969", "title": "A two-echelon mobile charging system for electric vehicles with trucks and autonomous charging robots", "year": 2026, "publication_date": "2026-05-25", "type": "article", "language": "en", "authors": [ "Kechen Ouyang", "Yitong Yu", "Qingyun Tian", "David Z.W. Wang" ], "first_author": "Kechen Ouyang", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Mobile robot", "Truck", "Robot", "Synchronization (alternating current)", "Electric vehicle", "Routing (electronic design automation)" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2026.104969" }, { "id": "https://openalex.org/W2551735564", "doi": "10.5281/zenodo.1126248", "title": "A Quadratic Programming For Truck-To-Door Assignment Problem", "year": 2016, "publication_date": "2016-07-04", "type": "article", "language": "en", "authors": [ "Yahya Fathi", "B. Karimi", "Seyed Mohammad Javad Mirzapour Al-e-Hashem" ], "first_author": "Yahya Fathi", "venue": "Zenodo (CERN European Organization for Nuclear Research)", "publisher": "European Organization for Nuclear Research", "abstract": "Cross-docking includes receiving products supplied by a set of suppliers, unloading them from inbound trucks (ITs) at strip doors, consolidating and handling these products to stack doors based on their destinations, loading them into outbound trucks (OTs); then, delivering these products to customers. An effective assignment of the trucks to the doors would enhance the advantages of the cross-docking (e.g. reduction of the handling costs). This paper addresses the truck-to-door assignment problem in a cross-dock in which assignment of the ITs to the strip doors as well as assignment of the OTs to the stacks doors is determined so that total material handling cost in the cross-dock is minimized. Capacity constraints are applied for the ITs, OTs, strip doors, and stack doors. We develop a Quadratic Programming (QP) to formulate the problem. To solve it, the model is coded in LINGO software to specify the best assignment of the trucks to the doors.", "keywords": [ "Truck", "Quadratic assignment problem", "Quadratic programming", "Computer science", "Mathematical optimization", "Quadratic equation", "Operations research", "Mathematics", "Engineering", "Optimization problem", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5281/zenodo.1126248" }, { "id": "https://openalex.org/W3166291638", "doi": "10.1109/iciea52957.2021.9436698", "title": "A Discrete Event Simulation Model for Evaluating Inland Terminal's efficiency: A Case Study of Ladkrabang Inland Container Depot", "year": 2021, "publication_date": "2021-04-23", "type": "conference-paper", "language": "en", "authors": [ "Phipat Pimpanit", "Pisit Jarumaneeroj" ], "first_author": "Phipat Pimpanit", "venue": null, "publisher": null, "abstract": "An inland terminal, or dry port, is one of main facilities in the logistical network of maritime transportation as it helps provide access between hinterland and the rest of the world via the seaports. While the impact of these inland terminal on the efficiency of multimodal transportation has recently become more evident, it is relatively challenging to evaluate dry port's performance, as it typically involves with many operations performed by different gate operators with different numbers of container handling equipment (CHE). To properly evaluate dry port's performance, in this paper, a Discrete Event Simulation (DES) model is proposed and implemented in SIMIO modeling platform based on the current data of Ladkrabang Inland Container Depot (LICD), Thailand. According to our results, we have found that, currently, all CHE types at the LICD are not well utilized, especially the internal trucks, as the frequency of trains arriving at the LICD is still far too few. We also find that the utilization of CHE does not significant change as we vary the proportion of cargo transported by trains to trucks from 30:70 to 50:50, while maintaining total container flow. As such, we suggest that gate operators should form a CHE sharing agreement in order to improve CHE efficiency, and so the LICD's, which would be crucial for their survivability, especially after the post pandemic.", "keywords": [ "Train", "Truck", "Container (type theory)", "Port (circuit theory)", "Terminal (telecommunication)", "Discrete event simulation", "Transport engineering", "Computer science", "Bulk cargo", "Event (particle physics)", "Multimodal transport", "Operations research" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/iciea52957.2021.9436698" }, { "id": "https://openalex.org/W2806923761", "doi": null, "title": "Empty container management in depots before and after outsourcing of container inspection - A flow and cost related comparison", "year": 2018, "publication_date": "2018-01-01", "type": "dissertation", "language": "en", "authors": [ "Niclas Zachrisson", "Mathias Naperotti" ], "first_author": "Niclas Zachrisson", "venue": "Chalmers Publication Library (Chalmers University of Technology)", "publisher": "Chalmers University of Technology", "abstract": "The purpose of this study is to assess the effects on the process of returning empty containers to depots in regards of if the inspection is performed in-house or outsourced to third-party actor located near the depot. This report is based on a case study that includes review of relevant literature, semi-structured interviews and a time study. Three semi-structured interviews have been conducted with representatives from key actors involved in the process of empty container returns to the depot, and a time study was carried out at the depot and container inspection site. Time measurements were carried out with a scientific proof smartphone application called Star Driver that record measurements made by the researchers. The measurements were then collected in an Excel sheet by Star Driver.\\nThe studied depot operator’s first arrangement consisted of an inspection of empty containers and administration at the gate to the depot. The in-house inspection meant longer turnaround time since the administration and inspection was performed by the same actor, which also led to a lower quality of the inspection. Turnaround time refers to the time from arrival at the gate of the depot until the truck exits the depot. The depot operator then introduced a new arrangement which meant that containers were inspected at a different location near the depot. As a result, from outsourcing, personnel with special training carry out the inspection that leads to both decreased inspection time and higher quality of the inspection.\\nThe results demonstrate that an outsourced inspection could lead to shorter turnaround times and more efficient flows can be obtained. Additionally, an increased efficiency is achieved in the gate of the depot and for the inspection activity.", "keywords": [ "Outsourcing", "Container (type theory)", "Operations management", "Turnaround time", "Depot", "Quality (philosophy)", "Engineering", "Operator (biology)", "Computer science", "Manufacturing engineering", "Operations research", "Transport engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "http://studentarbeten.chalmers.se/publication/255071-empty-container-management-in-depots-before-and-after-outsourcing-of-container-inspection-a-flow-and" }, { "id": "https://openalex.org/W4293214587", "doi": "10.2139/ssrn.4197952", "title": "Integrated Forward and Reverse Cross-Docking with Vehicle Routing and Scheduling Problem: Two Inspection Strategies and a Genetic-Mathematic Algorithm", "year": 2022, "publication_date": "2022-01-01", "type": "preprint", "language": "en", "authors": [ "Ali Rahbari", "Mohammad Mahdi Nasiri", "Fariborz Jolai", "Dinçer Konur" ], "first_author": "Ali Rahbari", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Vehicle routing problem", "Computer science", "Scheduling (production processes)", "Genetic algorithm", "Docking (animal)", "Algorithm", "Mathematical optimization", "Routing (electronic design automation)", "Mathematics", "Machine learning", "Embedded system", "Medicine" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.4197952" }, { "id": "https://openalex.org/W286568406", "doi": null, "title": "Preliminary assessment of the health and environmental impacts of transporting M55 rockets from Lexington-Blue Grass Depot activity, Anniston Army depot, and Umatilla depot activity to alternative disposal facilities", "year": 1986, "publication_date": "1986-03-01", "type": "article", "language": "en", "authors": [ "S.A. Carnes", "James E. Breck", "E.D. Copenhaver", "P.R. Coleman", "Guy D. Griffin", "Edward L. Hillsman", "Mary Holcomb", "P.E. Johnson", "F.C. Kornegay", "Barry Peterson" ], "first_author": "S.A. Carnes", "venue": "OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)", "publisher": "Office of Scientific and Technical Information", "abstract": "This assessment discusses the potential health and environmental impacts of transporting M55 rockets filled with nerve agent GB or VX from various existing Army storage depots to alternative Army depots for disposal. The origin depots include Anniston Army Depot in Alabama, Lexington-Blue Grass Depot Activity in Kentucky, and Umatilla Depot Activity in Oregon. The destination depots include Pine Bluff Arsenal in Arkansas, Tooele Army Depot in Utah, and the facility on Johnston Island in the central Pacific Ocean. This assessment considers the possible impacts of normal transport operations and of two postulated accident scenarios on the air quality, ground and surface water, aquatic ecology, terrestrial ecology, human health, and cultural and socioeconomic resources of the various transport corridors involved. The impacts of these scenarios are assessed for truck, train, and air transport for each orgin-destination pair. The analysis considers three basic scenario during transport: (1) normal operations with no atmospheric release of nerve agent; (2) a minor agent spill (the contents of one rocket being released to the biosphere); and (3) a worst-case accident involving the release of a large, specified quantity of nerve agent to the biosphere. The extremely low probabilities of such accidents, which are reported elsewhere, aremore » noted.« less", "keywords": [ "Depot", "Environmental science", "Air quality index", "Environmental engineering", "Environmental protection", "Geography", "Archaeology", "Meteorology" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.osti.gov/scitech/biblio/5940837" }, { "id": "https://openalex.org/W4313549106", "doi": "10.1109/scisisis55246.2022.10002027", "title": "Drone Scheduling for Parcel Delivery with a Given Truck Route and Setup Times", "year": 2022, "publication_date": "2022-11-29", "type": "conference-paper", "language": "en", "authors": [ "Riki Kataoka", "Yoshiyuki Karuno", "Hitoshi Iima" ], "first_author": "Riki Kataoka", "venue": "2022 Joint 12th International Conference on Soft Computing and Intelligent Systems and 23rd International Symposium on Advanced Intelligent Systems (SCIS&ISIS)", "publisher": null, "abstract": "We consider a parcel delivery scheduling problem for a truck-drone distribution system. The single carrier truck plays the role of a mobile depot, and traverses in one direction a given route with some points to stop for launching/retrieving drones. The multiple identical drones are dispatched for the last-mile delivery of a parcel from the carrier truck to each of customers. In this paper, we introduce two kinds of setup times at truck stops on given routes to the underlying model, and propose a genetic search based heuristic algorithm with a modified version of a well-known list scheduling procedure, called LPT (Longest Processing Time first) rule. We also conduct numerical experiments to demonstrate the performance of the proposed heuristic, and report the results.", "keywords": [ "Drone", "Truck", "Computer science", "Scheduling (production processes)", "Heuristic", "Job shop scheduling", "Real-time computing", "Simulation", "Computer network", "Mathematical optimization", "Engineering", "Automotive engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "http://dx.doi.org/10.1109/scisisis55246.2022.10002027" }, { "id": "https://openalex.org/W2326045072", "doi": "10.1109/icwt.2015.7449260", "title": "Optimizing the utilization of container truck transportation", "year": 2015, "publication_date": "2015-11-01", "type": "conference-paper", "language": "en", "authors": [ "Feisy Diane Kambey", "Jane Ivonne Litouw" ], "first_author": "Feisy Diane Kambey", "venue": null, "publisher": null, "abstract": "The crowdedness of transportation of containers made multi-depot and multi-terminal necessary in the system design. To optimize the route of container truck, Ant Colony Optimization (ACO) is proposed in this paper. In managing route of the truck, ACO works to decrease the number of container from 10 to 4 truck which imply to reduce the consumption of gasoline. There are several algorithm of ACO that are used to find the optimal routing of the container which are Ant system (AS), Elitist Ant System (EAS), Max-Min Ant System (MMAS), Rank-Based Ant System and Ant Colony System (ACS). The results of simulation show that Rank-Based Ant System has the best time over all methods for this transportation problem.", "keywords": [ "Ant colony optimization algorithms", "Truck", "Container (type theory)", "Computer science", "Ant colony", "Travelling salesman problem", "Vehicle routing problem", "Routing (electronic design automation)", "ANT", "Operations research", "Automotive engineering", "Engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/icwt.2015.7449260" }, { "id": "https://openalex.org/W2067737709", "doi": "10.1289/ehp.00108213", "title": "Airborne concentrations of PM(2.5) and diesel exhaust particles on Harlem sidewalks: a community-based pilot study.", "year": 2000, "publication_date": "2000-03-01", "type": "article", "language": "en", "authors": [ "Patrick L. Kinney", "Maneesha Aggarwal", "Mary Evelyn Northridge", "Nicole Janssen", "P Shepard" ], "first_author": "Patrick L. Kinney", "venue": "Environmental Health Perspectives", "publisher": "National Institute of Environmental Health Sciences", "abstract": "Residents of the dense urban core neighborhoods of New York City (NYC) have expressed increasing concern about the potential human health impacts of diesel vehicle emissions. We measured concentrations of particulate matter [less than/equal to] 2.5 micro in aerodynamic diameter (PM(2.5)) and diesel exhaust particles (DEP) on sidewalks in Harlem, NYC, and tested whether spatial variations in concentrations were related to local diesel traffic density. Eight-hour (1000-1800 hr) air samples for PM(2.5 )and elemental carbon (EC) were collected for 5 days in July 1996 on sidewalks adjacent to four geographically distinct Harlem intersections. Samples were taken using portable monitors worn by study staff. Simultaneous traffic counts for diesel trucks, buses, cars, and pedestrians were carried out at each intersection on [Greater/equal to] 2 of the 5 sampling days. Eight-hour diesel vehicle counts ranged from 61 to 2,467 across the four sites. Mean concentrations of PM(2.5) exhibited only modest site-to-site variation (37-47 microg/m(3)), reflecting the importance of broader regional sources of PM(2.5). In contrast, EC concentrations varied 4-fold across sites (from 1.5 to 6 microg/m(3)), and were associated with bus and truck counts on adjacent streets and, at one site, with the presence of a bus depot. A high correlation (r = 0.95) was observed between EC concentrations measured analytically and a blackness measurement based on PM(2.5) filter reflectance, suggesting the utility of the latter as a surrogate measure of DEP in future community-based studies. These results show that local diesel sources in Harlem create spatial variations in sidewalk concentrations of DEP. The study also demonstrates the feasibility of a new paradigm for community-based research involving full and active partnership between academic scientists and community-based organizations.", "keywords": [ "Aerodynamic diameter", "Particulates", "Environmental science", "Diesel fuel", "Diesel exhaust", "Air pollution", "Truck", "Atmospheric sciences", "Environmental engineering", "Animal science", "Chemistry", "Waste management" ], "cited_by_count": 249, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ehp.niehs.nih.gov/doi/epdf/10.1289/ehp.00108213" }, { "id": "https://openalex.org/W3156267067", "doi": "10.5377/nexo.v34i01.11284", "title": "Design and development of the trailers optimal allocation and schedule model in the supply chain system with considering cross dock with stochastic planning", "year": 2021, "publication_date": "2021-04-13", "type": "article", "language": "en", "authors": [ "Javad Khamisabadi", "Mohammad Reza Kabaranzad Ghadim", "Hasan Ali Aghajani Kasegar", "Mohammad Mahdi Movahedi" ], "first_author": "Javad Khamisabadi", "venue": "Nexo Revista Científica", "publisher": "Universidad Nacional de Ingeniería", "abstract": "Todays, transportation, and logistics engineering processes are among the important issues of organizations in the competitive market. Considering the logistical structure of the logistics engineering and the more attention paid to the logistical tools and, in particular, such as the use of these tools, such as containers (pallets, containers, etc.), transportation equipment (trailer, forklift trucks, etc.), and The art of building the supply and distribution network concerning the main warehouses, cross-dock, and temporary storage, is one of the most critical and contemplative cases. In fact, all these tools work together to maximize system efficiency in the field of logistics concerning the leading impact indicators, including the time of shipment (loading, disloading, the allocation of trailers, etc.). This paper's main goal is to present and develop a mathematical model of trailer schedule planning in possible conditions in the cross-dock. In fact, the main function of this mathematical model is to minimize the total time of the logistics process from the stage of emptying the pallets from the materials producers in the cross docks and assigning the trailer to the door, and finally reloading the pallets to be distributed to the production sites. To solve this model and to analyze the outputs, mixed integer programming was used by GAMS software.", "keywords": [ "Pallet", "Schedule", "Truck", "Supply chain", "Trailer", "Computer science", "Operations research", "Process (computing)", "Integer programming", "Production (economics)", "Transport engineering", "Engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.camjol.info/index.php/NEXO/article/download/11284/13137" }, { "id": "https://openalex.org/W4294275288", "doi": "10.1007/s12351-022-00737-7", "title": "A safety-driven truck loading problem", "year": 2022, "publication_date": "2022-09-02", "type": "article", "language": "en", "authors": [ "Konstantinos N. Androutsopoulos", "Eleni Karouti" ], "first_author": "Konstantinos N. Androutsopoulos", "venue": "Operational Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Axle", "Flexibility (engineering)", "Computer science", "Weight distribution", "Axle load", "Automotive engineering", "Engineering", "Structural engineering", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s12351-022-00737-7" }, { "id": "https://openalex.org/W7168344819", "doi": "10.1016/j.ssci.2026.107341", "title": "Collaborative truck-drone delivery optimization in humanitarian logistics for vulnerable populations: An improved adaptive large neighborhood search", "year": 2026, "publication_date": "2026-07-15", "type": "article", "language": "en", "authors": [ "Sang Jin Kweon", "Yuseon Yun", "Taeyeop Kang", "Shivam Shrivastava", "Hyeong Suk Na" ], "first_author": "Sang Jin Kweon", "venue": "Safety Science", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Humanitarian Logistics", "Metropolitan area", "Equity (law)", "Natural disaster", "Drone", "Service (business)", "Routing (electronic design automation)", "Vehicle routing problem", "Emergency management", "Solver" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ssci.2026.107341" }, { "id": "https://openalex.org/W3006984451", "doi": "10.1016/j.promfg.2020.01.338", "title": "Vehicle Routing Problem with Drones for Last Mile Delivery", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Patchara Kitjacharoenchai", "Seokcheon Lee" ], "first_author": "Patchara Kitjacharoenchai", "venue": "Procedia Manufacturing", "publisher": "Elsevier BV", "abstract": "E-commerce and retail companies are seeking ways to cut delivery times and costs by exploring opportunities to use drones for making last mile delivery deliveries. In recent years, drone routing and scheduling has become a highly active area of research. This research addresses the delivery concept of a truck-drone combination along with the idea of allowing autonomous drones to fly from delivery trucks, make deliveries, and fly to delivery trucks nearby. The proposed model considers the synchronized truck drone routing model by allowing multiple drones to fly from a truck, serve customers and immediately return to the same truck for the battery swap and package retrieval. The model also takes into account both trucks and drones capacities to ensure that the amount of loads carried by each drone must not exceed its capacity and the total amount of loads in each delivery route must be less than truck’s capacity. The goal is to find the optimal routes of both trucks and drones which minimize the total arrival time of both trucks and drones at the depot after completing the deliveries. The problem can be solved by the formulated mixed integer programming (MIP) for the small size problem. Numerical results in the case study and benchmark problems are presented to show the delivery time improvement over the delivery time from other delivery types.", "keywords": [ "Drone", "Truck", "Routing (electronic design automation)", "Swap (finance)", "Computer science", "Scheduling (production processes)", "Integer programming", "Vehicle routing problem", "Transport engineering", "Mile", "Last mile (transportation)", "Operations research" ], "cited_by_count": 28, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2351978920304054/pdf" }, { "id": "https://openalex.org/W3097153424", "doi": "10.1016/j.cor.2020.105127", "title": "An exact solution method for the TSP with Drone based on decomposition", "year": 2020, "publication_date": "2020-11-02", "type": "article", "language": "en", "authors": [ "Sebastián A. Vásquez", "Gustavo Angulo", "Mathias A. Klapp" ], "first_author": "Sebastián A. Vásquez", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Travelling salesman problem", "Drone", "Truck", "Decomposition", "Computer science", "Mathematical optimization", "Integer programming", "Integer (computer science)", "Routing (electronic design automation)", "Set (abstract data type)", "Vehicle routing problem", "Decomposition method (queueing theory)" ], "cited_by_count": 99, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2020.105127" }, { "id": "https://openalex.org/W2895954417", "doi": "10.1016/j.cie.2018.10.037", "title": "Solving the Feeder Vehicle Routing Problem using ant colony optimization", "year": 2018, "publication_date": "2018-10-22", "type": "article", "language": "en", "authors": [ "Ying‐Hua Huang", "Carola Alejandra Blazquez", "Shan-Huen Huang", "Germán Paredes-Belmar", "Guillermo Latorre-Núñez" ], "first_author": "Ying‐Hua Huang", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Vehicle routing problem", "Ant colony optimization algorithms", "Benchmark (surveying)", "Routing (electronic design automation)", "Heuristic", "Computer science", "Mathematical optimization", "Frame (networking)", "Engineering", "Operations research", "Automotive engineering" ], "cited_by_count": 73, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2018.10.037" }, { "id": "https://openalex.org/W2886967978", "doi": "10.1016/j.endm.2018.07.031", "title": "A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks", "year": 2018, "publication_date": "2018-08-01", "type": "article", "language": "en", "authors": [ "Ali Ghezelsoflu", "Massimo Di Francesco", "Paola Zuddas", "Antonio Frangioni" ], "first_author": "Ali Ghezelsoflu", "venue": "Electronic Notes in Discrete Mathematics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Shortest path problem", "Container (type theory)", "Port (circuit theory)", "Integer (computer science)", "Mathematical optimization", "Graph", "Integer programming", "Set (abstract data type)", "Computer science", "Mathematics", "Operations research" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/11568/912969" }, { "id": "https://openalex.org/W2060499110", "doi": "10.1121/1.2933565", "title": "Sound perception of urban delivery trucks", "year": 2008, "publication_date": "2008-05-01", "type": "conference-abstract", "language": "en", "authors": [ "Florence Manca-Demirdjian", "Étienne Parizet" ], "first_author": "Florence Manca-Demirdjian", "venue": "The Journal of the Acoustical Society of America", "publisher": "Acoustical Society of America", "abstract": "The study deals with the annoyance of urban delivery trucks noises. Sound sequences of two lorries were recorded during a typical delivery : a commercial one and a prototype specially designed to reduce sound emissions. Various sources could be heard during these sequences (engine, doors, hydraulic rear doors). These recordings (the duration of which being more than 5 minutes) were evaluated by subjects in a sound proofed room by two methods. The first one was a continuous assessment of sequences : the listeners had to continuously assess their annoyance by moving a cursor sliding along a five levels graduated scale (from \"not at all annoying\" to \"extremely annoying\"). The second one was an overall evaluation (using the same scale) of each event of the sequences (for example : the arrival of the truck, or the closing of the driver's door, etc...). The comparison of the results obtained from these two methods for both lorries will be presented, as well as the reduction of the annoyance could be realized on the prototype.", "keywords": [ "Truck", "Doors", "Annoyance", "Closing (real estate)", "Computer science", "Sound (geography)", "Acoustics", "Simulation", "Transport engineering", "Engineering", "Automotive engineering", "Computer vision" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1121/1.2933565" }, { "id": "https://openalex.org/W4416757666", "doi": "10.1016/j.cor.2025.107343", "title": "Two-echelon optimization framework for semi-autonomous truck platooning in container drayage", "year": 2025, "publication_date": "2025-11-28", "type": "article", "language": "en", "authors": [ "Zhaojie Xue", "Wenxiang Peng", "Jialu Zhang", "Rui Chen" ], "first_author": "Zhaojie Xue", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Container (type theory)", "Truck", "Platoon", "Tabu search", "Component (thermodynamics)", "Resource (disambiguation)", "Public transport", "Integer programming" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2025.107343" }, { "id": "https://openalex.org/W4301913142", "doi": null, "title": "Sound perception of urban delivery trucks", "year": 2008, "publication_date": "2008-06-01", "type": "conference-paper", "language": "en", "authors": [ "Florence Manca-Dermidjian", "Étienne Parizet" ], "first_author": "Florence Manca-Dermidjian", "venue": "HAL (Le Centre pour la Communication Scientifique Directe)", "publisher": "Centre National de la Recherche Scientifique", "abstract": "International audience", "keywords": [ "Truck", "Sound (geography)", "Perception", "Computer science", "Transport engineering", "Acoustics", "Engineering", "Psychology", "Automotive engineering", "Physics" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hal.science/hal-00418546" }, { "id": "https://openalex.org/W4390651022", "doi": "10.1007/s12597-023-00714-4", "title": "Modelling and solving a real-world truck-trailer scheduling problem in container transportation with separate moving objects", "year": 2024, "publication_date": "2024-01-07", "type": "article", "language": "en", "authors": [ "Van Son Nguyen", "Quang Dung Pham", "Thanh Trung Huynh" ], "first_author": "Van Son Nguyen", "venue": "OPSEARCH", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Computer science", "Container (type theory)", "Trailer", "Operations research", "Vehicle routing problem", "Scheduling (production processes)", "Integer programming", "Operator (biology)", "Routing (electronic design automation)", "Mathematical optimization", "Engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://infoscience.epfl.ch/handle/20.500.14299/204895" }, { "id": "https://openalex.org/W4386057915", "doi": "10.21512/comtech.v14i1.8397", "title": "A Robust Optimizing Reverse Logistics Model for Beef Products Using Multi Depot Vehicle Routing Problem", "year": 2023, "publication_date": "2023-05-08", "type": "article", "language": "en", "authors": [ "Paduloh Paduloh", "Taufik Djatna" ], "first_author": "Paduloh Paduloh", "venue": "ComTech Computer Mathematics and Engineering Applications", "publisher": "Bina Nusantara University", "abstract": "Beef is a perishable product and requires special handling. Demand for beef also fluctuates quite high and is heavily influenced by various religious events and traditions in Indonesia. Under these conditions, for various reasons, beef products are returned from customers to distributors. An increase in the number of products returned from customers leads to high costs and the risk of product damage. The research created an optimization model for product distribution and product recall from customers with minimal costs and risks. The research applied a clustering method using the Density-Based Spatial Clustering (DBSCAN) algorithm to determine the density of customers’ locations and the number of orders. Optimization of distance and distribution and withdrawal costs applied Multi Depot Vehicle Routing Problem (MDVRP) and Mixed Integer Linear Programming (MILP) mathematical modeling. The results indicate three customer clusters with one noise, with the most potential customers in cluster 1. From this condition, product delivery optimization is based on the distance and number of shipments from the two central warehouses. Optimization uses of MDVRP and MILP to model and make company-owned trucks more profitable at high rental truck replacement costs. The research produces a robust model for changes in the truck number and capacity based on sensitivity analysis.", "keywords": [ "Truck", "Vehicle routing problem", "Cluster analysis", "Computer science", "Product (mathematics)", "DBSCAN", "Reverse logistics", "Renting", "Routing (electronic design automation)", "Operations research", "Integer programming", "Business" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://journal.binus.ac.id/index.php/comtech/article/download/8397/4754" }, { "id": "https://openalex.org/W3002844972", "doi": "10.1007/978-3-030-34960-8_26", "title": "A New Formulation of the Single Door Truck Scheduling Problem", "year": 2019, "publication_date": "2019-01-01", "type": "book-chapter", "language": "en", "authors": [ "Maria Flavia Monaco", "Marcello Sammarra" ], "first_author": "Maria Flavia Monaco", "venue": "AIRO Springer series/AIRO Springer Series", "publisher": "Springer International Publishing", "abstract": null, "keywords": [ "Truck", "Scheduling (production processes)", "Computer science", "Job shop scheduling", "Mathematical optimization", "Operations research", "Engineering", "Automotive engineering", "Computer network", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-030-34960-8_26" }, { "id": "https://openalex.org/W2996614551", "doi": "10.37432/jieph.2018.1.1.10", "title": "Uptake of HIV testing and its associated factors among long-distance truck drivers in Zambia, 2015", "year": 2018, "publication_date": "2018-11-13", "type": "article", "language": "en", "authors": [ "Lwito Salifya Mutale", "Mumbi Chola", "Gershom Chongwe", "Webster Kasongo", "David Kasanga Mwakazanga", "Maurice Omondi Owiny", "Olufemi Olamide Ajumobi", "Choolwe Nkwemu Jacobs" ], "first_author": "Lwito Salifya Mutale", "venue": "Journal of Interventional Epidemiology and Public Health", "publisher": "African Field Epidemiology Network", "abstract": "Background: Globally, long distance truckers have been reported to have an important role in the spread of sexually transmitted infections (STIs) including Human Immunodeficiency Virus (HIV). Evidence on the uptake of HIV testing among this key population is not well established. We analysed the 2015 Behavioral Surveillance Survey (BSS) data to determine the uptake of HIV testing and assess factors associated with HIV testing among Long Distance Truck Drivers (LDTDs) in Zambia. Methods: We analysed secondary data from the 2015 BSS. The BSS was carried out in five of the 10 Corridors of Hope (COH) III project sites (Kazungula, Solwezi, KapiriMposhi, Chipata and Chirundu) among male LDTDs. The Zambian Corridors of Hope HIV and AIDS Prevention Initiative project was formed to address rising rates of HIV and other sexually transmitted infections. The BSS study included LDTDs from truck depots, border sites, Zambia Revenue Authority offices and those parked along the road side. Association between independent variables and history of HIV testing was determined by bivariate logistic analysis. Multivariable logistic regression was done to control for confounders. Results: Overall, 1,386 male LDTDs were included in the study, with mean age of 38 years. Over 75% reported being currently married and living with a spouse while 82% reported having only one wife. Uptake for ever having tested for HIV among LDTDs was 83%. Having a relative or friend who was infected or who had succumbed to HIV/AIDS (adjusted OR: 0.61, 95%CI: 0.40 – 0.92) and having two or more wives (adjusted OR: 0.4, 95%CI: 0.2 – 0.6) were independent inhibitory factors for uptake of HIV testing. Conclusion: Knowledge of someone infected or died of HIV and having at least two wives were drivers for HIV testing. These findings suggest the need to implement focused Behavioral Change interventions and messages to increase uptake of HIV testing among LDTDs.", "keywords": [ "Truck", "Human immunodeficiency virus (HIV)", "Transport engineering", "Environmental health", "Medicine", "Demographic economics", "Virology", "Engineering", "Automotive engineering", "Economics" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.37432/jieph.2018.1.1.10" }, { "id": "https://openalex.org/W651782119", "doi": null, "title": "COMPARISONS OF EMISSIONS AND ENERGY USE FOR TRUCK AND RAIL", "year": 1991, "publication_date": "1991-01-01", "type": "article", "language": "en", "authors": [ "W G Blevins", "A W Gibson" ], "first_author": "W G Blevins", "venue": null, "publisher": null, "abstract": "There has been comparatively little published information on the relative energy-efficiency and emission levels of trucks and railways. What little has appeared in print has tended to look at aggregate figures for the two industries, including types of movement for which there is little intermodal competition such as urban deliveries and unit trains of bulk commodities. This sheds little light on the potential to reduce fuel usage and emissions by shifting traffic between the modes. This paper presents figures for the types of movement where the two modes do compete, based on locomotive engine tests, typical truck fuel consumptions, and emission regulations. A variety of railway technologies and truck configurations are examined, representative of the range of equipment in service. Railway equipment includes several Trailer-on-Flatcar and Container-on- Flatcar configurations, as well as conventional carload equipment to serve as a benchmark. Truck configurations include single and double-48-foot (14.65 m) trailers. The analysis covers a representative route across Canada. Three time periods are examined, representative of the recent past, the present, and the future, to give an indication of trends, since technology and operating methods continue to evolve and affect energy use and emissions for both modes. The conclusions are that the railways can move competitive traffic at a fuel saving typically in the range of 65 to 70 percent compared with trucks, and that this advantage will be largely maintained in the future, even in the face of extreme truck configurations such as turnpike doubles. The railways also generate similar reductions in carbon dioxide emissions. For the other major pollutant from diesel engines, NOx, the railways currently show a saving in the range of 30 to 50 percent per net tonne-kilometre, which would be eroded somewhat but by no means eliminated by turnpike doubles. (A) For the covering abstract of the conference see IRRD Abstract no. 807788.", "keywords": [ "Truck", "Transport engineering", "Train", "Trailer", "Range (aeronautics)", "Engineering", "Container (type theory)", "Track (disk drive)", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/379697" }, { "id": "https://openalex.org/W2048178464", "doi": "10.1016/0191-2607(79)90048-7", "title": "The small package air freight industry in the United States: A review of the federal express experience", "year": 1979, "publication_date": "1979-08-01", "type": "article", "language": "en", "authors": [ "Yupo Chan", "Ronny J. Ponder" ], "first_author": "Yupo Chan", "venue": "Transportation Research Part A General", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Service (business)", "Business", "Scale (ratio)", "Due diligence", "Air cargo", "Transport engineering", "Air transport", "License", "Marketing", "Industrial organization", "Finance" ], "cited_by_count": 41, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/0191-2607(79)90048-7" }, { "id": "https://openalex.org/W3044626086", "doi": "10.5814/j.issn.1674-764x.2020.04.006", "title": "Comparative Life Cycle Assessment of Two Types of Truck Bumper Produced in the Algerian Auto Industry", "year": 2020, "publication_date": "2020-07-24", "type": "article", "language": "en", "authors": [ "Kebbouche Zahia", "Abdelaziz Tairi", "Brahim Safi" ], "first_author": "Kebbouche Zahia", "venue": "Journal of Resources and Ecology", "publisher": null, "abstract": "Currently, the reduction of weight in automotive is a very important topic to reduce the air pollution. In this context, the purpose of the present paper is to analyze a real case study through a comparison of the environmental impacts between a conventional steel bumper and a polyester prototype. In the first part of this work, a door-to-door life-cycle assessment methodology was used throughout the study of the component manufacturing phase. The SimaPro 7.1 software is used to evaluate the impacts of both bumpers on the environment and health. The second part is devoted to dust analysis from the polyester workshop. The obtained results have allowed us to show the company that its choice of steel substitution by the polyester is advantageous for certain impacts including the impact of climate change, but unfortunately there may be, given the working conditions of the polyester workshop, a transfer of impact, since we will end up with a risk of health (irritations, cancers) for the workers. LCA has proven to be a very useful tool for validating a redesigned automotive component from an environmental point of view; from this case study, several recommendations were made for the company to design environmentally friendly components, and ecodesign should be introduced into the company's procedures.", "keywords": [ "Automotive industry", "Truck", "Context (archaeology)", "Ecodesign", "Life-cycle assessment", "Component (thermodynamics)", "Environmental impact assessment", "Work (physics)", "Aerospace", "Computer science", "Manufacturing engineering", "Engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5814/j.issn.1674-764x.2020.04.006" }, { "id": "https://openalex.org/W7160521201", "doi": "10.3390/en19092237", "title": "Energy Optimization in Fuel Depots: A System-of-Systems Review of Cyber–Physical–Human–Institutional Integration", "year": 2026, "publication_date": "2026-05-06", "type": "article", "language": "en", "authors": [ "David Onwong’a", "Moses Jeremiah Barasa Kabeyi", "Kenneth Njoroge", "Oludolapo Akanni Olanrewaju" ], "first_author": "David Onwong’a", "venue": "Energies", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "The global network of pipelines constitutes a strategic backbone for the world economy, enabling safe and efficient transportation of energy products. These pipelines serve distinct functions in the energy supply chain: gas pipelines support emerging cleaner energy carriers; multi-product pipelines provide versatility in transporting refined liquid fuels; and oil pipelines remain dominant for crude oil delivery. Energy management across the pipeline value chain emphasizes efficiency optimization, cost reduction, and sustainability through real-time monitoring, data analytics, integrated systems, and technological innovations spanning operations, maintenance, and emission control. Despite their critical role, petroleum depots remain relatively understudied, particularly in developing and Sub-Saharan African contexts. This review synthesizes insights from over 100 studies on energy-efficient pumping, predictive control, digitalization, and socio-technical energy management in depots. Analysis of these studies highlights recurring operational and infrastructural issues that constrain energy efficiency in depots. The challenges include irregular truck-loading schedules, frequent pump cycling, aging equipment, power-supply instability, manual operator interventions, and policy-driven constraints. The reviewed studies demonstrate that anticipatory, multi-layer control strategies integrating short-horizon flow forecasting, hybrid model predictive control, and cyber–physical–human–institutional system representations outperform reactive approaches in mitigating energy losses and operational variability. Site-specific calibration and phased deployment emerge as pragmatic pathways for implementing advanced energy optimization under the constrained conditions typical of real-world petroleum depots.", "keywords": [ "Pipeline transport", "Software deployment", "Pipeline (software)", "Sustainability", "Efficient energy use", "Energy supply", "Energy management", "Supply chain" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/1996-1073/19/9/2237/pdf?version=1778067578" }, { "id": "https://openalex.org/W4235898553", "doi": "10.1016/s1464-2859(08)70117-2", "title": "Air Products leads DLA forklift truck program", "year": 2007, "publication_date": "2007-11-01", "type": "article", "language": "en", "authors": [], "first_author": null, "venue": "Fuel Cells Bulletin", "publisher": "Elsevier BV", "abstract": "In the US, Air Products has signed an agreement with the Department of Defense's (DOD) largest combat support agency to lead a pilot refueling program for forklift trucks. The Defense Logistics Agency (DLA) will use Air Products as the lead contractor for a two-year demonstration program to develop an indoor hydrogen fueling station infrastructure to fuel forklift trucks powered by hydrogen fuel cells for daily warehouse operations at the Defense Distribution Depot Susquehanna in Pennsylvania (DDSP).", "keywords": [ "Truck", "Engineering", "Agency (philosophy)", "Waste management", "Transport engineering", "Aeronautics", "Pilot program", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/s1464-2859(08)70117-2" }, { "id": "https://openalex.org/W593338244", "doi": null, "title": "Development of a Lightweight Electric Urban Delivery Truck", "year": 2007, "publication_date": "2007-07-01", "type": "article", "language": "en", "authors": [ "Gerald Gillespie", "Randy S. Martin", "S Vader" ], "first_author": "Gerald Gillespie", "venue": null, "publisher": null, "abstract": "This project was part of the development of an aerodynamic, all-electric, composite monocoque urban delivery truck named the QuickSider™ intended to meet the requirements of Purolator Courier Ltd. It had two objectives: to complete the structural design of the lightweight composite monocoque low-floor body, and to explore the electric drive options to provide it with a zero emission vehicle range of 120 km. A computer-aided design (CAD) model of a full-scale mock-up was developed using finite element analysis (FEA). A physical full-scale mock-up was then built and tested structurally. Alternative floor structures were assessed. The results were used in the structural design of a working prototype. A CAD model for a prototype was developed using FEA, with particular focus on high stress areas. A statement of requirements for the truck’s battery system, based on the truck’s physical and operational requirements, was prepared and issued to several potential battery suppliers, and the responses analyzed. The conclusion was that a system based on MES-DEA’s Zebra battery was the only viable solution then available. A working prototype was built and subjected to extensive testing. No unacceptable stresses, deflections or resonances in the structure were identified. The vehicle’s performance was generally consistent with design expectations.", "keywords": [ "Truck", "Engineering", "Finite element method", "Battery (electricity)", "Automotive engineering", "CAD", "Mechanical engineering", "Structural engineering", "Engineering drawing", "Power (physics)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/876775" }, { "id": "https://openalex.org/W2035500939", "doi": "10.1016/0377-2217(94)00189-j", "title": "Reconsidering the distribution structure of gasoline products for a large oil company", "year": 1995, "publication_date": "1995-03-01", "type": "article", "language": "en", "authors": [ "Lambert van der Bruggen", "Ruud Gruson", "Marc Salomon" ], "first_author": "Lambert van der Bruggen", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Gasoline", "Truck", "Diesel fuel", "Distribution (mathematics)", "Petroleum industry", "Operations research", "Business", "Order (exchange)", "Transport engineering", "Operations management", "Computer science", "Environmental science" ], "cited_by_count": 52, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/0377-2217(94)00189-j" }, { "id": "https://openalex.org/W7160709214", "doi": "10.1016/j.ejor.2026.05.003", "title": "The Truck–Drone Hurdle Relay Problem in a Euclidean space", "year": 2026, "publication_date": "2026-05-01", "type": "article", "language": "en", "authors": [ "Alf Kimms", "Christin Münch", "Fabian Wilschewski" ], "first_author": "Alf Kimms", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": "In this work, we study the Truck–Drone Hurdle Relay Problem in a Euclidean space (TDHRP), which is particularly relevant in the context of disaster relief. In this problem, a drone is tasked with the delivery of relief supplies in a disaster-stricken area, while being supported by trucks along its way with transportation and battery exchanges. Trucks and drone need to work together, as the partially damaged road network prevents the trucks from reaching the destination, and as the distance from the depot to the destination is far too great for the drone to cover in one flight. We develop a mixed-integer linear program (MILP) for the TDHRP, where we apply a geometric approach that includes trajectory planning for the drone, as opposed to the common assumption in truck–drone delivery that the vehicles operate on a graph. The geometric approach allows the drone to be launched and recovered on any position along the roads, to model the drone velocities as continuous variables, and to ensure collision avoidance. To reduce computation times, we develop an exact row-generation solution method with six different strategies on adding rows. In an extensive computational study with instances with up to ten trucks and 300 obstacles or no-fly zones, two strategies are shown to yield faster median computation times then the complete MILP.", "keywords": [ "Relay", "Space (punctuation)", "Euclidean space", "Euclidean distance", "Euclidean geometry", "Key (lock)" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2026.05.003" }, { "id": "https://openalex.org/W601008126", "doi": null, "title": "Winter Maintenance Depots 24/7: Winter Maintenance in an Urban Environment", "year": 2006, "publication_date": "2006-10-01", "type": "article", "language": "en", "authors": [ "Dominic Guthrie" ], "first_author": "Dominic Guthrie", "venue": "THE APWA REPORTER", "publisher": null, "abstract": "This article gives an overview of factors related to the city of Toronto's winter maintenance activities. The annual budget for such activities is $50 million, and it covers the city's 9,000 lane miles and 4,500 miles of sidewalks using a fleet of salt trucks, road plows, sidewalk plows, and employees. Operators are described as needing to respond to public concerns over deicing methods, particularly concerns that arise from what citizens understand to be either excessive or inadequate salting. To coordinate their efforts effectively, operators run nine Winter Maintenance Depots (WMDs). Toronto's WMDs are located strategically throughout the city in order to provide rapid delivery according to the operator's needs. An account is also given of newer deicing methods implemented by the city including the use of salt brine.", "keywords": [ "Truck", "Transport engineering", "Environmental science", "Business", "Operations management", "Engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/792719" }, { "id": "https://openalex.org/W7112427569", "doi": null, "title": "Optimizing EV truck fleet charging schedules on depot", "year": 2025, "publication_date": "2025-01-01", "type": "dissertation", "language": "en", "authors": [ "Martinez Sanchez, Julian David" ], "first_author": "Martinez Sanchez, Julian David", "venue": "UPCommons institutional repository (Universitat Politècnica de Catalunya)", "publisher": "Universitat Politècnica de Catalunya", "abstract": "As the commercial transport sector transitions toward electrification, the need for intelligent energy management tools becomes increasingly critical. This thesis presents a modular, datadriven optimization framework for scheduling electric truck fleet charging at a single depot. Developed alongside a partner job with Scania, the tool generates cost-minimizing charging plans by aligning operational constraints, such as truck availability, charger power limits, and State-of-Charge (SoC) requirements, with dynamic electricity prices from the Nord Pool dayahead market. The optimizer was implemented in Python using linear programming techniques (Pyomo + GLPK) and deployed entirely through Scania’s cloud-based CI/CD infrastructure to ensure automation and scalability. A detailed case study using real operational data from a Swedish Scania customer demonstrated substantial benefits: over 90% cost savings compared to flat-rate electricity contracts, improved km/SEK efficiency as routes lengthen, and a clear sensitivity to infrastructure limitations and fleet scale. Sensitivity analyses further quantified how small reductions in charger count or fleet expansions could lead to infeasibility, emphasizing the importance of strategic infrastructure planning. The tool is modular, requiring only standardized input files and no local computation, making it adaptable across clients and markets within the Nord Pool region. While the current version focuses on static, day-ahead planning for a single depot, proposed extensions include multidepot scheduling, battery degradation modelling, real-time re-optimization, and integration of telematics-based consumption forecasts. This thesis contributes both a practical tool for fleet electrification and a research foundation for future development. By combining operational realism with robust optimization, the methodology helps bridge the gap between sustainable transport goals and real-world implementation challenges.", "keywords": [ "Electrification", "Truck", "Electricity", "Scheduling (production processes)", "Operational planning", "Fleet management", "Automotive industry", "Energy management" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/2117/444949" }, { "id": "https://openalex.org/W4393576559", "doi": "10.5281/zenodo.1487845", "title": "Problem instances for integrated truck and workforce scheduling problem", "year": 2018, "publication_date": "2018-11-14", "type": "dataset", "language": "en", "authors": [ "Giorgi Tadumadze", "Nils Boysen", "Simon Emde", "Felix Weidinger" ], "first_author": "Giorgi Tadumadze", "venue": "Zenodo (CERN European Organization for Nuclear Research)", "publisher": "European Organization for Nuclear Research", "abstract": "We randomly generated in total 500 problem instances for the integrated truck and workforce scheduling (ITWS) problem which is proposed in the article \"Tadumadze, G., Boysen, N., Emde, S., and Weidinger, F. (2019): Integrated truck and workforce scheduling to accelerate the unloading of trucks. European Journal of Operational Research, 278(1), 343-362, https://doi.org/10.1016/j.ejor.2019.04.024\". The problem instances are generated for two representative truck scheduling settings: distribution center (ITWS-DC) cross-docking terminal (ITWS-CD). The instance size is defined by the number of dock doors for inbound operations |D|, the number of inbound trucks |J| (and the number of outbound trucks |O| for the ITWS-CD setting) and they are dubbed as follows: XS: |D| = 5; |J| = 20; (|O| = 5) S: |D|= 15; |J| = 50; (|O| = 15) M: |D|= 25; |J| = 100; (|O| = 25) L: |D|= 50; |J| = 200; (|O| = 50) For each setting the instances are divided in sets \"computational study\" and \"managerial insights\". For each setting, the dataset \"computational study\" is divided into two parts (“part 1” and “part 2”) consisting of 80 and 60 instances which vary in problem size (XS, S, M and L) and the expected relative width of the trucks' time windows (Ω_{max}). The dataset \"managerial insights\" consists of problem instances that vary in acceleration effect of trucks' processing times by additional logistics workers (κ) and scenarios of the workforce size |W|. The notations for the workforce scenario have following meanings: plentiful workforce: |W|=2 ⋅ |D| scarce workforce |W|=|D|. For each setting (i.e., ITWS-DC and ITWS-CD) subset “part 1” of \"managerial insights\" contains 100 instances (50 with scarce workforce scenario and 50 with plentifull workforce scenario) and “part 2” - 10 instances. The instances are labeled according to the following naming convention: \"[problem]_[setting]_[size]_[Ω_{max}]_[κ]_[ID]\" where ID is a running index of instance of the same parameter constellation. As instances in “part 1” of the dataset “managerial insights” vary in workforce scenarios the instance names are extended by [scenario] from ahead so that following naming convention is applied: \"[scenario]_[problem]_[setting]_[size]_[ Ω_{max}]_[κ]_[ID]\". For detailed instance generation scheme see Section 4.1 of the above mentioned work. The file for the problem ITWS-DC are structured as follows: |J| = ; T = ; K_j = ; |W| = ; |D| = ; rho_{jk} = <|J|*K_{max} matrix (with K_max=max_{j∈J}{K_j}): each entry in k-th column and j-th row corresponds to the processing time of truck j if it is unloaded by k logistics workers (the elements in k-th column and j-th row where k ; a_j = ; d_j = ; alpha_j = ; beta_j = ; gamma_j = ; delta_j = ; The file for the problem ITWS-CD are extended by following additional parameters: |O| = ; FI_{jo} = <|J|*|O| matrix: each entry in o-th column and j-th row corresponds to the weight, of a shipment delivered by inbound truck j dedicated to outbound truck o>; dep_o = vector with |O| elements: the o-th element corresponds to the departure time for outbound truck o>; fi_{go} = <|D|*|O| matrix: each entry in o-th column and g-th row corresponds to the transfer time for moving goods from dock g to outbound truck o>;", "keywords": [ "Truck", "Workforce", "Operations research", "Computer science", "Scheduling (production processes)", "Workforce management", "Operations management", "Engineering", "Economics", "Automotive engineering", "Economic growth" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://zenodo.org/record/1487845" }, { "id": "https://openalex.org/W4392452383", "doi": "10.1063/5.0194810", "title": "Traveling salesman problem with a moving depot: A mathematical formulation and a saving-based algorithm", "year": 2024, "publication_date": "2024-01-01", "type": "conference-paper", "language": "en", "authors": [ "Batool Madani", "Malick Ndiaye" ], "first_author": "Batool Madani", "venue": "AIP conference proceedings", "publisher": "American Institute of Physics", "abstract": "The increase in the use of e-commerce has raised the pressure on logistics providers to resolve the problem of Last Mile Delivery, that is complex and generates high operational costs.The introduction of autonomous vehicles in designing novel distribution systems brings new opportunities for enhancing the existing delivery systems.Logistics providers suggest the inclusion of drones in delivery processes such as truck-drone systems.Therefore, we introduce a single truck and single drone delivery system and solve its related routing problem.In specific, the objective is to minimize the traveling cost of the combined delivery system while determining the optimal sequence of deliveries and optimizing -based heuristics are then provided to solve instances of practical sizes for the problem under consideration.", "keywords": [ "Travelling salesman problem", "Depot", "Computer science", "Mathematical optimization", "Algorithm", "Traveling purchaser problem", "Bottleneck traveling salesman problem", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1063/5.0194810" }, { "id": "https://openalex.org/W2622586012", "doi": "10.5821/dissertation-2117-105286", "title": "Roll-on/roll-off terminals and truck freight : improving competitiveness in a motorways of the sea context", "year": 2016, "publication_date": "2016-10-07", "type": "dissertation", "language": "en", "authors": [ "Pau Morales Fusco" ], "first_author": "Pau Morales Fusco", "venue": null, "publisher": null, "abstract": "In recent years transport policy at an European Level has been focused on reducing the share of road transportation and promote alternative transportation means in order to reduce road congestion and carbon footprint. One of the solutions proposed has been promoting Short Sea Shipping (SSS) transportation combined with land transportation to become a door-to-door alternative to the monomodal road alternative. The maritime centered option would hit to birds with a stone: reduce congestion in the most urbanized areas of the European Union and partly replacing heavy polluting truck haulage for an environmentally friendlier option. The European Commission launched many polices and initiatives to make the modal shift happen, the crown jewel being the launch of multiple initiatives promoting the establishment of a system of Motorways of the Seas. Those are links between ports with higher standards in terms of travel time, costs and flexibility, which can compete one-on-one with road haulage among the countries in the Union. Despite different efforts from the public administration to kick off MoS lines and ensure their competitiveness, the expected momentum is still yet to come. In the light of this, this thesis aims at providing tools to assess the competitiveness of existing and MoS line to-be, to quantify the room for improvement available and the effects that some changes at an operational and strategical level might have on the success of any specific line. Particularly, the thesis presented aims at three specific objectives: (1) to identify the strategic potential of SSS in all its forms, considering the characteristics of the demand (goods to be moved) and the role of RoRo and MoS shipping in the global picture; (2) to identify the most sensible procedures in RoRo terminals operation to be addressed to improve their performance and perception from the end user, and; (3) To understand the costs of the supply chain, and the cost structure of RoRo shipping lines, and their sensitiveness in front of market changes, pricing and public funding policies. To approach each issue different qualitative, analytical and simulating models are used depending on the concerned problem. The strategic assessment makes use interviews to identify the main requirements that a transporter might face when dealing with SSS. The role of the terminal is assessed by means of two separate models: from one side an analytical model is used to assess the relationship between capacity and quality by means of quantifying the service time the ship spends in a port and calculate the probability of delays. On the other side, the resilience of the port is assessed with an arborescence interlinking its current vulnerabilities, their causes and effects and their probability to happen. Finally, and regarding the business models, first a cost and time model is constructed for each of them and tested against variations on some of the variables and from there, a tool to calculate the optimal deployment of the shipping line to ensure the maximum shift (or profit) is provided. In that case, the model is complemented with the adaptation of a transportation discrete choice model. Overall, the tools should be helpful to assess the potential of a shipping line from its planning level to its final operational deployment. Els darrers anys, la política de transports a nivell europeu s'ha focalitzat en reduir el pes del transport per carretera de mercaderies i promoure mitjans de transport que li siguin alternatius, com a mesures per reduir la congestió a les carreteres i la petjada ecològica. Una de les solucions que s'ha posat sobre la taula, és l'anomenat Transport Marítim de Curta Distància (TMCD o SSS, en les seves sigles en anglès), com a una veritable alternativa bimodal (ferrocarril/carretera combinats amb transport marítim) a l'opció de transport monomodal per carretera. Diversos estudis certifiquen que el transport porta-a-porta transcorregut parcialment amb TMCD acostuma a registrar menors externalitats (bàsicament costos ambientals i de congestió) que el transport per carretera per cada tona transportada. Des d'un punt de vista operatiu, el TMCD i especialment la seva versió en forma d'Autopistes del Mar (AdM o MoS), enteses com a enllaços entre ports amb altes prestacions pel que fa a temps de viatge, flexibilitat i freqüència a un cost competitiu s'han estudiat àmpliament com a una alternativa directa i equivalent al transport per carretera. Però malgrat els esforços fets des de l'administració pública per promoure les línies d'AdM i assegurar-ne la competitivitat, aquestes no han obtingut l'impuls previst inicialment. L'objectiu d'aquesta tesi, de fet, és proveir un conjunt d'eines per tal d'avaluar la competitivitat de qualsevol AdM i quantificar-ne el marge de millora i l'efecte que alguns canvis a nivell operatiu i estratègic podrien tenir en la seva competitivitat , tan a nivell operatiu com estratègic, per tal de garantir-ne la competitivitat futura. De forma més específica, la tesi que aquí es presenta, analitza tres aspectes específics de les AdM: (1) Quines característiques a de tenir el seu mercat potencial a nivell estratègic, (2) con rol prenen les terminals portuàries, enteses com la baula dèbil de la cadena de transport, a nivell de la valoració qualitativa de la cadena de transport per part del seu usuari final i (3), possibles models de negoci pel transportista / propietari de la mercaderia per treure el màxim profit de les AdM. Cada un dels tres aspectes s'adreça mitjançant eines diferenciades que s'adaptin a la problemàtica plantejada. L'anàlisi estratègic es basa en entrevistes a usuaris de cadenes de transport per establir els principals requeriments del transportista que es pugui plantejar l'ús d'una AdM. A partir dels requeriments, es defineixen diversos models de cadena de transport, arribant a la conclusió que les cadenes 'push-pull' i 'push against stock' són les candidates que més es beneficiarien d'u", "keywords": [ "Haulage", "Truck", "European union", "Context (archaeology)", "Transport engineering", "Order (exchange)", "Flexibility (engineering)", "Business", "European commission", "Traffic congestion", "Engineering", "Finance" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://upcommons.upc.edu/bitstream/2117/105286/1/TPMF1de1.pdf" }, { "id": "https://openalex.org/W4389417919", "doi": "10.1016/j.tre.2023.103377", "title": "Optimization of the drone-assisted pickup and delivery problem", "year": 2023, "publication_date": "2023-12-06", "type": "article", "language": "en", "authors": [ "Timothy Mulumba", "Ali H. Diabat" ], "first_author": "Timothy Mulumba", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Truck", "Pickup", "Context (archaeology)", "Computer science", "Heuristic", "Bottleneck", "Operations research", "Last mile (transportation)", "Simulation", "Engineering", "Automotive engineering" ], "cited_by_count": 88, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2023.103377" }, { "id": "https://openalex.org/W2152268333", "doi": "10.1016/s0191-2615(03)00013-4", "title": "The hierarchical network design problem for time-definite express common carriers", "year": 2003, "publication_date": "2003-04-25", "type": "article", "language": "en", "authors": [ "Cheng-Chang Lin", "Sheu-Hua Chen" ], "first_author": "Cheng-Chang Lin", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Computer science", "Service (business)", "sort", "Function (biology)", "Network planning and design", "Mathematical optimization", "Operations research", "Computer network", "Engineering", "Mathematics" ], "cited_by_count": 75, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/s0191-2615(03)00013-4" }, { "id": "https://openalex.org/W4413040261", "doi": "10.3390/math13152537", "title": "Coordinated Truck Loading and Routing Problem: A Forestry Logistics Case Study", "year": 2025, "publication_date": "2025-08-07", "type": "article", "language": "en", "authors": [ "Cristian Oliva San Martín", "Manuel Cepeda", "Sebastián Muñoz-Herrera" ], "first_author": "Cristian Oliva San Martín", "venue": "Mathematics", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "This study addresses a real-world logistics problem in forestry operations: the distribution of plants from cultivation centers to planting sites under strict delivery time windows and limited depot resources. We introduce the Coordinated Truck Loading and Routing Problem (CTLRP), an extension of the classical Vehicle Routing Problem with Time Windows (VRPTW) that integrates routing decisions with truck loading schedules at a single depot with constrained capacity. To solve this NP-hard problem, we develop a metaheuristic algorithm based on Ant Colony Optimization (ACO), enhanced with a global memory system and a novel stochastic return rule that allows trucks to return to the depot when additional deliveries are suboptimal. Parameter calibration experiments are conducted to determine optimal values for the return probability and ant population size. The algorithm is tested on a real forestry dispatch scenario over six working days. The results show that an Ant Colony System (ACS–CTLRP) algorithm reduces total distance traveled by 23%, travel time by 22%, and the number of trucks used by 13 units, while increasing fleet utilization from 54% to 83%. These findings demonstrate that the proposed method significantly outperforms current company planning and offers a transferable framework for depot-constrained routing problems in time-sensitive distribution environments.", "keywords": [ "Truck", "Vehicle routing problem", "Ant colony optimization algorithms", "Routing (electronic design automation)", "Computer science", "Metaheuristic", "Ant colony", "Operations research", "Mathematical optimization", "Population", "Transport engineering", "Engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2227-7390/13/15/2537/pdf?version=1754566603" }, { "id": "https://openalex.org/W2004604658", "doi": "10.1016/j.cor.2012.11.015", "title": "A Tabu Search Heuristic for the Inland Container Transportation Problem", "year": 2012, "publication_date": "2012-11-27", "type": "article", "language": "en", "authors": [ "Sebastian Sterzik", "Herbert Kopfer" ], "first_author": "Sebastian Sterzik", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Tabu search", "Container (type theory)", "Truck", "Computer science", "Vehicle routing problem", "Scheduling (production processes)", "Heuristic", "Mathematical optimization", "Homogeneous", "Routing (electronic design automation)", "Job shop scheduling", "Operations research" ], "cited_by_count": 81, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2012.11.015" }, { "id": "https://openalex.org/W2069362414", "doi": "10.1016/j.ejor.2010.02.020", "title": "On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm", "year": 2010, "publication_date": "2010-02-18", "type": "article", "language": "en", "authors": [ "Luc Muyldermans", "Gu Pang" ], "first_author": "Luc Muyldermans", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Compartment (ship)", "Truck", "Computer science", "Routing (electronic design automation)", "Key (lock)", "Heuristic", "Distribution (mathematics)", "Quality (philosophy)", "Mathematical optimization", "Algorithm", "Operations research" ], "cited_by_count": 110, "is_retracted": false, "is_paratext": false, "open_access_url": "https://core.ac.uk/display/9984529" }, { "id": "https://openalex.org/W2143208611", "doi": "10.1142/s0217595905000522", "title": "AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING", "year": 2005, "publication_date": "2005-06-01", "type": "article", "language": "en", "authors": [ "Subrata K. Mitra" ], "first_author": "Subrata K. Mitra", "venue": "Asia Pacific Journal of Operational Research", "publisher": "World Scientific", "abstract": "The Vehicle Routing Problem with Backhauling deals with the supply of finished goods from a depot to a number of delivery points, and picking up returnable items and bringing them back to the depot using a fleet of trucks. Traditionally, the objective of the problem has been to determine the truck routes such that the total number of trucks and/or the total distance traveled/total route cost are minimized. Most of the papers available in the literature in this connection deal with problems where the linehaul (having a demand for finished goods) and backhaul (having items to be returned to the depot) customers are different, and a customer may be visited by at most one truck limiting demand and returns at a location by the capacity of the truck. In this paper, we allow the linehaul and backhaul customers to be the same leading to simultaneous delivery and pickup at a customer location, and also there is no restriction on the quantity demanded at (to be returned from) a customer location. As such a customer may be visited by more than one truck and more than once by the same truck. We developed a Mixed Integer Linear programming (MILP) formulation of the problem and a route construction heuristic. The heuristic averaged 80 ms for 110 problems tested, and in 78 of them the heuristic costs were either equal to the optimal costs or at most equal to the upper bounds on the optimal costs obtained after running the optimization package for 30 min. Optimal solutions were obtained for 28 problems at an average time of 295 ms. The heuristic could match the optimal solutions for 22 of these problems at an average time of 71 ms.", "keywords": [ "Truck", "Vehicle routing problem", "Backhaul (telecommunications)", "Heuristic", "Computer science", "Integer programming", "Routing (electronic design automation)", "Mathematical optimization", "Total cost", "Operations research", "Transport engineering", "Engineering" ], "cited_by_count": 51, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1142/s0217595905000522" }, { "id": "https://openalex.org/W2937399900", "doi": "10.3390/en12071407", "title": "LCA-Based Comparison of Two Organic Fraction Municipal Solid Waste Collection Systems in Historical Centres in Spain", "year": 2019, "publication_date": "2019-04-11", "type": "article", "language": "en", "authors": [ "Jara Laso", "Isabel García-Herrero", "María Margallo", "Alba Bala", "Pere Fullana–i–Palmer", "Ángel Irabien", "Rubén Aldaco García" ], "first_author": "Jara Laso", "venue": "Energies", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Municipal solid waste (MSW) collection is an important issue in the development and management of smart cities, having a significant influence on environmental sustainability. Door-to-door and pneumatic collection are two systems that represent a way of arranging waste collection in city´s historic areas in Spain where conventional street-side container collection is not feasible. Since door-to-door collection generates significant direct greenhouse gas emissions from trucks, pneumatic collection emerges as an alternative to the trucking system. While this technology apparently reduces local direct air emissions, it suffers from a large energy demand derived from vacuum production for waste suction. The introduction of new normative frameworks regarding the selective collection of the biodegradable fraction makes necessary a comprehensive analysis to assess the influence of this fraction collection and its subsequent recycling by anaerobic digestion. As a novelty, this work compares both conventional door-to-door and pneumatic collection systems from a life cycle approach focusing on the biodegradable waste. Results indicate that, in spite of the fact electricity production and consumption have a significant influence on the results, the energy savings from the recycling of the organic fraction are higher than the energy requirements. Therefore, the pneumatic collection could be an environmentally-friendly option for MSW management under a circular economy approach in Spanish city´s historic areas, since wastes could be a material or energy source opportunity.", "keywords": [ "Waste collection", "Municipal solid waste", "Truck", "Waste management", "Work (physics)", "Greenhouse gas", "Life-cycle assessment", "Landfill gas", "Biodegradable waste", "Electricity", "Energy recovery", "Energy consumption" ], "cited_by_count": 49, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/1996-1073/12/7/1407/pdf?version=1555055028" }, { "id": "https://openalex.org/W3128606758", "doi": "10.3390/iecf2020-08068", "title": "Determination of the Safest Route for Logging Trucks Based on Road Types and Conditions", "year": 2020, "publication_date": "2020-11-13", "type": "conference-paper", "language": "en", "authors": [ "Abdullah Emin AKAY" ], "first_author": "Abdullah Emin AKAY", "venue": null, "publisher": null, "abstract": "Hauling of wood-based forest products is a complex problem that requires evaluation of many alternative routes. Forest transportation has been generally done by using logging trucks with high carrying capacity. Logging truck driving is one of the dangerous occupations in forestry, particularly in Turkey, where forest lands are mostly located in mountainous regions with steep slopes. The safety risk of truck driving mainly depends on the road standards and conditions. The majority of the forest roads in Turkey have low standards that limit the maneuverability of logging trucks. In such conditions, forest transportation should be planned by considering not only transportation costs but also the safety of logging truck driving. In this study, the GIS-based network analysis method was used to develop the optimum transportation plans for two scenarios. In the first scenario, an optimum plan that minimized the total transportation cost was developed, while a transportation plan that ensured the safest logging truck driving was optimized in the second scenario. A safety score was assigned to each road section based on the road type (asphalt, gravel, forest road) and road conditions (good, medium, poor). In the study area, located in the city of Bursa in Turkey, there were three forest depots and five landings. The results indicated that the transportation cost increased by 15.76% when the safety of logging truck driving was prioritized. In this scenario, forest products from three landings were transported to different depots, compared to the first scenario.", "keywords": [ "Truck", "Logging", "Forest road", "Transport engineering", "Environmental science", "Engineering", "Forestry", "Automotive engineering", "Geography" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2673-4931/3/1/5/pdf?version=1631337730" }, { "id": "https://openalex.org/W4413093072", "doi": "10.3390/app15147848", "title": "The Environmental Impact of Inland Empty Container Movements Within Two-Depot Systems", "year": 2025, "publication_date": "2025-07-14", "type": "article", "language": "en", "authors": [ "Alaa Abdelshafie", "May Salah", "Tomaž Kramberger" ], "first_author": "Alaa Abdelshafie", "venue": "Applied Sciences", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Inefficient inland repositioning of empty containers between depots remains a persistent challenge in container logistics, contributing significantly to unnecessary truck movements, elevated operational costs, and increased CO2 emissions. Acknowledging the importance of this problem, a large amount of relevant literature has appeared. The objective of this paper is to track the empty container flow between ports, empty depots, inland terminals, and customer premises. Additionally, it aims to simulate and assess CO2 emissions, capturing the dynamic interactions between different agents. In this study, agent-based modeling (ABM) was proposed to simulate the empty container movements with an emphasis on inland transportation. ABM is an emerging approach that is increasingly used to simulate complex economic systems and artificial market behaviours. NetLogo was used to incorporate real-world geographic data and quantify CO2 emissions based on truckload status and to evaluate the other operational aspects. Behavior Space was also utilized to systematically conduct multiple simulation experiments, varying parameters to analyze different scenarios. The results of the study show that customer demand frequency plays a crucial role in system efficiency, affecting container availability and logistical tension.", "keywords": [ "NetLogo", "Container (type theory)", "Truck", "Computer science", "Transport engineering", "Operations research", "Environmental science", "Business", "Engineering", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2076-3417/15/14/7848/pdf?version=1752479794" }, { "id": "https://openalex.org/W4214678719", "doi": "10.1016/j.tre.2022.102633", "title": "Container port drayage operations and management: Past and future", "year": 2022, "publication_date": "2022-02-26", "type": "article", "language": "en", "authors": [ "Rui Chen", "Qiang Meng", "Peng Jia" ], "first_author": "Rui Chen", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Container (type theory)", "Port (circuit theory)", "Truck", "Containerization", "Transport engineering", "Service (business)", "Business", "Computer science", "Operations research", "Engineering", "Marketing", "Automotive engineering" ], "cited_by_count": 72, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2022.102633" }, { "id": "https://openalex.org/W2085622366", "doi": "10.1016/j.amc.2007.07.006", "title": "An operational planning model for petroleum products logistics under uncertainty", "year": 2007, "publication_date": "2007-07-12", "type": "article", "language": "en", "authors": [ "S.​A. MirHassani" ], "first_author": "S.​A. MirHassani", "venue": "Applied Mathematics and Computation", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Oil refinery", "Truck", "Pipeline transport", "Scheduling (production processes)", "Computer science", "Operations research", "Petroleum", "Petroleum product", "Product (mathematics)", "Pipeline (software)", "Operations management", "Environmental science" ], "cited_by_count": 57, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.amc.2007.07.006" }, { "id": "https://openalex.org/W4416577587", "doi": "10.1016/j.enpol.2025.114976", "title": "Economies of scale matter: how refuelling infrastructure policy affects the viability of alternative fuel trucks", "year": 2025, "publication_date": "2025-11-24", "type": "article", "language": "en", "authors": [ "Manuel Pérez-Bravo", "Sebastián Pineda Serna", "Rafael Cossent", "Pedro Linares" ], "first_author": "Manuel Pérez-Bravo", "venue": "Energy Policy", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Economies of scale", "Order (exchange)", "Scale (ratio)", "Transportation infrastructure", "Hydrogen vehicle", "Alternative fuel vehicle", "Energy supply", "Supply and demand" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.enpol.2025.114976" }, { "id": "https://openalex.org/W2086250929", "doi": "10.1080/03088830802469501", "title": "A survey of short sea shipping and its prospects in the USA", "year": 2008, "publication_date": "2008-11-28", "type": "article", "language": "en", "authors": [ "Anastassios N. Perakis", "Athanasios Denisis" ], "first_author": "Anastassios N. Perakis", "venue": "Maritime Policy & Management", "publisher": "Taylor & Francis", "abstract": "The continuing growth of international container trade has created capacity problems at major US ports, and the truck-based freight transportation has caused a deterioration of traffic congestion on important US transportation corridors. Using inland and coastal waterways, short sea shipping (SSS) can provide an improvement to these problems. Furthermore, SSS offers many additional benefits for the environment, the economy and society as a whole. Both the US Department of Transportation and the European Commission actively support SSS as an alternative, environmentally friendly mode of transportation. However, there are obstacles, administrative barriers and challenges that should be addressed. Several successful operations on both sides of the Atlantic make a strong case in favour of SSS. SSS can develop customized and technologically advanced solutions that will further integrate it into the intermodal transportation chain and will improve its image among shippers as a mode that can provide reliable door-to-door transportation. This paper reviews several studies on the subject and discusses the latest developments on SSS in the US and in Europe. It also addresses the major issues and the benefits of SSS and examines the prospects for potential short sea operations in the US. Finally, it proposes research opportunities for a multimodal transportation system that will include a short sea component.", "keywords": [ "Container (type theory)", "Truck", "Transport engineering", "Containerization", "Business", "Commission", "SSS*", "Maritime safety", "Computer science", "Risk analysis (engineering)", "Engineering", "Finance" ], "cited_by_count": 92, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/03088830802469501" }, { "id": "https://openalex.org/W2604941505", "doi": "10.1016/j.jclepro.2017.04.005", "title": "Combining operational research and Life Cycle Assessment to optimize municipal solid waste collection in a district in Lima (Peru)", "year": 2017, "publication_date": "2017-04-06", "type": "article", "language": "en", "authors": [ "Alessandro Gilardino", "Jonatán Edward Rojas Polo", "Héctor Mattos", "Gustavo Larrea‐Gallegos", "Ian Vázquez‐Rowe" ], "first_author": "Alessandro Gilardino", "venue": "Journal of Cleaner Production", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Waste collection", "Data collection", "Life-cycle assessment", "Greenhouse gas", "Baseline (sea)", "Municipal solid waste", "Heuristic", "Task (project management)", "Operations research", "Transport engineering", "Operations management" ], "cited_by_count": 79, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/20.500.12390/1041" }, { "id": "https://openalex.org/W4367018342", "doi": "10.2139/ssrn.4429473", "title": "Multi-Depot Vehicle Routing Problem with Drones: Mathematical Formulation, Solution Algorithm and Experiments", "year": 2023, "publication_date": "2023-01-01", "type": "preprint", "language": "en", "authors": [ "Petr Stodola", "Libor Kutěj" ], "first_author": "Petr Stodola", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Vehicle routing problem", "Drone", "Mathematical optimization", "Computer science", "Routing (electronic design automation)", "Depot", "Algorithm", "Mathematics", "Computer network" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.4429473" }, { "id": "https://openalex.org/W4404915168", "doi": "10.1109/scisisis61014.2024.10760235", "title": "Integer Programming Approaches to an Issue of Scheduling for a Truck-Drone Last-Mile Delivery System with Parcel Pickup Service", "year": 2024, "publication_date": "2024-11-09", "type": "conference-paper", "language": "en", "authors": [ "Kotaro Yamada", "Yoshiyuki Karuno", "Hitoshi Iima" ], "first_author": "Kotaro Yamada", "venue": null, "publisher": null, "abstract": "In this paper, we consider a scheduling issue for parcel delivery and pickup services by a truck-drone last-mile delivery system. We are given a single carrier truck and multiple identical drones to serve a finite set of customers. The single carrier truck plays the role of a mobile depot for the drones, and it visits several stops in a given order of them. The given order of stops constitutes a fixed truck route, and the carrier truck is allowed to launch (resp., to retrieve) a drone to (resp., from) a customer at a stop. For each sortie of a drone, the launching stop and the retrieving stop must be the same. The load capacity of a drone is limited to one, and for a sortie of a drone at a stop, there are three options: (i) only deliver a parcel to a customer, (ii) only pick up a parcel from a customer, and (iii) deliver a parcel to a customer, and then pick up a parcel from a customer. The scheduling problem asks to find an assignment of customers to drones with sortie options and a choice of a truck stop for each sortie in the assignment. The objective is to minimize the total duration of the carrier truck over all the stops, which is equivalent to minimizing the makespan. In this paper, we first propose an extended integer program for the case with both delivery and pickup services from an existing one for the case with delivery service only. We also conduct numerical experiments to demonstrate the solution quality of the proposed integer program by utilizing an integer programming solver, and report the results.", "keywords": [ "Pickup", "Drone", "Truck", "Last mile (transportation)", "Integer programming", "Computer science", "Mile", "Scheduling (production processes)", "Job shop scheduling", "Mathematical optimization", "Engineering", "Computer network" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/scisisis61014.2024.10760235" }, { "id": "https://openalex.org/W3037369271", "doi": "10.1016/j.tre.2020.102012", "title": "Static rebalancing optimization with considering the collection of malfunctioning bikes in free-floating bike sharing system", "year": 2020, "publication_date": "2020-06-26", "type": "article", "language": "en", "authors": [ "Mingyang Du", "Lin Cheng", "Xuefeng Li", "Fang Tang" ], "first_author": "Mingyang Du", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Heuristic", "Integer programming", "Computer science", "Bike sharing", "Linear programming", "Genetic algorithm", "Greedy algorithm", "Test (biology)", "Mathematical optimization", "Simulation", "Operations research" ], "cited_by_count": 88, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2020.102012" }, { "id": "https://openalex.org/W4229981255", "doi": "10.1109/wsc.2017.8248031", "title": "Empty container stacking operations: Case study of an empty container depot in valparaiso chile", "year": 2017, "publication_date": "2017-12-01", "type": "conference-paper", "language": "en", "authors": [ "Felipe Hidalgo", "Diego F. Aranda", "Jimena Pascual", "Alice E. Smith", "Rosa G. González‐Ramírez" ], "first_author": "Felipe Hidalgo", "venue": null, "publisher": null, "abstract": "This paper describes a detailed stochastic simulation model integrated with a transactional database to model operations in an empty container depot. Empty container depots are found ubiquitously in supply chains around the world but there has been virtually no quantitative research done to assess operational policies nor layout designs. In this work we determine the performance of operational policies related to the stacking and retrieval of empty containers to derive recommendations for policy improvements and, in future work, the yard layout design. A simulation model was chosen as the proper tool to address these aims because of the uncertain nature and complex handling actions of an empty container depot. Results thus far show that policies concerning remarshalling and retrieval strongly influence the efficiency of the depot operations in terms of the truck turnaround times, as well as the utilization of the resources which include yard cranes and personnel.", "keywords": [ "Container (type theory)", "Yard", "Computer science", "Truck", "Operations research", "Work (physics)", "Turnaround time", "Supply chain", "Depot", "Matching (statistics)", "Transport engineering", "Engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/wsc.2017.8248031" }, { "id": "https://openalex.org/W2054473623", "doi": "10.1016/j.ijpe.2014.11.003", "title": "A block recombination approach to solve green vehicle routing problem", "year": 2014, "publication_date": "2014-11-11", "type": "article", "language": "en", "authors": [ "Anurag Kumar Tiwari", "Pei‐Chann Chang" ], "first_author": "Anurag Kumar Tiwari", "venue": "International Journal of Production Economics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Truck", "Block (permutation group theory)", "Benchmark (surveying)", "Computer science", "Routing (electronic design automation)", "Mathematical optimization", "Automotive engineering", "Mathematics", "Computer network", "Engineering" ], "cited_by_count": 82, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ijpe.2014.11.003" }, { "id": "https://openalex.org/W2001465411", "doi": "10.1016/j.cor.2004.07.006", "title": "A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing", "year": 2004, "publication_date": "2004-08-31", "type": "article", "language": "en", "authors": [ "Nathalie Perrier", "André Langevin", "James F. Campbell" ], "first_author": "Nathalie Perrier", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Snow removal", "Truck", "Snow", "Plough", "Sizing", "Computer science", "Routing (electronic design automation)", "Transport engineering", "Operations research", "Algorithm", "Meteorology", "Engineering" ], "cited_by_count": 107, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2004.07.006" }, { "id": "https://openalex.org/W135782144", "doi": "10.1007/978-3-642-33835-9_58", "title": "Optibody Project: Optimizing Vehicle Structures for Electric Light Trucks and Vans", "year": 2012, "publication_date": "2012-11-14", "type": "book-chapter", "language": "en", "authors": [ "Eduardo del Pozo de Dios", "Arturo Dávila", "Juan José Alba", "Massimiliano Avalle" ], "first_author": "Eduardo del Pozo de Dios", "venue": "Lecture notes in electrical engineering", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Automotive engineering", "Electric light", "Transport engineering", "Business", "Aeronautics", "Engineering", "Electrical engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-642-33835-9_58" }, { "id": "https://openalex.org/W4283643224", "doi": "10.1016/j.tre.2022.102816", "title": "The flying sidekick traveling salesman problem with stochastic travel time: A reinforcement learning approach", "year": 2022, "publication_date": "2022-06-28", "type": "article", "language": "en", "authors": [ "Zeyu Liu", "Xueping Li", "Anahita Khojandi" ], "first_author": "Zeyu Liu", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Travelling salesman problem", "Reinforcement learning", "Time travel", "Computer science", "Operations research", "Engineering", "Mathematical optimization", "Artificial intelligence", "Mathematics" ], "cited_by_count": 85, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2022.102816" }, { "id": "https://openalex.org/W4225761091", "doi": "10.1007/978-981-16-9492-9_152", "title": "A Variable Neighborhood Descent Method for Cooperative Delivery Routing Problem of Trucks and Drones", "year": 2022, "publication_date": "2022-01-01", "type": "conference-paper", "language": "en", "authors": [ "Ni Mao", "Guohua Wu", "Qizhang Luo", "Jianmai Shi" ], "first_author": "Ni Mao", "venue": "Lecture notes in electrical engineering", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Drone", "Descent (aeronautics)", "Payload (computing)", "Routing (electronic design automation)", "Travelling salesman problem", "Truck", "Computer science", "Vehicle routing problem", "Cluster analysis", "Tabu search", "Variable (mathematics)", "Mathematical optimization" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-981-16-9492-9_152" }, { "id": "https://openalex.org/W2959678274", "doi": "10.22060/ajce.2019.15779.5551", "title": "Evaluating the effect of truck size on the amount of Air pollutants emission due to consumption fuel", "year": 2020, "publication_date": "2020-06-01", "type": "article", "language": "en", "authors": [ "Ali Al Mansoori", "Gholamreza Nabi Beidhendi", "Mohammadjavad Amiri", "Hassan Hovaidi" ], "first_author": "Ali Al Mansoori", "venue": "AUT Journal of Civil Engineering", "publisher": null, "abstract": "Easy access, door-to-door nature of service, and the existence of a sophisticated road network are the merits that guarantee the status of road transport as the dominant mode of transportation. However, the complete reliance of road transport on fossil fuels makes it a major source of emission and environmental damage. It is widely believed that the size of a freight truck has an impact on the emission generation, and when loaded to maximum capacity, larger trucks are more efficient than smaller ones. The present paper reexamined the effect of truck size on the fuel consumption and the resulting emission. The results show that, contrary to common belief, larger trucks are not more efficient and do not have a lower fuel consumption and emission per unit of net transported cargo. This misconception originates from the mistake of calculating the truck’s maximum load capacity based on its axle capacities regardless of the maximum load that each axle can apply to the road pavement. When the axle capacity is greater than the equivalent capacity of the road, the difference will have a damaging impact on the road pavement. The magnitude of this damage will progressively increase with the degree of violation of standard equivalent 18-kip single-axle load criteria. This damage results in deformation and settlement in the surface pavement, which leads to reduced road safety and service level. Hence, the maximum load capacity of a truck is limited by the equivalent capacity of the road it traverses. From this perspective, the size of the truck does not have a significant impact on the amount of emission that will be produced for transporting a certain amount of cargo.", "keywords": [ "Truck", "Axle", "Fuel efficiency", "Environmental science", "Axle load", "Automotive engineering", "Transport engineering", "Engineering", "Structural engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ajce.aut.ac.ir/article_3494_6ac4ee528d77c2bc9442253ce226f53f.pdf" }, { "id": "https://openalex.org/W3206620984", "doi": "10.1007/s10696-021-09432-9", "title": "Performance analysis of a drop-swap terminal to mitigate truck congestion at chemical sites", "year": 2021, "publication_date": "2021-10-16", "type": "article", "language": "en", "authors": [ "Budhi Sholeh Wibowo", "Jan C. Fransoo" ], "first_author": "Budhi Sholeh Wibowo", "venue": "Flexible Services and Manufacturing Journal", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Swap (finance)", "Truck", "Terminal (telecommunication)", "Computer science", "Drop (telecommunication)", "Automotive engineering", "Computer network", "Engineering", "Business" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s10696-021-09432-9.pdf" }, { "id": "https://openalex.org/W4295860426", "doi": "10.2139/ssrn.4211063", "title": "A Collaborative Truck Multi-Drone Routing Problem with Flexible Launch and Recovery Operations", "year": 2022, "publication_date": "2022-01-01", "type": "preprint", "language": "en", "authors": [ "Liu Changshi", "Wu Zhang", "Gang Kou", "Feng Xiao", "Xiancheng Zhou", "Lijun Fan" ], "first_author": "Liu Changshi", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Drone", "Truck", "Aeronautics", "Routing (electronic design automation)", "Vehicle routing problem", "Computer science", "Operations research", "Engineering", "Business", "Aerospace engineering", "Computer network" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.4211063" }, { "id": "https://openalex.org/W3006014023", "doi": "10.1016/j.cor.2020.104919", "title": "The two-echelon vehicle routing problem with covering options: City logistics with cargo bikes and parcel lockers", "year": 2020, "publication_date": "2020-02-13", "type": "article", "language": "en", "authors": [ "David L.J.U. Enthoven", "Bolor Jargalsaikhan", "Kees Jan Roodbergen", "Michiel A.J. uit het Broek", "Albert H. Schrotenboer" ], "first_author": "David L.J.U. Enthoven", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Benchmark (surveying)", "Truck", "Heuristic", "Computer science", "Routing (electronic design automation)", "City logistics", "Operations research", "Integer programming", "Transport engineering", "Mathematical optimization", "Mathematics" ], "cited_by_count": 197, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0305054820300368" }, { "id": "https://openalex.org/W2085285568", "doi": "10.1287/trsc.1070.0195", "title": "Vehicle Routing for Urban Snow Plowing Operations", "year": 2008, "publication_date": "2008-01-27", "type": "article", "language": "en", "authors": [ "Nathalie Perrier", "André Langevin", "Ciro-Alberto Amaya" ], "first_author": "Nathalie Perrier", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "Winter road maintenance planning involves a variety of decisions related to the routing of vehicles for spreading chemicals and abrasives, plowing roadways and sidewalks, loading snow into trucks, and transporting snow to disposal sites. In this paper, we present a model and two heuristic solution approaches based on mathematical optimization for the routing of vehicles for snow plowing operations in urban areas. Given a district and a single depot where a number of plows are based, the problem is to determine a set of routes, each performed by a single vehicle that starts and ends at the district's depot, such that all road segments are serviced while satisfying a set of operational constraints and minimizing a time objective. The formulation models general precedence relation constraints with no assumption on class connectivity, different service and deadhead speed possibilities, separate pass requirements for multilane road segments, class upgrading possibilities, and vehicle road segment dependencies. Several extensions, such as turn restrictions, load balancing constraints, and tandem service requirements, which are required in a real-life application, are also discussed. Two objectives are considered: A hierarchical objective and a makespan objective. The resulting model is based on a multicommodity network flow structure to impose the connectivity of the route performed by each vehicle. The two solution strategies were tested on data from the City of Dieppe, New Brunswick, Canada.", "keywords": [ "Routing (electronic design automation)", "Truck", "Vehicle routing problem", "Heuristic", "Flow network", "Transport engineering", "Computer science", "Snow removal", "Set (abstract data type)", "Class (philosophy)", "Level of service", "Operations research" ], "cited_by_count": 96, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.1070.0195" }, { "id": "https://openalex.org/W4391554721", "doi": "10.1016/j.ejor.2024.01.045", "title": "Fleet resupply by drones for last-mile delivery", "year": 2024, "publication_date": "2024-02-02", "type": "article", "language": "en", "authors": [ "Juan C. Pina-Pardo", "Daniel F. Silva", "Alice E. Smith", "Ricardo A. Gatica" ], "first_author": "Juan C. Pina-Pardo", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Drone", "Computer science", "Vehicle routing problem", "Integer programming", "Operations research", "Routing (electronic design automation)", "Transport engineering", "Engineering", "Automotive engineering", "Computer network" ], "cited_by_count": 29, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2024.01.045" }, { "id": "https://openalex.org/W4376456745", "doi": "10.1109/tits.2023.3271430", "title": "Logistics in the Sky: A Two-Phase Optimization Approach for the Drone Package Pickup and Delivery System", "year": 2023, "publication_date": "2023-05-11", "type": "article", "language": "en", "authors": [ "Fangyu Hong", "Guohua Wu", "Qizhang Luo", "Huan Liu", "Xiaoping Fang", "Witold Pedrycz" ], "first_author": "Fangyu Hong", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "The application of drones in last-mile distribution has been a contentious research topic in recent years. Existing urban distribution modes mostly depend on trucks. This paper proposes a novel package pickup and delivery mode and system wherein multiple drones collaborate with automatic devices. The proposed mode uses free areas on top of residential buildings to set automatic devices as delivery and pickup points of packages, and employs drones to transport packages between buildings and depots. The integrated scheduling problem of package drop-pickup considering${m}$-drones,${m}$-depots, and${m}$-customers is crucial for the system. Therefore, we propose a simulated-annealing-based two-phase optimization (SATO) approach to solve this problem. In the first phase, tasks are allocated to depots for serving, such that the initial problem is decomposed into multiple single-depot scheduling problems with${m}$-drone. In the second phase, considering the drone capability and task demand constraints, we generated a route-planning scheme for drones in each depot. Concurrently, an improved variable neighborhood descent (IVND) algorithm was designed in the first phase to reallocate tasks, and a local search (LS) algorithm was proposed to search for high-quality solutions in the second phase. Finally, extensive experiments and comparative studies were conducted to verify the effectiveness of the proposed approach.", "keywords": [ "Drone", "Notation", "Pickup", "Simulated annealing", "Computer science", "Mathematics", "Algorithm", "Artificial intelligence", "Arithmetic" ], "cited_by_count": 63, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2023.3271430" }, { "id": "https://openalex.org/W2996539634", "doi": null, "title": "THE DETERMINATION OF TRANSPORT ROUTE AND VEHICLE OPERATINGCOSTS FOR WASTE COLLECTION TRUCK IN PURUK CAHU CITY", "year": 2019, "publication_date": "2019-02-01", "type": "article", "language": "en", "authors": [ "S B Alam", "Iphan Fitrian Radam" ], "first_author": "S B Alam", "venue": null, "publisher": null, "abstract": "Problem that has always been a big issue in urban area is related to municipal solid waste. The problem is getting complex along with the increasing number of population which will result in garbage in the form of solid waste. The increasing number of population is proportional to the level of consumption and activities of the society, which will cause the increase of solid waste. This research will discuss about the analysis of the volume of solid waste, solid waste transportation route, and the number of rotation started from the process of collecting solid waste until the transportation to final landfill. This research also examines the Vehicle Operating Cost (VOC) for truck conventionally that carries the solid wastecollection of Puruk Cahu City. The process of\r\ncollecting solid waste in PurukCahu City is conducted through two methods, namely collecting solid waste in\r\ntrash bin by door-to-door technique on the route along the ways that are passed using dump truck with capacity\r\nof 8 m3 and the second technique isusing hauled container system with capacity of 7.5 m3 by putting container that has been provided in certain locations spread in several places in PurukCahu City as the temporary disposal station (TPS). The volume of solid waste of Puruk Cahu City along the ways that are passed by the flatbed truck with stationary container system is 48.20 m3 per day and the volume of solid waste on truck hauled container system is 13.70 m3 per day.The transportation route for truck with stationary container system is divided into 6 zones of transportation and is conducted everyday. Transportation route for dump truck with hauled container system is divided into 7 zones. The average Vehicle Operating Cost for solid waste collection truckwith stationary container system is IDR.2,893.75/km/m3 and with hauled container system is 4,690.50/km/m3.", "keywords": [ "Municipal solid waste", "Truck", "Garbage", "Waste management", "Container (type theory)", "Waste collection", "Population", "Engineering", "Transport engineering", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://eprints.ulm.ac.id/id/eprint/5969" }, { "id": "https://openalex.org/W7160919035", "doi": "10.46254/gc03.20250372", "title": "Electrifying Saudi Logistics: A TCO and Risk Based Roadmap for Battery Electric Truck Fleets under Vision 2030", "year": 2026, "publication_date": "2026-02-02", "type": "conference-paper", "language": null, "authors": [ "Irfanullah Khan", "Yujia Zhai", "Muhammad Tayyab" ], "first_author": "Irfanullah Khan", "venue": null, "publisher": null, "abstract": "This paper evaluates when and where battery electric trucks (BEVs) can economically displace diesel in the Kingdom’s logistics network. We build a Saudi specific total cost of ownership (TCO) model for two duty cycles, medium duty return to depot and heavy duty long haul and embed it in a cost minimization that applies an internal carbon price (ICP). A Monte-Carlo simulation varies diesel and electricity prices, tariffs, grid carbon intensity, and policy shocks to quantify uncertainty in costs and emissions. Results show depot based medium duty BEV fleets are already cost competitive under prevailing industrial tariffs; managed, off peak charging further improves savings and reduces exposure to oil price volatility. Heavy duty long haul remains cost positive at current prices but approaches parity when the diesel electricity price ratio widens, ICP rises, or standardized corridor megawatt charging is available. Grid decarbonization and carbon pricing materially cut emissions in both segments, yet TCO parity depends primarily on relative energy prices and operational constraints. We propose a phased roadmap for Saudi operators: (i) electrify medium duty first through return to depot operations and smart charging; (ii) pilot heavy duty corridors co located with reliable power and on-site renewables; (iii) hedge tariff and capex risk via long term contracts, incentives, and public-private partnerships; and (iv) coordinate utilities, fleet operators, and regulators to accelerate grid connections and standardize charging. The framework provides decision ready evidence for logistics managers and policymakers seeking cost effective, resilient decarbonization of road freight.", "keywords": [ "Truck", "Battery (electricity)", "Automotive battery", "Work (physics)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ieomsociety.org/proceedings/saudiarabia2025/372.pdf" }, { "id": "https://openalex.org/W2529339987", "doi": "10.1016/j.trb.2016.09.012", "title": "The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems", "year": 2016, "publication_date": "2016-10-05", "type": "article", "language": "en", "authors": [ "Hongqi Li", "Lu Zhang", "Tan Lv", "Xinyu Chang" ], "first_author": "Hongqi Li", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Mathematical optimization", "Operations research", "Engineering", "Computer network", "Mathematics" ], "cited_by_count": 67, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trb.2016.09.012" }, { "id": "https://openalex.org/W4280514848", "doi": "10.51316/jst.158.ssad.2022.32.2.9", "title": "Solving a Real-world Problem of Truck-Trailer Scheduling in Container Transportation by Local Search", "year": 2022, "publication_date": "2022-05-15", "type": "article", "language": "en", "authors": [ "Van Son Nguyen", "Quang Dung Pham" ], "first_author": "Van Son Nguyen", "venue": "Smart Systems and Devices", "publisher": null, "abstract": "Container transportation plays a very important role in global supply chains where companies of different countries exchange goods overseas. Operational costs of transporting containers are extremely high. Hence, optimizing itinerary schedules brings substantial benefits to logistics companies. In this paper, we investigate a realistic container transportation schedule problem in which trucks, trailers, and containers are separate objects located at different terminals, and trucks are planned to take trailers and carry containers between container depots, ports, and customer warehouses. In this context, containers can be 40ft or 20ft, and a trailer can carry one 40ft container or one 20ft container, or two 20ft containers. Moreover, a truck can detach the trailer and leave both the container and trailer at the warehouse if no available forklift. We first propose a mixed-integer linear programming model for describing the problem. Then, we propose a local search algorithm for solving the problem. Experiments on generated data instances show the benefits of the proposed algorithm that about 19.62% on average compared to the previously proposed algorithm. Furthermore, the application of the model leads to rapidity in generating the solution; this task that used to take days is decreased to just one hour.", "keywords": [ "Trailer", "Truck", "Container (type theory)", "Context (archaeology)", "Computer science", "Operations research", "Schedule", "Scheduling (production processes)", "Supply chain", "Transport engineering", "Integer programming", "Business" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://storage.googleapis.com/jst-journals/articles/ssad/158/21062_.5m.pdf" }, { "id": "https://openalex.org/W4410063833", "doi": "10.1142/s2301385026500457", "title": "Memetic Optimization of Collaborative Human-UAV-Truck Search-and-Rescue Task Scheduling in Earthquakes", "year": 2025, "publication_date": "2025-05-04", "type": "article", "language": "en", "authors": [ "Kang-Cong Lv", "Zhi-Yuan Zhang", "Lin-Yuan Bai", "Xunlin Jiang", "Yu‐Jun Zheng" ], "first_author": "Kang-Cong Lv", "venue": "Unmanned Systems", "publisher": "World Scientific", "abstract": "Unmanned aerial vehicles (UAVs) have become increasingly used in search and rescue tasks in disasters. However, there are many tasks that cannot be completed solely by UAVs; instead, they should be completed by cooperation of UAVs and human rescuers. Moreover, as battery capacity is a major limiting factor in UAV operations, using ground vehicles (trucks) to provide mobile battery swapping services is an efficient approach. To this end, this paper studies a problem of collaborative human-UAV-truck search-and-rescue task scheduling in earthquakes, where UAVs are used to quickly search for survivors who are expected to be ultimately rescued by human rescuers, while a truck serves as a mobile battery depot for UAVs, such that the survivors can be rescued as many as possible and as early as possible. To solve the problem, we propose a memetic algorithm that combines the ecogeography-based optimization metaheuristic for global exploration, adaptive local search for improving solution accuracy, and a Gaussian binary simulated annealing method for truck path planning. Numerical experiments on a set of real-world problem instances demonstrate the effectiveness and efficiency of the proposed method.", "keywords": [ "Memetic algorithm", "Scheduling (production processes)", "Truck", "Computer science", "Job shop scheduling", "Task (project management)", "Search and rescue", "Engineering", "Artificial intelligence", "Operations management", "Aerospace engineering", "Local search (optimization)" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1142/s2301385026500457" }, { "id": "https://openalex.org/W2889968840", "doi": null, "title": "Kajian peningkatan lifting LPG pressurized di Depot Balongan - studi kasus : PT. Pertamina (Persero)", "year": 2015, "publication_date": "2015-06-05", "type": "dissertation", "language": "id", "authors": [ "Reika Ermansa" ], "first_author": "Reika Ermansa", "venue": null, "publisher": null, "abstract": "Dalam sistem suplai dan distribusi LPG, total target, frekuensi injeksi kapal, jumlah truk, dan pengaturan tangki memiliki hubungan yang kuat untuk mencapai performansi harian. Penerimaan suplai berasal dari hasil produksi kilang dan injeksi kapal. Sedangkan, distribusi dilakukan ke SP(P)BE/agen melalui jalur kilang dan jalur depot. Produk yang disalurkan berupa unit curah dan unit tabung. Namun, penyaluran LPG dari kilang memiliki berbagai permasalahan operasional. Oleh karena itu, jalur penyaluran LPG dari kilang akan ditutup dan semua pendistribusian dialihkan ke depot. Dalam penelitian ini dilakukan pencarian kombinasi terbaik antara pengaturan total DOT (Daily of Throughput), frekuensi injeksi kapal, jumlah truk, dan waktu suplai distribusi. Hal ini bertujuan untuk meningkatkan penyaluran LPG di Depot Balongan serta melihat kemampuan maksimum tangki.\r\nPenelitian ini mengembangkan model simulasi yang meniru aktivitas suplai dan distribusi dengan menggunakan software ARENA. Simulasi dilakukan untuk meniru kondisi eksisting terlebih dahulu untuk melihat bottleneck yang terjadi. Pada kondisi eksisting terlihat bahwa pengaturan penggunaan tangki belum maksimal sehingga menyebabkan stok rendah dan lifting harian tidak seimbang untuk tiap unit yang disalurkan. Beberapa skenario hasil pengembangan total DOT, frekuensi injeksi kapal, dan jumlah truk akan dikembangkan untuk mengatasi bottleneck yang ada. Setiap skenario dievaluasi nilai performansi lifting dan utilisasi tangki. Hasil penelitian menunjukkan bahwa hampir seluruh skenario yang dikembangkan memiliki dampak signifikan terhadap kondisi eksisting. Skenario terpilih ialah skenario yang berada dalam garis frontier dan memiliki nilai performansi tinggi.=================================================================================================================\r\nIn the LPG supply and distribution system, the daily target, frequency of vessel injection, number of trucks, and utilization of tank are interrelated to achieve daily performances. Supply comes from the refinery production and vessel injection. Meanwhile, distribution LPG to customers is done through the refinery unit and depot. The type of LPG that delivered is bulk and tube. However, the distribution of LPG from refinery unit has many operational issues. Therefore, distribution route from refinery unit will be closed and transferred to the depot. In this paper, the best combination between the daily target, frequency of vessel injection, number of trucks, distribution and supply time are investigated. The objective is to improve daily performances and obtain maximum tank capability.\r\nThis research develops a simulation model that mimics supply and distribution activity of LPG using ARENA software. The simulation conducts to replicate the existing condition and find the bottleneck. Existing condition shows that the utilization of tank is not maximized. The daily lifting is unbalanced for each type products and tank has low inventory. Several numbers of scenario related to daily target as well as frequency of vessel injection and number of trucks are then developed to fix the existing bottleneck. Each scenario is evaluated in terms of lifting performance and tank utilization. The results shows that almost all scenarios developed have significant impacts on the existing condition. The scenario that is closer to the frontier curve and has a high performance value will be selected.", "keywords": [ "Physics", "Computer science" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://repository.its.ac.id/51800/" }, { "id": "https://openalex.org/W3005448235", "doi": "10.1016/j.cor.2020.104904", "title": "The fuel replenishment problem: A split-delivery multi-compartment vehicle routing problem with multiple trips", "year": 2020, "publication_date": "2020-02-08", "type": "article", "language": "en", "authors": [ "Lu Wang", "Joris Kinable", "Tom Van Woensel" ], "first_author": "Lu Wang", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "TRIPS architecture", "Vehicle routing problem", "Compartment (ship)", "Computer science", "Routing (electronic design automation)", "Mathematical optimization", "Operations research", "Mathematics", "Computer network", "Geology", "Parallel computing" ], "cited_by_count": 62, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0305054820300216" }, { "id": "https://openalex.org/W4206626347", "doi": "10.3390/wevj13010020", "title": "Optimization and Analysis of Electric Vehicle Operation with Fast-Charging Technologies", "year": 2022, "publication_date": "2022-01-13", "type": "article", "language": "en", "authors": [ "Mohammed Al-Saadi", "Manuel Mathes", "Johannes Käsgen", "Koffrie Robert", "Matthias Mayrock", "Joeri Van Mierlo", "Maitane Berecibar" ], "first_author": "Mohammed Al-Saadi", "venue": "World Electric Vehicle Journal", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "This work presents three demos, which include Electric Buses (EBs) from four various brands with lengths of 12 m and 18 m and an Electric Truck (E-truck) for refuse collection. The technical operation of these EVs were analyzed to implement further operational cost optimization on the demo vehicles. The Electric Vehicles (EVs) were tested against superfast-charging solutions based on Pantograph (Type A & Type B) on the route lines (and depots) and based on Combined Charging System Type 2 (CCS2, Combo2) from various brands to validate the interoperability among several vendors and support further EV integration with more affordable solutions. The optimization includes the calculation of the EBs’ consumption at various seasons and under various operating conditions in order to use optimum battery system design, heating system, optimum EB fleet operation and size and to find the charging solutions properly. The results showed that the EB consumption increases in some cases by 64.5% in wintertime due to heating systems, and the consumption in urban areas is more than that on the route lines outside cities. In the E-truck demo, where the electric heater was replaced with a heat-pump to optimize the energy consumption, it was found that the consumption of the heat-pump is about half of the electric heater under certain operating conditions. Under strict EB schedule, Pantograph charging solutions with power ratings of 300–600 kW have been adopted to charge the batteries of the EBs within 4–10 min. In order to minimize the cumulative costs of energy, (pantograph) charging infrastructure depreciation and battery degradation, as well as depot charging (at the bus operator’s depot), was adopted with a power level of 50–350 kW based on CCS2 and pantograph.", "keywords": [ "Automotive engineering", "Truck", "Schedule", "Energy consumption", "Electric energy consumption", "Battery (electricity)", "Computer science", "Pantograph", "Environmental science", "Engineering", "Electrical engineering", "Power (physics)" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2032-6653/13/1/20/pdf?version=1642510650" }, { "id": "https://openalex.org/W2267772102", "doi": "10.1016/j.cor.2016.01.016", "title": "A general variable neighborhood search for the swap-body vehicle routing problem", "year": 2016, "publication_date": "2016-02-10", "type": "article", "language": "en", "authors": [ "Raca Todosijević", "Saïd Hanafi", "Dragan Urošević", "Bassem Jarboui", "Bernard Gendron" ], "first_author": "Raca Todosijević", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Swap (finance)", "Computer science", "Vehicle routing problem", "Heuristics", "Truck", "Mathematical optimization", "Solver", "Variable neighborhood search", "Operations research", "Routing (electronic design automation)", "Metaheuristic", "Automotive engineering" ], "cited_by_count": 47, "is_retracted": false, "is_paratext": false, "open_access_url": "https://uphf.hal.science/hal-03402315" }, { "id": "https://openalex.org/W2021241106", "doi": "10.1016/j.retrec.2011.06.004", "title": "Application of El Farol model for managing marine terminal gate congestion", "year": 2011, "publication_date": "2011-01-01", "type": "article", "language": "en", "authors": [ "Omor Sharif", "Nathan N. Huynh", "José M. Vidal" ], "first_author": "Omor Sharif", "venue": "Research in Transportation Economics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Queueing theory", "Terminal (telecommunication)", "Queue", "Computer science", "Traffic congestion", "Operations research", "Transport engineering", "Engineering", "Computer network", "Automotive engineering" ], "cited_by_count": 49, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.retrec.2011.06.004" }, { "id": "https://openalex.org/W995376278", "doi": "10.1016/j.trc.2015.07.004", "title": "Deliveries to residential units: A rising form of freight transportation in the U.S.", "year": 2015, "publication_date": "2015-07-23", "type": "article", "language": "en", "authors": [ "Xiaokun Wang", "Yiwei Zhou" ], "first_author": "Xiaokun Wang", "venue": "Transportation Research Part C Emerging Technologies", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "TRIPS architecture", "Transport engineering", "Business", "Truck", "Trip generation", "Engineering" ], "cited_by_count": 63, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trc.2015.07.004" }, { "id": "https://openalex.org/W2506351967", "doi": "10.1109/itec.2016.7520255", "title": "Evaluation and selection of accumulator size in electric-hydraulic hybrid (EH2) powertrain", "year": 2016, "publication_date": "2016-06-01", "type": "conference-paper", "language": "en", "authors": [ "Geng Niu", "Fei Shang", "Mahesh Krishnamurthy", "Jose M. Garcia-Bravo" ], "first_author": "Geng Niu", "venue": null, "publisher": null, "abstract": "An electric-hydraulic hybrid (EH2) powertrain has shown significant potential in extending driving range and reducing battery discharge current stress. Research has shown that the size of the hydraulic accumulator can have substantial influence on the performance and even the design of components in the overall electrified powertrain of the vehicle. This paper evaluates three sizes of hydraulic accumulator for urban delivery trucks according to different degrees of hybridization in the electric hydraulic hybrid powertrain. It has been shown that different hydraulic accumulators have notable impact on the reduction of battery current stress and electricity consumption, optimal utilization of hydraulic energy storage system, weight, cost, and hydraulic component efficiency.", "keywords": [ "Accumulator (cryptography)", "Hydraulic accumulator", "Powertrain", "Automotive engineering", "Truck", "Electricity", "Hydraulic machinery", "Fuel efficiency", "Battery (electricity)", "Environmental science", "Computer science", "Engineering" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/itec.2016.7520255" }, { "id": "https://openalex.org/W4409595649", "doi": "10.1016/j.apenergy.2025.125935", "title": "Strategic fleet replacement for the electrification of heavy-duty road freight transportation", "year": 2025, "publication_date": "2025-04-19", "type": "article", "language": "en", "authors": [ "Jan Pouwel Bakker", "Jose A. Lopez Alvarez", "Jasper Veldman", "Paul Buijs" ], "first_author": "Jan Pouwel Bakker", "venue": "Applied Energy", "publisher": "Elsevier BV", "abstract": "Electric trucks (ETs) have emerged as a promising solution for the decarbonization of road freight transportation . However, their adoption in the fleets of logistics companies poses considerable challenges. Fleet managers must balance trade-offs between investment in ETs and diesel trucks (DTs), evaluate the operational implications of evolving fleet compositions, and plan for the required depot charging infrastructure investments. To address these challenges, we propose a mixed-integer programming model to optimize truck purchasing and salvaging decisions over a multi-year planning horizon. The main novelty of this model lies in its explicit consideration of depot charging infrastructure investments and the use of public fast charging for long-haul transport. We apply the model to analyze the technical, economic, and organizational factors influencing the deployment of ETs into heavy-duty fleets. Our results demonstrate that adopting ETs can lead to lower total costs compared to fleets composed entirely of DTs. However, achieving those cost reductions hinges on the available budgets for substantial upfront capital investments and upgrades to the electricity grid connection at the depot. Moreover, the pace and scale of ET adoption are heavily influenced by the geographical distribution of customers. Specifically, when ETs can operate solely with depot charging, rapid adoption is optimal. In contrast, reliance on public fast charging makes the adoption of ETs slower and less certain. Current pricing for public fast-charging services remains prohibitively high, limiting the widespread adoption of ETs even if the purchasing costs for ETs continue to decline.", "keywords": [ "Electrification", "Heavy duty", "Transport engineering", "Business", "Fleet management", "Engineering", "Automotive engineering", "Electricity", "Electrical engineering" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.apenergy.2025.125935" }, { "id": "https://openalex.org/W4361251532", "doi": "10.1109/itnec56291.2023.10082608", "title": "A Hybrid Variable Neighborhood Search Algorithm on Routing and Scheduling for Truck-Assisted Multi-Drone Parcel Delivery", "year": 2023, "publication_date": "2023-02-24", "type": "conference-paper", "language": "en", "authors": [ "Meng Cai", "Hongyan Qian" ], "first_author": "Meng Cai", "venue": null, "publisher": null, "abstract": "In this paper, we study the routing and scheduling for truck-assisted multi-drone parcel delivery. Considering the existing model TSP-mD, two different road networks are adopted, where truck and drones transport goods along Manhattan distance and Euclidean distance, respectively. At the same time allowing truck to launch multiple drones at the same location, the drones can fly out from the depot to serve customers before returning to the truck, or take off from the truck to serve customers eventually flying back to the depot. Based on the common TSP, an integer planning model of TSP-mD with the shortest completion time as the optimization objective is constructed, and a hybrid variable neighborhood search algorithm is designed. Finally, experimental data prove that both the proposed model and HVNS algorithm in this paper are effective.", "keywords": [ "Drone", "Truck", "Variable neighborhood search", "Scheduling (production processes)", "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Route planning", "Job shop scheduling", "Travelling salesman problem", "Integer programming", "Variable (mathematics)" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://dx.doi.org/10.1109/itnec56291.2023.10082608" }, { "id": "https://openalex.org/W2072852102", "doi": "10.1007/s00420-003-0439-4", "title": "Exposure to carcinogenic polycyclic aromatic compounds and health risk assessment for diesel-exhaust exposed workers", "year": 2003, "publication_date": "2003-05-16", "type": "article", "language": "en", "authors": [ "Jean‐Jacques Sauvain", "T. Vu Duc", "Michel P Guillemin" ], "first_author": "Jean‐Jacques Sauvain", "venue": "International Archives of Occupational and Environmental Health", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Diesel exhaust", "Occupational exposure", "Carcinogen", "Environmental health", "Risk assessment", "Environmental chemistry", "Occupational medicine", "Exposure assessment", "Diesel fuel", "Environmental science", "Chemistry", "Medicine" ], "cited_by_count": 80, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s00420-003-0439-4.pdf" }, { "id": "https://openalex.org/W3213342001", "doi": "10.1016/j.clet.2021.100322", "title": "Energy demand of parcel delivery services with a mixed fleet of electric vehicles", "year": 2021, "publication_date": "2021-11-08", "type": "article", "language": "en", "authors": [ "Thomas Kirschstein" ], "first_author": "Thomas Kirschstein", "venue": "Cleaner Engineering and Technology", "publisher": "Elsevier BV", "abstract": "Drone logistics is considered as a disruptive business model reshaping logistics in the next decades. Most prominent potential advantages of drone delivery are cost savings, high speed, and high flexibility. Additionally, drones are also considered as a means of green transportation as they are electric vehicles which are potentially emission-free. To which extent these claimed potentials exist depends on the application scenario as well as the environmental and technological conditions. In this study a stationary drone delivery system is considered where parcels are delivered from a central depot to customers either by drone or electric truck. The minimal total energy consumption for serving all customers is determined when using only an electric truck or a mixed fleet of electric trucks and drones. In a simulation study the effects of structural characteristics (like numbers of customers and customer density) and environmental conditions (like wind speed and traffic conditions) on potential energy savings using drones are estimated. The results indicate that structural characteristics and environmental conditions heavily affect the energy saving potential of drones. In urban settings with high customer density, the energy saving potential is limited to at most 1% while in rural settings drones can help to save 5% of total energy. Under drone-favoring conditions like calm winds and heavy traffic, the energy saving potential can double.", "keywords": [ "Drone", "Truck", "Flexibility (engineering)", "Energy consumption", "Electricity", "Transport engineering", "Automotive engineering", "Electric vehicle", "Environmental economics", "Environmental science", "Business", "Engineering" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.clet.2021.100322" }, { "id": "https://openalex.org/W2144600337", "doi": "10.1287/trsc.37.2.170.15248", "title": "Vehicle Routing and Scheduling with Full Truckloads", "year": 2003, "publication_date": "2003-05-01", "type": "article", "language": "en", "authors": [ "Sundararajan Arunapuram", "Kamlesh Mathur", "Daniel Solow" ], "first_author": "Sundararajan Arunapuram", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "Truckload carriers are constantly faced with the problem of shipping full truckloads of goods at minimum cost between pairs of cities or customers, using a fleet of trucks located at one or more depots. In this paper, a new branch-and-bound algorithm for solving an integer-programming formulation of this vehicle-routing problem (VRP) with full truckloads is developed. The algorithm also takes into consideration the time-window constraints and waiting costs. The resulting efficiency, validated by computational tests on random problems, is due to a column-generation scheme that exploits the special structure of the problem to solve the linear-programming relaxation problems that arise at the nodes.", "keywords": [ "Column generation", "Vehicle routing problem", "Branch and price", "Integer programming", "Truck", "Mathematical optimization", "Scheduling (production processes)", "Exploit", "Linear programming relaxation", "Linear programming", "Computer science", "Branch and bound" ], "cited_by_count": 68, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.37.2.170.15248" }, { "id": "https://openalex.org/W4384433852", "doi": "10.1007/978-3-031-36115-9_58", "title": "Multi-depot Open Electric Truck Routing Problem with Dynamic Discharging", "year": 2023, "publication_date": "2023-01-01", "type": "conference-paper", "language": "en", "authors": [ "Xue Yang", "Ning Chen" ], "first_author": "Xue Yang", "venue": "Lecture notes on data engineering and communications technologies", "publisher": "Springer International Publishing", "abstract": null, "keywords": [ "Truck", "Vehicle routing problem", "Economic shortage", "Genetic algorithm", "Mathematical optimization", "Range (aeronautics)", "Computer science", "Routing (electronic design automation)", "Electric vehicle", "Encoding (memory)", "Dynamic programming", "Distribution (mathematics)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-031-36115-9_58" }, { "id": "https://openalex.org/W3124145329", "doi": "10.2139/ssrn.3338436", "title": "The Multiple Flying Sidekicks Traveling Salesman Problem: Parcel Delivery with Multiple Drones", "year": 2019, "publication_date": "2019-01-01", "type": "preprint", "language": "en", "authors": [ "Chase C. Murray", "Ritwik Raj" ], "first_author": "Chase C. Murray", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Travelling salesman problem", "Drone", "Computer science", "Aeronautics", "Operations research", "Engineering", "Biology", "Algorithm" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.3338436" }, { "id": "https://openalex.org/W7164860034", "doi": "10.3390/drones10060461", "title": "Traffic-Predictive Drone Scheduling: Day-Ahead Synchronization of Mobile Depots and Parallel Aerial Sorties in Urban Airspace", "year": 2026, "publication_date": "2026-06-13", "type": "article", "language": "en", "authors": [ "Shabahat Hasan", "Tarek Sheltami", "Ashraf Mahmoud" ], "first_author": "Shabahat Hasan", "venue": "Drones", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Urban Unmanned Aerial Vehicle (UAV) logistics operations are frequently constrained by the intersection of limited battery endurance and dynamic ground traffic. When mobile depots are delayed by congestion, onboard drone fleets experience extended idling periods, leading to constrained sortie generation and reduced asset utilization. To address this bottleneck, this paper introduces a traffic-predictive multi-UAV dispatch framework for deterministic day-ahead planning under modeled urban operating conditions. By coupling a count-derived macroscopic speed surrogate learned using XGBoost with a Particle Swarm Optimization (PSO)–Mixed-Integer Linear Programming (MILP) optimization architecture, the framework synchronizes mobile depot trajectories with forecasted low-congestion windows and pre-allocates endurance-feasible parallel aerial sorties. Controlled computational experiments across 30 synthetic routing instances demonstrate the potential value of this approach within the stated modeling assumptions. Compared to baseline clustered deployments, the traffic-aware framework raises mean fleet utilization from 0.43 to 0.63—a 46.2% relative improvement driven by temporal compression of the mission window rather than an absolute increase in flight hours. Furthermore, the proposed framework reduces total mission completion time by 69.87% relative to the conventional truck-only baseline, while achieving a 29.58% incremental gain over static speed drone deployments. These findings suggest that incorporating predictive ground traffic information into day-ahead UAV scheduling can improve modeled fleet efficiency; however, field validation with measured route-level speeds, real delivery demand, and operational constraints remains necessary before deployment-level claims can be made.", "keywords": [ "Drone", "Scheduling (production processes)", "Baseline (sea)", "Particle swarm optimization", "Intersection (aeronautics)", "Linear programming", "Synchronization (alternating current)", "Dynamic programming" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2504-446X/10/6/461/pdf?version=1781343459" }, { "id": "https://openalex.org/W2781042121", "doi": "10.1007/s12544-017-0280-6", "title": "An analytical model for vehicle miles traveled and carbon emissions for goods delivery scenarios", "year": 2017, "publication_date": "2017-12-19", "type": "article", "language": "en", "authors": [ "Anne Goodchild", "Erica Wygonik", "Nathan Mayes" ], "first_author": "Anne Goodchild", "venue": "European Transport Research Review", "publisher": "Springer Science+Business Media", "abstract": "This paper presents an analytical model to contrast the carbon emissions from a number of goods delivery methods. This includes individuals travelling to the store by car, and delivery trucks delivering to homes. While the impact of growing home delivery services has been studied with combinatorial approaches, those approaches do not allow for systematic conclusions regarding when the service provides net benefit. The use of the analytical approach presented here, allows for more systematic relationships to be established between problem parameters, and therefore broader conclusions regarding when delivery services may provide a CO 2 benefit over personal travel. Analytical mathematical models are developed to approximate total vehicle miles traveled (VMT) and carbon emissions for a personal vehicle travel scenario, a local depot vehicle travel scenario, and a regional warehouse travel scenario. A graphical heuristic is developed to compare the carbon emissions of a personal vehicle travel scenario and local depot delivery scenario. The analytical approach developed and presented in the paper demonstrates that two key variables drive whether a delivery service or personal travel will provide a lower CO 2 solution. These are the emissions ratio, and customer density. The emissions ratio represents the relative emissions impact of the delivery vehicle when compared to the personal vehicle. The results show that with a small number of customers, and low emissions ratio, personal travel is preferred. In contrast, with a high number of customers and low emissions ratio, delivery service is preferred. While other research into the impact of delivery services on CO 2 emissions has generally used a combinatorial approach, this paper considers the problem using an analytical model. A detailed simulation can provide locational specificity, but provides less insight into the fundamental drivers of system behavior. The analytical approach exposes the problem’s basic relationships that are independent of local geography and infrastructure. The result is a simple method for identifying context when personal travel, or delivery service, is more CO2 efficient.", "keywords": [ "Truck", "Service (business)", "Transport engineering", "Greenhouse gas", "Heuristic", "Operations research", "Environmental economics", "Computer science", "Engineering", "Business", "Marketing", "Automotive engineering" ], "cited_by_count": 40, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s12544-017-0280-6" }, { "id": "https://openalex.org/W3173554082", "doi": "10.1186/s12544-021-00491-5", "title": "Assesment of the potential of cargo bikes and electrification for last-mile parcel delivery by means of simulation of urban freight flows", "year": 2021, "publication_date": "2021-06-17", "type": "article", "language": "en", "authors": [ "Carlos Llorca", "Rolf Moeckel" ], "first_author": "Carlos Llorca", "venue": "European Transport Research Review", "publisher": "Springer Science+Business Media", "abstract": "Abstract Background The paper presents a simulation model for freight. In the paper, this model is applied to understand the impacts of electric vans and cargo bikes for the last-mile delivery of parcels. Cargo bikes are electrically assisted vehicles that distribute parcels from micro depots located close to the final customers by means of short tours. The parcels are sent from the major distribution center to micro depots in vans (called feeders). Materials and methods An agent-based model is used for the purpose of the paper. The model is based on the disaggregation of commodity flows to represent trucks (for all commodities) and individual shipments (for parcel deliveries). The model represents microscopically every freight vehicle in the study area. Results The simulation of various scenarios with different shares of cargo bikes and electric vans assesses the impacts of electrification and cargo bikes. The use of cargo bikes to deliver parcels allows to reduce the number of motorized vehicles, although the presence of large parcels requires that at least half of deliveries by vans are still required. The shift to cargo bikes represents a slight increase in the total operating time to deliver the parcel demand. With low shares of cargo bikes, the total distance traveled increases, since the reduction of van tours cannot compensate the additional feeder trips from distribution centers to micro depots. The cargo bikes also do not reduce the number of vehicles for the served area, but modify the composition of vehicle types. Low noise, smaller, low emission vehicles increase, while delivery vans are reduced. Conclusion Both cargo bikes and electric vans are able to reduce CO2 emissions, even after accounting for the emissions related to electricity production.", "keywords": [ "Truck", "Electrification", "Transport engineering", "Last mile (transportation)", "TRIPS architecture", "Mile", "Vehicle miles of travel", "Rush hour", "Engineering", "Automotive engineering", "Electricity", "Geography" ], "cited_by_count": 77, "is_retracted": false, "is_paratext": false, "open_access_url": "https://etrr.springeropen.com/counter/pdf/10.1186/s12544-021-00491-5" }, { "id": "https://openalex.org/W7160720559", "doi": "10.1016/j.eswa.2026.132596", "title": "Branch-and-price algorithm augmented by deep learning for the truck-drone routing problem with 3D loading constraints", "year": 2026, "publication_date": "2026-05-09", "type": "article", "language": "en", "authors": [ "Binjie Xu", "Guohua Wu", "Yalin Wang", "Qizhang Luo", "Conghui Wang", "Chenliang Liu", "Xinwei Wang" ], "first_author": "Binjie Xu", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Deep learning", "Routing (electronic design automation)", "Routing algorithm", "Optimization algorithm" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2026.132596" }, { "id": "https://openalex.org/W4408091726", "doi": "10.2139/ssrn.5162825", "title": "Low-Carbon Routing and Charging Planning for Electric Freight Trucks Utilizing Local Surplus Solar Power", "year": 2025, "publication_date": "2025-01-01", "type": "preprint", "language": "en", "authors": [ "Ryoji Miyabe", "Yu Fujimoto", "Yasuhiro Hayashi" ], "first_author": "Ryoji Miyabe", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Truck", "Automotive engineering", "Business", "Electric vehicle", "Transport engineering", "Environmental science", "Power (physics)", "Engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.5162825" }, { "id": "https://openalex.org/W7166650191", "doi": "10.2139/ssrn.7028075", "title": "FLEX-DEPOT: An open-source framework for multi-market flexibility commercialization of a logistics depot incorporating electric trucks", "year": 2026, "publication_date": "2026-01-01", "type": "preprint", "language": null, "authors": [ "Marcel Brödel", "Woan-Ho Park", "Philipp Rosner", "Markus Lienkamp" ], "first_author": "Marcel Brödel", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Flexibility (engineering)", "Commercialization", "Truck", "Electricity", "Transparency (behavior)", "Software", "Python (programming language)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.7028075" }, { "id": "https://openalex.org/W7146947504", "doi": "10.1109/tits.2026.3677411", "title": "Reinforcement Learning and Exact Optimization for Traffic-Weighted Hybrid Truck-Drone Last-Mile Delivery With Deadlines", "year": 2026, "publication_date": "2026-03-31", "type": "article", "language": null, "authors": [ "Abdullahi Sani Shuaibu", "Ashraf Sharif Mahmoud", "Tarek Sheltami", "Anis Elgabli" ], "first_author": "Abdullahi Sani Shuaibu", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "We propose a Reinforcement Learning (RL) framework for hybrid truck-drone Last-Mile Delivery (LMD), where drones launch from a truck and either rendezvous with it or return to the depot after serving customers, subject to vehicle range limits and customer-defined deadlines. Deliveries completed after the latest allowable service time are treated as deadline violations (lateness) and are penalized in the objective. To provide an exact reference, a Mixed Integer Linear Programming (MILP) model is formulated. It serves both as a benchmark for evaluating the RL approach and as a practical method when the delivery set is small or when minimizing lateness is the primary objective, since the exact MILP solution is guaranteed to be optimal but become computationally expensive to solve as problem size grows due to the combinatorial increase in routing and coordination possibilities. The RL method is introduced as a scalable alternative for larger hybrid truck-drone deployments because it maintains practical computation times through iterative learning and avoids the exponential growth in solving effort associated with exact optimization. The RL framework employs an$\\epsilon $-greedy policy with decay and a reward structure that mirrors the MILP objective. Traffic congestion is incorporated through a scaling matrix that adjusts truck travel times on road segments, while drones remain unaffected due to aerial operation. RL is further benchmarked against Genetic Algorithm (GA) and Particle Swarm Optimiztion (PSO), which are also formulated to align with the same MILP objective to ensure a consistent basis for comparison. Results show that the RL component scales more efficiently with increasing delivery size while maintaining competitive solution quality.", "keywords": [ "Reinforcement learning", "Benchmark (surveying)", "Scalability", "Integer programming", "Range (aeronautics)", "Linear programming", "Set (abstract data type)", "Particle swarm optimization", "Routing (electronic design automation)" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2026.3677411" }, { "id": "https://openalex.org/W7160284882", "doi": "10.1007/s10479-026-07243-5", "title": "A Bayesian trust-based hybrid truck-drone coalition framework for resilient and sustainable last-mile delivery", "year": 2026, "publication_date": "2026-05-05", "type": "article", "language": "en", "authors": [ "Armin Mahmoodi", "Seyed Mojtaba Sajadi", "Said M. Easa" ], "first_author": "Armin Mahmoodi", "venue": "Annals of Operations Research", "publisher": "Springer Science+Business Media", "abstract": "Abstract This study proposes a novel hybrid Truck-Drone-Coalition (TDC) framework to enhance the resilience and sustainability of last-mile urban delivery systems. The model optimizes four conflicting objectives simultaneously: total delivery cost, service time, operational risk, and unmanned aerial vehicles (UAVs, also called drones) energy consumption. To address behavioral uncertainty among coalition partners, we integrate a Bayesian trust update mechanism with a Markov transition process, enabling dynamic adjustment of cooperation levels and automatic activation of fallback outsourcing when trust thresholds are breached. The solution combines an exact Mixed-Integer Linear Programming (MILP) core with a Non-dominated Sorting Genetic Algorithm II (NSGA-II) metaheuristic to ensure feasible routing, coalition stability, and robust Pareto-optimal trade-offs. Validated using real-world urban scenarios (Solomon benchmarks and commercial UAV specifications), the framework demonstrates: (a) 18% fewer delivery disruptions compared to static trust models, (b) 94% on-time delivery rate under high uncertainty (an 11% improvement over the base case), and (c) 9% lower costs and 12% higher energy efficiency through adaptive coalition reconfiguration. Simulation results demonstrate that the Bayesian trust mechanism effectively detects misbehavior, reallocates tasks via third-party outsourcing, and sustains service reliability under coalition instability or UAV breakdowns. Additionally, dynamic Shapley cost-sharing ensures fair cost allocation among coalition members. By integrating trust modeling, cooperative game theory, and risk-aware controls, this research bridges a critical gap in hybrid truck-drone logistics. The findings provide actionable insights for logistics managers seeking cost-effective, flexible, and resilient last-mile solutions. Future work will focus on real-time trust evaluation and dynamic coalition reconfiguration using live operational data.", "keywords": [ "Control reconfiguration", "Resilience (materials science)", "Sorting", "Cooperative game theory", "Service (business)", "Reliability (semiconductor)", "Markov decision process", "Pooling", "Service provider", "Game theory" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10479-026-07243-5" }, { "id": "https://openalex.org/W3135789488", "doi": "10.1109/tiv.2021.3063221", "title": "Joint Routing and Scheduling of Mobile Charging Infrastructure for V2V Energy Transfer", "year": 2021, "publication_date": "2021-03-03", "type": "article", "language": "en", "authors": [ "Mohammad Ekramul Kabir", "Ibrahim Sorkhoh", "Bassam Moussa", "Chadi M. Assi" ], "first_author": "Mohammad Ekramul Kabir", "venue": "IEEE Transactions on Intelligent Vehicles", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "An adequate charging infrastructure advocates to ameliorate the range anxiety to propel the disparaged electric vehicle (EV) market. But, the high initial installation cost, requirement of suitable places and the anticipated immense load on the grid during peak times hinder to elongate the charging station network, especially in urban areas. Fortunately, the bidirectional energy transferring capability between vehicles (i.e., V2V) may act as an auxiliary solution to charge an EV at any place and at any time without leaning on a stationary charging infrastructure. In this work, we assume a market where charging providers each has a number of charging trucks equipped with a larger battery and a fast charger to charge a number of EVs at some particular parking lots. A provider intends to maximize the served number of EVs using its limited number of charging trucks, when an EV should be considered as served only if it would be fully charged during its declared charging window. All charging requests are assumed to be received by an agent which provisions a route and schedule for each charging truck and all trucks should return to the depot after serving EVs. We formulate this combinatorially hard problem as an integer linear program (ILP) to maximize the number of served EVs by determining the optimal trajectory of each truck. Owing to its complexity, we present a solution methodology by decomposing the problem using Dantzig-Wolfe decomposition approach; we divide the problem into one master problem and a set of pricing problems (one for each EV) and achieve the solution iteratively. Though the solution achieved from the decomposition might not be optimal, it is faster to be applicable in practice. We also compare the performance with two heuristic algorithms and report on the collected results.", "keywords": [ "Truck", "Charging station", "Computer science", "Schedule", "Grid", "Scheduling (production processes)", "Transfer (computing)", "Operations research", "Electric vehicle", "Mathematical optimization", "Automotive engineering", "Engineering" ], "cited_by_count": 61, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tiv.2021.3063221" }, { "id": "https://openalex.org/W4388109215", "doi": "10.2139/ssrn.4618076", "title": "Depot Charging Schedule Optimization for Medium- and Heavy-Duty Battery-Electric Trucks", "year": 2023, "publication_date": "2023-01-01", "type": "preprint", "language": "en", "authors": [ "Shuhan Song", "Yin Qiu", "Robyn Leigh Coates", "Cristina Dobbelaere", "Paige Seles" ], "first_author": "Shuhan Song", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Truck", "Schedule", "Automotive engineering", "Heavy duty", "Battery (electricity)", "Duty", "Business", "Computer science", "Engineering", "Physics", "Power (physics)", "Political science" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.4618076" }, { "id": "https://openalex.org/W4386955371", "doi": "10.1016/j.cor.2023.106435", "title": "The drone-assisted pickup and delivery problem: An adaptive large neighborhood search metaheuristic", "year": 2023, "publication_date": "2023-09-22", "type": "article", "language": "en", "authors": [ "Timothy Mulumba", "Waleed Najy", "Ali H. Diabat" ], "first_author": "Timothy Mulumba", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Truck", "Metaheuristic", "Computer science", "Pickup", "Benchmarking", "Operations research", "Integer programming", "Last mile (transportation)", "Vehicle routing problem", "Routing (electronic design automation)", "Artificial intelligence" ], "cited_by_count": 49, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2023.106435" }, { "id": "https://openalex.org/W2751479907", "doi": "10.1016/j.tre.2017.07.010", "title": "An exact algorithm for the container drayage problem under a separation mode", "year": 2017, "publication_date": "2017-08-31", "type": "article", "language": "en", "authors": [ "Yujian Song", "Jiantong Zhang", "Zhe Liang", "Chunming Ye" ], "first_author": "Yujian Song", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Container (type theory)", "Separation (statistics)", "Vehicle routing problem", "Vertex (graph theory)", "Mode (computer interface)", "Algorithm", "Truck", "Set (abstract data type)", "Graph", "Computer science", "Routing (electronic design automation)", "Mathematical optimization" ], "cited_by_count": 62, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2017.07.010" } ]