[ { "id": "https://openalex.org/W4220684861", "doi": "10.54543/etnik.v1i5.68", "title": "Pembuktian Isu Kehilangan BBM Head Truck Depo Transhipment Pada PT. Berkah Multi Cargo Logistic", "year": 2022, "publication_date": "2022-02-20", "type": "article", "language": "en", "authors": [ "Budi Hermawan", "Abdurrahman Faris Indriya Himawan" ], "first_author": "Budi Hermawan", "venue": "ETNIK Jurnal Ekonomi dan Teknik", "publisher": null, "abstract": "Head truck activities at PT. BMC Logistics is currently experiencing the issue of fuel consumption which is considered too wasteful, therefore it is suspected that there is a theft of fuel in the fuel tank. This study aims to prove the issue of fuel loss caused by theft by calculating the average fuel consumption (liters / hour) on each head truck every day with a sample of 15 head truck units located at the transshipment depot of PT. BMC Logistics which is located on Jalan Perak Utara, Pabean Cantian, Surabaya, East Java 60165. The research uses quantitative methods by collecting data based on a daily head truck checklist data sample from July 2021 to October 2021, then an average consumption of Liters per hour is made from the initial fuel filling to the next fuel filling, then a normality test is carried out to find out whether H0 (theft did not occur) is accepted or rejected. From the results of the study it was found that the test data were normally distributed. which means that the issue of fuel theft really didn't happen.", "keywords": [ "Truck", "Fuel efficiency", "Sample (material)", "Checklist", "Head (geology)", "Consumption (sociology)", "Business", "Computer science", "Operations management", "Transport engineering", "Automotive engineering", "Engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.54543/etnik.v1i5.68" }, { "id": "https://openalex.org/W2005565913", "doi": "10.1016/j.cie.2012.04.008", "title": "Robust door assignment in less-than-truckload terminals", "year": 2012, "publication_date": "2012-05-07", "type": "article", "language": "en", "authors": [ "Korhan Acar", "Ali Yalçin", "Daniel Veselov Yankov" ], "first_author": "Korhan Acar", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Doors", "Heuristic", "Truck", "Terminal (telecommunication)", "Mathematical optimization", "Computer science", "Engineering", "Trailer", "Operations research", "Simulation", "Mathematics", "Automotive engineering" ], "cited_by_count": 36, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2012.04.008" }, { "id": "https://openalex.org/W2077125592", "doi": "10.1057/mel.2013.12", "title": "An optimization model for the inland repositioning of empty containers", "year": 2013, "publication_date": "2013-08-09", "type": "article", "language": "en", "authors": [ "Alessandro Adriano Olivo", "Massimo Di Francesco", "Paola Zuddas" ], "first_author": "Alessandro Adriano Olivo", "venue": "Maritime Economics & Logistics", "publisher": "Palgrave Macmillan", "abstract": null, "keywords": [ "Container (type theory)", "Truck", "Anticipation (artificial intelligence)", "Routing (electronic design automation)", "Operations research", "Computer science", "Process (computing)", "Engineering", "Computer network", "Artificial intelligence", "Automotive engineering" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1057/mel.2013.12" }, { "id": "https://openalex.org/W2160102731", "doi": "10.1007/s10462-004-7190-4", "title": "Airport Gate Scheduling with Time Windows", "year": 2005, "publication_date": "2005-04-06", "type": "article", "language": "en", "authors": [ "Andrew E. B. Lim", "Brian B. Rodrigues", "Yejun Zhu" ], "first_author": "Andrew E. B. Lim", "venue": "Artificial Intelligence Review", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Computer science", "Solver", "Scheduling (production processes)", "Tabu search", "Heuristics", "Mathematical optimization", "Arrival time", "Job shop scheduling", "Schedule", "Algorithm", "Transport engineering", "Engineering" ], "cited_by_count": 69, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ink.library.smu.edu.sg/lkcsb_research/2623" }, { "id": "https://openalex.org/W2024685831", "doi": "10.1109/iccie.2009.5223927", "title": "Scheduling transshipment operations in a multiple inbound and outbound door crossdock", "year": 2009, "publication_date": "2009-07-01", "type": "conference-paper", "language": "en", "authors": [ "Rim Larbi", "Gülgün Alpan", "Bernard Penz" ], "first_author": "Rim Larbi", "venue": null, "publisher": null, "abstract": "Cross-docking is a logistic technique which seeks to reduce costs related to inventory holding, order picking, transportation as well as the delivery time. Little attention has been given to the transshipment operations inside a cross-docking platform. Most of the existing work in this domain is limited to scheduling of operations for a restricted class of cross-docks, such as the mono input and output platforms. In this article, we study the transshipment scheduling problem in a multiple inbound and outbound dock configuration. In the cross-docking facility under study, transshipment operations are performed based on the decisions taken at the supervisory level. Incoming products are either directly loaded to an outbound truck, if the truck is already available at an outbound dock, or they are temporarily stored incurring a unit holding cost. The supervisor can also decide to replace an outbound truck to facilitate direct loading but this decision costs a unit replacement cost. The objective is to find the best schedule of transshipment operations to minimize the sum of inventory holding and truck replacement costs. In this article, we present 2 heuristics to attain this objective. Several numerical experiments are presented. The results are compared with the optimal solution to evaluate the performance of the method.", "keywords": [ "Transshipment (information security)", "Truck", "Computer science", "Operations research", "Heuristics", "Scheduling (production processes)", "Holding cost", "Operational costs", "Operations management", "Engineering", "Automotive engineering", "Operating system" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/iccie.2009.5223927" }, { "id": "https://openalex.org/W4293393303", "doi": "10.1016/j.dajour.2022.100113", "title": "The applications of multiple route optimization heuristics and meta-heuristic algorithms to solid waste transportation: A case study in Turkey", "year": 2022, "publication_date": "2022-08-28", "type": "article", "language": "en", "authors": [ "Ufuk Dereci", "Muhammed Erkan Karabekmez" ], "first_author": "Ufuk Dereci", "venue": "Decision Analytics Journal", "publisher": "Elsevier BV", "abstract": "The dense population and high solid waste production make it challenging to determine the optimal routes for garbage collection trucks in metropolitan cities. Moreover, incorrectly planned routes cause waste of fuel, time, and other resources in the municipal garbage collection process. Vehicle Routing Problem (VRP) is a combinatorial optimization problem that aims to find optimal routes for a certain number of vehicles that start from a depot, visit all customers, and return to the depot. This study aims to find the optimal routes that satisfy all the needs by considering the waste collection process of the Istanbul Umraniye district. Data on the currently used routes, daily tonnages, number of truck trips, and the number and locations of containers in the Umraniye district were obtained from the Umraniye municipality. We solve the route optimization problem of the Umraniye municipality with multiple heuristics and meta-heuristic algorithms like the nearest neighbor, savings, Christofides, simulated annealing, greedy descent, guided local search, and Tabu Search algorithms. We show the examined heuristics and meta-heuristics can produce fast and feasible solutions to large-size real-life problems.", "keywords": [ "Vehicle routing problem", "Heuristics", "Tabu search", "Computer science", "Truck", "Simulated annealing", "Local search (optimization)", "Metaheuristic", "Garbage collection", "Population", "Mathematical optimization", "Garbage" ], "cited_by_count": 44, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2772662222000480/pdf" }, { "id": "https://openalex.org/W7170814640", "doi": "10.24433/co.5623911.v2", "title": "FLEX-DEPOT: An open-source framework for multi-market flexibility commercialization of a logistics depot incorporating electric trucks", "year": 2026, "publication_date": "2026-07-24", "type": "software", "language": "en", "authors": [ "Marcel Brödel" ], "first_author": "Marcel Brödel", "venue": "Code Ocean", "publisher": null, "abstract": "FLEX-DEPOT: An open-source framework for multi-market flexibility commercialization of a logistics depot incorporating electric trucks Marcel Brödel FLEX-DEPOT is a Python project for optimizing flexibility at a logistics depot incorporating electric trucks. It combines market price series, flexibility power and energy bands, and market trading rules into a single rolling-horizon optimization (MPC). The core of the project is a MILP/LP (depending on settings) Pyomo model that decides market positions and physical power flow between depot and public grid while respecting aggregated asset power and energy flexibility bounds and gate-closure rules. Key capabilities: Unified optimization for DA/ID spot markets. Ready to implement other markets. (Optional) second optimization run with imbalance activated to ensure feasiblity. Rolling-horizon MPC that commits market positions when gate closure is reached. CSV-based I/O for prices, flexibility bounds, and results. Plotly-based visualization of dispatch, prices, and cashflows.", "keywords": [ "Flexibility (engineering)", "Commercialization", "Truck", "Profit (economics)", "Grid", "Depot", "Electric power system", "Electric power" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.24433/co.5623911.v2" }, { "id": "https://openalex.org/W7165737672", "doi": "10.24433/co.5623911.v1", "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": "software", "language": "en", "authors": [ "Marcel Brödel" ], "first_author": "Marcel Brödel", "venue": "Code Ocean", "publisher": null, "abstract": "FLEX-DEPOT is a Python project for optimizing flexibility at a logistics depot incorporating electric trucks. It combines market price series, flexibility power and energy bands, and market trading rules into a single rolling-horizon optimization (MPC). The core of the project is a MILP/LP (depending on settings) Pyomo model that decides market positions and physical power flow between depot and public grid while respecting aggregated asset power and energy flexibility bounds and gate-closure rules. Key capabilities: - Unified optimization for DA/ID spot markets. Ready to implement other markets. - (Optional) second optimization run with imbalance activated to ensure feasiblity. - Rolling-horizon MPC that commits market positions when gate closure is reached. - CSV-based I/O for prices, flexibility bounds, and results. - Plotly-based visualization of dispatch, prices, and cashflows.", "keywords": [ "Flexibility (engineering)", "Truck", "Commercialization", "Profit (economics)", "Grid", "Energy market", "Electric power system", "Spot market", "Electric power" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.24433/co.5623911.v1" }, { "id": "https://openalex.org/W3155393628", "doi": "10.1016/j.ejor.2021.03.064", "title": "The Piggyback Transportation Problem: Transporting drones launched from a flying warehouse", "year": 2021, "publication_date": "2021-04-13", "type": "article", "language": "en", "authors": [ "Kai Wang", "Erwin Pesch", "Dominik Kreß", "Ilia Fridman", "Nils Boysen" ], "first_author": "Kai Wang", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Launched", "Drone", "Warehouse", "Transport engineering", "Operations research", "Business", "Computer science", "Aeronautics", "Operations management", "Engineering", "Marketing" ], "cited_by_count": 50, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2021.03.064" }, { "id": "https://openalex.org/W1975597313", "doi": "10.1080/002075497194930", "title": "DoorFAST: A constructive procedure to optimally layout a facility including aisles and door locations basedon anaisle flow distance metric", "year": 1997, "publication_date": "1997-07-01", "type": "article", "language": "en", "authors": [ "Bridget Benson", "B. L. Foote" ], "first_author": "Bridget Benson", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "A methodology for designing a layout for factories, office buildings or homes is presented based on a new metric SPAAC (shortest path along aisles and corridors). The metric represents the correct movement of a fork truck or an AGV along aisles from door to door. Floyd's algorithm is used to compute the metric. Optimization is based on fundamental work by Drezner (1987) implemented by Tretheway (1992). Linear programming and genetic algorithms are used to optimize door placement based on the overall metric for the layout. Department size is explicitly included in the cost model. An expert system rule for plant layout is suggested based on test rules.", "keywords": [ "Metric (unit)", "Truck", "Mathematical optimization", "Path (computing)", "Computer science", "Fork (system call)", "Shortest path problem", "Genetic algorithm", "Constructive", "Engineering", "Mathematics", "Theoretical computer science" ], "cited_by_count": 30, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/002075497194930" }, { "id": "https://openalex.org/W2025932450", "doi": "10.1016/j.compchemeng.2014.06.010", "title": "Simultaneous production and distribution of industrial gas supply-chains", "year": 2014, "publication_date": "2014-06-28", "type": "article", "language": "en", "authors": [ "Pablo A. Marchetti", "Vijay Gupta", "Ignacio E. Grossmann", "Lauren M. Cook", "Pierre-Marie Valton", "Tejinder Pal Singh", "Tong Li", "Jean Michel André" ], "first_author": "Pablo A. Marchetti", "venue": "Computers & Chemical Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Production (economics)", "Supply chain", "Distribution (mathematics)", "Integer programming", "Linear programming", "Truck", "Operations research", "Set (abstract data type)", "Order (exchange)", "Selection (genetic algorithm)", "Mathematical optimization", "Computer science" ], "cited_by_count": 51, "is_retracted": false, "is_paratext": false, "open_access_url": "https://linkinghub.elsevier.com/science/article/pii/S0098135414001896" }, { "id": "https://openalex.org/W4389941392", "doi": "10.1016/j.cie.2023.109851", "title": "Learning for multiple purposes: A Q-learning enhanced hybrid metaheuristic for parallel drone scheduling traveling salesman problem", "year": 2023, "publication_date": "2023-12-18", "type": "article", "language": "en", "authors": [ "Ping Chen", "Qianlong Wang" ], "first_author": "Ping Chen", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Travelling salesman problem", "Metaheuristic", "Computer science", "Scheduling (production processes)", "Mathematical optimization", "Job shop scheduling", "Reinforcement learning", "Heuristic", "Artificial intelligence", "Operations research", "Engineering" ], "cited_by_count": 47, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2023.109851" }, { "id": "https://openalex.org/W7165944231", "doi": "10.1061/9780784487020.074", "title": "Route Optimization Framework for Electric versus Gasoline Truck Fleets", "year": 2026, "publication_date": "2026-06-25", "type": "conference-paper", "language": null, "authors": [ "Sarah Saadeh", "Shams Tanvir" ], "first_author": "Sarah Saadeh", "venue": null, "publisher": null, "abstract": "Freight transportation plays a critical role in economic activity but remains a major source of congestion, energy consumption, and greenhouse gas emissions. As California advances toward cleaner mobility, electric trucks (ETs) present an opportunity to reduce environmental impacts; however, their advantages depend on traffic conditions, route characteristics, and temporal variability. This study develops a Geographic Information Systems (GIS) framework that integrates Caltrans Performance Measurement System (PeMS) traffic data with vehicle energy models to evaluate the relative efficiency of electric and gasoline trucks across freeway corridors. By generating time-of-day traffic profiles and mapping energy performance along key routes, the framework identifies segments where ETs have superior performance over gasoline trucks, particularly in urban delivery contexts and off-peak operations. Conversely, gasoline trucks retain advantages on long-haul routes constrained by battery range. The findings provide fleet managers with data-driven guidance for route selection, vehicle deployment, and infrastructure planning to support sustainable freight transportation.", "keywords": [ "Truck", "Gasoline", "Greenhouse gas", "Key (lock)", "Sustainable transport", "Battery electric vehicle", "Energy (signal processing)", "Battery (electricity)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1061/9780784487020.074" }, { "id": "https://openalex.org/W3107391387", "doi": "10.1016/j.cor.2020.105141", "title": "Combined strip and discharge delivery of containers in heterogeneous fleets with time windows", "year": 2020, "publication_date": "2020-11-30", "type": "article", "language": "en", "authors": [ "Xinan Yang", "Hajem Ati Daham", "Abdellah Salhi" ], "first_author": "Xinan Yang", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Container (type theory)", "Truck", "Computer science", "Vehicle routing problem", "Mathematical optimization", "Chassis", "Operations research", "Reuse", "Genetic algorithm", "Routing (electronic design automation)", "Automotive engineering", "Mathematics" ], "cited_by_count": 23, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2020.105141" }, { "id": "https://openalex.org/W7134958241", "doi": "10.24406/publica-7834", "title": "Charging Strategies for Battery Electric Trucks in Germany", "year": 2026, "publication_date": "2026-01-01", "type": "other", "language": "en", "authors": [ "Daniel Speth", "Saskia Paasch", ":unav" ], "first_author": "Daniel Speth", "venue": "Fraunhofer-Publica (Fraunhofer-Gesellschaft)", "publisher": "Fraunhofer-Gesellschaft", "abstract": "Battery electric trucks (BETs) are a promising option to reduce emissions from heavy-duty vehicles. However, the transition to BETs will cause an additional demand for electricity. Future charging strategies will influence the future peak load as well as the operational and technical feasibility of BETs. We simulated 2410 representative single-day German truck driving profiles with three different charging strategies: (1) as slow as possible, (2) as fast as possible, and (3) slowly at depots and as fast as possible at public locations. Assuming a 33% electrification rate by 2030 and near-complete fleet conversion by 2045, we scaled our results to the German truck fleet. We found that charging as fast as possible leads to additional peak loads up to 6 GW in 2030 and 18 GW in 2045, while the other charging strategies reduce additional peak loads to 3 GW in 2030 and 8 GW in 2045. Therefore, implementing wise charging strategies will reduce future peak load.", "keywords": [ "Truck", "Electrification", "Battery (electricity)", "Battery capacity", "Electric vehicle", "Peak load" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.24406/publica-7834" }, { "id": "https://openalex.org/W7160154228", "doi": "10.3390/systems14050491", "title": "Optimization of Transportation and Delivery Routes Under Regional Constraints: A Two-Stage Solution Model Based on SDVRP and Truck-Drone Collaboration", "year": 2026, "publication_date": "2026-04-30", "type": "article", "language": "en", "authors": [ "Weiquan Kong", "Senlai Zhu", "Gaoming Yu" ], "first_author": "Weiquan Kong", "venue": "Systems", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "With the rapid development of e-commerce and the increasing complexity of urban logistics, traditional delivery methods face significant challenges due to regional traffic restrictions and congestion. This paper presents a two-stage optimization approach for urban delivery routing, integrating the Split Delivery Vehicle Routing Problem (SDVRP) and truck-drone collaboration to address these challenges. In the first stage, a transportation route optimization model based on SDVRP is proposed, which accounts for regional constraints and vehicle capacity limitations. The model allows for demand splitting, reducing the number of vehicles required and minimizing transportation costs. In the second stage, a truck-drone collaborative delivery model is introduced to handle the “last mile” distribution, where drones complement trucks by delivering to areas with restricted vehicle access. The optimization model aims to minimize overall delivery costs while ensuring timely service. An enhanced genetic algorithm is further developed to solve this complex, multi-constrained model. Experimental results show that the proposed collaborative strategy reduces delivery costs by over 10% compared to truck-only delivery, and the improved algorithm achieves a 4.77% average cost reduction over traditional approaches. This study provides valuable insights for optimizing urban logistics systems under regional constraints, offering both theoretical and practical contributions to smart logistics development.", "keywords": [ "Truck", "Vehicle routing problem", "Genetic algorithm", "Routing (electronic design automation)", "Traffic congestion", "City logistics", "Complement (music)", "Drone" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2079-8954/14/5/491/pdf?version=1779066150" }, { "id": "https://openalex.org/W2531379418", "doi": "10.1016/j.trd.2016.10.002", "title": "The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems considering carbon dioxide emissions", "year": 2016, "publication_date": "2016-10-15", "type": "article", "language": "en", "authors": [ "Hongqi Li", "Jun-Li Yuan", "Tan Lv", "Xinyu Chang" ], "first_author": "Hongqi Li", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Truck", "Trailer", "Scheduling (production processes)", "Routing (electronic design automation)", "Transport engineering", "Heuristic", "Operations research", "Engineering", "Computer science", "Operations management", "Automotive engineering" ], "cited_by_count": 66, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2016.10.002" }, { "id": "https://openalex.org/W2141668000", "doi": "10.1016/j.atmosenv.2013.06.029", "title": "Species profiles and normalized reactivity of volatile organic compounds from gasoline evaporation in China", "year": 2013, "publication_date": "2013-06-26", "type": "article", "language": "en", "authors": [ "Yanli L. Zhang", "Xinming Wang", "Zhou Zhang", "Sujun Lü", "Min Shao", "Shuncheng Lee", "Jian Zhen Yu" ], "first_author": "Yanli L. Zhang", "venue": "Atmospheric Environment", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Gasoline", "Toluene", "Chemistry", "Benzene", "Volatile organic compound", "Environmental chemistry", "Evaporation", "Pentane", "Hydrocarbon", "Organic chemistry", "Meteorology" ], "cited_by_count": 176, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.atmosenv.2013.06.029" }, { "id": "https://openalex.org/W2474844884", "doi": "10.1016/j.trpro.2016.05.217", "title": "The Roads’ Role in the Freight Transport System", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Rikard Engström" ], "first_author": "Rikard Engström", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The transport system is often described as the lifeblood system of modern society. Roads constitute a fundamental part of this system for both passenger and freight transports. Freight transport is expected to increase throughout Europe by 80% until 2050 (EU, 2011). ITF (2015) stated that international freight transport to ports will increase fourfold until 2050. This will, ceteris paribus, result in a severe increase of congestion and incidents. In turn, incidents will worsen congestion even more. This paper, which draws on current work in CEDR and PIARC, describes the role of the road in the freight transport system. The background to this paper comes from reports that state the road network alone cannot cope with the expected increase in transport flows. Important road freight areas and issues about how to reach a more sustainable freight system are identified and discussed in this paper. These discussions include multimodal terminals and operations, autonomous vehicles, ITS, infrastructure usage, economies of scale, and behaviour/educational issues. The function of the road, from a freight perspective, is manifold. It is used for small shipments over short distances as well as their counterparts. Road freight is most often necessary in the beginning and in the end of the multimodal transport chain (first/last mile logistics). Furthermore, road freight is the only mode involved in many door-to-door freight chains, as it is usually the only mode involved. Such a chain might constitute one or several truck movements. Peak car is widely discussed but peak truck/peak freight might be something that needs to be considered for many reasons. The European climate and transport policies push for a modal shift from road to other modes of transportation. To meet this challenge the market-based transport system must develop into a truly multi-modal system. A smarter utilisation of the transport system is important from the perspective of economic, environmental, and social sustainability. However, more importantly there is a need to make road freight more sustainable in itself. Therefore one important role for the road is to try to stimulate and promote the possibilities for modal shift while another is to optimize its characteristics.", "keywords": [ "Truck", "Traffic management", "Transport engineering", "Work (physics)", "Business", "Mode of transport", "Last mile (transportation)", "Freight trains", "Sustainable transport", "Mile", "Sustainability", "Engineering" ], "cited_by_count": 61, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146516302198/pdf" }, { "id": "https://openalex.org/W3110096979", "doi": "10.1016/j.procs.2021.03.082", "title": "Methodology for Determining Charging Strategies for Freight Traffic Vehicles based on Traffic Simulation Results", "year": 2021, "publication_date": "2021-01-01", "type": "conference-paper", "language": "en", "authors": [ "Ricardo Miranda Jahn", "Anne Magdalene Syré", "Alexander Grahle", "Kai Martins-Turner", "Dietmar Göhlich" ], "first_author": "Ricardo Miranda Jahn", "venue": "Procedia Computer Science", "publisher": "Elsevier BV", "abstract": "The decarbonization of transport is one major challenge in the upcoming years. One possible solution is the use of battery electric vehicles (BEV). While electric passenger cars and their charging strategies are already in series production, battery electric trucks and their charging strategies are still mostly in the prototype stage. The range limitations of battery electric trucks represent a new challenge for logistics. Therefore, we introduce a methodology for determining charging strategies for freight transport vehicles based on transport simulation results. We analyze the results of an agent-based transport simulation (MATSim) and evaluate different settings of normal and fast charging points. We found for a case study dealing with the food retailing in Berlin, that for a fleet with 279 vehicles in 16 depots 214 normal and 61 fast charging points are sufficient to complete approx. 90% of the tours with BEV. If the vehicles share their charging points, only 71 fast charging points with 400 kW are sufficient. With higher charging power the share of charged vehicles hardly increases. With 29 additional high performance opportunity chargers within the city, all tours can be operated by battery electric trucks. Due to the large variance in route lengths, the results of the case study can be representative for the entire delivery traffic.", "keywords": [ "Truck", "Battery (electricity)", "Computer science", "Automotive engineering", "Electric vehicle", "Driving range", "Range (aeronautics)", "Transport engineering", "Battery electric vehicle", "Battery capacity", "Simulation", "Power (physics)" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877050921007183/pdf" }, { "id": "https://openalex.org/W4244905618", "doi": "10.1017/cbo9780511492013.012", "title": "Contestation in the streets: European protest and the emerging Euro-polity", "year": 2004, "publication_date": "2004-02-12", "type": "book-chapter", "language": "en", "authors": [ "Doug Imig" ], "first_author": "Doug Imig", "venue": "Cambridge University Press eBooks", "publisher": "Cambridge University Press", "abstract": "By the second week of September 2000, truckers, farmers, and fishermen protesting against high fuel prices had paralyzed the economies and governments of Western Europe – cutting off the fuel supply of businesses and private citizens alike. Linked together through trade unions and engaging in wildcat actions, the protesters made good their threats to raise blockades in a matter of hours, armed with little more than their vehicles and cell-phones. This round of protests against the high cost of fuel had started several weeks earlier in France, where fishermen barricaded fishing ports and turned away cross-channel ferries. Joined by truckers, farmers, and taxi drivers, they paralyzed refineries and oil depots, brought traffic on the Calais–Paris motorway to a standstill, and barricaded the streets of Marseille with tons of sardines and anchovies. The fishermen's actions had the desired effect: gaining concessions from the French government in the form of subsidy payments to offset fuel costs. But the government's capitulation, conversely, failed to stem the protests. Emboldened by the success of the fishermen, French truckers seized the initiative, blockading some eighty petrol depots and oil refineries across the country, shutting down the airport in Nice, and closing the channel tunnel, prompting the European Commission to launch an investigation into whether the French government was failing to uphold its obligation under EU rules to facilitate the free flow of goods and services.", "keywords": [ "Polity", "Political science", "Economy", "Political economy", "Business", "Market economy", "Economics", "Law", "Politics" ], "cited_by_count": 35, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1017/cbo9780511492013.012" }, { "id": "https://openalex.org/W4409018109", "doi": "10.4271/2025-01-8592", "title": "Energy Price Sensitivity and Cost Analysis of Battery Electric and Fuel Cell Powertrains for Class 8 Heavy-Duty Trucks in Real-World Scenarios: A 2024, 2035, and 2050 Perspective", "year": 2025, "publication_date": "2025-03-31", "type": "conference-paper", "language": "en", "authors": [ "Charbel Mansour", "Julien Bou Gebrael", "Amarendra Kancharla", "Vincent Freyermuth", "Ehsan Sabri Islam", "Ram Vijayagopal", "Olcay Sahin", "Natalia Zuniga", "Daniela Nieto Prada", "Michel Alhajjar", "Aymeric P. Rousseau", "Hoseinali Borhan", "Ouafae El Ganaoui-Mourlan" ], "first_author": "Charbel Mansour", "venue": "SAE technical papers on CD-ROM/SAE technical paper series", "publisher": null, "abstract": "This study evaluates the performance of alternative powertrains for Class 8 heavy-duty trucks under various real-world driving conditions, cargo loads, and operating ranges. Energy consumption, greenhouse gas emissions, and the Levelized Cost of Driving (LCOD) were assessed for different powertrain technologies in 2024, 2035, and 2050, considering anticipated technological advancements. The analysis employed simulation models that accurately reflect vehicle dynamics, powertrain components, and energy storage systems, leveraging real-world driving data. An integrated simulation workflow was implemented using Argonne National Laboratory's POLARIS, SVTrip, Autonomie, and TechScape software. Additionally, a sensitivity analysis was performed to assess how fluctuations in energy and fuel costs impact the cost-effectiveness of various powertrain options. By 2035, battery electric trucks (BEVs) demonstrate strong cost competitiveness in the 0-250 mile and 250-500 mile ranges, especially when primarily charged at depots. Fuel cell electric vehicles (FCEVs) remain competitive in the 250-500-mile range, particularly under higher diesel prices. For distances over 500 miles, FCEVs become the preferred solution, providing greater range and operational flexibility. By 2050, technological advancements and reduced truck costs further enhance the feasibility of both BEVs and FCEVs. The BEV500 shows improved efficiency and resilience to energy price fluctuations, making it viable for medium-range operations and cost-effective even with high en-route electricity rates. FCEVs are expected to remain competitive in both medium and long-range operations, especially when diesel prices are elevated, positioning them as strong alternatives to conventional powertrains for long-haul routes.", "keywords": [ "Powertrain", "Truck", "Heavy duty", "Battery (electricity)", "Automotive engineering", "Sensitivity (control systems)", "Fuel cells", "Perspective (graphical)", "Environmental science", "Computer science", "Engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.4271/2025-01-8592" }, { "id": "https://openalex.org/W4388286362", "doi": "10.1109/access.2023.3329195", "title": "Drone-Based Delivery Systems: A Survey on Route Planning", "year": 2023, "publication_date": "2023-01-01", "type": "article", "language": "en", "authors": [ "Giulio Attenni", "Viviana Arrigoni", "Novella Bartolini", "Gaia Maselli" ], "first_author": "Giulio Attenni", "venue": "IEEE Access", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "The ever-increasing demand for urban delivery services significantly exacerbates the traffic conditions on our already overly congested urban streets. The problem is even worsened by the dearth of appropriate parking facilities available for efficient offloading operations. As a result, there has been a surge of interest in exploring eco-friendly alternatives to traditional truck-based logistics. Drone technology has significant potential to enable widespread home delivery services and reduce the reliance on trucks within urban areas. Both the academy and the industry have shown interest in developing swiftly deployable and cost-effective delivery systems that rely on drones. This work provides a comprehensive review of the current state of Drone-based Delivery Systems. It explores the latest advancements, methodologies, and employed techniques with a specific emphasis on optimizing task scheduling and designing efficient routes for drone deliveries. It critically analyzes the advantages and drawbacks of existing solutions, contributing a thorough classification based on crucial system features, such as fleet composition, degree of device cooperation, and underlying infrastructure.", "keywords": [ "Drone", "Computer science", "Truck", "Scheduling (production processes)", "Transport engineering", "Work (physics)", "Risk analysis (engineering)", "Computer security", "Business", "Engineering", "Operations management" ], "cited_by_count": 40, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ieeexplore.ieee.org/ielx7/6287639/6514899/10308587.pdf" }, { "id": "https://openalex.org/W3029222359", "doi": "10.1186/s12544-020-00409-7", "title": "Improving inbound logistic planning for large-scale real-world routing problems: a novel ant-colony simulation-based optimization", "year": 2020, "publication_date": "2020-04-14", "type": "article", "language": "en", "authors": [ "Giovanni Calabrò", "Vincenza Torrisi", "Giuseppe Inturri", "Matteo Ignaccolo" ], "first_author": "Giovanni Calabrò", "venue": "European Transport Research Review", "publisher": "Springer Science+Business Media", "abstract": "Abstract This paper presents the first results of an agent-based model aimed at solving a Capacitated Vehicle Routing Problem (CVRP) for inbound logistics using a novel Ant Colony Optimization (ACO) algorithm, developed and implemented in the NetLogo multi-agent modelling environment. The proposed methodology has been applied to the case study of a freight transport and logistics company in South Italy in order to find an optimal set of routes able to transport palletized fruit and vegetables from different farms to the main depot, while minimizing the total distance travelled by trucks. Different scenarios have been analysed and compared with real data provided by the company, by using a set of key performance indicators including the load factor and the number of vehicles used. First results highlight the validity of the method to reduce cost and scheduling and provide useful suggestions for large-size operations of a freight transport service.", "keywords": [ "Ant colony optimization algorithms", "Vehicle routing problem", "Truck", "NetLogo", "Scheduling (production processes)", "Operations research", "Computer science", "Routing (electronic design automation)", "Key (lock)", "Set (abstract data type)", "Transport engineering", "Engineering" ], "cited_by_count": 58, "is_retracted": false, "is_paratext": false, "open_access_url": "https://etrr.springeropen.com/counter/pdf/10.1186/s12544-020-00409-7" }, { "id": "https://openalex.org/W257682929", "doi": "10.1016/j.tra.2007.10.008", "title": "Necessary conditions for off-hour deliveries and the effectiveness of urban freight road pricing and alternative financial policies in competitive markets", "year": 2008, "publication_date": "2008-01-30", "type": "article", "language": "en", "authors": [ "José Holguín‐Veras" ], "first_author": "José Holguín‐Veras", "venue": "Transportation Research Part A Policy and Practice", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Toll", "Road pricing", "Incentive", "Business", "Finance", "Truck", "Marginal cost", "Economics", "Industrial organization", "Transport engineering", "Microeconomics", "Traffic congestion" ], "cited_by_count": 158, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tra.2007.10.008" }, { "id": "https://openalex.org/W2784486221", "doi": null, "title": "Truck scheduling at a cross-dock with repackaging", "year": 2017, "publication_date": "2017-07-30", "type": "conference-paper", "language": "en", "authors": [ "Christian Serrano", "Alexandre B. Dolgui", "Xavier Delorme" ], "first_author": "Christian Serrano", "venue": "HAL (Le Centre pour la Communication Scientifique Directe)", "publisher": "Centre National de la Recherche Scientifique", "abstract": "International audience", "keywords": [ "Truck", "Automotive industry", "Schedule", "Integer programming", "Scheduling (production processes)", "Transport engineering", "Computer science", "Linear programming", "Operations research", "Engineering", "Operations management", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hal-emse.ccsd.cnrs.fr/emse-01689360" }, { "id": "https://openalex.org/W1982461405", "doi": "10.1016/j.jtrangeo.2007.01.008", "title": "Timber haulage routing in Ireland: an analysis using GIS and GPS", "year": 2007, "publication_date": "2007-04-25", "type": "article", "language": "en", "authors": [ "Ger J. Devlin", "Kevin P. McDonnell", "Shane M. Ward" ], "first_author": "Ger J. Devlin", "venue": "Journal of Transport Geography", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Global Positioning System", "Transport engineering", "Truck", "Routing (electronic design automation)", "Geographic information system", "Computer science", "Dijkstra's algorithm", "Haulage", "Shortest path problem", "Geography", "Class (philosophy)", "Operations research" ], "cited_by_count": 67, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10197/6065" }, { "id": "https://openalex.org/W4394783593", "doi": "10.1016/j.trc.2024.104611", "title": "Dynamic vehicle routing problem with drone resupply for same-day delivery", "year": 2024, "publication_date": "2024-04-13", "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": "Transportation Research Part C Emerging Technologies", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Markov decision process", "Truck", "Operations research", "Vehicle routing problem", "Computer science", "Service (business)", "Routing (electronic design automation)", "Process (computing)", "Markov chain", "Partially observable Markov decision process", "Real-time computing" ], "cited_by_count": 43, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trc.2024.104611" }, { "id": "https://openalex.org/W4393365387", "doi": "10.11578/dc.20220823.1", "title": "HDEV Depot Load Profile Generation Code (Code to Generate Heavy-Duty Electric Truck Depot Load Profiles) [SWR-21-72]", "year": 2021, "publication_date": "2021-01-01", "type": "article", "language": "en", "authors": [ "Brennan Borlaug", "Matteo Muratori", "Madeline Gilleran" ], "first_author": "Brennan Borlaug", "venue": "OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)", "publisher": "Office of Scientific and Technical Information", "abstract": "Code developed to generate heavy-duty electric truck depot load profiles for the study, \"Heavy-Duty Truck Electrification and the Impacts of Depot Charging on Electricity Distribution Systems\", by Borlaug et al., published in 2021. This software is provided as-is without dedicated support. The programming environment for this study may be reproduced with conda (installed via the Anaconda website): conda env create -f environment.yml To activate the environment: conda activate hdev-depot-charging-2021", "keywords": [ "Depot", "Truck", "Heavy duty", "Code (set theory)", "Heavy load", "Computer science", "Automotive engineering", "Engineering", "Geography", "Structural engineering", "Set (abstract data type)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.osti.gov/biblio/1882917" }, { "id": "https://openalex.org/W7164171649", "doi": "10.5281/zenodo.20623638", "title": "The Electric Truck and Trailer Routing Problem with Time Windows", "year": 2026, "publication_date": "2026-06-10", "type": "dataset", "language": "en", "authors": [ "Ahmad Bassaleh" ], "first_author": "Ahmad Bassaleh", "venue": "Zenodo (CERN European Organization for Nuclear Research)", "publisher": "European Organization for Nuclear Research", "abstract": "This repository provides the dataset used in the Electric Truck and Trailer Routing Problem with Time Windows (ETTRPTW). The instances are formatted as follows: ###For each location the instance provides: -StringId as a unique identifier -Type indicates the function of the location, i.e, ---d: depot ---f: recharging station ---c1: truck customer location ---c2: vehicle customer location -x, y are coordinates (distances are assumed to be euclidean) -demand specifies the quantity of freight capacity required -ReadyTime and DueDate are the beginning and the end of the time window (waiting is allowed) -ServiceTime denotes the entire time spend at customer for loading operations ###For the electric vehicles (all identical): -\"E Vehicle fuel tank capacity\": units of energy available -\"W^1 Truck load capacity\": units available for cargo -\"W^2 Trailer load capacity\": units available for cargo -\"F^1 Truck cost\": acquisition cost of a solo truck unit -\"F^2 Complete vehicle cost\": acquisition cost of a truck carrying a trailer unit -\"alpha Energy consumption per unit distance\": reduction of battery capacity when traveling one unit of distance -\"beta Energy replenished per unit waiting time\": units of time required to recharge one unit of energy -\"v average Velocity\": assumed to be constant on all arcs, required to calculate the travel time from distance Modifications required for adapting this dataset to the EVRPTW and ESDVRPTW variants are discussed in Section 5 of the paper. Feel free to email me if you have any questions: ahbassaleh@shockers.wichita.edu", "keywords": [ "Truck", "Trailer", "Routing (electronic design automation)", "Energy consumption", "Fuel efficiency", "Unit (ring theory)", "Battery (electricity)", "Train" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5281/zenodo.20623638" }, { "id": "https://openalex.org/W7164156626", "doi": "10.5281/zenodo.20623639", "title": "The Electric Truck and Trailer Routing Problem with Time Windows", "year": 2026, "publication_date": "2026-06-10", "type": "dataset", "language": "en", "authors": [ "Ahmad Bassaleh" ], "first_author": "Ahmad Bassaleh", "venue": "Zenodo (CERN European Organization for Nuclear Research)", "publisher": "European Organization for Nuclear Research", "abstract": "This repository provides the dataset used in the Electric Truck and Trailer Routing Problem with Time Windows (ETTRPTW). The instances are formatted as follows: ###For each location the instance provides: -StringId as a unique identifier -Type indicates the function of the location, i.e, ---d: depot ---f: recharging station ---c1: truck customer location ---c2: vehicle customer location -x, y are coordinates (distances are assumed to be euclidean) -demand specifies the quantity of freight capacity required -ReadyTime and DueDate are the beginning and the end of the time window (waiting is allowed) -ServiceTime denotes the entire time spend at customer for loading operations ###For the electric vehicles (all identical): -\"E Vehicle fuel tank capacity\": units of energy available -\"W^1 Truck load capacity\": units available for cargo -\"W^2 Trailer load capacity\": units available for cargo -\"F^1 Truck cost\": acquisition cost of a solo truck unit -\"F^2 Complete vehicle cost\": acquisition cost of a truck carrying a trailer unit -\"alpha Energy consumption per unit distance\": reduction of battery capacity when traveling one unit of distance -\"beta Energy replenished per unit waiting time\": units of time required to recharge one unit of energy -\"v average Velocity\": assumed to be constant on all arcs, required to calculate the travel time from distance Modifications required for adapting this dataset to the EVRPTW and ESDVRPTW variants are discussed in Section 5 of the paper. Feel free to email me if you have any questions: ahbassaleh@shockers.wichita.edu", "keywords": [ "Truck", "Trailer", "Routing (electronic design automation)", "Energy consumption", "Fuel efficiency", "Unit (ring theory)", "Battery (electricity)", "Train" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5281/zenodo.20623639" }, { "id": "https://openalex.org/W2408150663", "doi": "10.1007/s10479-016-2233-1", "title": "A cluster-first route-second approach for the swap body vehicle routing problem", "year": 2016, "publication_date": "2016-05-28", "type": "article", "language": "en", "authors": [ "Juan José Miranda‐Bront", "Brian Curcio", "Isabel Méndez‐Díaz", "Agustín Montero", "Federico Pousa", "Paula Zabala" ], "first_author": "Juan José Miranda‐Bront", "venue": "Annals of Operations Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Swap (finance)", "Computer science", "Solver", "Vehicle routing problem", "Mathematical optimization", "Theory of computation", "Truck", "Trailer", "Operations research", "Routing (electronic design automation)", "Algorithm", "Mathematics" ], "cited_by_count": 47, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/11336/59804" }, { "id": "https://openalex.org/W2952533481", "doi": "10.1007/978-3-030-21803-4_111", "title": "The Traveling Salesman Drone Station Location Problem", "year": 2019, "publication_date": "2019-06-14", "type": "conference-paper", "language": "en", "authors": [ "Daniel Schermer", "Mahdi Moeini", "Oliver Wendt" ], "first_author": "Daniel Schermer", "venue": "Advances in intelligent systems and computing", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Travelling salesman problem", "Drone", "Job shop scheduling", "Truck", "Computer science", "Scheduling (production processes)", "Solver", "Mathematical optimization", "Vehicle routing problem", "Routing (electronic design automation)", "Operations research", "Real-time computing" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-030-21803-4_111" }, { "id": "https://openalex.org/W1528001933", "doi": null, "title": "Movement generation and trip distribution for freight demand modelling applied to city logistics", "year": 2013, "publication_date": "2013-08-01", "type": "article", "language": "en", "authors": [ "Guido Gentile", "Daniele Vigo" ], "first_author": "Guido Gentile", "venue": "IRIS Research product catalog (Sapienza University of Rome)", "publisher": null, "abstract": "The quantification of the freight movements disaggregated by supply chain occurring in each traffic zone for the urban delivery of goods and that of the corresponding Origin-Destination trip tables is essential to evaluate the effects of any city logistic policy in terms of vehicle congestion and polluting emissions through the assignment of truck flows on the road network. In this paper we propose two innovative demand models: the first one for movement generation, the second one for trip distribution. The movement generation is addressed through an extension of the category index model, which takes into account the hierarchy in the classification system of the economic activities, thus avoiding aggregating the many existing classification codes into pre-specified groups. The trip distribution is addressed through an adaptation of the gravity model, which takes into account that deliveries are organized in tours. This approach has been successfully applied to the case of Emilia-Romagna Region in Italy, where an extensive campaign of surveys has permitted to calibrate both models for several towns and cities with various dimensions and vocations.", "keywords": [ "Trip generation", "Transport engineering", "Trip distribution", "Truck", "Distribution (mathematics)", "Computer science", "Gravity model of trade", "Adaptation (eye)", "Index (typography)", "Hierarchy", "Operations research", "Business" ], "cited_by_count": 53, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10077/8872" }, { "id": "https://openalex.org/W2464256644", "doi": "10.1016/j.cor.2016.06.012", "title": "Location arc routing problem with inventory constraints", "year": 2016, "publication_date": "2016-06-21", "type": "article", "language": "en", "authors": [ "Juan‐Pablo Riquelme‐Rodríguez", "Michel Gamache", "André Langevin" ], "first_author": "Juan‐Pablo Riquelme‐Rodríguez", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Routing (electronic design automation)", "Arc routing", "Computer science", "Mathematical optimization", "Truck", "Arc (geometry)", "Operations research", "Computer network", "Mathematics", "Engineering", "Automotive engineering" ], "cited_by_count": 27, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2016.06.012" }, { "id": "https://openalex.org/W2055694806", "doi": "10.1243/09544062jmes2004", "title": "Factors influencing the energy consumption of road freight transport", "year": 2010, "publication_date": "2010-05-19", "type": "article", "language": "en", "authors": [ "A M C Odhams", "Richard L Roebuck", "Y J Lee", "Stephanie Hunt", "David Cebon" ], "first_author": "A M C Odhams", "venue": "Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science", "publisher": "SAGE Publishing", "abstract": "Key factors that influence the energy consumption of heavy goods vehicles are investigated. These factors include engine efficiency, aerodynamic drag and rolling resistance, vehicle configuration (number of vehicle units), traffic congestion, speed, payload factors, and the use of regenerative braking. An accurate, validated model of the fuel consumption of a 38 tonne tractor-semitrailer vehicle is used as a basis to derive fuel consumption models of a number of other vehicle configurations. These models included a rigid four-axle truck with maximum gross vehicle mass (GVM) of 26 tonnes; a six-axle tractor semitrailer with GVM of 44 tonnes, with and without regenerative braking; a ‘B-double’ with GVM of 60 tonnes; and an ‘A-double’ with GVM of 82 tonnes. These vehicle models were driven over a simple hypothetical drive cycle with a fixed maximum speed and varying numbers of stops in a 10 km stretch of road. It is concluded that: (a) improving engine efficiency, unladen mass, rolling resistance, and aerodynamic drag can yield relatively small improvements in fuel consumption, compared with other factors; (b) larger vehicles are always significantly more energy-efficient than smaller ones when fully loaded; (c) transferring freight from articulated vehicles to smaller rigid vehicles for urban deliveries typically increases fuel consumption by approximately 35 per cent; (d) running vehicles partially loaded can increase the energy per unit freight task by up to 65 per cent; and (e) under urban start—stop conditions, the use of regenerative braking systems can reduce heavy vehicle fuel consumption by 25–35 per cent.", "keywords": [ "Fuel efficiency", "Automotive engineering", "Axle", "Aerodynamic drag", "Tractor", "Rolling resistance", "Energy consumption", "Truck", "Payload (computing)", "Tonne", "Engineering", "Propulsion" ], "cited_by_count": 82, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1243/09544062jmes2004" }, { "id": "https://openalex.org/W2987225943", "doi": "10.1007/978-3-662-58866-6_15", "title": "Modular E-Drive Concepts for Light to Heavy Electric Trucks and Buses", "year": 2019, "publication_date": "2019-11-13", "type": "book-chapter", "language": "en", "authors": [ "Martin Huber", "Heimo Schreier", "Jürgen Tochtermann", "Martin Ackerl" ], "first_author": "Martin Huber", "venue": "Proceedings", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": null, "keywords": [ "Drivetrain", "Truck", "Axle", "Automotive engineering", "Modular design", "Axle load", "Engineering", "Suspension (topology)", "Computer science", "Torque", "Mechanical engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-662-58866-6_15" }, { "id": "https://openalex.org/W4411091403", "doi": "10.1108/jm2-09-2024-0303", "title": "Network-level optimal coordination of charging and platooning for electric trucks", "year": 2025, "publication_date": "2025-06-06", "type": "article", "language": "en", "authors": [ "Md Rakibul Alam", "Zhaomiao Guo" ], "first_author": "Md Rakibul Alam", "venue": "Journal of Modelling in Management", "publisher": "Emerald Publishing Limited", "abstract": "Purpose Electric trucks and platooning are promising technologies to reduce greenhouse gas emissions in the freight sector. To maximize the benefits of these two technologies, effective coordination of charging and platooning is essential, especially considering insufficient charging stations (CSs), long charging duration and tight freight delivery window for middle-mile electric trucks. Therefore, this paper aims to jointly optimize the scheduling of charging and platooning of electric trucks over the freight transportation network. Design/methodology/approach This paper proposes a mixed integer linear programming model to minimize the total costs from en-route charging, depot charging, and delivery delay. This also presents scenario analyses to understand the impacts of key features on system costs, including battery capacity, number of charging plugs at CSs, charging speed, availability of alternative paths and platoon energy-saving percentage. To solve the model with a large fleet size, a warm-start-based parameter-tuned solver approach, and hybrid metaheuristics of variable neighborhood search and local branching were implemented and compared based on performance. Findings The proposed model was implemented using the freight network in Florida. In a case study with a small fleet size, platoon scheduling reduced 19% of en-route charging cost and 30% of delivery delay cost compared with the case of only charge scheduling. Electric trucks were charged around three times with an average duration of 35 min per session to facilitate platoon scheduling and minimize the total cost. Originality/value Previous models optimized charging and platoon scheduling for single routes that cannot be generalized for network level and multiple origin-destination pairs; this study addresses network-level optimization.", "keywords": [ "Truck", "Electric vehicle", "Computer science", "Coordination game", "Business", "Automotive engineering", "Physics", "Microeconomics", "Power (physics)", "Economics", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/jm2-09-2024-0303" }, { "id": "https://openalex.org/W2251838373", "doi": "10.1007/978-3-319-13194-8_20", "title": "Strategies to Increase the Profitability of Electric Vehicles in Urban Freight Transport", "year": 2015, "publication_date": "2015-01-01", "type": "book-chapter", "language": "en", "authors": [ "Tessa T. Taefi", "Jochen Kreutzfeldt", "Tobias Held", "Andréas Fink" ], "first_author": "Tessa T. Taefi", "venue": "Green energy and technology", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Profitability index", "Transport engineering", "Business", "City logistics", "Engineering", "Finance" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-13194-8_20" }, { "id": "https://openalex.org/W2905286129", "doi": "10.1109/itsc.2018.8569606", "title": "Design and Operation of an Urban Electric Courier Cargo Bike System", "year": 2018, "publication_date": "2018-11-01", "type": "conference-paper", "language": "en", "authors": [ "Tanja Niels", "Moritz Travis Hof", "Klaus Bogenberger" ], "first_author": "Tanja Niels", "venue": null, "publisher": null, "abstract": "In recent years, the number of packages sent by Courier, Express and Parcel (CEP) services has increased significantly. Many people order products online expecting fast delivery and, additionally, more than every tenth product is sent back to the merchant. Delivery tours, which are mainly conducted by diesel trucks, account for increased traffic congestion and air pollution, especially in cities. Therefore, CEPs are required to create innovative solutions. In this paper, we present a project in Munich, Germany, where the last mile package delivery is carried out by a CEP company by cargo bikes and eBikes. To this end, two containers and one truck-trailer are placed in the city center which function as depot stations for the parcels to be delivered nearby. We analyze the delivery data, present an optimization scheme for finding suitable container locations, and simulate the routes conducted by cargo bikes for an average day. It can be concluded that the presented approach is a feasible solution for the package delivery in densely populated cities. The vehicle mileage covered by diesel trucks per day is significantly reduced from 180 km to 45 km, approximately.", "keywords": [ "Truck", "Transport engineering", "Trailer", "Last mile (transportation)", "Food delivery", "Computer science", "Container (type theory)", "Diesel fuel", "Automotive engineering", "Engineering", "Mile", "Business" ], "cited_by_count": 35, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/itsc.2018.8569606" }, { "id": "https://openalex.org/W1980099241", "doi": "10.1287/trsc.35.2.181.10132", "title": "Scheduling Trains and Containers with Due Dates and Dynamic Arrivals", "year": 2001, "publication_date": "2001-05-01", "type": "article", "language": "en", "authors": [ "Candace A. Yano", "Alexandra M. Newman" ], "first_author": "Candace A. Yano", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "We consider the problem of scheduling trains and containers (or trucks and pallets) between a depot and a destination. Goods arrive at the depot dynamically over time and have distinct due dates at the destination. There is a fixed-charge transportation cost for each vehicle, and each vehicle has the same capacity. The cost of holding goods may differ between the depot and the destination. The goal is to minimize the sum of transportation and holding costs. For the case in which all goods have the same holding costs, we consider two variations: one in which the holding cost at the destination is less than that at the origin, and one in which the relationship is reversed. For the first variation, we derive properties of the optimal solution which provide the basis for an O(T 2) solution procedure. For the second variation, we introduce a new definition of a regeneration state, derive strong characterizations of the shipment schedule within a regeneration interval, and develop an O(T 4) procedure. We also analyze two multi-item scenarios. In the first, for each item, the holding cost at the origin is less than that at the destination; in the second, the relationship is reversed for all items. We generalize several of the structural results for the single-item problem to the corresponding multi-item case. We also show that the optimal vehicle schedule can be obtained by solving a related single-item problem in which the item demands are aggregated in a particular way. The optimal assignment of customer orders to vehicles can then be found by solving a linear program.", "keywords": [ "Scheduling (production processes)", "Schedule", "Train", "Truck", "Computer science", "Operations research", "Mathematical optimization", "Mathematics", "Engineering" ], "cited_by_count": 41, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.35.2.181.10132" }, { "id": "https://openalex.org/W3175058681", "doi": "10.1145/3449639.3459342", "title": "Ants can solve the parallel drone scheduling traveling salesman problem", "year": 2021, "publication_date": "2021-06-21", "type": "conference-paper", "language": "en", "authors": [ "Quoc Trung Dinh", "Duc Dong Mai", "Minh Hoàng Hà" ], "first_author": "Quoc Trung Dinh", "venue": "Proceedings of the Genetic and Evolutionary Computation Conference", "publisher": null, "abstract": "In this work, we are interested in studying the parallel drone scheduling traveling salesman problem (PDSTSP), where deliveries are split between a truck and a fleet of drones. The truck performs a common delivery tour, while the drones are forced to perform back and forth trips between customers and a depot. The objective is to minimize the completion time coming back to the depot of all the vehicles. We present a hybrid ant colony optimization (HACO) metaheuristic to solve the problem. Our algorithm is based on an idea from the literature that represents a PDSTSP solution as a permutation of all customers. And then a dynamic programming is used to decompose the customer sequence into a tour for the truck and trips for the drones. We propose a new dynamic programming combined with other problem-tailored components to efficiently solve the problem. When being tested on benchmark instances from the literature, the HACO algorithm outperforms state-of-the-art algorithms in terms of both running time and solution quality. More remarkably, we find 23 new best known solutions out of 90 instances considered.", "keywords": [ "Travelling salesman problem", "Drone", "Computer science", "TRIPS architecture", "Metaheuristic", "Scheduling (production processes)", "Job shop scheduling", "Dynamic programming", "Ant colony optimization algorithms", "Mathematical optimization", "Benchmark (surveying)", "Truck" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1145/3449639.3459342" }, { "id": "https://openalex.org/W1499267992", "doi": null, "title": "Penerapan Metode Saving Matrix Dalam Penjadwalan Dan Penentuan Rute Distribusi Premium Di SPBU Kota Malang", "year": 2013, "publication_date": "2013-01-01", "type": "article", "language": "id", "authors": [ "Rahmi Yuniarti", "Murti Astuti" ], "first_author": "Rahmi Yuniarti", "venue": null, "publisher": null, "abstract": "Several existing problems in PT. Pertamina depot Malang in distributing premium products to the gas station in Malang is the high number of premium demand is not matched by the availability of the number of vehicles as well as sufficient capacity tank trucks, and inconsistencies in the distribution schedule every day, and the lack of a clear standard distribution service. Therefore, this study would like to set up distribution routes and schedules and determine the capacity and number of tank trucks are effective and efficient in order to benefit the company. In this research, the determination of the method of saving a useful matrix to solve the problem of transportation and distribution. Based on calculations using the method of saving matrix, then the distribution of these proposals can be given as many as 16 in the three stages of the delivery so that every gas station will have no shortage of fuel supply. Successfully reduced transportation costs and shortened the distance of 261 km to 259.6 km. In the distribution of premium in Malang PT. Pertamina Depot Malang who initially use 11 tanker trucks capable streamlined into 6 tanks.", "keywords": [ "Truck", "Economic shortage", "Schedule", "Transport engineering", "Distribution (mathematics)", "Operations management", "Operations research", "Engineering", "Agricultural science", "Mathematics", "Environmental science", "Computer science" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://rekayasamesin.ub.ac.id/index.php/rm/article/download/173/169" }, { "id": "https://openalex.org/W2970726627", "doi": "10.1051/ro/2019080", "title": "A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes", "year": 2019, "publication_date": "2019-08-29", "type": "article", "language": "en", "authors": [ "Binhui Chen", "Rong Hai Qu", "Ruibin Bai", "Wasakorn Laesanklang" ], "first_author": "Binhui Chen", "venue": "RAIRO - Operations Research", "publisher": "EDP Sciences", "abstract": "This paper studies a real-life container transportation problem with a wide planning horizon divided into multiple shifts. The trucks in this problem do not return to depot after every single shift but at the end of every two shifts. The mathematical model of the problem is first established, but it is unrealistic to solve this large scale problem with exact search methods. Thus, a Variable Neighbourhood Search algorithm with Reinforcement Learning (VNS-RLS) is thus developed. An urgency level-based insertion heuristic is proposed to construct the initial solution. Reinforcement learning is then used to guide the search in the local search improvement phase. Our study shows that the Sampling scheme in single solution-based algorithms does not significantly improve the solution quality but can greatly reduce the rate of infeasible solutions explored during the search. Compared to the exact search and the state-of-the-art algorithms, the proposed VNS-RLS produces promising results.", "keywords": [ "Reinforcement learning", "Mathematical optimization", "Variable neighborhood search", "Computer science", "Heuristic", "Algorithm", "Time horizon", "Vehicle routing problem", "Search algorithm", "Container (type theory)", "Local search (optimization)", "Routing (electronic design automation)" ], "cited_by_count": 45, "is_retracted": false, "is_paratext": false, "open_access_url": "https://nottingham-repository.worktribe.com/output/3440518" }, { "id": "https://openalex.org/W2740269716", "doi": null, "title": "Logging Truck by Depot", "year": 2010, "publication_date": "2010-12-16", "type": "article", "language": "en", "authors": [ "Jim Bell" ], "first_author": "Jim Bell", "venue": null, "publisher": null, "abstract": "Photograph of a green logging truck under an awning in front of a train depot at the Texas Forestry Museum in Lufkin, Texas.", "keywords": [ "Depot", "Truck", "Logging", "Business", "Engineering", "Geography", "Forestry", "Automotive engineering", "Archaeology" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://texashistory.unt.edu/ark:/67531/metapth471387/" }, { "id": "https://openalex.org/W4413019581", "doi": "10.1016/j.ifacol.2025.07.077", "title": "Cost-Effective Routing of a Single Heavy-Duty Battery Electric Truck", "year": 2025, "publication_date": "2025-01-01", "type": "article", "language": "en", "authors": [ "Svante Johansson", "Daniel Hyunsuk Jung", "Christofer Sundström" ], "first_author": "Svante Johansson", "venue": "IFAC-PapersOnLine", "publisher": "Elsevier BV", "abstract": "The electrification of commercial heavy-duty long-haul transport to battery electric vehicles (BEVs) is projected to be the dominant technology for future transport, but it is limited by short range and long charging time. This study develops a method to optimize transport with a single BEV to be cost-effective. It formulates an optimal plan for routing, charging, speed control, and resting periods to minimize the economic cost of operation. The plan considers constraints such as customer demand, road and charging networks, vehicle limitations, time windows, and Hours of Service regulations. It is shown that the optimal plan frequently operate near empty battery making detailed energy modeling critical, and that the strategy varies significantly depending on constraints at the final destination. The vehicle can be operated to save costs, through depot charging and energy efficient speed control, or increase its utilization, through fast charging. It is proposed that for BEVs, fleet coordination will benefit from close interaction with the day-to-day operation of single vehicles.", "keywords": [ "Truck", "Heavy duty", "Battery (electricity)", "Automotive engineering", "Duty", "Electrical engineering", "Environmental science", "Computer science", "Engineering", "Power (physics)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ifacol.2025.07.077" }, { "id": "https://openalex.org/W2398202497", "doi": "10.2991/978-94-6239-180-2_15", "title": "Research on Truck Scheduling with Preemption in Cross-Docking Systems", "year": 2016, "publication_date": "2016-01-01", "type": "conference-paper", "language": "en", "authors": [ "Jing-feng Li", "Ye Yan", "Hui Fu" ], "first_author": "Jing-feng Li", "venue": "Atlantis Press eBooks", "publisher": "Atlantis Press", "abstract": "Cross-docking is a strategy to reduce cargos’ total flow time as well as total cost. This paper considers a truck scheduling problem in a cross-docking system where the unloading process can be interrupted and the number of preemption is limited. An integer programming model is developed for this problem and the objective is to minimize the makespan by determining the sequences of inbound and outbound trucks. Then, a particle swarm optimization algorithm is proposed to solve this model. Finally, computational experiments considering preemption and non-preemption are done. The results prove the proposed approach performs better than existing model does when the waiting time of cargos for unloading is very long.", "keywords": [ "Preemption", "Computer science", "Job shop scheduling", "Truck", "Particle swarm optimization", "Scheduling (production processes)", "Integer programming", "Mathematical optimization", "Docking (animal)", "Real-time computing", "Distributed computing", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2991/978-94-6239-180-2_15" }, { "id": "https://openalex.org/W2915280178", "doi": "10.5505/pajes.2018.80034", "title": "Solution approaches for truck scheduling problem in cross-docking", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Gökçe Özden", "İnci Sarıçiçek" ], "first_author": "Gökçe Özden", "venue": "Pamukkale University Journal of Engineering Sciences", "publisher": "Pamukkale University", "abstract": "Çapraz sevkiyat, bir dağıtım ağında, ürünlerin dağıtım merkezlerine gelen kamyonlar aracılığıyla teslim edildiği, müşteri taleplerine göre konsolide edilerek müşterilere teslim edilmek üzere giden kamyonlara yüklendiği yenilikçi bir sistemdir.Bu çalışmada, çapraz sevkiyat merkezindeki her bir kamyonun kapılara atanması ve kapılardaki sırasının belirlenmesine yönelik olan kamyon çizelgeleme problemi ele alınmıştır.Belirtilen probleminin çözümü için belirli bir çalışma süresi içinde yüklenen ürün sayısının en büyüklenmesi amacına sahip bir matematiksel model ve Tavlama Benzetimi algoritması önerilmiştir.Farklı test problemleri türetilerek matematiksel model ve meta sezgisel algoritmanın sonuçları karşılaştırılmıştır.Cross docking is an innovative system that products are distributed to the distribution centers via trucks, consolidated according to customer demands, and loaded into trucks to be delivered to customers.This study focuses on the truck-scheduling problem, which consists of assigning each truck to a door at the dock and determining the sequences.This study presents a mathematical model and a Simulated Annealing Algorithm for door assignments and truck scheduling in multi-door cross-docking centers.The objective of the model is to maximize of the total number of shipping products within working time period.The results of the mathematical model and the meta-heuristic algorithm are compared by generating different test problems.", "keywords": [ "Truck", "Computer science", "Docking (animal)", "Scheduling (production processes)", "Job shop scheduling", "Mathematical optimization", "Automotive engineering", "Mathematics", "Engineering", "Embedded system", "Medicine" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://jag.journalagent.com/z4/download_fulltext.asp?pdir=pajes&plng=eng&un=PAJES-80034" }, { "id": "https://openalex.org/W4389138425", "doi": "10.1287/trsc.2023.0003", "title": "The Orienteering Problem with Drones", "year": 2023, "publication_date": "2023-11-29", "type": "article", "language": "en", "authors": [ "Nicola Morandi", "Roel Leus", "Hande Yaman" ], "first_author": "Nicola Morandi", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "We extend the classical problem setting of the orienteering problem (OP) to incorporate multiple drones that cooperate with a truck to visit a subset of the input nodes. We call this problem the OP with multiple drones (OP-mD). Drones have a limited battery endurance, and thus, they can either move together with the truck at no energy cost for the battery or be launched by the truck onto short flights that must start and end at different customer locations. A drone serves exactly one customer per flight. Moreover, the truck and the drones must wait for each other at the landing locations. A customer prize can be collected at most once, either upon visiting it by the truck or upon serving it by a drone. Similarly to the OP, we maximize the total collected prize under the condition that the truck and the drones return to the depot within a given amount of time. We provide a mixed-integer linear programming formulation for the OP-mD and devise a tailored branch-and-cut algorithm based on a novel decomposition of the problem. We solve instances of the OP-mD with up to 50 nodes within one hour of CPU time with a standard computational setup. Finally, we adapt our framework to solve closely related problems in the literature and compare the resulting computational performance with that of previous studies.", "keywords": [ "Drone", "Truck", "Orienteering", "Computer science", "Operations research", "Mathematical optimization", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 26, "is_retracted": false, "is_paratext": false, "open_access_url": "https://research.tilburguniversity.edu/en/publications/593f31f0-7b7b-4069-84ca-857f53b1b72c" }, { "id": "https://openalex.org/W2259701139", "doi": null, "title": "Scheduling inbound and outbound trucks at cross docking terminals", "year": 2007, "publication_date": "2007-01-01", "type": "article", "language": "en", "authors": [ "Nils Boysen", "Malte Fliedner", "Armin Schöll" ], "first_author": "Nils Boysen", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Docking (animal)", "Truck", "Computer science", "Scheduling (production processes)", "Engineering", "Operations management", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.db-thueringen.de/receive/dbt_mods_00016226" }, { "id": "https://openalex.org/W2599205666", "doi": "10.22059/jieng.2016.60723", "title": "Truck Sequencing and Dock Assignment in a Cross-docking System", "year": 2016, "publication_date": "2016-09-22", "type": "article", "language": "en", "authors": [ "Jamal Arkat", "Parak Qods", "Fardin Ahmadizar" ], "first_author": "Jamal Arkat", "venue": "Advances in Industrial Engineering", "publisher": null, "abstract": "In a supply chain, cross-docking is one of the most innovative systems for ameliorating the operational performance at distribution centers. Cross-docking is a logistics strategy in which freight is unloaded from inbound trucks and (almost) directly loaded into outbound trucks, with little or no storage in between, thus no inventory remains at the distribution center. In this paper, we consider the scheduling problem of inbound and outbound trucks with multiple dock doors, which the aim is to minimize the makespan. In this research, a mathematical model is derived to find the optimal solution. Also a Simulated Annealing algorithm is adapted to find near optimal solution, as the mathematical model will not be applicable for large scale problems. Numerical examples are presented in order to specify the efficiency of the proposed algorithm in comparison with mathematical model.", "keywords": [ "Truck", "DOCK", "Doors", "Job shop scheduling", "Simulated annealing", "Computer science", "Scheduling (production processes)", "GRASP", "Mathematical optimization", "Supply chain", "Mathematical model", "Operations research" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://aie.ut.ac.ir/article_60723_f9da93f08d6bffa5c41d8dd4941fb70b.pdf" }, { "id": "https://openalex.org/W7134903107", "doi": "10.2139/ssrn.6140287", "title": "Planning to Charge: Electric Truck Charging Infrastructure and Electricity demand in the GTHA", "year": 2026, "publication_date": "2026-01-01", "type": "preprint", "language": null, "authors": [ "Chandan Bhardwaj" ], "first_author": "Chandan Bhardwaj", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Electrification", "Truck", "Electricity", "Electric vehicle", "Consumption (sociology)", "Energy consumption", "Grid", "Charging station", "Peak demand" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.6140287" }, { "id": "https://openalex.org/W2310838419", "doi": "10.6838/yzu.2011.00312", "title": "Dock Assignment and Truck Scheduling at Cross-docking Terminals", "year": 2011, "publication_date": "2011-01-01", "type": "article", "language": "en", "authors": [ "艾蔓妲" ], "first_author": "艾蔓妲", "venue": null, "publisher": null, "abstract": "In a cross docking system products are received at the terminal, occasionally gathered with other products going to the same destination, then shipped at the earliest opportunity, without going into long-term storage. Applying cross docking in the distribution network can reduce transportation cost, the inventory holding cost, cycle time and increase customer satisfaction. In order to obtain such benefits, the company should be able to operate the cross docking effectively and efficiently. For this purpose several scheduling and door assignment procedures have been introduced in recent years, which aim at solving the so called truck scheduling and dock assignment problem. This research deals with both dock assignment and truck scheduling problems. The integration of both problems is discussed in two scenarios: one considers a static dock assignment and truck scheduling, and the other one addresses a dynamic dock assignment and truck scheduling. Mathematical formulations for both problems are first presented as 0-1 integer programming models. Since both dock assignment and truck scheduling problems are NP-hard, the integration of both problems is more difficult to solve. Thus we propose different heuristic algorithms to solve the integrated problem. For the static dock assignment and truck scheduling three different reduced variable neighborhood search (RVNS) algorithm frameworks are proposed, while for the dynamic dock assignment and truck scheduling a RVNS algorithm with three different types of solution initialization is proposed. The experimental results show that the RVNS algorithms for the static dock assignment and truck scheduling are capable of finding good solutions in a much shorter computation time when it is compared with Gurobi optimizer solutions. For the RVNS for the dynamic dock assignment and truck scheduling it was observed that the algorithm converges to the same quality of solution no matter the type of initial solution generated for small instances, however for large instances a better quality of solution is obtained when the algorithm is seeded by a construction heuristic.", "keywords": [ "DOCK", "Truck", "Scheduling (production processes)", "Assignment problem", "Computer science", "Job shop scheduling", "Integer programming", "Dynamic priority scheduling", "Mathematical optimization", "Operations research", "Engineering", "Algorithm" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.airitilibrary.com/Publication/alDetailedMesh1?DocID=U0009-2801201415000195" }, { "id": "https://openalex.org/W4308481980", "doi": null, "title": "Solution approaches for truck scheduling problem in cross-docking", "year": 2018, "publication_date": "2018-03-01", "type": "article", "language": "en", "authors": [ "Gözde Özden", "İnci Sarıçiçek" ], "first_author": "Gözde Özden", "venue": "DergiPark (Istanbul University)", "publisher": "Istanbul University", "abstract": "Crossdocking is an innovative system that products are distributed to thedistribution centers via trucks, consolidated according to customer demands,and loaded into trucks to be delivered to customers. This study focuses on thetruck-scheduling problem, which consists of assigning each truck to a door atthe dock and determining the sequences. This study presents a mathematicalmodel and a Simulated Annealing Algorithm for door assignments and truckscheduling in multi-door cross-docking centers. The objective of the model isto maximize of the total number of shipping products within working timeperiod. The results of the mathematical model and the meta-heuristic algorithmare compared by generating different test problems.", "keywords": [ "Docking (animal)", "Truck", "Computer science", "Scheduling (production processes)", "Mathematical optimization", "Job shop scheduling", "Engineering", "Mathematics", "Automotive engineering", "Schedule", "Medicine", "Operating system" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://dergipark.org.tr/tr/pub/pajes/issue/43460/532185" }, { "id": "https://openalex.org/W3150358513", "doi": "10.1177/03611981211003575", "title": "Understanding Urban Commercial Vehicle Driver Behaviors and Decision Making", "year": 2021, "publication_date": "2021-03-30", "type": "article", "language": "en", "authors": [ "Giacomo Dalla Chiara", "Klaas Fiete Krutein", "Andisheh Ranjbari", "Anne Goodchild" ], "first_author": "Giacomo Dalla Chiara", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "As e-commerce and urban deliveries spike, cities grapple with managing urban freight more actively. To manage urban deliveries effectively, city planners and policy makers need to better understand driver behaviors and the challenges they experience in making deliveries. In this study, we collected data on commercial vehicle (CV) driver behaviors by performing ridealongs with various logistics carriers. Ridealongs were performed in Seattle, Washington, covering a range of vehicles (cars, vans, and trucks), goods (parcels, mail, beverages, and printed materials), and customer types (residential, office, large and small retail). Observers collected qualitative observations and quantitative data on trip and dwell times, while also tracking vehicles with global positioning system devices. The results showed that, on average, urban CVs spent 80% of their daily operating time parked. The study also found that, unlike the common belief, drivers (especially those operating heavier vehicles) parked in authorized parking locations, with only less than 5% of stops occurring in the travel lane. Dwell times associated with authorized parking locations were significantly longer than those of other parking locations, and mail and heavy goods deliveries generally had longer dwell times. We also identified three main criteria CV drivers used for choosing a parking location: avoiding unsafe maneuvers, minimizing conflicts with other users of the road, and competition with other commercial drivers. The results provide estimates for trip times, dwell times, and parking choice types, as well as insights into why those decisions are made and the factors affecting driver choices.", "keywords": [ "Truck", "Dwell time", "Transport engineering", "Business", "Computer science", "Engineering", "Automotive engineering" ], "cited_by_count": 41, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1177/03611981211003575" }, { "id": "https://openalex.org/W4221031533", "doi": "10.2139/ssrn.4062871", "title": "Modeling Optimal Drone Fleet Size and Analyzing Drone-Truck Fleet Allocation Sustainability Tradeoffs", "year": 2022, "publication_date": "2022-01-01", "type": "preprint", "language": "en", "authors": [ "Yuval Hadas", "Miguel Figliozzi" ], "first_author": "Yuval Hadas", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Drone", "Truck", "Aeronautics", "Fleet management", "Sustainability", "Transport engineering", "Computer science", "Operations research", "Engineering", "Aerospace engineering", "Environmental science" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.4062871" }, { "id": "https://openalex.org/W2988228990", "doi": "10.1016/j.cie.2019.106143", "title": "A novel mathematical model and a large neighborhood search algorithm for container drayage operations with multi-resource constraints", "year": 2019, "publication_date": "2019-11-04", "type": "article", "language": "en", "authors": [ "Ruiyou Zhang", "Chao Huang", "Junwei Wang" ], "first_author": "Ruiyou Zhang", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Container (type theory)", "Truck", "Mathematical optimization", "Constraint (computer-aided design)", "Nonlinear system", "Vertex (graph theory)", "Algorithm", "Resource (disambiguation)", "Graph", "Computer science", "Mathematics", "Engineering" ], "cited_by_count": 33, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2019.106143" }, { "id": "https://openalex.org/W4205456875", "doi": "10.3934/jimo.2021225", "title": "An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization", "year": 2022, "publication_date": "2022-01-14", "type": "article", "language": "en", "authors": [ "Shengyang Jia", "Lei Deng", "Quanwu Zhao", "Yunkai Chen" ], "first_author": "Shengyang Jia", "venue": "Journal of Industrial and Management Optimization", "publisher": "American Institute of Mathematical Sciences", "abstract": "In considering route optimization from multiple distribution centers called depots via some intermediate facilities called satellites to final customers with multiple commodities request, we introduce the Multi-Commodity Two-Echelon Vehicle Routing Problem with Satellite Synchronization (MC-2E-VRPSS). The MC-2E-VRPSS involves the transportation from multiple depots to satellites on the first echelon and the deliveries from satellites to final customers on the second echelon. The MC-2E-VRPSS integrates satellite synchronization constraints and time window constraints for satellites on the two-echelon network and aims to determine cost-minimizing routes for the two echelons. The satellite synchronization constraints which trucks from the multiple depots to some satellites need to be coordinated guarantee the efficiency of the second echelon network. In this study, we develop a mixed-integer programming model for the MC-2E-VRPSS. For validating the model formulation, we conduct the computational experiments on a set of small-scale instances using GUROBI and an adaptive large neighborhood search (ALNS) heuristic which we develop for the problem. Furthermore, the computation experiments for evaluating the applicability of the ALNS heuristic compared with large neighborhood search (LNS) on a set of large-scale instances are also conducted, which proved the effectiveness of the ALNS. Addendum: The Acknowledgement “This study was supported by the Humanities and Social Sciences Foundation Program of the Ministry of Education (Project No.19YJA630122), and the \"National Key R&D Program of China\"(Grant No.2020YFB1712900)” is added. We apologize for any inconvenience this may cause.", "keywords": [ "Computer science", "Heuristic", "Synchronization (alternating current)", "Routing (electronic design automation)", "Set (abstract data type)", "Scale (ratio)", "Vehicle routing problem", "Operations research", "Mathematical optimization", "Computer network", "Mathematics", "Artificial intelligence" ], "cited_by_count": 36, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3934/jimo.2021225" }, { "id": "https://openalex.org/W4404820955", "doi": "10.1287/trsc.2024.0544", "title": "Exact Solution of the Vehicle Routing Problem with Drones", "year": 2024, "publication_date": "2024-11-28", "type": "article", "language": "en", "authors": [ "Jeanette Schmidt", "Christian Tilk", "Stefan Irnich" ], "first_author": "Jeanette Schmidt", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "The vehicle routing problem with drones (VRP-D) that we consider is an extension of the capacitated vehicle routing problem in which the fleet consists of trucks equipped with one drone each. A truck and its drone can either move together or separately. A truck can release its drone at the depot or at a customer location and must pick it up later at another customer or the depot location. In this way, both trucks and drones deliver goods to customers working together as synchronized working units. A feasible route has to satisfy the capacity constraints of both the truck and the drone. A feasible solution to the VRP-D is a set of feasible routes such that each customer is served exactly once by either a truck or a drone. We investigate two standard objectives considered in the literature, that is, the minimization of the total routing cost and the sum of the routes’ durations. To solve the VRP-D exactly, we develop a branch-price-and-cut (BPC) algorithm. In particular, we present a new forward and implicit bidirectional labeling algorithm defined over an artificial network to solve the column-generation subproblems. The new bidirectional labeling algorithm substantially accelerates the solution process compared with its monodirectional counterpart. The time needed to solve the pricing problems is reduced by 55% on average when minimizing routing costs and by 30% when minimizing the sum of the routes’ durations. In further computational experiments, we analyze algorithmic components of the BPC algorithm, compare the cost and duration objectives, and highlight the impact of the drones’ speed on the structure of VRP-D solutions. For the routing-cost minimization objective, our BPC algorithm is able to solve several VRP-D instances with 50 vertices to proven optimality within one hour of computation time. The same instances with duration minimization are more difficult, and the BPC algorithm provides only heuristic solutions with an average gap not exceeding 3%. Funding: This work was supported by Deutsche Forschungsgemeinschaft [Project 418727865, Grant IR 122/10-1]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0544 .", "keywords": [ "Drone", "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "Transport engineering", "Engineering", "Mathematical optimization", "Operations research", "Computer network", "Mathematics" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.2024.0544" }, { "id": "https://openalex.org/W4200580718", "doi": "10.1016/j.cie.2021.107899", "title": "A combined GA-TS algorithm for two-echelon dynamic vehicle routing with proactive satellite stations", "year": 2021, "publication_date": "2021-12-22", "type": "article", "language": "en", "authors": [ "Guiqin Xue", "Yong Wang", "Xiangyang Guan", "Zheng Wang" ], "first_author": "Guiqin Xue", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Genetic algorithm", "Tabu search", "Solver", "Idle", "Truck", "Vehicle routing problem", "Routing (electronic design automation)", "Real-time computing", "Mathematical optimization", "Operations research", "Algorithm" ], "cited_by_count": 38, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2021.107899" }, { "id": "https://openalex.org/W2287057386", "doi": "10.1021/acs.iecr.6b00271", "title": "Rolling Horizon Approach for Production–Distribution Coordination of Industrial Gases Supply Chains", "year": 2016, "publication_date": "2016-02-03", "type": "article", "language": "en", "authors": [ "Miguel A. Zamarripa", "Pablo A. Marchetti", "Ignacio E. Grossmann", "Tejinder Pal Singh", "Irene Lotero", "Ajit Gopalakrishnan", "Brian M. Besancon", "Jean Michel André" ], "first_author": "Miguel A. Zamarripa", "venue": "Industrial & Engineering Chemistry Research", "publisher": "American Chemical Society", "abstract": "This paper addresses industrial gases supply chains involving multiple products at multiple plants that must be coordinated with multiple depot-truck-routes in order to satisfy customer demands. The full-space optimization problem corresponds to a large-scale mixed-integer linear programming model (MILP). To solve large-scale industrial problems, this paper proposes a rolling horizon approach with two aggregation strategies for solving the smaller subproblems. The first one relies on the linear programming (LP) relaxation for which the binary variables (complicating variables) of the distribution problem are treated as continuous, while the second one uses a novel tailored model for the distribution side constraints that leads to improved solutions. A real case study of an industrial gases supply chain has been addressed obtaining good results in both objective value and with lower computational effort compared with the full-space solution. The extension to longer time horizons through a receding horizon is also considered.", "keywords": [ "Mathematical optimization", "Supply chain", "Time horizon", "Linear programming", "Computer science", "Production (economics)", "Integer programming", "Scale (ratio)", "Horizon", "Distribution (mathematics)", "Relaxation (psychology)", "Truck" ], "cited_by_count": 43, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/11336/18762" }, { "id": "https://openalex.org/W4412935324", "doi": "10.1016/j.sftr.2025.101089", "title": "Optimizing energy and CO2 efficiency in last-mile delivery using hybrid fleet models", "year": 2025, "publication_date": "2025-08-04", "type": "article", "language": "en", "authors": [ "Armin Mahmoodi", "Leila Hashemi", "Jeremy F. Laliberté", "Seyed Mojtaba Sajadi" ], "first_author": "Armin Mahmoodi", "venue": "Sustainable Futures", "publisher": "Elsevier BV", "abstract": "Effective urban delivery systems demand innovative approaches to reduce energy use and lower CO 2 . This study compares the environmental performance of hybrid and diesel trucks with quadcopter and fixed-wing remotely piloted aircraft systems (RPAS), employing a multi-objective optimization approach non-dominated sorting genetic algorithm II (NSGA-II) to identify optimal delivery routes balancing operational efficiency and sustainability. Given that existing solutions like e-bikes or electric vans may not be feasible everywhere, this research evaluates different vehicle types under various urban delivery scenarios. Using a synthetic dataset that simulates realistic conditions, the findings reveal that fixed-wing RPAS excel in long-range efficiency, while quadcopters perform better in short-range deliveries. Hybrid trucks are advantageous for larger loads, reducing emissions compared to diesel trucks. The results highlight key trade-offs in energy use and emissions, advocating for a mixed-fleet strategy tailored to specific logistics needs. This study provides actionable insights for sustainable urban freight planning and policymaking.", "keywords": [ "Mile", "Last mile (transportation)", "Environmental science", "Computer science", "Geography" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.sftr.2025.101089" }, { "id": "https://openalex.org/W7171615050", "doi": "10.2139/ssrn.6974519", "title": "Innovative Charging Assessing Fleet Acceptance of Shared and “As-a-service” Models for Electric Trucks", "year": 2026, "publication_date": "2026-01-01", "type": "preprint", "language": null, "authors": [ "Chandan Bhardwaj", "Nafisa Nawal" ], "first_author": "Chandan Bhardwaj", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Truck", "Fleet management", "Electric vehicle", "Quality (philosophy)", "Charging station", "Electric utility" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.6974519" }, { "id": "https://openalex.org/W3043599172", "doi": "10.1093/sf/soz169", "title": "Competing for Jurisdiction: Practical Legitimation and the Persistence of Informal Recycling in Urban India", "year": 2020, "publication_date": "2020-01-02", "type": "article", "language": "en", "authors": [ "Dana Kornberg" ], "first_author": "Dana Kornberg", "venue": "Social Forces", "publisher": "Oxford University Press", "abstract": "Abstract How did informal garbage collectors, who had long provided the only door-to-door and recycling services in Delhi, manage to survive the introduction of formal garbage collection trucks? This question raises the larger problem of why informal institutions—well-organized and socially recognized, but legally unauthorized and unregulated platforms for political and economic organization—have proven so persistent. I draw on evidence collected during 20 months of ethnographic research in Delhi, focusing on participant observation with informal collectors during their neighborhood routes and interviews with 50 informal collectors. Bringing together political and urban sociology, postcolonial urban studies, and institutional theory, the paper frames competition over city garbage and recycling as a relational matter. I argue that informal workers preserved their jurisdiction through practical legitimation, depending on everyday actions and social expectations rather than explicit laws or beliefs to secure legitimacy. I demonstrate how status-based relations, here based on caste and labor migration, can confer legitimacy and provide a source of regulation, as actors set out and meet implicit expectations for appropriate actions, relationships, and social boundaries.", "keywords": [ "Legitimation", "Legitimacy", "Garbage", "Informal sector", "Sociology", "Caste", "Jurisdiction", "Ethnography", "Politics", "Participant observation", "Legalization", "Political economy" ], "cited_by_count": 29, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1093/sf/soz169" }, { "id": "https://openalex.org/W2559585000", "doi": "10.1080/00207543.2016.1262564", "title": "Collaborative solutions for inter terminal transport", "year": 2016, "publication_date": "2016-11-28", "type": "article", "language": "en", "authors": [ "Amir Hossein Gharehgozli", "René B.M. de Koster", "Rick Jansen" ], "first_author": "Amir Hossein Gharehgozli", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "Major ports contain multiple container terminals, sea terminals, train, truck and barge terminal, and empty container depots, operated by different companies. Port authorities try to streamline inter terminal container transport (ITT) within congested port areas by offering expensive common road and rail infrastructure. Alternatively, individual stakeholders can set up private or collaborative container transport systems. This paper develops a framework to analyse and determine feasibility conditions of a common ITT system in a port area, depending on total transport volumes. First, we develop a simulation model to evaluate the costs of transporting containers using different modes of transport including trucks, automated guided vehicles, and multi trailer systems. Next, the required number of vehicles per mode is determined for a given throughput and waiting time. The results of the simulation are used in a game-theoretic setting to determine the cost savings per stakeholder operating in a coalition. By comparing cost savings for all possible coalitions, it is possible to determine, for each stakeholder, the attractiveness of using a common system. We find the coalitions that result in the highest savings and compare them with the infrastructure cost required to realise them. We apply the method to determine the feasibility of a common ITT system for terminals in the Port of Rotterdam and show that it only pays off in case of high demand for container transports.", "keywords": [ "Container (type theory)", "Truck", "Port (circuit theory)", "BARGE", "Trailer", "Terminal (telecommunication)", "Transport engineering", "Throughput", "Operations research", "Computer science", "Yard", "Transfer (computing)" ], "cited_by_count": 40, "is_retracted": false, "is_paratext": false, "open_access_url": "https://pure.eur.nl/en/publications/42835133-ae4f-4dbd-b6b5-a0e498e612fc" }, { "id": "https://openalex.org/W4323031123", "doi": "10.1016/j.ejor.2023.02.041", "title": "The multi-trip container drayage problem with synchronization for efficient empty containers re-usage", "year": 2023, "publication_date": "2023-03-03", "type": "article", "language": "en", "authors": [ "Stefano Fazi", "Sourabh Kumar Choudhary", "Jingxin Dong" ], "first_author": "Stefano Fazi", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": "We study a typical daily drayage problem concerning the last-mile logistics at seaports for inland container supply chains. A set of trucks available at an inland container terminal must fulfil shippers’ requests of transporting containers within time windows and, to do so, can perform multiple daily trips. A request may entail picking up or delivering containers either at the shippers’ premises, the inland terminal or the seaport. Demand for empty containers can be satisfied by either using the available limited stock at the inland terminal, by street-turning or, ultimately, by retrieving them at a local depot for empties resulting in extra mileage. Hence, the minimization of routing costs also entails synchronizing trucks’ trips that retrieve and add empty containers to the inland terminal stock to avoid unnecessary visits to the empty depot. After modelling the problem mathematically, we develop an exact column-and-row generation approach embedded in a branch-and-price framework. To accelerate the solving process of the pricing problem, we propose effective strategies by combining a set of tailored pricing algorithms. These strategies perform well on a set of adapted Solomon’s instances up to 100 nodes and against a standard branch-and-cut solver. Finally, experiments on real-world instances, inspired by a case study of an inland terminal at the Port of Rotterdam region, provide insights into current planning practices.", "keywords": [ "Truck", "Computer science", "Operations research", "Container (type theory)", "TRIPS architecture", "Terminal (telecommunication)", "Purchasing", "Vehicle routing problem", "Transport engineering", "Solver", "Port (circuit theory)", "Supply chain" ], "cited_by_count": 27, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2023.02.041" }, { "id": "https://openalex.org/W2945640949", "doi": "10.1016/j.procs.2019.04.115", "title": "How Driving Multiple Tours Affects the Results of Last Mile Delivery Vehicle Routing Problems", "year": 2019, "publication_date": "2019-01-01", "type": "conference-paper", "language": "en", "authors": [ "Kai Martins-Turner", "Kai Nagel" ], "first_author": "Kai Martins-Turner", "venue": "Procedia Computer Science", "publisher": "Elsevier BV", "abstract": "Solving Vehicle Routing Problems (VRPs) is one very important step for modeling and simulating urban freight transportation and especially urban last-mile delivery. It is observed in several studies, that tour plans consist of a very high number of vehicles needed because vehicles only drive one tour. For the next tour, a new vehicle with new fixed costs is needed. This also starts in the beginning of its temporal availability. This article intends to answer the question: how tour plan and fleet size changes when vehicles can reload at the depot and run another tour within its temporal availability. The possible effects are shown in two studies for Berlin: (i) food retailing delivery and (ii) parcel delivery for one district of Berlin. The studies have different designs and policy cases to see the effects under different situations. The present research shows that reloading within the delivery tour leads to a significant reduction of vehicles needed and therefore to lower costs for the carrier. If one tour is not limited by the vehicle’s capacity but by the vehicle’s temporal availability no saving can be observed. This was the case for parcel delivery with light parcel delivery trucks. When using smaller vehicles, e.g. cargo bicycles for last mile delivery from local city hubs, vehicle capacity is the limiting factor and therefore also significant saving can be observed. As another consequence it is possible to get rid of artificially inserted breaks in time-windows for more realistic traffic. The article also critically addresses the problem of increasing computation time.", "keywords": [ "Truck", "Last mile (transportation)", "Computer science", "Vehicle routing problem", "Transport engineering", "Routing (electronic design automation)", "Mile", "Plan (archaeology)", "Limiting", "Food delivery", "Operations research", "Automotive engineering" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877050919305794/pdf" }, { "id": "https://openalex.org/W7113078787", "doi": null, "title": "Simulation Study of Charging Infrastructure for Battery Electric Trucks at Forest Industry Site", "year": 2025, "publication_date": "2025-01-01", "type": "dissertation", "language": "en", "authors": [ "Svensson, Hjalmar" ], "first_author": "Svensson, Hjalmar", "venue": "DiVA (Linkoping University)", "publisher": "Linköping University", "abstract": "Electrification of heavy-duty road transportation is an important step toward reaching Sweden's climate goals. One commonly mentioned approach is the use of battery electric trucks (BETs) using plug-in charging. The forestry industry in Sweden accounts for a significant portion of truck transportation, positioning the industry as an interesting area of study. One question is where charging infrastructure should be placed, where some alternatives are at roadside rest areas, at home depots, or at delivery sites. This study implements a simulation environment based on the daily flow of 200 incoming timber trucks at a Swedish paper mill to study the amount of energy supplied to BETs as well as the power demand and utilization rate throughout a day when two charger layouts are introduced. One scenario implements a new area at the site where charging can take place before or after trucks complete their delivery. The other scenario implements chargers at the existing unloading area within the log yard. With a separate charging area, power peaks are most prevalent when trucks take their rest periods and later in shifts when state of charge (SOC) levels are lower. Low-use periods occur before trucks take their mandatory rest stops. Going above four chargers does not provide a significant charging benefit unless there is a high degree of BETs in the system. Considerable utilization can be possible with fewer chargers. When charging occurs during unloading, the power demand is dependent on the traffic of BETs through the site since charging only occurs while unloading. This means that a high ratio of BETs is necessary for solid utilization rates. It also means that utilization suffers at times during the day with lower arrival frequencies and when trucks have high SOC such as the start of shift or after charging breaks. A further limitation is that this scenario would require new routines for unloading to account for the new charging infrastructure within the existing system.", "keywords": [ "Truck", "Electrification", "Battery (electricity)", "Trucking industry", "Rest (music)", "Power (physics)", "Forest road" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://liu.diva-portal.org/smash/get/diva2:2001953/FULLTEXT01" }, { "id": "https://openalex.org/W3125663621", "doi": null, "title": "Truck scheduling in cross docking terminals with fixed outbound departures", "year": 2010, "publication_date": "2010-10-05", "type": "preprint", "language": "en", "authors": [ "Nils Boysen", "Dirk Briskorn", "Martin Tschöke" ], "first_author": "Nils Boysen", "venue": "RePEc: Research Papers in Economics", "publisher": "Federal Reserve Bank of St. Louis", "abstract": "At a cross docking terminal, inbound shipments are directly transshipped across the terminal to designated outbound trucks, so that delays and inventories are kept as low as possible. We consider an operational truck scheduling problem, where a dock door and a start time has to be assigned to each inbound truck. A set of outbound trucks is scheduled beforehand and, therefore, departure times are fixed. If a shipment is not unloaded, transshipped to the outbound gate and loaded onto the designated outbound truck before its departure we consider the shipments's value as lost profit. The objective is to minimize total lost profit. The paper at hand formalizes the resulting truck scheduling problem. We settle its computational complexity and develop heuristics in order to tackle the problem. We show the efficiency of these heuristics by means of a computational study. Last but not least, a case study is presented.", "keywords": [ "Truck", "Heuristics", "Scheduling (production processes)", "Profit (economics)", "DOCK", "Operations research", "Job shop scheduling", "Computer science", "Transport engineering", "Engineering", "Operations management", "Microeconomics" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://uri.gbv.de/document/gvk:ppn:645168696" }, { "id": "https://openalex.org/W4408275078", "doi": "10.12677/mos.2025.143202", "title": "Research on Truck Scheduling in Cross-Docking Centers for Perishable Goods", "year": 2025, "publication_date": "2025-01-01", "type": "article", "language": "en", "authors": [ "春阳 范" ], "first_author": "春阳 范", "venue": "Modeling and Simulation", "publisher": null, "abstract": null, "keywords": [ "Truck", "Docking (animal)", "Scheduling (production processes)", "Computer science", "Business", "Transport engineering", "Operations management", "Engineering", "Automotive engineering", "Medicine" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.12677/mos.2025.143202" }, { "id": "https://openalex.org/W1642814319", "doi": null, "title": "Scheduling Problem of Receiving and Shipping Trucks for Cross Docking Systems", "year": 2002, "publication_date": "2002-01-01", "type": "article", "language": "en", "authors": [ "Yu Woo yeon" ], "first_author": "Yu Woo yeon", "venue": "Journal of the Korea Safety Management and Science", "publisher": null, "abstract": "Cross docking is a material handling and distribution concept in which products move directly from receiving dock to shipping dock, without being stored in a warehouse or distribution center. Depending on the facility and operating conditions or strategies employed, it is possible to generate various cross docking scenarios or models. The cross docking model, which is studied in this research, assumes there are a separate receiving dock and a separate shipping dock. It is also assumed that the products contained in a receiving truck and the products needed for a shipping truck are known in advance. Furthermore, the study is restricted to scenarios where there is only one receiving dock and only one shipping dock at the warehouse. The research objective is to find the best truck spotting sequence for both receiving and shipping trucks to minimize total operation time (i.e., the makespan) of the cross docking system.", "keywords": [ "DOCK", "Truck", "Docking (animal)", "Scheduling (production processes)", "Job shop scheduling", "Computer science", "Transport engineering", "Operations research", "Engineering", "Operations management", "Automotive engineering", "Marine engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=OJGOBW_2002_v4n3_79" }, { "id": "https://openalex.org/W3217403438", "doi": null, "title": "Scheduling Problem of Receiving and Shipping Trucks for Cross Docking Systems", "year": 2002, "publication_date": "2002-09-01", "type": "article", "language": "en", "authors": [ "유우연" ], "first_author": "유우연", "venue": null, "publisher": null, "abstract": "크로스도킹이란 물류와 분배의 개념으로서 창고나 분배 센터에서 물품이 재고로 남겨짐이 없이 곧바로 하역 창구에서 적재 창구로 이동되어지는 것을 말한다 창고시설 이나 운영 조건이나 운영 전략에 의해서 다양한 크로스도킹 모델이 생성될 수 있다. 본 연구에서 고려되어지는 크로스도킹 모델은 하나의 독립된 하역 창구와 독립된 적재 창구를 가정하고 있다. 또한 하역 트럭에 적재되어 있는 물품이나 적재 트럭에 실려질 물품의 수와 종류는 사전에 알려져 있다는 것을 가정한다. 또한 고려되어진 창고나 분배창구는 단지 하나의 하역 창구와 하나의 적재 창구를 가지고 있다고 가정된다. 본 연구의 목적은 고려되어진 크로스도킹 시스템의 총 운영 시간을 최소화하기 위한 하역 트럭과 적재 트럭의 일정 계획을 찾는데 있다.", "keywords": [ "Truck", "Scheduling (production processes)", "Computer science", "Docking (animal)", "Job shop scheduling", "Operations research", "Engineering", "Operations management", "Automotive engineering", "Computer network", "Medicine" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.earticle.net/Article/A154483" }, { "id": "https://openalex.org/W2759105156", "doi": "10.22059/jieng.2016.63175", "title": "Scheduling in a Cross-Dock Based on the Departure Time of the Outboard Trucks", "year": 2016, "publication_date": "2016-11-21", "type": "article", "language": "en", "authors": [ "S.M.T. Fatemi Ghomi", "Sajjad Rahmanzadeh Tootkaleh", "Mohsen Sheikh Sajadiyeh" ], "first_author": "S.M.T. Fatemi Ghomi", "venue": "Advances in Industrial Engineering", "publisher": null, "abstract": "According to the development of cross-dock network concept in theory and establishing cross-dock centers around the world, these centers have been attended by many companies. Cross-dock centers reduce transportation costs significantly by consolidating the loads and transferring them together. There are some problems in planning and scheduling cross-dock systems that can affect the efficiency and productivity of these systems. In this paper, a model, based on time and capacity constraints is developed. The model schedules inbound truck unloading time according to the importance, volume and existing costs of the products, and delay loads are stored in temporary storages to transfer at the next period. Furthermore, the problem is formulated in a mathematical model. It can be solved to find optimal solution, and in large size problems a heuristic algorithm is developed.", "keywords": [ "DOCK", "Truck", "Scheduling (production processes)", "Operations research", "Computer science", "Heuristic", "Job shop scheduling", "Engineering", "Operations management", "Computer network", "Routing (electronic design automation)" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://aie.ut.ac.ir/article_63175_dbb64a5b3da255376d3aa265af914a45.pdf" }, { "id": "https://openalex.org/W2843989850", "doi": "10.3390/su10072444", "title": "A Comparative Analysis Selecting the Transport Routes of Electronics Components from China to Vietnam", "year": 2018, "publication_date": "2018-07-12", "type": "article", "language": "en", "authors": [ "Thi Mai Yen Pham", "Gi‐Tae Yeo" ], "first_author": "Thi Mai Yen Pham", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Vietnam has successfully integrated itself into the global value chains (GVCs) as a base for the assembly and production of electronics goods and mobile phones beyond China. Therefore, adequate transport routes from China to Vietnam are essential factors for a seamless supply chain. This study aimed to evaluate the competing transport routes for door-to-door transportation from Shenzhen (China) to Hai Phong (Vietnam) from the logistics service providers and shippers’ perspective. The Delphi method and the Consistent Fuzzy Preference Relations (CFPR) method were employed, using both qualitative and quantitative factors. The results illustrate that, among the principal factors, reliability is prioritized, followed by transportation costs, transportation mode capacity, and transportation time. Meanwhile, of the sub-factors, risk of freight damage and loss is the most important. The route using airway and truck is preferred over the two alternatives. Furthermore, a sensitivity analysis was conducted to examine the possibility of rank reversal. Thus, the study offers crucial academic and practical implications.", "keywords": [ "Business", "Delphi method", "China", "Truck", "Fuzzy logic", "Transport engineering", "Reliability (semiconductor)", "Supply chain", "Service (business)", "Cold chain", "Industrial organization", "Computer science" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/10/7/2444/pdf?version=1531487902" }, { "id": "https://openalex.org/W4404882388", "doi": "10.1016/j.tre.2024.103877", "title": "Logic-based benders decomposition algorithm for robust parallel drone scheduling problem considering uncertain travel times for drones", "year": 2024, "publication_date": "2024-11-30", "type": "article", "language": "en", "authors": [ "Shakoor Barzanjeh", "Fardin Ahmadizar", "Jamal Arkat" ], "first_author": "Shakoor Barzanjeh", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Benders' decomposition", "Scheduling (production processes)", "Decomposition", "Computer science", "Mathematical optimization", "Algorithm", "Operations research", "Engineering", "Mathematics" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2024.103877" }, { "id": "https://openalex.org/W4294724298", "doi": "10.1016/j.cie.2022.108632", "title": "On a Pickup to Delivery Drone Routing Problem: Models and algorithms", "year": 2022, "publication_date": "2022-09-06", "type": "article", "language": "en", "authors": [ "Javier E. Gómez-Lagos", "Benjamín Rojas-Espinoza", "Alfredo Candia-Véjar" ], "first_author": "Javier E. Gómez-Lagos", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Pickup", "Routing (electronic design automation)", "Vehicle routing problem", "Computer science", "Algorithm", "Mathematical optimization", "Engineering", "Distributed computing", "Mathematics", "Computer network", "Artificial intelligence" ], "cited_by_count": 32, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2022.108632" }, { "id": "https://openalex.org/W1973219211", "doi": "10.1097/00002030-199707000-00010", "title": "Decreased incidence of sexually transmitted diseases among trucking company workers in Kenya", "year": 1997, "publication_date": "1997-06-01", "type": "article", "language": "en", "authors": [ "Denis J. Jackson", "Joel P. Rakwar", "Barbra A. Richardson", "Kishorchandra N. Mandaliya", "Bhavna H. Chohan", "Job J. Bwayo", "Jeckoniah O. Ndinya‐Achola", "Harold Martin", "Stephen Moses", "Joan K. Kreiss" ], "first_author": "Denis J. Jackson", "venue": "AIDS", "publisher": "Lippincott Williams & Wilkins", "abstract": "OBJECTIVE: To establish a cohort of high-risk individuals suitable for HIV-prevention trials, and to measure changes in sexual behaviour and sexually transmitted disease (STD) incidence after a behavioural intervention. DESIGN: Prospective cohort study in trucking company depots in Mombasa, Kenya. PARTICIPANTS: A total of 556 male HIV-seronegative employees of trucking companies. INTERVENTIONS: HIV serological testing, individual counselling, condom promotion, STD diagnosis and management. MAIN OUTCOME MEASURES: Sexual risk behaviour and symptomatic STD incidence. RESULTS: Using time-trend modelling, significant declines in self-reported high-risk sexual behaviour were demonstrated during a 1-year follow-up. The percentage of men reporting any extramarital sex during the 3-month period prior to a follow-up visit decreased from 49% durig the first quarter of follow-up to 36% during the last quarter (P < 0.001). The decline in reported female sex worker contact was from 12% to 6% (P = 0.001). Approximately 30% of men reported consistent condom use during extramarital sex and this percentage remained unchanged during the study period. The incidence of STD declined from 34 per 100 person years (PY) during the first quarter to 10 per 100 PY during the last quarter (P = 0.001). Significant reductions in gonorrhoea (15 to five cases per 100 PY, P = 0.04), non-gonococcal urethritis (10 to two cases per 100 PY, P = 0.05), and genital ulcer disease (nine to two cases per 100 PY, P = 0.02) were observed. CONCLUSIONS: Among truck company workers who participated in a cohort study in Mombasa, Kenya, there was a significant decrease in sex with high-risk partners, but no change in condom use. The change in heterosexual risk behaviour was accompanied by a significant decrease in incidence of gonorrhoea, non-gonococcal urethritis, and genital ulcer disease.", "keywords": [ "Medicine", "Incidence (geometry)", "Sexually transmitted disease", "Cohort", "Condom", "Demography", "Quarter (Canadian coin)", "Psychological intervention", "Cohort study", "Prospective cohort study", "Urethritis", "Population" ], "cited_by_count": 90, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1097/00002030-199707000-00010" }, { "id": "https://openalex.org/W2153150459", "doi": null, "title": "Vehicle routing with traffic congestion and drivers driving and working rules.", "year": 2010, "publication_date": "2010-01-01", "type": "report", "language": "en", "authors": [ "A.L. Kok", "Erwin W. Hans", "J.M.J. Schutten", "W.H.M. Zijm" ], "first_author": "A.L. Kok", "venue": "University of Twente Research Information", "publisher": null, "abstract": "For the intensively studied vehicle routing problem (VRP), two real-life restrictions have received only minor attention in the VRP-literature: traffic congestion and driving hours regulations. Traffic congestion causes late arrivals at customers and long travel times resulting in large transport costs. To account for traffic congestion, time-dependent travel times should be considered when constructing vehicle routes. Next, driving hours regulations, which restrict the available driving and working times for truck drivers, must be respected. Since violations are severely fined, also driving hours regulations should be considered when constructing vehicle routes, even more in combination with congestion problems. The objective of this paper is to develop a solution method for the VRP with time windows (VRPTW), time-dependent travel times, and driving hours regulations. The major difficulty of this VRPTW extension is to optimize each vehicle’s departure times to minimize the duty time of each driver. Having compact duty times leads to cost savings. However, obtaining compact duty times is much harder when time-dependent travel times and driving hours regulations are considered. We propose a restricted dynamic programming (DP) heuristic for constructing the vehicles routes, and an efficient heuristic for optimizing the vehicle’s departure times for each (partial) vehicle route, such that the complete solution algorithm runs in polynomial time. Computational experiments emonstrate the trade-off between travel distance minimization and duty time minimization, and illustrate the cost savings of extending the depot opening hours such that traveling before the morning peak and after the evening peak becomes possible.", "keywords": [ "Vehicle routing problem", "Minification", "Truck", "Heuristic", "Traffic congestion", "Computer science", "Transport engineering", "Routing (electronic design automation)", "Operations research", "Simulation", "Mathematical optimization", "Real-time computing" ], "cited_by_count": 74, "is_retracted": false, "is_paratext": false, "open_access_url": "https://research.utwente.nl/en/publications/vehicle-routing-with-traffic-congestion-and-drivers-driving-and-working-rules(3e34ce6f-56d0-41a4-a677-113f7a2b22ee).html" }, { "id": "https://openalex.org/W2920519397", "doi": "10.5267/j.ijiec.2019.1.001", "title": "Consolidation centers in city logistics: A cooperative approach based on the location routing problem", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Sachin Nataraj", "Daniele Ferone", "Carlos L. Quintero-Araújo", "Angel Alejandro Juan", "Paola Festa" ], "first_author": "Sachin Nataraj", "venue": "International Journal of Industrial Engineering Computations", "publisher": "Growing Science", "abstract": "In the context of city logistics, freight transportation is one of the prominent causes of traffic congestion, high levels of pollution, and safety concerns.To decrease the negative impact of these issues, different methods have been traditionally implemented.On the one hand, the location of urban consolidation Centers (UCCs) near a city can be used to consolidate freight delivery services.Therefore, the number of trucks moving in urban areas can be reduced.On the other hand, Horizontal Cooperation can also help to reduce environmental impact while increasing service level.This paper combines both strategies, that is, we deal with the location of UCCs and, simultaneously, we analyze different scenarios where the players of different supply chain processes exhibit various levels of cooperation.Thus, different levels of cooperations regarding routing and UCCs-location decisions are considered in the following scenarios: (a) non-cooperative case, in which all decisions are decentralized (i.e., each enterprise solves its own vehicle routing problem); (b) low-cooperative case, where depot capacities are shared but the customers are still being served by each company's fleet of vehicles; (c) semicooperative case, based on centralized route planning decisions (i.e.facilities and fleets are shared among participating enterprises); and (d) fully cooperative scenario, where the routing plans and facility-location decisions are taken by consensus amongst all the participants.In order to estimate the benefits of both strategies, we propose a flexible metaheuristic algorithm to deal with the combined location and routing problem under the different cooperative scenarios.Our results show impressive benefits of the proposed approach.", "keywords": [ "Consolidation (business)", "City logistics", "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Transport engineering", "Operations research", "Operations management", "Business", "Engineering", "Computer network", "Finance" ], "cited_by_count": 65, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5267/j.ijiec.2019.1.001" }, { "id": "https://openalex.org/W2945468527", "doi": "10.1007/978-3-030-21297-1_11", "title": "Co-location Specification for IoT-Aware Collaborative Business Processes", "year": 2019, "publication_date": "2019-01-01", "type": "conference-paper", "language": "en", "authors": [ "Paul Grefen", "Nadja Brouns", "Heiko Ludwig", "Estefanía Serral" ], "first_author": "Paul Grefen", "venue": "Lecture notes in business information processing", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Container (type theory)", "Computer science", "Internet of Things", "Business process", "Consistency (knowledge bases)", "Process (computing)", "Human–computer interaction", "Distributed computing", "Computer security", "Work in process", "Engineering", "Artificial intelligence" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-030-21297-1_11" }, { "id": "https://openalex.org/W4389219106", "doi": "10.1016/j.spc.2023.10.012", "title": "Strategy planning for sustainable biodiesel supply chain produced from waste animal fat", "year": 2023, "publication_date": "2023-12-01", "type": "article", "language": "en", "authors": [ "Shubham Kumar Singh", "Anand Chauhan", "Biswajit Sarkar" ], "first_author": "Shubham Kumar Singh", "venue": "Sustainable Production and Consumption", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Biodiesel", "Supply chain", "Business", "Waste management", "Animal waste", "Sustainability", "Environmental science", "Engineering", "Chemistry", "Biology", "Marketing", "Catalysis" ], "cited_by_count": 63, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.spc.2023.10.012" }, { "id": "https://openalex.org/W7202206212", "doi": "10.3390/wevj17080421", "title": "Route-Specific Total Cost of Ownership for Electric Trucks: A Danish Distribution Case Study", "year": 2026, "publication_date": "2026-08-11", "type": "article", "language": "en", "authors": [ "Lars Boserup Iversen", "Christina Rehmeier" ], "first_author": "Lars Boserup Iversen", "venue": "World Electric Vehicle Journal", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "The decarbonisation of heavy-duty road transport is central to European climate policy, yet the economic viability of battery-electric trucks under real-world route conditions remains uncertain. This study presents a route-specific total cost of ownership (TCO) analysis comparing an 18-tonne battery-electric truck with a comparable diesel truck across four Danish distribution routes. An eight-year net present value (NPV) model at 5% discount rate captures acquisition, energy, taxation, and maintenance costs. The analysis incorporates seasonal variation and distinguishes between depot charging (0.75 DKK/kWh) and public fast charging (3.00 DKK/kWh). The electric truck achieves NPV advantages of DKK 1.01–2.14 million across all routes, with break-even periods of 1.8 to 3.3 years. Charging strategy is the most influential economic factor. The findings demonstrate that fleet-averaged TCO estimates are insufficient and route-level analysis is essential for informed electrification decisions, though results are contingent on the specific policy and operational context of this single-operator case study.", "keywords": [ "Truck", "Electrification", "Context (archaeology)", "Total cost of ownership", "Danish", "Distribution (mathematics)", "Diesel fuel" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3390/wevj17080421" }, { "id": "https://openalex.org/W2042928767", "doi": "10.1287/inte.22.3.4", "title": "Interactive Optimization of Bulk Sugar Deliveries", "year": 1992, "publication_date": "1992-06-01", "type": "article", "language": "en", "authors": [ "André van Vliet", "C. G. E. Boender", "Alexander H. G. Rinnooy Kan" ], "first_author": "André van Vliet", "venue": "INFORMS Journal on Applied Analytics", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "An interactive optimization system for planning bulk deliveries was implemented by Suiker Unie, a farming cooperative that processes about 60 percent of the Dutch sugar beet crop. The bulk delivery problem differs in several aspects from the standard multi-depot vehicle-routing problem: trucks deliver full loads to each customer and can reload at any one of five factories. Loading the trucks is very time consuming, and at each factory trucks can only be loaded one at a time, so that the problem includes both scheduling and routing. Since September 1991, the planners of Suiker Unie use the system to interactively determine and adjust daily schedules. In addition to the improvement of the efficiency and quality of the planning process, the use of the system turned out to yield about seven percent savings in operating costs.", "keywords": [ "Truck", "Vehicle routing problem", "Scheduling (production processes)", "Operations research", "Routing (electronic design automation)", "Engineering", "Factory (object-oriented programming)", "Operations management", "Computer science", "Transport engineering", "Manufacturing engineering", "Automotive engineering" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/inte.22.3.4" }, { "id": "https://openalex.org/W4413161282", "doi": "10.2172/2462803", "title": "Improving the Freight Productivity of a Heavy-Duty, Battery Electric Truck by Intelligent Energy Management", "year": 2024, "publication_date": "2024-07-30", "type": "report", "language": "en", "authors": [ "USDOE", "Jian Li", "William F. Northrop", "Eagon Matthew" ], "first_author": "USDOE", "venue": null, "publisher": null, "abstract": "This project aimed to enhance the range and reduce the operating costs of battery electric Class 8 trucks traveling over 250 miles daily. This was achieved through the development and implementation of an intelligent-Energy Management System (i-EMS) that leverages vehicle and operations data, physics-aware machine learning algorithms, and vehicle-to-cloud (V2C) connectivity. The project hypothesized that advanced machine learning algorithms and real-time data analytics could significantly improve the energy efficiency and range of these trucks. Key objectives included developing a physics-aware machine learning algorithm, implementing an i-EMS with V2C connectivity and physics-aware spatial data analytics (PSDA), and validating the system’s effectiveness with fleet partners HEB Companies and Murphy Logistics. Extensive data collection from vehicle operations, including vehicle characteristics, road conditions, and payload, was conducted. A machine learning algorithm was developed to predict energy consumption and enable proactive decision-making. The i-EMS was implemented on two Volvo VNR BEVs, with operators receiving charging and routing recommendations. Charging stations were installed at depot locations in Texas and Minnesota, with an additional on-route charger in Minnesota. Significant findings included a 14% range improvement for Murphy Logistics on a highway-driving eco-route and a 22% range improvement for HEB Companies on a city-driving eco-route. The i-EMS utilized rule-based methods and physics-based algorithms to predict and reduce energy consumption, with real-time monitoring and analysis through V2C connectivity enabling proactive decision-making. The project demonstrated the feasibility and economic viability of battery electric Class 8 trucks for long-haul operations, showcasing the potential of physics-aware machine learning in optimizing energy management. The successful implementation of the i-EMS in real-world scenarios validates its practical application and effectiveness, paving the way for the widespread adoption of battery electric vehicles in the freight transportation industry.", "keywords": [ "Computer science" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.osti.gov/servlets/purl/2462803" }, { "id": "https://openalex.org/W2621671707", "doi": "10.1016/j.apenergy.2017.05.156", "title": "Optimization of sawmill residues collection for bioenergy production", "year": 2017, "publication_date": "2017-06-06", "type": "article", "language": "en", "authors": [ "David Zamar", "R. Bhushan Gopaluni", "Shahab Sokhansanj" ], "first_author": "David Zamar", "venue": "Applied Energy", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Biomass (ecology)", "Bioenergy", "Heuristics", "Vehicle routing problem", "Schedule", "Environmental science", "Renewable energy", "Benchmark (surveying)", "Routing (electronic design automation)", "Computer science", "Operations research" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.apenergy.2017.05.156" }, { "id": "https://openalex.org/W2987452136", "doi": "10.1504/ijise.2020.10025370", "title": "Particle Swarm Optimization for Truck Scheduling Problem in Cross Docking Network", "year": 2019, "publication_date": "2019-11-16", "type": "article", "language": "en", "authors": [ "Piya Hengmeechai", "Takashi Irohara", "Warisa Wisittipanich" ], "first_author": "Piya Hengmeechai", "venue": "International Journal of Industrial and Systems Engineering", "publisher": "Inderscience Publishers", "abstract": "In cross docking network, multiple products from multiple origins are transferred by trucks through one or more cross docks. One critical concern is the decision on how to synchronise product transshipment through multiple cross docks to achieve timely shipment. This paper presents a mathematical model of truck scheduling problem in cross docking network in order to minimise makespan. Since the problem is NP-hard, a solution method is developed based on particle swarm optimisation (PSO) with two solution representations: randomised truck solution representation (Ra-SR) and prioritised truck solution representation (Pr-SR). The results show that the PSO-based approach performs well in solving the problem. Both solution representations are proven effective when comparing the solution quality and computational time with optimal results obtained from LINGO. However, the Pr-SR yields superior results to the Ra-SR in terms of solution quality and convergence behaviour for most instances especially in the case of large-size problems.", "keywords": [ "Particle swarm optimization", "Truck", "Transshipment (information security)", "Job shop scheduling", "Mathematical optimization", "Computer science", "Scheduling (production processes)", "Operations research", "Engineering", "Mathematics", "Automotive engineering", "Computer network" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijise.2020.10025370" }, { "id": "https://openalex.org/W4206258679", "doi": "10.1016/j.cor.2022.105696", "title": "Multi-fleet feeder vehicle routing problem using hybrid metaheuristic", "year": 2022, "publication_date": "2022-01-07", "type": "article", "language": "en", "authors": [ "M. Salehi Sarbijan", "Javad Behnamian" ], "first_author": "M. Salehi Sarbijan", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Particle swarm optimization", "Simulated annealing", "Vehicle routing problem", "Computer science", "Variable neighborhood search", "Metaheuristic", "Ant colony optimization algorithms", "Algorithm", "Mathematical optimization", "Truck", "Taguchi methods", "Hybrid algorithm (constraint satisfaction)" ], "cited_by_count": 28, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2022.105696" }, { "id": "https://openalex.org/W4411225498", "doi": "10.1016/j.eswa.2025.128503", "title": "Multi-objective optimization for time-dependent vehicle routing problem with drones", "year": 2025, "publication_date": "2025-06-12", "type": "article", "language": "en", "authors": [ "Yong Peng", "Chengxi Zhang", "Ajinkya N. Tanksale", "Dennis Z. Yu" ], "first_author": "Yong Peng", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Vehicle routing problem", "Computer science", "Mathematical optimization", "Routing (electronic design automation)", "Mathematics", "Computer network" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2025.128503" }, { "id": "https://openalex.org/W640517181", "doi": null, "title": "Truck-to-Door Assignment at a Cross-Dock Facility with Controllable Handling Times", "year": 2013, "publication_date": "2013-01-01", "type": "article", "language": "en", "authors": [ "Dinçer Konur", "Mihalis Golias" ], "first_author": "Dinçer Konur", "venue": "Transportation Research Board 92nd Annual MeetingTransportation Research Board", "publisher": null, "abstract": "This paper studies the inbound truck-to-door assignment problem at a cross-dock facility with controllable truck handling times. In particular, the handling time of a truck is discretely defined by the number of workers (or material handling equipment) assigned to a door. The cross-dock operator aims at minimizing the total labor cost by determining the number of workers allocated at each door as well as the truck-to-door assignment. The authors first discuss a branch-and-price method for the problem of interest. Then, two evolutionary heuristic methods are discussed. Numerical studies are conducted to compare the branch-and-price method to the evolutionary heuristics.", "keywords": [ "Truck", "DOCK", "Heuristics", "Heuristic", "Material handling", "Computer science", "Assignment problem", "Engineering", "Operations research", "Mathematical optimization", "Mathematics", "Industrial engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1240713" }, { "id": "https://openalex.org/W2286136135", "doi": null, "title": "Truck Scheduling Problem in a Cross-Dock Centre with Fixed Due Dates", "year": 2015, "publication_date": "2015-11-09", "type": "article", "language": "en", "authors": [ "Mohsen S. Sajadieha", "Danyar Molavia" ], "first_author": "Mohsen S. Sajadieha", "venue": "World Academy of Science, Engineering and Technology, International Journal of Industrial and Manufacturing Engineering", "publisher": null, "abstract": null, "keywords": [ "DOCK", "Truck", "Scheduling (production processes)", "Computer science", "Operations research", "Operations management", "Engineering", "Automotive engineering", "Marine engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.waset.org/abstracts/32252" }, { "id": "https://openalex.org/W4292292969", "doi": "10.1007/s10479-022-04891-1", "title": "Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition", "year": 2022, "publication_date": "2022-08-08", "type": "article", "language": "en", "authors": [ "Simon Emde", "Shohre Zehtabian", "Yann Disser" ], "first_author": "Simon Emde", "venue": "Annals of Operations Research", "publisher": "Springer Science+Business Media", "abstract": "We consider the problem of scheduling a set of direct deliveries between a depot and multiple customers using a given heterogeneous truck fleet. The trips have time windows and weights, and they should be completed as soon after release as possible (minimization of maximum weighted flow time). Moreover, some trips can optionally be combined in predefined milk runs (i.e., round trip tours), which need not be linear combinations of the constituent direct trips, accounting, e.g., for consolidation effects because the loading dock needs to be approached only once. This problem has applications, e.g., in just-in-time, humanitarian, and military logistics. We adapt a mixed-integer programming model from the literature to this problem and show that deciding feasibility is NP-complete in the strong sense on three levels: assigning trips to trucks, selecting milk runs, and scheduling trips on each individual truck. We also show that, despite this complexity, a state-of-the-art constraint programming solver and a problem-specific approach based on logic-based Benders decomposition can solve even large instances with up to 175 trips in many cases, while the mixed-integer programming model is essentially unsolvable using commercial optimization software. We also investigate the robustness of the maximum flow time objective in the face of unforeseen delays as well as the influence of milk runs.", "keywords": [ "TRIPS architecture", "Computer science", "Theory of computation", "Integer programming", "Solver", "Mathematical optimization", "Scheduling (production processes)", "Benders' decomposition", "Linear programming", "Constraint programming", "Operations research", "Algorithm" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://pure.au.dk/portal/files/422117171/Emde_et_al._2022_-_Point-to-point_and_milk_run_delivery_scheduling_models_complexity_results_and_algorithms_based_on_Benders_decomposition-combined.pdf" }, { "id": "https://openalex.org/W2113788787", "doi": "10.1093/annhyg/meh018", "title": "Occupational Exposure to Diesel Exhaust Fumes", "year": 2004, "publication_date": "2004-05-18", "type": "article", "language": "en", "authors": [ "A. D. Wheatley", "Steven S Sadhra" ], "first_author": "A. D. Wheatley", "venue": "The Annals of Occupational Hygiene", "publisher": "Oxford University Press", "abstract": "There is currently no OEL for diesel fumes in the UK. This study reports parallel measurements of airborne levels of diesel fume pollutants in nine distribution depots where diesel powered fork-lift trucks (FLTs) were in use. Correlations between individual pollutants are assessed as well as their spatial distribution. Samples were collected on board FLTs and at background positions at nine distribution depots. Substances measured and the range of exposures by site were: respirable dust (n = 76) GM 77,000kg efficiency is generated because the output of the sorting table is greater than the incoming input so that there are no goods stored in the warehouse and increase the number of trucks by 10 units, then the delivery of goods can be done one way and no goods are stored in the warehouse.The results of the analysis can be said that the application of cross docking in the company gains efficiency in the distribution of goods to expedition partners.", "keywords": [ "Computer science" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ieomsociety.org/proceedings/2022australia/450.pdf" }, { "id": "https://openalex.org/W3021477763", "doi": "10.1007/s00291-020-00586-w", "title": "Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines", "year": 2020, "publication_date": "2020-05-03", "type": "article", "language": "en", "authors": [ "Giorgi Tadumadze", "Simon Emde", "Heiko Diefenbach" ], "first_author": "Giorgi Tadumadze", "venue": "OR Spectrum", "publisher": "Springer Science+Business Media", "abstract": "This paper addresses scheduling a set of jobs with release dates and deadlines on a set of unrelated parallel machines to minimize some minmax objective. This family of problems has a number of applications, e.g., in discrete berth allocation and truck scheduling at cross docks. We present a novel exact algorithm based on logic-based Benders decomposition as well as a heuristic based on a set partitioning reformulation of the problem. We show how our approaches can be used to deal with additional constraints and various minmax objectives common to the above-mentioned applications, solving a broad class of parallel machine scheduling problems. In a series of computational tests both on instances from the literature and on newly generated ones, our exact method is shown to solve most problems within a few minutes to optimality, while our heuristic can solve particularly challenging instances with tight time windows well in acceptable time.", "keywords": [ "Computer science", "Mathematical optimization", "Scheduling (production processes)", "Minimax", "Heuristic", "Job shop scheduling", "Algorithm", "Heuristics", "Set (abstract data type)", "Mathematics", "Artificial intelligence", "Schedule" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://pure.au.dk/portal/en/publications/93785a08-856d-489f-b70d-e51aaf61c0ab" }, { "id": "https://openalex.org/W767361258", "doi": null, "title": "Optimal Operational Strategy for Cross Docking Systems", "year": 2006, "publication_date": "2006-01-01", "type": "article", "language": "en", "authors": [ "Wooyeon Yu", "Chi-Woon Cho", "Jaekyung Yang" ], "first_author": "Wooyeon Yu", "venue": "Journal of the Korea Safety Management and Science", "publisher": null, "abstract": "A cross docking operation involves multiple trucks (known as inbound trucks) that deliver items from suppliers to a distribution center and multiple trucks (known as outbound trucks) that ship items from the distribution center to customers. Based on customer demands, an inbound truck may have its items transferred to multiple outbound trucks. Similarly, an outbound truck can receive its consignments from multiple inbound trucks. A unique characteristic of a cross docking system is the absence or prohibition of long term storage of items at the distribution center. Items delivered to the distribution center from suppliers are shipped to customers as soon as possible without being placed in storage in the distribution center. The objective of this paper is to develop the optimal operational strategy for finding the best truck docking sequence for both inbound and outbound trucks in order to minimize total operation time where a temporary storage area is not available in a cross docking system.", "keywords": [ "Truck", "Distribution center", "Transport engineering", "Computer science", "Engineering", "Business", "Automotive engineering", "Marketing" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=OJGOBW_2006_v8n3_103" }, { "id": "https://openalex.org/W2041213020", "doi": "10.1061/(asce)co.1943-7862.0000853", "title": "Assessing the Accuracy of Expert-Based Decisions in Dispatching Ready Mixed Concrete", "year": 2014, "publication_date": "2014-03-06", "type": "article", "language": "en", "authors": [ "Mojtaba Maghrebi", "Steven Travis Waller", "Claude Sammut" ], "first_author": "Mojtaba Maghrebi", "venue": "Journal of Construction Engineering and Management", "publisher": "American Society of Civil Engineers", "abstract": "In ready mixed concrete (RMC) dispatching, common practice is to rely on human experts for any necessary real-time decision making. This is because of the perceived complexity of RMC dispatching and the general lack of highly applicable optimization tools for the task. Critically, the accuracy of expert decisions (compared to optimization approaches) has not been comprehensively examined in the literature. To address the question of current practice expert accuracy in the context of optimized outcomes, this paper first mathematically models the RMC dispatching problem according to methods introduced in the literature. Two approaches are taken: integer programming (without time windows) and mixed-integer programming (with time windows). Further, the constructed models are tested with field data and compared to the decisions made by experts. The RMC data set has four depots and approximately 40 trucks that typically supply 40–200 deliveries per day. The results show that, on average, experts’ decisions are 90% accurate compared to the optimization models under examination. Finally, further investigation suggests that at least a portion of this optimality gap between expert and optimization models occurs because experts in critical situations accept a higher cost to ensure a more stable dispatching system.", "keywords": [ "Computer science", "Integer programming", "Context (archaeology)", "Operations research", "Task (project management)", "Set (abstract data type)", "Integer (computer science)", "Expert system", "Machine learning", "Artificial intelligence", "Engineering", "Algorithm" ], "cited_by_count": 26, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1061/(asce)co.1943-7862.0000853" }, { "id": "https://openalex.org/W3232306", "doi": null, "title": "Models and algorithms for the empty container repositioning and its integration with routing problems", "year": 2013, "publication_date": "2013-05-20", "type": "dissertation", "language": "en", "authors": [ "Michela Lai" ], "first_author": "Michela Lai", "venue": "VEprints - Universita degli Studi di Cagliari", "publisher": null, "abstract": "The introduction of containers has fostered intermodal freight transportation. A definition of intermodality was provided by the European Commission as “a characteristic \\nof a transport system whereby at least two different modes are used in an integrated manner in order to complete a door-to-door transport sequence”. The intermodal container transportation leads to several benefits, such as higher \\nproductivity during handling phases and advantages in terms of security, losses and damages. However, the distribution of containers comes with a drawback: due to directional imbalances in freight flows, some areas tend to accumulate unnecessary empty containers, while others face container shortages. Several planning models were developed for carriers in order to manage both loaded and empty containers profitably. However, they were built to operate under normal circumstances, neglecting the fact that networks are increasingly affected by both uncertainty and vulnerability, which may result in disruptions. The thesis aims to survey whether the impact of uncertainty can be mitigated by a stochastic programming approach, in which disruptions and normal operations are both foreseen as possible futures or scenarios. This approach is carried out by a multi-scenario optimization model in which scenarios are linked by non-anticipativity conditions. The empty container repositioning becomes even more challenging and difficult when integrated with routing problems. In fact, carriers often face problems in which they must determine simultaneously how many empty containers are carried by a \\nfleet of vehicles and which routes must be followed by these vehicles. These problems typically arise in inland networks, in which one must plan the distribution by trucks \\nof loaded and empty containers to customers. \\nThe thesis addresses this type of vehicle routing problems, which are motivated by a real case study occurred during the collaboration with a carrier that operates in the Mediterranean Sea in door-to-door modality. The carrier manages a fleet of trucks based at the port. Trucks and containers are used to service two types of transportation requests, the delivery of container loads from the port to import customers, and the shipment of container loads from export customers to the port. The thesis addresses two problems which differ in the composition of the fleet \\nof trucks. The first problem involves a heterogeneous fleet of trucks that can carry one or two containers. We present a Vehicle Routing Problem with backhauls, load \\nsplits into multiple visits, and the impossibility to separate trucks and containers during customer service. Then, we formalize the problem by an Integer Linear \\nProgramming formulation and propose an efficient meta-heuristic algorithm able to solve it. The meta-heuristic determines the initial solution by a variant of the Clarkeand-Wright algorithm, and improves it by several local search phases, in which both node movements and truck swaps are implemented. The second problem involves a homogeneous fleet of trucks that can carry more than a container. As a consequence, the identification of routes can be more difficult. We present and formalize the associated Vehicle Routing Problem by an Integer Linear Programming formulation. Then we propose an efficient adaptive guidance meta-heuristic algorithm able to solve \\nit. The meta-heuristic determines an initial feasible solution by a Tabu Search step, and next improves this solution by appropriate adaptive guidance mechanisms.", "keywords": [ "Container (type theory)", "Computer science", "Order (exchange)", "Routing (electronic design automation)", "Operations research", "Plan (archaeology)", "Futures contract", "Transport engineering", "Engineering", "Business" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/11584/266107" }, { "id": "https://openalex.org/W4386969711", "doi": "10.1016/j.ejco.2023.100078", "title": "Constraint programming models for the parallel drone scheduling vehicle routing problem", "year": 2023, "publication_date": "2023-01-01", "type": "article", "language": "en", "authors": [ "Roberto Montemanni", "Mauro Dell’Amico" ], "first_author": "Roberto Montemanni", "venue": "EURO Journal on Computational Optimization", "publisher": "Springer Science+Business Media", "abstract": "Drones are currently seen as a viable way for improving the distribution of parcels in urban and rural environments, while working in coordination with traditional vehicles like trucks. In this paper we consider the parallel drone scheduling vehicle routing problem, where the service of a set of customers requiring a delivery is split between a fleet of trucks and a fleet of drones. We consider two variations of the problem. In the first one, the problem is more theoretical, and the target is the minimization of the time required to complete the service and have all the vehicles back to the depot. In the second variant, more realistic constraints involving operating costs, capacity limitation and workload balance, are considered, and the target is to minimize the total operational costs. We propose different constraint programming models to deal with the two problems. An experimental champaign on the instances previously adopted in the literature is presented to validate the new solving methods. The results show that, on top of being a viable way to solve problems to optimality, the models can also be used to derive effective heuristic solutions and high-quality lower bounds for the optimal cost, if the execution is interrupted before its natural end.", "keywords": [ "Computer science", "Vehicle routing problem", "Drone", "Truck", "Scheduling (production processes)", "Mathematical optimization", "Workload", "Constraint programming", "Job shop scheduling", "Operations research", "Routing (electronic design automation)", "Heuristic" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejco.2023.100078" }, { "id": "https://openalex.org/W4383956551", "doi": "10.21203/rs.3.rs-3155023/v1", "title": "Multi-objective Optimization Model of Truck Scheduling Problem using Cross-Dock in Supply Chain Management: NSGA-II & NRGA", "year": 2023, "publication_date": "2023-07-11", "type": "preprint", "language": "en", "authors": [ "Ahsan Haqhgoie", "Alireza Irajpour", "Nasser Hamidi" ], "first_author": "Ahsan Haqhgoie", "venue": "Research Square", "publisher": null, "abstract": "Abstract A large percentage of the cost of most products is related to shipping and distribution costs. By the proper design of the product distribution network, as an important part of the supply chain, these costs can be reduced in the logistic activities. The use of cross-docks between suppliers and customers is a solution utilized in supply chain management to reduce costs. Cross-docks are one of the most important options for reducing time in the supply chain. Accordingly, this paper develops a multi-objective problem of scheduling the operations of trucks entering and exiting cross-docks by considering that the number of products that are unloaded or loaded by trucks is fuzzy logistic. The first objective function minimizes the maximum time to receive the products. The second objective function minimizes the emission cost of trucks. Finally, the third objective function minimizes the number of trucks assigned to the entrance and exit doors. Then, two steps are implemented to validate and modify the proposed model. In the first step, two random numerical examples in small dimensions were solved by GAMS software with min-max objective function as well as Genetic Algorithms (GA) and Particle Swarm Optimization (PSO). In the second step, due to the increasing dimensions of the problem and computational complexity, the problem in question is part of the NP-Hard problem and therefore multi-objective meta-heuristic algorithms are utilized along with validation and parameter adjustment. Therefore, non-dominated sorting genetic algorithm (NSGA-II) and non-dominated ranking genetic algorithm (NSGA) are employed to solve 30 random problems in high dimensions. Then, the algorithms were ranked using the TOPSIS method for each problem according to the results obtained from the evaluation criteria. The analysis of the results confirms the applicability of the proposed model and solution methods.", "keywords": [ "Truck", "Mathematical optimization", "Genetic algorithm", "Supply chain", "Sorting", "Computer science", "Particle swarm optimization", "Scheduling (production processes)", "Supply chain management", "Multi-objective optimization", "Operations research", "Engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.researchsquare.com/article/rs-3155023/latest.pdf" }, { "id": "https://openalex.org/W2896868750", "doi": "10.1016/j.omega.2018.10.003", "title": "Parallel machine scheduling with job synchronization to enable efficient material flows in hub terminals", "year": 2018, "publication_date": "2018-10-09", "type": "article", "language": "en", "authors": [ "Peng Guo", "Felix Weidinger", "Nils Boysen" ], "first_author": "Peng Guo", "venue": "Omega", "publisher": "Elsevier BV", "abstract": "Hub terminals are important entities in today’s distribution networks. They exist for all means of transportation, e.g., cross docks for trucks, hub airports for aircraft, transshipment yards for freight trains, and container ports for vessels. This paper abstracts from the peculiarities of each application and presents a generic problem setting, which synchronizes inbound and outbound flows in general hub terminals. We derive a parallel machine scheduling problem with job synchronization. Jobs processed on machines represent vehicles loaded and/or unloaded at different service points. Whenever two vehicles aim to transfer loads among each other, they should simultaneously be processed, so that loads can directly be exchanged without intermediate storage and double-handling. To reach this general aim we predefine target transfer durations for job pairs and aim to maximize the weighted realized transfer durations. For this elementary problem, computational complexity is investigated and two mixed-integer programming models are introduced. Furthermore, an efficient and easily adaptable heuristic based on fix and optimize is presented. Finally, we show how to customize our generic model to specific hub terminals.", "keywords": [ "Synchronization (alternating current)", "Computer science", "Scheduling (production processes)", "Distributed computing", "Computer network", "Operations management", "Engineering" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.omega.2018.10.003" }, { "id": "https://openalex.org/W3114203296", "doi": "10.51202/9783181023501-123", "title": "ZF Assistance Functions for Swap Body Trucks – Functional innovations support trucks for the autonomous, safe and efficient handling of containers at depots", "year": 2019, "publication_date": "2019-01-01", "type": "book-chapter", "language": "en", "authors": [ "Ashim K. Banerjee", "Patrick Knieß", "Friedrich Tenbrock", "Martin Mohr", "Gerhard Gumpoltsberger" ], "first_author": "Ashim K. Banerjee", "venue": "VDI Verlag eBooks", "publisher": null, "abstract": null, "keywords": [ "Truck", "Swap (finance)", "Automotive engineering", "Computer science", "Business", "Transport engineering", "Engineering", "Finance" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.51202/9783181023501-123" }, { "id": "https://openalex.org/W4403794757", "doi": "10.1080/15568318.2024.2419378", "title": "Sustainable last mile logistics employing drones and e-bikes", "year": 2024, "publication_date": "2024-10-01", "type": "article", "language": "en", "authors": [ "Stephanie Santiago-Montaño", "Daniel F. Silva", "Alice E. Smith" ], "first_author": "Stephanie Santiago-Montaño", "venue": "International Journal of Sustainable Transportation", "publisher": "Taylor & Francis", "abstract": "Last mile delivery is an important and growing part of the supply chain that has a sizeable negative environmental impact. This paper considers more sustainable approaches to home-delivery that are pragmatic for many non-rural environments. We address the two-echelon, multi-trip, capacitated vehicle routing problem with home-delivery and optional self-pickup services using different combinations of drones, trucks, and electric-assisted bikes (i.e. e-bikes). In the proposed approach, parcels are transported from a depot to parcel lockers by either drones or trucks and are then delivered to customer locations by either e-bikes or trucks. The four approaches range from the most sustainable (drones then e-bikes) to partly green (drone then truck or truck then e-bike) to finally the traditional (truck then truck). We formulate a mathematical model that determines the vehicle routes to minimize the total cost, which consists of vehicle operational cost and operator wages. The four types of delivery networks are assessed and compared for both costs and emissions. Experimental results suggest that with a modest increase in total cost (as little as 13%), emission reductions of up to 92%, on average, can be achieved when using the greenest delivery strategy of drones and e-bikes. The other delivery options have varying tradeoffs between costs and environmental impact. The percentage of self-pickup customers is an influencing factor to consider when choosing the delivery strategy that best meets the organization’s budget and environmental goals, especially when using e-bikes in the second echelon.", "keywords": [ "Drone", "Mile", "Last mile (transportation)", "Transport engineering", "Aeronautics", "Business", "Sustainable transport", "Engineering", "Sustainability", "Geography" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/15568318.2024.2419378" }, { "id": "https://openalex.org/W267191905", "doi": null, "title": "Design of Distribution Facility for Cross Docking Systems", "year": 2008, "publication_date": "2008-01-01", "type": "article", "language": "en", "authors": [ "Wooyeon Yu", "Yun-Sun Park", "Junghyun Shin" ], "first_author": "Wooyeon Yu", "venue": "Journal of the Korea Safety Management and Science", "publisher": null, "abstract": "Cross docking is a warehouse management concept in which items delivered to a distribution facility by inbound trucks are immediately sorted out and reorganized based on customer demands and are routed and loaded into outbound trucks for delivery to customers without actually being held in inventory in the distribution facility. In this research, the design of distribution facility for cross docking systems was studied. The objective of this research is to find the minimum number of receiving docks and shipping docks, respectively, in order to meet the daily demand of the distribution center. Two solution approaches are employed in modeling and solving the problem The first approach is mathematical modeling and the second approach is a simulation. The logic developed in the simulation model is expected to apply to the real world situation.", "keywords": [ "Truck", "Distribution center", "Computer science", "Operations research", "Inventory management", "Transport engineering", "Operations management", "Engineering", "Business", "Marketing", "Automotive engineering" ], "cited_by_count": 0, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=OJGOBW_2008_v10n2_187" }, { "id": "https://openalex.org/W1922821555", "doi": "10.1007/978-3-642-46865-0_16", "title": "When to apply optimal or heuristic routing of orderpickers", "year": 1998, "publication_date": "1998-01-01", "type": "book-chapter", "language": "en", "authors": [ "René B.M. de Koster", "EDO VAN DER POORT", "Kees Jan Roodbergen" ], "first_author": "René B.M. de Koster", "venue": "Lecture notes in economics and mathematical systems", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Aisle", "Pallet", "Heuristic", "Routing (electronic design automation)", "Truck", "Computer science", "Mathematical optimization", "Reduction (mathematics)", "Order picking", "Vehicle routing problem", "Operations research", "Warehouse" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-642-46865-0_16" }, { "id": "https://openalex.org/W4406064172", "doi": "10.1016/j.trc.2024.104987", "title": "Two-echelon prize-collecting vehicle routing with time windows and vehicle synchronization: A branch-and-price approach", "year": 2025, "publication_date": "2025-01-05", "type": "article", "language": "en", "authors": [ "I. Edhem Sakarya", "Milad Elyasi", "S.U.K. Rohmer", "Okan Örsan Özener", "Tom Van Woensel", "Ali Ekici" ], "first_author": "I. Edhem Sakarya", "venue": "Transportation Research Part C Emerging Technologies", "publisher": "Elsevier BV", "abstract": "The steady growth in e-commerce and grocery deliveries within cities strains the available infrastructure in urban areas by increasing freight movements, aggravating traffic congestion, and air and noise pollution. This research introduces the Two-Echelon Prize-Collecting Vehicle Routing Problem with Time Windows and Vehicle Synchronization , where deliveries are carried out by smaller low- or zero-emission vehicles and larger trucks. Given their capacity restrictions, the smaller vehicles can only deliver small-sized orders and must be replenished via depot locations or larger-sized trucks. Besides replenishing smaller vehicles at satellite locations, larger trucks can deliver small orders and larger items. Managing these two types of fleets in an urban setting under consideration of capacity limitations, tight delivery time windows, vehicle synchronization, and selective order fulfillment is challenging. We model this problem on a time-expanded network and apply network reduction by considering the time window constraints. In addition, we propose a branch-and-price algorithm capable of solving instances with up to 200 customers, which continuously outperforms a state-of-the-art general-purpose optimization solver. Moreover, we present several managerial insights concerning synchronization, vehicles, and the placement of depot/satellite locations. • We address a novel last-mile distribution problem with vehicle synchronization. • Selective order fulfillment, multiple trips, and tight and long time windows are integrated into a two-echelon setting. • A branch-and-price algorithm is proposed to solve the problem for different-sized instances. • Results show that our method finds optimal solutions for instances with up to 200 customers. • We derive detailed managerial insights by studying the effects of synchronization and different instance structures.", "keywords": [ "Vehicle routing problem", "Synchronization (alternating current)", "Computer science", "Time synchronization", "Real-time computing", "Routing (electronic design automation)", "Operations research", "Engineering", "Computer network" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trc.2024.104987" } ]