[ { "id": "https://openalex.org/W2111581650", "doi": "10.1287/opre.12.4.568", "title": "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points", "year": 1964, "publication_date": "1964-08-01", "type": "article", "language": "en", "authors": [ "Graham Clarke", "J. W. Wright" ], "first_author": "Graham Clarke", "venue": "Operations Research", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "The optimum routing of a fleet of trucks of varying capacities from a central depot to a number of delivery points may require a selection from a very large number of possible routes, if the number of delivery points is also large. This paper, after considering certain theoretical aspects of the problem, develops an iterative procedure that enables the rapid selection of an optimum or near-optimum route. It has been programmed for a digital computer but is also suitable for hand computation.", "keywords": [ "Truck", "Computer science", "Scheduling (production processes)", "Computation", "Mathematical optimization", "Selection (genetic algorithm)", "Routing (electronic design automation)", "Vehicle routing problem", "Depot", "Operations research", "Mathematics", "Computer network" ], "cited_by_count": 3910, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/opre.12.4.568" }, { "id": "https://openalex.org/W2315956047", "doi": "10.1021/es400179w", "title": "Electric Urban Delivery Trucks: Energy Use, Greenhouse Gas Emissions, and Cost-Effectiveness", "year": 2013, "publication_date": "2013-06-20", "type": "article", "language": "en", "authors": [ "Dong-Yeon Lee", "Valerie M. Thomas", "Marilyn A. Brown" ], "first_author": "Dong-Yeon Lee", "venue": "Environmental Science & Technology", "publisher": "American Chemical Society", "abstract": "We compare electric and diesel urban delivery trucks in terms of life-cycle energy consumption, greenhouse gas (GHG) emissions, and total cost of ownership (TCO). The relative benefits of electric trucks depend heavily on vehicle efficiency associated with drive cycle, diesel fuel price, travel demand, electric drive battery replacement and price, electricity generation and transmission efficiency, electric truck recharging infrastructure, and purchase price. For a drive cycle with frequent stops and low average speed such as the New York City Cycle (NYCC), electric trucks emit 42-61% less GHGs and consume 32-54% less energy than diesel trucks, depending upon vehicle efficiency cases. Over an array of possible conditions, the median TCO of electric trucks is 22% less than that of diesel trucks on the NYCC. For a drive cycle with less frequent stops and high average speed such as the City-Suburban Heavy Vehicle Cycle (CSHVC), electric trucks emit 19-43% less GHGs and consume 5-34% less energy, but cost 1% more than diesel counterparts. Considering current and projected U.S. regional electricity generation mixes, for the baseline case, the energy use and GHG emissions ratios of electric to diesel trucks range from 48 to 82% and 25 to 89%, respectively.", "keywords": [ "Truck", "Greenhouse gas", "Environmental science", "Waste management", "Environmental engineering", "Engineering", "Automotive engineering" ], "cited_by_count": 174, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1021/es400179w" }, { "id": "https://openalex.org/W2066344237", "doi": "10.1016/j.ejor.2006.10.047", "title": "Scheduling of inbound and outbound trucks in cross docking systems with temporary storage", "year": 2007, "publication_date": "2007-01-04", "type": "article", "language": "en", "authors": [ "Wooyeon Yu", "Pius J. Egbelu" ], "first_author": "Wooyeon Yu", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Warehouse", "Computer science", "Scheduling (production processes)", "DOCK", "Operations research", "Transport engineering", "Operations management", "Business", "Engineering", "Automotive engineering", "Marketing" ], "cited_by_count": 351, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2006.10.047" }, { "id": "https://openalex.org/W3134504082", "doi": "10.1016/j.ins.2021.02.039", "title": "An Adaptive Polyploid Memetic Algorithm for scheduling trucks at a cross-docking terminal", "year": 2021, "publication_date": "2021-03-02", "type": "article", "language": "en", "authors": [ "Maxim A. Dulebenets" ], "first_author": "Maxim A. Dulebenets", "venue": "Information Sciences", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Tardiness", "Memetic algorithm", "Mathematical optimization", "Job shop scheduling", "Scheduling (production processes)", "Truck", "Algorithm", "Operations research", "Mathematics", "Engineering", "Local search (optimization)" ], "cited_by_count": 288, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ins.2021.02.039" }, { "id": "https://openalex.org/W2056925841", "doi": "10.1007/s00291-008-0139-2", "title": "Scheduling inbound and outbound trucks at cross docking terminals", "year": 2008, "publication_date": "2008-05-28", "type": "article", "language": "en", "authors": [ "Nils Boysen", "Malte Fliedner", "Armin Schöll" ], "first_author": "Nils Boysen", "venue": "OR Spectrum", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Computer science", "Scheduling (production processes)", "DOCK", "Operations research", "Fleet management", "Operations management", "Automotive engineering", "Engineering" ], "cited_by_count": 211, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00291-008-0139-2" }, { "id": "https://openalex.org/W2041348841", "doi": "10.1016/j.cor.2009.03.010", "title": "Truck scheduling at zero-inventory cross docking terminals", "year": 2009, "publication_date": "2009-03-27", "type": "article", "language": "en", "authors": [ "Nils Boysen" ], "first_author": "Nils Boysen", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Tardiness", "Computer science", "Scheduling (production processes)", "Operations research", "Job shop scheduling", "Fleet management", "Operations management", "Automotive engineering", "Engineering", "Routing (electronic design automation)", "Computer network" ], "cited_by_count": 188, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2009.03.010" }, { "id": "https://openalex.org/W2050100368", "doi": "10.1016/j.cie.2009.06.006", "title": "Scheduling trucks in cross-docking systems: Robust meta-heuristics", "year": 2009, "publication_date": "2009-06-26", "type": "article", "language": "en", "authors": [ "Behnam Vahdani", "M. Zandieh" ], "first_author": "Behnam Vahdani", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Heuristics", "Truck", "Docking (animal)", "Computer science", "Scheduling (production processes)", "Mathematical optimization", "Engineering", "Mathematics", "Automotive engineering", "Medicine", "Operating system" ], "cited_by_count": 198, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2009.06.006" }, { "id": "https://openalex.org/W1983317903", "doi": "10.1016/j.omega.2009.10.008", "title": "Cross dock scheduling: Classification, literature review and research agenda", "year": 2009, "publication_date": "2009-11-13", "type": "article", "language": "en", "authors": [ "Nils Boysen", "Malte Fliedner" ], "first_author": "Nils Boysen", "venue": "Omega", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "DOCK", "Doors", "Scheduling (production processes)", "Computer science", "Operations research", "Consolidation (business)", "Transport engineering", "Engineering", "Operations management", "Business" ], "cited_by_count": 360, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.omega.2009.10.008" }, { "id": "https://openalex.org/W2966840652", "doi": "10.1016/j.trd.2019.07.024", "title": "Understanding urban delivery drivers’ intention to adopt electric trucks in China", "year": 2019, "publication_date": "2019-07-31", "type": "article", "language": "en", "authors": [ "Min Zhou", "Nan Kong", "Lindu Zhao", "Fuhua Huang", "Song Wang", "Kathryn S. Campy" ], "first_author": "Min Zhou", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Context (archaeology)", "Transport engineering", "Anxiety", "China", "Business", "Engineering", "Psychology", "Automotive engineering", "Geography" ], "cited_by_count": 52, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2019.07.024" }, { "id": "https://openalex.org/W4391553481", "doi": "10.1016/j.trd.2024.104078", "title": "Depot slow charging is sufficient for most electric trucks in Germany", "year": 2024, "publication_date": "2024-02-05", "type": "article", "language": "en", "authors": [ "Daniel Speth", "Patrick Plötz" ], "first_author": "Daniel Speth", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": "Battery electric trucks (BETs) can dramatically reduce tail-pipe emissions from heavy-duty vehicles. However, their limited range necessitates frequent charging. Megawatt charging has been discussed as requirement and potential barrier for fast BET market diffusion. Here, we simulate all daily trips of 2,410 trucks in Germany as BETs with lowest charging power required. Assuming 450 – 700 km (2030 – 2050) range, the share of vehicles replaceable by BETs is higher than 90 %. Most charging events (>95 % of night charging, >75 % of day charging) need maximally 44 kW. Higher power, mostly 45 – 350 kW, is mainly needed during the day by up to 25 % of charging vehicles. Megawatt charging (MCS) higher than 350 kW is important for long-haul operation and delivers about 20 % of all BETs' electricity demand by 2035. In conclusion, low power depot charging is the main charging location for BETs, MCS is needed for long-haul operation.", "keywords": [ "Truck", "Depot", "Automotive engineering", "Electric cars", "Aeronautics", "Transport engineering", "Engineering", "Political science" ], "cited_by_count": 52, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2024.104078" }, { "id": "https://openalex.org/W1968611422", "doi": "10.1016/j.eswa.2010.07.130", "title": "Meta-heuristics implementation for scheduling of trucks in a cross-docking system with temporary storage", "year": 2010, "publication_date": "2010-08-07", "type": "article", "language": "en", "authors": [ "A. R. Boloori Arabani", "S.M.T. Fatemi Ghomi", "M. Zandieh" ], "first_author": "A. R. Boloori Arabani", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Heuristics", "Computer science", "Scheduling (production processes)", "Job shop scheduling", "Operations research", "Database", "Operations management", "Routing (electronic design automation)", "Automotive engineering", "Computer network", "Operating system" ], "cited_by_count": 136, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2010.07.130" }, { "id": "https://openalex.org/W3173214338", "doi": "10.1038/s41560-021-00855-0", "title": "Heavy-duty truck electrification and the impacts of depot charging on electricity distribution systems", "year": 2021, "publication_date": "2021-06-21", "type": "article", "language": "en", "authors": [ "Brennan Borlaug", "Matteo Muratori", "Madeline Gilleran", "David Woody", "William E. Muston", "Thomas Canada", "Andrew John Ingram", "Hal Gresham", "Charlie McQueen" ], "first_author": "Brennan Borlaug", "venue": "Nature Energy", "publisher": "Nature Portfolio", "abstract": null, "keywords": [ "Electrification", "Truck", "Heavy duty", "Electricity", "Automotive engineering", "Engineering", "Environmental science", "Heavy load", "Transport engineering", "Electrical engineering" ], "cited_by_count": 213, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1038/s41560-021-00855-0" }, { "id": "https://openalex.org/W2796035444", "doi": "10.1016/j.trc.2018.03.025", "title": "Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming", "year": 2018, "publication_date": "2018-04-03", "type": "article", "language": "en", "authors": [ "Andy Ham" ], "first_author": "Andy Ham", "venue": "Transportation Research Part C Emerging Technologies", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Pickup", "Travelling salesman problem", "Scheduling (production processes)", "Truck", "Computer science", "Hook", "Trailer", "Job shop scheduling", "Operations research", "Depot", "Real-time computing" ], "cited_by_count": 331, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trc.2018.03.025" }, { "id": "https://openalex.org/W2079395973", "doi": "10.1016/j.tre.2009.12.011", "title": "Scheduling trucks in cross-docking systems: A robust meta-heuristics approach", "year": 2010, "publication_date": "2010-01-22", "type": "article", "language": "en", "authors": [ "Roya Soltani", "Seyed Jafar Sadjadi" ], "first_author": "Roya Soltani", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Heuristics", "Computer science", "Truck", "Simulated annealing", "Taguchi methods", "Mathematical optimization", "Job shop scheduling", "Robustness (evolution)", "Scheduling (production processes)", "Algorithm", "Engineering", "Machine learning" ], "cited_by_count": 104, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2009.12.011" }, { "id": "https://openalex.org/W2053434094", "doi": "10.1016/j.tre.2012.06.007", "title": "Cost-stable truck scheduling at a cross-dock facility with unknown truck arrivals: A meta-heuristic approach", "year": 2012, "publication_date": "2012-08-10", "type": "article", "language": "en", "authors": [ "Dinçer Konur", "Mihalis Golias" ], "first_author": "Dinçer Konur", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Scheduling (production processes)", "Computer science", "Job shop scheduling", "Doors", "Mathematical optimization", "DOCK", "Schedule", "Pareto principle", "Operations research", "Engineering", "Automotive engineering" ], "cited_by_count": 104, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2012.06.007" }, { "id": "https://openalex.org/W3136709650", "doi": "10.1016/j.cie.2021.107240", "title": "Truck scheduling optimization at a cold-chain cross-docking terminal with product perishability considerations", "year": 2021, "publication_date": "2021-03-18", "type": "article", "language": "en", "authors": [ "Oluwatosin Theophilus", "Maxim A. Dulebenets", "Junayed Pasha", "Yui‐yip Lau", "Amir M. Fathollahi‐Fard", "Arash Mazaheri" ], "first_author": "Oluwatosin Theophilus", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Perishability", "Supply chain", "Truck", "Metaheuristic", "Computer science", "Scheduling (production processes)", "Supply chain management", "Mathematical optimization", "Operations research", "Reliability engineering", "Engineering", "Automotive engineering" ], "cited_by_count": 111, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2021.107240" }, { "id": "https://openalex.org/W2032631099", "doi": "10.1016/j.ijpe.2012.03.037", "title": "Simultaneous dock assignment and sequencing of inbound trucks under a fixed outbound truck schedule in multi-door cross docking operations", "year": 2012, "publication_date": "2012-04-08", "type": "article", "language": "en", "authors": [ "T. Warren Liao", "Pius J. Egbelu", "Pei‐Chann Chang" ], "first_author": "T. Warren Liao", "venue": "International Journal of Production Economics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Metaheuristic", "Tardiness", "Ant colony optimization algorithms", "Differential evolution", "Tabu search", "Computer science", "Mathematical optimization", "Schedule", "Parallel metaheuristic", "Simulated annealing", "Truck", "Job shop scheduling" ], "cited_by_count": 113, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ijpe.2012.03.037" }, { "id": "https://openalex.org/W2002979872", "doi": "10.1016/j.cie.2013.05.009", "title": "Analysis of different approaches to cross-dock truck scheduling with truck arrival time uncertainty", "year": 2013, "publication_date": "2013-05-22", "type": "article", "language": "en", "authors": [ "Dinçer Konur", "Mihalis Golias" ], "first_author": "Dinçer Konur", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Arrival time", "Scheduling (production processes)", "Computer science", "Job shop scheduling", "DOCK", "Operations research", "Mathematical optimization", "Engineering", "Transport engineering", "Mathematics", "Routing (electronic design automation)" ], "cited_by_count": 75, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2013.05.009" }, { "id": "https://openalex.org/W2269899627", "doi": "10.1016/j.omega.2015.09.006", "title": "Cross-docking operations: Current research versus industry practice", "year": 2015, "publication_date": "2015-10-05", "type": "article", "language": "en", "authors": [ "Anne-Laure Ladier", "Gülgün Alpan" ], "first_author": "Anne-Laure Ladier", "venue": "Omega", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Docking (animal)", "Computer science", "Sorting", "Order (exchange)", "Operations research", "Engineering", "Operations management", "Business", "Algorithm", "Automotive engineering" ], "cited_by_count": 189, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.omega.2015.09.006" }, { "id": "https://openalex.org/W1972715364", "doi": "10.1016/j.eswa.2013.04.019", "title": "Optimizing truck sequencing and truck dock assignment in a cross docking system", "year": 2013, "publication_date": "2013-04-26", "type": "article", "language": "en", "authors": [ "Yiyo Kuo" ], "first_author": "Yiyo Kuo", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Computer science", "Job shop scheduling", "DOCK", "Simulated annealing", "Mathematical optimization", "Operations research", "Computer network", "Algorithm", "Automotive engineering", "Engineering", "Routing (electronic design automation)" ], "cited_by_count": 60, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2013.04.019" }, { "id": "https://openalex.org/W2002664985", "doi": "10.1007/s00291-012-0311-6", "title": "Truck scheduling in cross-docking terminals with fixed outbound departures", "year": 2012, "publication_date": "2012-12-05", "type": "article", "language": "en", "authors": [ "Nils Boysen", "Dirk Briskorn", "Martin Tschöke" ], "first_author": "Nils Boysen", "venue": "OR Spectrum", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Heuristics", "Computer science", "Scheduling (production processes)", "Operations research", "Job shop scheduling", "Profit (economics)", "DOCK", "Mathematical optimization", "Computer network", "Mathematics", "Automotive engineering" ], "cited_by_count": 68, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00291-012-0311-6" }, { "id": "https://openalex.org/W2917710824", "doi": "10.1016/j.ijpe.2019.02.017", "title": "A Delayed Start Parallel Evolutionary Algorithm for just-in-time truck scheduling at a cross-docking facility", "year": 2019, "publication_date": "2019-02-27", "type": "article", "language": "en", "authors": [ "Maxim A. Dulebenets" ], "first_author": "Maxim A. Dulebenets", "venue": "International Journal of Production Economics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Perishability", "Computer science", "Truck", "Supply chain", "Mathematical optimization", "Metaheuristic", "Integer programming", "Scheduling (production processes)", "Supply chain management", "Operations research", "Evolutionary algorithm", "Algorithm" ], "cited_by_count": 96, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ijpe.2019.02.017" }, { "id": "https://openalex.org/W2082670167", "doi": "10.1016/j.tre.2009.04.012", "title": "A reactive tabu search algorithm for the multi-depot container truck transportation problem", "year": 2009, "publication_date": "2009-05-25", "type": "article", "language": "en", "authors": [ "Ruiyou Zhang", "Won Young Yun", "Ilkyeong Moon" ], "first_author": "Ruiyou Zhang", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Tabu search", "Travelling salesman problem", "Mathematical optimization", "Container (type theory)", "Computer science", "Truck", "Vehicle routing problem", "Transportation theory", "Mathematics", "Engineering", "Routing (electronic design automation)" ], "cited_by_count": 117, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2009.04.012" }, { "id": "https://openalex.org/W2335249059", "doi": "10.1016/j.cie.2016.03.023", "title": "A bi-objective truck scheduling problem in a cross-docking center with probability of breakdown for trucks", "year": 2016, "publication_date": "2016-04-03", "type": "article", "language": "en", "authors": [ "Alireza Amini", "Reza R. Tavakkoli-Moghaddam" ], "first_author": "Alireza Amini", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Heuristics", "Scheduling (production processes)", "Simulated annealing", "Mathematical optimization", "Computer science", "Distribution center", "Job shop scheduling", "Engineering", "Mathematics", "Schedule", "Automotive engineering" ], "cited_by_count": 57, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2016.03.023" }, { "id": "https://openalex.org/W2018949435", "doi": "10.1353/tech.2001.0128", "title": "Technologies in Tension: Horses, Electric Trucks, and the Motorization of American Cities, 1900-1925", "year": 2001, "publication_date": "2001-07-01", "type": "article", "language": "en", "authors": [ "Gijs Mom", "David A. Kirsch" ], "first_author": "Gijs Mom", "venue": "Technology and Culture", "publisher": "Johns Hopkins University Press", "abstract": "and the outbreak of the Second World War, many urban, transportationdependent organizations used combinations of different technologies.Well into the 1920s, thousands of electric trucks provided valuable, reliable service in urban delivery and service vehicle fleets.This article traces the history of the electric truck in U.S. cities during the first quarter of the twentieth century.Although internal combustion had emerged as the leading technology in the passenger car market by 1905, the market for commercial vehicles was much slower to adopt a single technological standard.Private firms in urban areas did gradually accept the passing of the horse, tentatively at first but with growing enthusiasm, and many chose electric trucks to replace their fleets of horse-drawn vehicles.The long Indian summer of the electric truck, in David Sicilia's phrase, thus presents a paradox for traditional interpretations of the history of the motor vehicle industry.If the electric vehicle was an inherently inferior technology, doomed to failure by the iron laws of lead and acid, why did so many successful, progressive, profitable companies-such as Commonwealth Edison, in many respects the flagship electric utility of the United States in the first third of the twentieth century-continue to purchase and use them through the 1920s?Did these organizations simply bet on the wrong horse, as automotive historian John Rae proposed in explaining the failure of an early electric taxicab company?Or does the success of the electric truck offer a window into the complex evolutionary process by which trucks gradually displaced horses? 2 2. For most of this century, historians of the Automobile Age have focused on the passenger automobile, relegating the commercial vehicle to secondary status.The limited literature on the truck includes: Louis Rodriguez, \"The Development of the Truck: A Constructivist History\" (Ph.D. diss, Lehigh University, 1997); Robert Alan Raburn, \"Motor Freight and Urban Morphogenesis with Reference to California and the West\" (Ph.D. diss., University of California, Berkeley, 1988); John Montville, \"Wheels for Commerce: A History of American Motor Trucks,\" in The American Car Since 1775, ed.L. Scott Bailey (New York, 1971); Robert F. Karolevitz, This Was Trucking: A Pictorial History of the First Quarter Century of Commercial Motor Vehicles (Seattle, Wash., 1966).On the presumed inferiority of the electric vehicle, James J. Flink typified a view held by many scholars when he described \"the inherently superior technological feasibility of the internalcombustion engine for the motorcar at that time\"; America Adopts the Automobile, 1895-1910 (Cambridge, Mass., 1970), 307.Also see: James Rood Doolittle, The Romance of the Automobile Industry (New York, 1916); James J. Flink, The Automobile Age (Cambridge, Mass., 1993), 10; John B. Rae, The American Automobile: A Brief History (Chicago, 1965), 12-13; James M. Laux, The European Automobile Industry (New York, 1992), 13.Virginia Scharff has implicitly depicted the electric alternative as an inferior technology: see Taking the Wheel: Women and the Coming of the Motor Age (New York, 1991), 35-50; \"Gender, Electricity, and Automobility,\" in The Car and the City: The Automobile, the Built Environment and Daily Urban Life, ed.Martin Wachs and Margaret Crawford (Ann Arbor, Mich., 1992); and \"Putting Wheels on Women's Sphere,\" in Technology and Women's Voices: Keeping in Touch, ed.Cheris Kramarae (New York, 1988).Urban historian Clay McShane has taken a similar line; see Down the Asphalt Path: The Automobile and the American City (New York, 1994), 110.For a dissenting view, see Michael B. Schiffer, Taking", "keywords": [ "Truck", "Commonwealth", "Service (business)", "Transport engineering", "Engineering", "Gasoline", "Business", "Automotive engineering", "Marketing", "Political science", "Waste management", "Law" ], "cited_by_count": 59, "is_retracted": false, "is_paratext": false, "open_access_url": "https://muse.jhu.edu/article/33781/pdf" }, { "id": "https://openalex.org/W2755027181", "doi": "10.1016/j.ijpe.2017.09.008", "title": "Scheduling of truck arrivals, truck departures and shop-floor operation in a cross-dock platform, based on trucks loading plans", "year": 2017, "publication_date": "2017-09-14", "type": "article", "language": "en", "authors": [ "Christian Serrano", "Xavier Delorme", "Alexandre B. Dolgui" ], "first_author": "Christian Serrano", "venue": "International Journal of Production Economics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Computer science", "Supply chain", "Integer programming", "Operations research", "Scheduling (production processes)", "Schedule", "Automotive industry", "Supply chain management", "Transport engineering", "Operations management", "Business" ], "cited_by_count": 63, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ijpe.2017.09.008" }, { "id": "https://openalex.org/W2979194434", "doi": "10.1016/j.cie.2019.106103", "title": "Novel modifications of social engineering optimizer to solve a truck scheduling problem in a cross-docking system", "year": 2019, "publication_date": "2019-09-30", "type": "article", "language": "en", "authors": [ "Amir M. Fathollahi‐Fard", "Mehdi Ranjbar‐Bourani", "Naoufel Cheikhrouhou", "Mostafa Hajiaghaei–Keshteli" ], "first_author": "Amir M. Fathollahi‐Fard", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Scheduling (production processes)", "Taguchi methods", "Job shop scheduling", "Computer science", "Mathematical optimization", "Optimization problem", "Industrial engineering", "Engineering", "Schedule", "Algorithm", "Machine learning" ], "cited_by_count": 85, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2019.106103" }, { "id": "https://openalex.org/W1981647350", "doi": "10.1016/j.trpro.2014.11.027", "title": "Does a Mobile Depot Make Urban Deliveries Faster, More Sustainable and More Economically Viable: Results of a Pilot Test in Brussels", "year": 2014, "publication_date": "2014-01-01", "type": "article", "language": "en", "authors": [ "Sara Verlinde", "Cathy Macharis", "Lauriane Milan", "Bram Kin" ], "first_author": "Sara Verlinde", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "A Mobile Depot (MD) is a trailer fitted with a loading dock, warehousing facilities and an office. The trailer is used as a mobile inner city base from where last-mile deliveries and first-mile pick-ups are done with electrically supported cyclocargos. In the morning and evening it is used to transport shipments from and to a peripheral depot. The MD was developed by TNT Express as a response to the challenging urban working conditions: narrow streets, mixed traffic, traffic congestion, congestion charging, environmental zones, etc. TNT Express tested this innovative concept in Brussels for a period of three months in 2013 as part of the European FP7 project STRAIGHTSOL. Regular TNT Express deliveries and pick-ups in Brussels are carried out from the TNT depot at the Brussels freight airport using diesel trucks for pallets and using diesel vans for parcels and documents. During the trial period, the parcels and documents destined for a part of the inner city were delivered and picked up through the MD. This new way of working resulted in a decrease of the number of diesel kilometres from 1.34 km per stop in the Business-As-Usual scenario to 0.52 km per stop in the Mobile-Depot scenario. This decrease can be linked to a positive environmental impact with, for example, 24% less emission of CO2 and up to 59% less emission of PM2.5. TNT Express was able to successfully integrate the MD in their operations. Service levels dropped slightly mainly due to the additional time needed to load the cyclocargos. However, none of the TNT customers complained about the quality of service. For TNT, delivering through the MD was twice as expensive as before. However, they feel it is possible to further decrease the operational costs by using the MD at its full capacity (the MD was only used at 40% of its full capacity) and by further refining the handling. A multi-actor multi-criteria analysis (MAMCA) of the MD concept revealed under which conditions it would become a more profitable concept to TNT Express: internalised external costs, higher capacity use and higher drop density. The MAMCA also revealed that the benefits are mostly for the other stakeholders, especially society.", "keywords": [ "Truck", "Depot", "Transport engineering", "Traffic congestion", "Diesel fuel", "Environmental science", "Operations management", "Engineering", "Geography", "Waste management", "Automotive engineering" ], "cited_by_count": 115, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S235214651400310X/pdf" }, { "id": "https://openalex.org/W2172504812", "doi": "10.1287/trsc.2015.0612", "title": "Scheduling Trucks in a Cross-Dock with Mixed Service Mode Dock Doors", "year": 2015, "publication_date": "2015-10-14", "type": "article", "language": "en", "authors": [ "Péter Bodnár", "René B.M. de Koster", "Kaveh Azadeh" ], "first_author": "Péter Bodnár", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "The problem considered in this paper is how to schedule inbound and outbound trucks subject to time windows at a multidoor cross-dock. Dock doors can either be dedicated to inbound or outbound trucks or be capable of handling both truck types. In addition, loads are allowed to be temporarily buffered to bridge the time between load arrival and departure. We minimize operational costs consisting of the cost of handling loads in temporary storage, as well as the cost of tardiness caused by processing outbound trucks after their respective due times. A mathematical model is derived and an adaptive large neighborhood search heuristic is proposed to compute near-optimal solutions of real size instances. Computational experiments show that the proposed heuristic algorithm can obtain high-quality solutions within short computation times. We apply the model to cross-dock scheduling and design problems of four warehouses of a large retailer and show that substantially smaller cross-docks can be used by using dock-doors flexibly and properly scheduling the trucks.", "keywords": [ "DOCK", "Truck", "Doors", "Tardiness", "Scheduling (production processes)", "Computer science", "Computation", "Schedule", "Job shop scheduling", "Operations research", "Engineering", "Automotive engineering" ], "cited_by_count": 60, "is_retracted": false, "is_paratext": false, "open_access_url": "https://pure.eur.nl/en/publications/003d28a0-0096-437c-80c5-bcd0fb3dc5c5" }, { "id": "https://openalex.org/W2069046213", "doi": "10.1007/s00170-010-2676-5", "title": "An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems", "year": 2010, "publication_date": "2010-06-23", "type": "article", "language": "en", "authors": [ "S. Forouharfard", "M. Zandieh" ], "first_author": "S. Forouharfard", "venue": "The International Journal of Advanced Manufacturing Technology", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Schedule", "Computer science", "Genetic algorithm", "Scheduling (production processes)", "DOCK", "Operations research", "Engineering", "Operations management", "Automotive engineering", "Machine learning" ], "cited_by_count": 66, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00170-010-2676-5" }, { "id": "https://openalex.org/W2560599551", "doi": "10.1016/j.eswa.2016.12.014", "title": "Drone shipping versus truck delivery in a cross-docking system with multiple fleets and products", "year": 2016, "publication_date": "2016-12-09", "type": "article", "language": "en", "authors": [ "Madjid Tavana", "Kaveh Khalili‐Damghani", "Francisco J. Santos‐Arteaga", "Mohammad Hossein Zandi" ], "first_author": "Madjid Tavana", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Truck", "Mathematical optimization", "Robustness (evolution)", "Scheduling (production processes)", "Job shop scheduling", "Integer programming", "Pareto principle", "Drone", "Operations research", "Algorithm", "Mathematics" ], "cited_by_count": 73, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S095741741630687X?via=ihub" }, { "id": "https://openalex.org/W2904126199", "doi": "10.1016/j.jclepro.2018.12.106", "title": "Assignment and scheduling trucks in cross-docking system with energy consumption consideration and trucks queuing", "year": 2018, "publication_date": "2018-12-17", "type": "article", "language": "en", "authors": [ "Shayan Shahram fard", "Behnam Vahdani" ], "first_author": "Shayan Shahram fard", "venue": "Journal of Cleaner Production", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Doors", "Queue", "Queueing theory", "Scheduling (production processes)", "DOCK", "Energy consumption", "Computer science", "Operations research", "Transport engineering", "Engineering", "Operations management" ], "cited_by_count": 51, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.jclepro.2018.12.106" }, { "id": "https://openalex.org/W2806974714", "doi": "10.1016/j.ejor.2018.05.058", "title": "Scheduling last-mile deliveries with truck-based autonomous robots", "year": 2018, "publication_date": "2018-06-01", "type": "article", "language": "en", "authors": [ "Nils Boysen", "Stefan Schwerdfeger", "Felix Weidinger" ], "first_author": "Nils Boysen", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Robot", "Computer science", "Scheduling (production processes)", "Transport engineering", "Fleet management", "Delivery Performance", "Operations research", "Engineering", "Operations management", "Automotive engineering", "Industrial engineering" ], "cited_by_count": 293, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2018.05.058" }, { "id": "https://openalex.org/W2004527902", "doi": "10.1016/j.asoc.2012.05.023", "title": "Two hybrid differential evolution algorithms for optimal inbound and outbound truck sequencing in cross docking operations", "year": 2012, "publication_date": "2012-07-07", "type": "article", "language": "en", "authors": [ "T. Warren Liao", "Pius J. Egbelu", "Pei‐Chann Chang" ], "first_author": "T. Warren Liao", "venue": "Applied Soft Computing", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Differential evolution", "Computer science", "Job shop scheduling", "Truck", "Metaheuristic", "Algorithm", "Mathematical optimization", "Mathematics", "Engineering", "Routing (electronic design automation)", "Embedded system", "Automotive engineering" ], "cited_by_count": 80, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.asoc.2012.05.023" }, { "id": "https://openalex.org/W4308600751", "doi": "10.1016/j.eswa.2022.119228", "title": "A bi-objective green vehicle routing problem with a mixed fleet of conventional and electric trucks: Considering charging power and density of stations", "year": 2022, "publication_date": "2022-11-09", "type": "article", "language": "en", "authors": [ "Afsane Amiri", "Saman Hassanzadeh Amin", "Hossein Zolfagharinia" ], "first_author": "Afsane Amiri", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Greenhouse gas", "Computer science", "Vehicle routing problem", "Minification", "Constraint (computer-aided design)", "Routing (electronic design automation)", "Mathematical optimization", "Total cost", "Automotive engineering", "Function (biology)", "Operations research" ], "cited_by_count": 80, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2022.119228" }, { "id": "https://openalex.org/W2612075237", "doi": "10.1016/j.knosys.2017.05.006", "title": "Developing a lower bound and strong heuristics for a truck scheduling problem in a cross-docking center", "year": 2017, "publication_date": "2017-05-09", "type": "article", "language": "en", "authors": [ "Amir Golshahi-Roudbaneh", "Mostafa Hajiaghaei–Keshteli", "Mohammad Mahdi Paydar" ], "first_author": "Amir Golshahi-Roudbaneh", "venue": "Knowledge-Based Systems", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Heuristics", "Metaheuristic", "Computer science", "Scheduling (production processes)", "Truck", "Taguchi methods", "Job shop scheduling", "Mathematical optimization", "Operations research", "Algorithm", "Engineering", "Mathematics" ], "cited_by_count": 66, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.knosys.2017.05.006" }, { "id": "https://openalex.org/W2072565726", "doi": "10.1016/j.compchemeng.2015.02.003", "title": "The heterogeneous vehicle routing and truck scheduling problem in a multi-door cross-dock system", "year": 2015, "publication_date": "2015-02-16", "type": "article", "language": "en", "authors": [ "Rodolfo Dondo", "Jaime Cerdá" ], "first_author": "Rodolfo Dondo", "venue": "Computers & Chemical Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "DOCK", "Vehicle routing problem", "Scheduling (production processes)", "Integer programming", "Computer science", "Routing (electronic design automation)", "Operations research", "Engineering", "Mathematical optimization", "Computer network", "Automotive engineering" ], "cited_by_count": 65, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0098135415000460" }, { "id": "https://openalex.org/W2800396487", "doi": "10.3390/su10051333", "title": "A Diploid Evolutionary Algorithm for Sustainable Truck Scheduling at a Cross-Docking Facility", "year": 2018, "publication_date": "2018-04-25", "type": "article", "language": "en", "authors": [ "Maxim A. Dulebenets" ], "first_author": "Maxim A. Dulebenets", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Supply chains have become more time-sensitive in recent years. Delays in supply chain operations may cause significant negative externalities, including lost sales and customers. In order to facilitate the product distribution process within supply chains, reduce the associated delays, and improve sustainability of the supply chain operations, many distribution companies started implementing the cross-docking technique. One of the challenging problems in management of the cross-docking facilities is efficient scheduling of the arriving trucks. This study proposes a novel Diploid Evolutionary Algorithm for the truck scheduling problem at a cross-docking facility, which—unlike the Evolutionary Algorithms presented in the cross-docking literature to date—stores the genetic information from the parent chromosomes after performing a crossover operation. The objective of the formulated mathematical model is to minimize the total truck service cost. The conducted numerical experiments demonstrate that the optimality gap of the developed algorithm does not exceed 0.18% over the considered small size problem instances. The analysis of the realistic size problem instances indicates that deployment of the developed solution algorithm reduces the total truck handling time, the total truck waiting time, and the total truck delayed departure time on average by 6.14%, 32.61%, and 34.01%, respectively, as compared to a typical Evolutionary Algorithm. Furthermore, application of the diploidy concept decreases the total truck service cost by 18.17%.", "keywords": [ "Truck", "Scheduling (production processes)", "Supply chain", "Computer science", "Genetic algorithm", "Crossover", "Total cost", "Mathematical optimization", "Operations research", "Engineering", "Mathematics", "Business" ], "cited_by_count": 53, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/10/5/1333/pdf" }, { "id": "https://openalex.org/W4213414667", "doi": "10.1109/tvt.2022.3154146", "title": "Joint Component Sizing and Energy Management for Fuel Cell Hybrid Electric Trucks", "year": 2022, "publication_date": "2022-02-24", "type": "article", "language": "en", "authors": [ "Qian Xun", "Nikolce Murgovski", "Yujing Liu" ], "first_author": "Qian Xun", "venue": "IEEE Transactions on Vehicular Technology", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "This paper proposes a cost-effective way to design and operate fuel cell hybrid electric trucks (FCHETs) where a chance-constrained optimization is formulated. The aim of the introduced problem is to minimize a summation of component cost and operational cost with consideration of fuel cell (FC) degradation and cycle life of energy buffer. We propose to decompose the problem into two sub-problems that are solved by sequential convex programming. The delivered power satisfies a cumulative distribution function of the wheel power demand, while the truck can still traverse driving cycles with a similar speed and travel time without delivering unnecessarily high power. This allows to downsize powertrain components, including electric machine, FC and energy buffer. A case study considering different energy buffer technologies, including supercapacitor (SC), lithium-ion battery (LiB), and lithium-ion capacitor (LiC) is investigated in a set of trucking applications, i.e. urban delivery, regional delivery, construction, and long-haul. Results show that the power rating of the electric machine is drastically reduced when the delivered power is satisfied in a probabilistic sense. Moreover, the configuration with LiB as the energy buffer has the lowest expense but the truck with LiC can carry more payload.", "keywords": [ "Powertrain", "Automotive engineering", "Truck", "Energy management", "Engineering", "Sizing", "Driving cycle", "Battery (electricity)", "Supercapacitor", "Battery pack", "Electric vehicle", "Power (physics)" ], "cited_by_count": 45, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ieeexplore.ieee.org/ielx7/25/9779385/09721083.pdf" }, { "id": "https://openalex.org/W2166133547", "doi": "10.1016/j.cie.2007.10.004", "title": "Positioning of goods in a cross-docking environment", "year": 2007, "publication_date": "2007-11-20", "type": "article", "language": "en", "authors": [ "Iris F.A. Vis", "Kees Jan Roodbergen" ], "first_author": "Iris F.A. Vis", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Docking (animal)", "Computer science", "Unit load", "Supply chain", "Operations research", "Engineering", "Automotive engineering" ], "cited_by_count": 90, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0360835207002185" }, { "id": "https://openalex.org/W2083720185", "doi": "10.1016/j.cie.2010.03.002", "title": "Ant colony optimization algorithm to solve for the transportation problem of cross-docking network", "year": 2010, "publication_date": "2010-03-15", "type": "article", "language": "en", "authors": [ "Rami Musa", "Jean‐Paul Arnaout", "Hosang Jung" ], "first_author": "Rami Musa", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Ant colony optimization algorithms", "Integer programming", "Computer science", "Mathematical optimization", "Flow network", "Branch and bound", "Docking (animal)", "Algorithm", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 140, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2010.03.002" }, { "id": "https://openalex.org/W2975679500", "doi": "10.3390/su11195245", "title": "Truck Scheduling at Cross-Docking Terminals: A Follow-Up State-Of-The-Art Review", "year": 2019, "publication_date": "2019-09-25", "type": "article", "language": "en", "authors": [ "Oluwatosin Theophilus", "Maxim A. Dulebenets", "Junayed Pasha", "Olumide F. Abioye", "Masoud Kavoosi" ], "first_author": "Oluwatosin Theophilus", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Recent trends in the management of supply chains have witnessed an increasing implementation of the cross-docking strategy. The cross-docking strategy, being the one that can potentially improve supply chain operations, has received a lot of attention from researchers in recent years, especially over the last decade. Cross-docking involves the reception of inbound products, deconsolidation, sorting, consolidation, and shipping of the consolidated products to the end customers. The number of research efforts, aiming to study and improve the cross-docking operations, increases every year. While some studies discuss cross-docking as an integral part of a supply chain, other studies focus on the ways of making cross-docking terminals more efficient and propose different operations research techniques for various decision problems at cross-docking terminals. In order to identify the recent cross-docking trends, this study performs a state-of-the-art review with a particular focus on the truck scheduling problem at cross-docking terminals. A comprehensive evaluation of the reviewed studies is conducted, focusing on the major attributes of the cross-docking operations. These attributes include terminal shape considered, doors considered, door service mode considered, preemption, internal transportation mode used, temporary storage capacity, resource capacity, objectives considered, and solution methods adopted. Based on findings from the review of studies, some common issues are outlined and future research directions are proposed.", "keywords": [ "Docking (animal)", "Computer science", "Supply chain", "Scheduling (production processes)", "Operations research", "Engineering", "Operations management", "Business", "Marketing" ], "cited_by_count": 49, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/11/19/5245/pdf" }, { "id": "https://openalex.org/W3165114988", "doi": "10.1080/15568318.2021.1921888", "title": "Exploring public charging infrastructure requirements for short-haul electric trucks", "year": 2021, "publication_date": "2021-05-19", "type": "article", "language": "en", "authors": [ "Jake Whitehead", "Jake Whitehead", "Jessica Whitehead", "Jessica Whitehead", "Michael Kane", "Zuduo Zheng" ], "first_author": "Jake Whitehead", "venue": "International Journal of Sustainable Transportation", "publisher": "Taylor & Francis", "abstract": "Vehicle electrification has the potential to revolutionize transport systems globally by enabling a pathway toward lower-cost, zero-emission transport options. Heavy vehicles are poised to potentially be one of the greatest beneficiaries due to their high operating costs. Here a facility location problem approach is adopted to analyze a sample of deidentified truck trip data, providing initial insights into charging network configurations that could support a short-haul electric truck fleet using the case study of South East Queensland. The charging network scenarios include up to 10 optimally-located public sites. The results suggest that a relatively modest public charging network should be sufficient to support the majority of short-haul electric trucks operating in similar regions internationally, in line with other studies that have found that the majority of short-haul electric truck charging is likely to be carried out at depots. Additionally, in outlining limitations of this study, we highlight the need for greater cooperation between researchers, policy-makers and industry to secure access to high-resolution truck trip data to more accurately plan regional charging networks, and freight decarbonization more broadly.", "keywords": [ "Truck", "Electrification", "Transport engineering", "Public transport", "Sample (material)", "Plan (archaeology)", "Electric vehicle", "Business", "Computer science", "Engineering", "Automotive engineering", "Electricity" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/15568318.2021.1921888" }, { "id": "https://openalex.org/W2568471688", "doi": "10.1016/j.cie.2017.01.004", "title": "Truck scheduling in multi-door cross docking terminal by modified particle swarm optimization", "year": 2017, "publication_date": "2017-01-05", "type": "article", "language": "en", "authors": [ "Warisa Wisittipanich", "Piya Hengmeechai" ], "first_author": "Warisa Wisittipanich", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Particle swarm optimization", "Doors", "Job shop scheduling", "Scheduling (production processes)", "Integer programming", "Computer science", "Engineering", "Mathematical optimization", "Schedule", "Algorithm", "Automotive engineering" ], "cited_by_count": 58, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2017.01.004" }, { "id": "https://openalex.org/W2002003296", "doi": "10.1007/s00170-012-4035-1", "title": "Scheduling compound trucks in multi-door cross-docking terminals", "year": 2012, "publication_date": "2012-03-16", "type": "article", "language": "en", "authors": [ "Cheol Min Joo", "Byung Soo Kim" ], "first_author": "Cheol Min Joo", "venue": "The International Journal of Advanced Manufacturing Technology", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Job shop scheduling", "Heuristics", "Computer science", "Scheduling (production processes)", "Docking (animal)", "Mathematical optimization", "Genetic algorithm", "Engineering", "Mathematics", "Automotive engineering", "Computer network" ], "cited_by_count": 39, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00170-012-4035-1" }, { "id": "https://openalex.org/W3092434367", "doi": "10.1080/00207543.2020.1821118", "title": "Heuristic algorithms for truck scheduling of cross-docking operations in cold-chain logistics", "year": 2020, "publication_date": "2020-10-04", "type": "article", "language": "en", "authors": [ "Feifeng Zheng", "Yaxin Pang", "Yinfeng Xu", "Ming Liu" ], "first_author": "Feifeng Zheng", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "Nowadays cross-docking operations play a significant role in the cold-chain logistics. This paper addresses the cold-chain cross-docking truck scheduling problem where two types of products, i.e. refrigerated and frozen ones, demand separate trucks and storage areas with distinct temperature settings during their storage and transportation. We present a mixed-integer linear programming model with the objective of minimising the total operational costs that consist of inbound truck arrival penalties for violating contracted time windows, product delivery tardiness penalties, inventory costs and outbound truck transportation costs. Due to the strong NP-hardness of the considered problem, we solve it in two phases where the inbound truck arrival schedule and the schedule of outbound truck departure together with product processing are produced, respectively. Four heuristic algorithms are proposed to generate complete solutions of the considered two-stage problem, which are the combinations of two solution frameworks for the first stage and two methods for the second stage. Computational experiments are carried out to verify the effectiveness and efficiency of the proposed heuristic algorithms in terms of the solution quality and running time, respectively.", "keywords": [ "Tardiness", "Truck", "Cold chain", "Computer science", "Scheduling (production processes)", "Schedule", "Job shop scheduling", "Integer programming", "Heuristic", "Supply chain", "Supply chain management", "Mathematical optimization" ], "cited_by_count": 47, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2020.1821118" }, { "id": "https://openalex.org/W2092861995", "doi": "10.1007/s00170-009-2152-2", "title": "Scheduling the truck holdover recurrent dock cross-dock problem using robust meta-heuristics", "year": 2009, "publication_date": "2009-07-02", "type": "article", "language": "en", "authors": [ "Behnam Vahdani", "Roya Soltani", "M. Zandieh" ], "first_author": "Behnam Vahdani", "venue": "The International Journal of Advanced Manufacturing Technology", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "DOCK", "NP", "Job shop scheduling", "Metamodeling", "Heuristics", "Mathematical optimization", "Robustness (evolution)", "Scheduling (production processes)", "Taguchi methods", "Nondeterministic algorithm", "Computer science" ], "cited_by_count": 56, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00170-009-2152-2" }, { "id": "https://openalex.org/W2324961642", "doi": "10.1016/j.cie.2016.03.021", "title": "Differential evolution and Population-based simulated annealing for truck scheduling problem in multiple door cross-docking systems", "year": 2016, "publication_date": "2016-04-02", "type": "article", "language": "en", "authors": [ "Mohammad Taghi Assadi", "Mohsen Bagheri" ], "first_author": "Mohammad Taghi Assadi", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Tardiness", "Heuristics", "Truck", "Solver", "Transshipment (information security)", "Mathematical optimization", "Job shop scheduling", "Simulated annealing", "Computer science", "Scheduling (production processes)", "Population", "Operations research" ], "cited_by_count": 61, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2016.03.021" }, { "id": "https://openalex.org/W2943369941", "doi": "10.1016/j.ejor.2019.04.028", "title": "Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors", "year": 2019, "publication_date": "2019-04-30", "type": "article", "language": "en", "authors": [ "Arpan Rijal", "Marco Bijvank", "René B.M. de Koster" ], "first_author": "Arpan Rijal", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "DOCK", "Doors", "Truck", "Computer science", "Garbage collection", "Scheduling (production processes)", "GRASP", "Operations research", "Engineering", "Operations management", "Operating system", "Garbage" ], "cited_by_count": 61, "is_retracted": false, "is_paratext": false, "open_access_url": "https://pure.eur.nl/ws/files/212966251/Integrated_scheduling_and_assignment_of_trucks_at_unit-load_cross-dock_terminals_with_mixed_service_mode_dock_doors.pdf" }, { "id": "https://openalex.org/W2474098976", "doi": "10.1007/s10845-016-1229-7", "title": "An intelligent truck scheduling and transportation planning optimization model for product portfolio in a cross-dock", "year": 2016, "publication_date": "2016-06-22", "type": "article", "language": "en", "authors": [ "H. Khorshidian", "Mohsen Akbarpour Shirazi", "S.M.T. Fatemi Ghomi" ], "first_author": "H. Khorshidian", "venue": "Journal of Intelligent Manufacturing", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "TOPSIS", "Truck", "Scheduling (production processes)", "Computer science", "Portfolio", "Job shop scheduling", "Operations research", "Mathematical optimization", "Vehicle routing problem", "Production planning", "Engineering", "Production (economics)" ], "cited_by_count": 46, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10845-016-1229-7" }, { "id": "https://openalex.org/W2252167710", "doi": "10.1016/j.cie.2015.11.006", "title": "An improved mathematical model and a hybrid metaheuristic for truck scheduling in cross-dock problems", "year": 2015, "publication_date": "2015-11-17", "type": "article", "language": "en", "authors": [ "Maryam Keshtzari", "Bahman Naderi", "Esmaeil Mehdizadeh" ], "first_author": "Maryam Keshtzari", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Metaheuristic", "Mathematical optimization", "Simulated annealing", "Job shop scheduling", "Particle swarm optimization", "Truck", "Computer science", "Parallel metaheuristic", "Scheduling (production processes)", "Taguchi methods", "Integer programming", "Genetic algorithm" ], "cited_by_count": 42, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2015.11.006" }, { "id": "https://openalex.org/W1969384728", "doi": "10.1016/j.engappai.2010.01.013", "title": "GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots", "year": 2010, "publication_date": "2010-02-22", "type": "article", "language": "en", "authors": [ "Juan G. Villegas", "Christian Prins", "Caroline Prodhon", "Andrés L. Medaglia", "Nubia Velasco" ], "first_author": "Juan G. Villegas", "venue": "Engineering Applications of Artificial Intelligence", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Trailer", "Computer science", "Metaheuristic", "GRASP", "Vehicle routing problem", "Truck", "Orienteering", "Greedy randomized adaptive search procedure", "Set (abstract data type)", "Routing (electronic design automation)", "Local search (optimization)", "Mathematical optimization" ], "cited_by_count": 96, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.engappai.2010.01.013" }, { "id": "https://openalex.org/W2791467167", "doi": "10.1016/j.cie.2018.01.009", "title": "Truck scheduling in a cross docking systems with fixed due dates and shipment sorting", "year": 2018, "publication_date": "2018-03-01", "type": "article", "language": "en", "authors": [ "Danyar Molavi", "Amin Shahmardan", "Mohsen S. Sajadieh" ], "first_author": "Danyar Molavi", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "DOCK", "Doors", "Integer programming", "Computer science", "Scheduling (production processes)", "Sorting", "FIFO (computing and electronics)", "Mathematical optimization", "Operations research", "Engineering", "Algorithm" ], "cited_by_count": 40, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2018.01.009" }, { "id": "https://openalex.org/W1428028937", "doi": "10.1016/j.asoc.2015.07.021", "title": "Scheduling trucks in cross docking systems with temporary storage and repetitive pattern for shipping trucks", "year": 2015, "publication_date": "2015-07-30", "type": "article", "language": "en", "authors": [ "Ali Mohtashami" ], "first_author": "Ali Mohtashami", "venue": "Applied Soft Computing", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "DOCK", "Truck", "Computer science", "Scheduling (production processes)", "Product (mathematics)", "Operations research", "Transport engineering", "Automotive engineering", "Engineering", "Operations management", "Marine engineering", "Mathematics" ], "cited_by_count": 31, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.asoc.2015.07.021" }, { "id": "https://openalex.org/W4401756859", "doi": "10.3390/wevj15080379", "title": "Depot Charging Schedule Optimization for Medium- and Heavy-Duty Battery-Electric Trucks", "year": 2024, "publication_date": "2024-08-21", "type": "article", "language": "en", "authors": [ "Shuhan Song", "Yin Qiu", "Robyn Leigh Coates", "Cristina Dobbelaere", "Paige Seles" ], "first_author": "Shuhan Song", "venue": "World Electric Vehicle Journal", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Charge management, which lowers charging costs for fleets and prevents straining the electrical grid, is critical to the successful deployment of medium- and heavy-duty battery-electric trucks (MHD BETs). This study introduces an energy demand and cost management framework that optimizes depot charging for MHD BETs by combining an energy consumption machine learning model and a linear program optimization model. The framework considers key factors impacting real-world MHD BET operations, including vehicle and charger configurations, duty cycles, use cases, geographic and climate conditions, operation schedules, and utilities’ time-of-use (TOU) rates and demand charges. The framework was applied to a hypothetical fleet of 100 MHD BETs in California under three different utilities for 365 days, with results compared to unmanaged charging. The optimized charging solution avoided more than 90% of on-peak charging, reduced fleet charging peak load by 64–75%, and lowered fleet energy variable costs by 54–64%. This study concluded that the proposed charge management framework significantly reduces energy costs and peak loads for MHD BET fleets while making recommendations for fleet electrification infrastructure planning and the design of utility TOU rates and demand charges.", "keywords": [ "Truck", "Electrification", "Automotive engineering", "Battery (electricity)", "Schedule", "Computer science", "Environmental science", "Electricity", "Engineering", "Electrical engineering", "Power (physics)" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2032-6653/15/8/379/pdf?version=1724253908" }, { "id": "https://openalex.org/W2070945759", "doi": "10.1007/s10479-012-1232-0", "title": "Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost", "year": 2012, "publication_date": "2012-11-02", "type": "article", "language": "en", "authors": [ "Ruslan Sadykov" ], "first_author": "Ruslan Sadykov", "venue": "Annals of Operations Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Computer science", "Doors", "Scheduling (production processes)", "Job shop scheduling", "Terminal (telecommunication)", "Dynamic programming", "Theory of computation", "Operations research", "Mathematical optimization", "Schedule", "Algorithm" ], "cited_by_count": 39, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10479-012-1232-0" }, { "id": "https://openalex.org/W2134396859", "doi": "10.1016/j.cor.2010.10.003", "title": "Scheduling cross docking operations under full, partial and no information on inbound arrivals", "year": 2010, "publication_date": "2010-10-15", "type": "article", "language": "en", "authors": [ "Rim Larbi", "Gülgün Alpan", "Pierre Baptiste", "Bernard Penz" ], "first_author": "Rim Larbi", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Transshipment (information security)", "Computer science", "Heuristics", "Truck", "Scheduling (production processes)", "Operations research", "DOCK", "Job shop scheduling", "Mathematical optimization", "Holding cost", "Computer network", "Mathematics" ], "cited_by_count": 99, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2010.10.003" }, { "id": "https://openalex.org/W3095643177", "doi": "10.1016/j.tre.2020.102123", "title": "Two-stage conflict robust optimization models for cross-dock truck scheduling problem under uncertainty", "year": 2020, "publication_date": "2020-11-02", "type": "article", "language": "en", "authors": [ "Xi Xiang", "Liu Changchun", "Wang Yuan", "Lee Loo Hay" ], "first_author": "Xi Xiang", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Computer science", "Mathematical optimization", "Scheduling (production processes)", "Constraint (computer-aided design)", "Cluster analysis", "Job shop scheduling", "Operations research", "Engineering", "Mathematics", "Schedule", "Artificial intelligence" ], "cited_by_count": 48, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2020.102123" }, { "id": "https://openalex.org/W4412644598", "doi": "10.1016/j.tej.2025.107490", "title": "The infrastructure cost for depot charging of battery electric trucks", "year": 2025, "publication_date": "2025-07-24", "type": "article", "language": "en", "authors": [ "Guihua Wang", "Marshall R. Miller", "Lewis M. Fulton" ], "first_author": "Guihua Wang", "venue": "The Electricity Journal", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Depot", "Battery (electricity)", "Automotive engineering", "Business", "Engineering", "Transport engineering", "Environmental science", "Power (physics)" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://escholarship.org/content/qt1p49662g/qt1p49662g.pdf" }, { "id": "https://openalex.org/W157479515", "doi": "10.31274/rtd-180813-11026", "title": "Operational strategies for cross docking systems", "year": 2002, "publication_date": "2002-01-01", "type": "dissertation", "language": "en", "authors": [ "Wooyeon Yu" ], "first_author": "Wooyeon Yu", "venue": null, "publisher": null, "abstract": "Cross docking is a warehouse management concept in which items delivered to a warehouse by delivery trucks are immediately sorted out and reorganized based on customer demands and are routed and loaded into shipping trucks for delivery to customers without actually being held in inventory in the warehouse. Because accuracy in material management is required in such operations, a cross docking operation is heavily dependent on accurate flow of information. In this research, three out of thirty-two different models identified were studied. All three models assume there is one receiving dock and one shipping dock at the warehouse.;The first model studied assumes there is temporary storage at the shipping dock. In this model, both the receiving and the shipping trucks must stay at the docks until they finish their unloading or loading tasks once they come into docks. The second model assumes there is no temporary storage. However, both the receiving truck and the shipping truck can move in and out of the dock during their tasks. Therefore, it is possible for a truck to execute part of its task at the dock, moves out, waits and goes into the dock again to execute its remaining loading or unloading tasks. The third model assumes there is temporary storage and trucks can move in and out of the dock as in the second model.;In all the models studied, the objective is to find the best truck spotting sequence for both receiving and shipping trucks to minimize total operation time or maximize the system throughput. The product routing and the spotting sequences of the receiving and shipping trucks are all determined simultaneously. Mixed integer programming, branch and bound, search algorithm, complete enumeration, and heuristics were used in modeling the problems. Based on test results, the heuristics and the search algorithms produced very good solutions when compared with the optimal solutions. The solution approaches developed will provide a basis for operating more efficient cross docking warehouses. When designed and analyzed in the way undertaken in this research, warehouse operators can expect to save millions of dollars annually in their operations.", "keywords": [ "Truck", "DOCK", "Warehouse", "Transport engineering", "Engineering", "Computer science", "Operations research", "Throughput", "Operations management", "Automotive engineering", "Marine engineering", "Business" ], "cited_by_count": 49, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.31274/rtd-180813-11026" }, { "id": "https://openalex.org/W2896199785", "doi": "10.1109/access.2018.2874439", "title": "A Comprehensive Evaluation of Weak and Strong Mutation Mechanisms in Evolutionary Algorithms for Truck Scheduling at Cross-Docking Terminals", "year": 2018, "publication_date": "2018-01-01", "type": "article", "language": "en", "authors": [ "Maxim A. Dulebenets" ], "first_author": "Maxim A. Dulebenets", "venue": "IEEE Access", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "Freight transportation is important for the national economy in many countries. An efficient distribution of products within supply chains may lower the associated costs and allow setting competitive prices to increase the number of sales. Many supply chain players use the cross-docking terminals to facilitate the cargo distribution process. An effective scheduling of the arriving trucks at the cross-docking terminals is critical to ensure their timely service. A number of Evolutionary Algorithms have been developed to solve the truck scheduling problem, some of which apply strong mutation for altering solutions throughout the search process, while the rest rely on weak mutation without providing any justification for applying a specific mutation mechanism. This study performs a comprehensive comparative analysis of the strong and weak mutation mechanisms. Furthermore, a novel heuristic algorithm, which accounts for the truck service priority and the truck service order restrictions, is proposed for initializing the chromosomes and population. The truck scheduling problem at a cross-docking terminal is formulated as a mixed integer programming model, minimizing the total weighted truck service cost. An Evolutionary Algorithm is designed to solve the problem. Two categories of the Evolutionary Algorithm, one of which applies strong mutation, while the other one relies on weak mutation, are evaluated based on various performance indicators. Results demonstrate that deployment of weak mutation improves the objective function value at termination on average by 10.8% as compared with strong mutation without affecting the computational time substantially. The analysis also shows that weak mutation yields more diverse population. Moreover, the proposed heuristic for initializing the chromosomes and population outperforms the initialization mechanisms that are commonly used in the literature.", "keywords": [ "Truck", "Computer science", "Mathematical optimization", "Scheduling (production processes)", "Population", "Evolutionary algorithm", "Job shop scheduling", "Mutation", "Initialization", "Integer programming", "Docking (animal)", "Operations research" ], "cited_by_count": 48, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/access.2018.2874439" }, { "id": "https://openalex.org/W2981760986", "doi": "10.1016/j.cie.2019.106134", "title": "Truck scheduling in a multi-door cross-docking center with partial unloading – Reinforcement learning-based simulated annealing approaches", "year": 2019, "publication_date": "2019-10-24", "type": "article", "language": "en", "authors": [ "Amin Shahmardan", "Mohsen S. Sajadieh" ], "first_author": "Amin Shahmardan", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Job shop scheduling", "Simulated annealing", "Reinforcement learning", "Computer science", "Scheduling (production processes)", "Integer programming", "Mathematical optimization", "Engineering", "Artificial intelligence", "Algorithm", "Automotive engineering" ], "cited_by_count": 54, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2019.106134" }, { "id": "https://openalex.org/W2984182507", "doi": "10.1016/j.apm.2019.11.020", "title": "A truck and drones model for last-mile delivery: A mathematical model and heuristic approach", "year": 2019, "publication_date": "2019-11-18", "type": "article", "language": "en", "authors": [ "Mohammad Moshref‐Javadi", "Ahmad Hemmati", "Matthias Winkenbach" ], "first_author": "Mohammad Moshref‐Javadi", "venue": "Applied Mathematical Modelling", "publisher": "Elsevier BV", "abstract": "We present a mathematical formulation and a heuristic solution approach for the optimal planning of delivery routes in a multi-modal system combining truck and Unmanned Aerial Vehicle (UAV) operations. In this system, truck and UAV operations are synchronized, i.e., one or more UAVs travel on a truck, which serves as a mobile depot. Deliveries can be made by both UAVs and the truck. While the truck follows a multi-stop route, each UAV delivers a single shipment per dispatch. The presented optimization model minimizes the waiting time of customers in the system. The model determines the optimal allocation of customers to truck and UAVs, the optimal route sequence of the truck, and the optimal launch and reconvene locations of the UAVs along the truck route. We formulate the problem as a Mixed-Integer Linear Programming (MILP) model and conduct a bound analysis to gauge the maximum potential of the proposed system to reduce customer waiting time compared to a traditional truck-only delivery system. To be able to solve real-world problem size instances, we propose an efficient Truck and Drone Routing Algorithm (TDRA). The solution quality and computational performance of the mathematical model and the TDRA are compared together and with the truck-only model based on a variety of problem instances. Further, we apply the TDRA to a real-world case study for e-commerce delivery in São Paulo, Brazil. Our numerical results suggest significant reductions in customer waiting time to be gained from the proposed multi-modal delivery model.", "keywords": [ "Truck", "Heuristic", "Drone", "Computer science", "Integer programming", "Last mile (transportation)", "Routing (electronic design automation)", "Vehicle routing problem", "Operations research", "Real-time computing", "Transport engineering", "Engineering" ], "cited_by_count": 232, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0307904X19306936/pdf" }, { "id": "https://openalex.org/W4291736965", "doi": "10.1016/j.swevo.2022.101147", "title": "Optimization approaches for the urban delivery problem with trucks and drones", "year": 2022, "publication_date": "2022-08-10", "type": "article", "language": "en", "authors": [ "Xiaoning Zang", "Li Jiang", "Changyong Liang", "Junfeng Dong", "Wenxing Lu", "Nenad Mladenović" ], "first_author": "Xiaoning Zang", "venue": "Swarm and Evolutionary Computation", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Heuristics", "Truck", "Drone", "Computer science", "Routing (electronic design automation)", "Vehicle routing problem", "Mathematical optimization", "Integer programming", "Construct (python library)", "Operations research", "Computer network", "Mathematics" ], "cited_by_count": 28, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.swevo.2022.101147" }, { "id": "https://openalex.org/W2948861255", "doi": "10.3390/su11113127", "title": "Multi-Objective Sustainable Truck Scheduling in a Rail–Road Physical Internet Cross-Docking Hub Considering Energy Consumption", "year": 2019, "publication_date": "2019-06-03", "type": "article", "language": "en", "authors": [ "Tarik Chargui", "Abdelghani Bekrar", "Mohamed Reghioui", "Damien Trentesaux" ], "first_author": "Tarik Chargui", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "In the context of supply chain sustainability, Physical Internet (PI or π ) was presented as an innovative concept to create a global sustainable logistics system. One of the main components of the Physical Internet paradigm consists in encapsulating products in modular and standardized PI-containers able to move via PI-nodes (such as PI-hubs) using collaborative routing protocols. This study focuses on optimizing operations occurring in a Rail–Road PI-Hub cross-docking terminal. The problem consists of scheduling outbound trucks at the docks and the routing of PI-containers in the PI-sorter zone of the Rail–Road PI-Hub cross-docking terminal. The first objective is to minimize the energy consumption of the PI-conveyors used to transfer PI-containers from the train to the outbound trucks. The second objective is to minimize the cost of using outbound trucks for different destinations. The problem is formulated as a Multi-Objective Mixed-Integer Programming model (MO-MIP) and solved with CPLEX solver using Lexicographic Goal Programming. Then, two multi-objective hybrid meta-heuristics are proposed to enhance the computational time as CPLEX was time consuming, especially for large size instances: Multi-Objective Variable Neighborhood Search hybridized with Simulated Annealing (MO-VNSSA) and with a Tabu Search (MO-VNSTS). The two meta-heuristics are tested on 32 instances (27 small instances and 5 large instances). CPLEX found the optimal solutions for only 23 instances. Results show that the proposed MO-VNSSA and MO-VNSTS are able to find optimal and near optimal solutions within a reasonable computational time. The two meta-heuristics found optimal solutions for the first objective in all the instances. For the second objective, MO-VNSSA and MO-VNSTS found optimal solutions for 7 instances. In order to evaluate the results for the second objective, a one way analysis of variance ANOVA was performed.", "keywords": [ "Heuristics", "Computer science", "Truck", "Transshipment (information security)", "Solver", "Integer programming", "Modular design", "Mathematical optimization", "Vehicle routing problem", "Scheduling (production processes)", "Energy consumption", "Simulated annealing" ], "cited_by_count": 52, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/11/11/3127/pdf?version=1559557341" }, { "id": "https://openalex.org/W2209035201", "doi": "10.1016/j.cie.2015.12.005", "title": "Cross dock scheduling with fixed outbound trucks departure times under substitution condition", "year": 2015, "publication_date": "2015-12-15", "type": "article", "language": "en", "authors": [ "Sajjad Rahmanzadeh Tootkaleh", "S.M.T. Fatemi Ghomi", "Mohsen S. Sajadieh" ], "first_author": "Sajjad Rahmanzadeh Tootkaleh", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "DOCK", "Doors", "Scheduling (production processes)", "Computer science", "Heuristic", "Operations research", "Engineering", "Transport engineering", "Operations management", "Automotive engineering", "Marine engineering" ], "cited_by_count": 36, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2015.12.005" }, { "id": "https://openalex.org/W3122622378", "doi": "10.23919/aeitautomotive50086.2020.9307420", "title": "Energy-Efficient Coordinated Electric Truck-Drone Hybrid Delivery Service Planning", "year": 2020, "publication_date": "2020-11-18", "type": "conference-paper", "language": "en", "authors": [ "Donkyu Baek", "Yukai Chen", "Naehyuck Chang", "Enrico Macii", "Massimo Poncino" ], "first_author": "Donkyu Baek", "venue": null, "publisher": null, "abstract": "Recent works have shown that a coordinated delivery strategy in which a drone collaborates with a truck using it as a moving depot is quite effective in improving the performance and energy efficiency of the delivery process. As most of these works come from the research community of logistics and transportation, they are instead focused on the optimality of the algorithms, and neglect two critical issues: (1) they consider only a planar version of the problem ignoring the geographic information along the delivery route, and (2) they use a simplified battery model, truck, and drone power consumption model as they are mostly focused on optimizing delivery time alone rather than energy efficiency. In this work, we propose a greedy heuristic algorithm to deter-mine the most energy-efficient sequence of deliveries in which a drone and an EV truck collaborate in the delivery process, while accounting for the two above aspects. In our scenario, a drone delivers packages starting from the truck and returns to the truck after the delivery, while the truck continues on its route and possibly delivers other packages. Results show that, by carefully using the drone's energy along the truck delivery route, we can achieve 43-69% saving of the truck battery energy on average over a set of different delivery sets and different drone battery sizes. We also compared two \"common-sense\" heuristics, concerning which we saved up to 42%.", "keywords": [ "Truck", "Drone", "Heuristics", "Computer science", "Process (computing)", "Battery (electricity)", "Efficient energy use", "Transport engineering", "Operations research", "Power (physics)", "Automotive engineering", "Engineering" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.23919/aeitautomotive50086.2020.9307420" }, { "id": "https://openalex.org/W2904662963", "doi": "10.1016/j.omega.2018.12.004", "title": "A comparative study of formulations for a cross-dock door assignment problem", "year": 2018, "publication_date": "2018-12-06", "type": "article", "language": "en", "authors": [ "Shahin Gelareh", "Fred Glover", "Oualid Guemri", "Saïd Hanafi", "Placide Nduwayo", "Raca Todosijević" ], "first_author": "Shahin Gelareh", "venue": "Omega", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Doors", "Truck", "DOCK", "Computer science", "Integer programming", "Warehouse", "Operations research", "Engineering", "Algorithm", "Operating system", "Business" ], "cited_by_count": 57, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.omega.2018.12.004" }, { "id": "https://openalex.org/W2066983357", "doi": "10.1016/j.compchemeng.2012.09.016", "title": "A sweep-heuristic based formulation for the vehicle routing problem with cross-docking", "year": 2012, "publication_date": "2012-10-17", "type": "article", "language": "en", "authors": [ "Rodolfo Dondo", "Jaime Cerdá" ], "first_author": "Rodolfo Dondo", "venue": "Computers & Chemical Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Scheduling (production processes)", "Pickup", "Mathematical optimization", "Computer science", "Truck", "Heuristic", "DOCK", "Job shop scheduling", "Routing (electronic design automation)", "Engineering", "Automotive engineering" ], "cited_by_count": 76, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0098135412002943" }, { "id": "https://openalex.org/W4247134841", "doi": "10.1002/net.22024", "title": "A two‐tier urban delivery network with robot‐based deliveries", "year": 2021, "publication_date": "2021-02-01", "type": "article", "language": "en", "authors": [ "Iurii Bakach", "Ann Melissa Campbell", "Jan Fabian Ehmke" ], "first_author": "Iurii Bakach", "venue": "Networks", "publisher": "Wiley", "abstract": "Abstract In this article, we investigate a two‐tier delivery network with robots operating on the second tier. We determine the optimal number of local robot hubs as well as the optimal number of robots to service all customers and compare the resulting operational cost to conventional truck‐based deliveries. Based on the well‐known p ‐median problem, we present mixed‐integer programs that consider the limited range of robots due to battery size. Compared with conventional truck‐based deliveries, robot‐based deliveries can save about 70% of operational cost and even more, up to 90%, for instances with customer time windows.", "keywords": [ "Robot", "Truck", "Computer science", "Service (business)", "Operations research", "Computer network", "Real-time computing", "Artificial intelligence", "Engineering", "Business", "Automotive engineering" ], "cited_by_count": 80, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/net.22024" }, { "id": "https://openalex.org/W2115397136", "doi": "10.1007/s00291-010-0193-4", "title": "Heuristic-based truck scheduling for inland container transportation", "year": 2010, "publication_date": "2010-01-25", "type": "article", "language": "en", "authors": [ "Ruiyou Zhang", "Won Young Yun", "Herbert Kopfer" ], "first_author": "Ruiyou Zhang", "venue": "OR Spectrum", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Travelling salesman problem", "Truck", "Computer science", "Scheduling (production processes)", "Container (type theory)", "Mathematical optimization", "Computation", "Heuristic", "Pickup", "Partition (number theory)", "Operations research", "Algorithm" ], "cited_by_count": 149, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00291-010-0193-4" }, { "id": "https://openalex.org/W3122711124", "doi": "10.1109/tsmc.2020.2968839", "title": "Two-Echelon Routing Problem for Parcel Delivery by Cooperated Truck and Drone", "year": 2020, "publication_date": "2020-02-10", "type": "article", "language": "en", "authors": [ "Yao Liu", "Zhong Liu", "Jianmai Shi", "Guohua Wu", "Witold Pedrycz" ], "first_author": "Yao Liu", "venue": "IEEE Transactions on Systems Man and Cybernetics Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "A new variant of the two-echelon routing problem is investigated, where the truck and the drone are used to cooperatively complete the deliveries of all parcels. The truck not only acts as a tool for parcel delivery but also serves as a moving depot for the drone. The drone can carry several parcels and take off from the truck, while returning to the truck after completing the delivery. The energy consumption model for the routing process of the drone is analyzed, when it is utilized to deliver multiple parcels. A two-stage route-based modeling approach is proposed to optimize both the truck’s main route and the drone’s adjoint flying routes. A hybrid heuristic integrating nearest neighbor and cost saving strategies is developed to quickly construct a feasible solution. The simulated annealing algorithm is integrated with Tabu search, to improve the quality of the solution as well as the search efficiency. Random instances at different scales are used to test the performance of the proposed algorithm. A case study based on the practical road network in Changsha, China, is presented, through which the sensitivity analysis is conducted with respect to some critical factors.", "keywords": [ "Drone", "Truck", "Routing (electronic design automation)", "Vehicle routing problem", "Computer science", "Operations research", "Business", "Engineering", "Computer network", "Automotive engineering" ], "cited_by_count": 176, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tsmc.2020.2968839" }, { "id": "https://openalex.org/W2297710625", "doi": "10.1016/j.cie.2016.03.001", "title": "Time-indexed formulation and polynomial time heuristic for a multi-dock truck scheduling problem in a cross-docking centre", "year": 2016, "publication_date": "2016-03-07", "type": "article", "language": "en", "authors": [ "Priscila Mara Cota", "Bárbara M.R. Gimenez", "Dhiego P.M. Araújo", "Thiago Henrique Nogueira", "Maurício C. de Souza", "Martı́n Gómez Ravetti" ], "first_author": "Priscila Mara Cota", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Job shop scheduling", "Mathematical optimization", "Truck", "DOCK", "Scheduling (production processes)", "Integer programming", "Computer science", "Mathematics", "Engineering", "Automotive engineering" ], "cited_by_count": 41, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2016.03.001" }, { "id": "https://openalex.org/W3136167958", "doi": "10.1016/j.eswa.2021.114889", "title": "Truck to door assignment in a shared cross-dock under uncertainty", "year": 2021, "publication_date": "2021-03-18", "type": "article", "language": "en", "authors": [ "Fatma Essghaier", "Hamid Allaoui", "Gilles Gonçalves" ], "first_author": "Fatma Essghaier", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "DOCK", "Truck", "Computer science", "Automotive engineering", "Marine engineering", "Engineering" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://univ-artois.hal.science/hal-04066589" }, { "id": "https://openalex.org/W4239185876", "doi": "10.1504/ijlsm.2019.101164", "title": "Truck scheduling problems in the cross docking network", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Warisa Wisittipanich", "Takashi Irohara", "Piya Hengmeechai" ], "first_author": "Warisa Wisittipanich", "venue": "International Journal of Logistics Systems and Management", "publisher": "Inderscience Publishers", "abstract": "Cross docking is a logistic management strategy for reducing storage level, inventory management cost, and customer delivery lead-time. In the large distribution network in which products are transferred through one or more cross docks, the decision of whether to synchronise inbound and outbound trucks for the whole network is crucial since it significantly impacts on supply chain performance. This study presents the novel mathematical model of truck scheduling problem in the cross docking network consisting of several cross docks and addresses the importance of synchronising the truck schedule in a network as a whole. The model is formulated as mixed integer programming (MIP) with an objective to find the optimal truck schedule and product transshipment to minimise the makespan. The results demonstrate that simultaneously optimising truck schedule throughout the network improves the solution quality compared to those obtained from models, that optimise the truck schedule in each cross dock sequentially.", "keywords": [ "Truck", "Transshipment (information security)", "Computer science", "Job shop scheduling", "Schedule", "Integer programming", "Scheduling (production processes)", "Operations research", "Supply chain management", "Consignment", "Supply network", "Supply chain" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijlsm.2019.101164" }, { "id": "https://openalex.org/W2234820011", "doi": "10.1007/s10845-015-1160-3", "title": "Modeling truck scheduling problem at a cross-dock facility through a bi-objective bi-level optimization approach", "year": 2015, "publication_date": "2015-11-11", "type": "article", "language": "en", "authors": [ "Fateme Heidari", "Seyed Hessameddin Zegordi", "Reza R. Tavakkoli-Moghaddam" ], "first_author": "Fateme Heidari", "venue": "Journal of Intelligent Manufacturing", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Heuristics", "Scheduling (production processes)", "Job shop scheduling", "Mathematical optimization", "Computer science", "Operations research", "Engineering", "Mathematics", "Routing (electronic design automation)", "Automotive engineering" ], "cited_by_count": 39, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10845-015-1160-3" }, { "id": "https://openalex.org/W2004030670", "doi": "10.1111/poms.12321", "title": "Storing Fresh Produce for Fast Retrieval in an Automated Compact Cross‐Dock System", "year": 2014, "publication_date": "2014-12-09", "type": "article", "language": "en", "authors": [ "Nima Zaerpour", "Yugang Yu", "René B.M. de Koster" ], "first_author": "Nima Zaerpour", "venue": "Production and Operations Management", "publisher": "Wiley", "abstract": "We study temporary storage of fresh produce in a cross‐dock center. In order to minimize cooling cost, compact storage systems are used. A major disadvantage of these systems is that additional retrieval time is needed, caused by necessary reshuffles due to the improper storage sequence of unit loads. In practice therefore, a dedicated storage policy is used in which every storage lane in the system accommodates only one product. However, this policy does not use the planned arrival time information of the outbound trucks. To exploit this information, this study proposes a mathematical model for a shared storage policy that minimizes total retrieval time. The policy allows different products to share the same lane. In order to solve real‐sized problems, an effective and efficient heuristic is proposed, based on a greedy construction and an improvement part, which provides near optimal solutions. The gaps between the results of the heuristic and the lower bound are mostly less than 1%. The resulting shared storage policy is generally robust against disturbances in arrival or departure times. We compare our shared storage heuristic with dedicated storage to determine which policy performs best under which circumstances. For most practical cases, shared storage appears to outperform dedicated storage, with a shorter response time and better storage lane utilization.", "keywords": [ "Computer science", "Heuristic", "Truck", "Computer data storage", "Order (exchange)", "Exploit", "Real-time computing", "Operations research", "Operating system", "Engineering", "Computer security", "Automotive engineering" ], "cited_by_count": 75, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1111/poms.12321" }, { "id": "https://openalex.org/W3202538394", "doi": "10.1016/j.eswa.2021.115986", "title": "A predictive-reactive cross-dock rescheduling system under truck arrival uncertainty", "year": 2021, "publication_date": "2021-10-07", "type": "article", "language": "en", "authors": [ "Mohammad Mahdi Nasiri", "Naeime Ahmadi", "Dinçer Konur", "Ali Rahbari" ], "first_author": "Mohammad Mahdi Nasiri", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "DOCK", "Schedule", "Computer science", "Scheduling (production processes)", "Operations research", "Job shop scheduling", "Operations management", "Engineering", "Automotive engineering" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2021.115986" }, { "id": "https://openalex.org/W2900595178", "doi": "10.1016/j.ejor.2018.11.033", "title": "A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem", "year": 2018, "publication_date": "2018-11-15", "type": "article", "language": "en", "authors": [ "Gabriela B. Fonseca", "Thiago Henrique Nogueira", "Martı́n Gómez Ravetti" ], "first_author": "Gabriela B. Fonseca", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Job shop scheduling", "Transshipment (information security)", "Heuristics", "Computer science", "Mathematical optimization", "Truck", "Flow shop scheduling", "Metaheuristic", "Scheduling (production processes)", "Lagrangian relaxation", "Algorithm", "Mathematics" ], "cited_by_count": 58, "is_retracted": false, "is_paratext": false, "open_access_url": "https://arxiv.org/pdf/1702.05603" }, { "id": "https://openalex.org/W1969628620", "doi": "10.1080/18128602.2010.523029", "title": "On the comparative performance of urban delivery vehicle classes", "year": 2011, "publication_date": "2011-03-30", "type": "article", "language": "en", "authors": [ "José Holguín‐Veras", "Coral A. Torres Cruz", "Xuegang Jeff Ban" ], "first_author": "José Holguín‐Veras", "venue": "Transportmetrica A Transport Science", "publisher": "Taylor & Francis", "abstract": "As it is widely known, a large truck generates more pollution and congestion than a small truck, which is an obvious consequence of its larger size. However, it is frequently overlooked that they have very different cargo productivities, and that large trucks require less trips to transport the same amount of cargo than small trucks. As a result, large trucks could produce less social costs than small trucks, as long as they generate proportionally less traffic. The objective is to identify the conditions under which large trucks are the most beneficial in terms of social costs. To gain insight into the nature of these tradeoffs, a mathematical formulation was developed to express social costs as a function of a multimodal vector of traffic flows. The key insight gained is that large trucks could indeed be better in terms of social costs if they replace a sufficient number of small trucks.", "keywords": [ "Truck", "Transport engineering", "TRIPS architecture", "Social cost", "Traffic congestion", "Computer science", "Business", "Engineering", "Automotive engineering", "Economics", "Microeconomics" ], "cited_by_count": 51, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/18128602.2010.523029" }, { "id": "https://openalex.org/W2471136576", "doi": "10.1016/j.cie.2016.07.003", "title": "Robust cross-dock scheduling with time windows", "year": 2016, "publication_date": "2016-07-08", "type": "article", "language": "en", "authors": [ "Anne-Laure Ladier", "Gülgün Alpan" ], "first_author": "Anne-Laure Ladier", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Computer science", "Minification", "Job shop scheduling", "Mathematical optimization", "Scheduling (production processes)", "Heuristics", "Schedule", "Operations research", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 41, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2016.07.003" }, { "id": "https://openalex.org/W3013287619", "doi": "10.1016/j.omega.2020.102255", "title": "A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing time", "year": 2020, "publication_date": "2020-03-29", "type": "article", "language": "en", "authors": [ "Manlio Gaudioso", "Maria Flavia Monaco", "Marcello Sammarra" ], "first_author": "Manlio Gaudioso", "venue": "Omega", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Heuristics", "Truck", "Mathematical optimization", "Scheduling (production processes)", "Computer science", "Job shop scheduling", "Transshipment (information security)", "Schedule", "Mathematics", "Engineering" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.omega.2020.102255" }, { "id": "https://openalex.org/W2784102161", "doi": "10.1049/iet-its.2017.0227", "title": "En route truck–drone parcel delivery for optimal vehicle routing strategies", "year": 2018, "publication_date": "2018-01-12", "type": "article", "language": "en", "authors": [ "Mario Marinelli", "Leonardo Caggiani", "Michele Ottomanelli", "Mauro Dell’Orco" ], "first_author": "Mario Marinelli", "venue": "IET Intelligent Transport Systems", "publisher": "Institution of Engineering and Technology", "abstract": "Recently, several prominent logistic companies in Europe and the USA are seriously considering the idea of using drones launched from trucks and working in parallel to deliver packages. In the relevant literature, a novel problem formulation called travelling salesman problem with drone has been introduced, and some modelling and solution approaches have been presented. Existing approaches are based on the main assumption that the truck can dispatch and pick up a drone only at a node, i.e. the depot or a customer location. Here, the authors present a novel approach aimed to maximise the drone usage in parcel delivering. The authors consider that a truck can deliver and pick a drone up not only at a node but also along a route arc ( en route ). In this way, the operations of a drone are not strictly related to the customers’ position, but it can serve a wider area along the route. The authors tested the proposed heuristic on benchmark instances and analysed the benefits introduced with the en route approach.", "keywords": [ "Drone", "Truck", "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "Transport engineering", "Automotive engineering", "Engineering", "Computer network" ], "cited_by_count": 161, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1049/iet-its.2017.0227" }, { "id": "https://openalex.org/W2802712100", "doi": "10.1080/00207543.2018.1464678", "title": "Cross-docking truck scheduling with product unloading/loading constraints based on an improved particle swarm optimisation algorithm", "year": 2018, "publication_date": "2018-04-25", "type": "article", "language": "en", "authors": [ "Yan Ye", "Jingfeng Li", "Kaibin Li", "Hui Fu" ], "first_author": "Yan Ye", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "Cross-docking is a very useful logistics technique that can substantially reduce distribution costs and improve customer satisfaction. A key problem in its success is truck scheduling, namely, decision on assignment and docking sequence of inbound/outbound trucks to receiving/shipping dock doors. This paper focuses on the problem with the requirement of unloading/loading products in a given order, which is very common in many industries, but is less concerned by existing researches. An integer programming model is established to minimise the makespan. An improved particle swarm optimisation (ωc-PSO) algorithm is proposed for solving it. In the algorithm, a cosine decreasing strategy of inertia weight is designed to dynamically balance global and local search. A repair strategy is put forward for continuous search in the feasible solution space and a crossover strategy is presented to prevent the algorithm from falling into local optimum. After algorithm parameters are tuned using Taguchi method, computational experiments are conducted on different problem scales to evaluate ωc-PSO against genetic algorithm, basic PSO and GLNPSO. The results show that ωc-PSO outperforms other three algorithms, especially when the number of dock doors, trucks and product types is great. Statistical tests show that the performance difference is statistically significant.", "keywords": [ "Particle swarm optimization", "Job shop scheduling", "Mathematical optimization", "Truck", "Crossover", "Doors", "GRASP", "Taguchi methods", "Genetic algorithm", "Algorithm", "Scheduling (production processes)", "Computer science" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2018.1464678" }, { "id": "https://openalex.org/W2896753652", "doi": "10.1016/j.adhoc.2018.10.018", "title": "Cruisers: An automotive sensing platform for smart cities using door-to-door garbage collecting trucks", "year": 2018, "publication_date": "2018-10-18", "type": "article", "language": "en", "authors": [ "Yin Chen", "Jin Nakazawa", "Takuro Yonezawa", "Hideyuki Tokuda" ], "first_author": "Yin Chen", "venue": "Ad Hoc Networks", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Garbage", "Truck", "Automotive industry", "Scalability", "Computer science", "Garbage collection", "Smart city", "Server", "Transport engineering", "Computer security", "Database", "Computer network" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.adhoc.2018.10.018" }, { "id": "https://openalex.org/W2616179957", "doi": "10.1016/j.measurement.2017.05.027", "title": "A customized genetic algorithm for solving multi-period cross-dock truck scheduling problems", "year": 2017, "publication_date": "2017-05-15", "type": "article", "language": "en", "authors": [ "Kaveh Khalili‐Damghani", "Madjid Tavana", "Francisco J. Santos‐Arteaga", "Mahdokht Ghanbarzad-Dashti" ], "first_author": "Kaveh Khalili‐Damghani", "venue": "Measurement", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Branch and bound", "Scheduling (production processes)", "DOCK", "Integer programming", "Genetic algorithm", "Mathematical optimization", "Computer science", "Schedule", "Job shop scheduling", "Algorithm", "Engineering" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0263224117303056?via=ihub" }, { "id": "https://openalex.org/W2121327115", "doi": "10.1016/j.cie.2010.09.010", "title": "Heuristic solutions for transshipment problems in a multiple door cross docking warehouse", "year": 2010, "publication_date": "2010-09-20", "type": "article", "language": "en", "authors": [ "Gülgün Alpan", "Anne-Laure Ladier", "Rim Larbi", "Bernard Penz" ], "first_author": "Gülgün Alpan", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Transshipment (information security)", "Heuristics", "Warehouse", "Operations research", "Computer science", "Scheduling (production processes)", "Schedule", "Transport engineering", "Operations management", "Engineering", "Automotive engineering" ], "cited_by_count": 50, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2010.09.010" }, { "id": "https://openalex.org/W2086399386", "doi": "10.1016/j.ejor.2012.02.007", "title": "Heuristics for the multi-depot petrol station replenishment problem with time windows", "year": 2012, "publication_date": "2012-02-18", "type": "article", "language": "en", "authors": [ "Fabien Cornillier", "Fayez Fouad Boctor", "Jacques Renaud" ], "first_author": "Fabien Cornillier", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "TRIPS architecture", "Truck", "Heuristics", "Computer science", "Operations research", "Heuristic", "Set (abstract data type)", "Depot", "Revenue", "Vehicle routing problem", "Mathematical optimization", "Schedule" ], "cited_by_count": 110, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2012.02.007" }, { "id": "https://openalex.org/W2135605168", "doi": "10.1287/trsc.2014.0571", "title": "A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots", "year": 2015, "publication_date": "2015-04-01", "type": "article", "language": "en", "authors": [ "José-Manuel Belenguer", "Enrique Benavent", "Antonio Martínez-Sykora", "Christian Prins", "Caroline Prodhon", "Juan G. Villegas" ], "first_author": "José-Manuel Belenguer", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "In the single truck and trailer routing problem with satellite depots (STTRPSD), a truck with a detachable trailer based at a main depot must serve the demand of a set of customers accessible only by truck. Therefore, before serving the customers, it is necessary to detach the trailer in an appropriate parking place (called either a satellite depot or a trailer point) and transfer goods between the truck and the trailer. This problem has applications in milk collection for farms that cannot be reached using large vehicles. In this work we present an integer programming formulation of the STTRPSD. This formulation is tightened with several families of valid inequalities for which we have developed different (exact and heuristic) separation procedures. Using these elements, we have implemented a branch-and-cut algorithm for the solution of the STTRPSD. A computational experiment with published instances shows that the proposed branch-and-cut algorithm consistently solves problems with up to 50 customers and 10 satellite depots, and it has also been able to solve instances with up to 20 satellite depots and 100 clustered customers.", "keywords": [ "Trailer", "Truck", "Routing (electronic design automation)", "Heuristic", "Computer science", "Satellite", "Integer programming", "Algorithm", "Point (geometry)", "Integer (computer science)", "Set (abstract data type)", "Operations research" ], "cited_by_count": 35, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.2014.0571" }, { "id": "https://openalex.org/W2009776330", "doi": "10.1016/j.cie.2014.05.009", "title": "Multiple cross-docks scheduling using two meta-heuristic algorithms", "year": 2014, "publication_date": "2014-05-22", "type": "article", "language": "en", "authors": [ "Mansooreh Madani-Isfahani", "Reza R. Tavakkoli-Moghaddam", "Bahman Naderi" ], "first_author": "Mansooreh Madani-Isfahani", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Heuristics", "Computer science", "Job shop scheduling", "Scheduling (production processes)", "Integer programming", "Firefly algorithm", "Firefly protocol", "Mathematical optimization", "Algorithm", "Real-time computing", "Engineering" ], "cited_by_count": 49, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2014.05.009" }, { "id": "https://openalex.org/W2149029357", "doi": "10.1016/j.asoc.2014.02.026", "title": "A comparison of five hybrid metaheuristic algorithms for unrelated parallel-machine scheduling and inbound trucks sequencing in multi-door cross docking systems", "year": 2014, "publication_date": "2014-03-25", "type": "article", "language": "en", "authors": [ "T. Warren Liao", "Pei‐Chann Chang", "R.J. Kuo", "Ching‐Jong Liao" ], "first_author": "T. Warren Liao", "venue": "Applied Soft Computing", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Simulated annealing", "Metaheuristic", "Job shop scheduling", "Computer science", "Tabu search", "Ant colony optimization algorithms", "Algorithm", "Scheduling (production processes)", "Mathematical optimization", "Schedule", "Mathematics" ], "cited_by_count": 39, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.asoc.2014.02.026" }, { "id": "https://openalex.org/W2007943264", "doi": "10.4018/jisscm.2012010102", "title": "Scheduling of Inbound Trucks at a Cross-Docking Facility", "year": 2012, "publication_date": "2012-01-01", "type": "article", "language": "en", "authors": [ "Mihalis Golias", "Georgios K. D. Saharidis", "Maria Boilé", "Sotirios Theofanis" ], "first_author": "Mihalis Golias", "venue": "International Journal of Information Systems and Supply Chain Management", "publisher": "IGI Global", "abstract": "This paper examines the problem of scheduling of inbound trucks to the inbound doors at a cross-docking facility. The authors optimize for two conflicting objectives: minimize the total service time for all the inbound trucks and minimize the delayed completion of service for a subset of the inbound trucks, which are considered as preferential customers. The problem is formulated as a bi-objective and as a bi-level mixed integer problem. Due to the nature of the former and the complexity of the latter formulation, a genetic algorithm and a k-th best based algorithm are proposed as the solution approaches. Computational examples are used to discuss the advantages and drawbacks of each formulation.", "keywords": [ "Truck", "Doors", "Computer science", "Scheduling (production processes)", "Mathematical optimization", "Integer programming", "Operations research", "Genetic algorithm", "Engineering", "Mathematics", "Algorithm", "Operating system" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.4018/jisscm.2012010102" }, { "id": "https://openalex.org/W4214713636", "doi": "10.1080/19427867.2022.2044581", "title": "Optimisation of the electric truck route for milk collection problem: a real case study", "year": 2022, "publication_date": "2022-02-25", "type": "article", "language": "en", "authors": [ "Mehmet Erdem" ], "first_author": "Mehmet Erdem", "venue": "Transportation Letters", "publisher": "Taylor & Francis", "abstract": "This study dwells upon the electric milk collection problem. The problem extends electric vehicle routing problem with time windows, considering multi-depot, multi-product, split deliveries, multi-compartment, fast chargers and fleet composition. The problem aims to create an effective routing decision-making system for electric trucks in transporting milk of different quality from producers (or milk collection points) in different locations to the factories. The objective of the electric milk collection problem is to minimize the sum of the total energy costs of electric trucks. We develop an adaptive general variable neighborhood search algorithm that involves several procedures having been tailored to handle specific features of the problem. We perform extensive computational experiments on real-life data to investigate the performance of the heuristics and offer particular insight. The results indicate that our algorithm successfully solves small- and large-scale instances in terms of solution quality and computational time. Our results also quantify the benefits of using fast charger types and fleet composition on the total energy costs.", "keywords": [ "Truck", "Heuristics", "Vehicle routing problem", "Computer science", "Quality (philosophy)", "Routing (electronic design automation)", "Mathematical optimization", "Operations research", "Automotive engineering", "Engineering", "Mathematics", "Embedded system" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/19427867.2022.2044581" }, { "id": "https://openalex.org/W4391602430", "doi": "10.3390/wevj15020056", "title": "Flexibility Potential of Smart Charging Electric Trucks and Buses", "year": 2024, "publication_date": "2024-02-07", "type": "article", "language": "en", "authors": [ "Christian Will", "Fabian Ocker" ], "first_author": "Christian Will", "venue": "World Electric Vehicle Journal", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "In addition to passenger vehicles, battery-electric trucks and buses could offer substantial flexibility to the energy system. Using a Bass diffusion model, we extrapolated the unidirectional charging needs and availability of trucks in five of eleven typical applications, as well as city buses, for Germany until 2040. Combined, these heavy-duty vehicles could provide up to 23 GW of down-regulating flexibility potential (i.e., in case of excess power supply) in 2040. The resulting revenues could contribute to reducing electricity costs for depot operators. These results illustrate the need to provide easy and automated market access to heavy-duty vehicle fleets.", "keywords": [ "Truck", "Flexibility (engineering)", "Automotive engineering", "Engineering", "Economics" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2032-6653/15/2/56/pdf?version=1707301349" }, { "id": "https://openalex.org/W2789147130", "doi": "10.1007/s00291-018-0510-x", "title": "Truck synchronization at single door cross-docking terminals", "year": 2018, "publication_date": "2018-02-16", "type": "article", "language": "en", "authors": [ "Antonino Chiarello", "Manlio Gaudioso", "Marcello Sammarra" ], "first_author": "Antonino Chiarello", "venue": "OR Spectrum", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Lagrangian relaxation", "Synchronizing", "Mathematical optimization", "Computer science", "Solver", "Heuristic", "Truck", "Benchmark (surveying)", "Job shop scheduling", "Lagrangian", "Integer programming", "Heuristics" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00291-018-0510-x" }, { "id": "https://openalex.org/W17671468", "doi": "10.1007/978-3-642-24264-9_8", "title": "The Pickup and Delivery Problem with Cross-Docking Opportunity", "year": 2011, "publication_date": "2011-01-01", "type": "conference-paper", "language": "en", "authors": [ "Hanne Løhmann Petersen", "Stefan Røpke" ], "first_author": "Hanne Løhmann Petersen", "venue": "Lecture notes in computer science", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Computer science", "Pickup", "Docking (animal)", "Distributed computing", "Mathematical optimization", "Artificial intelligence", "Mathematics" ], "cited_by_count": 36, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-642-24264-9_8" }, { "id": "https://openalex.org/W2526927162", "doi": null, "title": "The truck scheduling problem at cross-docking terminals", "year": 2012, "publication_date": "2012-04-01", "type": "conference-paper", "language": "en", "authors": [ "Lotte Berghman", "Cyril Briand", "Roel Leus", "Pierre Lòpez" ], "first_author": "Lotte Berghman", "venue": "HAL (Le Centre pour la Communication Scientifique Directe)", "publisher": "Centre National de la Recherche Scientifique", "abstract": "International audience", "keywords": [ "Truck", "Computer science", "DOCK", "Job shop scheduling", "Scheduling (production processes)", "Linear programming", "Mathematical optimization", "Branch and bound", "Docking (animal)", "Algorithm", "Computer network", "Engineering" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hal.science/hal-00661318" }, { "id": "https://openalex.org/W2004021175", "doi": "10.4018/ijisscm.2013070102", "title": "Advances in Truck Scheduling at a Cross Dock Facility", "year": 2013, "publication_date": "2013-07-01", "type": "article", "language": "en", "authors": [ "Mihalis Golias", "Georgios K. D. Saharidis", "Stephanie S. Ivey", "Hercules E. Haralambides" ], "first_author": "Mihalis Golias", "venue": "International Journal of Information Systems and Supply Chain Management", "publisher": "IGI Global", "abstract": "In this paper the authors deal with the scheduling of inbound and outbound trucks to the available inbound and outbound doors at a cross dock facility. They assume that all trucks served at the facility need to meet several deadlines for deliveries and pick-ups and thus request a departure time window from the facility, penalizing the facility operator, on a unit of time basis, if that deadline is not met. To solve the resulting problem with reasonable computational effort, a memetic algorithm is developed and a number of computational examples show the efficiency of the proposed solution algorithm and the advantages of scheduling inbound and outbound trucks simultaneously, as opposed to sequentially.", "keywords": [ "Truck", "Doors", "Computer science", "DOCK", "Scheduling (production processes)", "Operations research", "Operations management", "Engineering", "Operating system", "Automotive engineering" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.4018/ijisscm.2013070102" }, { "id": "https://openalex.org/W2741865369", "doi": "10.1016/j.cie.2017.07.031", "title": "Two-layer simulated annealing and tabu search heuristics for a vehicle routing problem with cross docks and split deliveries", "year": 2017, "publication_date": "2017-07-29", "type": "article", "language": "en", "authors": [ "Junling Wang", "Arun Kumar Ranganathan Jagannathan", "Xingquan Zuo", "Chase C. Murray" ], "first_author": "Junling Wang", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Tabu search", "Vehicle routing problem", "Truck", "Simulated annealing", "Heuristics", "Mathematical optimization", "Computer science", "Integer programming", "Routing (electronic design automation)", "Constructive", "Metaheuristic", "Operations research" ], "cited_by_count": 70, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2017.07.031" }, { "id": "https://openalex.org/W2090186145", "doi": "10.1016/j.ejor.2013.04.042", "title": "A truck scheduling problem arising in intermodal container transportation", "year": 2013, "publication_date": "2013-04-30", "type": "article", "language": "en", "authors": [ "Jenny Nossack", "Erwin Pesch" ], "first_author": "Jenny Nossack", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Container (type theory)", "Scheduling (production processes)", "Transportation theory", "Computer science", "Job shop scheduling", "Operations research", "Transport engineering", "Heuristic", "Homogeneous", "Pickup", "Automotive engineering" ], "cited_by_count": 103, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2013.04.042" }, { "id": "https://openalex.org/W1998635913", "doi": "10.3141/2162-02", "title": "Scheduling of Inbound and Outbound Trucks at Cross-Docks", "year": 2010, "publication_date": "2010-01-01", "type": "article", "language": "en", "authors": [ "Ti Zhang", "Georgios K. D. Saharidis", "Sotirios Theofanis", "Maria Boilé" ], "first_author": "Ti Zhang", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "A model is developed for both time and space scheduling of inbound and outbound trucks at a cross-dock facility under various objectives. Three different objectives in optimizing cross-dock operations are presented, and the justification for the use of these objectives is given. A linear mixed integer formulation of the problem is presented, and a restriction–approximation approach is developed and applied to determine the truck scheduling at a sample cross-dock facility. This paper also analyzes the behavior of each of the objectives and provides a comprehensive analysis of the results. Pareto and post-Pareto analyses of the multiobjective problem are presented.", "keywords": [ "Truck", "DOCK", "Scheduling (production processes)", "Operations research", "Integer programming", "Pareto principle", "Computer science", "Multi-objective optimization", "Transport engineering", "Mathematical optimization", "Engineering", "Operations management" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/2162-02" }, { "id": "https://openalex.org/W3019304728", "doi": "10.1007/s11750-020-00556-z", "title": "Integrated cross-dock door assignment and truck scheduling with handling times", "year": 2020, "publication_date": "2020-04-20", "type": "article", "language": "en", "authors": [ "Sayed Ibrahim Sayed", "Ivan Contreras", "Juan A. Dı́az", "Dolores E. Luna" ], "first_author": "Sayed Ibrahim Sayed", "venue": "Top", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "DOCK", "Doors", "Computer science", "Scheduling (production processes)", "Metaheuristic", "Job shop scheduling", "Material handling", "Operations research", "Mathematical optimization", "Engineering", "Automotive engineering" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s11750-020-00556-z" }, { "id": "https://openalex.org/W2938450770", "doi": "10.1016/j.ejor.2019.04.024", "title": "Integrated truck and workforce scheduling to accelerate the unloading of trucks", "year": 2019, "publication_date": "2019-04-20", "type": "article", "language": "en", "authors": [ "Giorgi Tadumadze", "Nils Boysen", "Simon Emde", "Felix Weidinger" ], "first_author": "Giorgi Tadumadze", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Pallet", "Punctuality", "Scheduling (production processes)", "Computer science", "Heuristics", "Fleet management", "Operations research", "Workforce", "Transport engineering", "Operations management", "Engineering" ], "cited_by_count": 53, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2019.04.024" }, { "id": "https://openalex.org/W2136621681", "doi": "10.5267/j.ijiec.2012.08.001", "title": "Scheduling trucks in cross docking systems with temporary storage and dock repeat truck holding pattern using GRASP method", "year": 2012, "publication_date": "2012-08-22", "type": "article", "language": "en", "authors": [ "Ehsan Ghobadian", "Reza R. Tavakkoli-Moghaddam", "Hassan Javanshir", "Mahdi Naderi-Beni" ], "first_author": "Ehsan Ghobadian", "venue": "International Journal of Industrial Engineering Computations", "publisher": "Growing Science", "abstract": "Cross docking play an important role in management of supply chains where items delivered to a warehouse by inbound trucks are directly sorted out, reorganized based on customer demands, routed and loaded into outbound trucks for delivery to customers without virtually keeping them at the warehouse.If any item is held in storage, it is usually for a short time, which is normally less than 24 hours.The proposed model of this paper considers a special case of cross docking where there is temporary storage and uses GRASP technique to solve the resulted problem for some realistic test problems.In our method, we first use some heuristics as initial solutions and then improve the final solution using GRASP method.The preliminary test results indicate that the GRASP method performs better than alternative solution strategies.", "keywords": [ "DOCK", "Truck", "GRASP", "Scheduling (production processes)", "Docking (animal)", "Engineering", "Computer science", "Automotive engineering", "Operations management", "Marine engineering" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5267/j.ijiec.2012.08.001" }, { "id": "https://openalex.org/W3112854449", "doi": "10.1080/00207543.2020.1853843", "title": "Scheduling trucks and storage operations in a multiple-door cross-docking terminal considering multiple storage zones", "year": 2020, "publication_date": "2020-12-08", "type": "article", "language": "en", "authors": [ "Tarik Chargui", "Abdelghani Bekrar", "Mohamed Reghioui", "Damien Trentesaux" ], "first_author": "Tarik Chargui", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "Cross-docking is a logistics process in which products are unloaded through receiving docks and then transferred to shipping docks with almost no storage in between. In this paper, a mixed integer linear programming model (MILP) is proposed to optimise the scheduling, storage, assignment and sequencing of trucks at receiving and shipping docks for a problem inspired from a multiple-door cross-dock facility of an industrial partner with multiple temporary storage zones. The multiple storage zones are separated and located in the centre of the cross-dock handling different types of products. The objective is to minimise the total tardiness of inbound and outbound trucks. A heuristic (H) is proposed to find an initial solution. Then, three meta-heuristics are developed, namely Random Search (RS), Tabu Search (TS) and Simulated Annealing (SA) to improve the scheduling of trucks in order to minimise the tardiness of inbound and outbound trucks. Experimental results indicate that the three meta-heuristics (RS, TS and SA) are able to find good quality results within reasonable computational times. Finally, since SA showed the best performance compared to RS and TS, it was chosen to be compared to the current manual method using discrete event simulation.", "keywords": [ "Tardiness", "Truck", "Tabu search", "Heuristics", "Scheduling (production processes)", "Computer science", "Integer programming", "Job shop scheduling", "Order picking", "Simulated annealing", "Material handling", "Mathematical optimization" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2020.1853843" }, { "id": "https://openalex.org/W1991966388", "doi": "10.1007/s10845-013-0860-9", "title": "A constraint programming model for the scheduling of JIT cross-docking systems with preemption", "year": 2014, "publication_date": "2014-01-10", "type": "article", "language": "en", "authors": [ "M.H. Fazel Zarandi", "H. Khorshidian", "Mohsen Akbarpour Shirazi" ], "first_author": "M.H. Fazel Zarandi", "venue": "Journal of Intelligent Manufacturing", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Tardiness", "Preemption", "Mathematical optimization", "Integer programming", "Computer science", "Scheduling (production processes)", "Job shop scheduling", "DOCK", "Constraint programming", "Constraint satisfaction", "Constraint satisfaction problem", "Engineering" ], "cited_by_count": 47, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10845-013-0860-9" }, { "id": "https://openalex.org/W4220894234", "doi": "10.1016/j.ejor.2022.02.028", "title": "A mixed truck and robot delivery approach for the daily supply of customers", "year": 2022, "publication_date": "2022-02-18", "type": "article", "language": "en", "authors": [ "Andreas Heimfarth", "Manuel Ostermeier", "Alexander Hübner" ], "first_author": "Andreas Heimfarth", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Robot", "Computer science", "Business", "Operations research", "Automotive engineering", "Engineering", "Artificial intelligence" ], "cited_by_count": 84, "is_retracted": false, "is_paratext": false, "open_access_url": "https://opus.bibliothek.uni-augsburg.de/opus4/files/97519/97519.pdf" }, { "id": "https://openalex.org/W1521381557", "doi": "10.1080/21693277.2014.955217", "title": "Cross-docking truck scheduling with the arrival times for inbound trucks and the learning effect for unloading/loading processes", "year": 2014, "publication_date": "2014-01-01", "type": "article", "language": "en", "authors": [ "Alireza Amini", "Reza R. Tavakkoli-Moghaddam", "Aschkan Omidvar" ], "first_author": "Alireza Amini", "venue": "Production & Manufacturing Research", "publisher": "Taylor & Francis", "abstract": "Cross-docking is a technique firstly proposed to reduce the storage space and flow time, simultaneously. This paper addresses a truck scheduling problem, in which a position-based learning effect is taken into consideration for unloading and loading tasks done by human labors in many related environments. The goal of the given problem is to minimize the mean completion time of outbound trucks. Therefore, a mathematical model is proposed inspired by an available model in the literature of this field. Furthermore, four heuristic algorithms are developed along with a simulated annealing (SA) algorithm in order to overwhelm the complexity of large-sized problems. The performance of the proposed algorithms is compared with the optimal solutions obtained by a complete enumeration method.", "keywords": [ "Truck", "Computer science", "Simulated annealing", "Scheduling (production processes)", "Job shop scheduling", "Mathematical optimization", "Learning effect", "Simulation", "Algorithm", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.tandfonline.com/doi/pdf/10.1080/21693277.2014.955217?needAccess=true" }, { "id": "https://openalex.org/W3111134957", "doi": "10.1109/icps48405.2020.9274699", "title": "An IoT solution for load monitoring and tracking of garbage-truck fleets", "year": 2020, "publication_date": "2020-06-10", "type": "conference-paper", "language": "en", "authors": [ "Jorge Maia", "Jones Yudi" ], "first_author": "Jorge Maia", "venue": null, "publisher": null, "abstract": "One of the most significant problems in the modern world is the amount of waste generated by the growing urban population. The destination of this garbage can be recycling, burning or disposal in landfills. A family of four people can produce, on average, 3 kilograms of garbage per day. The collection of this waste is mostly done by trucks that go through the streets of the cities collecting the garbage from door to door, following predetermined routes. When a truck reaches its maximum load, it goes to the unloading site, returning to the route at the same exit point in order to finish that route. The logistical problems involved are several: fines for overloading the truck, late collection times, labor lawsuits, among others. This project proposes a solution based on Internet Things to monitor the location of the truck and its cargo generating maps in near real-time, to allow the dynamic optimization of the routes followed by the various paths of the fleet. Our system consists of an on-board system that measures the truckload and determines its position, sending this data to a cloud computing solution. Several tests were carried out in the field, with pathways from a real fleet, operating on an ordinary working day. The results show that the system developed is viable, successfully meeting the requirements of the application.", "keywords": [ "Truck", "Garbage", "Garbage collection", "Computer science", "Transport engineering", "Cloud computing", "Population", "Waste collection", "Order (exchange)", "Point (geometry)", "Position (finance)", "Real-time computing" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/icps48405.2020.9274699" }, { "id": "https://openalex.org/W2960629827", "doi": "10.1016/j.ssci.2019.06.039", "title": "Management of heavy truck driver queuing and waiting for loading and unloading at road transport customers’ depots", "year": 2019, "publication_date": "2019-07-09", "type": "article", "language": "en", "authors": [ "Rena Friswell", "Ann M. Williamson" ], "first_author": "Rena Friswell", "venue": "Safety Science", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Transport engineering", "Queueing theory", "Poison control", "Engineering", "Automotive engineering", "Human factors and ergonomics", "Occupational safety and health", "Environmental science", "Computer science", "Medical emergency", "Computer network" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ssci.2019.06.039" }, { "id": "https://openalex.org/W2973621886", "doi": "10.1016/j.ifacol.2019.09.080", "title": "Optimal sizing of the EVT for a hybrid urban delivery truck", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Zetao Ma", "Alain Bouscayrol", "Walter Lhomme", "Shumei Cui" ], "first_author": "Zetao Ma", "venue": "IFAC-PapersOnLine", "publisher": "Elsevier BV", "abstract": "The objective of this paper is to find the trade-off solutions among fuel economy and machines sizes for a hybrid urban delivery truck with an electric variable transmission (EVT). To solve the optimization problem, exhaustive search is conducted over the feasible EVT set obtained by different drivability performances. Proper design parameters for each machine of the EVT are selected and defined. Dynamic programming (DP) is used to benchmark the fuel economy. To overcome the drawback of huge computation burden of the optimization process caused by DP searching, a bi-level DP method is formulated. Simulation results show that EVT truck could lead to 21% reduction of fuel consumption compared to a conventional truck. Finally, the Pareto front of the optimal sizing problem is presented.", "keywords": [ "Truck", "Sizing", "Fuel efficiency", "Benchmark (surveying)", "Mathematical optimization", "Computer science", "Multi-objective optimization", "Reduction (mathematics)", "Pareto principle", "Process (computing)", "Dynamic programming", "Automotive engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/am/pii/S2405896319307037?via%3Dihub" }, { "id": "https://openalex.org/W2747474249", "doi": "10.1007/s00291-017-0486-y", "title": "Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal", "year": 2017, "publication_date": "2017-08-28", "type": "article", "language": "en", "authors": [ "Stefan Schwerdfeger", "Nils Boysen", "Dirk Briskorn" ], "first_author": "Stefan Schwerdfeger", "venue": "OR Spectrum", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "DOCK", "Truck", "Automotive industry", "Computer science", "Scheduling (production processes)", "Operations research", "Standardization", "Operations management", "Automotive engineering", "Engineering" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00291-017-0486-y" }, { "id": "https://openalex.org/W2789047767", "doi": "10.1016/j.cor.2018.01.022", "title": "A comparison of formulations and relaxations for cross-dock door assignment problems", "year": 2018, "publication_date": "2018-02-02", "type": "article", "language": "en", "authors": [ "W. Nassief", "Ivan Contreras", "Brigitte Jaumard" ], "first_author": "W. Nassief", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Doors", "Truck", "DOCK", "Benchmark (surveying)", "Integer programming", "Computer science", "Set (abstract data type)", "Relaxation (psychology)", "Mathematical optimization", "Column generation", "Integer (computer science)", "Sensitivity (control systems)" ], "cited_by_count": 36, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2018.01.022" }, { "id": "https://openalex.org/W2922967100", "doi": "10.1016/j.ejor.2019.03.030", "title": "Probabilistic Tabu Search for the Cross-Docking Assignment Problem", "year": 2019, "publication_date": "2019-03-27", "type": "article", "language": "en", "authors": [ "Oualid Guemri", "Placide Nduwayo", "Raca Todosijević", "Saïd Hanafi", "Fred Glover" ], "first_author": "Oualid Guemri", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Heuristics", "Computer science", "Probabilistic logic", "Tabu search", "Mathematical optimization", "Assignment problem", "Truck", "Benchmark (surveying)", "Operations research", "Algorithm", "Artificial intelligence", "Engineering" ], "cited_by_count": 33, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2019.03.030" }, { "id": "https://openalex.org/W3009746304", "doi": "10.1016/j.cie.2020.106391", "title": "Parallel-machine scheduling methodology for a multi-dock truck sequencing problem in a cross-docking center", "year": 2020, "publication_date": "2020-03-09", "type": "article", "language": "en", "authors": [ "Thiago Henrique Nogueira", "Felipe Provezano Coutinho", "Rafael Pereira Ribeiro", "Martı́n Gómez Ravetti" ], "first_author": "Thiago Henrique Nogueira", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": "Cross-docking is a logistics procedure aiming at minimizing the storage and picking operations of a warehouse. It consists of unloading cargos from trucks and immediately load them into outbound trucks, with limited or no storage in between. An efficient transshipment operation is a critical factor in this strategy. Hence, we study the multi-dock truck sequencing problem in a cross-docking center with the objective of minimizing the makespan. We explore the parallel machine scenario instead of the traditional flow shop setting and propose a polynomial parallel machine based heuristic that outperforms time-indexed mathematical formulation and state-of-the-art heuristics for small, moderate, and large size instances. Our results suggest that the consideration of a parallel machine environment could bring a new light in modeling the truck sequence in a cross-docking facility, opening new research directions in the field.", "keywords": [ "DOCK", "Truck", "Heuristics", "Job shop scheduling", "Computer science", "Scheduling (production processes)", "Transshipment (information security)", "Docking (animal)", "Engineering", "Mathematical optimization", "Operations research", "Automotive engineering" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2020.106391" }, { "id": "https://openalex.org/W2904358268", "doi": "10.5829/ije.2018.31.08b.14", "title": "New Approaches in Metaheuristics to Solve the Truck Scheduling Problem in a Cross-docking Center", "year": 2018, "publication_date": "2018-08-01", "type": "article", "language": "en", "authors": [], "first_author": null, "venue": "International Journal of Engineering", "publisher": "Materials and Energy Research Center", "abstract": "Nowadays, cross-docking is one of the main concepts in supply chain management in which products received to a distribution center by inbound trucks which are directly to lead into outbound trucks with a minimum handling and storage costs as the main cost of a cross-docking system. According to the literature, several metaheuristics and heuristics are attempted to solve this optimization model. In this regard, this study utilizes three recent nature-inspired metaheuristics among the first studies in this area. Red Deer Algorithm (RDA), Virus Colony Search (VCS) and Water Wave Optimization (WWO) are three novel nature-inspired algorithms proposed recently to employ their applications in engineering problems. The used algorithm’s parameters were selected by Taguchi method to enhance the efficiency of algorithms. The outputs of the proposed algorithms are assessed with each other in different criteria along with statistical analyses and the results yielded by prior works. The results demonstrate that RDA showed a competitive performance compared with mixed other existing algorithms.", "keywords": [ "Metaheuristic", "Truck", "Docking (animal)", "Scheduling (production processes)", "Computer science", "Job shop scheduling", "Center (category theory)", "Mathematical optimization", "Operations research", "Engineering", "Mathematics", "Artificial intelligence" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5829/ije.2018.31.08b.14" }, { "id": "https://openalex.org/W2013161291", "doi": "10.1016/j.ijpe.2011.10.016", "title": "Scheduling for inland container truck and train transportation", "year": 2011, "publication_date": "2011-11-11", "type": "article", "language": "en", "authors": [ "Wen Fei Wang", "Won Young Yun" ], "first_author": "Wen Fei Wang", "venue": "International Journal of Production Economics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Container (type theory)", "Truck", "Computer science", "Tabu search", "Scheduling (production processes)", "Containerization", "Transport engineering", "Operations research", "Mathematical optimization", "Automotive engineering", "Engineering", "Mathematics" ], "cited_by_count": 75, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ijpe.2011.10.016" }, { "id": "https://openalex.org/W2127040570", "doi": "10.1007/s00170-011-3402-7", "title": "A cross-docking scheduling problem with sub-population multi-objective algorithms", "year": 2011, "publication_date": "2011-06-27", "type": "article", "language": "en", "authors": [ "Alireza Boloori Arabani", "M. Zandieh", "S.M.T. Fatemi Ghomi" ], "first_author": "Alireza Boloori Arabani", "venue": "The International Journal of Advanced Manufacturing Technology", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Job shop scheduling", "Particle swarm optimization", "Minification", "Mathematical optimization", "Population", "Scheduling (production processes)", "Algorithm", "Differential evolution", "Computer science", "Evolutionary algorithm", "Mathematics", "Schedule" ], "cited_by_count": 38, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00170-011-3402-7" }, { "id": "https://openalex.org/W2261144659", "doi": "10.1016/j.trc.2016.01.002", "title": "Classifying the purpose of stopped truck events: An application of entropy to GPS data", "year": 2016, "publication_date": "2016-02-02", "type": "article", "language": "en", "authors": [ "Kevin Gingerich", "Hanna F. Maoh", "William S. Anderson" ], "first_author": "Kevin Gingerich", "venue": "Transportation Research Part C Emerging Technologies", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Global Positioning System", "Entropy (arrow of time)", "Categorization", "Dwell time", "Transport engineering", "Computer science", "Engineering", "Automotive engineering", "Telecommunications", "Artificial intelligence" ], "cited_by_count": 102, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trc.2016.01.002" }, { "id": "https://openalex.org/W2950678017", "doi": "10.1108/ec-08-2018-0355", "title": "A truck scheduling problem at a cross-docking facility with mixed service mode dock doors", "year": 2019, "publication_date": "2019-06-11", "type": "article", "language": "en", "authors": [ "Behnam Vahdani", "Shayan Shahramfard" ], "first_author": "Behnam Vahdani", "venue": "Engineering Computations", "publisher": "Emerald Publishing Limited", "abstract": "Purpose The purpose of this study is truck scheduling and assignment of trucks to the doors simultaneously since these issues were considered mainly separately in the previous research. Also, the door service time and its impact on truck scheduling were not taken into account, so this research endeavors to cover this gap. Design/methodology/approach In this research, a novel model has been presented for simultaneous truck scheduling and assignment problem with time window constraints for the arrival and departure of trucks, mixed service mode dock doors and truck queuing. To resolve the developed model, two meta-heuristic algorithms, namely, genetic and imperialist competitive algorithms, are presented. Findings The computational results indicate that the proposed framework leads to increased total costs, although it has a more accurate planning; moreover, these indicate that the proposed algorithms have different performances based on the criteria considered for the comparison. Research limitations/implications There are some limitations in this research, which can be considered by other researchers to expand the current study, among them the specifications of uncertainty about arrival times of inbound and outbound trucks, number of merchandises which has been loaded on inbound trucks are the main factors. If so, by considering this situation, a realistic scheme about planning of cross docking system would be acquired. Moreover, the capacity of temporary storage has been considered unlimited, so relaxing this limitation can prepare a real and suitable situation for further study. Examining the capacity in the front of each type of doors of cross-dock and executive servers are the other aspects, which could be expanded in the future. Originality/value In this study, a mathematical programing model proposed for truck scheduling to minimize total costs including holding, truck tardiness and waiting time for queue of trucks caused by the interference of each carrier’s movement. At the operational levels, this research considered a multi-door cross-docking problem with mixed service mode dock doors and time window constraints for arrival and departure time of trucks. Moreover, M/G/C queue system was developed for truck arrival and servicing of carriers to trucks.", "keywords": [ "Doors", "Truck", "DOCK", "Queueing theory", "Scheduling (production processes)", "Operations research", "Computer science", "Queue", "Engineering", "Transport engineering", "Operations management", "Computer network" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/ec-08-2018-0355" }, { "id": "https://openalex.org/W2085286667", "doi": "10.1016/j.asoc.2015.02.030", "title": "A novel multi-objective meta-heuristic model for solving cross-docking scheduling problems", "year": 2015, "publication_date": "2015-02-28", "type": "article", "language": "en", "authors": [ "Ali Mohtashami", "Madjid Tavana", "Francisco J. Santos‐Arteaga", "Ali Fallahian-Najafabadi" ], "first_author": "Ali Mohtashami", "venue": "Applied Soft Computing", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "DOCK", "Mathematical optimization", "Truck", "Scheduling (production processes)", "Sorting", "Particle swarm optimization", "Genetic algorithm", "Supply chain", "Algorithm", "Engineering", "Mathematics" ], "cited_by_count": 45, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.asoc.2015.02.030" }, { "id": "https://openalex.org/W3124767471", "doi": "10.1016/j.cor.2007.12.012", "title": "A hybrid method based on linear programming and tabu search for routing of logging trucks", "year": 2008, "publication_date": "2008-01-02", "type": "article", "language": "en", "authors": [ "Patrik Flisberg", "Bertil Lidén", "Mikael Rönnqvist" ], "first_author": "Patrik Flisberg", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Tabu search", "Vehicle routing problem", "Truck", "Routing (electronic design automation)", "Pickup", "Computer science", "Mathematical optimization", "Linear programming", "Set (abstract data type)", "Operations research", "Transport engineering", "Engineering" ], "cited_by_count": 82, "is_retracted": false, "is_paratext": false, "open_access_url": "https://openaccess.nhh.no/nhh-xmlui/bitstream/11250/163861/1/1407.pdf" }, { "id": "https://openalex.org/W4361286064", "doi": "10.1016/j.ejor.2023.03.031", "title": "The multi-vehicle truck-and-robot routing problem for last-mile delivery", "year": 2023, "publication_date": "2023-03-29", "type": "article", "language": "en", "authors": [ "Manuel Ostermeier", "Andreas Heimfarth", "Alexander Hübner" ], "first_author": "Manuel Ostermeier", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Vehicle routing problem", "Robot", "Routing (electronic design automation)", "Computer science", "Delivery Performance", "Transport engineering", "Cluster analysis", "Heuristic", "Operations research", "Engineering", "Computer network" ], "cited_by_count": 69, "is_retracted": false, "is_paratext": false, "open_access_url": "https://opus.bibliothek.uni-augsburg.de/opus4/files/103374/103374.pdf" }, { "id": "https://openalex.org/W1967691781", "doi": "10.1080/10798587.2015.1014620", "title": "A Model and Metaheuristic for Truck Scheduling in Multi-door Cross-dock Problems", "year": 2015, "publication_date": "2015-02-23", "type": "article", "language": "en", "authors": [ "Mehdi Yazdani", "Bahman Naderi", "M. Mousakhani" ], "first_author": "Mehdi Yazdani", "venue": "Intelligent Automation & Soft Computing", "publisher": "Taylor & Francis", "abstract": "The cross-docking is a warehousing strategy where trucks arrive from suppliers to unload, regroup, and reload their items onto trucks going to the customers. There is a common assumption that the receiving (shipping) dock has only one single door, but companies usually duplicate doors in parallel to expedite operations. This paper studies the problem of scheduling trucks in the cross-dock with multiple inbound and outbound doors with makespan minimization. The problem is first formulated by a new mixed integer programming model. Using the model, small instances are solved to optimality. The paper then proposes a hunting search metaheuristic inspired from group behavior of animals when searching and hunting for food. A set of experimental instances are carried out to evaluate the algorithm. The algorithm is carefully evaluated against the adaptation of two existing algorithms. The results show that the algorithm provides sound performance comparing with other algorithms.", "keywords": [ "Computer science", "Truck", "Metaheuristic", "DOCK", "Scheduling (production processes)", "Operations research", "Mathematical optimization", "Artificial intelligence", "Automotive engineering", "Marine engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/10798587.2015.1014620" }, { "id": "https://openalex.org/W3086889218", "doi": "10.1016/j.cie.2020.106832", "title": "A new bi-objective vehicle routing-scheduling problem with cross-docking: Mathematical model and algorithms", "year": 2020, "publication_date": "2020-09-11", "type": "article", "language": "en", "authors": [ "Asefeh Hasani Goodarzi", "Reza R. Tavakkoli-Moghaddam", "Alireza Amini" ], "first_author": "Asefeh Hasani Goodarzi", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Tardiness", "Mathematical optimization", "Vehicle routing problem", "Sorting", "Computer science", "Integer programming", "Scheduling (production processes)", "Genetic algorithm", "Job shop scheduling", "Multi-objective optimization", "Pareto principle", "Algorithm" ], "cited_by_count": 50, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2020.106832" }, { "id": "https://openalex.org/W4388714956", "doi": "10.1016/j.trc.2023.104407", "title": "Multi-trucks-and-drones cooperative pickup and delivery problem", "year": 2023, "publication_date": "2023-11-15", "type": "article", "language": "en", "authors": [ "Jiajing Gao", "Lu Zhen", "Shuaian Wang" ], "first_author": "Jiajing Gao", "venue": "Transportation Research Part C Emerging Technologies", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Drone", "Pickup", "Column generation", "Computer science", "Integer programming", "Context (archaeology)", "Vehicle routing problem", "Scheduling (production processes)", "Frame (networking)", "Linear programming", "Mathematical optimization" ], "cited_by_count": 79, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10397/107810" }, { "id": "https://openalex.org/W2006608603", "doi": "10.1080/00207543.2014.1003664", "title": "A mixed-integer programming formulation and Lagrangean relaxation for the cross-dock door assignment problem", "year": 2015, "publication_date": "2015-02-02", "type": "article", "language": "en", "authors": [ "W. Nassief", "Ivan Contreras", "Rami As’ad" ], "first_author": "W. Nassief", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "In a cross-dock, goods are unloaded from incoming trucks, consolidated according to their destinations, and then, loaded into outgoing trucks with little or no storage in between. In this paper, we study the cross-dock door assignment problem in which the assignment of incoming trucks to strip doors, and outgoing trucks to stack doors is determined, with the objective of minimising the total material handling cost. We present a new mixed integer programming formulation which is embedded into a Lagrangean relaxation that exploits the special structure of the problem to obtain bounds on the optimal solution value. A primal heuristic is used at every iteration of the Lagrangean relaxation to obtain high quality feasible solutions. Computational results obtained on benchmark instances (with up to 20 origins and destinations, and 10 strip and stack doors) and on a new and more difficult set of instances (with up to 50 origins and destinations, and 30 strip and stack doors) confirm the efficiency of the algorithm.", "keywords": [ "DOCK", "Integer programming", "Mathematical optimization", "Integer (computer science)", "Relaxation (psychology)", "Computer science", "Linear programming relaxation", "Mathematics", "Operations research", "Engineering", "Programming language" ], "cited_by_count": 41, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2014.1003664" }, { "id": "https://openalex.org/W3177468475", "doi": "10.1155/2021/5592122", "title": "Truck Scheduling for Cross-Docking of Fresh Produce with Repeated Loading", "year": 2021, "publication_date": "2021-06-21", "type": "article", "language": "en", "authors": [ "Fei Pan", "Tijun Fan", "Xinyi Qi", "Jingyi Ann Chen", "Chong Zhang" ], "first_author": "Fei Pan", "venue": "Mathematical Problems in Engineering", "publisher": "Hindawi Publishing Corporation", "abstract": "Due to mismanagement of supply chain operations, fresh produce, which deteriorates highly depending on time and operating environment (including temperature and humidity), will suffer huge losses in transit, resulting in substantial monetary losses. Cross-docking, as an efficient logistics operation strategy, has been widely used in fresh produce distribution in the cold supply chain, whereas it has not received adequate attention in the scientific literature. In order to improve the efficiency of fresh produce distribution, this study formulates a novel mixed-integer mathematical formulation model that allows repeated loading of outbound trucks to minimize the total deterioration (TD) of all the fresh produce in the cross-docking center. To solve this problem, an advanced genetic algorithm is proposed based on a constructional mixed chromosome with two parts and three levels. The numerical analyses are conducted on 10 typical instances under different combinations of parameters. Results show that our proposed model based on the repeated loading mode can effectively decrease the total deterioration compared with the traditional nonrepeated loading mode. And this superiority becomes more significant, as the value of truck changeover time and lot loading quantity (called lot size in the text) decrease. In particular, when the truck changeover time equals 0, the total deterioration obtained under repeated loading mode will be more than 31.8% on average smaller than that under nonrepeated loading mode.", "keywords": [ "Changeover", "Truck", "Scheduling (production processes)", "Minification", "Genetic algorithm", "Engineering", "Mathematical optimization", "Computer science", "Automotive engineering", "Mathematics" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/mpe/2021/5592122.pdf" }, { "id": "https://openalex.org/W2588430270", "doi": "10.1080/15568318.2017.1294717", "title": "An ex ante evaluation of mobile depots in cities: A sustainability perspective", "year": 2017, "publication_date": "2017-02-17", "type": "article", "language": "en", "authors": [ "Niklas Arvidsson", "Ala Pazirandeh Arvidsson" ], "first_author": "Niklas Arvidsson", "venue": "International Journal of Sustainable Transportation", "publisher": "Taylor & Francis", "abstract": "Today, a large share of cost, congestion, and emission in cities is attributed to light goods vehicles like carrier vans distributing to the last mile. The aim of many policy agendas is to reach cleaner cities with less disturbance from the distribution vehicles. Several suggestions have been put forward and tested in research and practice, such as access restrictions, multimodal transport, and use of cleaner vehicles. In this paper, we develop a case for a more sustainable freight distribution within cities using an ex ante case study. The idea of the mobile depot is built on the iteration between historical transitions within cities and contemporary developments in urban freight distribution, and then analyzed ex ante both quantitatively in calculations and qualitatively in two stakeholder workshops. The idea is integrated and multimodal, based on a mobile depot (e.g., a bus, truck, barge, or tram) that circles the city and connects to low emission last mile delivery options such as LEVs (Light Electrical Vehicles) or cargo bikes. We found that such a system can be environmentally and socially better for the city context, while maintaining economic viability above a certain utilization rate of the mobile depot for the transport operators.", "keywords": [ "Multimodal transport", "Truck", "Last mile (transportation)", "Context (archaeology)", "Transport engineering", "Sustainability", "Sustainable transport", "Stakeholder", "Distribution (mathematics)", "BARGE", "Environmental economics", "Ex-ante" ], "cited_by_count": 73, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/15568318.2017.1294717" }, { "id": "https://openalex.org/W1964676458", "doi": "10.1016/j.cor.2005.05.007", "title": "A survey of models and algorithms for winter road maintenance. Part III: Vehicle routing and depot location for spreading", "year": 2005, "publication_date": "2005-07-13", "type": "article", "language": "en", "authors": [ "Nathalie Perrier", "André Langevin", "James F. Campbell" ], "first_author": "Nathalie Perrier", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Vehicle routing problem", "Routing (electronic design automation)", "Variety (cybernetics)", "Transport engineering", "Snow", "Computer science", "Operations research", "Engineering", "Geography", "Meteorology", "Artificial intelligence" ], "cited_by_count": 109, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2005.05.007" }, { "id": "https://openalex.org/W4386434096", "doi": "10.1016/j.tre.2023.103263", "title": "A machine learning based branch-cut-and-Benders for dock assignment and truck scheduling problem in cross-docks", "year": 2023, "publication_date": "2023-09-02", "type": "article", "language": "en", "authors": [ "Rahimeh Neamatian Monemi", "Shahin Gelareh", "Nelson Maculan" ], "first_author": "Rahimeh Neamatian Monemi", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Benders' decomposition", "Mathematical optimization", "Scheduling (production processes)", "Truck", "Computer science", "Time horizon", "Operations research", "Engineering", "Mathematics" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2023.103263" }, { "id": "https://openalex.org/W2186318017", "doi": "10.13140/rg.2.2.26991.56486", "title": "On Truck dock assignment problem with operational time constraint within cross docks", "year": 2013, "publication_date": "2013-01-01", "type": "article", "language": "en", "authors": [ "Shahin Gelareh", "Rahimeh Neamatian Monemi" ], "first_author": "Shahin Gelareh", "venue": null, "publisher": null, "abstract": "An integer programming model for the truck dock assignment problem with operational time constraint within cross docks has been proposed in (Miao, Z.,Lim, A.,Ma, H., 2009. Truck dock assignment proble m with operational time constraint within crossdocks. European Journal of Operati onal Research 192 (1), 105‐115 ). We address the following issues in this formulation: 1) from among those constraints in the model, there are n 4 constraints, which eliminate a subset of feasible solutions of the problem that has been described. Consequently, the model does not necessarily offer an optimal solution for the described problem, 2) another set of n 4 constraints, although do not cut off feasible solutions, but their upper bounds are incorrectly specified such that it leads to redundancy of a majority of them instead of contributing in numerical effi ciency by tightening the polytope of LP relaxation, 3) there is a flaw in calculation of cost in the objective function such that the positive tran sportation costs are calculated even for not transporting anything. This article contributes in the following way: 1) describes the issue using an example and subsequently proposes a rectified model, 2) calculates the dimension of po lytope in the revised model, 3) introduces several classes of valid inequalities resulting in an improved formulation with tighter LP-relaxation polytope facilitating resolut ion of larger instances and, 4) proves that some of the aforementioned valid inequalities are facets of polytope.", "keywords": [ "Polytope", "Constraint (computer-aided design)", "Linear programming relaxation", "Mathematical optimization", "Truck", "Integer programming", "Set (abstract data type)", "Assignment problem", "Mathematics", "DOCK", "Relaxation (psychology)", "Redundancy (engineering)" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.13140/rg.2.2.26991.56486" }, { "id": "https://openalex.org/W2085428563", "doi": "10.1109/cira.2007.382928", "title": "Cross Dock Scheduling Using Genetic Algorithms", "year": 2007, "publication_date": "2007-06-01", "type": "conference-paper", "language": "en", "authors": [ "Shayla Ley", "Sherif A. Elfayoumy" ], "first_author": "Shayla Ley", "venue": null, "publisher": null, "abstract": "Cross docking is a distribution system in which the merchandise received at a warehouse or distribution center is not stocked but immediately prepared for onward shipment. In other words, cross docking is the transfer of inward deliveries from the point of reception directly to the point of delivery with limited or no interim storage. One way to reduce cost in a cross dock terminal is to park incoming and outgoing trucks so that the loads can be efficiently moved across the dock. This means that the distance from loading and unloading is the shortest possible distance. The problem with generating an efficient schedule for the door assignments is that for n incoming and m outgoing trucks there are n!*m! possible solutions. This paper describes a solution to the cross dock scheduling problem using genetic algorithms. To judge the efficiency and accuracy of this solution, four programs were developed to test every possible combination of for small problem sizes (four, five, six, and seven incoming trucks). The results of the efficiency and accuracy testing shows that using genetic algorithms to schedule cross dock trucking operations provides an accurate and timely solution.", "keywords": [ "DOCK", "Truck", "Computer science", "Scheduling (production processes)", "Schedule", "Genetic algorithm", "Interim", "Algorithm", "Operations research", "Mathematical optimization", "Engineering", "Operating system" ], "cited_by_count": 23, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/cira.2007.382928" }, { "id": "https://openalex.org/W2064905222", "doi": "10.1057/palgrave.jors.2602265", "title": "Scheduling trucks in local depots for door-to-door delivery services", "year": 2006, "publication_date": "2006-07-20", "type": "article", "language": "en", "authors": [ "K H Kim", "M J Lee" ], "first_author": "K H Kim", "venue": "Journal of the Operational Research Society", "publisher": "Palgrave Macmillan", "abstract": "A scheduling method is suggested for trucks delivering and picking up freight between branch offices and a regional depot in door-to-door delivery services. As the objective functions, different levels of customer service resulting from different timing of deliveries and pickups to/from branch offices are considered as well as the travel cost of trucks. Useful properties of the optimal timing of deliveries and pickups are derived to reduce the size of the search space significantly. Numerical experiments were conducted to evaluate various algorithms to solve the problem.", "keywords": [ "Truck", "Scheduling (production processes)", "Purchasing", "Computer science", "Fleet management", "Operations research", "Transport engineering", "Vehicle routing problem", "Operations management", "Engineering", "Telecommunications", "Automotive engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1057/palgrave.jors.2602265" }, { "id": "https://openalex.org/W2793789770", "doi": "10.1016/j.trd.2018.02.022", "title": "Assessing the sustainability of mobile depots: The case of urban freight distribution in Rio de Janeiro", "year": 2018, "publication_date": "2018-03-13", "type": "article", "language": "en", "authors": [ "Lino Guimarães Marujo", "George Vasconcelos Góes", "Márcio Almeida D'Agosto", "Amanda Fernandes Ferreira", "Matthias Winkenbach", "Renata A.M. Bandeira" ], "first_author": "Lino Guimarães Marujo", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Last mile (transportation)", "Truck", "Transport engineering", "Traffic congestion", "Sustainability", "Environmental economics", "Greenhouse gas", "Public transport", "Business", "Engineering", "Mile", "Geography" ], "cited_by_count": 89, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2018.02.022" }, { "id": "https://openalex.org/W4296368705", "doi": "10.3934/mbe.2022639", "title": "Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory", "year": 2022, "publication_date": "2022-01-01", "type": "article", "language": "en", "authors": [ "Taniya Mukherjee", "Isha Sangal", "Biswajit Sarkar", "Tamer M. Alkadash" ], "first_author": "Taniya Mukherjee", "venue": "Mathematical Biosciences & Engineering", "publisher": "Arizona State University", "abstract": "Supply chain management has recently renovated its strategy by implementing a cross-docking scheme. Cross-docking is a calculated logistics strategy where freight emptied from inbound vehicles is handled straightforwardly onto outbound vehicles, eliminating the intermediate storage process. The cross-docking approach thrives on the minimum storage time of goods in the inventory. Most of the cross-docks avail temporary storage docks where items can be stored for up to 24 hours before being packed up for transportation. The storage capacity of the cross-dock varies depending on the nature of ownership. In the rented cross-docks center, the temporary storage docks are considered of infinite capacity. This study believes that the temporary storage facilities owned by the cross-dock center are of finite capacity, which subsequently affects the waiting time of the goods. The flow rate of goods within the cross-docks is expected to be maximum to avoid long waiting for goods in the queue. This paper uses a series of max-flow algorithms, namely Ford Fulkerson, Edmond Karp, and Dinic's, to optimize the flow of goods between the inbound port and the outbound dock and present a logical explanation to reduce the waiting time of the trucks. A numerical example is analyzed to prove the efficacity of the algorithm in finding maximum flow. The result demonstrates that Dinic's algorithm performs better than the Ford Fulkerson and Edmond Karp algorithm at addressing the problem of maximum flow at the cross-dock. The algorithm effectively provided the best result regarding iteration and time complexity. In addition, it also suggested the bottleneck paths of the network in determining the maximum flow.", "keywords": [ "DOCK", "Queue", "Truck", "Computer science", "Operations research", "Maximum flow problem", "Queueing theory", "Mathematical optimization", "Mathematics", "Engineering", "Computer network", "Marine engineering" ], "cited_by_count": 36, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.aimspress.com/aimspress-data/mbe/2022/12/PDF/mbe-19-12-639.pdf" }, { "id": "https://openalex.org/W3138756668", "doi": "10.1108/ec-05-2020-0273", "title": "Adaptive memory red deer algorithm for cross-dock truck scheduling with products time window", "year": 2021, "publication_date": "2021-03-08", "type": "article", "language": "en", "authors": [ "Binghai Zhou", "Shi Zong" ], "first_author": "Binghai Zhou", "venue": "Engineering Computations", "publisher": "Emerald Publishing Limited", "abstract": "Purpose The cross-docking strategy has a significant influence on supply chain and logistics efficiency. This paper aims to investigate the most suitable and efficient way to schedule the transfer of logistics activities and present a meta-heuristic method of the truck scheduling problem in cross-docking logistics. A truck scheduling problem with products time window is investigated with objectives of minimizing the total product transshipment time and earliness and tardiness cost of outbound trucks. Design/methodology/approach This research proposed a meta-heuristic method for the truck scheduling problem with products time window. To solve the problem, a lower bound of the problem is built through a novel two-stage Lagrangian relaxation problem and on account of the NP-hard nature of the truck scheduling problem, the novel red deer algorithm with the mechanism of the heuristic oscillating local search algorithm, as well as adaptive memory programming was proposed to overcome the inferior capability of the original red deer algorithm in the aspect of local search and run time. Findings Theory analysis and simulation experiments on an industrial case of a cross-docking center with a product’s time window are conducted in this paper. Satisfactory results show that the performance of the red deer algorithm is enhanced due to the mechanism of heuristic oscillating local search algorithm and adaptive memory programming and the proposed method efficiently solves the real-world size case of truck scheduling problems in cross-docking with product time window. Research limitations/implications The consideration of products time window has very realistic significance in different logistics applications such as cold-chain logistics and pharmaceutical supply chain. Furthermore, the novel adaptive memory red deer algorithm could be modified and applied to other complex optimization scheduling problems such as scheduling problems considering energy-efficiency or other logistics strategies. Originality/value For the first time in the truck scheduling problem with the cross-docking strategy, the product’s time window is considered. Furthermore, a mathematical model with objectives of minimizing the total product transshipment time and earliness and tardiness cost of outbound trucks is developed. To solve the proposed problem, a novel adaptive memory red deer algorithm with the mechanism of heuristic oscillating local search algorithm was proposed to overcome the inferior capability of genetic algorithm in the aspect of local search and run time.", "keywords": [ "Truck", "Computer science", "Tardiness", "Mathematical optimization", "Scheduling (production processes)", "Job shop scheduling", "Algorithm", "Schedule", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/ec-05-2020-0273" }, { "id": "https://openalex.org/W2511982506", "doi": "10.1016/j.ifacol.2016.07.751", "title": "Cross-docking Operation Scheduling: Truck Arrivals, Shop-Floor Activities and Truck Departures", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Christian Serrano", "Javier Moral", "Xavier Delorme", "Alexandre B. Dolgui" ], "first_author": "Christian Serrano", "venue": "IFAC-PapersOnLine", "publisher": "Elsevier BV", "abstract": "Cross-docking is a relatively new logistic strategy which seeks to make economies in transportation, decrease lead time and reduce inventory. The main principle is to unload, sort, consolidate and transfer delivered packages from inbound trucks to outbound trucks, with a minimum of storage or treatment in between. Two key issues associated to this field are the truck scheduling and the shop-floor operation scheduling. We propose a mixed integer linear programming model to schedule truck arrivals, shop-floor activities and truck departures. The cross-dock configuration we study is based on an industrial case on the automotive industry. In particular, a repack operation and two temporary storage zones are considered. The objective is to minimize internal operation cost (penalty related to extra capacity needs) and outbound transportation cost (number of trucks). The model is implemented and tested in CPLEX with small size instances, based on industrial data. The proposed model could be easily adapted to a variety of cross-dock configurations, in terms of internal capacity and cost distribution.", "keywords": [ "Truck", "Automotive industry", "Integer programming", "Scheduling (production processes)", "Schedule", "Computer science", "sort", "DOCK", "Operations research", "Transport engineering", "Engineering", "Automotive engineering" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ifacol.2016.07.751" }, { "id": "https://openalex.org/W2982748709", "doi": "10.5267/j.ijiec.2019.10.001", "title": "Truck-to-door sequencing in multi-door cross-docking system with dock repeat truck holding patter", "year": 2019, "publication_date": "2019-11-03", "type": "article", "language": "en", "authors": [ "A A Kamali Ardakani", "Jiangang Fei", "Pedram Beldar" ], "first_author": "A A Kamali Ardakani", "venue": "International Journal of Industrial Engineering Computations", "publisher": "Growing Science", "abstract": "Cross-docking is a logistics strategy that consolidates the products of different inbound trucks according to their destinations in order to reduce the inventory, order picking, and transportation costs.It requires a high level of collaboration between inbound trucks, internal operations, and outbound trucks.This article addresses the truck-to-door sequencing problem.Truck-to-door sequencing has been studied by some researchers in different titles such as scheduling and sequencing of inbound and outbound trucks of the cross-dock center.However, previous studies have not considered repeat truck holding pattern.Therefore, it is important to determine the doors and the sequence of the inbound and outbound trucks that should be assigned in a cross-dock center.This paper focuses on optimizing truck-to-door sequencing with consideration of repeat truck holding pattern in inbound trucks in order to minimize makespan.Two methods are considered to solve this problem, including mathematical modeling and a heuristic algorithm.In the first method, a mixed integer-programming model is developed to minimize the makespan.Then, GAMS software is used to solve small-scale problems.In the second approach, a heuristic algorithm is developed to find near-optimal solutions within the shortest time possible and the algorithm is used to solve large-scale problems.The results of the mathematical model and the heuristic algorithm are slightly different and show the good quality of the presented heuristic algorithm.", "keywords": [ "Truck", "DOCK", "Computer science", "Job shop scheduling", "Heuristic", "Scheduling (production processes)", "Integer programming", "Operations research", "Engineering", "Algorithm", "Operations management", "Computer network" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5267/j.ijiec.2019.10.001" }, { "id": "https://openalex.org/W4409016821", "doi": "10.4271/2025-01-8602", "title": "Coupled Routing and Charge Schedule Optimization of Electrified Delivery Truck Fleets: Feasibility Analyses", "year": 2025, "publication_date": "2025-03-31", "type": "conference-paper", "language": "en", "authors": [ "Yared Tadesse Wendimagegnehu", "Beshah Ayalew", "Andrej Ivančo", "Habtamu Hailemichael" ], "first_author": "Yared Tadesse Wendimagegnehu", "venue": "SAE technical papers on CD-ROM/SAE technical paper series", "publisher": null, "abstract": "Electrifying truck fleets has the potential to improve energy efficiency and reduce carbon emissions from the freight transportation sector. However, the range limitations and substantial capital costs with current battery technologies imposes constraints that challenge the overall cost feasibility of electrifying fleets for logistics companies. In this paper, we investigate the coupled routing and charge scheduling optimization of a delivery fleet serving a large urban area as one approach to discovering feasible pathways. To this end, we first build an improved energy consumption model for a Class 7-8 electric and diesel truck using a data-driven approach of generating energy consumption data from detailed powertrain simulations on numerous drive cycles. We then conduct several analyses on the impact of battery pack capacity, cost, and electricity prices on the amortized daily total cost of fleet electrification at different penetration levels, considering availability of fast charging at the depot. Findings indicate that at typical energy density of current battery technology, there is an optimal battery pack capacity that results from the contradicting effects of increasing pack capacity on cost, life span, weight and energy consumption. It is also observed that with currently improving trends in battery pack costs and availability of reduced electricity prices at the depot, such as with renewable microgrids, fleet electrification can become viable even at low levels of penetration.", "keywords": [ "Truck", "Schedule", "Automotive engineering", "Vehicle routing problem", "Routing (electronic design automation)", "Charge (physics)", "Computer science", "Transport engineering", "Engineering", "Computer network", "Physics" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://arxiv.org/pdf/2606.00792" }, { "id": "https://openalex.org/W2754477145", "doi": "10.1057/s41274-017-0289-1", "title": "Dock sharing in cross-docking facilities of the postal service industry", "year": 2017, "publication_date": "2017-09-11", "type": "article", "language": "en", "authors": [ "Michael Zenker", "Nils Boysen" ], "first_author": "Michael Zenker", "venue": "Journal of the Operational Research Society", "publisher": "Palgrave Macmillan", "abstract": "In cross-docks, incoming shipments are unloaded, moved across the facility, and loaded into outbound trucks, such that truck load factors are increased and transportation costs are reduced. In this context, we treat the question which outbound destinations should share a dock if not enough docking space is available to process each destination via its separate dock door. We aim at a partition of destinations (among docks), such that fixed processing intervals do not overlap and the maximum inventory accumulating in the staging areas is minimized. We define the resulting dock sharing problem specifically addressing the peculiarities of the postal service industry, investigate computational complexity, and provide solution procedures.", "keywords": [ "DOCK", "Truck", "Purchasing", "Computer science", "Destinations", "Operations research", "Transport engineering", "Traverse", "Operations management", "Business", "Marketing", "Engineering" ], "cited_by_count": 26, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1057/s41274-017-0289-1" }, { "id": "https://openalex.org/W1991780916", "doi": "10.1016/j.compchemeng.2013.12.012", "title": "A monolithic approach to vehicle routing and operations scheduling of a cross-dock system with multiple dock doors", "year": 2014, "publication_date": "2014-01-19", "type": "article", "language": "en", "authors": [ "Rodolfo Dondo", "Jaime Cerdá" ], "first_author": "Rodolfo Dondo", "venue": "Computers & Chemical Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "DOCK", "Doors", "Truck", "Scheduling (production processes)", "Vehicle routing problem", "Engineering", "Integer programming", "Pickup", "Computer science", "Routing (electronic design automation)", "Computer network", "Operations management" ], "cited_by_count": 37, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0098135413003931" }, { "id": "https://openalex.org/W2088252118", "doi": "10.1080/00207543.2013.848485", "title": "An efficient hybrid meta-heuristic for a cross-docking system with temporary storage", "year": 2013, "publication_date": "2013-10-22", "type": "article", "language": "en", "authors": [ "André Luís Shiguemoto", "Ubiratan Soares Cavalcante Netto", "Gabriela Helena Sergio Bauab" ], "first_author": "André Luís Shiguemoto", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "Cross-docking is a distribution system where products arriving at the warehouse (distribution centre) are organised, loaded and shipped for delivery to customers without storage and picking. Arrival is performed by inbound trucks, having products verified and organised at the receiving docks according to their destinations and customer demand. These products are directly sent to shipping dock and loaded in outbound trucks which will make deliveries to customers. Thus, inventory costs and delivery times to customers are reduced. An important parameter for successful implementation of cross-docking is the efficiency related to the scheduling of inbound and outbound trucks, as well as the transfer of products. This research presents a hybrid genetic algorithm with tabu search to find good scheduling of trucks, reducing total operating time. A meta-heuristic was tested on instances and solutions reveal themselves as equal as or better than those of literature.", "keywords": [ "Truck", "Tabu search", "Scheduling (production processes)", "Operations research", "Genetic algorithm", "Computer science", "Job shop scheduling", "Transport engineering", "Engineering", "Operations management", "Schedule", "Automotive engineering" ], "cited_by_count": 27, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2013.848485" }, { "id": "https://openalex.org/W2329940737", "doi": "10.1504/ejie.2016.075108", "title": "Scheduling trucks in a multiple-door cross docking system with unequal ready times", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Mohammad Taghi Assadi", "Mohsen Bagheri" ], "first_author": "Mohammad Taghi Assadi", "venue": "European J of Industrial Engineering", "publisher": "Inderscience Publishers", "abstract": "Cross docking is a new strategy in logistics mainly consisting of unloading products from inbound trucks, resorting and loading directly into outbound trucks with minimum possible transitional storages. In this paper, we study the truck scheduling problem in a cross docking terminal with multiple receiving and shipping dock doors. The objective is to find the best door assignments, the docking sequences of both inbound and outbound trucks and also product assignments to trucks to minimise the weighted number of tardy trucks, when the ready times for inbound trucks, and different distances between the inbound and outbound doors are considered. The problem is formulated as a mixed-integer linear programming (MILP) model and since the optimisation problem is NP-hard, we suggest simulated annealing and genetic algorithms to solve the model. To evaluate the performance of meta-heuristics, we benefit from numerous different problem instances in the literature and compared the results to a pure random search algorithm and also to GAMS software results for the MILP model. [Received 23 July 2014; Revised 12 January 2015; Revised 30 April 2015; Accepted 20 May 2015]", "keywords": [ "Truck", "Doors", "Heuristics", "DOCK", "Integer programming", "Computer science", "Scheduling (production processes)", "Simulated annealing", "Operations research", "Job shop scheduling", "Mathematical optimization", "Engineering" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ejie.2016.075108" }, { "id": "https://openalex.org/W3197006902", "doi": "10.1111/itor.13052", "title": "The two‐echelon routing problem with truck and drones", "year": 2021, "publication_date": "2021-08-29", "type": "article", "language": "en", "authors": [ "Lam Vu", "Duy Manh Vu", "Minh Hoàng Hà", "Viet‐Phuong Nguyen" ], "first_author": "Lam Vu", "venue": "International Transactions in Operational Research", "publisher": "Wiley", "abstract": "Abstract In this paper, we study novel variants of the well‐known two‐echelon vehicle routing problem in which a truck works on the first echelon to transport parcels and a fleet of drones to intermediate depots while in the second echelon, the drones are used to deliver parcels from intermediate depots to customers. The objective is to minimize the completion time instead of the transportation cost as in classical two‐echelon vehicle routing problems. Depending on the context, a drone can be launched from the truck at an intermediate depot once (single‐trip drone) or several times (multiple‐trip drone). Mixed‐integer linear programming models are first proposed to formulate mathematically the problems and solve to optimality small‐sized instances. To handle larger instances, a metaheuristic based on the idea of greedy randomized adaptive search procedure is introduced. The main novel feature of our metaheuristic lies in the design of initial solution construction and local search operators, which can cover all the decision layers of the problems and run in using additional data structures. Experimental results obtained on instances of different contexts are reported and analyzed.", "keywords": [ "Drone", "Truck", "Vehicle routing problem", "Context (archaeology)", "Computer science", "Metaheuristic", "Mathematical optimization", "Integer programming", "Routing (electronic design automation)", "Linear programming", "Operations research", "Mathematics" ], "cited_by_count": 51, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1111/itor.13052" }, { "id": "https://openalex.org/W4307078345", "doi": "10.1016/j.ejtl.2022.100094", "title": "Exact and heuristic approaches to Truck–Drone Delivery Problems", "year": 2022, "publication_date": "2022-10-22", "type": "article", "language": "en", "authors": [ "Júlia Cária de Freitas", "Puca Huachi Vaz Penna", "Túlio A. M. Toffolo" ], "first_author": "Júlia Cária de Freitas", "venue": "EURO Journal on Transportation and Logistics", "publisher": "Springer Science+Business Media", "abstract": "Collaborative delivery employing drones in last-mile delivery has been an extensively studied topic in recent years. In this paper, it is studied Truck–Drone Delivery Problems (TDDPs) in which a traditional delivery truck is gathered with a drone to cut delivery times and costs. The vehicles work together in a hybrid operation involving one drone launching from a larger vehicle that operates as a mobile depot and a recharging platform. The drone launches from the truck with a single package to deliver to a customer. Each drone must return to the truck to recharge batteries, pick up another package, and launch again to a new customer location. This work proposes a novel Mixed Integer Programming (MIP) formulation and a heuristic approach to address the problem. The proposed MIP formulation yields better linear relaxation bounds than previously proposed formulations for all instances, and was capable of optimally solving several unsolved instances from the literature. A hybrid heuristic based on the General Variable Neighborhood Search metaheuristic combining Tabu Search concepts is employed to obtain high-quality solutions for large-size instances. The efficiency of the algorithm was evaluated on 1415 benchmark instances from the literature, and over 80% of the best known solutions were improved.", "keywords": [ "Drone", "Truck", "Tabu search", "Benchmark (surveying)", "Computer science", "Metaheuristic", "Heuristic", "Mathematical optimization", "Integer programming", "Variable neighborhood search", "Engineering", "Operations research" ], "cited_by_count": 49, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S219243762200019X/pdf" }, { "id": "https://openalex.org/W2769822150", "doi": "10.22094/joie.2017.594.1382", "title": "Location-Allocation and Scheduling of Inbound and Outbound Trucks in Multiple Cross-Dockings Considering Breakdown Trucks", "year": 2018, "publication_date": "2018-03-01", "type": "article", "language": "en", "authors": [ "Javad Behnamian", "S.M.T. Fatemi Ghomi", "Fariborz Jolai", "Pooya Heidary" ], "first_author": "Javad Behnamian", "venue": "DOAJ (DOAJ: Directory of Open Access Journals)", "publisher": null, "abstract": "This paper studies multiple cross-dockings where the loads are transferred from origins (suppliers) to destinations (customers) through cross-docking facilities. Products are no longer stored in intermediate depots and incoming shipments are consolidated based on customer demands and immediately delivered to them to their destinations. In this paper, each cross-docking has a covering radius that customers can be served by at least one cross-docking provided. In addition, this paper considers the breakdown of trucks. We present a two-stage model for the location of cross-docking centers and scheduling inbound and outbound trucks in multiple cross-dockings.We work on minimizing the transportation cost in a network by loading trucks in the supplier locations and route them to the customers via cross-docking facilities. The objective, in the first stage, is to minimize transportation cost of delivering products from suppliers to open cross-docks and cross-docks to the customers; in the second-stage, the objective is to minimize the makespans of open cross-dockings and the total weighted summation of completion time. Due to the difficulty of obtaining the optimum solution tomedium- and large-scale problems, we ‌propose four types of metaheuristic algorithms, i.e., genetic, simulated annealing, differential evolution, and hybrid algorithms.The result showed that simulated annealing is the best algorithm between the four algorithms.", "keywords": [ "Truck", "Computer science", "Scheduling (production processes)", "Transport engineering", "Operations research", "Operations management", "Engineering", "Automotive engineering" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doaj.org/article/3bb287dc2da947648dbf047ae98ec7e6" }, { "id": "https://openalex.org/W2083344527", "doi": "10.1016/j.omega.2006.04.007", "title": "Truck scheduling for solid waste collection in the City of Porto Alegre, Brazil", "year": 2006, "publication_date": "2006-06-16", "type": "article", "language": "en", "authors": [ "Jing-Quan Li", "Denis Borenstein", "Pitu B. Mirchandani" ], "first_author": "Jing-Quan Li", "venue": "Omega", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Waste collection", "TRIPS architecture", "Municipal solid waste", "Scheduling (production processes)", "Computer science", "Operations research", "Job shop scheduling", "Heuristic", "Transport engineering", "Operations management", "Engineering" ], "cited_by_count": 72, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.omega.2006.04.007" }, { "id": "https://openalex.org/W3196343779", "doi": "10.1016/j.cor.2021.105513", "title": "An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments", "year": 2021, "publication_date": "2021-09-06", "type": "article", "language": "en", "authors": [ "Asefeh Hasani Goodarzi", "Eleen Diabat", "Armin Jabbarzadeh", "Marc Paquet" ], "first_author": "Asefeh Hasani Goodarzi", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "DOCK", "Truck", "Queue", "Computer science", "Queueing theory", "Doors", "Queue management system", "Operations research", "Quality of service", "Computer network", "Engineering", "Automotive engineering" ], "cited_by_count": 36, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2021.105513" }, { "id": "https://openalex.org/W7130992843", "doi": "10.3390/wevj17020106", "title": "Charging Strategies for Battery Electric Trucks in Germany", "year": 2026, "publication_date": "2026-02-21", "type": "article", "language": "en", "authors": [ "Daniel Speth", "Saskia Paasch" ], "first_author": "Daniel Speth", "venue": "World Electric Vehicle Journal", "publisher": "Multidisciplinary Digital Publishing Institute", "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": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2032-6653/17/2/106/pdf?version=1772073739" }, { "id": "https://openalex.org/W2008351212", "doi": "10.1177/0956462413512803", "title": "HIV prevalence and risk in long-distance truck drivers in South Africa: a national cross-sectional survey", "year": 2013, "publication_date": "2013-12-18", "type": "article", "language": "en", "authors": [ "Sinéad Delany‐Moretlwe", "Braimoh Bello", "Peter Kinross", "Monique Oliff", "Matthew Chersich", "Immo Kleinschmidt", "Helen Rees" ], "first_author": "Sinéad Delany‐Moretlwe", "venue": "International Journal of STD & AIDS", "publisher": "SAGE Publishing", "abstract": "We estimated the prevalence of HIV and assessed correlates of HIV infection in long-distance truck drivers in South Africa. Between October 2003 and July 2004, 1900 long-distance truck drivers aged ≥18 years consented to interview and for testing for HIV. Participants were selected from a 10% stratified random sample of registered truck depots. A proximate-determinants framework was used to assess the hierarchical relationship between risk factors and HIV infection using logistic regression. HIV prevalence was 26% (95% confidence interval 24% to 28%). In multivariate analyses, HIV infection was associated with spending 2-4 weeks on the road (adjusted odds ratio 1.4; 95% confidence interval 1.1 to 1.9). There was modest evidence of a dose-response relationship between time on the road and HIV risk. Mobility increased risk by creating conditions for unsafe sex and reducing access to health services. Targeted HIV interventions for long-distance truck drivers are needed.", "keywords": [ "Medicine", "Cross-sectional study", "Environmental health", "Truck", "Human immunodeficiency virus (HIV)", "Virology", "Pathology" ], "cited_by_count": 100, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1177/0956462413512803" }, { "id": "https://openalex.org/W2103576053", "doi": "10.1155/2014/128542", "title": "A Multiobjective Iterated Greedy Algorithm for Truck Scheduling in Cross-Dock Problems", "year": 2014, "publication_date": "2014-05-08", "type": "article", "language": "en", "authors": [ "Bahman Naderi", "Shadi Rahmani", "Shabnam Rahmani" ], "first_author": "Bahman Naderi", "venue": "Journal of Industrial Engineering", "publisher": "Hindawi Publishing Corporation", "abstract": "The cross-docking system is a new distribution strategy which can reduce inventories, lead times, and improve responding time to customers. This paper considers biobjective problem of truck scheduling in cross-docking systems with temporary storage. The objectives are minimizing both makespan and total tardiness. For this problem, it proposes a multiobjective iterated greedy algorithm employing advance features such as modified crowding selection, restart phase, and local search. To evaluate the proposed algorithm for performance, it is compared with two available algorithms, subpopulation particle swarm optimization-II and strength Pareto evolutionary algorithm-II. The comparison shows that the proposed multiobjective iterated greedy algorithm shows high performance and outperforms the other two algorithms.", "keywords": [ "Tardiness", "Mathematical optimization", "Greedy algorithm", "Job shop scheduling", "Computer science", "Particle swarm optimization", "Scheduling (production processes)", "Algorithm", "Multi-objective optimization", "Pareto principle", "Mathematics" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/archive/2014/128542.pdf" }, { "id": "https://openalex.org/W2189280918", "doi": null, "title": "Scheduling of trucks in cross-docking systems: a hybrid meta-heuristic algorithm", "year": 2013, "publication_date": "2013-01-01", "type": "article", "language": "en", "authors": [ "Behnam Vahdani", "Reza R. Tavakkoli-Moghaddam", "Mohammad Mousavi" ], "first_author": "Behnam Vahdani", "venue": null, "publisher": null, "abstract": "Cross-docking is a logistics technique that minimizes the storage and order picking functions of a warehouse while still allowing it to serve its receiving and shipping functions. In this paper, we propose a novel hybrid meta-heuristic algorithm for solving scheduling trucks in cross-docking problems. This algorithm comprises three components: an initial population generation method based on ant colony optimization (ACO), simulated annealing (SA) as an evolutionary algorithm employs a certain probability to avoid becoming trapped in local optimum, and variable neighborhood search (VNS) that involves three local search procedures to improve the population. Moreover, to demonstrate the effectiveness of the proposed methods especially for large-sized problems, various test problems are solved. The computational results demonstrate that our proposed algorithm performs far better than those of Yu and Egbelu (2008).", "keywords": [ "Simulated annealing", "Mathematical optimization", "Ant colony optimization algorithms", "Computer science", "Job shop scheduling", "Population", "Scheduling (production processes)", "Metaheuristic", "Meta heuristic", "Algorithm", "Variable neighborhood search", "Mathematics" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "http://orlabanalytics.ca/lnms/archive/v5/lnmsv5p125.pdf" }, { "id": "https://openalex.org/W3137386665", "doi": "10.1088/1742-6596/1811/1/012009", "title": "Decision support system for truck scheduling in logistic network through cross-docking strategy", "year": 2021, "publication_date": "2021-03-01", "type": "conference-paper", "language": "en", "authors": [ "Filscha Nurprihatin", "Elvina Elvina", "Glisina Dwinoor Rembulan", "Kevin Christianto", "Heny Hartono" ], "first_author": "Filscha Nurprihatin", "venue": "Journal of Physics Conference Series", "publisher": "IOP Publishing", "abstract": "Abstract In recent years, companies around the world need to find new ways to reduce costs, increase productivity, improve product quality, and meet various customer demands. Each Distribution Center (DC) or warehouse is specifically designed to minimize costs in the company’s supply chain. Cross-docking is a logistics technique that eliminates storing and picking up items at warehouses. Cross-docking has several advantages compared to other product distribution strategies from both an economic and an environmental point of view. Cross-docking decisions are influenced by many factors such as the level of product demand, the cost of stock-outs, and the distance from suppliers to customers. This research builds a Decision Support System (DSS) that can help companies to ensure sustainability in the supply chain. This study assumes the demand is deterministic which is indicated by Economic Order Quantity (EOQ). This system can detect the time and quantity of certain items that experience cross-docks accurately. If the customers’demand cannot be fulfilled by the warehouse, then the goods are categorized as out of stock. By knowing the time and quantity of goods at the time of the cross-dock, the warehouse manager can make operational decisions quickly and accurately related to the resources such asoperators and forklifts.", "keywords": [ "Truck", "Supply chain", "Warehouse", "Computer science", "Decision support system", "Operations research", "Stock (firearms)", "Supply chain management", "Business", "Operations management", "Marketing", "Economics" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://iopscience.iop.org/article/10.1088/1742-6596/1811/1/012009/pdf" }, { "id": "https://openalex.org/W2461009042", "doi": null, "title": "New Approach for the Cross-Dock Door Assignment Problem", "year": 2009, "publication_date": "2009-01-01", "type": "article", "language": "en", "authors": [ "Yi‐Rong Zhu", "Peter M. Hahn", "Ying Liu", "Monique Guignard-Spielberg" ], "first_author": "Yi‐Rong Zhu", "venue": null, "publisher": null, "abstract": "In a cross-dock facility goods are moved by forklift from incoming truck platforms (strip doors) to temporary holding areas and then to platforms (stack doors) for outgoing trucks or directly from incoming truck strip doors to stack doors for outgoing trucks. Costs within the cross-dock may be minimized by appropriate assignment of strip doors to incoming trucks and stack doors to outgoing trucks. We present in this paper a formulation of this problem as a Generalized Quadratic 3-dimensional Assignment Problem and describe a methodology for generating practical Cross-dock Door Assignment Problem (CDAP) test cases. For our presentation at XLI SBPO, we will generate a range of CDAP test cases (from easy to very difficult) and attempt to solve these, using an exact and an approximate solution method.", "keywords": [ "Doors", "Truck", "DOCK", "Stack (abstract data type)", "Engineering", "Computer science", "Range (aeronautics)", "Programming language", "Marine engineering", "Operating system", "Automotive engineering" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "http://din.uem.br/sbpo/sbpo2009/artigos/55924.pdf" }, { "id": "https://openalex.org/W2559042322", "doi": "10.1145/3009912.3009921", "title": "An Empirical Study on Coverage-Ensured Automotive Sensing using Door-to-door Garbage Collecting Trucks", "year": 2016, "publication_date": "2016-12-01", "type": "conference-paper", "language": "en", "authors": [ "Yin Chen", "Jin Nakazawa", "Takuro Yonezawa", "Takafumi Kawasaki", "Hideyuki Tokuda" ], "first_author": "Yin Chen", "venue": null, "publisher": null, "abstract": "Due to the advance in information and communication technologies, smart cities have become an increasingly appealing vision. One indispensable basis in the research, development and implementation of smart cities is urban sensing technologies, which collect various citywide data that will be processed to generate information for understanding the status of cities. Automotive sensing is a novel urban sensing technology that utilizes the mobility of automobiles to conduct sensing tasks. In a collaborative smart-city project with the city office of Fujisawa City, Japan, we designed and implemented an automotive sensing platform called Cruisers, and have deployed it into the garbage collecting trucks of the city to evaluate the applicability of automotive sensing in realistic urban settings. In this paper, we first detail the system design, implementation and deployment of Cruisers and then evaluate its performance in realistic setting.", "keywords": [ "Automotive industry", "Software deployment", "Truck", "Garbage", "Computer science", "Smart city", "Transport engineering", "Garbage collection", "Computer security", "Engineering", "Automotive engineering", "Software engineering" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1145/3009912.3009921" }, { "id": "https://openalex.org/W1497866778", "doi": "10.18517/ijaseit.2.5.226", "title": "A Review on Quantitative Approaches for Dock Door Assignment in Cross-Docking", "year": 2012, "publication_date": "2012-01-01", "type": "article", "language": "en", "authors": [ "Adibah Shuib", "Wan Nor Ashikin Wan Ahmad Fatthi" ], "first_author": "Adibah Shuib", "venue": "International Journal on Advanced Science Engineering and Information Technology", "publisher": "Insight Society", "abstract": "Cross docking is a relatively new technique in supply chain operations. It offers limited storage time to maximize the efficiency of goods transshipment. Efficient operation of a cross docking system requires an appropriate coordination of inbound and outbound flows, accurate planning and dynamic scheduling. The planning strategies at cross docking terminals, which are receiving growing attention today, are the truck-to-door assignment and destination to door assignment problems. This paper provides a comprehensive literature review of quantitative approaches in dock door assignment problems of cross docking planning. The contributions of this paper are to identify the gap of knowledge in operational levels mainly in dock door assignment and to point out the future research direction in cross docking.", "keywords": [ "DOCK", "Docking (animal)", "Transshipment (information security)", "Scheduling (production processes)", "Computer science", "Operations research", "Truck", "Engineering", "Operations management" ], "cited_by_count": 23, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.insightsociety.org/ojaseit/index.php/ijaseit/article/download/226/229" }, { "id": "https://openalex.org/W3117135908", "doi": "10.1002/net.22015", "title": "Trucks and drones cooperation in the last‐mile delivery process", "year": 2020, "publication_date": "2020-12-24", "type": "article", "language": "en", "authors": [ "Luigi Di Puglia Pugliese", "Giusy Macrina", "Francesca Guerriero" ], "first_author": "Luigi Di Puglia Pugliese", "venue": "Networks", "publisher": "Wiley", "abstract": "Abstract We address the problem of routing a fleet of trucks equipped with unmanned aerial vehicles, commonly known as drones, to perform deliveries in last‐mile delivery process. The customers can be served by either a truck or a drone within the respective time window of each. Each capacitated truck carries drones that can be launched to perform deliveries. The drone takes off from a truck located either at a customer or at the depot and it must land on the same truck after visiting a customer to be served. The aim is to serve all customers at minimum cost, under time window, capacity, and flying endurance constraints. We formulate the problem as a mixed integer linear program (MILP) and develop a heuristic procedure where a two‐phase strategy is embedded in a multi‐start framework. The computational results are carried out on instances generated by starting from vehicle routing problem with time windows benchmarks. We analyze the behavior of the considered transportation system by mean of the solutions provided by the MILP. The proposed formulation is able to solve instances with up to 15 customers. The solutions of the MILP are used as benchmark to assess the effectiveness of the proposed heuristic procedure.", "keywords": [ "Truck", "Drone", "Vehicle routing problem", "Computer science", "Benchmark (surveying)", "Heuristic", "Last mile (transportation)", "Integer programming", "Process (computing)", "Routing (electronic design automation)", "Integer (computer science)", "Linear programming" ], "cited_by_count": 56, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/net.22015" }, { "id": "https://openalex.org/W2026500963", "doi": "10.1016/j.cie.2013.09.024", "title": "A tabu search approach to the truck scheduling problem with multiple docks and time windows", "year": 2013, "publication_date": "2013-10-14", "type": "article", "language": "en", "authors": [ "Jan Van Belle", "Paul Valckenaers", "Greet Vanden Berghe", "Dirk Cattrysse" ], "first_author": "Jan Van Belle", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Tardiness", "Tabu search", "Truck", "Job shop scheduling", "Scheduling (production processes)", "Mathematical optimization", "Solver", "Integer programming", "Computer science", "Doors", "Computation", "Operations research" ], "cited_by_count": 61, "is_retracted": false, "is_paratext": false, "open_access_url": "https://lirias.kuleuven.be/retrieve/154051f3-8b9d-4bf5-8078-b1814308c8fa" }, { "id": "https://openalex.org/W2329342112", "doi": "10.1109/tits.2016.2519104", "title": "Natural Optimization Algorithms for the Cross-Dock Door Assignment Problem", "year": 2016, "publication_date": "2016-03-16", "type": "article", "language": "en", "authors": [ "Abbas A. Tarhini", "Manal M. Yunis", "Mohamad Mohamad Jaafar Chamseddine" ], "first_author": "Abbas A. Tarhini", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "Cross-docking is a practice in logistics in which shipments are directly moved from an inbound truck into an outbound truck. A recognized problem in this domain is the assignment of trucks to doors in a way that the distance to be traveled between the doors is minimized. This problem is known as the cross-dock door assignment problem (CDAP). The purpose of this paper is to present a novel algorithm that minimizes the traveling distance of the handling machines when moving cargo from an inbound truck to an outbound truck. A lot of research has been conducted regarding this topic; still, up to our knowledge, none used scatter search (SS). This paper modifies a classical mathematical model that represents the CDAP and implements an evolutionary metaheuristic SS algorithm and tests it and then compares the results with those of another evolutionary algorithm, i.e., genetic algorithm (GA). The results indicate that the SS algorithm outperformed the GA, particularly for large-sized problems with a diverse reference set.", "keywords": [ "Truck", "DOCK", "Doors", "Metaheuristic", "Genetic algorithm", "Computer science", "Set (abstract data type)", "Algorithm", "Assignment problem", "Domain (mathematical analysis)", "Mathematical optimization", "Engineering" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2016.2519104" }, { "id": "https://openalex.org/W2500245032", "doi": "10.1080/0305215x.2016.1206414", "title": "Optimizing the admission time of outbound trucks entering a cross-dock with uniform arrival time by considering a queuing model", "year": 2016, "publication_date": "2016-08-02", "type": "article", "language": "en", "authors": [ "Arash Motaghedi-Larijani", "Majid Aminnayeri" ], "first_author": "Arash Motaghedi-Larijani", "venue": "Engineering Optimization", "publisher": "Taylor & Francis", "abstract": "Cross-docking is a supply-chain strategy that can reduce transportation and inventory costs. This study is motivated by a fruit and vegetable distribution centre in Tehran, which has cross-docks and a limited time to admit outbound trucks. In this article, outbound trucks are assumed to arrive at the cross-dock with a single outbound door with a uniform distribution (0,L). The total number of assigned trucks is constant and the loading time is fixed. A queuing model is modified for this situation and the expected waiting time of each customer is calculated. Then, a curve for the waiting time is calculated. Finally, the length of window time L is optimized to minimize the total cost, which includes the waiting time of the trucks and the admission cost of the cross-dock. Some illustrative examples of cross-docking are presented and solved using the proposed method.", "keywords": [ "Truck", "DOCK", "Queueing theory", "Computer science", "Arrival time", "Transport engineering", "Operations research", "Queue", "Time allocation", "Engineering", "Computer network", "Automotive engineering" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/0305215x.2016.1206414" }, { "id": "https://openalex.org/W2066306775", "doi": "10.1016/s0377-2217(96)00188-9", "title": "Direct shipping and the dynamic single-depot/multi-retailer inventory system", "year": 1997, "publication_date": "1997-09-01", "type": "article", "language": "en", "authors": [ "Dawn Barnes-Schuster", "Yehuda Bassok" ], "first_author": "Dawn Barnes-Schuster", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Depot", "Operations research", "Truck", "Order (exchange)", "Computer science", "Time horizon", "Inventory control", "Operations management", "Inventory cost", "Lost sales", "Mathematical optimization", "Business" ], "cited_by_count": 55, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/s0377-2217(96)00188-9" }, { "id": "https://openalex.org/W3124415321", "doi": null, "title": "Cross Dock Scheduling: Classification, Literature Review and Research Agenda", "year": 2009, "publication_date": "2009-03-16", "type": "preprint", "language": "en", "authors": [ "Nils Boysen", "Malte Fliedner" ], "first_author": "Nils Boysen", "venue": "RePEc: Research Papers in Economics", "publisher": "Federal Reserve Bank of St. Louis", "abstract": "At cross docking terminals incoming deliveries of inbound trucks are unloaded, sorted, moved across the dock and finally loaded onto outbound trucks, which immediately leave the terminal towards their next destination in the distribution chain. Accordingly, a cross dock is a consolidation point in a distribution network, where multiple smaller shipments can be merged to full truck loads in order to realize economies in transportation. In this context, the truck scheduling problem, which decides on the succession of truck processing at the dock doors, is especially important to ensure a rapid turnover and on-time deliveries. Due to its high real-world significance, several truck scheduling procedures have been introduced during recent years, which all treat specific cross dock settings. In order to structure and promote scientific progress, this paper introduces a classification of deterministic truck scheduling. With the help of this classification, existing literature is reviewed and future research needs are identified. Moreover, we represent a yet unexplored class of truck scheduling problems which is highly relevant in real-world distribution networks.", "keywords": [ "Truck", "DOCK", "Doors", "Scheduling (production processes)", "Operations research", "Computer science", "Transport engineering", "Consolidation (business)", "Engineering", "Operations management", "Business" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://nbn-resolving.org/urn:nbn:de:gbv:27-20100730-091906-1" }, { "id": "https://openalex.org/W2974436857", "doi": "10.1007/s11573-019-00942-5", "title": "Integrating truck and workforce scheduling in a cross-dock: analysis of different workforce coordination policies", "year": 2019, "publication_date": "2019-09-16", "type": "article", "language": "en", "authors": [ "Hans Corsten", "Ferdinand Becker", "Hagen Salewski" ], "first_author": "Hans Corsten", "venue": "Journal of Business Economics", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Workforce", "Operations management", "Operations research", "Business", "Computer science", "Transport engineering", "Engineering", "Economics" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s11573-019-00942-5" }, { "id": "https://openalex.org/W4307943809", "doi": "10.3390/app122110931", "title": "Hybrid Algorithms for Inbound and Outbound Truck Scheduling in Cross-Docking Systems", "year": 2022, "publication_date": "2022-10-28", "type": "article", "language": "en", "authors": [ "Gen-Han Wu", "Yi-Ting Chen", "Ke-Hsuan Chen" ], "first_author": "Gen-Han Wu", "venue": "Applied Sciences", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "A cross-docking system is a kind of facility design for the purpose of enhancing the time efficiency of a distribution center. In this study, we attempt to consider a cross-docking system without temporary storage and obtain great system performance by addressing the scheduling problem of inbound and outbound trucks, in which the total operation time of trucks is minimized. In order to reduce computational efforts, three hybrid metaheuristic approaches based on particle swarm optimization, simulated annealing, and a variable neighborhood search are proposed. By the computational experiments, the three optimized approaches are analyzed and compared with each other. The experimental results show that all of these three approaches can obtain pretty good solutions, even in the large-scale examples. Moreover, one of these approaches—a hybrid metaheuristic with particle swarm optimization and a variable neighborhood search—can usually obtain the best solutions.", "keywords": [ "Metaheuristic", "Particle swarm optimization", "Simulated annealing", "Computer science", "Truck", "Mathematical optimization", "Variable neighborhood search", "Scheduling (production processes)", "Algorithm", "Engineering", "Mathematics", "Automotive engineering" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2076-3417/12/21/10931/pdf?version=1666949260" }, { "id": "https://openalex.org/W4223656511", "doi": "10.1007/s00500-022-06999-9", "title": "A multiplier adjustment algorithm for a truck scheduling and transshipment problem at a cross-docking terminal", "year": 2022, "publication_date": "2022-04-10", "type": "article", "language": "en", "authors": [ "Maria Flavia Monaco", "Marcello Sammarra" ], "first_author": "Maria Flavia Monaco", "venue": "Soft Computing", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Lagrangian relaxation", "Transshipment (information security)", "Truck", "Heuristics", "Mathematical optimization", "Job shop scheduling", "Computer science", "Scheduling (production processes)", "Lagrange multiplier", "Algorithm", "Mathematics", "Engineering" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s00500-022-06999-9" }, { "id": "https://openalex.org/W4308882828", "doi": "10.1177/03611981221130332", "title": "Truck and Cross-Docking Scheduling in the Flower Export Sector in Colombia", "year": 2022, "publication_date": "2022-11-09", "type": "article", "language": "en", "authors": [ "Gonzalo Mejía", "Alfonso Tullio Sarmiento", "William J. Guerrero" ], "first_author": "Gonzalo Mejía", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "The Colombian flower sector accounts for approximately 4% of the country’s total exports. The logistics of flower exports involve urban or peri-urban internal transport to international airports. Trucks with flowers face major problems related to heavy traffic and long queues at the airport parking areas and unloading docks creating congestion and emissions. We study both a queue management system and a scheduling system for trucks, similar to those used in container terminals, with provisions for road traffic for realistic-sized problems. We used real data from our previous studies and from external sources to test our model. The results are discussed and analyzed, taking into consideration the constraints of the actual airport operations and the flower business. The results show that the current operation of the airport cargo terminal can be significantly improved with both queue management and scheduling systems. We finally discuss the implementation of these two systems.", "keywords": [ "Truck", "Queue", "Transport engineering", "Scheduling (production processes)", "International airport", "Traffic congestion", "Business", "Container (type theory)", "Operations research", "Computer science", "Operations management", "Engineering" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/10818/58694" }, { "id": "https://openalex.org/W3083731300", "doi": "10.1080/0305215x.2020.1808973", "title": "A hub-and-spoke architecture for a parcel delivery system using the cross-docking distribution strategy", "year": 2020, "publication_date": "2020-09-03", "type": "article", "language": "en", "authors": [ "Hamidreza Arbabi", "Mohammad Mahdi Nasiri", "Ali Bozorgi-Amiri" ], "first_author": "Hamidreza Arbabi", "venue": "Engineering Optimization", "publisher": "Taylor & Francis", "abstract": "Hamidreza Arbabi , Mohammad Mahdi Nasiri* & Ali Bozorgi-Amiri School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, IranCONTACT Mohammad Mahdi Nasiri mmnasiri@ut.ac.irThis article develops a hub-and-spoke architecture for a parcel delivery system using a network that includes a distribution centre and several cross-dock facilities. Several real-world assumptions, including an electric truck fleet, mobile charging station, third-party logistics, capacity constraints, last-mile deliveries and customer dissatisfaction, are incorporated in this problem. Besides, because of the high complexity of the problem, a novel matheuristic algorithm based on the combination of the fix-and-relax algorithm (FARA) and genetic algorithm (GA), namely Mb-FARGA, is developed to solve large-sized instances. A comprehensive computational analysis is accomplished to validate the proposed mathematical models and evaluate the performance of the Mb-FARGA method. According to the results, the Mb-FARGA method demonstrates a very favourable performance. Moreover, the results show that considering a distribution centre with appropriate capacity in the cross-docking system is an excellent strategy to enhance customer satisfaction, improve the system’s performance and reduce capacity shortages.", "keywords": [ "Architecture", "Engineering", "Docking (animal)", "Distribution (mathematics)", "Mathematics", "Geography", "Medicine" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://figshare.com/articles/journal_contribution/A_hub-and-spoke_architecture_for_a_parcel_delivery_system_using_the_cross-docking_distribution_strategy/12911651" }, { "id": "https://openalex.org/W2966668992", "doi": "10.5897/ajbm.9000660", "title": "Transportation problem of cross-docking network with three-dimensional trucks", "year": 2011, "publication_date": "2011-09-30", "type": "article", "language": "en", "authors": [ "Hadi Charkhgard", "Ali A. Yahya Tabar" ], "first_author": "Hadi Charkhgard", "venue": "AFRICAN JOURNAL OF BUSINESS MANAGEMENT", "publisher": "Academic Journals", "abstract": "A significant part of price of each product is related to distribution process. Therefore, by controlling this process, a good improvement will be observed in not only net profit of related company but also customer satisfaction. Cross-docking network is considered as a useful method for achieving to these goals. In this paper, transportation problem of cross-docking network is used in order to minimize the total cost for transferring the loads between origins and destinations. The three-dimensional shapes are applied for both trucks and loads. This assumption helps us to find the exact capacity of each truck in basis of each product. Thus, decision makers will find easily by which combinations and amount of products each truck will fill. This problem is formulated using a mixed integer non-linear programming (MINLP) and solved by a heuristic algorithm that simulated annealing (SA) is its core. Several numerical examples are solved, and the results show that this algorithm can find efficient solutions in comparison with exact algorithm.\r\n\r\n\t \r\n\r\n\tKey words: Cross-docking, transportation problem, mixed integer non-linear programming (MINLP), Heuristics algorithm, simulated annealing (SA).", "keywords": [ "Heuristics", "Truck", "Mathematical optimization", "Simulated annealing", "Computer science", "Integer programming", "Profit (economics)", "Operations research", "Algorithm", "Mathematics", "Engineering" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://academicjournals.org/journal/AJBM/article-abstract/392971720385" }, { "id": "https://openalex.org/W2082539461", "doi": "10.1080/00207543.2011.581006", "title": "Cross-dock job assignment problem in space-constrained industrial logistics distribution hubs with a single docking zone", "year": 2011, "publication_date": "2011-09-28", "type": "article", "language": "en", "authors": [ "K.L. Choy", "H.K.H. Chow", "T.C. Poon", "G.T.S. Ho" ], "first_author": "K.L. Choy", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "This paper addresses a cross-dock operations problem in space-constrained industrial logistics distribution hubs. In these hubs, the number of incoming trucks exceeds the number of docks available, and inbound trucks and orders arrive at random. The solution lies in minimising the waiting time of trucks by coordinating the pick up/delivery sequences of inbound and outbound orders in the storage zones. A mathematical model and a meta-heuristics algorithm, which is based on a genetic algorithm, are developed to address the problem. This research is innovative because the proposed algorithm allows the insertion of inbound orders that arrive at random into the schedule, without causing any significant disturbance to the original outbound order schedule. Computational experiments are conducted to examine the performance of the algorithm under heavy and normal cross-dock conditions. Results show that the algorithm reduces the total makespan of storage operations by 10% to 20% under heavy and normal conditions. The research study benefits manufacturers by increasing cross-docking efficiency in industrial logistics systems characterised by limited temporary storage capacity and the random arrival of inbound trucks.", "keywords": [ "Truck", "DOCK", "Heuristics", "Schedule", "Job shop scheduling", "Computer science", "Scheduling (production processes)", "Operations research", "Mathematical optimization", "Engineering", "Mathematics" ], "cited_by_count": 35, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2011.581006" }, { "id": "https://openalex.org/W4200113658", "doi": "10.1016/j.cie.2021.107869", "title": "Integrating vehicle scheduling and open routing decisions in a cross-docking center with multiple docks", "year": 2021, "publication_date": "2021-12-11", "type": "article", "language": "en", "authors": [ "Priscila Mara Cota", "Thiago Henrique Nogueira", "Angel Alejandro Juan", "Martı́n Gómez Ravetti" ], "first_author": "Priscila Mara Cota", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Heuristics", "Vehicle routing problem", "Computer science", "Mathematical optimization", "Scheduling (production processes)", "Metaheuristic", "Operations research", "Engineering", "Routing (electronic design automation)", "Computer network", "Mathematics", "Artificial intelligence" ], "cited_by_count": 27, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/1843/47023" }, { "id": "https://openalex.org/W4392713879", "doi": "10.1016/j.cor.2024.106604", "title": "Solution algorithms for dock scheduling and truck sequencing in cross-docks: A neural branch-and-price and a metaheuristic", "year": 2024, "publication_date": "2024-03-11", "type": "article", "language": "en", "authors": [ "Rahimeh Neamatian Monemi", "Shahin Gelareh", "Nelson Maculan" ], "first_author": "Rahimeh Neamatian Monemi", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Bottleneck", "Computer science", "Metaheuristic", "Mathematical optimization", "Theory of computation", "Integer programming", "Scheduling (production processes)", "Truck", "Heuristic", "Algorithm", "Artificial intelligence", "Mathematics" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2024.106604" }, { "id": "https://openalex.org/W1582407748", "doi": null, "title": "Scheduling truck arrivals and departures in a cross dock: earliness, tardiness and storage policies", "year": 2013, "publication_date": "2013-10-28", "type": "conference-paper", "language": "en", "authors": [ "Anne-Laure Ladier", "Gülgün Alpan" ], "first_author": "Anne-Laure Ladier", "venue": "HAL (Le Centre pour la Communication Scientifique Directe)", "publisher": "Centre National de la Recherche Scientifique", "abstract": "International audience", "keywords": [ "Tardiness", "Truck", "Heuristics", "Pallet", "Computer science", "Scheduling (production processes)", "Integer programming", "Schedule", "Operations research", "Job shop scheduling", "Time horizon", "Mathematical optimization" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hal.science/hal-00946531" }, { "id": "https://openalex.org/W3089613704", "doi": "10.1016/j.ijpe.2020.107932", "title": "Deterioration rate variation risk for sustainable cross-docking service operations", "year": 2020, "publication_date": "2020-10-01", "type": "article", "language": "en", "authors": [ "Fei Pan", "Wei Zhou", "Tijun Fan", "Shuxia Li", "Chong Zhang" ], "first_author": "Fei Pan", "venue": "International Journal of Production Economics", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Operations research", "Scheduling (production processes)", "Docking (animal)", "Risk analysis (engineering)", "Business", "Operations management", "Engineering" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ijpe.2020.107932" }, { "id": "https://openalex.org/W2921263778", "doi": "10.5829/ije.2019.32.02b.15", "title": "Truck Scheduling in a Cross-Docking Terminal by Using Novel Robust Heuristics", "year": 2019, "publication_date": "2019-02-01", "type": "article", "language": "en", "authors": [ "Iman Seyedi", "Hamedi M.", "Reza R. Tavakkoli-Moghaddam" ], "first_author": "Iman Seyedi", "venue": "International Journal of Engineering", "publisher": "Materials and Energy Research Center", "abstract": "Nowadays, one of the major goals of the distribution environment is to reduce lead times and inventories. Cross-docking is a logistics technique which removes the storage and picking up the functions of a warehouse. The term cross-docking refers to moving products directly from incoming to outgoing trailers with little or no storage in between. According to the recent related papers, the truck scheduling problem is one of the objectives for cross-docking systems which is divided into smaller parts. The first stage is about the assignment of the trucks to the dock doors while the second stage aims to sequence all inbound and outbound trucks, in an effective way. Therefore, for dealing with the truck scheduling problem in a cross-docking system, this paper develops five heuristics. The obtained results are compared with those from the previous works. We use many test problems in the literature that were created in different sizes to study the performance of the novel heuristics. In small and medium dimensions the minimum value which found is related to one of the methods CDH3 (Cross Dock Heuristic) which has been proposed in this paper beside in all scales the method CDH4 is the best among others. The numerical results show that the developed heuristics are able to find quick good solutions with fast convergence.", "keywords": [ "Heuristics", "Truck", "Computer science", "Scheduling (production processes)", "Doors", "DOCK", "Mathematical optimization", "Material handling", "Operations research", "Engineering", "Industrial engineering", "Mathematics" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/10281/553040" }, { "id": "https://openalex.org/W2345238855", "doi": null, "title": "Truck scheduling problem in a cross-docking system with release time constraint", "year": 2016, "publication_date": "2016-07-01", "type": "article", "language": "en", "authors": [ "Jamal Arkat", "Parak Qods", "Fardin Ahmadizar" ], "first_author": "Jamal Arkat", "venue": "Journal of industrial and systems 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 study, we consider the scheduling problem of inbound and outbound trucks with multiple dock doors, aiming at the minimization of the makespan. The considered scheduling problem determines where and when the trucks must be processed; also due to the interchangeability specification of products, product assignment is done simultaneously as well. Inbound trucks enter the system according to their release times, however, there is no mandatory time constraint for outbound truck presence at a designated stack door; they should just observe their relative docking sequences. Moreover, a loading sequence is determined for each of the outbound trucks. In this research, a mathematical model is derived to find the optimal solution. Since the problem under study is NP-hard, a simulated annealing algorithm is adapted to find the (near-) optimal solution, as the mathematical model will not be applicable to solve large-scale real-world cases. Numerical examples have been done in order to specify the efficiency of the metaheuristic algorithm in comparison with the results obtained from solving the mathematical model.", "keywords": [ "Truck", "Computer science", "Job shop scheduling", "Scheduling (production processes)", "Mathematical optimization", "Simulated annealing", "Minification", "Operations research", "Algorithm", "Automotive engineering", "Engineering", "Mathematics" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.jise.ir/article_14558_314cd2b5606e6909af6179dd13f06cf3.pdf" }, { "id": "https://openalex.org/W4312746739", "doi": "10.1109/tits.2022.3215084", "title": "Tabu-Based Adaptive Large Neighborhood Search for Multi-Depot Petrol Station Replenishment With Open Inter-Depot Routes", "year": 2022, "publication_date": "2022-11-03", "type": "article", "language": "en", "authors": [ "Ada Che", "Wenjia Wang", "Xiaohu Mu", "Yipei Zhang", "Jianguang Feng" ], "first_author": "Ada Che", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "The petrol station replenishment problem (PSRP) refers to the process of transporting petroleum products from oil depots to petrol stations via tank trucks. It mainly consists of two parts: allocating petroleum products to tank trucks and planning the travel route of each truck. In this study, we examine a new variant of PSRP by considering a multi-depot vehicle routing problem with open inter-depot routes (MDVRPOI). Each depot can act as an intermediate replenishment facility, and each truck can be reloaded at any depot any number of times within the working period. Moreover, trucks can end their routes at any depot instead of making a long empty drive to the start depot. The trucks are heterogeneous with multiple load-specific compartments. We formulate the problem as a mixed-integer linear programming (MILP) model. Given the problem’s complexity, a tabu-based adaptive large neighborhood search (T-ALNS) algorithm is proposed, which integrates the tabu search approach into ALNS to solve the problem effectively. The T-ALNS executes multiple problem-tailored destroy/repair operators on the station, trip, and route levels. A local search procedure with problem-specific operators and an adaptive strategy is further embedded into T-ALNS. We use the real data of an oil company in China to evaluate our algorithm. Computational results show that our T-ALNS significantly outperforms the CPLEX solver and other algorithms in terms of solution quality and computation time. Further, it realizes an average reduction in transportation cost of about 45% compared to the company’s actual strategy.", "keywords": [ "Depot", "Tabu search", "Computer science", "Transport engineering", "Engineering", "Mathematical optimization", "Geography", "Artificial intelligence", "Mathematics" ], "cited_by_count": 33, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2022.3215084" }, { "id": "https://openalex.org/W1752328018", "doi": "10.1016/j.cie.2015.09.008", "title": "A novel dynamic genetic algorithm-based method for vehicle scheduling in cross docking systems with frequent unloading operation", "year": 2015, "publication_date": "2015-09-30", "type": "article", "language": "en", "authors": [ "Ali Mohtashami" ], "first_author": "Ali Mohtashami", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Initialization", "Crossover", "Genetic algorithm", "Truck", "Turnaround time", "Computer science", "Scheduling (production processes)", "DOCK", "Algorithm", "Engineering", "Real-time computing", "Automotive engineering" ], "cited_by_count": 33, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2015.09.008" }, { "id": "https://openalex.org/W2955399850", "doi": "10.24425/bpas.2019.128113", "title": "Scheduling trucks in a multi-door cross-docking system with time windows", "year": 2019, "publication_date": "2019-04-30", "type": "article", "language": "en", "authors": [ "Gökçe Özden", "İnci Sarıçiçek" ], "first_author": "Gökçe Özden", "venue": "Bulletin of the Polish Academy of Sciences Technical Sciences", "publisher": "De Gruyter Open", "abstract": "Cross-docking is a strategy that distributes products directly from a supplier or manufacturing plant to a customer or retail chain, reducing handling or storage time. This study focuses on the truck scheduling problem, which consists of assigning each truck to a door at the dock and determining the sequences for the trucks at each door considering the time-window aspect. The study presents a mathematical model for door assignment and truck scheduling with time windows at multi-door cross-docking centers. The objective of the model is to minimize the overall earliness and tardiness for outbound trucks. Simulated annealing (SA) and tabu search (TS) algorithms are proposed to solve large-sized problems. The results of the mathematical model and of meta-heuristic algorithms are compared by generating test problems for different sizes. A decision support system (DSS) is also designed for the truck scheduling problem for multi-door cross-docking centers. Computational results show that TS and SA algorithms are efficient in solving large-sized problems in a reasonable time.", "keywords": [ "Tardiness", "Truck", "Tabu search", "Simulated annealing", "Scheduling (production processes)", "Computer science", "Job shop scheduling", "Material handling", "Mathematical optimization", "Engineering", "Algorithm", "Industrial engineering" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "http://journals.pan.pl/Content/111778/PDF/20_349-362_00812_Bpast.No.67-2_06.02.20.pdf" }, { "id": "https://openalex.org/W2402121692", "doi": "10.1080/00207543.2016.1184346", "title": "Two-stage optimisation method for material flow and allocation management in cross-docking networks", "year": 2016, "publication_date": "2016-05-17", "type": "article", "language": "en", "authors": [ "İlker Küçükoğlu", "Nursel Öztürk" ], "first_author": "İlker Küçükoğlu", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "Cross-docking is a relatively new logistics strategy in which items are moved from suppliers to customers through cross-docking centres without putting them into long-term storage. An important decision during the planning of cross-docking operations is related to the material flow management in the network, which has great potential to reduce transportation costs. However, until now, there has been a lack of studies regarding operations for both transportation of trucks between locations and trans-shipment of items in cross-docking centres. This study presents a novel two-stage mixed integer linear mathematical model for the transportation problem of cross-docking network design integrated with truck–door assignments to minimise total transportation costs from suppliers to customers. This model also considers incoming/outgoing truck-loading plans and product allocations in the cross-docking area with regard to the two-dimensional physical constraints. Due to the complexity of the problem, a genetic algorithm (GA) is proposed to solve large-sized problems. Computational studies are conducted to examine the validity of the two-stage model and performance of the GA. The computational studies show that the introduced model provides a comprehensive plan for material flow management in cross-docking networks and proposed GA is capable of obtaining effective results for the problem within a short computational time.", "keywords": [ "Truck", "Docking (animal)", "Flow network", "Network planning and design", "Computer science", "Integer programming", "Genetic algorithm", "Operations research", "Mathematical optimization", "Engineering", "Computer network", "Mathematics" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2016.1184346" }, { "id": "https://openalex.org/W2910105989", "doi": "10.1016/j.cie.2019.01.020", "title": "Multiple traveling salesman problem with drones: Mathematical model and heuristic approach", "year": 2019, "publication_date": "2019-01-10", "type": "article", "language": "en", "authors": [ "Patchara Kitjacharoenchai", "Mario Ventresca", "Mohammad Moshref‐Javadi", "Seokcheon Lee", "Jose M. A. Tanchoco", "Patrick A. Brunese" ], "first_author": "Patchara Kitjacharoenchai", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Truck", "Heuristics", "Travelling salesman problem", "Computer science", "Integer programming", "Heuristic", "Operations research", "Delivery Performance", "Mathematical optimization", "Engineering", "Transport engineering" ], "cited_by_count": 406, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2019.01.020" }, { "id": "https://openalex.org/W2565707879", "doi": "10.2172/1311404", "title": "Plug-In Hybrid Urban Delivery Truck Technology Demonstration", "year": 2015, "publication_date": "2015-07-31", "type": "report", "language": "en", "authors": [ "Matt Miyasato", "Joseph Impllitti", "Pascal Amar" ], "first_author": "Matt Miyasato", "venue": null, "publisher": null, "abstract": "The I-710 and CA-60 highways are key transportation corridors in the Southern California region that are heavily used on a daily basis by heavy duty drayage trucks that transport the cargo from the ports to the inland transportation terminals. These terminals, which include store/warehouses, inland-railways, are anywhere from 5 to 50 miles in distance from the ports. The concentrated operation of these drayage vehicles in these corridors has had and will continue to have a significant impact on the air quality in this region whereby significantly impacting the quality of life in the communities surrounding these corridors. To reduce these negative impacts it is critical that zero and near-zero emission technologies be developed and deployed in the region. A potential local market size of up to 46,000 trucks exists in the South Coast Air Basin, based on near- dock drayage trucks and trucks operating on the I-710 freeway. The South Coast Air Quality Management District (SCAQMD), California Air Resources Board (CARB) and Southern California Association of Governments (SCAG) — the agencies responsible for preparing the State Implementation Plan required under the federal Clean Air Act — have stated that to attain federal air quality standards the region will need to transition to broad use of zero and near zero emission energy sources in cars, trucks and other equipment (Southern California Association of Governments et al, 2011). SCAQMD partnered with Volvo Trucks to develop, build and demonstrate a prototype Class 8 heavy-duty plug-in hybrid drayage truck with significantly reduced emissions and fuel use. Volvo’s approach leveraged the group’s global knowledge and experience in designing and deploying electromobility products. The proprietary hybrid driveline selected for this proof of concept was integrated with multiple enhancements to the complete vehicle in order to maximize the emission and energy impact of electrification. A detailed review of all technologies included in the demonstrator is presented in this report. The project was completed in July 2015 with a final demonstration of the concept vehicle on a simulated drayage route around Volvo’s North American headquarters in Greensboro, NC. The route included all traffic conditions typical of drayage operation in Southern California as well as geofences defined to showcase the zero emission capabilities of the truck. The demonstrator successfully completed four consecutive trips with a gross combined vehicle weight of 44,000 lb., covering approximately 2 miles out of a total distance of 9 miles per trip in the Zero Emission (ZE) geofence. This vehicle is expected to use approximately 30% less fuel than a typical drayage truck in daily operation, and it is designed to allow full electric operation whenever operating in a marine terminal in the ports of Los Angeles / Long Beach. A paper study on the feasibility of expanding the capabilities of the plug-in hybrid concept developed as part of this project was also delivered as an addendum to the regular progress reports.", "keywords": [ "Truck", "Air quality index", "Transport engineering", "Heavy duty", "Environmental science", "Engineering", "Geography", "Meteorology", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.osti.gov/servlets/purl/1311404" }, { "id": "https://openalex.org/W2800129407", "doi": "10.1155/2018/7913256", "title": "Improved Harmony Search Algorithm for Truck Scheduling Problem in Multiple-Door Cross-Docking Systems", "year": 2018, "publication_date": "2018-01-01", "type": "article", "language": "en", "authors": [ "Zhanzhong Wang", "Yue Qun Lu", "Liying Zhao", "Ningbo Cao" ], "first_author": "Zhanzhong Wang", "venue": "Discrete Dynamics in Nature and Society", "publisher": "Hindawi Publishing Corporation", "abstract": "The key of realizing the cross docking is to design the joint of inbound trucks and outbound trucks, so a proper sequence of trucks will make the cross-docking system much more efficient and need less makespan. A cross-docking system is proposed with multiple receiving and shipping dock doors. The objective is to find the best door assignments and the sequences of trucks in the principle of products distribution to minimize the total makespan of cross docking. To solve the problem that is regarded as a mixed integer linear programming (MILP) model, three metaheuristics, namely, harmony search (HS), improved harmony search (IHS), and genetic algorithm (GA), are proposed. Furthermore, the fixed parameters are optimized by Taguchi experiments to improve the accuracy of solutions further. Finally, several numerical examples are put forward to evaluate the performances of proposed algorithms.", "keywords": [ "Harmony search", "Truck", "Computer science", "Job shop scheduling", "Metaheuristic", "Mathematical optimization", "Docking (animal)", "Algorithm", "Integer programming", "Mathematics", "Artificial intelligence", "Schedule" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "http://downloads.hindawi.com/journals/ddns/2018/7913256.pdf" }, { "id": "https://openalex.org/W2074089310", "doi": "10.1007/s10845-014-1014-4", "title": "Crossdock truck scheduling with time windows: earliness, tardiness and storage policies", "year": 2014, "publication_date": "2014-12-10", "type": "article", "language": "en", "authors": [ "Anne-Laure Ladier", "Gülgün Alpan" ], "first_author": "Anne-Laure Ladier", "venue": "Journal of Intelligent Manufacturing", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Tardiness", "Heuristics", "Truck", "Tabu search", "Pallet", "Computer science", "Mathematical optimization", "Scheduling (production processes)", "Schedule", "Job shop scheduling", "Integer programming", "Operations research" ], "cited_by_count": 51, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10845-014-1014-4" }, { "id": "https://openalex.org/W639199811", "doi": null, "title": "COMPETITIVE ISSUES IN INTERMODAL RAILROAD-TRUCK SERVICE", "year": 1993, "publication_date": "1993-01-01", "type": "article", "language": "en", "authors": [ "Donald V. Harper", "Philip T. Evers" ], "first_author": "Donald V. Harper", "venue": "Transportation Journal", "publisher": "Penn State University Press", "abstract": "Intermodal railroad-truck (IRT) service is where one or more motor carriers provide the short-haul pickup and delivery service (drayage) part of the trip and one or more railroads provide the long-haul or line-haul part. IRT is used for both domestic and international movements. IRT combines the door-to-door convenience of trucks with the high-volume, long-haul economies of railroads. The potential advantages of IRT for the shipper are that, when compared with alternative services, transit time may be reduced and rates lowered. In addition, because IRT represents competition to other modes, it can have the effect of improving service and lowering rates offered by other modes.", "keywords": [ "Truck", "Transport engineering", "Service (business)", "Competition (biology)", "Traffic volume", "Level of service", "Business", "Transit (satellite)", "Engineering", "Public transport", "Marketing", "Automotive engineering" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/378767" }, { "id": "https://openalex.org/W3211974003", "doi": "10.1016/j.ifacol.2021.08.175", "title": "Multi-objective Truck Scheduling in a Physical Internet Road-Road Cross-docking Hub", "year": 2021, "publication_date": "2021-01-01", "type": "article", "language": "en", "authors": [ "Tarik Chargui", "Abdelghani Bekrar", "Mohamed Reghioui", "Damien Trentesaux" ], "first_author": "Tarik Chargui", "venue": "IFAC-PapersOnLine", "publisher": "Elsevier BV", "abstract": "Aiming towards a sustainable supply chain, Physical Internet (PI) has been presented as a global logistics network with standardized PI-containers. PI-nodes, and more specifically PI-hubs, are one of the key elements of the Physical Internet concept. This paper focuses on optimising operations in the Road-Road PI-hub, which was not addressed in the Physical Internet literature. Road-Road PI-hubs are designed to transfer PI-containers between suppliers’ and customers’ trucks. The objective is to minimize both the inbound/outbound trucks delays and the energy consumption during the transferring of PI-containers using PI-conveyors. The problem is formulated as a multi-objective mixed integer model (MO-MIP) to find the optimal Pareto front. The mathematical model is tested on an illustrative instance to show the tradeoff between trucks’ delays and PI-containers routing energy consumption. The primary goal of this paper is to provide a prospect to start optimizing PI-hubs by suggesting a multi-objective mathematical model as a beginning for future researches on the Road-Road PI-hubs.", "keywords": [ "Truck", "The Internet", "Computer science", "Transport engineering", "Integer programming", "Energy consumption", "Scheduling (production processes)", "Key (lock)", "Road transport", "Vehicle routing problem", "Routing (electronic design automation)", "Operations research" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ifacol.2021.08.175" }, { "id": "https://openalex.org/W2099188594", "doi": "10.1007/978-0-387-71921-4_4", "title": "Log-Truck Scheduling with a Tabu Search Strategy", "year": 2007, "publication_date": "2007-08-11", "type": "book-chapter", "language": "en", "authors": [ "Manfred Gronalt", "Patrick Hirsch" ], "first_author": "Manfred Gronalt", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Truck", "Tabu search", "Heuristics", "Scheduling (production processes)", "Transport engineering", "Job shop scheduling", "Computer science", "Engineering", "Operations research", "Mathematical optimization", "Operations management", "Mathematics" ], "cited_by_count": 39, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-0-387-71921-4_4" }, { "id": "https://openalex.org/W2243355485", "doi": "10.1109/iesm.2015.7380232", "title": "Integrating truck scheduling and employee rostering in a cross-docking platform - an iterative approach", "year": 2015, "publication_date": "2015-10-01", "type": "conference-paper", "language": "en", "authors": [ "Anne-Laure Ladier", "Gülgün Alpan" ], "first_author": "Anne-Laure Ladier", "venue": null, "publisher": null, "abstract": "In a cross-docking platform, goods are unloaded, transferred and reloaded into trucks with little or no storage in between. The crossdock truck scheduling problem addresses the hard problem of coordinating the truck operations. However, crossdock operations are mostly done manually: it is therefore important to take staffing issues into account while building the truck schedule. This article shows how a truck scheduling model and an employee timetabling and rostering model can be combined to address both problems in an integrated manner. Three approaches are compared. The sequential approach consists in sequentially solving the two problems: from the truck schedule calculated first, a workload is deduced and used as input for the employee timetabling and rostering process. The iterative approach consists in solving both problems one after another in an iterative manner until a stable point is reached. Two iterative procedures are proposed, employees-first and trucks-first.", "keywords": [ "Computer science", "Scheduling (production processes)", "Truck", "Docking (animal)", "Job shop scheduling", "Embedded system", "Engineering", "Automotive engineering", "Operations management" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/iesm.2015.7380232" }, { "id": "https://openalex.org/W2961496699", "doi": "10.1504/ijlsm.2019.10022658", "title": "Truck scheduling problems in the cross docking network", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Piya Hengmeechai", "Takashi Irohara", "Warisa Wisittipanich" ], "first_author": "Piya Hengmeechai", "venue": "International Journal of Logistics Systems and Management", "publisher": "Inderscience Publishers", "abstract": "Cross docking is a logistic management strategy for reducing storage level, inventory management cost, and customer delivery lead-time. In the large distribution network in which products are transferred through one or more cross docks, the decision of whether to synchronise inbound and outbound trucks for the whole network is crucial since it significantly impacts on supply chain performance. This study presents the novel mathematical model of truck scheduling problem in the cross docking network consisting of several cross docks and addresses the importance of synchronising the truck schedule in a network as a whole. The model is formulated as mixed integer programming (MIP) with an objective to find the optimal truck schedule and product transshipment to minimise the makespan. The results demonstrate that simultaneously optimising truck schedule throughout the network improves the solution quality compared to those obtained from models, that optimise the truck schedule in each cross dock sequentially.", "keywords": [ "Truck", "Computer science", "Scheduling (production processes)", "Operations management", "Operations research", "Automotive engineering", "Engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijlsm.2019.10022658" }, { "id": "https://openalex.org/W4403509869", "doi": "10.1007/s13198-024-02516-3", "title": "A novel approach for multi-objective truck scheduling problems in a cross-docking center", "year": 2024, "publication_date": "2024-10-17", "type": "article", "language": "en", "authors": [ "Nasim Abdoli", "Aram Bahrini", "Robert J. Riggs" ], "first_author": "Nasim Abdoli", "venue": "International Journal of Systems Assurance Engineering and Management", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Docking (animal)", "Scheduling (production processes)", "Computer science", "Engineering", "Automotive engineering", "Medicine", "Operations management" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s13198-024-02516-3" }, { "id": "https://openalex.org/W4406748871", "doi": "10.1016/j.tre.2025.103974", "title": "Multi-agent deep reinforcement learning-based truck-drone collaborative routing with dynamic emergency response", "year": 2025, "publication_date": "2025-01-23", "type": "article", "language": "en", "authors": [ "Wenhao Peng", "Dujuan Wang", "Yunqiang Yin", "T.C.E. Cheng" ], "first_author": "Wenhao Peng", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Reinforcement learning", "Truck", "Drone", "Emergency response", "Reinforcement", "Routing (electronic design automation)", "Computer science", "Transport engineering", "Engineering", "Artificial intelligence", "Automotive engineering", "Medical emergency" ], "cited_by_count": 75, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2025.103974" }, { "id": "https://openalex.org/W2787110389", "doi": "10.1007/978-3-319-73751-5_24", "title": "Simulation for PI-Hub Cross-Docking Robustness", "year": 2018, "publication_date": "2018-01-01", "type": "book-chapter", "language": "en", "authors": [ "Tarik Chargui", "Abdelghani Bekrar", "Mohamed Reghioui", "Damien Trentesaux" ], "first_author": "Tarik Chargui", "venue": "Studies in computational intelligence", "publisher": "Springer Nature", "abstract": null, "keywords": [ "DOCK", "Truck", "Robustness (evolution)", "Computer science", "The Internet", "Simulation", "Engineering", "Automotive engineering", "Operating system" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-73751-5_24" }, { "id": "https://openalex.org/W2170951393", "doi": "10.1287/trsc.1120.0454", "title": "Designing Production-Inventory-Transportation Systems with Capacitated Cross-Docks", "year": 2013, "publication_date": "2013-03-29", "type": "article", "language": "en", "authors": [ "Hossein Abouee‐Mehrizi", "Oded Berman", "M. Reza Baharnemati" ], "first_author": "Hossein Abouee‐Mehrizi", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "We consider a two-echelon supply chain problem, where the demand of a set of retailers is satisfied from a set of suppliers and shipped through a set of capacitated cross-docks that are to be established. The objective is to determine the number and location of cross-docks and the assignment of retailers to suppliers via cross-docking so that the total cost of pipeline and retailers inventory, transportation, and facility location is minimized. We formulate the problem as a nonlinear mixed integer programming. We first derive several structural results for special cases of the problem. We also demonstrate that the Capacitated Plant Fixed-Charge Transport Location Problem is a special case of our problem. To solve the general problem, we show that it can be written as a cutting stock problem and develop a column generation algorithm to solve it. We investigate the efficiency of the proposed algorithm numerically. We then extend the problem by allowing different truck capacities as decision variables.", "keywords": [ "Column generation", "Truck", "Mathematical optimization", "Integer programming", "Cutting stock problem", "Safety stock", "Supply chain", "Transportation theory", "Facility location problem", "Computer science", "Operations research", "Fixed charge" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.1120.0454" }, { "id": "https://openalex.org/W4405319428", "doi": "10.1049/icp.2024.3761", "title": "Assessing flexibility in battery electric truck charging depots considering grid impact", "year": 2024, "publication_date": "2024-12-12", "type": "conference-paper", "language": "en", "authors": [ "Simon Decher", "Hans Schäfers" ], "first_author": "Simon Decher", "venue": "IET conference proceedings.", "publisher": "Institution of Engineering and Technology", "abstract": "This work describes the methodology and used data to analyze the effects of charging infrastructure on service depot of Battery Electric Trucks (BETs), to quantify its potential flexibility and discuss pros and cons of Electric Vehicle Supply Equipment (EVSE) with minimized charging power. The BET will be charged on their service depot during shift change, over night or other off-duty periods. This leads to heavy load on the corresponding network infrastructure but also offers the opportunity to provide flexibility for the energy system. Quantifying the load is done by analyzing existing BET data of uncontrolled and managed charging operations and enriching it with scenario simulations. Real world data from heavy duty refuse collection vehicles as well as logistic long-haul and short distance trucks is used. The analysis quantifies flexibility potentials of service depots, which can be used to reduce the impact on infrastructure and to optimize charging costs. A short literature review is provided for contextualization. The endeavors take place in a German city.", "keywords": [ "Truck", "Flexibility (engineering)", "Battery (electricity)", "Grid", "Automotive engineering", "Environmental science", "Engineering", "Computer science", "Economics", "Power (physics)", "Physics" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1049/icp.2024.3761" }, { "id": "https://openalex.org/W3026363334", "doi": "10.1287/trsc.2019.0943", "title": "A Hybrid Metaheuristic for Single Truck and Trailer Routing Problems", "year": 2020, "publication_date": "2020-05-18", "type": "article", "language": "en", "authors": [ "Luca Accorsi", "Daniele Vigo" ], "first_author": "Luca Accorsi", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "In this paper, we propose a general solution approach for a broad class of vehicle routing problems that all use a single vehicle, composed of a truck and a detachable trailer, to serve a set of customers with known demand and accessibility constraints. A more general problem, called the extended single truck and trailer routing problem (XSTTRP), is used as a common baseline to describe and model this class of problems. In particular, the XSTTRP contains, all together, a variety of vertex types previously considered only separately: truck customers, vehicle customers with and without parking facilities, and parking-only locations. To solve the XSTTRP, we developed a fast and effective hybrid metaheuristic, consisting of an iterative core part, in which routes that define high-quality solutions are stored in a pool. Eventually, a set-partitioning-based postoptimization selects the best combination of routes that forms a feasible solution from the pool. The algorithm is tested on extensively studied problems from the literature, such as the multiple depot vehicle routing problem, the location routing problem, the single truck and trailer routing problem with satellite depots, and the single truck and trailer routing problem. Finally, computational results and a thorough analysis of the main algorithm’s components on newly designed XSTTRP instances are provided. The obtained results show that the proposed hybrid metaheuristic is highly competitive with previous approaches designed to solve specific specialized problems, both in terms of computing time and solution quality.", "keywords": [ "Truck", "Metaheuristic", "Trailer", "Computer science", "Routing (electronic design automation)", "Vehicle routing problem", "Mathematical optimization", "Set (abstract data type)", "Engineering", "Computer network", "Algorithm", "Mathematics" ], "cited_by_count": 40, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/11585/796558" }, { "id": "https://openalex.org/W3131729178", "doi": "10.1007/s10878-021-00707-3", "title": "Heuristics for cross-docking scheduling of truck arrivals, truck departures and shop-floor operations", "year": 2021, "publication_date": "2021-02-17", "type": "article", "language": "en", "authors": [ "Feifeng Zheng", "Yaxin Pang", "Yinfeng Xu" ], "first_author": "Feifeng Zheng", "venue": "Journal of Combinatorial Optimization", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Truck", "Heuristics", "Solver", "Scheduling (production processes)", "Job shop scheduling", "Computer science", "Mathematical optimization", "Greedy algorithm", "Theory of computation", "Heuristic", "Genetic algorithm", "Algorithm" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10878-021-00707-3" }, { "id": "https://openalex.org/W4320719833", "doi": "10.1016/j.jenvman.2022.117071", "title": "Allocation of products to a heterogeneous fleet of trucks in a cross-docking center based on carbon emissions and costs in food and beverage industry: Novel uncertain solution approaches", "year": 2023, "publication_date": "2023-02-14", "type": "article", "language": "en", "authors": [ "Mohsen Rajabzadeh", "Seyed Meysam Mousavi" ], "first_author": "Mohsen Rajabzadeh", "venue": "Journal of Environmental Management", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Integer programming", "Operations research", "Scheduling (production processes)", "Computer science", "Weighting", "Schedule", "Linear programming", "Pareto principle", "Purchasing", "Mathematical optimization", "Operations management" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.jenvman.2022.117071" }, { "id": "https://openalex.org/W4392162136", "doi": "10.3390/wevj15030084", "title": "Multi-Use Optimization of a Depot for Battery-Electric Heavy-Duty Trucks", "year": 2024, "publication_date": "2024-02-26", "type": "article", "language": "en", "authors": [ "Florian Biedenbach", "Kai Strunz" ], "first_author": "Florian Biedenbach", "venue": "World Electric Vehicle Journal", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Battery-electric trucks offer a high battery capacity and good predictability, making them attractive for the implementation of bidirectional charging strategies. Nevertheless, most of the previous charging strategy studies focus on electric passenger cars. These charging strategies are usually formulated as separate use cases like tariff-optimized charging, arbitrage trading, peak shaving, and self-consumption optimization. By combining different use cases, their economic potential can be increased. In this paper, we introduce a model to optimize charging processes in depots for electric vehicles considering the combination of different use cases. This model is applied to a depot for battery-electric trucks. The savings obtained through optimized bidirectional charging highlight the enormous potential of this technology for the future, especially in the heavy-duty sector.", "keywords": [ "Truck", "Heavy duty", "Battery (electricity)", "Automotive engineering", "Depot", "Computer science", "Engineering" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2032-6653/15/3/84/pdf?version=1708942730" }, { "id": "https://openalex.org/W4383956750", "doi": "10.1016/j.sca.2023.100028", "title": "A multi-agent-based real-time truck scheduling model for cross-docking problems with single inbound and outbound doors", "year": 2023, "publication_date": "2023-07-11", "type": "article", "language": "en", "authors": [ "Bilge Torbali", "Gülgün Alpan" ], "first_author": "Bilge Torbali", "venue": "Supply Chain Analytics", "publisher": "Elsevier BV", "abstract": "Cross-docking is a logistics methodology employed in warehouses to gain a competitive advantage by consolidating and transferring freights directly from an inbound supplier to an outbound client with no or restricted storage. Real-time data processing is required for fast synchronisation of inflows and outflows. This study develops a real-time multi-agent truck scheduling model for single inbound-single outbound cross-docking for fast synchronisation of inflows and outflows. The proposed model exploits the autonomous, reactive, and distributed responsibility characteristics of the multi-agent systems to realise shared computation and respond flexible responses to dynamic events. This type of model is novel in the cross-docking literature for scheduling of both inbound and outbound trucks. The responsiveness of the proposed model is evaluated by employing a combination of different traffic levels based on truck arrival times. Furthermore, various truck-to-door assignment strategies are implemented to achieve the best performance based on key performance indicators such as the average stock level, the number of late pallets, the pallet delay and the outbound truck fill rate. To validate the experimental results, ANOVA (analysis of variance) is performed. The analysis demonstrates that the stock policy (SP) outperforms all the others by sustaining low stock levels and high on-time deliveries and truck fill rates across all traffic levels, while the time-related strategies are adequate for cases where outbound traffic is more elevated than inbound traffic.", "keywords": [ "Truck", "Doors", "Computer science", "Scheduling (production processes)", "Pallet", "Stock (firearms)", "Real-time computing", "Operations research", "Automotive engineering", "Engineering", "Operating system", "Operations management" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.sca.2023.100028" }, { "id": "https://openalex.org/W3130776483", "doi": "10.1016/j.ejor.2021.02.031", "title": "Inbound and outbound flow integration for cross-docking operations", "year": 2021, "publication_date": "2021-02-16", "type": "article", "language": "en", "authors": [ "Marc‐Antoine Coindreau", "Olivier Gallay", "Nicolas Zufferey", "Gilbert Laporte" ], "first_author": "Marc‐Antoine Coindreau", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Container (type theory)", "Computer science", "Time horizon", "Scheduling (production processes)", "Operations research", "Material flow", "Integer programming", "Mathematical optimization", "Engineering", "Automotive engineering", "Mathematics" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://repositorio.unal.edu.co/handle/unal/80606" } ]