[ { "id": "https://openalex.org/W2948299976", "doi": "10.1007/s10100-019-00627-y", "title": "Effectiveness of carbon pricing policies for promoting urban freight electrification: analysis of last mile delivery in Madrid", "year": 2019, "publication_date": "2019-06-05", "type": "article", "language": "en", "authors": [ "José Luis Arroyo Barrigüete", "Ángel Felipe", "M. Teresa Ortuño", "Gregorio Tirado" ], "first_author": "José Luis Arroyo Barrigüete", "venue": "Central European Journal of Operations Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Electrification", "Subsidy", "Incentive", "Environmental economics", "Carpool", "Last mile (transportation)", "Leapfrogging", "Computer science", "Sustainable transport", "Greenhouse gas", "Electric vehicle", "Vehicle routing problem" ], "cited_by_count": 33, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10100-019-00627-y" }, { "id": "https://openalex.org/W2909494050", "doi": "10.5604/01.3001.0012.8363", "title": "An advanced planner for urban freight delivering", "year": 2018, "publication_date": "2018-12-31", "type": "article", "language": "en", "authors": [ "Antonio Comi", "Berta Buttarazzi", "Massimiliano Maria Schiraldi", "Rosy Innarella", "Martina Varisco", "Paolo TRAINI" ], "first_author": "Antonio Comi", "venue": "Archives of Transport", "publisher": "Index Copernicus International S.A.", "abstract": "The paper aims at introducing an advanced delivery tour planner to support operators in urban delivery operations through a combined approach which chooses delivery bays and delivery time windows while optimizing the delivery routes. After a literature review on tools for the management and the control of the delivery system implemented for optimizing the usage of on-street delivery bays, a prototypical tour delivery planner is described. The tool allows transport and logistics operators to book the delivery bays and to have real-time suggestions on the delivery tour to follow, through the minimization of the total delivery time. Currently, at development phase, the tool has been tested in a target zone, considering the road network and time/city delivering constraints and real-time data about vehicles location, traffic and delivery bay availability. The tool identifies the possible tours based on the delivery preferences, ranks the possible solutions according to the total route time based on information on the road network (i.e. travel time forecasts), performs a further optimization to reduce the total travel times and presents the user the best alternative along with the indications of which delivery bay to use in each delivery stop. The developed prototype is composed by two main parts: a web application that manages communication between the database and the road network simulation, and, an Android mobile App that supports transport and logistic operators in managing their delivering, pre trip and en route, showing and updating routing based on real-time information.", "keywords": [ "Planner", "Computer science", "Vehicle routing problem", "Transport engineering", "Real-time data", "Android (operating system)", "Routing (electronic design automation)", "Operations research", "Engineering", "Computer network", "World Wide Web", "Operating system" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5604/01.3001.0012.8363" }, { "id": "https://openalex.org/W2883026175", "doi": "10.1016/j.tranpol.2018.06.010", "title": "Minimization of urban freight distribution lifecycle CO2e emissions: Results from an optimization model and a real-world case study", "year": 2018, "publication_date": "2018-07-26", "type": "article", "language": "en", "authors": [ "Miguel Figliozzi", "Jesus Saenz", "Javier Faulín" ], "first_author": "Miguel Figliozzi", "venue": "Transport Policy", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Minification", "Transport engineering", "Distribution (mathematics)", "Diesel fuel", "Duration (music)", "Greenhouse gas", "Engineering", "Environmental economics", "Automotive engineering", "Computer science", "Economics" ], "cited_by_count": 44, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tranpol.2018.06.010" }, { "id": "https://openalex.org/W2533031736", "doi": null, "title": "Collaborative Logistics in Vehicle Routing", "year": 2008, "publication_date": "2008-10-06", "type": "dissertation", "language": "en", "authors": [ "Selvaprabu Nadarajah" ], "first_author": "Selvaprabu Nadarajah", "venue": "UWSpace (University of Waterloo)", "publisher": "University of Waterloo", "abstract": "Less-Than-Truckload (LTL) carriers generally serve geographical regions that are more localized than the inter-city routes served by truckload carriers. That localization can lead to urban freight transportation routes that overlap. If trucks are traveling with less than full loads there may exist opportunities for carriers \\nto collaborate over such routes. That is, Carrier A will also deliver one or more \\nshipments of Carrier B. This will improve vehicle asset utilization and reduce asset-repositioning costs, and may also lead to reduced congestion and pollution in cities. \\nWe refer to the above coordination as “collaborative routing”. \\n \\nIn our framework for collaboration, we also propose that carriers exchange goods at logistics platforms located at the entry point to a city. This is referred to as “entry-point collaboration”. One difficulty in collaboration is the lack of facilities to allow transfer of goods between carriers. We highlight that the reduction in pollution and congestion under our proposed framework will give the city government an incentive to support these initiatives by providing facilities. Further, our analysis has shown that contrary to the poor benefits reported by previous work on vehicle routing with transshipment, strategic location of transshipment facilities in urban areas may solve this problem and lead to large cost savings from transfer of loads between carriers. \\n \\nWe also present a novel integrated three-phase solution method. Our first phase uses either a modified tabu search, or a guided local search, to solve the vehicle routing problems with time windows that result from entry-point collaboration. The \\npreceding methods use a constraint programming engine for feasibility checks. The second phase uses a quad-tree search to locate facilities. Quad-tree search methods \\nare popular in computer graphics, and for grid generation in fluid simulation. These methods are known to be efficient in partitioning a two-dimensional space for storage and computation. We use this efficiency to search a two-dimensional region and locate possible transshipment facilities. \\n \\nIn phase three, we employ an integrated greedy local search method to build collaborative routes, using three new transshipment-specific moves for neighborhood definition. We utilize an optimization module within local search to combine multiple moves at each iteration, thereby taking efficient advantage of information from neighborhood exploration. Extensive computational tests are done on random data sets which represent a city such as Toronto. Sensitivity analysis is performed on important parameters to characterize the situations when collaboration will be beneficial. Overall results show that our proposal for collaboration leads to 12% and 15% decrease in route distance and time, respectively. Average asset utilization is seen to increase by about 5% as well.", "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "Transport engineering", "Computer science", "Business", "Engineering", "Computer network" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10012/4083" }, { "id": "https://openalex.org/W3188846830", "doi": "10.1016/j.scs.2021.103209", "title": "Evaluation of policy options supporting electric vehicles in city logistics: a case study", "year": 2021, "publication_date": "2021-07-29", "type": "article", "language": "en", "authors": [ "Rambabu Juvvala", "Sarada Prasad Sarmah" ], "first_author": "Rambabu Juvvala", "venue": "Sustainable Cities and Society", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Consolidation (business)", "Subsidy", "City logistics", "Transport engineering", "Solver", "Vehicle routing problem", "Ant colony optimization algorithms", "Greenhouse gas", "Total cost", "Computer science", "Operations research" ], "cited_by_count": 43, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.scs.2021.103209" }, { "id": "https://openalex.org/W951791227", "doi": null, "title": "Intelligent Transportation System and Night Delivery Schemes for City Logistics", "year": 2011, "publication_date": "2011-01-01", "type": "article", "language": "en", "authors": [ "Ivana Ćavar", "Zvonko Kavran", "Natalija Jolić" ], "first_author": "Ivana Ćavar", "venue": "Computer Technology and Application", "publisher": "David Publishing Company", "abstract": "Intelligent Transportation System (ITS) integrates information and communication technologies with location based technologies into roads, vehicles, traffic and transport management systems. Application of ITS can improve situation in major cities where due to the increasing number of residents and level of motorization traffic congestion represents important issue. Another problem arises from this facts and that is that cities have contradictory needs as grooving need for goods within urban areas as well as need for less vehicles in the same area. The urban logistics activities by private companies within urban areas represent an integral part of city logistics that aims to improve the efficiency of urban freight transportation, reduce traffic congestion, mitigate environmental impacts, reduce costs and fuel consumption. This research presents application of ITS technologies and vehicle routing problem for night delivery scheme planning as one of the core techniques for modeling city logistics.", "keywords": [ "City logistics", "Traffic congestion", "Transport engineering", "Intelligent transportation system", "Traffic management", "Business", "Routing (electronic design automation)", "Fuel efficiency", "Computer science", "Engineering" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.airitilibrary.com/Publication/Index/19347332-201110-201205070020-201205070020-27-32" }, { "id": "https://openalex.org/W1969754361", "doi": "10.1109/iciinfs.2013.6731973", "title": "A data mining and optimization-based real-time mobile intelligent routing system for city logistics", "year": 2013, "publication_date": "2013-12-01", "type": "conference-paper", "language": "en", "authors": [ "Canhong Lin", "King-lun Choy", "G.K.H. Pang", "Michelle T. W. Ng" ], "first_author": "Canhong Lin", "venue": null, "publisher": null, "abstract": "City logistics is facing the challenging problem of providing a quick-response and on-time delivery service in congested urban areas with frequent traffic jams. The dynamically changing traffic conditions make the predetermined best transportation plans suboptimal and consequently cause increased logistics cost and even greater air pollution. To help the driver determine time-optimal routing solutions in order to avoid congestion according to the real-time traffic flow, a Real-time Mobile Intelligent Routing System is designed and deployed on drivers' Smartphones to help in routing decision making. Data mining techniques are employed to discover the routing patterns from the past cases of routing plans so as to generate case-based routing plans for the drivers. A metaheuristic is used to undertake the optimization of a real-time optimal routing plan based on real-time traffic information. A case study and computational experiments demonstrate the effectiveness of the proposed methods in significantly reducing the traveling time.", "keywords": [ "Computer science", "Routing (electronic design automation)", "Traffic congestion", "Static routing", "Vehicle routing problem", "Policy-based routing", "Computer network", "Transport engineering", "Real-time computing", "Routing protocol", "Engineering" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/iciinfs.2013.6731973" }, { "id": "https://openalex.org/W2985148796", "doi": "10.1016/j.resconrec.2019.104585", "title": "Sharing economy to improve routing for urban logistics distribution using electric vehicles", "year": 2019, "publication_date": "2019-11-15", "type": "article", "language": "en", "authors": [ "Yan Li", "Ming Kim Lim", "Yingshuang Tan", "Sir Yee Lee", "Ming‐Lang Tseng" ], "first_author": "Yan Li", "venue": "Resources Conservation and Recycling", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Electricity", "Environmental economics", "Electric vehicle", "Greenhouse gas", "Context (archaeology)", "Carbon tax", "Queueing theory", "Computer science", "Vehicle routing problem", "Routing (electronic design automation)", "Engineering", "Economics" ], "cited_by_count": 100, "is_retracted": false, "is_paratext": false, "open_access_url": "https://eprints.gla.ac.uk/260739/" }, { "id": "https://openalex.org/W2603719188", "doi": "10.1080/15472450.2017.1309530", "title": "The value of real-time traffic information in urban freight distribution", "year": 2017, "publication_date": "2017-03-23", "type": "article", "language": "en", "authors": [ "Marta Flamini", "Marialisa Nigro", "Dario Pacciarelli" ], "first_author": "Marta Flamini", "venue": "Journal of Intelligent Transportation Systems", "publisher": "Taylor & Francis", "abstract": "Routes optimization in urban freight distribution is usually an off-line process based on the knowledge of historical conditions on the network. Real-time data provided by Intelligent Transportation Systems (ITSs) enable online re-optimization on the basis of actual traffic conditions. This paper evaluates the added value generated by re-optimizing the off-line solution with real-time information. The study is carried out for a practical application to the freight distribution of perishable goods in the city of Rome (Italy). The off-line problem is formulated as a vehicle routing problem with soft time windows while in the online problem it is also allowed to skip some customers or to re-sequence the deliveries. Both versions are solved with different algorithms and with different data sets. Results can be used to evaluate the potential return on investment on the acquisition of different kinds of traffic data. At the same time, results can be of interest for information providers, to fix the price of off-line and online information and/or to estimate the associated potential market share.", "keywords": [ "Transport engineering", "Value of time", "Traffic management", "Distribution (mathematics)", "Real-time data", "Travel time", "Value (mathematics)", "Computer science", "Business", "Engineering", "Mathematics" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/15472450.2017.1309530" }, { "id": "https://openalex.org/W4226311507", "doi": "10.1007/s10489-022-03535-y", "title": "Intelligent fleet management of autonomous vehicles for city logistics", "year": 2022, "publication_date": "2022-04-07", "type": "article", "language": "en", "authors": [ "Elias K. Xidias", "Paraskevi Th. Zacharia", "Andreas C. Nearchou" ], "first_author": "Elias K. Xidias", "venue": "Applied Intelligence", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Computer science", "Context (archaeology)", "Routing (electronic design automation)", "Fuzzy logic", "Vehicle routing problem", "Genetic algorithm", "Motion planning", "Operations research", "Work (physics)", "Motion (physics)", "Real-time computing", "Artificial intelligence" ], "cited_by_count": 29, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10489-022-03535-y" }, { "id": "https://openalex.org/W1964236940", "doi": "10.1016/j.iatssr.2011.05.001", "title": "Evaluating CO2 emissions, cost, and service quality trade-offs in an urban delivery system case study", "year": 2011, "publication_date": "2011-06-25", "type": "article", "language": "en", "authors": [ "Erica Wygonik", "Anne Goodchild" ], "first_author": "Erica Wygonik", "venue": "IATSS Research", "publisher": "Elsevier BV", "abstract": "Growing pressure to limit greenhouse gas emissions is changing the way businesses operate. This paper presents the trade-offs between cost, service quality (represented by time window guarantees), and emissions of an urban pickup and delivery system under these changing pressures. A model, developed by the authors in ArcGIS, is used to evaluate these trade-offs for a specific case study involving a real fleet with specific operational characteristics. The problem is modeled as an emissions minimization vehicle routing problem with time windows. Analyses of different external policies and internal operational changes provide insight into the impact of these changes on cost, service quality, and emissions. Specific consideration of the influence of time windows, customer density, and vehicle choice are included. The results show a stable relationship between monetary cost and kilograms of CO2, with each kilogram of CO2 associated with a $3.50 increase in cost, illustrating the influence of fuel use on both cost and emissions. In addition, customer density and time window length are strongly correlated with monetary cost and kilograms of CO2 per order. The addition of 80 customers or extending the time window 100 minutes would save approximately $3.50 and 1 kilogram of CO2 per order. Lastly, the evaluation of four different fleets illustrates significant environmental and monetary gains can be achieved through the use of hybrid vehicles. The results demonstrate there is not a trade-off between CO2 emissions and cost, but that these two metrics trend together. This suggests the most effective way to encourage fleet operators to limit emissions is to increase the cost of fuel or CO2 production, as this is consistent with current incentives that exist to reduce cost, and therefore emissions.", "keywords": [ "Greenhouse gas", "Environmental economics", "Order (exchange)", "Fuel efficiency", "Transport engineering", "Operating cost", "Minification", "Service (business)", "Quality (philosophy)", "Total cost", "Computer science", "Automotive engineering" ], "cited_by_count": 50, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.iatssr.2011.05.001" }, { "id": "https://openalex.org/W1972693479", "doi": "10.1080/12265934.2014.930672", "title": "Application of exact route optimization for the evaluation of a city logistics truck ban scheme", "year": 2014, "publication_date": "2014-05-04", "type": "article", "language": "en", "authors": [ "Ali Gul Qureshi", "Eiichi Taniguchi", "Russell George Thompson", "Joel S.E. Teo" ], "first_author": "Ali Gul Qureshi", "venue": "International Journal of Urban Sciences", "publisher": "Taylor & Francis", "abstract": "This paper presents an application of the exact solution approach for the Vehicle Routing Problem with Soft Time Windows based on the column generation scheme developed earlier by the authors, for evaluating a truck ban scheme from the environmental improvement aspect on a realistic logistics instance based on the Vehicle Information and Communication System data, which is an Intelligent Transportation Systems (ITS) application in Japan. Two different types of truck ban schemes are evaluated, one which denies truck entry on congested links (with average speeds lower than a threshold) and the other with and without the availability of the ITS-based data to freight firms. It was found that the Uniform truck ban on low travel speed links can result in a win-win situation, improving the environmental conditions as well as reducing the operation cost for freight carriers in a scenario where freight carriers do not have access to ITS-based travel time information. While the use of an exact optimization method and with ITS-based historical traffic information still helps in reducing environmental impacts, freight companies are slightly worst-off as far as the operation cost is concerned.", "keywords": [ "Truck", "Scheme (mathematics)", "Vehicle routing problem", "Transport engineering", "Routing (electronic design automation)", "Computer science", "Operations research", "Column generation", "Automotive engineering", "Engineering", "Computer network", "Mathematical optimization" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/12265934.2014.930672" }, { "id": "https://openalex.org/W2768847815", "doi": "10.1016/j.cstp.2017.11.002", "title": "Urban consolidation solutions for parcel delivery considering location, fleet and route choice", "year": 2017, "publication_date": "2017-11-20", "type": "article", "language": "en", "authors": [ "Michele D. Simoni", "Pavle Bujanović", "Stephen D. Boyles", "Erhan Kutanoğlu" ], "first_author": "Michele D. Simoni", "venue": "Case Studies on Transport Policy", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Consolidation (business)", "City logistics", "Subsidy", "Transport engineering", "Traffic congestion", "Business", "Environmental economics", "Computer science", "Engineering", "Finance", "Economics" ], "cited_by_count": 63, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cstp.2017.11.002" }, { "id": "https://openalex.org/W2791027034", "doi": "10.1080/24725854.2018.1450541", "title": "Auction-based city logistics synchronization", "year": 2018, "publication_date": "2018-03-09", "type": "article", "language": "en", "authors": [ "Su Xiu Xu", "Saijun Shao", "Ting Qu", "Jian Chen", "George Q. Huang" ], "first_author": "Su Xiu Xu", "venue": "IISE Transactions", "publisher": "Taylor & Francis", "abstract": "This article is the first that proposes an efficient auction mechanism for the City Logistics Synchronization (CLS) problem, which aims to capture both logistics punctuality and simultaneity in a city or region. The main motivation of CLS is if a delay has already occurred or will occur, customers tend to pursue simultaneity. We develop the one-sided Vickrey-Clarke-Groves (O-VCG) auction for the CLS problem. The proposed O-VCG auction realizes incentive compatibility (on the buy side), approximate allocative efficiency, budget balance, and individual rationality. We also prove that if buyers (firms) are substitutes, the utility of the third-party logistics (3PL) company (auctioneer) will be non-negative when it sets real transportation costs in the auction. The vehicle routing problem faced by the 3PL company is formulated as the lane covering problem with CLS requirements. Three effective heuristics are developed: Merge, Exchange, and Mutate. Our computational results show that the three operators are effective but sensitive to the bid duration. A Hybrid operator significantly outperforms each individual operator. We also numerically analyze the impacts of five key factors: the strategic behavior of the 3PL company, flexible due dates, the maximum bid duration, the radius of a city or region, and the number of depots.", "keywords": [ "Computer science", "Punctuality", "Incentive compatibility", "Operations research", "Auction algorithm", "Microeconomics", "Bidding", "Mathematical optimization", "Incentive", "Economics", "Auction theory", "Revenue equivalence" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/24725854.2018.1450541" }, { "id": "https://openalex.org/W2020147819", "doi": "10.1016/s0041-1647(69)80022-5", "title": "The minimum route problem for networks with turn penalties and prohibitions", "year": 1969, "publication_date": "1969-09-01", "type": "article", "language": "en", "authors": [ "R F Kirby", "Renfrey B. Potts" ], "first_author": "R F Kirby", "venue": "Transportation Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Traffic congestion", "Routing (electronic design automation)", "Service (business)", "Queue", "Operations research", "Metropolitan area", "Queueing theory", "Representation (politics)", "Scheme (mathematics)", "Transport engineering", "Mathematical optimization" ], "cited_by_count": 85, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/s0041-1647(69)80022-5" }, { "id": "https://openalex.org/W2903797973", "doi": "10.1016/j.cie.2018.12.024", "title": "The two-echelon city logistics system with on-street satellites", "year": 2018, "publication_date": "2018-12-08", "type": "article", "language": "en", "authors": [ "Hongqi Li", "Yinying Liu", "Kaihang Chen", "Qingfeng Lin" ], "first_author": "Hongqi Li", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Transshipment (information security)", "City logistics", "Heuristic", "Truck", "Computer science", "Transport engineering", "Operations research", "Engineering", "Automotive engineering", "Artificial intelligence" ], "cited_by_count": 28, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2018.12.024" }, { "id": "https://openalex.org/W2111070668", "doi": "10.3141/2168-13", "title": "Algorithms to Quantify Impact of Congestion on Time-Dependent Real-World Urban Freight Distribution Networks", "year": 2010, "publication_date": "2010-01-01", "type": "article", "language": "en", "authors": [ "Ryan G. Conrad", "Miguel Figliozzi" ], "first_author": "Ryan G. Conrad", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "Urban congestion presents considerable challenges to time-definite transportation service providers. Package, courier, and less than truckload operations and costs are severely affected by growing congestion levels. With congestion increasing at peak morning and afternoon periods, public policies and logistics strategies that avoid or minimize deliveries during congested periods have become crucial for many operators and public agencies. However, in many cases these strategies or policies can introduce unintended side effects, such as higher labor costs, shorter working hours, and tighter customer time windows. Research efforts to analyze and quantify the impact of congestion are hindered by the complexities of vehicle routing problems with time-dependent travel times and the lack of networkwide congestion data. Research used real-world road network data to estimate travel distance and time matrices, land use and customer data to localize and characterize demand patterns, congestion data from an extensive archive of freeway and arterial street traffic sensor data to estimate time-dependent travel times, and an efficient time-dependent vehicle routing (TDVRP) solution method to design routes. Novel algorithms were developed to integrate real-world road network and travel data to TDVRP solution methods. Results show the impact of congestion on depot location, fleet size, and distance traveled.", "keywords": [ "Traffic congestion", "Transport engineering", "Computer science", "Routing (electronic design automation)", "Congestion pricing", "Vehicle routing problem", "Travel time", "Real-time data", "Vehicle miles of travel", "Operations research", "Engineering", "Computer network" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/2168-13" }, { "id": "https://openalex.org/W1994147456", "doi": "10.1108/97279810680001242", "title": "A systems‐based approach for city logistics decision making", "year": 2006, "publication_date": "2006-07-01", "type": "article", "language": "en", "authors": [ "Anjali Awasthi", "Jean‐Marie Proth" ], "first_author": "Anjali Awasthi", "venue": "Journal of Advances in Management Research", "publisher": "Emerald Publishing Limited", "abstract": "This paper presents a systems based approach for the city logistics decision making. Using this approach, we present the layout of a simulation model called CILOSIM (CITY‐LOGISTICS‐SIMULATION). CILOSIM encapsulates three sub‐models namely Goods to Vehicle Assignment model, Goods movement model and Impact assessment model. The Goods to vehicle assignment model allocates commodities to vehicles. The Goods movement model performs the scheduling and routing of goods vehicles from the source of origin to source of destination. The routing and scheduling decisions for vehicles are done taking into account the latest traffic conditions existing on the network. Finally, Impact assessment model evaluates the impact of goods movement on city environment and society. The advantage of using the systems approach is that it explains the dynamic and complex nature of city logistics in terms of cause and effect variables. Another advantage is that it permits the user to have a global view of city logistics problems and provides possible solutions in terms of few system variables.", "keywords": [ "Computer science", "Scheduling (production processes)", "Routing (electronic design automation)", "Vehicle routing problem", "Operations research", "City logistics", "Transport engineering", "Operations management", "Economics", "Engineering" ], "cited_by_count": 26, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/97279810680001242" }, { "id": "https://openalex.org/W2550789020", "doi": "10.1016/j.trpro.2016.11.041", "title": "Potential for ITS/ICT Solutions in Urban Freight Management", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Jacek Oskarbski", "Daniel Kaszubowski" ], "first_author": "Jacek Oskarbski", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The article presents a study on applying ITS solutions in planning and management of urban freight transport in Gdynia. The traffic management system Tristar which is under implementation and its related systems show a potential to assist in development of freight transport measures. Recommendations for urban freight policy development supplementing Gdynia's Sustainable Urban Mobility Plan were used as a basis for identification where ITS/ITC could be implemented. The first stage may involve modelling and analysis of freight vehicle traffic with new multilevel transport model for Gdynia. Other possible measures include, among others provision of dynamic information for vehicle routing and priorities for trucks on selected sections of road network. However, problems with access to reliable data describing delivery vehicle traffic were identified in this early stage as no practical rules for their collection had been developed. Additional problems appear in acquiring urban supply chain characteristics that require collaboration with the private sector. Such studies have not as yet been conducted in Poland. The identified factors indicate the need to precisely specify expected results and the areas of ITS application in Gdynia to prepare for their. Dynamic routing and scheduling with real time information appeared to be the most promising solution applying ITS, with temporary priorities for HGV providing services to the sea port in Gdynia in peak traffic and directing lorries implementation to free parking slots. Experience gained in these applications will be useful in developing other, complex solutions, e.g. in organising distribution in the city centre.", "keywords": [ "Truck", "Transport engineering", "Traffic management", "City logistics", "Vehicle routing problem", "Port (circuit theory)", "Plan (archaeology)", "Identification (biology)", "Scheduling (production processes)", "Computer science", "Routing (electronic design automation)", "Information and Communications Technology" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S235214651630655X/pdf" }, { "id": "https://openalex.org/W4236278152", "doi": "10.2208/journalip.18.1", "title": "City Logistics", "year": 2001, "publication_date": "2001-01-01", "type": "article", "language": "en", "authors": [ "Eiichi TANIGUCHI" ], "first_author": "Eiichi TANIGUCHI", "venue": "INFRASTRUCTURE PLANNING REVIEW", "publisher": null, "abstract": "This paper proposes an idea of city logistics for optimising urban freight transport by takinginto account the environment, the congestion and energy consumption. The basic concepts of city logistics as well as some measures of city logistics with examples are presented. The paper also describes modelling the vehicle routing and scheduling of pickup/delivery trucks and the optimal location of logistics terminals for evaluating the city logistics schemes. Moreover, the future perspectives concerning urban freight transport planning are presented.", "keywords": [ "City logistics", "Traffic management", "Truck", "Transport engineering", "Scheduling (production processes)", "Humanitarian Logistics", "Energy consumption", "Vehicle routing problem", "Computer science", "Business", "Operations research", "Traffic congestion" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.jstage.jst.go.jp/article/journalip1984/18/0/18_0_1/_pdf" }, { "id": "https://openalex.org/W2960737875", "doi": "10.1016/j.trpro.2019.06.033", "title": "Application of routing methods in city logistics for sustainable road traffic", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Dariusz Paweł Masłowski", "Ewa Kulińska", "Karolina Kulińska" ], "first_author": "Dariusz Paweł Masłowski", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "This article aims to verify the potential of routing methods in city logistics. In the theoretical part it presents the current state of development of city logistics and its most striking problems related to road traffic optimization. It also analyses basic routing methods along with their characteristics. In the research part, on the basis of the literature review, attention is drawn to existing research on the application of routing methods when planning road traffic in the cities and its advantages are discussed. Finally, based on a preliminary empirical study, the possibility and need to conduct analogous research on the example of public transport in the city of Opole is indicated. In conclusion, it is noted that the research area investigated has a large practical potential for creating sustainable road traffic in cities and is a starting point for further exploration.", "keywords": [ "City logistics", "Transport engineering", "Routing (electronic design automation)", "Computer science", "Empirical research", "Sustainable development", "Vehicle routing problem", "Point (geometry)", "Road traffic", "Sustainable transport", "Traffic planning", "Traffic management" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146519301218/pdf" }, { "id": "https://openalex.org/W2578129914", "doi": null, "title": "Location-routing models and methods for Freight Distribution and Infomobility in City Logistics", "year": 2009, "publication_date": "2009-01-01", "type": "article", "language": "en", "authors": [ "Antonio Sforza" ], "first_author": "Antonio Sforza", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Vehicle routing problem", "Transport engineering", "Distribution (mathematics)", "Routing (electronic design automation)", "Computer science", "Operations research", "Environmental science", "Engineering", "Mathematics", "Computer network" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.iris.unina.it/handle/11588/651941" }, { "id": "https://openalex.org/W4415095750", "doi": "10.37899/journallamultiapp.v6i6.2382", "title": "Literature Review on Vehicle Routing Problem: Approaches, Algorithms and Current Challenges", "year": 2025, "publication_date": "2025-10-13", "type": "article", "language": "en", "authors": [ "Mery Andani Pangaribuan", "Juliza Hidayati", "Harmein Nasution" ], "first_author": "Mery Andani Pangaribuan", "venue": "Journal La Multiapp", "publisher": null, "abstract": "The Vehicle Routing Problem (VRP) is one of the basic combinatorial optimization problems that takes a central place in the sphere of logistics, transportation, and supply-chain management. A systematic literature review (SLR) of VRP scholarship dated 2000 to 2025 is conducted herein, where over 500,000 publications are analyzed to carry out the study of VRP solutions evolution and methodological advancements as well as their practical use. The results highlight the current popularity of metaheuristic algorithms, such as Ant Colony Optimization (ACO), Genetic Algorithms (GA), and Particle Swarm Optimization (PSO), in solving complex variants of VRP, in particular, the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Time Windows (VRPTW). The combination of real-time data streams, machine-learning methods and adaptive algorithms represents a revolutionary track, and helps to develop more active and responsive VRP models. Moreover, increased attention to sustainability and green logistics has triggered the development of the eco-efficient VRP models, which combine the use of electric vehicles (EVs) and energy-consumption optimization. The spread of autonomous vehicles presents new opportunities and threats to future VRP solutions, particularly in the area of urban freight and last-mile delivery. In conclusion, the review outlines future streams of research, highlighting the need to find adaptive, sustainable, and autonomous VRP models that can resolve the growing complexities in the modern world of logistics.", "keywords": [ "Vehicle routing problem", "Metaheuristic", "Ant colony optimization algorithms", "Particle swarm optimization", "Routing (electronic design automation)", "Genetic algorithm", "Sustainability", "Popularity" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://newinera.com/index.php/JournalLaMultiapp/article/download/2382/2125" }, { "id": "https://openalex.org/W4285413678", "doi": "10.1007/978-3-031-10385-8_25", "title": "Urban Logistics Vehicle Routing Problem Under the Carbon Trading Market", "year": 2022, "publication_date": "2022-01-01", "type": "conference-paper", "language": "en", "authors": [ "Keru Fan", "Yalou Tian", "Liqing Yao", "Rui Qiu" ], "first_author": "Keru Fan", "venue": "Lecture notes on data engineering and communications technologies", "publisher": "Springer International Publishing", "abstract": null, "keywords": [ "Vehicle routing problem", "Business", "Routing (electronic design automation)", "Industrial organization", "Computer science", "Computer network" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-031-10385-8_25" }, { "id": "https://openalex.org/W4417246716", "doi": "10.1016/j.cie.2025.111755", "title": "Multi-depot collaborative vehicle route problem with shared customer, delivery options and flexible transshipment", "year": 2025, "publication_date": "2025-12-11", "type": "article", "language": "en", "authors": [ "Chao Li", "Yu Fan", "Qun Chen" ], "first_author": "Chao Li", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Transshipment (information security)", "Vehicle routing problem", "Benchmark (surveying)", "Consolidation (business)", "Delivery Performance", "Routing (electronic design automation)", "Local search (optimization)" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2025.111755" }, { "id": "https://openalex.org/W2170333160", "doi": "10.1109/vetecs.2005.1543877", "title": "A dynamic real-time fleet management system for incident handling in city logistics", "year": 2005, "publication_date": "2005-12-10", "type": "conference-paper", "language": "en", "authors": [ "Vasileios Zeimpekis", "George M. Giaglis", "Ioannis E. Minis" ], "first_author": "Vasileios Zeimpekis", "venue": null, "publisher": null, "abstract": "Unexpected incidents, such as adverse traffic, unavailability of parking space and vehicle breakdowns, that occur during urban deliveries, lead to delays, higher costs, and inferior customer service. This paper presents the architecture of a real-time fleet management system that handles unforeseen events by monitoring distribution vehicles and by recommending intelligent re-routing interventions in order to improve urban delivery performance.", "keywords": [ "Computer science", "Fleet management", "Real-time computing", "Computer security", "Telecommunications" ], "cited_by_count": 26, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/vetecs.2005.1543877" }, { "id": "https://openalex.org/W2033612344", "doi": "10.1504/ijdmmm.2009.029030", "title": "Data chain management for planning in city logistics", "year": 2009, "publication_date": "2009-01-01", "type": "article", "language": "en", "authors": [ "Jan Fabian Ehmke", "Stephan Meisel", "Stefan Engelmann", "Dirk Christian Mattfeld" ], "first_author": "Jan Fabian Ehmke", "venue": "International Journal of Data Mining Modelling and Management", "publisher": "Inderscience Publishers", "abstract": "This contribution is about data chain management enabling route planning in city logistics. The transformation of raw data into reliable decisions requires effective data chain management. The data chain closes the gap between empirical collection of raw traffic data and decision-making in terms of route planning. We define the data chain for the support of route planning in city logistics. The data chain transforms raw empirical traffic data into planning data by first and second level aggregation. The single elements of the data chain are investigated in detail. We discuss basic issues of telematics-based data collection, data cleaning and data integration. The key element of the data chain is the aggregation by cluster analysis. Aggregated data is evaluated by explorative data analysis. Finally, the efficient application of aggregated data for route planning is illustrated.", "keywords": [ "Raw data", "Computer science", "Data collection", "Chain (unit)", "Data warehouse", "Data management", "Operations research", "Data mining", "Engineering" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijdmmm.2009.029030" }, { "id": "https://openalex.org/W2890198493", "doi": "10.1051/matecconf/201820000006", "title": "ABM-GIS simulation for urban freight distribution of perishable food", "year": 2018, "publication_date": "2018-01-01", "type": "conference-paper", "language": "en", "authors": [ "Hanane El Raoui", "Mustapha Oudani", "A. El Alaoui" ], "first_author": "Hanane El Raoui", "venue": "MATEC Web of Conferences", "publisher": "EDP Sciences", "abstract": "Freight transport is essential to modern urban civilization. No urban area could exist without a powerful freight transport system. However, the distribution of perishable foods in urban areas is seen as a source of problems, due to traffic congestion, time pressures, and environmental impact. In this paper, an Agent-Based Model integrated with Geographic Information Systems (ABM-GIS) is designed for a time-dependent vehicle routing problem with time windows. This simulation model consists of determining the quickest routes to transport fresh products, estimating Vehicle kilometer traveled VKT and vehicle hour traveled VHT where speeds and travel times depend on the time of the day. Based on a case study, analyses of changes on traffic condition were conducted to get an insight into the impact of these changes on cost, service quality represented by the respect of time windows, and carbon emissions. The results reveal that traffic jams and restrictive time windows lead to additional cost, cause delays, and increase co2 emission. As for a short-term planning, time-dependent scheduling algorithm was proposed and assessed while extending time windows. Results have proved the potential saving in cost, travel time, and carbon emission.", "keywords": [ "Transport engineering", "Vehicle routing problem", "Scheduling (production processes)", "Travel time", "Traffic congestion", "Vehicle miles of travel", "Routing (electronic design automation)", "Computer science", "Geographic information system", "Environmental science", "Operations research", "Engineering" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.matec-conferences.org/articles/matecconf/pdf/2018/59/matecconf_iwtsce2018_00006.pdf" }, { "id": "https://openalex.org/W2082892077", "doi": "10.1007/s10732-011-9191-1", "title": "Real-time management of vehicle breakdowns in urban freight distribution", "year": 2011, "publication_date": "2011-10-26", "type": "article", "language": "en", "authors": [ "Ioannis E. Minis", "K. Mamasis", "Vasileios Zeimpekis" ], "first_author": "Ioannis E. Minis", "venue": "Journal of Heuristics", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Heuristic", "Orienteering", "Computer science", "Vehicle routing problem", "Limit (mathematics)", "Mathematical optimization", "Genetic algorithm", "Time limit", "Constraint (computer-aided design)", "Operations research", "Quality (philosophy)", "Event (particle physics)" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10732-011-9191-1" }, { "id": "https://openalex.org/W2276129978", "doi": "10.1016/j.trpro.2016.02.062", "title": "Interval Travel Times for More Reliable Routing in City Logistics", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Patrick-Oliver Groß", "MICHAEL A. GEISINGER", "Jan Fabian Ehmke", "Dirk Christian Mattfeld" ], "first_author": "Patrick-Oliver Groß", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "Due to varying traffic volumes and limited traffic infrastructure in urban areas, travel times generally are uncertain and differ during the day. In this environment, city logistics service providers (CLSP) have to fulfill deliveries cost-efficiently and reliably. To ensure cost-efficient routing while satisfying promised delivery dates, information on expected travel times between customers needs to be exploited. If a sufficient amount of data is not available or expensive to acquire, deriving this information presents a major challenge for CLSP. Therefore, we propose the usage of interval travel times (ITT) to enable cost-efficient and reliable routing in urban areas. ITT define an expected range of travel times, which can be derived with relatively low effort by CLSP. We modify an existing approach from the domain of robust planning to the requirements of routing in urban areas. Further, we present and discuss the process of deriving ITT. An exemplary city logistics setting is developed and different routing solutions are examined. Computational experiments show that, in contrast to well-known deterministic approaches, routing considering ITT allows both cost-efficient and reliable routing.", "keywords": [ "Routing (electronic design automation)", "Computer science", "Interval (graph theory)", "City logistics", "Vehicle routing problem", "Process (computing)", "Range (aeronautics)", "Transport engineering", "Domain (mathematical analysis)", "Operations research", "Computer network", "Engineering" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146516000636/pdf" }, { "id": "https://openalex.org/W3134157027", "doi": "10.1016/j.scs.2021.102806", "title": "Evaluating problems and measures for a sustainable urban freight transport in Brazilian historical cities", "year": 2021, "publication_date": "2021-02-26", "type": "article", "language": "en", "authors": [ "Leise Kelli de Oliveira", "João Guilherme da Costa Braga França", "Carla de Oliveira Leite Nascimento", "Isabela Kopperschmidt de Oliveira", "Leonardo Herszon Meira", "Lígia Rabay" ], "first_author": "Leise Kelli de Oliveira", "venue": "Sustainable Cities and Society", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "City logistics", "Descriptive statistics", "Transport engineering", "Logistic regression", "Sustainable transport", "Business", "Regression analysis", "Cultural heritage", "Regional science", "World heritage", "Environmental planning" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.scs.2021.102806" }, { "id": "https://openalex.org/W657563862", "doi": "10.1108/9781786359544-018", "title": "Reliable Vehicle Routing and Scheduling with Time Windows Towards City Logistics", "year": 2003, "publication_date": "2003-05-08", "type": "book-chapter", "language": "en", "authors": [ "Eiichi Taniguchi", "Tadashi Yamada" ], "first_author": "Eiichi Taniguchi", "venue": null, "publisher": null, "abstract": "This paper presents integrated models of probabilistic vehicle routing and scheduling model with time windows and dynamic traffic simulation. The probabilistic model incorporates the uncertainty of travel times. After applying the models to test road network, incorporating the uncertainty of travel times using the models not only allows freight carriers to reduce their total costs, but also improves the environment in terms of decreasing CO2 emissions. As well, the paper investigated the effects and profitability of co-operative freight transport systems using a simulation model based on forecast vehicle routing and scheduling model. Results showed cooperative freight transport systems can lead to a substantial reduction in total delivery costs and total travel times within the whole road network.", "keywords": [ "Vehicle routing problem", "Scheduling (production processes)", "Computer science", "City logistics", "Routing (electronic design automation)", "Computer network", "Transport engineering", "Engineering", "Operations management" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/9781786359544-018" }, { "id": "https://openalex.org/W4308175318", "doi": "10.1016/j.trb.2022.10.011", "title": "Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation", "year": 2022, "publication_date": "2022-11-04", "type": "article", "language": "en", "authors": [ "Jiawei Lu", "Qinghui Nie", "Monirehalsadat Mahmoudi", "Jishun Ou", "Chongnan Li", "Xuesong Simon Zhou" ], "first_author": "Jiawei Lu", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Queue", "Arc routing", "Representation (politics)", "Arc (geometry)", "Computer science", "Algorithm", "Routing (electronic design automation)", "Mathematics", "Computer network", "Geometry" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trb.2022.10.011" }, { "id": "https://openalex.org/W2187778886", "doi": "10.1016/j.cstp.2015.11.005", "title": "Freight data collection using GPS and web-based surveys: Insights from US truck drivers’ survey and perspectives for urban freight", "year": 2015, "publication_date": "2015-12-01", "type": "article", "language": "en", "authors": [ "Moshe E Ben-Akiva", "Tomer Toledo", "Jorge Oliveira Santos", "Nathanael Christopher James Cox", "Fang Zhao", "Yin Jin Lee", "Vittorio Marzano" ], "first_author": "Moshe E Ben-Akiva", "venue": "Case Studies on Transport Policy", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Transport engineering", "Context (archaeology)", "Global Positioning System", "Routing (electronic design automation)", "Data collection", "Vehicle routing problem", "Survey data collection", "Focus (optics)", "Computer science", "Operations research", "Business" ], "cited_by_count": 44, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cstp.2015.11.005" }, { "id": "https://openalex.org/W4301600191", "doi": "10.7307/ptt.v34i5.4103", "title": "Modelling Distribution Routes in City Logistics by Applying Operations Research Methods", "year": 2022, "publication_date": "2022-09-30", "type": "article", "language": "en", "authors": [ "Ondřej Stopka" ], "first_author": "Ondřej Stopka", "venue": "PROMET - Traffic&Transportation", "publisher": "University of Zagreb, Faculty of Transport and Traffic Sciences", "abstract": "The article focuses on the up-to-date subject from the practical as well as scientific point of view. It specifically discusses a proposal of an approach concerning transport or distribution problems in the range of city logistics and investigates possibilities to use opted operations research methods in this particular area. Specific suggestions lie first and foremost in using selected tools of operations research (i.e. a set of methods concerning vehicle routing problem) to model multiple variants of distribution paths from a determined hub to multiple spokes in order to minimise the overall travelled distance in an urban area. As far as the very research goes, to define distribution paths to supply multiple logistics objects in the range of city logistics, ensuing methods are step by step used: Clarke-Wright algorithm, Mayer algorithm and the nearest neighbour algorithm. The article consists of a conceptual section, describing the relevant theory as well as data and methods used, the practical part and the section encompassing an assessment of the key findings, along with the discussion. A suitable combination of adequate operations research methods and their application to city logistics issues is where an innovative solution of this research lies.", "keywords": [ "Computer science", "Operations research", "City logistics", "Vehicle routing problem", "Range (aeronautics)", "Point (geometry)", "Section (typography)", "Wright", "Key (lock)", "Distribution (mathematics)", "Set (abstract data type)", "Management science" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://traffic2.fpz.hr/index.php/PROMTT/article/download/88/20" }, { "id": "https://openalex.org/W3099501324", "doi": "10.1016/j.tre.2020.102126", "title": "Exact approaches for routing capacitated electric vehicles", "year": 2020, "publication_date": "2020-11-15", "type": "article", "language": "en", "authors": [ "Hesamoddin Tahami", "Ghaith Rabadi", "Mohamed Haouari" ], "first_author": "Hesamoddin Tahami", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Computer science", "Battery (electricity)", "Mathematical optimization", "Routing (electronic design automation)", "Set (abstract data type)", "Electric vehicle", "Electricity", "Polynomial", "Algorithm", "Mathematics", "Computer network" ], "cited_by_count": 58, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2020.102126" }, { "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/W3199303128", "doi": "10.1016/j.resconrec.2021.105925", "title": "An intelligent model of green urban distribution in the blockchain environment", "year": 2021, "publication_date": "2021-09-20", "type": "article", "language": "en", "authors": [ "Yan Li", "Ming Kim Lim", "Chao Wang" ], "first_author": "Yan Li", "venue": "Resources Conservation and Recycling", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Blockchain", "Distribution (mathematics)", "Computer science", "Smart contract", "Environmental economics", "Computer security", "Process (computing)", "Business", "Economics" ], "cited_by_count": 30, "is_retracted": false, "is_paratext": false, "open_access_url": "https://pureportal.coventry.ac.uk/en/publications/090ab43c-f4ae-4e63-9b99-54abae61f9b6" }, { "id": "https://openalex.org/W2968374060", "doi": "10.3390/su11164387", "title": "Optimizing Urban Distribution Routes for Perishable Foods Considering Carbon Emission Reduction", "year": 2019, "publication_date": "2019-08-13", "type": "article", "language": "en", "authors": [ "Diansheng Lin", "Zhiyong Zhang", "Jiaxin Wang", "Liu Yang", "Yongqiang Shi", "Jeffrey Soar" ], "first_author": "Diansheng Lin", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "The increasing demand for urban distribution increases the number of transportation vehicles which intensifies the congestion of urban traffic and leads to a lot of carbon emissions. This paper focuses on carbon emission reduction in urban distribution, taking perishable foods as the object. It carries out optimization analysis of urban distribution routes to explore the impact of low carbon policy on urban distribution routes planning. On the basis of analysis of the cost components and corresponding constraints of urban distribution, two optimization models of urban distribution routes with and without carbon emissions cost are constructed. Fuel quantity related to cost and carbon emissions in the model is calculated based on traffic speed, vehicle fuel quantity and passable time period of distribution. Then an improved algorithm which combines genetic algorithm and tabu search algorithm is designed to solve models. Moreover, an analysis of the influence of carbon tax price is also carried out. It is concluded that in the process of urban distribution based on the actual network information, path optimization considering the low carbon factor can effectively reduce the distribution process of CO2, and reduce the total cost of the enterprise and society, thus achieving greater social benefits at a lower cost. In addition, the government can encourage low-carbon distribution by rationally adjusting the price of carbon tax to achieve a higher social benefit.", "keywords": [ "Carbon tax", "Tabu search", "Distribution (mathematics)", "Reduction (mathematics)", "Genetic algorithm", "Greenhouse gas", "Carbon fibers", "Environmental economics", "Computer science", "Transport engineering", "Environmental science", "Economics" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/11/16/4387/pdf?version=1566525086" }, { "id": "https://openalex.org/W4226314916", "doi": "10.1186/s12544-022-00525-6", "title": "Fuel cell drive for urban freight transport in comparison to diesel and battery electric drives: a case study of the food retailing industry in Berlin", "year": 2022, "publication_date": "2022-02-04", "type": "article", "language": "en", "authors": [ "John Kenneth Winkler", "Alexander Grahle", "Anne Magdalene Syré", "Kai Martins-Turner", "Dietmar Göhlich" ], "first_author": "John Kenneth Winkler", "venue": "European Transport Research Review", "publisher": "Springer Science+Business Media", "abstract": "Abstract The option of decarbonizing urban freight transport using battery electric vehicle (BEV) seems promising. However, there is currently a strong debate whether fuel cell electric vehicle (FCEV) might be the better solution. The question arises as to how a fleet of FCEV influences the operating cost, the greenhouse gas (GHG) emissions and primary energy demand in comparison to BEVs and to Internal Combustion Engine Vehicle (ICEV). To investigate this, we simulate the urban food retailing as a representative share of urban freight transport using a multi-agent transport simulation software. Synthetic routes as well as fleet size and composition are determined by solving a vehicle routing problem. We compute the operating costs using a total cost of ownership analysis and the use phase emissions as well as primary energy demand using the well to wheel approach. While a change to BEV results in 17–23% higher costs compared to ICEV, using FCEVs leads to 22–57% higher costs. Assuming today’s electricity mix, we show a GHG emission reduction of 25% compared to the ICEV base case when using BEV. Current hydrogen production leads to a GHG reduction of 33% when using FCEV which however cannot be scaled to larger fleets. Using current electricity in electrolysis will increase GHG emission by 60% compared to the base case. Assuming 100% renewable electricity for charging and hydrogen production, the reduction from FCEVs rises to 73% and from BEV to 92%. The primary energy requirement for BEV is in all cases lower and for higher compared to the base case. We conclude that while FCEV have a slightly higher GHG savings potential with current hydrogen, BEV are the favored technology for urban freight transport from an economic and ecological point of view, considering the increasing shares of renewable energies in the grid mix.", "keywords": [ "Greenhouse gas", "Automotive engineering", "Battery (electricity)", "Electricity", "Electric vehicle", "Battery electric vehicle", "Renewable energy", "Hydrogen vehicle", "Diesel fuel", "Green vehicle", "Sustainable transport", "Internal combustion engine" ], "cited_by_count": 32, "is_retracted": false, "is_paratext": false, "open_access_url": "https://etrr.springeropen.com/counter/pdf/10.1186/s12544-022-00525-6" }, { "id": "https://openalex.org/W2312319266", "doi": "10.2208/journalip.24.927", "title": "EFFECTS OF RELAXING TIME WINDOWS ON VEHICLE ROUTING AND SCHEDULING", "year": 2007, "publication_date": "2007-01-01", "type": "article", "language": "en", "authors": [ "Ali Gul Qureshi", "Eiichi Taniguchi", "Tadashi Yamada" ], "first_author": "Ali Gul Qureshi", "venue": "INFRASTRUCTURE PLANNING REVIEW", "publisher": null, "abstract": "City Logistics deals with measures such as route optimization to mitigate typical problems caused by urban goods movement. While many real life logistics problems use soft time windows, most of the exact route optimization research considers hard time windows. This paper focuses on the effects of relaxing hard time windows constraints to soft time windows. A variety of time windows variants are analyzed under different scenarios based on time windows width, geographical locations of customers and link travel times. It was found that relaxing the time windows have better economic and environmental effects on solution of VRPTW.", "keywords": [ "Vehicle routing problem", "Scheduling (production processes)", "Computer science", "Windows CE", "Microsoft Windows", "Variety (cybernetics)", "Routing (electronic design automation)", "Engineering", "Embedded system", "Operating system", "Operations management" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.jstage.jst.go.jp/article/journalip1984/24/0/24_0_927/_pdf" }, { "id": "https://openalex.org/W7149519878", "doi": "10.70675/f9d5ed94z268cz4d6az880aza791fc3a0f33", "title": "Two-echelon vehicle routing problems in city logistics : approaches based on exact methods of mathematical optimization", "year": 2020, "publication_date": "2020-11-26", "type": "dissertation", "language": "fr", "authors": [ "Guillaume Marquès" ], "first_author": "Guillaume Marquès", "venue": null, "publisher": null, "abstract": "Problèmes de tournées de véhicules sur deux niveaux pour la logistique urbaine : approches basées sur les méthodes exactes de l'optimisation mathématique Cette thèse s’intéresse principalement au développement de méthodes d’optimisation mathématique exactes pour résoudre des problèmes de tournées de véhicules dans un réseau de distribution à deux niveaux. Dans un tel réseau, des camions circulent au premier niveau et transportent des marchandises d’un centre de distribution vers des dépôts intermédiaires appelés « satellites ». Au second niveau, des véhicules légers récupèrent les marchandises aux satellites puis livrent les clients. Chaque client doit être visité une seule fois. L’objectif du problème de tournées de véhicules sur deux niveaux est de minimiser le coût total de transport dans un tel réseau de distribution.Le premier chapitre présente succinctement l’algorithme de « branch-and-cut-and-price » que nous utilisons tout au long de la thèse.Le second chapitre s’intéresse au « Two-Echelon Capacitated Vehicle Routing Prob- lem ». Nous présentons une nouvelle formulation du problème basée sur des routes qui ne contient pas de variable pour déterminer les quantités de marchandises livrées aux satellites. Nous proposons une nouvelle stratégie de branchement qui permet de significativement réduire la taille de l’arbre de branch-and-bound. Enfin et surtout, nous présentons une nouvelle famille d’inégalités valides nommée « satellite supply inequalities ». Nous montrons que cette nouvelle famille améliore la qualité de la borne duale au nœud racine de l’arbre de « branch-and-bound ». Les expérimentations montrent que notre algorithme résout toutes les instances de la littérature qui contiennent jusqu’à 200 clients et 10 satellites. C’est le double de la taille des instances qui étaient résolues à l’optimalité jusqu’ici.La troisième chapitre s’intéresse au « Two-Echelon Vehicle Routing Problem with Time Windows ». Ici, nous considérons une variante avec des contraintes de précédence aux satellites : un camion doit livrer les marchandises à un satellite avant qu’elles soient chargées dans un véhicule léger. C’est une relaxation de la variante avec synchronisation exacte considérée dans la littérature. Nous traitons les variantes « single trip » et « multi trip » du problème avec contraintes de précédence. Dans la seconde variante, les véhicules légers partent d’un dépôt, récupèrent les marchandises aux satellites, puis effectuent plusieurs tournées. Nous proposons une formulation basée sur les routes dont le nombre de contraintes de précédence croît exponentiellement en fonction du nombre de satellites. Un algorithme basé sur une coupe minimum est proposé pour séparer ces contraintes. Nous montrons aussi comment prendre en compte ces contraintes dans le problème de pricing de l’algorithme de génération de colonnes. Les expérimentations montrent que notre algorithme peut résoudre à l’optimalité des instances qui contiennent jusqu’à 100 clients. De plus, nous montrons que la variante du problème avec contraintes de précédence donne des résultats identiques à ceux de la variante avec synchronisation exacte pour les instances « single trip » de la littérature.La quatrième chapitre s’intéresse à des problèmes de tournées de véhicules contenant des contraintes de type sac-à-dos. Nous présentons des coupes de type « route load knapsack ». Ces coupes sont utilisées pour résoudre les trois problèmes suivants: « Capacitated Vehicle Routing Problem with Capacitated Multiple Depots », « Location- Routing Problem » et « Vehicle Routing Problem with Time Windows and Shifts ». Ces problèmes apparaissent lorsque les routes au premier niveau du réseau de distribution à deux niveaux sont fixées. Nos expérimentations permettent de trouver de nouvelles solutions optimales.", "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "Variational inequality", "Distribution (mathematics)", "Variable neighborhood search" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.theses.fr/2020BORD0199/document" }, { "id": "https://openalex.org/W7162324273", "doi": "10.3390/su18115319", "title": "Multi-Objective Optimization for the Time-Dependent Green Vehicle Routing Problem with Time Windows", "year": 2026, "publication_date": "2026-05-25", "type": "article", "language": "en", "authors": [ "Yi-Xiang Wang", "Weiquan Huang", "C Liu", "Gaosen Dong", "Fenglian Yuan", "Yi Yang", "Yongjun Ma" ], "first_author": "Yi-Xiang Wang", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "In the context of urban distribution, given the complexity of express delivery and the variability of distribution conditions, vehicle routing problems with time-dependent characteristics have received increasing attention. This study incorporates a cross-period travel time estimation method for road segments that accounts for temporal and weather-dependent variations in vehicle speed. Building upon this foundation, this study establishes an multi-objective optimization model for the green vehicle routing problem that systematically incorporates intricate constraints, including time-varing vehicle speed, fuel consumption, carbon emissions, and customer servive time windows. This model aims to achieve three primary objectives: (1) minimizing the fleet size, (2) minimizing the overall delivery expenses, which include fuel consumption and carbon emissions, and (3) maximizing the average customer satisfaction. To solve this model, we develop an improved Non-Dominated Sorting Genetic Algorithm III (INSGA-III). To effectively prevent the algorithm from becoming trapped in local optima, we propose a dual-criteria selection mechanism. Meanwhile, we introduce a destroy-and-repair variable neighborhood search strategy to enhance the algorithm’s optimization capability under complex constraints. Experimental evaluations conducted on Solomon benchmark instances as well as real-world case studies indicate that the proposed INSGA-III algorithm surpasses widely utilized multi-objective optimization methods across all assessed performance metrics. This highlights the significant potential of the presented INSGA-III algorithm for practical applications in urban delivery scenarios, which is closely linked to the sustainable development of cities.", "keywords": [ "Vehicle routing problem", "Benchmark (surveying)", "Sorting", "Genetic algorithm", "Context (archaeology)", "Variable neighborhood search", "Selection (genetic algorithm)", "Routing (electronic design automation)", "Fuel efficiency" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3390/su18115319" }, { "id": "https://openalex.org/W2790331561", "doi": "10.1007/978-3-319-74500-8_55", "title": "Towards Smart Urban Freight Distribution Using Fleets of Modular Electric Vehicles", "year": 2018, "publication_date": "2018-01-01", "type": "conference-paper", "language": "en", "authors": [ "Dhekra Rezgui", "Jouhaina Chaouachi Siala", "Wassila Aggoune‐Mtalaa", "Hend Bouziri" ], "first_author": "Dhekra Rezgui", "venue": "Lecture notes in networks and systems", "publisher": "Springer International Publishing", "abstract": null, "keywords": [ "Modular design", "Transport engineering", "Business", "Distribution (mathematics)", "Computer science", "Engineering", "Mathematics" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-74500-8_55" }, { "id": "https://openalex.org/W776830593", "doi": null, "title": "Sensitivity Analysis of Urban Distribution Based on Vehicle Routing Problem with Soft Time Windows Using Cost Functions and Evaluation of Solutions Based on Urban Distribution Centers (UDCs)", "year": 2007, "publication_date": "2007-01-01", "type": "article", "language": "en", "authors": [ "David Escuín", "Carlos Millán", "Emilio Larrodé" ], "first_author": "David Escuín", "venue": "Transportation Research Board 86th Annual MeetingTransportation Research Board", "publisher": null, "abstract": "In this paper we analyze how the physical distribution of merchandise from a pharmaceutical company is managed in the city of Zaragoza (Spain). The delivery problem is modeled as a VRPSTW problem while specific software was developed to identify bottlenecks in the distribution and to improve distribution costs without affecting service to the clients. As a novelty, we propose the use of urban micro platforms to improve the service, reduce costs and to facilitate traffic in the center of the city.", "keywords": [ "Vehicle routing problem", "Sensitivity (control systems)", "Distribution (mathematics)", "Computer science", "Software", "Service (business)", "Routing (electronic design automation)", "Transport engineering", "Novelty", "Operations research", "Engineering", "Computer network" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/801848" }, { "id": "https://openalex.org/W2208156123", "doi": "10.1109/soli.2015.7367611", "title": "Towards the electrification of urban freight delivery using modular vehicles", "year": 2015, "publication_date": "2015-11-01", "type": "conference-paper", "language": "en", "authors": [ "Dhekra Rezgui", "Wassila Aggoune‐Mtalaa", "Hend Bouziri" ], "first_author": "Dhekra Rezgui", "venue": null, "publisher": null, "abstract": "This paper introduces the electric Modular Fleet Size and Mix Vehicle Routing Problem with Time Windows (eM-FSMVRPTW), which deals with introducing new types of electric vehicles for urban freight delivery taking into account the possibility of recharging at a customer location. These electric vehicles differ from battery electric vehicles because their modules are autonomous in terms of consumption and electric charging. Therefore, the eM-FSMVRPTW is a completely new problem. Its objective is to minimize the acquisition cost, the total distance travelled and the recharging costs taking into consideration several constraints such as modularity, electric charging, time windows, capacity limit and others. As a solution method, we propose an approach based on a genetic algorithm. The experimental results demonstrate that with the modularity feature, using electric vehicles for freight delivery in urban environment is interesting economically.", "keywords": [ "Modular design", "Electrification", "Modularity (biology)", "Computer science", "Automotive engineering", "Routing (electronic design automation)", "Electric vehicle", "Battery (electricity)", "Genetic algorithm", "Transport engineering", "Electricity", "Engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/soli.2015.7367611" }, { "id": "https://openalex.org/W34642123", "doi": "10.70675/3ef91938zeec5z4506zab83z870b141d3106", "title": "Vehicle Routing for City Logistics", "year": 2014, "publication_date": "2014-03-27", "type": "dissertation", "language": "en", "authors": [ "Diego Cattaruzza" ], "first_author": "Diego Cattaruzza", "venue": null, "publisher": null, "abstract": "OPTIMISATION DE TOURNEES DE VEHICULES POUR LA LOGISTIQUE URBAINE Le transport de marchandises dans les zones urbaines est un sujet important de nos jours. Le transport est une activité vitale pour les villes, mais implique pollution, congestion, accidents. La logistique urbaine vise à optimiser les processus logistiques et de transports urbains en tenant compte des aspects environnementaux et sociaux. Cette thèse traite de cette thématique et fait partie du projet MODUM.MODUM vise à étudier un système de livraison basé sur des centres de distribution urbains. Nous présentons une classification et une analyse des mouvements de marchandises et des problèmes de tournées de véhicules (VRP) associés.La deuxième partie propose une revue complète des travaux de recherche traitant des problème VRP avec excursions multiples (MTVRP). Le MTVRP est une extension du VRP où les véhicules sont autorisés à effectuer plusieurs tournées. Nous proposons une heuristique pour le MTVRP qui est par la suite adaptée pour un problème plus riche, le MTVRP avec fenêtres de temps et dates de disponibilité. Il s'agit d'une variante du MTVRP où à chaque client est associée une fenêtre de temps et à chaque marchandise une date de disponibilité qui représente l'instant où elle devient disponible au dépôt.Par la suite, nous étudions une variante du MTVRP où les marchandises sont classées par types de produits qui ne peuvent pas être transportés dans le même véhicule. Une analyse est effectuée pour montrer l’avantage des tournées multiples pour le problème de dimensionnement des flottes.Enfin, nous décrivons le problème de tournées qui se pose dans MODUM et le simulateur qui est développé pour évaluation du système.", "keywords": [ "Vehicle routing problem", "City logistics", "Transport engineering", "Metropolitan area", "Computer science", "Heuristic", "Routing (electronic design automation)", "Process (computing)", "TRIPS architecture", "Bottleneck", "Transshipment (information security)", "Traffic congestion" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://theses.hal.science/tel-01082862v1/document" }, { "id": "https://openalex.org/W4408937802", "doi": "10.3390/smartcities8020056", "title": "Enhancing Smart City Logistics Through IoT-Enabled Predictive Analytics: A Digital Twin and Cybernetic Feedback Approach", "year": 2025, "publication_date": "2025-03-26", "type": "article", "language": "en", "authors": [ "Hajar Fatorachian", "Hadi Kazemi", "Kulwant Singh Pawar" ], "first_author": "Hajar Fatorachian", "venue": "Smart Cities", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "The increasing complexity of urban logistics in smart cities requires innovative solutions that leverage real-time data, predictive analytics, and adaptive learning to enhance efficiency. This study presents a predictive analytics framework integrating digital twin technology, IoT-enabled logistics data, and cybernetic feedback loops to improve last-mile delivery accuracy, congestion management, and sustainability in smart cities. Grounded in Systems Theory and Cybernetic Theory, the framework models urban logistics as an interconnected network, where real-time IoT data enable dynamic routing, demand forecasting, and self-regulating logistics operations. By incorporating machine learning-driven predictive analytics, the study demonstrates how AI-powered logistics optimization can enhance urban freight mobility. The cybernetic feedback mechanism further improves adaptive decision-making and operational resilience, allowing logistics networks to respond dynamically to changing urban conditions. The findings provide valuable insights for logistics managers, smart city policymakers, and urban planners, highlighting how AI-driven logistics strategies can reduce congestion, enhance sustainability, and optimize delivery performance. The study also contributes to logistics and smart city research by integrating digital twins with adaptive analytics, addressing gaps in dynamic, feedback-driven logistics models.", "keywords": [ "Internet of Things", "Cybernetics", "Computer science", "Predictive analytics", "Analytics", "Data science", "Smart city", "World Wide Web", "Artificial intelligence" ], "cited_by_count": 33, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3390/smartcities8020056" }, { "id": "https://openalex.org/W2073063492", "doi": "10.1016/j.trpro.2015.03.023", "title": "City Logistics and Traffic Management: Modelling the Inner and Outer Urban Transport Flows in a Two-tiered System", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Rodrigo Rezende Amaral", "El‐Houssaine Aghezzaf" ], "first_author": "Rodrigo Rezende Amaral", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "City logistics deals with the logistical aspects involved in urban freight transport and related operations. These include, in addition to transport, handling and storage of goods, the management of inventory, and all related pickup and delivery operations. Traffic management and control deals with all operational aspects related to the traffic flow and (re)design of infrastructure. These aspects include the possibility to turn normal traffic lanes into reserved bus lanes or to define special routes to be operated only by freight transport. In this paper we discuss and model one of the effective management strategies for city logistics and traffic management in a metropolitan area. This strategy is based on a two-tiered system for which we propose an optimization model, in natural variables, and discuss some of its related challenges and solution approaches. We then propose an instance generator for this optimization model and show the solutions of one of these instances.", "keywords": [ "Traffic management", "City logistics", "Transport engineering", "Metropolitan area", "Computer science", "Traffic flow (computer networking)", "Control (management)", "Operations research", "Engineering", "Computer security" ], "cited_by_count": 29, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146515000514/pdf" }, { "id": "https://openalex.org/W2897345579", "doi": "10.1109/cec.2018.8477687", "title": "Simplified Swarm Optimization for the Time Dependent Competitive Vehicle Routing Problem with Heterogeneous Fleet", "year": 2018, "publication_date": "2018-07-01", "type": "conference-paper", "language": "en", "authors": [ "Chia‐Ling Huang", "Yunzhi Jiang", "Shi-Yi Tan", "Wei‐Chang Yeh", "Yuk Ying Chung", "Chyh-Ming Lai" ], "first_author": "Chia‐Ling Huang", "venue": null, "publisher": null, "abstract": "Nowadays, due to the development of e-commerce, delivery time has become an important factor influencing quality of distribution service. Especially in the urban distribution environment, many factors affect the distribution time, such as traffic condition on peak hours plays an important role in outcomes of the planned schedule. Hence, more and more research devoted to the “Time-depend vehicle routing problem (TDVRP)”. Consider the competitors' factors for obtaining more sales, logistics company should serve customers before other rival distributors. Such problem is called “Time-depend vehicle routing problem in a competitive environment (TDVRPC)” whose main objectives of the problem are to minimize the travel time cost and maximize the sale. Many research papers have presented mathematical models for TDVRPC. The major weakness of the above models is they donot satisfy the “first-in-first-out (FIFO)” property which guarantee that if a vehicle leaves a for at a given time, any other vehicle leaving earlier will arrive earlier. Take into account the possible ways of handling the situation with heterogeneous fleet, so a novel model for the “Time-dependent vehicle routing problem in a competitive environment with heterogeneous fleet (TDVRPCHF)” is presented to satisfy the “FIFO” property. To solve such a problem, a Simplified Swarm Optimization algorithm is proposed and it can also be promoted on the other “time-dependent vehicle routing problem”.", "keywords": [ "Vehicle routing problem", "FIFO (computing and electronics)", "Computer science", "Schedule", "Routing (electronic design automation)", "Competitor analysis", "Operations research", "Swarm behaviour", "Computer network", "Engineering", "Business" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/cec.2018.8477687" }, { "id": "https://openalex.org/W4323543011", "doi": "10.1117/12.2670305", "title": "Research on green vehicle routing problems with mixed fleet", "year": 2023, "publication_date": "2023-03-08", "type": "conference-paper", "language": "en", "authors": [ "Chang Liu", "Jianqin Zhou" ], "first_author": "Chang Liu", "venue": null, "publisher": null, "abstract": "Currently, electric vehicles and fuel vehicles coexist in urban distribution. Given this, this paper focuses on the vehicle routing problem with the mixture of electric and fuel vehicles. Then, a green vehicle routing optimization model with a mixed fleet is proposed. The cost of carbon emissions from the fuel is considered in the model. Then, an improved genetic algorithm is designed to solve the problem. Finally, sensitivity analysis is carried out for key factors such as vehicle composition, battery capacity, and charging rate. Numerical experimental results show that the economic power of logistics enterprises to directly upgrade their fleets from all-fuel vehicles to all-electric vehicles is insufficient. The number of electric vehicles kept in the fleet should be determined according to the combination of vehicle cruising range and customer distribution. Logistics enterprises should comprehensively consider the battery capacity and charging rate to reduce the distribution cost of electric vehicles.", "keywords": [ "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Computer network" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1117/12.2670305" }, { "id": "https://openalex.org/W3199912178", "doi": null, "title": "Green Vehicle Routing Problems in the New Mobility Era", "year": 2016, "publication_date": "2016-01-01", "type": "dissertation", "language": "en", "authors": [ "Wei Gang Zhou" ], "first_author": "Wei Gang Zhou", "venue": "Figshare", "publisher": "Figshare (United Kingdom)", "abstract": "The rapid advances in wireless communication and ubiquitous mobile is changing the way people and goods move in the new mobility era. The world’s population is increasingly city-based. Urban mobility becomes one of the toughest challenges that cities face. On the one hand, the fast growing e-commerce industry has resulted in the increasing volume of goods transportation, as well as the increasing demand for freight transportation service in terms of delivery time and reliability by consumers. On the other hand, the growing environmental concerns (e.g., fuel consumption, land use, Greenhouse Gas emissions) are taking center stage. These factors have put enormous pressure on the freight carriers to meet this last-mile challenge in transportation cost, delivery time and reliability. A new generation of efficient, timely, reliable, green transportation system becomes the answer of these various problems. \\nThis dissertation aims at building a novel system that simultaneously achieves a maximization of carrier’s net profit and significantly diminishes the negative effects of freight transportation on the environment. It is of critical importance for the logistics industry to fully exploit the potential to be more efficient, flexible and sustainable. To obtain this objective, one of the most important technical cores needs to be considered is the eco-routing tool that minimizes the total transportation system cost due to travel time, fuel consumption as well as vehicular emission under different frameworks of various vehicle routing problems.\\nSpecifically, this research concentrates on three vehicle routing problems in the context of the new mobility era, namely Green Same Day Package Delivery Service with Real-time Demand, Electric Vehicle Routing Problem with Flexible Recharging and An Ad Hoc Peer-to-Peer Transshipment and Same Day Delivery Problem. These research efforts aim to tackle the following major challenges in freight industry: pre-scheduled and single shipment oriented delivery, dangerous effects on environment caused by conventional vehicle emissions, inefficient service and lack of collaboration among logistics carriers respectively.\\nThis proposed research makes significant scientific contributions to the vehicle routing literature in model formulation and algorithm design in the following aspects: (1) consideration of real-time information in routing, (2) eco-routing by minimizing other harmful pollutants such as particulate matter (PM), (3) fast online algorithms on a mobile platform (e.g., smartphone) applicable to large scale urban delivery, (4) alternative delivery mode of electric vehicles allows flexible recharging (full or partial) en-route and (5) incorporation of the ad-hoc pick-up and delivery requests in transshipment problem.\\nThe products of this research are (1) an eco-routing tool that enables real-time on-the-go cargo consolidation service, (2) an electric vehicle routing tool that helps the penetration of EVs in freight industry, and (3) an ad hoc platform that enables collaboration among couriers such that resources are better utilized. These can be applied to future urban goods delivery e-markets, which will bring customers flexible, timely and economical logistics service while maximizing couriers’ net gain through shared resources enabled by wireless communication and mobile computing. At the same time, the adverse effects of freight transportation on the environment will also be reduced, which makes the urban delivery service system more sustainable.", "keywords": [ "Exploit", "Transport engineering", "Context (archaeology)", "Greenhouse gas", "Environmental economics", "Vehicle routing problem", "Sustainable transport", "Computer science", "Business", "Routing (electronic design automation)", "Sustainability", "Engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://figshare.com/articles/thesis/Green_Vehicle_Routing_Problems_in_the_New_Mobility_Era/10829858" }, { "id": "https://openalex.org/W3036020673", "doi": "10.1287/trsc.2020.1004", "title": "Routing Electric Vehicles on Congested Street Networks", "year": 2020, "publication_date": "2020-10-02", "type": "article", "language": "en", "authors": [ "Alexandre M. Florio", "Nabil Absi", "Dominique Feillet" ], "first_author": "Alexandre M. Florio", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "Freight distribution with electric vehicles (EVs) is a promising alternative to reduce the carbon footprint associated with city logistics. Algorithms for planning routes for EVs should take into account their relatively short driving range and the effects of traffic congestion on the battery consumption. This paper proposes new methodology and illustrates how it can be applied to solve an electric vehicle routing problem with stochastic and time-dependent travel times where battery recharging along routes is not allowed. First, a new method for generating network-consistent (correlated in time and space) and time-dependent speed scenarios is introduced. Second, a new technique for applying branch and price on instances defined on real street networks is developed. Computational experiments demonstrate the effectiveness of the approach for finding optimal or near-optimal solutions in instances with up to 133 customers and almost 1,500 road links. With a high probability, the routes in the obtained solutions can be performed by EVs without requiring intermediate recharging stops. An execution time control policy to further reduce the chances of stranded EVs is also presented. In addition, we measure the cost of independence, which is the impact on solution feasibility when travel times are assumed statistically independent. Last, we give directions on how to extend the proposed framework to handle recourse actions.", "keywords": [ "Routing (electronic design automation)", "Range (aeronautics)", "Computer science", "Traffic congestion", "Driving range", "Vehicle routing problem", "Independence (probability theory)", "Mathematical optimization", "Electric vehicle", "Battery (electricity)", "Alternative fuel vehicle", "Operations research" ], "cited_by_count": 48, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.2020.1004" }, { "id": "https://openalex.org/W2285244555", "doi": "10.1016/j.trpro.2016.02.023", "title": "Synchronized Multi-trip Multi-traffic Pickup & Delivery in City Logistics", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Teodor Gabriel Crainic", "Phuong Khanh Nguyen", "Michel Toulouse" ], "first_author": "Teodor Gabriel Crainic", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The paper introduces the first methodology addressing with a single fleet of vehicles the routing of the three different types of transportation demands encountered in City Logistics, inbound, outbound and intra-city traffic. We propose a tabu search meta-heuristic calling on various neighbourhoods, dynamically selected, to provide an efficient search combining exploration and exploitation capabilities. The result analysis of extensive computational experiments qualify the impact of a number of major problem characteristics and search strategies on the quality of the meta-heuristic, the behaviour of the solutions, and the management of the City Logistics system.", "keywords": [ "Tabu search", "City logistics", "Vehicle routing problem", "Computer science", "Heuristic", "Pickup", "Transport engineering", "Routing (electronic design automation)", "Quality (philosophy)", "Operations research", "Meta heuristic", "Engineering" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146516000247/pdf" }, { "id": "https://openalex.org/W4401447590", "doi": "10.2139/ssrn.4921569", "title": "A Simulation-Optimization Approach for Synchronized Two-Echelon Multi-Trip Vehicle Routing Problems for Multimodal City Logistics", "year": 2024, "publication_date": "2024-01-01", "type": "preprint", "language": "en", "authors": [ "Bas Bijvoet", "Çiğdem Karademir", "Bilge Atasoy" ], "first_author": "Bas Bijvoet", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Vehicle routing problem", "Computer science", "Multimodal transport", "Routing (electronic design automation)", "City logistics", "Operations research", "Transport engineering", "Engineering", "Computer network" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "http://dx.doi.org/10.2139/ssrn.4921569" }, { "id": "https://openalex.org/W3039823371", "doi": "10.1109/tits.2020.3003598", "title": "Two-Echelon Dispatching Problem With Mobile Satellites in City Logistics", "year": 2020, "publication_date": "2020-06-30", "type": "article", "language": "en", "authors": [ "Yulin Lan", "Fagui Liu", "Zhixing Huang", "Wing W. Y. Ng", "Jinghui Zhong" ], "first_author": "Yulin Lan", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "At present, city logistics mostly adopts a two-echelon dispatching model which combines distribution centers located in suburbs and fixed satellites located in urban areas for distribution. However, both expensive rental fees and daily changes of customer demand in metropolitan areas make dispatching route generated by fixed satellites inefficient. Moreover, the existing mobile depot model needs a large investment for facilities. In this paper, we propose a two-echelon city dispatching model with mobile satellites (2ECD-MS) which locations of mobile satellites change according to demands of customers to ensure the efficiency of delivery routes in every day. A cluster-based variable neighborhood search scheduling algorithm is proposed to determine locations of mobile satellites and dispatching routes of trucks and tricycles. Then, the 2ECD-MS is extended to 2ECD-MS-TDD to allow trucks dispatching directly (TDD) for further cost reduction. Experimental results show that the 2ECD-MS significantly reduces the total cost against the model using fixed satellites mode by 3.5% while the 2ECD-MS-TDD further reduces the total cost against the 2ECD-MS significantly by 3.25% in 54 cases with different customer scales, geographical scopes, and distribution types. These show the superiority of the proposed methods in cost reduction for city logistics in comparison to the traditional fixed model.", "keywords": [ "Truck", "Metropolitan area", "Scheduling (production processes)", "Computer science", "Renting", "Cost reduction", "City logistics", "Transport engineering", "Total cost", "Operations research", "Real-time computing", "Engineering" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2020.3003598" }, { "id": "https://openalex.org/W2883955805", "doi": "10.3233/jifs-169721", "title": "Multi-objective location-routing problem with simultaneous pickup and delivery for urban distribution", "year": 2018, "publication_date": "2018-07-16", "type": "article", "language": "en", "authors": [ "Xuefeng Wang", "Fang Chun Yang", "Dawei Lü" ], "first_author": "Xuefeng Wang", "venue": "Journal of Intelligent & Fuzzy Systems", "publisher": "IOS Press", "abstract": "Urban distribution is regard as a time- and labor-consuming logistics activity which is critical to the residents’ daily life and municipal administration. To address this challenging practical problem, a novel multi-objective location-routing problem with simultaneous pickup and delivery is proposed. The problem seeks to minimize distribution operation cost and maximize service level by constructing a more effective logistics network. In the problem formulation, two types of delivery service modes and a fuzzy satisfaction function are use to describe the characteristics of urban distribution in real world application. To solve this specific problem, a hybrid heuristic algorithm combining tabu search and efficient procedures is presented. Through evaluating the effects of time window and service mode, and comparing heuristics performance on solving problem instances, the experimental results demonstrate the validity of the proposed model formulation and heuristic approach.", "keywords": [ "Tabu search", "Vehicle routing problem", "Computer science", "Heuristics", "Mathematical optimization", "Service level", "Routing (electronic design automation)", "Heuristic", "City logistics", "Fuzzy logic", "Service (business)", "Pickup" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3233/jifs-169721" }, { "id": "https://openalex.org/W1875059384", "doi": "10.15446/dyna.v82n191.51141", "title": "Capacitated vehicle routing problem for PSS uses based on ubiquitous computing: An emerging markets approach", "year": 2015, "publication_date": "2015-06-22", "type": "article", "language": "en", "authors": [ "Alberto Ochoa", "Francisco Ornelas", "Lourdes Y. Margain-Fuentes", "Miguel Gastón Cedillo‐Campos", "Jöns Sánchez-Aguilar", "Rubén Jaramillo-Vacio", "Isabel Ávila" ], "first_author": "Alberto Ochoa", "venue": "DYNA", "publisher": "National University of Colombia", "abstract": "The vehicle routing problem under capacity constraints based on ubiquitous computing in a perspective of deploying PSS (Product-Service Systems) configurations for urban goods transport, is addressed. It takes into account the specificities of city logistics under an emerging markets context. In this case, it involved: i) low logistical capabilities of decision makers; ii) limited availability of data; and iii) restricted access to high performance technology to compute optimal transportation routes. Therefore, the use of free download software providing inexpensive solutions (time and resources) is proposed. The paper shows the implementation of results to a software tool based on Graph Theory used to analyze and solve a CVRP (Capacitated Vehicle Routing Problem). The case of a local food delivery company located in a large city in Mexico was used. Based on small fleet vehicles with the same technical specifications and comparable load capacity.", "keywords": [ "Vehicle routing problem", "Computer science", "Software", "Context (archaeology)", "Routing (electronic design automation)", "Download", "Product (mathematics)", "Graph", "Operations research", "Service (business)", "Distributed computing", "Transport engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.15446/dyna.v82n191.51141" }, { "id": "https://openalex.org/W4310154461", "doi": "10.3390/su142315827", "title": "Research on Urban Distribution Routes Considering the Impact of Vehicle Speed on Carbon Emissions", "year": 2022, "publication_date": "2022-11-28", "type": "article", "language": "en", "authors": [ "Zhiying Yao", "Haiqing Cao", "Zhenliang Cui", "Yuru Wang", "Ning Huang" ], "first_author": "Zhiying Yao", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "To solve the low-carbon vehicle routing problem (VRP) with sustainable development background, the VRP considering the impact of vehicle speed on carbon emissions is studied. A vehicle routing optimization model aims to minimize the total cost of distribution, penalty cost and carbon emission cost. In the model, the driving time and carbon emissions are calculated on the basis of the varying vehicle speed matching the real road network. Moreover, the improved genetic algorithm is applied to optimize vehicle routing in this paper. Using the Solomon standard datasets, the experimental results validate the carbon emission cost and the total cost from the dynamic road network are lower than those from the static network; furthermore, the carbon emission cost and the total cost from the improved GE algorithm are much lower than those from the general GE algorithm in the dynamic road network. Obviously, the built model and the improved algorithm are more feasible and effective.", "keywords": [ "Vehicle routing problem", "Genetic algorithm", "Greenhouse gas", "Matching (statistics)", "Total cost", "Computer science", "Routing (electronic design automation)", "Carbon fibers", "Automotive engineering", "Mathematical optimization", "Environmental science", "Engineering" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/14/23/15827/pdf?version=1669636797" }, { "id": "https://openalex.org/W4362633336", "doi": "10.1080/23302674.2023.2191804", "title": "Routing a mixed fleet of conventional and electric vehicles for urban delivery problems: considering different charging technologies and battery swapping", "year": 2023, "publication_date": "2023-04-04", "type": "article", "language": "en", "authors": [ "Afsane Amiri", "Hossein Zolfagharinia", "Saman Hassanzadeh Amin" ], "first_author": "Afsane Amiri", "venue": "International Journal of Systems Science Operations & Logistics", "publisher": "Taylor & Francis", "abstract": "We present a vehicle routing problem with load capacity and time windows for a fleet of electric vehicles (EVs) and internal combustion vehicles (ICVs). Different charging technologies, including Level 1, 2, and 3 chargers and swapping batteries, are considered in this research. Given the location of the depot, the existing customers, and the set of charging stations, this problem aims to minimise the overall cost of constructing the routes over the vertices that need to be visited by either an ICV or EV. We develop a mixed-integer linear programming (MILP) model for this problem, and we solve small samples using a CPLEX solver. In addition, we develop two metaheuristic solution approaches by combining Adaptive Large Neighbourhood Search (ALNS) with Simulated Annealing (SA) and Tabu Search (TS). Using a set of locations from Scarborough, Ontario, Canada, we investigate the delivery routing problem with a fleet of ICVs and EVs. By solving the problem for different scenarios, we observed that EVs often require partial recharging and faster chargers (Level 3) when traveling in the city.", "keywords": [ "Simulated annealing", "Tabu search", "Vehicle routing problem", "Solver", "Computer science", "Metaheuristic", "Integer programming", "Suite", "Mathematical optimization", "Neighbourhood (mathematics)", "Routing (electronic design automation)", "Battery (electricity)" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/23302674.2023.2191804" }, { "id": "https://openalex.org/W3011944111", "doi": "10.1016/j.trpro.2020.02.032", "title": "Using the Operations Research Methods to Address Distribution Tasks at a City Logistics Scale", "year": 2020, "publication_date": "2020-01-01", "type": "article", "language": "en", "authors": [ "Ondřej Stopka", "Karel Jeřábek", "Mária Stopková" ], "first_author": "Ondřej Stopka", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The manuscript discusses the overview and specification of the existing Operations Research methods for their implementation in terms of addressing distribution tasks, in particular to optimize delivery routes at a City logistics scale. First of all, a detailed literature review in a given context is elaborated, while the description of potentially relevant techniques to be applied is presented. The manuscript objective is to identify the most appropriate and benefit methods for their implementation to solve vehicle routing problem (hereinafter as VRP) at a City logistics scale and related optimization operations; i.e. to seek the shortest possible routes during the customer’s delivery activities. In this matter, it is important to state that relevant distribution (pick-up and delivery) tasks can be expressed in a form of graphs on specified transport networks, and thereby use the individual techniques of graph theory. The particular transport network, as the basic concept of transport theory, is defined as a finite set of vertices and edges representing the infrastructure of roads of a network. Each network must be coherent, i.e. there must be at least one path for each vertex pair connecting these two vertices. Each network edge as well as vertex is defined by a certain value or set of values, for example, the edge length, the time it takes to pass, the amount of work that needs to be done on the edge, etc.", "keywords": [ "Vehicle routing problem", "Computer science", "Vertex (graph theory)", "Shortest path problem", "Set (abstract data type)", "Operations research", "Enhanced Data Rates for GSM Evolution", "Scale (ratio)", "Context (archaeology)", "Path (computing)", "Routing (electronic design automation)", "City logistics" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S235214652030082X/pdf" }, { "id": "https://openalex.org/W2729690970", "doi": "10.1109/mdm.2017.26", "title": "Understanding and Predicting Trends in Urban Freight Transport", "year": 2017, "publication_date": "2017-05-01", "type": "conference-paper", "language": "en", "authors": [ "Petar Mrazovic", "Bahaeddin Eravcı", "Josep-L. Larriba-Pey", "Hakan Ferhatosmanoğlu", "Mihhail Matskin" ], "first_author": "Petar Mrazovic", "venue": null, "publisher": null, "abstract": "Among different components of urban mobility, urban freight transport is usually considered as the least sustainable. Limited traffic infrastructures and increasing demands in dense urban regions lead to frequent delivery runs with smaller freight vehicles. This increases the traffic in urban areas and has negative impacts upon the quality of life in urban populations. Data driven optimizations are essential to better utilize existing urban transport infrastructures and to reduce the negative effects of freight deliveries for the cities. However, there is limited work and data driven research on urban delivery areas and freight transportation networks. In this paper, we collect and analyse data on urban freight deliveries and parking areas towards an optimized urban freight transportation system. Using a new check-in based mobile parking system for freight vehicles, we aim to understand and optimize freight distribution processes. We explore the relationship between areas' availability patterns and underlying traffic behaviour in order to understand the trends in urban freight transport. By applying the detected patterns we predict the availabilities of loading/unloading areas, and thus open up new possibilities for delivery route planning and better managing of freight transport infrastructures.", "keywords": [ "Traffic management", "Transport engineering", "Work (physics)", "Sustainable transport", "City logistics", "Order (exchange)", "Urban planning", "Computer science", "Business", "Sustainability", "Civil engineering", "Engineering" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/mdm.2017.26" }, { "id": "https://openalex.org/W3036256077", "doi": "10.1007/s10696-020-09391-7", "title": "Optimizing construction schedules and material deliveries in city logistics: a case study from the building industry", "year": 2020, "publication_date": "2020-06-19", "type": "article", "language": "en", "authors": [ "Pamela C. Nolz" ], "first_author": "Pamela C. Nolz", "venue": "Flexible Services and Manufacturing Journal", "publisher": "Springer Science+Business Media", "abstract": "Abstract We consider the problem of designing a logistics system to assure efficient urban construction processes for an innovative urban building area in the city of Vienna. We address the challenges of coordinating workers and the timely delivery and storage of material with the objective of optimizing resource-efficiency as well as reducing traffic related to construction tasks. The problem is formulated as a hierarchical optimization problem, incorporating tactical construction logistics planning as well as operational construction logistics planning. On the tactical level a time schedule of tasks for different construction phases and the corresponding material transports and storage decisions are optimized on a weekly basis, while on the operational level the daily optimization of material transports, modeled as an inventory routing problem, is addressed. A mixed-integer programming formulation of the problem on each planning level is provided and solved using CPLEX. The suggested approach is tested on realistic data from the city of Vienna. The results associated with different scenarios are analyzed to illustrate the value of the proposed approach for the design of construction logistics processes.", "keywords": [ "Schedule", "City logistics", "Computer science", "Operations research", "Integer programming", "Routing (electronic design automation)", "Humanitarian Logistics", "Scheduling (production processes)", "Operations management", "Transport engineering", "Engineering" ], "cited_by_count": 31, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s10696-020-09391-7.pdf" }, { "id": "https://openalex.org/W2771342347", "doi": "10.1287/trsc.2017.0770", "title": "Large Composite Neighborhoods for the Capacitated Location-Routing Problem", "year": 2017, "publication_date": "2017-12-07", "type": "article", "language": "en", "authors": [ "Michael D. Schneider", "Maximilian Löffler" ], "first_author": "Michael D. Schneider", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "The capacitated LRP (CLRP) jointly takes decisions on the location of capacitated depots and the routing of capacitated vehicles to serve a set of customers with known demands from the opened depots. In city logistics, the CLRP is used for the planning of single-echelon distribution networks. In this application context, large-scale CLRP instances with a high number of potential depot locations (representing concrete candidates for running urban depots) and a high number of customers (as a result of densely populated urban areas) are particularly relevant. We introduce a tree-based search algorithm (TBSA) that explores the space of depot configurations in a tree-like fashion using a customized first improvement strategy. In the routing phase, the multi-depot vehicle-routing problem defined by the depot configuration is solved with a granular tabu search that uses a large composite neighborhood described by 14 operators. In numerical studies, we find that using the large composite neighborhood has a positive impact on the effectivity, efficiency, and robustness of TBSA. We show that the trade-off between run time and solution quality of TBSA can be controlled by the number of total iterations and the strength of the sparsification in the granular search, and we investigate a fast, a basic, and a quality-oriented variant of TBSA. On the commonly used small-to-medium–sized CLRP benchmark sets from the literature, the fast version is able to dominate all previously published heuristic solution methods, that is, it achieves better solution quality within shorter run times. The basic and quality-oriented variants provide outstanding solution quality within reasonable run times; on average, both variants achieve negative gaps to the previous best known solutions. Thus, on the considered benchmark sets, the three variants together form the Pareto frontier of heuristic solution methods for the CLRP. Moreover, TBSA matches or improves the large majority of previous best known solutions in these instances. Finally, TBSA is able to solve newly generated, large-scale instances with up to 600 customers and 30 depots with reasonable run times and convincing scaling behavior and robustness. Additional experiments on open LRP benchmarks confirm the performance of TBSA. Data are available at https://doi.org/10.1287/trsc.2017.0770 .", "keywords": [ "Computer science", "Vehicle routing problem", "Robustness (evolution)", "Benchmark (surveying)", "Routing (electronic design automation)", "Context (archaeology)", "Tabu search", "Mathematical optimization", "Heuristic", "Tree (set theory)", "Algorithm", "Artificial intelligence" ], "cited_by_count": 57, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.2017.0770" }, { "id": "https://openalex.org/W4223955535", "doi": "10.1061/jtepbs.0000669", "title": "Sustainable Transportation Networks Incorporating Green Modes for Urban Freight Delivery", "year": 2022, "publication_date": "2022-04-15", "type": "article", "language": "en", "authors": [ "MohammadHossein Shojaei", "Fatemeh Fakhrmoosavi", "Ali Zockaie", "Mehrnaz Ghamami", "Archak Mittal", "James Fishelson" ], "first_author": "MohammadHossein Shojaei", "venue": "Journal of Transportation Engineering Part A Systems", "publisher": "American Society of Civil Engineers", "abstract": "The sustainability of transportation networks is threatened by growing amounts of emissions generated by vehicles. Urban freight delivery is one of the major sources of these emissions. Cargo cycles are attracting increasing attention for urban delivery owing to their numerous benefits, such as being less pollutant, requiring less space on roads, and high maneuverability. Electric vans have also been proposed as another green mode of freight delivery with a larger delivery capacity and range relative to cargo cycles. In this study, urban freight delivery is targeted through a heterogeneous fleet vehicle routing problem. The proposed framework is used to capture the optimal configuration of a mixed freight delivery fleet offering cargo cycles (i.e., pedal-assisted bikes and trikes as well as electric bikes and trikes) alongside the often-used diesel or gasoline vans or small trucks and electric vans. The formulated problem aims to minimize the delivery costs for companies, including maintenance, purchase, fuel, and labor costs and noise and emission taxes. The methodological contribution of this study is to develop a new metaheuristic algorithm, based on variable neighborhood search and simulated annealing, that finds a better solution with up to 7% lower objective function value and 50% to 80% lower solution times relative to the existing approaches in the literature. This study also demonstrates that bikes and trikes are selected at short delivery distances in the Chicago downtown network. Electric vans are more suitable for large distances, while cargo vans are selected for medium distances. Imposing an emission tax would change the model from cargo vans to electric vans. The results also show that increasing tax levels does not necessarily reduce societal costs because the delivery company tends to maintain its profit margin by increasing delivery costs for customers.", "keywords": [ "Truck", "Transport engineering", "City logistics", "Sustainable transport", "Sustainability", "Simulated annealing", "Vehicle routing problem", "Traffic management", "Environmental economics", "Routing (electronic design automation)", "Computer science", "Engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1061/jtepbs.0000669" }, { "id": "https://openalex.org/W4407574894", "doi": "10.1109/tits.2025.3529181", "title": "Electric Vehicle Routing Optimization for Postal Delivery and Waste Collection in Smart Cities", "year": 2025, "publication_date": "2025-02-14", "type": "article", "language": "en", "authors": [ "Maria del Cacho Estil-les", "Agostino Marcello Mangini", "Michèle Roccotelli", "Maria Pia Fanti" ], "first_author": "Maria del Cacho Estil-les", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "This paper addresses two important smart city logistics problems, i.e., Postal Delivery and Waste Collection, using Electric Vehicle Routing Problems. To this aim two Mixed Integer Linear Programming problems are formulated with the objective of carrying out the collection or delivery activities by minimizing the route length, respecting the working time, and considering the Electric Vehicles (EVs) battery charge constraints. While satisfying the customer needs under the mentioned traveling constraints, the proposed models take into account the implementation of smart charging strategies to minimize the demand peaks on the power grid both at district and charge station levels, that is suitable in large scale problems. To address the complexity of the models, a heuristic algorithm implementing clustering and routing strategies is proposed. Two case studies are implemented to demonstrate the effectiveness of the proposed models for Postal Delivery and Waste Collection activities in large systems.", "keywords": [ "Vehicle routing problem", "Electric vehicle", "Routing (electronic design automation)", "Automotive engineering", "City logistics", "Transport engineering", "Computer science", "Engineering", "Environmental science", "Computer network" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2025.3529181" }, { "id": "https://openalex.org/W2781614103", "doi": null, "title": "Vehicle Routing Problem Solving System as a CRO-GRID Application", "year": 2005, "publication_date": "2005-01-01", "type": "article", "language": "en", "authors": [ "Hrvoje Gold", "Tonči Carić", "Ante Galić", "Ivana Ćavar" ], "first_author": "Hrvoje Gold", "venue": null, "publisher": null, "abstract": "Transport logistics and fleet management problems often fall into one class of the optimization problems. Finding an optimal set of routes for group of vehicles in the transport network under defined constraints is known as the Vehicle Routing Problem (VRP). VRP represents the NP hard problem. Solving of the VRP problem can be shortened by parallelization of the time critical steps of the sequential algorithm, decomposition of the problem and distribution of its search space among the processors or by concurrent search with different amounts of synchronism and cooperation among sub-problems. The paper presents the description of the developed VRP solving system Venera/Mars and the discussion of results obtained by the implementation of the heuristic algorithms for solving the practical VRP problems in city logistics.", "keywords": [ "Vehicle routing problem", "Mathematical optimization", "Synchronism", "Computer science", "Heuristic", "Class (philosophy)", "Grid", "Set (abstract data type)", "Routing (electronic design automation)", "Fleet management", "Heuristics", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://bib.irb.hr/datoteka/204758.MIPRO-HGS-CRO-GRID-VRP.doc" }, { "id": "https://openalex.org/W4230219479", "doi": "10.4018/978-1-4666-2925-7.ch013", "title": "Multi Depot Probabilistic Vehicle Routing Problems with a Time Window", "year": 2013, "publication_date": "2013-01-03", "type": "book-chapter", "language": "en", "authors": [ "Sutapa Samanta", "Manoj K. Jha" ], "first_author": "Sutapa Samanta", "venue": "IGI Global eBooks", "publisher": "IGI Global", "abstract": "Vehicle Routing Problems (VRPs) are prevalent in all large pick up and delivery logistics systems and are critical to city logistics operations. Of notable significance are three key extensions to classical VRPs: (1) multi-depot scenario; (2) probabilistic demand; and (3) time-window constraints, which are considered simultaneously with VRPs in this paper. The issue then becomes a Multi Depot Probabilistic Vehicle Routing Problem with a Time Window (MDPVRPTW). The underlying complexities of MDPVRPTW are analyzed and a heuristic approach is presented to solve the problem. Genetic algorithms (GAs) are found to be capable of providing an efficient solution to the so-called MDPVRPTW. Within the GAs, two modification operators namely, crossover and mutation, are designed specially to solve the MDPVRPTW. Three numerical examples with 14, 25, and 51 nodes are presented to test the efficiency of the algorithm as the problem size grows. The proposed algorithms perform satisfactorily and the limiting case solutions are in agreement with the constraints. Additional work is needed to test the robustness and efficiency of the algorithms as the problem size grows.", "keywords": [ "Vehicle routing problem", "Crossover", "Probabilistic logic", "Robustness (evolution)", "Mathematical optimization", "Heuristic", "Computer science", "Routing (electronic design automation)", "Limiting", "Path (computing)", "Genetic algorithm", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.4018/978-1-4666-2925-7.ch013" }, { "id": "https://openalex.org/W2993910716", "doi": "10.1007/s12063-019-00147-7", "title": "The dynamics of diffusion of an electronic platform supporting City Logistics services", "year": 2019, "publication_date": "2019-12-01", "type": "article", "language": "en", "authors": [ "Giulio Mangano", "Giovanni Zenezini", "Anna Corinna Cagliano", "Alberto De Marco" ], "first_author": "Giulio Mangano", "venue": "Operations Management Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Business", "Incentive", "Business model", "Service (business)", "Distribution (mathematics)", "Last mile (transportation)", "Information and Communications Technology", "Service delivery framework", "Citizen journalism", "Marketing", "City logistics", "Knowledge management" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s12063-019-00147-7" }, { "id": "https://openalex.org/W2960536904", "doi": "10.1016/j.trpro.2019.06.007", "title": "Improving the Safety of Urban Freight Deliveries by Organization of the Transportation Process Considering Driver’s State", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Andrii Galkin", "Natalia Davidich", "Ludmiła Filina-Dawidowicz", "Yurii Davidich" ], "first_author": "Andrii Galkin", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "Nowadays, the problem of ensuring traffic safety has become especially acute due to the growth of the number of enterprises engaged in goods transportation. The driver is the main and direct participant in the implementation of the transport process. The organization of the drivers work significantly influences the level of productivity, efficiency and safety of traffic. The reason for driver errors during long-term driving is fatigue that reduces performance and can form the direct cause of road traffic accidents or an unfavorable condition that complicates the driver’s actions in emergencies. This study assesses the driver’s state evolution when freight is being transported along a set route in a city. The driver’s state is assessed using an indicator of the regulatory systems activity based on the analysis of the driver’s cardiograms during the performance of particular elements of the transport process. The “Driver–Vehicle–Route–Environment” system is described using parameters such as: the driver’s age and driving experience, indicator value of the regulatory systems activity before the start of movement on the route, vehicle attributes, route length and driving time. The impact of each parameter on the driver’s state was evaluated that allowed the parameters of freight transportation technology to be determined, which are rational from the standpoint of reducing driver’s fatigue. The results obtained made it possible to determine a model of the driver’s state evolution during urban freight transportation. The research results can be used by forwarders and transport companies for route planning and scheduling with regard to human factors.", "keywords": [ "Transport engineering", "Process (computing)", "Scheduling (production processes)", "Work (physics)", "Productivity", "State (computer science)", "Engineering", "Computer science", "Operations management" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S235214651930095X/pdf" }, { "id": "https://openalex.org/W4241753594", "doi": "10.1016/b978-008044109-2/50019-7", "title": "Reliable Vehicle Routing and Scheduling with Time Windows Towards City Logistics", "year": 2003, "publication_date": "2003-01-01", "type": "book-chapter", "language": "en", "authors": [ "E TANIGUCHI", "T YAMADA" ], "first_author": "E TANIGUCHI", "venue": "Elsevier eBooks", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "City logistics", "Computer science", "Scheduling (production processes)", "Routing (electronic design automation)", "Transport engineering", "Computer network", "Engineering", "Operations management" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/b978-008044109-2/50019-7" }, { "id": "https://openalex.org/W3155014226", "doi": "10.1080/13675567.2021.1914008", "title": "Impact of operational constraints in city logistics pooling efficiency", "year": 2021, "publication_date": "2021-04-14", "type": "article", "language": "en", "authors": [ "Parisa Dolati Neghabadi", "Marie‐Laure Espinouse", "Emmanuel Lionet" ], "first_author": "Parisa Dolati Neghabadi", "venue": "International Journal of Logistics Research and Applications", "publisher": "Taylor & Francis", "abstract": "City logistics pooling seems to be a promising solution to optimise urban freight transportation. Pooling is a kind of resource sharing in which the ultimate objective is to share the available resources through the active collaboration of all involved stakeholders. Several articles propose VRP-type models and methods to optimise the routing with pooling. Nevertheless, few studies focus on the impact of operational constraints in front of pooling. The main aim of this study is to fill this gap. To this end, we first identify the operational constraints against the implementation of pooling in city logistics. We then use a two-step approach based on mathematical modelling to evaluate the scenarios defined according to the identified constraints. Finally, we set several new indicators to quantify the impacts of these constraints on pooling efficiency. The proposed approach has been tested using real data raised from the literature for the city of Bogota, Colombia.", "keywords": [ "Pooling", "City logistics", "Computer science", "Operations research", "Set (abstract data type)", "Resource (disambiguation)", "Routing (electronic design automation)", "Transport engineering", "Engineering", "Artificial intelligence" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/13675567.2021.1914008" }, { "id": "https://openalex.org/W2782092739", "doi": "10.1016/j.trpro.2017.12.067", "title": "Evaluation of Alternative Paths for Reliable Routing in City Logistics", "year": 2017, "publication_date": "2017-01-01", "type": "article", "language": "en", "authors": [ "Patrick-Oliver Groß", "Jan Fabian Ehmke", "Inbal Haas", "Dirk Christian Mattfeld" ], "first_author": "Patrick-Oliver Groß", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "Due to varying traffic volumes and limited traffic infrastructure in urban areas, travel times are uncertain and differ during the day. In this environment, city logistics service providers (CLSP) have to fulfill deliveries in a cost-efficient and reliable manner. To ensure cost-efficient routing while satisfying promised delivery dates, information on the expected travel times between customers needs to be considered appropriately. Typically, vehicle routing is based on information from shortest paths between customers, to determine the cost-minimal sequence of customer visits. This information is usually precomputed using shortest path algorithms. Most approaches merely consider a single (shortest) path, based on a single cost value (e.g., distance or average travel time). To incorporate information on travel time variation, it might be of value to consider alternative paths and more sophisticated travel time models such as Interval Travel Times (ITT). In this work, we investigate the incorporation of alternative paths into city logistics vehicle routing. For this purpose, we compare our approach to classical shortest path approaches within a vehicle routing problem. Our approach considers a set of alternative paths and incorporates ITT. Experiments are conducted within an exemplary city logistics setting. Computational results show that the consideration of alternative paths allows to select better paths with regard to a trade-off between efficiency and reliability when travel times are varying.", "keywords": [ "Routing (electronic design automation)", "Shortest path problem", "Computer science", "Path (computing)", "Reliability (semiconductor)", "Vehicle routing problem", "Set (abstract data type)", "Operations research", "Interval (graph theory)", "Transport engineering", "Mathematical optimization", "Computer network" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S235214651730964X/pdf" }, { "id": "https://openalex.org/W1942478578", "doi": "10.1287/trsc.2015.0624", "title": "Enabling Urban Logistics Services at La Poste through Multi-Echelon Location-Routing", "year": 2015, "publication_date": "2015-10-15", "type": "article", "language": "en", "authors": [ "Matthias Winkenbach", "Paul R. Kleindorfer", "Stefan Spinler" ], "first_author": "Matthias Winkenbach", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "We present a large-scale static and deterministic mixed-integer linear programming (MILP) model solving a two-echelon capacitated location-routing problem (2E-CLRP) with modal choice in the context of urban logistics services (ULS). This model aims to support the development of profitable ULS by guiding the strategic decision making of postal operators as they design an optimal facility network and vehicle fleet for the centralized consolidation and transportation of inbound and outbound urban freight flows. After comprehensively analyzing operating data from La Poste, we identify the key determinants of an optimal infrastructure and fleet design for the centralized coordination and consolidation of urban freight flows under a global service time constraint. Further, we discuss the optimal design’s sensitivity to changes in the input data and parameters of the 2E-CLRP model. The main theoretical contributions of this work are an optimal routing cost estimation formula and an optimization heuristic. Together these allow us to solve the large-scale MILP problem presented here within a reasonable time and with little loss of precision.", "keywords": [ "Computer science", "Vehicle routing problem", "City logistics", "Routing (electronic design automation)", "Network planning and design", "Operations research", "Integer programming", "Context (archaeology)", "Heuristic", "Consolidation (business)", "Constraint (computer-aided design)", "Service (business)" ], "cited_by_count": 85, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.2015.0624" }, { "id": "https://openalex.org/W4200494434", "doi": "10.3390/infrastructures6120180", "title": "Freight Operations Modelling for Urban Delivery and Pickup with Flexible Routing: Cluster Transport Modelling Incorporating Discrete-Event Simulation and GIS", "year": 2021, "publication_date": "2021-12-17", "type": "article", "language": "en", "authors": [ "Zichong Lyu", "Dirk John Pons", "Yilei Zhang", "Zuzhen Ji" ], "first_author": "Zichong Lyu", "venue": "Infrastructures", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Urban pickup and delivery (PUD) activities are important for logistics operations. Real operations for general freight involve a high degree of complexity due to daily variability. Discrete-event simulation (DES) is a method that can mimic real operations and include stochastic parameters. However, realistic vehicle routing is difficult to build in DES models. The objective is to create a DES model for realistic freight routing, which considers the driver’s routing decisions. Realistic models need to predict the delivery route (including time and distance) for variable consignment address and backhaul pickup. Geographic information systems (GIS) and DES were combined to develop freight PUD models. GIS was used to process geographical data. Two DES models were developed and compared. The first was a simple suburb model, and the second an intersection-based model. Real industrial data were applied including one-year consignment data and global positioning system (GPS) data. A case study of one delivery tour is shown, with results validated with actual GPS data. The DES results were also compared with conventional GIS models. The result shows the intersection-based model is adequate to mimic actual PUD routing. This work provides a method for combining GIS and DES to build freight operation models for urban PUD. This has the potential to help industry logistics practitioners better understand their current operations and experiment with different scenarios.", "keywords": [ "Consignment", "Routing (electronic design automation)", "Computer science", "Intersection (aeronautics)", "Vehicle routing problem", "Global Positioning System", "Event (particle physics)", "Geographic information system", "Process (computing)", "Transport engineering", "Operations research", "Data mining" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2412-3811/6/12/180/pdf?version=1639968653" }, { "id": "https://openalex.org/W2051556336", "doi": "10.1061/9780784413753.212", "title": "Dynamic Vehicle Routing Optimization on Urban Distribution with Real-Time Information", "year": 2014, "publication_date": "2014-09-17", "type": "conference-paper", "language": "en", "authors": [ "Pingzhong Lai", "Ting Zhang", "Zhan Bian", "Zhihong Jin" ], "first_author": "Pingzhong Lai", "venue": null, "publisher": null, "abstract": "In view of the situation of urban distribution, the dynamic vehicle routing problem - in which the information keeps changing during the distribution process - is studied. Various kinds of real-time factors are analyzed. By introducing virtual customers, the paper converts the dynamic vehicle routing problem into the classic single-type static vehicle routing problem and proposes a model based on natural description. A two-stage solving strategy is put forward, and a hybrid genetic algorithm is constructed. Numerical experiment results show that the model and algorithm can effectively reduce the distribution cost.", "keywords": [ "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Genetic algorithm", "Mathematical optimization", "Process (computing)", "Distribution (mathematics)", "Distributed computing", "Computer network", "Mathematics", "Machine learning" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1061/9780784413753.212" }, { "id": "https://openalex.org/W4400113254", "doi": "10.1109/logistiqua61063.2024.10571498", "title": "Artificial Intelligence: A Key to Smart and Sustainable Urban Freight Transport", "year": 2024, "publication_date": "2024-05-02", "type": "conference-paper", "language": "en", "authors": [ "Hafssa Ridaoui", "Imane Moufad", "Fouad Jawab", "Jabir Arif" ], "first_author": "Hafssa Ridaoui", "venue": null, "publisher": null, "abstract": "This article delves into the functions and impacts of artificial intelligence (AI) in urban freight transport (UFT), starting by defining AI and urban freight transport as well as its performance. After citing examples of AI applications and their utilities in UFT based on a background that encompasses publications from ten years, the article examines the opportunities and challenges presented by AI in this field. Opportunities include improving route optimization, real-time monitoring, and better resource management, while challenges encompass concerns regarding data privacy, integration complexities, and ethical considerations. Ultimately, the article ends by highlighting the transformative possibilities of AI in UFT and underscores the necessity of tackling challenges to fully harness its advantages.", "keywords": [ "Key (lock)", "Sustainable transport", "Computer science", "Traffic management", "Transport engineering", "Computer security", "Engineering", "Sustainability" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/logistiqua61063.2024.10571498" }, { "id": "https://openalex.org/W2022480144", "doi": "10.1016/j.trpro.2014.10.001", "title": "The Multi-path Traveling Salesman Problem with Stochastic Travel Costs: Building Realistic Instances for City Logistics Applications", "year": 2014, "publication_date": "2014-01-01", "type": "article", "language": "en", "authors": [ "Francesca Maggioni", "Guido Perboli", "Roberto Tadei" ], "first_author": "Francesca Maggioni", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "One of the main issues related to routing problems applied in an urban context with uncertainty related to the transportation costs is how to define realistic instances. In this paper, we overcome this issue, providing a standard methodology to extend routing instances from the literature incorporating real data provided by sensors networks. In order to test the methodology, we consider a routing problem specifically designed for City Logistics and Smart City applications, the multi-path Traveling Salesman Problem with stochastic travel costs, where several paths connect each pair of nodes and each path shows a stochastic travel cost with unknown distribution.", "keywords": [ "Travelling salesman problem", "Computer science", "Routing (electronic design automation)", "Context (archaeology)", "Path (computing)", "Vehicle routing problem", "Operations research", "Mathematical optimization", "Engineering", "Mathematics", "Computer network", "Geography" ], "cited_by_count": 31, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146514001641/pdf" }, { "id": "https://openalex.org/W2967402378", "doi": "10.17635/lancaster/thesis/628", "title": "Mathematical models and solution algorithms for the vehicle routing problem with environmental considerations", "year": 2019, "publication_date": "2019-01-01", "type": "dissertation", "language": "en", "authors": [ "Ramin Raeesi" ], "first_author": "Ramin Raeesi", "venue": "Lancaster EPrints (Lancaster University)", "publisher": "Lancaster University", "abstract": "Urban freight distribution is essential for the functioning of urban economies. However, it is contributing significantly to problems such as traffic congestion and environmental pollution. The main goal of this research is to contribute to greening urban freight distribution by developing new mathematical models and solution algorithms pertaining to the two major steams in Vehicle Routing Problems (VRPs) with environmental considerations: (i) VRPs with an explicit fuel consumption estimation component as a proxy for emissions, and (ii) VRPs with vehicles in the fleet that run on a cleaner alternative fuel such as electricity. In the first stream, this thesis develops and solves a new realistic multi-objective variant of the pollution-routing problem, referred to as the Steiner Pollution-Routing Problem (SPRP), that is studied directly on the original urban roadway network. The proposed variant is capable of incorporating the real operating conditions of urban freight distribution, and striking a balance between traditional business and environmental objectives, while integrating all factors that have a major impact on fuel consumption, including the time-varying congestion speed, vehicle load, vehicle’s physical and mechanical characteristics, and acceleration and deceleration rates. The thesis develops new combinatorial results that facilitate problem solution on the original roadway network and also introduces new mathematical models for synthesizing the expected second-by-second driving cycle of a vehicle over a given road-link at a given time of the day. New efficient multi-objective optimisation heuristics are also developed for addressing realistic instances of the SPRP. On the other hand, in the latter stream discussed above, to tackle the significantly impeding problem of range anxiety in the face of goods distribution using Electric Commercial Vehicles (ECVs), a paradigm shift in the routing of ECVs is proposed by introducing the Electric Vehicle Routing Problem with Synchronised Ambulant Battery Swapping/Recharging (EVRP-SABS). The proposed problem exploits new technological developments corresponding to the possibility of mobile battery swapping (or recharging) of ECVs using a Battery Swapping Van (BSV). In the EVRP-SABS, routing takes place in two levels for the ECVs that carry out delivery tasks, and for the BSVs that provide the running ECVs with fully charged batteries on their route. There is, therefore, a need to establish temporal and spatial synchronisations between the vehicles in the two levels and to do so new combinatorial results and a new solution algorithm is proposed.", "keywords": [ "Vehicle routing problem", "Heuristics", "Fuel efficiency", "Traffic congestion", "Routing (electronic design automation)", "Heuristic", "Transport engineering", "Computer science", "Operations research", "Mathematical optimization", "Engineering", "Automotive engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://eprints.lancs.ac.uk/id/eprint/135055/1/2019raeesiphd.pdf" }, { "id": "https://openalex.org/W237422646", "doi": null, "title": "An initial solution heuristic for the vehicle routing and scheduling problem.", "year": 2007, "publication_date": "2007-08-27", "type": "dissertation", "language": "en", "authors": [ "Johan W. Joubert" ], "first_author": "Johan W. Joubert", "venue": "UpSpace Institutional Repository (University of Pretoria)", "publisher": "University of Pretoria", "abstract": "South Africa provides a fascinating interface between the developed and the developing world and poses a multitude of opportunities for enhancing the sustainable development of local cities. The concept of City Logistics is concerned with the mobility of cities, and entails the process of optimizing urban logistics activities by considering the social, environmental, economic, financial, and energy impacts of urban freight movement. Vehicle routing and scheduling has the potential to address a number of these key focus areas. Applying optimization to vehicle routing and scheduling results in a reduced number of trips, better fleet utilization, and lower maintenance costs; thereby improving the financial situation of the fleet owner. Improved fleet utilization could have a positive environmental impact, while also improving the mobility of the city as a whole. Energy utilization is improved while customer satisfaction could also increase through on-time deliveries and reliability. The Vehicle Routing Problem (VRP) is a well-researched problem in Operations Research literature. The main objective of this type of problem is to minimize an objective function, typically distribution cost for individual carriers. The area of application is wide, and specific variants of the VRP transform the basic problem to conform to application specific requirements. It is the view of this dissertation that the various VRP variants have been researched in isolation, with little effort to integrate various problem variants into an instance that is more appropriate to the South African particularity with regards to logistics and vehicle routing. Finding a feasible, and integrated initial solution to a hard problem is the first step in addressing the scheduling issue. This dissertation attempts to integrate three specific variants: multiple time windows, a heterogeneous fleet, and double scheduling. As the problem is burdened with the added constraints, the computational effort required to find a solution increases. The dissertation therefore also contributes to reducing the computational burden by proposing a concept referred to as time window compatibility to intelligently evaluate the insertion of customers on positions within routes. The initial solution algorithm presented proved feasible for the integration of the variants, while the time window compatibility decreased the computational burden by 25%, and as much as 80% for specific customer configurations, when using benchmark data sets from literature. The dissertation also improved the quality of the initial solution, for example total distance traveled, by 13%. Finding an initial solution is the first step in solving vehicle routing problems. The second step is to improve the initial solution iteratively through an improvement heuristic in an attempt to find a global optimum. Although the improvement heuristic falls outside the scope of this dissertation, improvement of the initial solution has a significant impact on the quality of improvement heuristics, and is therefore a valuable contribution.", "keywords": [ "Vehicle routing problem", "Scheduling (production processes)", "Computer science", "Mathematical optimization", "Heuristic", "Operations research", "Routing (electronic design automation)", "Engineering", "Mathematics", "Computer network" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/2263/27582" }, { "id": "https://openalex.org/W2737615773", "doi": "10.3141/2609-07", "title": "Logistics Chain Modeling for Urban Freight", "year": 2017, "publication_date": "2017-01-01", "type": "article", "language": "en", "authors": [ "Takanori Sakai", "Kazuya Kawamura", "Tetsuro Hyodo" ], "first_author": "Takanori Sakai", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "In existing freight models, the choice of locations for logistics facilities and the choice of logistics facilities for routing the shipments are often treated without distinction, although these two decisions are separate and affected by different factors. In this paper, models for choosing a logistics facility are developed that match truck trip ends with logistics facilities by using a large urban freight survey data from the Tokyo Metropolitan Area. The models can be used to estimate truck traffic flows associated with transshipments. The urban portion of the logistics chains was categorized into five types of movements, and 30 models were developed to analyze six commodity groups separately. The results indicated that the proposed approach could capture the mechanism of the selection of a logistics facility by movement and commodity type. The tests for the reproducibility of the models warrant the future use of the models for analysis of urban freight demand.", "keywords": [ "City logistics", "Truck", "Transport engineering", "Traffic management", "Metropolitan area", "Commodity", "Business", "Facility location problem", "Operations research", "Computer science", "Engineering", "Geography" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/2609-07" }, { "id": "https://openalex.org/W2099713529", "doi": "10.1016/j.trpro.2015.09.019", "title": "Exploiting Travel Time Information for Reliable Routing in City Logistics", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Patrick-Oliver Groß", "Marlin Wolf Ulmer", "Jan Fabian Ehmke", "Dirk Christian Mattfeld" ], "first_author": "Patrick-Oliver Groß", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "Due to varying traffic volumes and limited traffic infrastructure in urban areas, travel times generally are uncertain and differ during the day. In this environment, city logistics service providers (CLSP) have to fulfill deliveries cost-efficient and reliable. To ensure cost-efficient routing while satisfying promised delivery dates, information on expected travel times between customers needs to be exploited. If sufficient amount of data is not available or expensive to acquire, deriving this information presents a major challenge for CLSP. Therefore, we propose the usage of interval travel times (ITT) to enable cost-efficient and reliable routing in urban areas. ITT define an expected range of travel times, which can be derived with relatively low effort by CLSP. We present and discuss the process of deriving ITT. Further, we investigate an existing approach from the domain of robust planning within the scope of rout- ing in urban areas. An exemplary city logistics setting is developed and different routing solutions are examined. Computational experiments show that, in contrast to well-known deterministic approaches, routing considering ITT allows both, cost-efficient and reliable routing.", "keywords": [ "Transport engineering", "Travel time", "Routing (electronic design automation)", "City logistics", "Vehicle routing problem", "Time travel", "Computer science", "Operations research", "Engineering", "Computer network", "Artificial intelligence" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146515002069/pdf" }, { "id": "https://openalex.org/W2624093013", "doi": "10.1016/j.trpro.2017.05.476", "title": "Utilization of cellular automata for analysis of the efficiency of urban freight transport measures based on loading/unloading bays example", "year": 2017, "publication_date": "2017-01-01", "type": "article", "language": "en", "authors": [ "Stanisław Iwan", "Krzysztof Małecki" ], "first_author": "Stanisław Iwan", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The analysis of urban freight traffic is a difficult research area, due to the following major reasons: a big number of factors that prevent a clear definition of its characteristics and lack of data regarding the traffic flows, classification of vehicles, vehicles routes etc. The above influence on problem with analysis of the efficiency of urban freight transport measures. Computer simulation could be significant helpful in this area. The main objective of this paper is to introduce usability of cellular automata as the tool for simulation of traffic in urban freight transport systems. The basis of the analysis will be the example of utilization of loading/unloading bays. Presented simulation will help to analyse the efficiency of this measure as well as its potential influence on city environment.", "keywords": [ "Cellular automaton", "Transport engineering", "Traffic management", "Usability", "Computer science", "Traffic analysis", "Measure (data warehouse)", "Operations research", "Environmental science", "Engineering", "Data mining", "Computer security" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146517307834/pdf" }, { "id": "https://openalex.org/W2279586188", "doi": "10.1016/j.trpro.2016.02.015", "title": "Quantifying the Impacts of Sustainable City Logistics Measures in the Mexico City Metropolitan Area", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Miguel Jaller", "S. Sánchez", "Joanne Green", "Magdalena Fandiño-Del-Río" ], "first_author": "Miguel Jaller", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "This paper discusses the assessment of the potential impacts of a number of city logistics measures proposed for the Metropolitan Area of the Mexico City Valley: off-hour delivery programs; policies and agreements to increase cargo consolidation and decrease empty trips; and the implementation of preferential truck routes. The analyses consider the impacts on travel distances, travel times, accidents, emissions and health impacts. In doing so, the authors discuss the proposed measures, the assumptions used to estimate the impacts, and the information required. Different scenarios are evaluated for the various measures.", "keywords": [ "Metropolitan area", "TRIPS architecture", "City logistics", "Truck", "Transport engineering", "Business", "Consolidation (business)", "Environmental planning", "Geography", "Engineering", "Finance" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trpro.2016.02.015" }, { "id": "https://openalex.org/W289609390", "doi": "10.1016/b978-008044799-5/50091-7", "title": "Modelling the Effects of City Logistics Schemes", "year": 2006, "publication_date": "2006-01-01", "type": "book-chapter", "language": "en", "authors": [ "Tadashi Yamada", "Eiichi Taniguchi" ], "first_author": "Tadashi Yamada", "venue": "Elsevier eBooks", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "City logistics", "Business", "Computer science", "Transport engineering", "Engineering" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/b978-008044799-5/50091-7" }, { "id": "https://openalex.org/W3197370355", "doi": "10.1007/978-3-030-85910-7_64", "title": "Minimising Total Costs of a Two-Echelon Multi-Depot Capacitated Vehicle Routing Problem (2E-MD-CVRP) that Describes the Utilisation of the Amsterdam City Canal Network for Last Mile Parcel Delivery", "year": 2021, "publication_date": "2021-01-01", "type": "conference-paper", "language": "en", "authors": [ "Bartje Alewijnse", "Alexander Hübl" ], "first_author": "Bartje Alewijnse", "venue": "IFIP advances in information and communication technology", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Transport engineering", "Vehicle routing problem", "Last mile (transportation)", "Mile", "Routing (electronic design automation)", "Total cost", "Investment (military)", "City logistics", "Flow network", "Operations research", "Environmental science", "Computer science" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://inria.hal.science/hal-03806534v1/file/520761_1_En_64_Chapter.pdf" }, { "id": "https://openalex.org/W1503965725", "doi": "10.1016/s1474-6670(17)38146-6", "title": "How to Change Urban Traffic with City Logistics", "year": 2000, "publication_date": "2000-06-01", "type": "conference-paper", "language": "en", "authors": [ "Uwe Köhler" ], "first_author": "Uwe Köhler", "venue": "IFAC Proceedings Volumes", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "City logistics", "Traffic management", "Truck", "Transport engineering", "Scheduling (production processes)", "Vehicle routing problem", "Business", "Routing (electronic design automation)", "Operations research", "Computer science", "Engineering", "Operations management" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/s1474-6670(17)38146-6" }, { "id": "https://openalex.org/W2280931785", "doi": "10.1016/j.trpro.2016.02.028", "title": "Analysis of the Functioning of Urban Deliveries in the City Centre and its Environmental Impact Based on Szczecin Example", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Kinga Kijewska", "Stanisław Iwan" ], "first_author": "Kinga Kijewska", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The main problem arising in the process of analysing the functioning of the transport and distribution of goods in urban areas is the lack of data on their implementation, in particular with regard to the classification of vehicles, their routes, changes in demand for transport, etc. The paper introduces the methodology and results of analysis of the goods distribution within the city centre of Szczecin in the area covering the significant number of companies, retail and service entities, entities of the HoReCa sector, schools, universities, and public administration. Major objective of the study was to analyse the influence of deliveries on city environment. It should be emphasized that due to the polycentric structure of Szczecin it was difficult to identify its city centre. This example could be good reference for the analysis realized in other cities, especially taking to the account their similarity to Szczecin.", "keywords": [ "Transport engineering", "Service (business)", "Distribution (mathematics)", "Process (computing)", "Business", "Goods and services", "Regional science", "Environmental planning", "Geography", "Environmental economics", "Engineering", "Computer science" ], "cited_by_count": 32, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146516000296/pdf" }, { "id": "https://openalex.org/W3130929187", "doi": "10.1016/j.ijepes.2021.106770", "title": "Assessment of the impact of a fully electrified postal fleet for urban freight transportation", "year": 2021, "publication_date": "2021-02-24", "type": "article", "language": "en", "authors": [ "Miguel Martínez", "Asier Moreno", "Ignacio Angulo", "Carlos Mateo", "Antonio David Masegosa", "Asier Perallos", "Pablo Frías" ], "first_author": "Miguel Martínez", "venue": "International Journal of Electrical Power & Energy Systems", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Electrification", "Last mile (transportation)", "Transport engineering", "Service (business)", "Distribution (mathematics)", "Planner", "Electricity", "Engineering", "Automotive engineering", "Operations research", "Mile", "Computer science" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/20.500.14454/4145" }, { "id": "https://openalex.org/W2260911485", "doi": "10.1287/trsc.2015.0600", "title": "The Multicommodity-Ring Location Routing Problem", "year": 2015, "publication_date": "2015-07-28", "type": "article", "language": "en", "authors": [ "Paolo Gianessi", "Laurent Alfandari", "Lucas Létocart", "Roberto Wolfler Calvo" ], "first_author": "Paolo Gianessi", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "The multicommodity-ring location routing problem (MRLRP) studied in this paper is an NP-hard minimization problem arising in city logistics. The aim is to locate a set of urban distribution centers (UDCs) and to connect them via a ring in which massive flows of goods will circulate. Goods are transported from gates located outside the city to a UDC, and either join a second UDC through the ring before being delivered in electric vans to the final customers or are delivered directly to the customers from the first UDC. The reverse trip with pickup and transportation to the gates is also possible. A delivery service path starts at a particular UDC, then visits a subset of customers and ends at the same UDC, another UDC, or a self-service parking lot (SPL). A pickup route can start from an SPL or a UDC and ends at a UDC. The objective is to minimize the sum of the installation costs of the ring, flow transportation costs, and routing costs. The MRLRP belongs to the class of location-routing problems (LRP). We model it with a set-partitioning-like representation of delivery and pickup trips and arc-flow elements to describe goods transportation in the ring and between the ring and the gates. We present three approaches to solving the MRLRP: an exact method for small-size instances, a matheuristic for instances of a larger size, and a hybrid approach that applies the exact method to the columns output by the matheuristic. Numerical results are provided for an exhaustive set of instances, obtained by extending benchmark instances of the capacitated LRP with additional MRLRP features.", "keywords": [ "Pickup", "Routing (electronic design automation)", "Computer science", "Ring (chemistry)", "Vehicle routing problem", "Flow network", "Mathematical optimization", "Service (business)", "Mathematics", "Computer network", "Artificial intelligence", "Economics" ], "cited_by_count": 45, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.2015.0600" }, { "id": "https://openalex.org/W4403552748", "doi": "10.3389/ffutr.2024.1491799", "title": "Urban freight distribution with electric vehicles: comparing some solution procedures", "year": 2024, "publication_date": "2024-10-18", "type": "article", "language": "en", "authors": [ "Antonio Polimeni", "Alessia Donato", "Orlando Marco Belcore" ], "first_author": "Antonio Polimeni", "venue": "Frontiers in Future Transportation", "publisher": "Frontiers Media", "abstract": "The Vehicle Routing Problem (VRP) is a well-known discrete optimization problem that has an impact on theoretical and practical applications. In this paper, a freight distribution model that includes a charging system located at the depot, making it feasible for real world-implementation, is proposed. Two different solution methods are proposed and compared: a genetic algorithm (GA) and a population-based simulated annealing (PBSA) with the number of moves increasing during the iterations. Among the variety of algorithm used to solve the VRP, population-based search methods are the most useful, due to the ability to update the memory at each iteration. To demonstrate the practical aspects of the proposed solution a case study is solved using travel time on a real network to evaluate the potentiality for a real-world application.", "keywords": [ "Distribution (mathematics)", "Transport engineering", "City logistics", "Computer science", "Environmental science", "Engineering", "Mathematics" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.frontiersin.org/journals/future-transportation/articles/10.3389/ffutr.2024.1491799/pdf" }, { "id": "https://openalex.org/W563200917", "doi": "10.1002/9781119307785.ch4", "title": "The Routing Problem of an Innovative Urban Freight Distribution Scheme", "year": 2016, "publication_date": "2016-05-27", "type": "other", "language": "en", "authors": [ "Elvezia Maria Cepolina", "Alessandro Farina" ], "first_author": "Elvezia Maria Cepolina", "venue": null, "publisher": null, "abstract": "This chapter refers to an innovative urban freight distribution scheme aimed at reducing the externalities connected with the freight delivery process. Both packages destined for commercial activities and private consumers are taken into account. It focuses on the problem of choosing the boxes to be loaded on each vehicle and the related choice of the route to be assigned to each vehicle: from the urban distribution centers (UDCs) to the first stop where the first box should be unloaded, to the second stop where the second box should be unloaded, and then back to the UDC. A methodology for this specific routing problem is proposed and its application to the case study of Genoa city center is presented. Some modifications to the original problem have been proposed because the original capacitated vehicle routing problem (CVRP) problem requires that each customer must be served by a maximum of one delivery route.", "keywords": [ "Vehicle routing problem", "Scheme (mathematics)", "Routing (electronic design automation)", "Transport engineering", "Distribution (mathematics)", "City logistics", "Computer science", "Externality", "Process (computing)", "Operations research", "Distribution center", "Mathematical optimization" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/9781119307785.ch4" }, { "id": "https://openalex.org/W3121889014", "doi": "10.1016/j.tre.2020.102210", "title": "The two-echelon production routing problem with cross-docking satellites", "year": 2021, "publication_date": "2021-01-19", "type": "article", "language": "en", "authors": [ "Yuzhuo Qiu", "Dan Chen Zhou", "Yanan Du", "Jie Liu", "Pãnos M. Pardalos", "Jun Qiao" ], "first_author": "Yuzhuo Qiu", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Integer programming", "Routing (electronic design automation)", "Computer science", "Mathematical optimization", "Operations research", "City logistics", "Production (economics)", "Engineering", "Transport engineering", "Economics", "Mathematics" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2020.102210" }, { "id": "https://openalex.org/W1588071804", "doi": null, "title": "Costs and benefits of logistics pooling for urban freight distribution: scenario simulation and assessment for strategic decision support", "year": 2011, "publication_date": "2011-11-09", "type": "preprint", "language": "en", "authors": [ "Jesús González-Feliu" ], "first_author": "Jesús González-Feliu", "venue": "RePEc: Research Papers in Economics", "publisher": "Federal Reserve Bank of St. Louis", "abstract": "Collaborative transportation and logistics pooling are relatively new concepts in research, but are very popular in practice. In the last years, collaborative transportation seems a good city logistics alternative to classical urban consolidation centres, but it is still in a development stage. This paper proposes a framework for urban logistics pooling ex-ante evaluation. This framework is developed with two purposes. The first is to generate comparable contrasted or progressive scenarios representing realistic situations; the second to simulate and assess them to make a \"before-after\" comparative analysis. In this framework, a demand generation model is combined with a route optimization algorithm to simulate the resulting routes of the proposed individual or collaborative distribution schemes assumed by each scenario. Then, several indicators can be obtained, mainly travelled distances, working times, road occupancy rates and operational monetary costs. To illustrate that framework, several scenarios for the urban area of Lyon (France) are simulated and discussed to illustrate the proposed framework possible applications.", "keywords": [ "Pooling", "Operations research", "Computer science", "City logistics", "Occupancy", "Transport engineering", "Engineering", "Artificial intelligence", "Civil engineering" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://shs.hal.science/halshs-00688967" }, { "id": "https://openalex.org/W4313338968", "doi": "10.1109/3ict56508.2022.9990687", "title": "Efficiency optimization of vehicle routing problem with considering IoT - a case study in Slovakia", "year": 2022, "publication_date": "2022-11-20", "type": "conference-paper", "language": "en", "authors": [ "Mohammad Zaher Akkad", "Sameh Haidar", "Rana Rabee", "Tamás Bányai" ], "first_author": "Mohammad Zaher Akkad", "venue": "2022 International Conference on Innovation and Intelligence for Informatics, Computing, and Technologies (3ICT)", "publisher": null, "abstract": "Due to its complexity, vehicle routing is considered a challenging problem in the transportation and logistics area, because finding the best solution is considered almost impossible due to the amount of consumed time and limited resources. Therefore, optimization algorithms are used to find the optimal value or best possible solution within a relatively short time to reach the most effective and cost-efficient result, especially in the vehicles sector where cost and quality are both considered important factors. Optimization algorithms evolved from conventional mathematical methods to modern developed ones that use heuristic and metaheuristic approaches. IoT applications and developments show an interesting step forward in city logistics and transportation in general. IoT gives a big impact and potential for raising energy efficiency since it provides strong involvement as effective tools to get data and interact with it. In this article, the authors present a study that describes the effectiveness of four metaheuristic optimization algorithms next to present and analyze a case study in Slovakia where thirty locations in the city center of Kosice are used to solve the vehicle routing problem in two applications, direct TSP application and MTSP application with consideration for the IoT involvement. The optimization algorithms are analyzed and discussed by five benchmarks to compare the minimization results and execution time. The used model in the case study is described, and the four metaheuristic algorithms (GA, PSO, SA, and ACO) are compared against the nearest neighbor algorithm where they showed better results.", "keywords": [ "Metaheuristic", "Computer science", "Heuristic", "Vehicle routing problem", "Mathematical optimization", "Routing (electronic design automation)", "Minification", "Algorithm", "Artificial intelligence", "Mathematics", "Computer network" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/3ict56508.2022.9990687" }, { "id": "https://openalex.org/W3164155393", "doi": "10.17632/5db8mtw4wg.2", "title": "New Realistic Sets of Benchmark Instances for Vehicle Routing Problem with Asymmetric Costs", "year": 2021, "publication_date": "2021-05-13", "type": "article", "language": "en", "authors": [ "Keyju Lee" ], "first_author": "Keyju Lee", "venue": "Data Archiving and Networked Services (DANS)", "publisher": "Royal Netherlands Academy of Arts and Sciences", "abstract": "New Realistic Sets of Benchmark Instances for Vehicle Routing Problem with Asymmetric Costs Data abstract: - Despite the importance, relatively little attention has been paid to vehicle routing problems with asymmetric costs (ACVRPs), or their benchmark instances. - Taking advantage of recent advances in map application programming interfaces (APIs) and shared spatial data, this paper proposes new realistic sets of ACVRP benchmark instances. - The spatial data of urban distribution centers, postal hubs, large shopping malls, residential complexes, restaurant businesses, and convenience stores are used. - To create distance and time matrices, the T map API, one of the most frequently used real time path analysis and distance measurement tools in South Korea, is used. 54 data sets are provided For each data set, 12 instances can be created (2 types of cost matrix, 2 types of vehicle capacities, 3 types of demand volumes) This make the total of 648 ACVRP benchmark instances - Each data set is named using the name city, depot, customers, and dimension (and distance range). - In case of SLAS100, the city is Seoul, depot is logistics center (urban distribution center), customers are in residential facilities (apartments), and the dimension is small with the value of 100. Each data set consists of the following: - Coordinates.csv: x and y coordinates in WGS-84 format - Cost_Distance.csv: road-distance matrix for each pair of nodes, from (row) and to (column) - Cost_Time.csv: road-time matrix for each pair of nodes, from (row) and to (column) - Vehicle_V1.csv: 1-ton truck's vehicle capacity in volume (cubic meters) - Vehicle_V2.csv: 2.5-ton truck's vehicle capacity in volume (cubic meters) - Volume_V1M5.csv: customer demand in volume (cubic meters), matched with Vehicle_V1.csv, case 1 - Volume_V1M10.csv: customer demand in volume (cubic meters), matched with Vehicle_V1.csv, case 2 - Volume_V1M20.csv: customer demand in volume (cubic meters), matched with Vehicle_V1.csv, case 3 - Volume_V2M5.csv: customer demand in volume (cubic meters), matched with Vehicle_V2.csv, case 1 - Volume_V2M10.csv: customer demand in volume (cubic meters), matched with Vehicle_V2.csv, case 2 - Volume_V2M20.csv: customer demand in volume (cubic meters), matched with Vehicle_V2.csv, case 3 - Folder: Solutions Each solution folder consists of the following: - bestSolution.txt: best solution found in 10 replications - solutionOFV.txt: OFV values for each replication - solutionTime.txt: solution time for each replication (seconds) * The solutions are provided using sweep and simulated annealing algorithms Acknowledgments: Special thanks goes to Representative Director of SL Solution, Hyojoon Cha, and Director of Research Institute at SL Solution, Jaeseok Song. SL Solution, in charge of maintenance for the T map API, provided real time road distance and road time information for the benchmarks.", "keywords": [ "Benchmark (surveying)", "Computer science", "Vehicle routing problem", "Routing (electronic design automation)", "Mathematical optimization", "Mathematics", "Geography", "Computer network" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://figshare.com/articles/dataset/New_Realistic_Sets_of_Benchmark_Instances_for_Vehicle_Routing_Problem_with_Asymmetric_Costs/14594581" }, { "id": "https://openalex.org/W4231216481", "doi": "10.1504/ijdss.2019.104556", "title": "Traffic flow forecasting for city logistics: a literature review and evaluation", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Evripidis P. Kechagias", "Sotiris P. Gayialis", "Grigorios D. Konstantakopoulos", "Georgios Α. Papadopoulos" ], "first_author": "Evripidis P. Kechagias", "venue": "International Journal of Decision Support Systems", "publisher": "Inderscience Publishers", "abstract": "This article presents a thorough literature review and evaluation of road traffic forecasting methods. More specifically, the literature review concerns the study of scientific articles, in order to draw conclusions on the best-applied methods and future directions of their implementation in city logistics. The algorithms (methods), through which the traffic forecast is carried out, are categorised and analysed, focusing on their potential implementation in freight transportation systems. It is beyond dispute that the proper use of traffic congestion information can significantly improve public confidence in road networks and reduce traffic congestion as well as its harmful environmental and social impacts. This analysis and the knowledge gained will be used in an on-going research project in order to support the application of traffic forecasting algorithms in the functionality of a vehicle routing and scheduling information system. This review is a useful tool for academia's and practitioners who study the adoption of traffic forecasting algorithms in IT solutions in order to schedule deliveries and routes in city logistics environment effectively.", "keywords": [ "Traffic congestion", "Computer science", "Schedule", "Order (exchange)", "Transport engineering", "Traffic flow (computer networking)", "City logistics", "Scheduling (production processes)", "Traffic management", "Operations research", "Business", "Engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijdss.2019.104556" }, { "id": "https://openalex.org/W4415336748", "doi": "10.1016/j.jii.2025.100985", "title": "Bi-objective sustainable urban logistics vehicle routing problem with workload balance", "year": 2025, "publication_date": "2025-10-19", "type": "article", "language": "en", "authors": [ "Wenyan Zhao", "Yaguang Yuan", "Cong Cheng", "Wenheng Liu" ], "first_author": "Wenyan Zhao", "venue": "Journal of Industrial Information Integration", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "City logistics", "Workload", "Metaheuristic", "Vehicle routing problem", "Pareto principle", "Multi-objective optimization", "Benchmark (surveying)", "Sustainability" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.jii.2025.100985" }, { "id": "https://openalex.org/W2898690801", "doi": "10.1016/j.trpro.2018.10.088", "title": "Agent-based microsimulation conceptual model for urban freight distribution", "year": 2018, "publication_date": "2018-01-01", "type": "article", "language": "en", "authors": [ "Cristian Giovanny Gómez-Marín", "Martín Darío Arango Serna", "Conrado Augusto Serna-Urán" ], "first_author": "Cristian Giovanny Gómez-Marín", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "In this paper, we develop a conceptual model that integrates the microsimulation and the multi-agent systems in the urban goods distribution processes. The proposed model, which it is defined between the agent-based microsimulation models, allows to analyze the different behaviors and actions that are the result of an urban freight distribution process, facilitating the decision making to improve the efficiency of the logistic process. The model is formulated as a multi-layer urban freight distribution network which involve the street city network and the microsimulation of passenger trips, the use of a distribution center, the design of initial static pick-up and delivery routes, the behaviors of the agents of the system and their interactions that give feedback to the model, and finally assess the impact of the agents in the improvement of the re-routing optimization process at urban freight distribution, according to the multiple types of dynamics variables such as dynamic travel time by traffic conditions in different travels.", "keywords": [ "Microsimulation", "Process (computing)", "Transport engineering", "Distribution (mathematics)", "Trip distribution", "Agent-based model", "TRIPS architecture", "Vehicle routing problem", "Computer science", "Conceptual model", "City logistics", "Routing (electronic design automation)" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146518302436/pdf" }, { "id": "https://openalex.org/W4392045365", "doi": "10.1016/j.trd.2024.104127", "title": "Electric vehicles in urban delivery fleets: How far can they go?", "year": 2024, "publication_date": "2024-02-22", "type": "article", "language": "en", "authors": [ "Dingtong Yang", "Michael F. Hyland" ], "first_author": "Dingtong Yang", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": "The goal of this study is to provide insights into the expected role of medium-duty electric vehicles (EVs) in urban delivery fleets and to analyze the effectiveness of EV subsidies on EV fleet penetration and tailpipe emissions. To meet this goal, we propose a modeling framework that determines the minimum-cost fleet size and fleet mix (of EVs and conventional vehicles) and vehicle routes for a profit-maximizing delivery company. Second, we conduct extensive analyses using this modeling framework and Southern California network data; we vary the EV driving range, per-mile cost of EVs, demand rate, service region size/structure, driver working hours, and network travel times. We find that the optimal fleet mix nearly always includes EVs and conventional vehicles. Moreover, we find that EV subsidies have limited effectiveness with current EV batteries and service regions designed around conventional vehicles. Hence, improving EV battery technology is critical to electrifying urban delivery fleets.", "keywords": [ "Transport engineering", "Electric vehicle", "Market penetration", "Subsidy", "Fleet management", "Last mile (transportation)", "Automotive engineering", "Profit (economics)", "Service (business)", "City logistics", "Computer science", "Business" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2024.104127" }, { "id": "https://openalex.org/W2917505233", "doi": "10.1186/s12544-019-0349-5", "title": "Measuring delivery route cost trade-offs between electric-assist cargo bicycles and delivery trucks in dense urban areas", "year": 2019, "publication_date": "2019-02-13", "type": "article", "language": "en", "authors": [ "Manali Sheth", "Polina Butrina", "Anne Goodchild", "Edward D. McCormack" ], "first_author": "Manali Sheth", "venue": "European Transport Research Review", "publisher": "Springer Science+Business Media", "abstract": "Completing urban freight deliveries is increasingly a challenge in congested urban areas, particularly when delivery trucks are required to meet time windows. Depending on the route characteristics, Electric Assist (EA) cargo bicycles may serve as an economically viable alternative to delivery trucks. The purpose of this paper is to compare the delivery route cost trade-offs between box delivery trucks and EA cargo bicycles that have the same route and delivery characteristics, and to explore the question, under what conditions do EA cargo bikes perform at a lower cost than typical delivery trucks? The independent variables, constant variables, and assumptions used for the cost function comparison model were gathered through data collection and a literature review. A delivery route in Seattle was observed and used as the base case; the same route was then modelled using EA cargo bicycles. Four separate delivery scenarios were modeled to evaluate how the following independent route characteristics would impact delivery route cost - distance between a distribution center (DC) and a neighborhood, number of stops, distance between each stop, and number of parcels per stop. The analysis shows that three of the four modeled route characteristics affect the cost trade-offs between delivery trucks and EA cargo bikes. EA cargo bikes are more cost effective than delivery trucks for deliveries in close proximity to the DC (less than 2 miles for the observed delivery route with 50 parcels per stop and less than 6 miles for the hypothetical delivery route with 10 parcels per stop) and at which there is a high density of residential units and low delivery volumes per stop. Delivery trucks are more cost effective for greater distances from the DC and for large volume deliveries to one stop.", "keywords": [ "Truck", "Transport engineering", "Food delivery", "Engineering", "Computer science", "Business", "Automotive engineering" ], "cited_by_count": 122, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1186/s12544-019-0349-5" }, { "id": "https://openalex.org/W2041430124", "doi": "10.1080/12265934.2014.929020", "title": "Multi-agent systems modelling approach to evaluate urban motorways for city logistics", "year": 2014, "publication_date": "2014-05-04", "type": "article", "language": "en", "authors": [ "Joel S.E. Teo", "E Taniguchi", "Ali Gul Qureshi" ], "first_author": "Joel S.E. Teo", "venue": "International Journal of Urban Sciences", "publisher": "Taylor & Francis", "abstract": "Government road authorities are constantly faced with the challenges of urbanization and traffic congestion requiring them to make good decisions for infrastructure developments. Several developed and developing countries have focused their concerns on building motorways for private and public transports for intercity connectivity and economic growth in the past. However, very few evaluation models were concerned about urban motorways for the benefit of urban freight transport. There may not even be an evaluation model for urban motorways development, which has considered the routing behaviour of truck movements in urban areas, especially if the main purpose for the urban motorway is for improving city logistics. Faced with the problems and concerns of the road authorities in Japan regarding capacity increase measures or other freight management schemes, this paper is an initial step to explore and provide the methodology to support the road authorities in their decision for urban motorway alternatives.", "keywords": [ "Urbanization", "Transport engineering", "Truck", "Traffic congestion", "Government (linguistics)", "Business", "Urban planning", "Public transport", "City logistics", "Environmental planning", "Civil engineering", "Engineering" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/12265934.2014.929020" }, { "id": "https://openalex.org/W2074383643", "doi": "10.3182/20060829-3-nl-2908.00094", "title": "A PRACTICAL SOLUTION OF CAPACITATED ARC ROUTING FOR CITY LOGISTICS", "year": 2006, "publication_date": "2006-01-01", "type": "conference-paper", "language": "en", "authors": [ "Hisafumi Kokubugata", "Kenji Hirashima", "H. Kawashima" ], "first_author": "Hisafumi Kokubugata", "venue": "IFAC Proceedings Volumes", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Arc routing", "Simulated annealing", "Vehicle routing problem", "Arc (geometry)", "Routing (electronic design automation)", "Mathematical optimization", "Computer science", "String (physics)", "Simple (philosophy)", "Engineering", "Mathematics", "Computer network" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3182/20060829-3-nl-2908.00094" }, { "id": "https://openalex.org/W4382366703", "doi": "10.1007/978-3-031-37111-0_24", "title": "The Role of City Logistics in Pursuing the Goals of Agenda 2030", "year": 2023, "publication_date": "2023-01-01", "type": "conference-paper", "language": "en", "authors": [ "Francesco Russo", "Antonio Comi" ], "first_author": "Francesco Russo", "venue": "Lecture notes in computer science", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "City logistics", "Identification (biology)", "Sustainable city", "Computer science", "Sustainability", "Work (physics)", "Sustainable development", "Set (abstract data type)", "Process management", "Operations research", "Business", "Transport engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-031-37111-0_24" }, { "id": "https://openalex.org/W3188918102", "doi": "10.3390/en14164748", "title": "Selecting Freight Transportation Modes in Last-Mile Urban Distribution in Pamplona (Spain): An Option for Drone Delivery in Smart Cities", "year": 2021, "publication_date": "2021-08-04", "type": "article", "language": "en", "authors": [ "Adrián Serrano-Hernández", "Aitor Ballano", "Javier Faulín" ], "first_author": "Adrián Serrano-Hernández", "venue": "Energies", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Urban distribution in medium-sized cities faces a major challenge, mainly when deliveries are difficult in the city center due to: an increase of e-commerce, weak public transportation system, and the promotion of urban sustainability plans. As a result, private cars, public transportation, and freight transportation compete for the same space. This paper analyses the current state for freight logistics in the city center of Pamplona (Spain) and proposes alternative transportation routes and transportation modes in the last-mile city center distribution according to different criteria evaluated by residents. An analytic hierarchy process (AHP) was developed. A number of alternatives have been assessed considering routes and transportation modes: the shortest route criterion and avoiding some city center area policies are combined with traditional van-based, bike, and aerial (drone) distribution protocols for delivering parcels and bar/restaurant supplies. These alternatives have been evaluated within a multicriteria framework in which economic, environmental, and social objectives are considered at the same time. The point in this multicriteria framework is that the criteria/alternative AHP weights and priorities have been set according to a survey deployed in the city of Pamplona (Navarre, Spain). The survey and AHP results show the preference for the use of drone or bike distribution in city center in order to reduce social and environmental issues.", "keywords": [ "Analytic hierarchy process", "Transport engineering", "Public transport", "Distribution (mathematics)", "Last mile (transportation)", "Urban sprawl", "Drone", "Business", "Geography", "Urban planning", "Mile", "Engineering" ], "cited_by_count": 43, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/1996-1073/14/16/4748/pdf?version=1628244040" }, { "id": "https://openalex.org/W2772142555", "doi": "10.1016/j.ecolind.2017.12.030", "title": "Application of supply chain considerations to estimate urban freight emissions", "year": 2017, "publication_date": "2017-12-15", "type": "article", "language": "en", "authors": [ "Jesús Muñuzuri", "Pablo Cortés", "Luis Onieva", "José Guadix" ], "first_author": "Jesús Muñuzuri", "venue": "Ecological Indicators", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Estimation", "Transport engineering", "Variety (cybernetics)", "Aggregate (composite)", "Business", "Supply chain", "Environmental science", "Computer science", "Environmental economics", "Economics", "Engineering" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ecolind.2017.12.030" }, { "id": "https://openalex.org/W2903571685", "doi": "10.1155/2018/2549713", "title": "Models and Methods for Two-Echelon Location Routing Problem with Time Constraints in City Logistics", "year": 2018, "publication_date": "2018-12-13", "type": "article", "language": "en", "authors": [ "Peng Yang", "Lining Zeng" ], "first_author": "Peng Yang", "venue": "Mathematical Problems in Engineering", "publisher": "Hindawi Publishing Corporation", "abstract": "This paper focuses on the two-echelon location routing problem with time constraints in city logistics system. The aim is to define the structure of a system which can optimize the location and the number of two different kinds of logistics facilities as well as the related routes on each echelon. A mathematic model considering the problem characteristics has been set up. Based on probability selection principle, this paper first puts forward a metaheuristic algorithm with comprehensive consideration of time and space accessibility to solve it. Then, random instances of different sizes are generated to verify the effectiveness of our method.", "keywords": [ "Mathematical optimization", "Set (abstract data type)", "Routing (electronic design automation)", "Vehicle routing problem", "Computer science", "Selection (genetic algorithm)", "City logistics", "Metaheuristic", "Operations research", "Engineering", "Mathematics", "Artificial intelligence" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "http://downloads.hindawi.com/journals/mpe/2018/2549713.pdf" }, { "id": "https://openalex.org/W2603033728", "doi": "10.1007/978-981-10-3503-6_5", "title": "Novel Routing Framework for VANET Considering Challenges for Safety Application in City Logistics", "year": 2017, "publication_date": "2017-01-01", "type": "book-chapter", "language": "en", "authors": [ "Kishwer Abdul Khaliq", "Amir Qayyum", "Jürgen Pannek" ], "first_author": "Kishwer Abdul Khaliq", "venue": "Advances in intelligent systems and computing", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Computer science", "Routing protocol", "Computer network", "Policy-based routing", "Vehicular ad hoc network", "Quality of service", "Link-state routing protocol", "Routing (electronic design automation)", "Intelligent transportation system", "Distributed computing", "Wireless ad hoc network", "Transport engineering" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-981-10-3503-6_5" }, { "id": "https://openalex.org/W4365506126", "doi": "10.1016/j.trd.2023.103719", "title": "Characterization of urban distribution networks with light electric freight vehicles", "year": 2023, "publication_date": "2023-04-14", "type": "article", "language": "en", "authors": [ "Jenny Díaz-Ramírez", "Sebastián Zazueta-Nassif", "Roberto Galarza-Tamez", "Daniel Prato-Sánchez", "Jose Ignacio Huertas" ], "first_author": "Jenny Díaz-Ramírez", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "City logistics", "Electricity", "Transport engineering", "Gallon (US)", "Fuel efficiency", "Greenhouse gas", "Business", "Latin Americans", "Distribution (mathematics)", "Environmental economics", "Last mile (transportation)" ], "cited_by_count": 23, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2023.103719" }, { "id": "https://openalex.org/W4416406919", "doi": "10.1016/j.asoc.2025.114219", "title": "An adaptive ant colony algorithm for urban-rural collaborative electric vehicle routing problem", "year": 2025, "publication_date": "2025-11-13", "type": "article", "language": "en", "authors": [ "Lijun Fan", "Changshi Liu", "Bo Dai", "Junyu Li", "Y. Zhang", "Ruiyou Zhang" ], "first_author": "Lijun Fan", "venue": "Applied Soft Computing", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Ant colony optimization algorithms", "Microgrid", "Vehicle routing problem", "Electric vehicle", "Renewable energy", "Energy consumption", "Sustainable transport", "Electricity" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.asoc.2025.114219" }, { "id": "https://openalex.org/W4392030067", "doi": "10.3390/wevj15030080", "title": "Optimization of Electric Vehicle Routes Considering Multi-Temperature Co-Distribution in Cold Chain Logistics with Soft Time Windows", "year": 2024, "publication_date": "2024-02-22", "type": "article", "language": "en", "authors": [ "Meiling He", "Mei Yang", "Wenqing Fu", "Xiaohui Wu", "Kazuhiro Izui" ], "first_author": "Meiling He", "venue": "World Electric Vehicle Journal", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Inspired by the practice of urban distribution of fresh products, we introduce a new electric vehicle routing problem with soft time windows. In this problem, goods with different temperature layers can be distributed in ordinary electric vehicles simultaneously based on the cold storage insulation box. The primary objective is to devise optimized distribution routes for logistics companies to minimize distribution costs, including transportation, refrigeration, and charging costs. To address this, we present a mathematical model for the problem and propose an improved ant colony optimization algorithm combined with a 2-opt algorithm. Based on Solomon dataset, we conduct numerical experiments to verify the effectiveness of the proposed model and algorithm. The numerical results demonstrate that multi-temperature co-distribution can lead to a reduction in distribution cost and an improvement in distribution efficiency.", "keywords": [ "Cold chain", "Electric vehicle", "Automotive engineering", "Distribution (mathematics)", "Materials science", "Mechanical engineering", "Engineering", "Mathematics", "Thermodynamics", "Physics" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2032-6653/15/3/80/pdf?version=1708585894" }, { "id": "https://openalex.org/W2015016022", "doi": "10.2495/ut150231", "title": "An ex-ante evaluation of last-mile freight distribution services for city logistics", "year": 2015, "publication_date": "2015-04-30", "type": "conference-paper", "language": "en", "authors": [ "Lionel Amodeo", "D. Lamari", "Giuseppe Musolino", "V. Placido", "Antonio Polimeni", "M. Praticò", "Antonino Vitetta" ], "first_author": "Lionel Amodeo", "venue": "WIT transactions on the built environment", "publisher": "WIT Press", "abstract": "The paper deals with methodologies to support an ex-ante assessment of the impacts generated by the introduction of city logistics measures on last-mile freight distribution services.Some models and algorithms are applied and compared to solve the vehicle routing problem for freight deliveries in the town of Reggio Calabria with the introduction of an urban distribution centre and of green freight vehicles.Heuristic routing algorithms are compared in terms of sequence of clients (retailers) visited subject to some constraints given by the presence of UDC and the limited autonomy and capacity of freight vehicles.", "keywords": [ "City logistics", "Traffic management", "Vehicle routing problem", "Transport engineering", "Last mile (transportation)", "Heuristic", "Distribution (mathematics)", "Routing (electronic design automation)", "Ex-ante", "Computer science", "Operations research", "Mile" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.witpress.com/Secure/elibrary/papers/UT15/UT15023FU1.pdf" }, { "id": "https://openalex.org/W4390960107", "doi": "10.3390/math12020291", "title": "Research on the Route Choice Behavior of Urban Freight Vehicles Based on GPS Data", "year": 2024, "publication_date": "2024-01-16", "type": "article", "language": "en", "authors": [ "Lili Zheng", "Tian Gao", "Meng Lin", "Tongqiang Ding", "Wenhao Chen" ], "first_author": "Lili Zheng", "venue": "Mathematics", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "In order to provide urban freight vehicles with navigation routes that better align with their travel preferences, it is necessary to analyze the patterns and characteristics of their route choices. This paper focuses on freight vehicles traveling within the city and examines their route selection behavior. Through an analysis of the GPS data collected from freight truck journeys in Changchun, China, this study outlines the characteristics of freight vehicle travel within the city. Variables that may influence their route selection behavior are defined as feature factors. The study employs the DBSCAN algorithm to identify the hotspots in origin–destination pairs for freight truck travel in Changchun. It also utilizes Breadth First Search Link Elimination to generate a set of route choices and constructs route selection behavior models based on Multinomial Logit and Path Size Logit. Based on the research findings, during navigation within the city road network, these vehicles exhibit a preference for side roads, a tendency to favor right turns at intersections, and a propensity to choose routes with lower duplication compared to alternative options. The study’s conclusions offer theoretical support for guiding urban freight vehicle routes and planning and managing freight traffic within the city.", "keywords": [ "Multinomial logistic regression", "Transport engineering", "Truck", "Computer science", "Selection (genetic algorithm)", "Global Positioning System", "Order (exchange)", "Choice set", "Operations research", "Business", "Engineering", "Econometrics" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2227-7390/12/2/291/pdf?version=1705401843" }, { "id": "https://openalex.org/W2891250599", "doi": "10.1016/j.trpro.2018.09.021", "title": "Comparison of various urban distribution systems supporting e-commerce. Point-to-point vs collection-point-based deliveries", "year": 2018, "publication_date": "2018-01-01", "type": "article", "language": "en", "authors": [ "Pasquale Carotenuto", "Massimiliano Gastaldi", "Stefano Giordani", "Riccardo Rossi", "Alberto Rabachin", "Alessio Salvatore" ], "first_author": "Pasquale Carotenuto", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "E-commerce is a sector in continual growth in all countries and, in particular, the increase in B2C (Business to Consumer) e-commerce market has important effects on last-mile deliveries in city areas. The delivery of a parcel to a consumer’s address involves not only high costs for both couriers (extended car routes) and consumers (high prices) and also greater environmental pollution. The growing demand for deliveries in urban areas involves increases in traffic and congestion problems and, consequently, environmental issues. In recent years, many studies have focused on alternative measures to reduce the negative aspects and impact of last-mile deliveries. Good practice to rationalize last-mile delivery should involve the use of various systems, such as reception boxes, delivery boxes, controlled access systems, collection points and lockers. This paper compares two alternative options to home delivery. In particular, it makes comparisons between point-to-point and lockers, states the pro and cons of both, and defines the best positions to locate lockers to reduce consumers’ deviations. The proposed method is applied to a real case: the Italian municipality of Dolo (near Venice).", "keywords": [ "Last mile (transportation)", "Point (geometry)", "Mile", "Food delivery", "Business", "Distribution (mathematics)", "Point of sale", "City logistics", "E-commerce", "Transport engineering", "Computer science", "Marketing" ], "cited_by_count": 42, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146518300930/pdf" }, { "id": "https://openalex.org/W3000823958", "doi": "10.1002/pts.2491", "title": "Some characteristics of the heave, pitch and roll vibrations within urban delivery routes", "year": 2020, "publication_date": "2020-01-20", "type": "article", "language": "en", "authors": [ "Vincent Rouillard", "Matthew James Lamb" ], "first_author": "Vincent Rouillard", "venue": "Packaging Technology and Science", "publisher": "Wiley", "abstract": "Until recently, laboratory testing of packaged systems has been undertaken by simulating vertical vibrations alone. However, with increasing demand for a reduction in packaging waste, the use lightweight systems, such as stretch film, is increasing. Such containment systems are susceptible to the lateral forces generated by the pitch and roll vibratory motion of vehicles due to road surface unevenness. If laboratory simulation is to be realistic, multi‐axial motion must be taken into account and an understanding of the relationships between the random heave, pitch, and roll vibrations is essential. This paper uses vibration data collected from a number of transport vehicles traveling along typical urban and suburban routes to establish the nature and level of the multi‐axial vibrations that exist. These are presented with average Power Density Spectra (PDS) as well as statistical distributions of the moving root‐mean‐square (rms). The paper analyses the data for correlation of the rms levels with respect to nonstationarity. This is important when simulating nonstationary (randomly fluctuating rms) vibrations for heave, pitch and roll. These statistical correlation functions are used to manage the relative rms levels of each of the three Degrees of Freedom (DoFs) when undertaking vibration simulations using multi‐axis vibration test systems. The results show that the relationships between the moving rms of heave, pitch and roll vibrations are not strongly correlated but can be characterized statistically as joint distributions to enable realistic simulation of multi‐axial random vibrations of road transport vehicles under controlled laboratory conditions.", "keywords": [ "Vibration", "Root mean square", "Random vibration", "Structural engineering", "Degrees of freedom (physics and chemistry)", "Engineering", "Acoustics", "Physics" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/pts.2491" }, { "id": "https://openalex.org/W1851775767", "doi": null, "title": "CITY-LOGISTICS - SOLUTIONS FOR URBAN COMMERCIAL TRANSPORT BY COOPERATIVE OPERATIONS MANAGEMENT", "year": 1994, "publication_date": "1994-06-01", "type": "article", "language": "en", "authors": [ "Wilfried Ruske" ], "first_author": "Wilfried Ruske", "venue": null, "publisher": null, "abstract": "Supplying different locations, especially in inner cities, is now only possible with smaller vehicles and often only at particular times. Moreover, freight traffic obstructs itself and the other road users by causing congestions through loading and unloading in the streets. This causes safety problems and impacts street traffic with noise and exhaust. Patent remedies are at hand: to shift freight traffic to the railways, establishing separate lorry routes in the cities, avoiding dead freight and make better use of the capability of lorries, using logistics and establishing Freight Traffic Centres. But the basic situations and the possible developments - neither in detail nor on a larger scale - are known or have been explored. Often the ideas of commercial transport or the design or shape of city logistics do vary considerably.", "keywords": [ "Truck", "Traffic management", "Transport engineering", "City logistics", "Business", "Scale (ratio)", "Engineering", "Automotive engineering", "Geography" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/414905" }, { "id": "https://openalex.org/W3006118211", "doi": "10.1177/0972150919889797", "title": "A Clustering Based Routing Heuristic for Last-Mile Logistics in Fresh Food E-Commerce", "year": 2020, "publication_date": "2020-02-13", "type": "article", "language": "en", "authors": [ "Dhirendra Prajapati", "Arjun R Harish", "Yash Daultani", "Harpreet Singh", "Saurabh Pratap" ], "first_author": "Dhirendra Prajapati", "venue": "Global Business Review", "publisher": "SAGE Publishing", "abstract": "This study considers the fresh food city logistics that involves the last-mile distribution of commodities to the customer locations from the local distribution centres (LDCs) established by the e-commerce firms. In this scenario, the last-mile logistics is crucial for its speed of response and the effectiveness in distribution of packages to the target destinations. We propose a clustering-based routing heuristic (CRH) to manage the vehicle routing for the last-mile logistic operations of fresh food in e-commerce. CRH is a clustering algorithm that performs repetitive clustering of demand nodes until the nodes within each cluster become serviceable by a single vehicle. The computational complexity of the algorithm is reduced due to the downsizing of the network through clustering and, hence, produces an optimum feasible solution in less computational time. The algorithm performance was analysed using various operating scenarios and satisfactory results were obtained.", "keywords": [ "Cluster analysis", "Vehicle routing problem", "Last mile (transportation)", "Heuristic", "Computer science", "E-commerce", "Routing (electronic design automation)", "City logistics", "Operations research", "Mile", "Transport engineering", "Engineering" ], "cited_by_count": 53, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1177/0972150919889797" }, { "id": "https://openalex.org/W4381544209", "doi": "10.7717/peerj-cs.1347", "title": "Green city logistics path planning and design based on genetic algorithm", "year": 2023, "publication_date": "2023-05-05", "type": "article", "language": "en", "authors": [ "Limin Ran", "Shengnan Ran", "Chunmei Meng" ], "first_author": "Limin Ran", "venue": "PeerJ Computer Science", "publisher": "PeerJ, Inc.", "abstract": "Effective logistics distribution paths are crucial in enhancing the fundamental competitiveness of an enterprise. This research introduces the genetic algorithm for logistics routing to address pertinent research issues, such as suboptimal scheduling of time-sensitive orders and reverse distribution of goods. It proposes an enhanced scheme integrating the Metropolis criterion. To address the limited local search ability of the genetic algorithm, this study combines the simulated annealing algorithm's powerful local optimization capability with the genetic algorithm, thereby developing a genetic algorithm with the Metropolis criterion. The proposed method preserves the optimal chromosome in each generation population and accepts inferior chromosomes with a certain probability, thereby enhancing the likelihood of finding an optimal local solution and achieving global optimization. A comparative study is conducted with the Ant Colony Optimization, Artificial Bee Colony, and Particle Swarm Optimization algorithms, and empirical findings demonstrate that the proposed genetic algorithm effectively achieves excellent results over these algorithms.", "keywords": [ "Ant colony optimization algorithms", "Simulated annealing", "Computer science", "Mathematical optimization", "Genetic algorithm", "Meta-optimization", "Vehicle routing problem", "Particle swarm optimization", "Chromosome", "Metaheuristic", "Population", "Estimation of distribution algorithm" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.7717/peerj-cs.1347" }, { "id": "https://openalex.org/W2978476301", "doi": "10.15587/1729-4061.2019.175064", "title": "Modeling of reliability of logistic systems of urban freight transportation taking into account street congestion", "year": 2019, "publication_date": "2019-08-07", "type": "article", "language": "en", "authors": [ "Viktor Vojtov", "Olesya Kutiya", "Natalija Berezhnaja", "Mykola Karnaukh", "Oksana Bilyaeva" ], "first_author": "Viktor Vojtov", "venue": "Eastern-European Journal of Enterprise Technologies", "publisher": "Kharkiv State Academy of Physical Culture", "abstract": "Mathematical formulation of the problem of forming urban freight transportation is performed. The structure of the system information model is developed, which takes into account material, energy and information flows. Mathematical expressions for calculating the criterion for choosing rational routes ‒ route quality factor are presented. The criterion takes into account the capabilities of the logistics center (information content), cargo weight, congestion (traffic jams), transportation distance and actual delivery time. A distinguishing feature is that it is determined online and takes into account the congestion dynamics of routes during a work shift.The dynamic model of delays in decision making in the logistics chains of urban freight transportation is developed. The model allows calculating the processing time of transportation requests and transportation time itself. It is shown that the total time of freight delivery consists of the travelling time of the vehicle, taking into account route resistance and delay time in all logistic chains of the system.The mathematical model is developed for assessing the reliability of urban freight transportation, taking into account street congestion. The model operates online and allows determining the parameters of the transport process, including traffic jams on city streets.The reliability criterion of the logistics system of urban freight transportation ‒ reliability coefficient is proposed. The criterion takes into account the travelling time of the vehicle and the delay time of receipt of transportation requests at the logistics center, and the time of delays at the transport company. It is shown that in the absence of delays in logistics chains, the reliability coefficient is equal to unity, and if there is a delay, the reliability coefficient is less than unity. The physical significance of the reliability criterion is determined. It is the share of non-fulfillment of transportation requests on time.", "keywords": [ "Reliability (semiconductor)", "Traffic congestion", "Transport engineering", "Computer science", "Operations research", "Path (computing)", "Process (computing)", "Engineering" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "http://journals.uran.ua/eejet/article/download/175064/177009" }, { "id": "https://openalex.org/W4391620982", "doi": "10.1109/access.2024.3363417", "title": "Optimizing Heterogeneous Vehicle Routes for Urban Distribution Considering the Three-Dimensional Bin Packing Problem of Electric Meters", "year": 2024, "publication_date": "2024-01-01", "type": "article", "language": "en", "authors": [ "Zhaolei He", "Miaohan Zhang", "Cong Lin", "Jing Zhao", "Kun Shi", "Zhen Ai" ], "first_author": "Zhaolei He", "venue": "IEEE Access", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "With the establishment of smart grids, there is a growing demand for metering electric meters in urban areas. Given the diverse sizes and delicate nature of these meters, traditional scheduling solutions are unable to cater to the multifaceted requirements of urban environments, meters loading, and subsequent logistics scheduling. This study presents an intelligent scheduling model for electric meters in an urban context, taking into account various constraints such as urban traffic congestion, three-dimensional packing of metering devices, delivery time windows, and heterogeneous vehicles. To solve this, we design an improved whale optimization algorithm using a hybrid multi-phase heuristic approach (IWOA-HMOHA). Simulation results show that compared with the traditional meter logistics scheduling strategy, the IWOA-HMOHA algorithm reduces the objective function by 5.4%~ 26.1% compared with other similar algorithms. In addition, compared with the traditional first-in-last-out cargo packing method, the vehicle space utilization rate is improved by 12.62%. The proposed models and algorithms demonstrate excellent adaptability to a range of urban constraints, offering valuable insights and a robust framework essential for the development of logistics solutions in urban.", "keywords": [ "Computer science", "Scheduling (production processes)", "Adaptability", "Metering mode", "Electric vehicle", "Bin packing problem", "Bin", "Mathematical optimization", "Distributed computing", "Real-time computing", "Algorithm", "Engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ieeexplore.ieee.org/ielx7/6287639/6514899/10423786.pdf" }, { "id": "https://openalex.org/W2108333167", "doi": "10.1109/hicss.2008.121", "title": "Development and Evaluation of an Intelligent Fleet Management System for City Logistics", "year": 2008, "publication_date": "2008-01-01", "type": "conference-paper", "language": "en", "authors": [ "Vasileios Zeimpekis", "George M. Giaglis", "Ioannis E. Minis" ], "first_author": "Vasileios Zeimpekis", "venue": null, "publisher": null, "abstract": "The routing plan of a delivery fleet is usually developed a priori and provides an optimal (or near optimal) way of serving customers by taking into account certain constraints, such as delivery time windows. However, such plans may not cope adequately with the dynamics of a city logistics environment, in which unexpected events (e.g. traffic congestions) often occur during delivery execution. We present the development and evaluation of a real-time fleet management system that handles such unforeseen events. The system monitors the delivery vehicles in real time, detects deviations from the initial distribution plan, and adjusts the schedule accordingly by suggesting effective rerouting strategies. The system has been tested in simulation environment and in real-life cases and the results show that delivery performance is enhanced significantly and customer satisfaction is improved.", "keywords": [ "Schedule", "Computer science", "Plan (archaeology)", "Fleet management", "Vehicle routing problem", "Routing (electronic design automation)", "Delivery Performance", "City logistics", "Operations research", "Real-time computing", "Transport engineering", "Process management" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/hicss.2008.121" }, { "id": "https://openalex.org/W3122055487", "doi": "10.1016/j.tre.2020.102214", "title": "The adoption of self-driving delivery robots in last mile logistics", "year": 2021, "publication_date": "2021-01-20", "type": "article", "language": "en", "authors": [ "Cheng Chen", "Emrah Demir", "Yuan Huang", "Rongzu Qiu" ], "first_author": "Cheng Chen", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Robot", "Flexibility (engineering)", "Computer science", "Vehicle routing problem", "Service (business)", "Last mile (transportation)", "Automation", "Delivery Performance", "Transport engineering", "Scale (ratio)", "Drone", "Simulation" ], "cited_by_count": 234, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.ncbi.nlm.nih.gov/pmc/articles/8719850" }, { "id": "https://openalex.org/W4416942675", "doi": "10.1002/cpe.70490", "title": "A Q‐Learning Driven NSGA ‐ II for Vehicle Routing Problem With Service Quality and Resource Balance", "year": 2025, "publication_date": "2025-12-03", "type": "article", "language": "en", "authors": [ "Zhihao Yao", "Gang Chen", "Jiangyue Fu" ], "first_author": "Zhihao Yao", "venue": "Concurrency and Computation Practice and Experience", "publisher": "Wiley", "abstract": "ABSTRACT In urban delivery operations, service quality plays a key role in determining enterprise competitiveness, while balanced resource allocation is crucial for operational efficiency. However, few studies have investigated the factors that influence service quality and resource balance, or the trade‐offs between them. To fill this gap, this paper proposes a vehicle routing problem considering service quality and resource balance (VRPSQRB), in which stochastic quality rewards (SQR) capture the uncertain gains from differentiated service performance and develops a corresponding multiobjective mathematical model. Since the VRP is known to be an NP‐hard problem, solving it with three simultaneous objectives, namely cost, service quality, and resource balance, further increases its complexity. To address this challenge, we propose a Q‐learning driven NSGA‐II (QNSGA‐II) solution framework. In QNSGA‐II, a state representation tailored to the VRPSQRB is designed to help balance the three conflicting objectives. A hybrid strategy library, combining genetic and local search methods suited to the characteristics of VRPSQRB, is also developed. Q‐learning is used to select optimal combinations of strategies based on a multidimensional population state, enabling adaptive control beyond traditional hyperheuristic frameworks. Finally, QNSGA‐II is evaluated using Solomon benchmark datasets with customer sizes of 25, 50, and 100. The experimental results show that QNSGA‐II achieves average improvements of 11.46% in hypervolume (HV) and 20.20% in inverted generational distance (IGD) compared to baseline algorithms, demonstrating its efficiency and robustness.", "keywords": [ "Benchmark (surveying)", "Vehicle routing problem", "Resource allocation", "Key (lock)", "Quality of service", "Resource (disambiguation)", "Service quality", "Routing (electronic design automation)", "Population" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/cpe.70490" }, { "id": "https://openalex.org/W4411639849", "doi": "10.1109/access.2025.3583106", "title": "Heuristic Algorithms for the Heterogeneous Vehicle Routing Problem With Time Windows, Customers Priority, Pickup and Delivery", "year": 2025, "publication_date": "2025-01-01", "type": "article", "language": "en", "authors": [ "Moayad Tanash", "Rami As’ad" ], "first_author": "Moayad Tanash", "venue": "IEEE Access", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "Driven by an unprecedented surge in freight transportation and city logistics, this paper tackles a practical variant of the famous Vehicle Routing Problem that jointly accounts for the existence of a heterogeneous fleet of vehicles, customers’ priorities, soft time windows, pickup and delivery operations. A mathematical model is developed which seeks to establish the optimal routing and delivery schedule minimizing the total cost comprised of transportation costs, earliness-tardiness penalties, priority violations, and vehicle idleness cost. To cater for scalability issues, two computationally-efficient heuristic approaches that guarantee the attainment of high-quality solutions within reasonable CPU time are proposed. Both heuristics possess a two-phase structure, where the first phase yields highly prudent initial solutions employing a Greedy Randomized Adaptive Search Procedure (GRASP) in the first heuristic, and Priority-Based Ant Colony Optimization (PBACO) in the second heuristic. As for the second phase, both heuristics embrace a common Variable Neighborhood Search (VNS) algorithm that explores seven different neighborhoods to improve upon the initial solutions. Numerical experiments on test instances with up to 80 customers demonstrate the superiority of both heuristics in terms of CPU time and solution quality. While GRASP exhibits a slight computational advantage for instances involving 40 or more customers, the two heuristics yield solutions that are on average 0.25% and 0.60% away from the best-found solution, respectively, across all test instances. Sensitivity analysis also reveals that vehicles’ capacities, alongside other parameters, greatly impact the routing plan and the utilization of the vehicles.", "keywords": [ "Pickup", "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Heuristic", "Algorithm", "Computer network", "Distributed computing", "Artificial intelligence" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/access.2025.3583106" }, { "id": "https://openalex.org/W2081129345", "doi": "10.1016/j.sbspro.2014.01.1465", "title": "Application of the Just-In-Time Concept in Urban Freight Transport", "year": 2014, "publication_date": "2014-03-01", "type": "conference-paper", "language": "en", "authors": [ "Narath Bhusiri", "Ali Gul Qureshi", "Eiichi Taniguchi" ], "first_author": "Narath Bhusiri", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "Just-In-Time (JIT) is a cost-effective philosophy, that was first implemented by Japan's Toyota Motor Corporation. Once successfully implemented, the JIT concept has been widely applied by numerous firms in several areas of specialization. This paper demonstrates how the JIT concept can be implemented in urban freight transport. A franchise of convenience stores and its distribution and routing system is selected for implementation. Focusing on routing perspective, the JIT concept is more efficiently incorporated by extending time window constraints at franchising convenience stores and the underlying routing system can be characterized as the vehicle routing problem with soft time windows and simultaneous pickups and deliveries (VRPSTWSPD). Experimental results prove that the VRPSTWSPD is of particular characteristics, which can fully satisfy objectives of the JIT concept. Use of the VRPSTWSPD would lead to a reduction of cost and waste-in-processes as well as maintaining an acceptable level of satisfaction.", "keywords": [ "Transport engineering", "Business", "Computer science", "Engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.sbspro.2014.01.1465" }, { "id": "https://openalex.org/W2782767613", "doi": "10.1109/wsc.2017.8248234", "title": "Sustainable urban freight transport: A simheuristic approach", "year": 2017, "publication_date": "2017-12-01", "type": "conference-paper", "language": "en", "authors": [ "Lorena Silvana Reyes-Rubiano" ], "first_author": "Lorena Silvana Reyes-Rubiano", "venue": null, "publisher": null, "abstract": "In modern society, sustainable transportation practices in smart cities are becoming increasingly important for both companies and citizens. This paper addresses a rich extension of the capacitated vehicle routing problem, which considers sustainability indicators and stochastic traveling times. A simheuristic approach integrating Monte Carlo simulation into a multi-start metaheuristic is proposed to solve it. A computational experiment is carried out to illustrate both the problem and the approach.", "keywords": [ "Sustainability", "Vehicle routing problem", "Computer science", "Metaheuristic", "Sustainable transport", "Routing (electronic design automation)", "Monte Carlo method", "Operations research", "Transport engineering", "Mathematical optimization", "Engineering", "Mathematics" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/wsc.2017.8248234" }, { "id": "https://openalex.org/W198167514", "doi": "10.1007/978-1-4614-3628-7_8", "title": "Routing in City Logistics", "year": 2012, "publication_date": "2012-01-01", "type": "book-chapter", "language": "en", "authors": [ "Jan Fabian Ehmke" ], "first_author": "Jan Fabian Ehmke", "venue": "International series in management science/operations research/International series in operations research & management science", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Routing (electronic design automation)", "Computer science", "City logistics", "Realization (probability)", "Vehicle routing problem", "Focus (optics)", "Operations research", "Transport engineering", "Computer network", "Engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-1-4614-3628-7_8" }, { "id": "https://openalex.org/W2810001954", "doi": "10.1016/j.eswa.2018.06.050", "title": "A two-phase method for multi-echelon location-routing problems in supply chains", "year": 2018, "publication_date": "2018-06-30", "type": "article", "language": "en", "authors": [ "Zhuo Dai", "Faisal Aqlan", "Kuo Gao", "Zhou Yefu" ], "first_author": "Zhuo Dai", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Supply chain", "Routing (electronic design automation)", "Phase (matter)", "Operations research", "Business", "Computer network", "Mathematics", "Chemistry" ], "cited_by_count": 64, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2018.06.050" }, { "id": "https://openalex.org/W2910618465", "doi": "10.1109/ieem.2018.8607385", "title": "Optimal Vehicle Routing for Parcel Delivery with Considering Two Time Periods", "year": 2018, "publication_date": "2018-12-01", "type": "conference-paper", "language": "en", "authors": [ "G. Kim" ], "first_author": "G. Kim", "venue": null, "publisher": null, "abstract": "In city logistics, some group of vehicles are usually assigned a certain fixed areas so that drivers get used to the route or the customer sites. Vehicles deliver materials regularly every time period at the same area. In other words, the customer demand can be placed in the similar area each time period. Thus, we may find the optimal route for the demand of two time periods instead of finding the optimal route for the single time period. This paper proposes a mathematical programming model for the vehicle routing problem for the parcel delivery in urban transportation with considering two time periods. Since the area of delivery is the same, the integration of demand of two time periods can reduce the total transportation costs.", "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "Travel time", "Real-time computing", "Transport engineering", "Simulation", "Computer network", "Engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/ieem.2018.8607385" }, { "id": "https://openalex.org/W2034846730", "doi": "10.1016/j.trpro.2015.01.006", "title": "Optimization of the FURBOT Urban Freight Transport Scheme", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Elvezia Maria Cepolina", "Alessandro Farina" ], "first_author": "Elvezia Maria Cepolina", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The paper refers to an innovative urban freight distribution scheme, aimed at reducing the externalities connected with the freight delivery process. Both packages destined to commercial activities and to end consumers (e-commerce) are taken into account. Each package is characterized by an address and dimensions. In the proposed transport system, freight is firstly delivered to the urban distribution centre on the border of urban areas through trucks or trains which perform the long distance transport. After, freight is reorganized and consolidated into special load units (FURBOT boxes), according to packages dimensions and to the addresses of receivers. Each box is addressed to a temporary unloading bay and it is delivered there by a smalllelectrically powered vehicle (FURBOT vehicle). The paper concerns a methodology for optimizing this freight transport system's performances. The input data are the actual freight demand, the road network and the public policies. The methodology determines the best number of FURBOT boxes which minimizes the system cost. The overall cost is a sum of the users cost, which depends on the distance they have to walk for collecting their packages in the FURBOT box, and of the operator cost, which depends on the number of boxes, and the total distance travelled by the FURBOT vehicles. The minimization problem has been approached by a Simulated Annealing procedure. The methodology recalls two sub-problems: a first sub-problem to determine the optimum clustering of packages in the FURBOT boxes, and a second sub problem to determine the best routing of FURBOT vehicles. The methodology has been applied to the case study of Genoa city centre, Italy.", "keywords": [ "Truck", "Transport engineering", "Simulated annealing", "Train", "Minification", "Cluster analysis", "Vehicle routing problem", "Computer science", "Process (computing)", "Public transport", "Routing (electronic design automation)", "Operations research" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146515000071/pdf" }, { "id": "https://openalex.org/W2743537882", "doi": "10.1016/j.ejor.2017.07.067", "title": "Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities", "year": 2017, "publication_date": "2017-08-03", "type": "article", "language": "en", "authors": [ "Maximilian Schiffer", "Michael D. Schneider", "Gilbert Laporte" ], "first_author": "Maximilian Schiffer", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Resource (disambiguation)", "Operations research", "Business", "Computer network", "Engineering" ], "cited_by_count": 66, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2017.07.067" }, { "id": "https://openalex.org/W2083916251", "doi": "10.1057/jors.2012.93", "title": "Managing vehicle breakdown incidents during urban distribution of a common product", "year": 2012, "publication_date": "2012-10-04", "type": "article", "language": "en", "authors": [ "K. Mamasis", "Ioannis E. Minis", "Γεώργιος Δίκας" ], "first_author": "K. Mamasis", "venue": "Journal of the Operational Research Society", "publisher": "Palgrave Macmillan", "abstract": "This paper addresses a case in which a vehicle, member of a fleet distributing a single product, is immobilized while executing its distribution plan. Some active vehicles of the fleet are then rerouted to serve selected clients of the immobilized vehicle. We model this re-planning problem as a variation of the Team Orienteering Problem constraining all vehicle routes to an upper time, or distance, limit, and taking into account limited vehicle capacity. We propose an efficient heuristic to provide solutions in almost real-time. The heuristic progressively constructs new routes for each active vehicle, which may load additional product by visiting the warehouse or the immobilized vehicle. If appropriate, we solve this replenishment sub-problem by a fast labelling algorithm. We test the effectiveness of the proposed heuristic by comparing its solutions with those obtained by an appropriate Genetic Algorithm (GA) that yields high quality (but computationally expensive) results.", "keywords": [ "Orienteering", "Computer science", "Heuristic", "Genetic algorithm", "Vehicle routing problem", "Purchasing", "Product (mathematics)", "Route planning", "Limit (mathematics)", "Heuristics", "Operations research", "Time limit" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1057/jors.2012.93" }, { "id": "https://openalex.org/W1979715006", "doi": "10.15446/dyna.v81n187.46105", "title": "Reliability in urban freight distribution: A Markovian approach", "year": 2014, "publication_date": "2014-10-24", "type": "article", "language": "en", "authors": [ "Miguel Gastón Cedillo‐Campos", "José Luis de la Riva-Canizales", "Alfredo Bueno-Solano", "Jesús González-Feliu", "Jorge Luis García-Alcaráz" ], "first_author": "Miguel Gastón Cedillo‐Campos", "venue": "DYNA", "publisher": "National University of Colombia", "abstract": "A key element in assessing reliability in urban freight distribution (UFD) is the probability density function (PDF) of the variables that characterize the performance of the distribution routes. This article presents a method for modeling the PDF with an approach based on the Markov models, under the assumption that the present status of reliability of a route depends only on its immediate previous state. Currently, the PDF is obtained directly from the field, therefore an analytical model that provides certainty to the analysis is essential. The results are applicable both to the design of routes and operation of the same process. The originality of this work is based on the development of a methodological procedure to assess the reliability of the components of a path, complementary to current methodologies to calculate network reliability.", "keywords": [ "Reliability (semiconductor)", "Markov process", "Distribution (mathematics)", "Reliability engineering", "Transport engineering", "Computer science", "Environmental science", "Business", "Engineering", "Mathematics", "Statistics", "Physics" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.15446/dyna.v81n187.46105" }, { "id": "https://openalex.org/W2922565647", "doi": "10.1016/j.trb.2019.02.008", "title": "The multi-objective Steiner pollution-routing problem on congested urban road networks", "year": 2019, "publication_date": "2019-03-20", "type": "article", "language": "en", "authors": [ "Ramin Raeesi", "Konstantinos G. Zografos" ], "first_author": "Ramin Raeesi", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Computer science", "Pareto principle", "Vehicle routing problem", "Fuel efficiency", "Integer programming", "Mathematical optimization", "Duration (music)", "Scheduling (production processes)", "Operations research", "Routing (electronic design automation)", "Transport engineering" ], "cited_by_count": 64, "is_retracted": false, "is_paratext": false, "open_access_url": "https://eprints.lancs.ac.uk/id/eprint/131609/1/TheSPRP_RaeesiZografos_TRB.pdf" }, { "id": "https://openalex.org/W371885266", "doi": null, "title": "Recent advances in city logistics : proceedings of the 4th International Conference on City Logistics (Langkawi, Malaysia, 12-14 July, 2005)", "year": 2006, "publication_date": "2006-01-01", "type": "book", "language": "en", "authors": [ "栄一 谷口", "Russell George Thompson" ], "first_author": "栄一 谷口", "venue": "Elsevier eBooks", "publisher": "Elsevier BV", "abstract": "Preface. Data collection for modeling, evaluating and benchmarking city logistics schemes. (E. Taniguchi, R. G. Thompson and T. Yamada). Intermodal transport and city logistics policies. (T. Nemoto, M. Browne, J. Visser and J. Castro). Application of a tour-based model to simulate freight distribution in a large urbanized area. (F. Russo and A. Carteni). Mars - A Programming language for solving vehicle routing problems. (A. Galic, T. Caric and H. Gold). An experimental study on the performance of probabilistic vehicle routing and scheduling with ITS. (N. Ando and E. Taniguchi). Modelling the effects of city logistics schemes. (T. Yamada and E .Taniguchi). Demand models for city logistics: a state of the art and a proposed integrated system. (F. Russo and A. Comi). Planning on-street loading-unloading spaces considering the behaviour of pickup-delivery vehicles and parking enforcement. (N. Aiura and E. Taniguchi). The influence of transportation network reliability on city logistics. (R. Raicu, S. Raicu and M. Popa). Keeping of delivery time windows by considering actual and expected traffic situations in transport planning. (D. Wild and C. Glucker). The future of city logistics: estimating the feasibility of home delivery in urban areas. (J. Visser and K. Hassall). Introducing high productivity vehicles into Australia: Two case studies with different regulatory mechanisms. (K. Hassall). Modelling multimodal freight transport: Impacts of network improvement in urban areas on inter-regional freight transport. (B.F. Russ, T. Yamada, J. Castro and T. Ito). Evaluation of logistics performance for freight mode choice at an intermodal terminal. (P. Kunadhamraks and S. Hanaoka). Evaluation of a freight auction in an urban transport network. (P. Jonkman, E. Taniguchi and T. Yamada). Evaluating toll measures on urban expressway considering the behaviour of several stakeholders associated with urban freight transport. (E. Taniguchi and D. Tamagawa). Securing the logistics of the shopping mall. (K. Button, R. Stough and M. Thibault). Night-time delivery restrictions: a review. (M. Browne, J. Allen, S. Anderson and A. Woodburn). Cost structure of highway construction and maintenance: How should we levy taxes on freight vehicles?. (Y. Misui and T. Nemoto). Effectiveness and feasibility of innovative freight strategies for the U.S. urban areas.(K. Kawamura and Y. Lu). A methodology for evaluating urban freight projects. (R.G. Thompson and K. Hassall). Analysis of the effects of a cooperative delivery system in Bangkok. (A. G. Qureshi and S. Hanaoka). A study on the performance of probe vehicle data. (K. Yamane, E. Taniguchi, T. Fushiki and K. Kimita). Benefits from changes in scale in sustainable city logistics. (J. C. Rijsenbrij). Fighting the windmills: Survey results on urban freight policies between Spain and the Netherlands. (J.H.R. van Duin and J. Munuzuri). Efforts to make distribution and transportation more efficient through cooperation among Japanese companies. (K. Hayashi, H. Ono and Y. Yano). New concepts and organisations for the last mile: French experiments and their results. (D. Patier). Bases for a policy for the development of logistics platforms in the Metropolitan Zone of Mexico City. (A. Lozano, J.P. Antun, C. Santos, R. Alarcon, F. Granados and R. Hernandez).Transportation demand management: experiments in Akihabara 2004. (H. Ishida, E. Taniguchi, T. Hyodo, A. Sasaki, H. Ando, K. Ikeda). Pilot demonstration of a web-based load zone reservation system. (J. Munuzuri, J. Larraneta, J.N. Ibanez and G. Montero).City logistics in China: An overview. (W. Qiu, F. Yang and D. Yang). The integration of urban goods transport and delivery in the development of municipal mobility plans in the Walloon region: Towards a comprehensive and cross-sectional approach. (W. Debauche, D. Laffineuse, D. Borsu and A. N'diaye). B2C E-commerce: impact on transport in urban areas. (K. Esser and J. Kurt). A framework to scope logistics initiatives. (J.W. Joubert and H.W. Ittmann). Retailers distribution and local time window policies. (H. Quak and R. de Koster). Using daytime population for dangerous goods vehicle route planning. (K. H. Lau). A conceptual framework for solving the multiple depot probabilistic vehicle routing problem with time window (MDPVRPTW). (S. Samanta and M. K. Jha). A genetic algorithms-based decision support system for transportation infrastructure management in urban areas. (M.K. Jha, K. Kepaptsoglou, M. Karlaftis and J. Abdullah). Off-peak freight deliveries to new york city:challenges and policy measures. (J. Holguin-Veras, J.M. Polimeni and B. Cruz).", "keywords": [ "City logistics", "Transport engineering", "Multimodal transport", "Traffic management", "Operations research", "Routing (electronic design automation)", "Vehicle routing problem", "Computer science", "Passenger transport", "Scheduling (production processes)", "Engineering", "Operations management" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "http://ci.nii.ac.jp/ncid/BA84878077" }, { "id": "https://openalex.org/W2137486017", "doi": "10.1002/9781119081418.ch27", "title": "VRP Algorithms for Decision Support Systems to Evaluate Collaborative Urban Freight Transport Systems", "year": 2015, "publication_date": "2015-01-09", "type": "other", "language": "en", "authors": [ "Jesús González-Feliu", "Josep Maria Salanova Grau" ], "first_author": "Jesús González-Feliu", "venue": null, "publisher": null, "abstract": "This paper proposes a comparison between genetic and semi-greedy algorithms for a collaborative VRP in city logistics. In order to compare the performance of both algorithms on real-size test cases, we develop a cluster-first route second algorithm. The clustering phase is made by a seep algorithm, which defines the number of used vehicles and assigns a set of customers to it. Then, for each vehicle, we build a min-cost route by two methods. The first is a semi-greedy algorithm. The second is a genetic algorithm. We test both approaches on real-size instances Computational results are presented and discussed.", "keywords": [ "Greedy algorithm", "Computer science", "Genetic algorithm", "Vehicle routing problem", "Cluster analysis", "Algorithm", "Set (abstract data type)", "Decision support system", "Data mining", "Routing (electronic design automation)", "Machine learning" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://shs.hal.science/halshs-00986648" }, { "id": "https://openalex.org/W1898377947", "doi": null, "title": "Simulating the effects of pedestrianisation on urban freight deliveries", "year": 2013, "publication_date": "2013-08-01", "type": "article", "language": "en", "authors": [ "Jesús Muñuzuri", "Pablo Cortés", "Luis Onieva", "José Guadix Martín" ], "first_author": "Jesús Muñuzuri", "venue": "LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)", "publisher": "LA Referencia", "abstract": "The city of Seville is currently developing a land-use reorganisation policy aimed at increasing the number of pedestrian spaces. This paper contains the microscopic simulation built to assess one of those pedestrianisation initiatives from the point of view of its effects on traffic flows and, more specifically, freight deliveries. Two different alternatives are compared with the current scenario from the point of view of traffic congestion, parking space occupation and route times. Due to the complexity of the freight delivery practices involved, the use of a standard traffic simulation package was not appropriate, and the simulations were carried out using the commercial package Arena, which enabled the representation of all that complexity with a specifically built simulation model.", "keywords": [ "Transport engineering", "Point (geometry)", "Traffic congestion", "Pedestrian", "Representation (politics)", "Computer science", "Space (punctuation)", "Traffic management", "Operations research", "Engineering", "Mathematics" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://idus.us.es/handle/11441/23168" }, { "id": "https://openalex.org/W2129835591", "doi": "10.37610/dyo.v0i53.451", "title": "City logistics: Are sustainability policies really sustainable?", "year": 2014, "publication_date": "2014-07-01", "type": "article", "language": "en", "authors": [ "Rafael Grosso", "Jesús Muñuzuri", "Pablo Cortés", "Jesús Antonio Carrillo-Castrillo" ], "first_author": "Rafael Grosso", "venue": "Dirección y Organización", "publisher": null, "abstract": "Road Freight transport is causing a number of social, environmental and economic negative impacts in many cities around the world. Therefore sustainable city logistics must be the solution to the problems of urban centers, with the main objective of researchers reduce these impacts, without penalizing the needs of cities. Cause of this several sustainable initiatives and policies have been implemented to help reduce them. But are the sustainable policies really sustainable? So this paper aims to evaluate one of these policies in a quantitative way to answer the question. Therefore be presented and implement a model based on VRP logic to evaluate the differences between the distances traveled by vehicles of a logistics company in a city with a policy regulating access and the distance traveled without such regulation. And based on the results obtained attempt draw conclusions to answer the question.Keywords: City logistic, Sustainable policies, Vehicle routing, Access time windows, Genetic Algorithms, City centersLogística Urbana: ¿Son realmente sostenibles las políticas sostenibles?Resumen: La Logística Urbana sostenible debe ser solución ante los numerosos problemas sociales, medioambientales y económicos causados por el transporte de mercancías por carretera en las ciudades. De hecho son varias las iniciativas y políticas sostenibles que se han llevado a cabo para intentar reducir estos problemas. Pero ¿son realmente sostenibles estas políticas sostenibles? Este trabajo tiene como objetivo evaluar una de estas políticas de forma cuantitativa para poder responder a dicha pregunta. Así se evaluaron las diferencias entre las distancias recorridas por los vehículos de una empresa de logística en una ciudad con y sin una política de acceso regulado.Palabras clave: Logística Urbana, políticas sostenibles, enrutamiento de vehículos, ventana de acceso temporal, algoritmos genéticos, centros urbanos.", "keywords": [ "Sustainability", "Business", "Political science", "Welfare economics", "Geography", "Economics", "Biology" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://revistadyo.es/DyO/index.php/dyo/article/download/451/471" }, { "id": "https://openalex.org/W4402615264", "doi": "10.1016/j.ejtl.2024.100143", "title": "A metaheuristic for a time-dependent vehicle routing problem with time windows, two vehicle fleets and synchronization on a road network", "year": 2024, "publication_date": "2024-01-01", "type": "article", "language": "en", "authors": [ "Fernando O. Guillen Reyes", "Michel Gendreau", "Jean‐Yves Potvin" ], "first_author": "Fernando O. Guillen Reyes", "venue": "EURO Journal on Transportation and Logistics", "publisher": "Springer Science+Business Media", "abstract": "In this work, we extend the time-dependent vehicle routing problem with time windows on a road network by considering two types of vehicles, large and small, to serve customers. Motivated from city logistics applications, large vehicles are forbidden from the downtown area. Accordingly, goods must be transferred from large to small vehicles to serve downtown customers. This leads to synchronization issues at transfer points, which are special locations without storage capacity. The problem is not a pure two-echelon vehicle routing problem, since customers outside of the downtown area can be served directly by large vehicles. The problem is further compounded by the presence of time-dependent travel times that are defined on the arcs of the road network and are used to model congestion periods. To solve this difficult problem, we propose an adaptation of the Slack Induction by String Removals metaheuristic, which is state-of-the-art for the classical capacitated vehicle routing problem. Computational results on a set of test instances with different characteristics empirically demonstrate the optimization capabilities of this new metaheuristic on a problem which is much more complicated than the capacitated vehicle routing problem. • A state-of-the-art metaheuristic for the capacitated vehicle routing problem is modified to solve a difficult variant. • The problem considered is motivated by city logistics applications. • The problem involves time dependency and time windows. • The problem also involves two types of vehicles with synchronization at transfer points on a road network. • Computational results are reported using well known benchmark instances for the time-dependent vehicle routing problem with time windows.", "keywords": [ "Vehicle routing problem", "Metaheuristic", "Synchronization (alternating current)", "Computer science", "Arrival time", "Travel time", "Time synchronization", "Routing (electronic design automation)", "Fleet management", "Real-time computing", "Engineering", "Transport engineering" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejtl.2024.100143" }, { "id": "https://openalex.org/W2989955140", "doi": "10.1109/logistiqua.2019.8907263", "title": "Tabu Search for urban freight VRP: Fundamental aspects and parameters tuning evaluation", "year": 2019, "publication_date": "2019-06-01", "type": "conference-paper", "language": "en", "authors": [ "Youssef Meliani", "Saâd Lissane Elhaq", "Yasmina Hani", "Abderrahman El Mhamedi" ], "first_author": "Youssef Meliani", "venue": null, "publisher": null, "abstract": "This paper capitalizes some fundamental aspects of the Tabu Search (TS) as a strategy for combinatorial optimization problems, especially Vehicle Routing Problems (VRP) for urban good distribution. in the last 2 decades or so, TS has proven his efficiency in treating different variants of VRP. The current study addresses the basic components and procedures of any TS, such as, the local search, the adaptive memory and the processes for intensifying and diversifying the search. Furthermore, an overview of pertinent works on TS related to VRP is provided. Latterly, the impact of each parameter on the performance of a given process of the TS is also evaluated by a proposed TS heuristic.", "keywords": [ "Vehicle routing problem", "Tabu search", "Heuristic", "Computer science", "Mathematical optimization", "Routing (electronic design automation)", "Process (computing)", "Guided Local Search", "Mathematics", "Algorithm" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/logistiqua.2019.8907263" }, { "id": "https://openalex.org/W3035625691", "doi": "10.14669/am.vol87.art6", "title": "Draft model of delivery routes at a city logistics scale when applying the Clarke-Wright method", "year": 2020, "publication_date": "2020-03-30", "type": "article", "language": "en", "authors": [ "Ondřej Stopka" ], "first_author": "Ondřej Stopka", "venue": "The Archives of Automotive Engineering/ Archiwum Motoryzacji", "publisher": "Index Copernicus International S.A.", "abstract": "The manuscript deals with the subject of determining the optimal delivery routes in terms of supplying urban distribution centers when minimizing the distance traveled in a particular region for the purpose of addressing city logistics issues using the specific Operations Research method, namely the Clarke-Wright method. Thus, the main paper objective is to examine the issue: what are the optimal transport journeys from the specific object among individual customers in a certain region in order to execute minimum transport performance? First two sections of the manuscript specify the relevant concepts regarding the issue of distribution tasks and vehicle routing problem, and presents data and methods in relation to this research study. The most significant part of the article models the individual routes to determine the optimal interconnections of urban distribution center and their supply from one logistics service center in a regional logistics network at a city logistics scale when applying the Clarke-Wright method. The last sections of the elaborated research study evaluate the major findings and discuss the possible future initiatives in the topic addressed.", "keywords": [ "Wright", "City logistics", "Computer science", "Operations research", "Relation (database)", "Scale (ratio)", "Vehicle routing problem", "Transport engineering", "Service (business)", "Distribution (mathematics)", "Distribution center", "Routing (electronic design automation)" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.aaejournal.com/pdf-119025-54161?filename=Draft model of delivery.pdf" }, { "id": "https://openalex.org/W4378420431", "doi": "10.2139/ssrn.4459937", "title": "Cmsa Algorithms for the Electric Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Time Windows and Partial Battery Charging", "year": 2023, "publication_date": "2023-01-01", "type": "preprint", "language": "en", "authors": [ "Mehmet Anıl Akbay", "Christian Blum", "Can B. Kalaycı" ], "first_author": "Mehmet Anıl Akbay", "venue": "SSRN Electronic Journal", "publisher": "RELX Group (Netherlands)", "abstract": null, "keywords": [ "Pickup", "Vehicle routing problem", "Battery (electricity)", "Computer science", "Algorithm", "Routing (electronic design automation)", "Electric vehicle", "Automotive engineering", "Electrical engineering", "Mathematical optimization", "Engineering", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2139/ssrn.4459937" }, { "id": "https://openalex.org/W4291123025", "doi": "10.1016/j.multra.2022.100032", "title": "Optimal consolidation center to improve urban freight transport: a case of student accommodation in a higher education institution", "year": 2022, "publication_date": "2022-08-12", "type": "article", "language": "en", "authors": [ "Oyegoke Teslim Bukoye", "Sathvik Gadiraju" ], "first_author": "Oyegoke Teslim Bukoye", "venue": "Multimodal Transportation", "publisher": "Elsevier BV", "abstract": "Cities across the world are expanding as a result of urbanization, resulting in growing demand for goods and services, mainly through online sales. This has resulted in the need for an urban consolidation center (UCC) to minimize travel and optimize deliveries, particularly in student accommodation settings. In this paper, we examine how an optimal consolidation center can improve urban freight transport. We conducted a multi-method and in-depth case study of student halls of residence within a UK higher education institution. In addition, we analyzed a rich secondary dataset including location, parcel, and vehicle data. We developed and tested three scenarios to present an optimal urban consolidation scenarios model using a Vehicle Routing Problem (VRP) solver; indicating the transportation costs, distance travelled, and CO2 emitted. The operationalization of the optimal UCC as well as the limitations on direct and indirect cost, accessibility, and collaboration are discussed. Our findings show the impact of having an ideal pickup point that would give students the ability to collect their parcels effortlessly and make the return of goods easier for students. As such, we extend extant studies on the implications for urban consolidation center theory and practice.", "keywords": [ "Consolidation (business)", "Transport engineering", "Operationalization", "Business", "Residence", "Computer science", "Economics", "Engineering", "Finance" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2772586322000326/pdf" }, { "id": "https://openalex.org/W839487714", "doi": null, "title": "AN EVALUATION METHODOLOGY FOR CITY LOGISTICS. IN: TRANSPORT LOGISTICS", "year": 2002, "publication_date": "2002-01-01", "type": "article", "language": "en", "authors": [ "E Taniguchi", "Recm van der Heijden" ], "first_author": "E Taniguchi", "venue": "Classics in Transport Analysis", "publisher": null, "abstract": "The paper presents a methodology for evaluating several city logistics initiatives using dynamic traffic simulation with optimal routing and scheduling. Several logistics initiatives have been proposed, such as: advanced information systems; cooperative freight transportation systems; public logistics terminals; load factor controls; and underground freight transportation systems. Three logistics systems were evaluated: introducing advanced routing and scheduling systems; implementing a cooperative freight transport system; and controlling the load factor of pickup/delivery trucks in urban areas. The main criterion for the evaluation used in this paper was carbon dioxide emissions produced by delivery vehicles when the demand for freight transport at customers was increased.", "keywords": [ "Traffic management", "City logistics", "Truck", "Transport engineering", "Scheduling (production processes)", "Vehicle routing problem", "Green logistics", "Routing (electronic design automation)", "Computer science", "Business", "Operations research", "Environmental economics" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view.aspx?id=663977" }, { "id": "https://openalex.org/W4406415027", "doi": "10.1016/j.tranpol.2025.01.023", "title": "Last mile urban freight delivery: A new system based on platoons of automated vehicles", "year": 2025, "publication_date": "2025-01-15", "type": "article", "language": "en", "authors": [ "Marino Lupi", "Dorothée Conte", "Alessandro Farina" ], "first_author": "Marino Lupi", "venue": "Transport Policy", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Mile", "Transport engineering", "Last mile (transportation)", "Vehicle miles of travel", "Aeronautics", "Automotive engineering", "Engineering", "Computer science", "Business", "Geography" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/abs/pii/S0967070X2500023X?via=ihub" }, { "id": "https://openalex.org/W2750190423", "doi": "10.1016/j.cor.2017.08.013", "title": "Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm", "year": 2017, "publication_date": "2017-08-27", "type": "article", "language": "en", "authors": [ "Maurizio Boccia", "Teodor Gabriel Crainic", "Antonio Sforza", "Claudio Sterle" ], "first_author": "Maurizio Boccia", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Routing (electronic design automation)", "Computer science", "Integer programming", "Context (archaeology)", "Commodity", "Mathematical optimization", "Exploit", "Flow network", "Integer (computer science)", "Flow (mathematics)", "Linear programming", "Algorithm" ], "cited_by_count": 54, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2017.08.013" }, { "id": "https://openalex.org/W3175902660", "doi": "10.3390/su13137418", "title": "An Optimization Model of a Sustainable City Logistics Network Design Based on Goal Programming", "year": 2021, "publication_date": "2021-07-02", "type": "article", "language": "en", "authors": [ "Shuangyan Li", "Yijing Liang", "Zhenjie Wang", "Dezhi Zhang" ], "first_author": "Shuangyan Li", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "This paper investigates the joint optimization problem on the logistics infrastructure investment and CO2 emission taxes for a sustainable city logistics network design by a goal programming approach where the cost recovery, service level and CO2 emission reduction goals are involved. The above multi-objective logistics infrastructure capacity investment and CO2 emission taxes problem is formulated as a bi-level goal programming model. Given the priority structure of the goals, the total deviations from predetermined goals are minimized in the upper level, while the lower level of the model serves as the service route choice equilibrium problem of logistics users. To solve the proposed model, a genetic algorithm is developed, where the method of successive average (MSA) is embedded. The case study focusing on the urban logistics network of Changsha, China demonstrates the effectiveness of the bi-level goal programming model and the genetic algorithm. The findings reveal that the priority rankings of the goals have a significant impact on the joint decisions of CO2 emission taxes and logistics infrastructure capacity investment. The proposed methodology provides an avenue to balance multiple conflicting objectives and obtain an economical and environmental city logistics network.", "keywords": [ "Goal programming", "Investment (military)", "Programming paradigm", "Genetic algorithm", "Network planning and design", "Service level", "Service (business)", "Computer science", "Operations research", "Green logistics", "Sustainable development", "Routing (electronic design automation)" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/13/13/7418/pdf?version=1625216996" }, { "id": "https://openalex.org/W4361026953", "doi": "10.1016/j.trb.2023.03.007", "title": "Joint optimization of parcel allocation and crowd routing for crowdsourced last-mile delivery", "year": 2023, "publication_date": "2023-03-27", "type": "article", "language": "en", "authors": [ "Li Wang", "Min Xu", "Hu Qin" ], "first_author": "Li Wang", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Last mile (transportation)", "Column generation", "Computer science", "Optimization problem", "Operations research", "Vehicle routing problem", "Routing (electronic design automation)", "Joint (building)", "Crowdsourcing", "Mile", "Scale (ratio)", "Time horizon" ], "cited_by_count": 57, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10397/98183" }, { "id": "https://openalex.org/W3031281093", "doi": "10.4236/jtts.2020.103014", "title": "Road User Charging for Urban Freight Vehicles: A Systems Approach", "year": 2020, "publication_date": "2020-01-01", "type": "article", "language": "en", "authors": [ "Loshaka Perera", "Russell George Thompson" ], "first_author": "Loshaka Perera", "venue": "Journal of Transportation Technologies", "publisher": "Scientific Research Publishing", "abstract": "Road user charging (RUC) has a long history as a mechanism to recover infrastructure maintenance and capital costs. The present RUC systems are facing issues such as transparency, cross-subsidization, environmental concerns and reducing revenue due to the likes of lessening fuel tax as vehicles become more efficient. Therefore, this paper reviews the strengths and weaknesses of the present RUC mechanisms implemented in the world with respect to stakeholder problems and demands of the freight industry and to describe the need for a more appropriate, practical and sustainable approach that can be used in the future. Finally, a model is proposed that is transparent and considers usage-based charging addressing most of the weaknesses highlighted in the models reviewed. Further, it considers externalities produced by heavy vehicles into account. The model has the potential to provide answers to key stakeholder issues and will lead to a sustainable freight transport system in the future. Encouraging fuel-efficient modes, optimization of loading, routing and logistics systems, and long term land use planning are a few of them.", "keywords": [ "Stakeholder", "Transport engineering", "Revenue", "Strengths and weaknesses", "Externality", "Subsidy", "Transparency (behavior)", "Fuel tax", "Sustainable transport", "Traffic management", "Key (lock)", "Business" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "http://www.scirp.org/journal/PaperDownload.aspx?paperID=100609" }, { "id": "https://openalex.org/W2983315670", "doi": "10.1504/ijlsm.2019.103518", "title": "Collaborative last-mile delivery and pick-up in city logistics", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Aishwary Bhasker", "Sarada Prasad Sarmah", "Taebok Kim" ], "first_author": "Aishwary Bhasker", "venue": "International Journal of Logistics Systems and Management", "publisher": "Inderscience Publishers", "abstract": "Collaborative strategy helps city planner and logistics companies to plan for last-mile delivery and pick-up strategy such that it reduces fuel consumption and thus pollution within the city. This paper proposes a mathematical model to evaluate fuel consumption for a routing plan in last-mile delivery (or pick-up) for non-collaborative (or traditional) and collaborative strategy. Comparing both the scenario for last-mile delivery and pick-up, the latter strategy outperforms the former with 19.02% reduction in fuel consumption. Results are also analysed in terms of total carbon emission caused by vehicles of individual companies. Sharing of surplus among the companies due to collaborative strategy is also presented in this study. Furthermore, the paper assesses the implementation of an electric fleet of vehicles in the context of collaborative urban transportation of goods and determines corresponding energy consumption. The results exhibit an improvement of 24.16% in electric vehicles (EVs) in a collaborative scenario compared to diesel vehicles.", "keywords": [ "Last mile (transportation)", "Planner", "Context (archaeology)", "City logistics", "Fuel efficiency", "Mile", "Plan (archaeology)", "Transport engineering", "Business", "Energy consumption", "Vehicle routing problem", "Consumption (sociology)" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1504/ijlsm.2019.103518" }, { "id": "https://openalex.org/W4386415986", "doi": "10.3390/smartcities6050107", "title": "Optimising Urban Freight Logistics Using Discrete-Event Simulation and Cluster Analysis: A Stochastic Two-Tier Hub-and-Spoke Architecture Approach", "year": 2023, "publication_date": "2023-09-04", "type": "article", "language": "en", "authors": [ "Zichong Lyu", "Dirk John Pons", "Gilbert Palliparampil", "Yilei Zhang" ], "first_author": "Zichong Lyu", "venue": "Smart Cities", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "The transport of freight involves numerous intermediate steps, such as freight consolidation, truck allocation, and routing, all of which exhibit high day-to-day variability. On the delivery side, drivers usually cover specific geographic regions, also known as clusters, to optimise operational efficiency. A crucial aspect of this process is the effective allocation of resources to match business requirements. The discrete-event simulation (DES) technique excels in replicating intricate real-world operations and can integrate a multitude of stochastic variables, thereby enhancing its utility for decision making. The objective of this study is to formulate a routing architecture that integrates with a DES model to capture the variability in freight operations. This integration is intended to provide robust support for informed decision-making processes. A two-tier hub-and-spoke (H&S) architecture was proposed to simulate stochastic routing for the truck fleet, which provided insights into travel distance and time for cluster-based delivery. Real industry data were employed in geographic information systems (GISs) to apply the density-based spatial clustering of applications with noise (DBSCAN) clustering method to identify customer clusters and establish a truck plan based on freight demand and truck capacity. This clustering analysis and simulation approach can serve as a planning tool for freight logistics companies and distributors to optimise their resource utilisation and operational efficiency, and the findings may be applied to develop plans for new regions with customer locations and freight demands. The original contribution of this study is the integration of variable last-mile routing and an operations model for freight decision making.", "keywords": [ "Truck", "Cluster analysis", "Computer science", "Operations research", "Routing (electronic design automation)", "Vehicle routing problem", "Transport engineering", "Engineering", "Computer network" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2624-6511/6/5/107/pdf?version=1693818935" }, { "id": "https://openalex.org/W7147153629", "doi": "10.70675/95c78957z5422z446fzb06dzc6867054f6a9", "title": "Solving strategic and tactical optimization problems in city logistics", "year": 2014, "publication_date": "2014-11-26", "type": "dissertation", "language": "en", "authors": [ "Paolo Gianessi" ], "first_author": "Paolo Gianessi", "venue": null, "publisher": null, "abstract": "Optimisation Stratégique et tactique en logistique urbaine L'efficacité du transport des marchandises en ville est un sujet complexe préoccupant les autorités locales depuis de nombreuses années. Les enjeux sont immenses, une meilleure organisation du trafic devant permettre d'augmenter la sécurité, réduire les nuisances, minimiser les coûts. La Logistique Urbaine vise à concevoir des systèmes de distribution des marchandises en ville permettant d'acheminer les flux dans les meilleures conditions à la fois pour la communauté et les transporteurs. Cette thèse se deroule dans le cadre du projet ANR MODUM qui propose un système basé sur un anneau de Centres de Distribution Urbains (CDU) situés autour d'une ville. La première partie étudie ce système d'un point de vue stratégique et tactique. Le Multicommodity-Ring Location Routing Problem aborde les décisions concernants l'installation et la connexion en anneau des CDU en simplifiant les détails plus tactiques. Trois méthodes ont été developpées et testées sur un jeu d'instances exhaustif se révélant très efficaces. The Multicommodity-Ring Vehicle Routing Problem est le problème dérivé que l'on obtient quand l'anneau est fixé. Une approche de type Branch&Price est proposée pour ce problème. La deuxième partie porte sur le Vehicle Routing Problem with Intermediate Replenishment Facilities, un problème plus tactique qui se produit dans un système logistique lorsque les véhicules peuvent se recharger auprès des points de remplissage et effectuer plusieurs tournées lors d'une même journée. Plusieurs algorithmes exacts ont été developpés et testés. Les résultats obtenus sur des jeux d'instances tirés de la littérature sont prometteurs.", "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "Distribution (mathematics)", "Function (biology)" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://theses.hal.science/tel-01241904/document" }, { "id": "https://openalex.org/W4388286362", "doi": "10.1109/access.2023.3329195", "title": "Drone-Based Delivery Systems: A Survey on Route Planning", "year": 2023, "publication_date": "2023-01-01", "type": "article", "language": "en", "authors": [ "Giulio Attenni", "Viviana Arrigoni", "Novella Bartolini", "Gaia Maselli" ], "first_author": "Giulio Attenni", "venue": "IEEE Access", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "The ever-increasing demand for urban delivery services significantly exacerbates the traffic conditions on our already overly congested urban streets. The problem is even worsened by the dearth of appropriate parking facilities available for efficient offloading operations. As a result, there has been a surge of interest in exploring eco-friendly alternatives to traditional truck-based logistics. Drone technology has significant potential to enable widespread home delivery services and reduce the reliance on trucks within urban areas. Both the academy and the industry have shown interest in developing swiftly deployable and cost-effective delivery systems that rely on drones. This work provides a comprehensive review of the current state of Drone-based Delivery Systems. It explores the latest advancements, methodologies, and employed techniques with a specific emphasis on optimizing task scheduling and designing efficient routes for drone deliveries. It critically analyzes the advantages and drawbacks of existing solutions, contributing a thorough classification based on crucial system features, such as fleet composition, degree of device cooperation, and underlying infrastructure.", "keywords": [ "Drone", "Computer science", "Truck", "Scheduling (production processes)", "Transport engineering", "Work (physics)", "Risk analysis (engineering)", "Computer security", "Business", "Engineering", "Operations management" ], "cited_by_count": 40, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ieeexplore.ieee.org/ielx7/6287639/6514899/10308587.pdf" }, { "id": "https://openalex.org/W2279119561", "doi": "10.1016/j.trpro.2016.02.039", "title": "The Five-step Model – Procurement to Increase Transport Efficiency for an Urban Distribution of Goods", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Olof Moen" ], "first_author": "Olof Moen", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The efficiency of a transport system is dependent on how resources in the system are utilized. The freight transport sector in Sweden is fragmented, composed predominantly of small operators affiliated with intermediary companies that handle sales and contact with customers. In addition, the majority of innovations in freight transport have been technical in nature, such as advancements in engines, fuel type and information technology. Organizational developments leading to changed behavior remain lacking. The aim of this paper is to further develop the procurement process with route optimization to improve overall efficiency in a transport system. An unconditional requirement is digital information at all stages in the supply chain. In a case study, a commercial vehicle routing software was used to create a situation analysis of a manually dispatched transport network to 324 retail outlets, which was subsequently compared to the route-optimized solution. Next, the case study was related to a new transport service purchasing model, the “Five-step model”. The five steps are outlined, beginning with situation analysis followed by the simulation of new routes; the procurement process, including defining specifications and selecting a provider; open book pricing with joint review of routes; negotiations and contractor agreement; and, finally, payment with reverse billing. In the Five-step model, stakeholders negotiate in terms of distance, time, and sequenced routes, rather than a single price per stop, which is customary in the transport industry in Sweden. Implicitly, the relationship between parties changes, with greater transparency and ultimately a shift in power in the supply chain from the transport company to the transport buyer.", "keywords": [ "Procurement", "Supply chain", "Purchasing", "Transparency (behavior)", "Payment", "Purchasing process", "Negotiation", "Process (computing)", "Business", "Call for bids", "Transport engineering", "Industrial organization" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146516000405/pdf" }, { "id": "https://openalex.org/W4375862102", "doi": "10.1007/s10732-023-09510-1", "title": "A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window", "year": 2023, "publication_date": "2023-05-08", "type": "article", "language": "en", "authors": [ "Fagui Liu", "Lvshengbiao Wang", "Mengke Gui", "Yang Zhang", "Yulin Lan", "Chengqi Lai", "Boyuan Zhu" ], "first_author": "Fagui Liu", "venue": "Journal of Heuristics", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Computer science", "Pickup", "Algorithm", "Benchmark (surveying)", "Mathematical optimization", "Heuristic", "Vehicle routing problem", "Convergence (economics)", "Mathematics", "Routing (electronic design automation)", "Artificial intelligence" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10732-023-09510-1" }, { "id": "https://openalex.org/W2498238805", "doi": null, "title": "The routing problem of an innovative urban freight distribution scheme", "year": 2014, "publication_date": "2014-01-01", "type": "conference-paper", "language": "en", "authors": [ "Elvezia Maria Cepolina", "Alessandro Farina" ], "first_author": "Elvezia Maria Cepolina", "venue": "CINECA IRIS Institutial research information system (University of Pisa)", "publisher": "University of Pisa", "abstract": "The paper refers to an innovative urban freight distribution scheme, aimed at reducing the externalities\\nconnected with the freight delivery process. Both packages destined to commercial activities and to private\\nconsumers (e-commerce) are taken into account. Packages are firstly delivered to urban distribution centers\\n(UDCs) on the border of urban areas; each package is characterized by an address and dimensions. FURBOT\\nboxes are consolidated in the UDC with these packages. Each box is addressed to a temporary unloading bay and\\nit is delivered there by a FURBOT vehicle. The FURBOT vehicle has a capacity of 2 boxes. The paper focuses\\non the problem of choosing the couple of boxes to be loaded on each vehicle and on the related choice of the\\nroute to be assigned to each vehicle: from the UDC to the first stop where the first box should be unloaded, to the\\nsecond stop where the second box should be unloaded, and then back to the UDC. A methodology for the\\nspecific routing problem is proposed and its application to the case study of Genoa city centre is presented.", "keywords": [ "Transport engineering", "Vehicle routing problem", "City logistics", "Routing (electronic design automation)", "Scheme (mathematics)", "Externality", "Process (computing)", "Distribution (mathematics)", "Computer science", "Operations research", "Automotive engineering", "Engineering" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://arpi.unipi.it/handle/11568/273735" }, { "id": "https://openalex.org/W2810067587", "doi": "10.1002/9781119425519.ch1", "title": "Recent Developments and Prospects for Modeling City Logistics", "year": 2018, "publication_date": "2018-05-30", "type": "other", "language": "en", "authors": [ "Eiichi Taniguchi", "Russell George Thompson", "Ali Gul Qureshi" ], "first_author": "Eiichi Taniguchi", "venue": null, "publisher": null, "abstract": "Recent developments in digital-based technologies such as sensor networks as well as alternative fuel vehicles such as electric vans present many exciting opportunities for enhancing city logistics. This chapter describes how developments in simulation and optimization models are being applied to facilitate the implementation of contemporary concepts and utilize emerging advanced technologies for city logistics. It highlights recent advances in using Intelligent Transport Systems (ITS), Internet of Things (IoT), Physical Internet (PI), big data, co-modality and electric vehicles. A combination of simulation and optimization procedures are required for planning, designing and operating connected city logistics schemes based on the PI concept as well as co-modality systems. To achieve the aims of city logistics, there is a need to incorporate a wider range of objectives such as environment and social costs into vehicle routing and scheduling procedures. Multi-agent models help us to understand the behavior of stakeholders who are involved in city logistics.", "keywords": [ "City logistics", "Computer science", "Scheduling (production processes)", "Smart city", "Internet of Things", "Systems engineering", "The Internet", "Engineering management", "Operations research", "Transport engineering", "Engineering", "Operations management" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/9781119425519.ch1" }, { "id": "https://openalex.org/W594683529", "doi": null, "title": "GPS-based data production in urban freight distribution", "year": 2013, "publication_date": "2013-02-07", "type": "article", "language": "en", "authors": [ "Jesús González-Feliu", "Pascal Pluvinet", "Marc Serouge", "Mathieu Gardrat" ], "first_author": "Jesús González-Feliu", "venue": null, "publisher": null, "abstract": "This chapter aims to investigate the contribution of GPS survey techniques for urban goods movement characterization, and to diagnosis the implementation and application issues related to the introduction of real-time data transmission procedures and phone tools with integrated GPS devices. We propose a GPS-based data collection method for urban freight route characterization using a Smartphone application. After testing and calibrating the data processing tool, we analyse the main results on a baseline of about 900 tours with the R software. This chapter defined the characteristics of the overall routes as well as the environmental impacts linked with the categories of roads, urban highways, main roads and residential streets. Moreover, this chapter showed the driver's environmental behaviour was related to the main activity of the carriers. Finally, the complementarity between GPS-surveys and traditional urban freight surveys was discussed.", "keywords": [ "Global Positioning System", "Complementarity (molecular biology)", "Transport engineering", "Mobile phone", "Baseline (sea)", "Data collection", "Phone", "Software", "Computer science", "Geography", "Engineering", "Telecommunications" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://shs.hal.science/halshs-00784079" }, { "id": "https://openalex.org/W2898881091", "doi": "10.1016/j.trpro.2018.10.077", "title": "Using Modelling Techniques to Analyze Urban Freight Distribution. A Case Study in Pamplona (Spain)", "year": 2018, "publication_date": "2018-01-01", "type": "article", "language": "en", "authors": [ "Pablo Álvarez", "Adrián Serrano-Hernández", "Javier Faulín", "Angel Alejandro Juan" ], "first_author": "Pablo Álvarez", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The city of Pamplona, in Spain, is currently experiencing several changes regarding sustainable mobility such as pedestrianization of some streets in the city center, and access control to the Old Town for motor vehicles through the use of automatic number-plate recognition. However, some groups including local neighbors and businesses are raising complaints as they are being affected by these measures. This is also the case for couriers and logistics companies which have now to comply with new regulations regarding delivery routes throughout the Old Town. This paper will present a comprehensive study of the situation that is being carried out, and in which social perceptions and freight traffic patterns in the Old Town of Pamplona are analyzed to understand how urban freight distribution could be improved in the area. For this purpose, we make use of a survey-based research to the stakeholders, i.e. pedestrians, logistics companies, retailers, and authorities of Pamplona. Results highlight pollution derived from transportation, lack of parking spaces as well as invasion of public spaces in the city center as the key issues for improving freight transportation in the Old Town. Finally, placing a distribution center in the Old Town and the promotion of the cycle-logistics are considered as the future of the urban distribution in Pamplona.", "keywords": [ "Distribution (mathematics)", "Transport engineering", "Promotion (chess)", "Business", "Geography", "Environmental planning", "Engineering", "Political science" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146518302321/pdf" }, { "id": "https://openalex.org/W2811459721", "doi": "10.1002/9781119425472.ch7", "title": "Concepts of an Integrated Platform for Innovative City Logistics with Urban Consolidation Centers and Transshipment Points", "year": 2018, "publication_date": "2018-05-30", "type": "other", "language": "en", "authors": [ "Eiichi Taniguchi", "Rémy Dupas", "Jean‐Christophe Deschamps", "Ali Gul Qureshi" ], "first_author": "Eiichi Taniguchi", "venue": null, "publisher": null, "abstract": "This chapter presents the concept of an integrated platform with urban consolidation centers (UCCs) and transshipment points (TPs) for innovative city logistics for sustainable and livable cities. The authors conducted surveys of transporters in Tokyo and Bordeaux on the opinions of joint delivery systems using UCC and urban transport systems using TP. Results showed that some transport companies recognized the benefits of introducing these systems but also pointed out some barriers in terms of confidentiality and delivery costs. Examples of UCC for multitenant buildings in Tokyo are given and these can provide a basis for innovative city logistics systems. For further investigations, social cost benefit analysis based on vehicle routing and scheduling with transshipment and UCC models would be useful to clarify the social and environmental benefits and promote the involvement of the public sector in these systems.", "keywords": [ "City logistics", "Transshipment (information security)", "Consolidation (business)", "Business", "Transport engineering", "Environmental planning", "Computer science", "Engineering", "Operations research", "Geography", "Finance" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1002/9781119425472.ch7" }, { "id": "https://openalex.org/W2996171288", "doi": null, "title": "Analysis of supply chain operational performances using vehicle routing with UAV delivery in city logistics", "year": 2019, "publication_date": "2019-09-02", "type": "article", "language": "en", "authors": [ "Alexey Solomasov" ], "first_author": "Alexey Solomasov", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Vehicle routing problem", "Supply chain", "Routing (electronic design automation)", "Transport engineering", "Computer science", "Business", "Operations management", "Operations research", "Automotive engineering", "Engineering", "Computer network", "Marketing" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://matheo.uliege.be/bitstream/2268.2/8463/4/Solomasov_MT_Analysis_SCOP_UAV.pdf" }, { "id": "https://openalex.org/W4224251021", "doi": "10.31387/oscm0490342", "title": "Location-inventory-routing Problem in a Context of City Logistics: A Case Study of Jakarta", "year": 2022, "publication_date": "2022-04-15", "type": "article", "language": "en", "authors": [ "Nova Indah Saragih", "Senator Nur Bahagia", "Suprayogi Suprayogi", "Ibnu Syabri" ], "first_author": "Nova Indah Saragih", "venue": "Operations and Supply Chain Management An International Journal", "publisher": null, "abstract": "City logistics idea is to develop an effective, efficient, and environmentally friendly logistics system.The development of city logistics is related to energy consumption, traffic congestion, economic and environmental problems.As one of the megacities in the world, Jakarta faces an inventory problem which is low availability of only 76%.Jakarta also faces the problem of transportation that is traffic congestion.The problems show that it is needed to develop city logistics in Jakarta.City logistics developed in this paper is related to decisions of location, inventory, and routing problems or LIRP (location-inventory-routing problem) in short.The LIRP takes into account multi-products, multi suppliers, and traffic congestion as an external parameters.This paper aims to develop a heuristic method to solve the LIRP.The heuristic method is based on simulated annealing (SA) algorithm.Existing literature shows that this paper's heuristic method to solve the LIRP has never been developed before.From applying the heuristic method in Jakarta, the coordination concept of city logistics reduces the vehicle number by 73%, and the consolidation concept of city logistics increases the availability from 76% to 95%.", "keywords": [ "Context (archaeology)", "Vehicle routing problem", "Routing (electronic design automation)", "Operations research", "City logistics", "Computer science", "Business", "Transport engineering", "Operations management", "Geography", "Engineering", "Computer network" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://journal.oscm-forum.org/journal/journal/download/20220520071350_Published_Paper_5_Vol._15_._No_._2,_2022_.pdf" }, { "id": "https://openalex.org/W3009137785", "doi": null, "title": "An advanced method to provide best route information in city logistics with toll roads", "year": 2018, "publication_date": "2018-01-01", "type": "article", "language": "en", "authors": [ "Yiqun Chen", "Loshaka Perera", "Russell George Thompson" ], "first_author": "Yiqun Chen", "venue": "Transport Research Forum", "publisher": null, "abstract": "© 2018 ATRF, Commonwealth of Australia. All rights reserved. There have been rising concerns that freight trucks are diverting off toll roads onto arterial roads, in order to avoid toll charges. This paper presents the development of a freight route model which can advise truck drivers on the optimum route to take between an origin and destination. This model considers various factors when determining optimal travel routes, including truck ownership and type of transportation they provide. Primarily the model compares total costs incurred on a toll route and their non-toll route equivalent, and also considers travel time and travel distance. The model is illustrated using a case study with 10 pre-determined Key Freight Areas in Melbourne covering two tollways, CityLink and East Link. Travel time and distance data is extracted from the Google API platform, based on all the different Origin-Destination pairs formed from the Key Freight Areas. By considering toll charges on the two links, the cost model is evolved from existing literature to consider the impacts of new variables. Results show that route choice is governed by a combination of factors, which traditionally includes vehicle classification. This model introduces a means of predicting the influence of operator type and freight type on route choice. Consideration of ancillary and hire & reward operators show that operator type is a significant factor in determining whether or not a toll route is preferred. The former is more sensitive towards travel costs due to its smaller capacity, whilst the latter is more sensitive towards travel time savings. This consideration allows for a better representation of different road users and their preferences within the freight network.", "keywords": [ "Toll", "Truck", "Transport engineering", "Key (lock)", "Toll road", "Computer science", "Electronic toll collection", "Operations research", "Order (exchange)", "Business", "Travel time", "Engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://findanexpert.unimelb.edu.au/scholarlywork/1419878-an-advanced-method-to-provide-best-route-information-in-city-logistics-with-toll-roads" }, { "id": "https://openalex.org/W4223539857", "doi": "10.1016/j.ejor.2022.03.058", "title": "A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system", "year": 2022, "publication_date": "2022-04-11", "type": "article", "language": "en", "authors": [ "Mengtong Wang", "Canrong Zhang", "Michael G.H. Bell", "Lixin Miao" ], "first_author": "Mengtong Wang", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Last mile (transportation)", "Computer science", "Routing (electronic design automation)", "Integer programming", "Operations research", "Key (lock)", "Facility location problem", "Vehicle routing problem", "Plan (archaeology)", "Mile", "Mathematical optimization", "Algorithm" ], "cited_by_count": 63, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2022.03.058" }, { "id": "https://openalex.org/W4386566101", "doi": "10.1016/j.cie.2023.109604", "title": "Reconfiguration of last-mile supply chain for parcel delivery using machine learning and routing optimization", "year": 2023, "publication_date": "2023-09-09", "type": "article", "language": "en", "authors": [ "Angie Ramírez-Villamil", "Jairo R. Montoya‐Torres", "Anicia Jaegler", "Juan M. Cuevas-Torres" ], "first_author": "Angie Ramírez-Villamil", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Control reconfiguration", "Computer science", "Routing (electronic design automation)", "Operations research", "Heuristic", "Workload", "Transport engineering", "Engineering", "Computer network", "Artificial intelligence" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "http://intellectum.unisabana.edu.co/bitstreams/1e68f5cf-fd1c-4597-a566-408b4f7ebaec/download" }, { "id": "https://openalex.org/W4411609723", "doi": "10.1007/s11116-025-10633-6", "title": "The role of walking in last-mile urban deliveries", "year": 2025, "publication_date": "2025-06-24", "type": "article", "language": "en", "authors": [ "Giacomo Dalla Chiara", "Anne Goodchild" ], "first_author": "Giacomo Dalla Chiara", "venue": "Transportation", "publisher": "Springer Science+Business Media", "abstract": "Most of a delivery driver’s time is spent outside the vehicle, walking the last-50-feet to reach the delivery customers while the vehicle is stationary. However, little is known about the walking component of delivery routes, while most models and algorithms used for scheduling and planning urban freight vehicles focus solely on the driving component. This study fills this research gap by providing an empirical analysis of the role of walking in last-mile deliveries. The study aims to empirically quantify delivery drivers’ walking distances and shed light on the interrelation between walking and the overall efficiency and sustainability of delivery routes. Two data samples were obtained that recorded more than 1,800 real deliveries performed by a parcel carrier and a beverage carrier in Seattle, WA. Data on both vehicle routes and drivers’ walking sub-routes were obtained and analyzed. Dwell time regression analyses and simulations were performed to understand the impact of walking on last-mile routes. The results highlighted the importance of walking across different types of deliveries. Both carriers either walked longer distances to find better parking or to serve multiple delivery customers from a single stop. The parcel carrier also showed large economies of scale in performing multiple deliveries per stop. An increase in willingness to walk showed a general reduction in the number of stops per route and in total vehicle miles traveled. The paper concludes with a discussion on the importance of walking in scheduling and planning for delivery vehicles in urban areas.", "keywords": [ "Mile", "Last mile (transportation)", "Transport engineering", "Regional science", "Geography", "Engineering", "Geodesy" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s11116-025-10633-6.pdf" }, { "id": "https://openalex.org/W4226090856", "doi": "10.1016/j.trpro.2022.02.066", "title": "A heuristic for two-echelon urban distribution systems", "year": 2022, "publication_date": "2022-01-01", "type": "article", "language": "en", "authors": [ "Bruno Oliveira", "Antonio Galrao Ramos", "Jorge Pinho de Sousa" ], "first_author": "Bruno Oliveira", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The negative impacts of urban freight transport have fostered the design of new distribution systems for inner city deliveries. One of the proposed city logistics solutions is the establishment of two-echelon distribution systems, where freight originating from the periphery of the city is transferred at intermediate locations (satellites) from larger vehicles (urban freighters) to smaller more environmentally friendly vehicles (city freighters), deemed more suited to operate in the city centre. In this paper, we address a variant of the two-echelon (capacitated) vehicle routing problem (2E-CVRP) arising in the context of city logistics encompassing characteristics such as a heterogeneous fleet of city freighters, time windows, vehicles synchronisation at satellites, direct deliveries, the possibility of freight transfers at customers, and multiple trips by city freighters. We propose a heuristic solution method for this problem based on a Variable Neighbourhood Search (VNS) heuristic, as well as a set of auxiliary evaluation metrics designed to support the decision making process. Preliminary results show the flexibility of the proposed heuristic to account for different problem characteristics, as well as the impacts of considering different best insertion criteria for the initial solution construction. Additionally, the proposed evaluation metrics have allowed for an improved assessment of the trade-offs between different city logistic solutions, and may be considered when developing decision support systems.", "keywords": [ "City logistics", "Vehicle routing problem", "Flexibility (engineering)", "Heuristic", "Context (archaeology)", "TRIPS architecture", "Computer science", "Transport engineering", "Variable (mathematics)", "Process (computing)", "Routing (electronic design automation)", "Operations research" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146522001934/pdf" }, { "id": "https://openalex.org/W2779296551", "doi": "10.2208/journalip.26.725", "title": "Evaluation of the effects of e-commerce on urban freight transport by applying models of pickup and delivery vehicle routing and scheduling problem with time windows", "year": 2009, "publication_date": "2009-01-01", "type": "article", "language": "en", "authors": [ "Kenji Takai", "Eiichi Taniguchi", "Tadashi Yamada" ], "first_author": "Kenji Takai", "venue": "INFRASTRUCTURE PLANNING REVIEW", "publisher": null, "abstract": "This paper develops the PDP (pickup and delivery vehicle routing problem) models, where customers can both receive and send goods. The performance of these models is compared to that of the classical vehicle routing problem. The effects of e-commerce as well as of establishing pickup points, which is one of the measures for city logistics on urban freight transport, are investigated using a PDP model. Results indicate that the PDP models are effective in reducing the total costs of pickup and delivery. Applications of the models to a test road network also indicates that introducing e-commerce could lead to reduction in total travel distance and CO2 emissions as well as that the establishment of pickup point could be a good measure.", "keywords": [ "Pickup", "Vehicle routing problem", "Scheduling (production processes)", "Routing (electronic design automation)", "City logistics", "Computer science", "Transport engineering", "Operations research", "Engineering", "Computer network", "Operations management" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.jstage.jst.go.jp/article/journalip1984/26/0/26_725/_pdf" }, { "id": "https://openalex.org/W2907665799", "doi": "10.2991/icpel-18.2018.95", "title": "Urban Distribution Vehicle Routing Optimization and Empirical Analysis under the Influence of Carbon Trading Policy", "year": 2018, "publication_date": "2018-01-01", "type": "conference-paper", "language": "en", "authors": [ "Jing Wang", "Kang Pu", "Zhuzhi Shen" ], "first_author": "Jing Wang", "venue": "Proceedings of the 2018 3rd International Conference on Politics, Economics and Law (ICPEL 2018)", "publisher": null, "abstract": "With the continuous improvement of the economic level, the carbon emission produced by logistics and distribution has become more and more neglecting.Therefore, this article is aimed at the actual distribution case of Wuhan Hongxu Information Technology Co. Ltd, combined with the impact of carbon trading policies.On the basis of the traditional vehicle routing problem model, an urban distribution vehicle routing optimization model with the goal of minimizing the total cost of the sum of time cost, fuel consumption cost, departure cost, and carbon transaction cost is established.The genetic algorithm was used to simulate the actual delivery case of Wuhan Hongxu Information Technology Co. Ltd.The minimum cost of the distribution task was determined, the number of delivery vehicles and the route of the delivery vehicle were obtained, and the influence of the fluctuation of carbon trading parameters on the distribution cost was analyzed Keywords-urban distribution;", "keywords": [ "Vehicle routing problem", "Distribution (mathematics)", "Routing (electronic design automation)", "Computer science", "Environmental science", "Computer network", "Mathematics" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://download.atlantis-press.com/article/25905460.pdf" }, { "id": "https://openalex.org/W7169869874", "doi": "10.1016/j.tre.2026.105105", "title": "A two-stage stochastic programming approach for the time-dependent vehicle routing problem with stochastic demands: a dynamic space–time network perspective", "year": 2026, "publication_date": "2026-07-21", "type": "article", "language": "en", "authors": [ "C Y Zhang", "Lin Xie", "Yaoxin Wu", "Tao Feng", "Lin Cheng" ], "first_author": "C Y Zhang", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Benchmark (surveying)", "Routing (electronic design automation)", "Scalability", "Stochastic programming", "Integer programming", "Decomposition", "Service (business)", "Dual (grammatical number)", "Static routing" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2026.105105" }, { "id": "https://openalex.org/W2082246825", "doi": "10.1155/2015/914309", "title": "Urban Freight Management with Stochastic Time-Dependent Travel Times and Application to Large-Scale Transportation Networks", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Shichao Sun", "Zhengyu Duan", "Dongyuan Yang" ], "first_author": "Shichao Sun", "venue": "Discrete Dynamics in Nature and Society", "publisher": "Hindawi Publishing Corporation", "abstract": "This paper addressed the vehicle routing problem (VRP) in large-scale urban transportation networks with stochastic time-dependent (STD) travel times. The subproblem which is how to find the optimal path connecting any pair of customer nodes in a STD network was solved through a robust approach without requiring the probability distributions of link travel times. Based on that, the proposed STD-VRP model can be converted into solving a normal time-dependent VRP (TD-VRP), and algorithms for such TD-VRPs can also be introduced to obtain the solution. Numerical experiments were conducted to address STD-VRPTW of practical sizes on a real world urban network, demonstrated here on the road network of Shenzhen, China. The stochastic time-dependent link travel times of the network were calibrated by historical floating car data. A route construction algorithm was applied to solve the STD problem in 4 delivery scenarios efficiently. The computational results showed that the proposed STD-VRPTW model can improve the level of customer service by satisfying the time-window constraint under any circumstances. The improvement can be very significant especially for large-scale network delivery tasks with no more increase in cost and environmental impacts.", "keywords": [ "Vehicle routing problem", "Computer science", "Constraint (computer-aided design)", "Routing (electronic design automation)", "Scale (ratio)", "Mathematical optimization", "Path (computing)", "Flow network", "Operations research", "Transport engineering", "Mathematics", "Engineering" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/ddns/2015/914309.pdf" }, { "id": "https://openalex.org/W4313459508", "doi": "10.2478/logi-2022-0022", "title": "The Economic and Environmental Benefits of Collaborative Pick-Up in Urban Delivery Systems", "year": 2022, "publication_date": "2022-01-01", "type": "article", "language": "en", "authors": [ "Sally Justiani", "Budhi Sholeh Wibowo" ], "first_author": "Sally Justiani", "venue": "Logi", "publisher": "De Gruyter Open", "abstract": "Abstract The fierce competition between carriers in urban delivery systems has led to several negative consequences, such as inefficiency, road congestion, and harmful pollution. One way to address these issues is by encouraging horizontal collaboration, since many vehicles at this stage are less than full. This study aims to evaluate the benefits of collaborative pick-up in urban delivery systems. The problems are modeled based on the multi-depot vehicle routing problem. A case study with two carriers in Pekanbaru city, Indonesia, is presented as an illustration. The numerical results suggest that the economic benefits from the collaboration are significant when the spare capacity in the system is plenty. In contrast, the environmental benefits are typically linear with the reduction of vehicle miles traveled. The study findings provide practical insights for urban planners and logistics service providers to foster sustainable development in the city.", "keywords": [ "Inefficiency", "Spare part", "Business", "Traffic congestion", "City logistics", "Environmental economics", "Vehicle routing problem", "Competition (biology)", "Service (business)", "Transport engineering", "Environmental planning", "Computer science" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://reference-global.com/2/v2/download/article/10.2478/logi-2022-0022.pdf" }, { "id": "https://openalex.org/W2115147372", "doi": "10.3141/2238-11", "title": "Estimating the Benefits of considering Travel Time Variability in Urban Distribution", "year": 2011, "publication_date": "2011-01-01", "type": "article", "language": "en", "authors": [ "Russell George Thompson", "Eiichi Taniguchi", "Tadashi Yamada" ], "first_author": "Russell George Thompson", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "Urban distribution systems typically require carriers to deliver goods to receivers within specified time windows. This paper presents procedures that allow the variable nature of travel times to be incorporated within optimization methods for the vehicle routing problem with time windows. Expressions are presented for determining the penalty costs associated with truck arrivals at customer locations with time windows when the travel times between customers are normally distributed. Formulations of this problem using stochastic programming and robust optimization (RO) are presented. Stochastic programming procedures require numerical integration techniques to be used and thus are computationally demanding. However, RO allows solutions to be generated with only a limited number of travel time scenarios between customers and, thus provides a practical means of incorporating travel time variability. A procedure was developed for estimating the cost savings of implementing the RO solution. The benefits of explicitly considering the variability of travel times between customers were estimated using a case study based on a distribution problem in Melbourne, Australia.", "keywords": [ "Truck", "Vehicle routing problem", "Computer science", "Stochastic programming", "Variable (mathematics)", "Travel time", "Mathematical optimization", "Operations research", "Routing (electronic design automation)", "Distribution (mathematics)", "Transport engineering", "Engineering" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/2238-11" }, { "id": "https://openalex.org/W2606990251", "doi": "10.7737/jkorms.2016.41.3.075", "title": "Usefulness of Drones in the Urban Delivery System: Solving the Vehicle and Drone Routing Problem with Time Window", "year": 2016, "publication_date": "2016-08-31", "type": "article", "language": "en", "authors": [ "Yerim Chung", "Taejoon Park", "Yunhong Min" ], "first_author": "Yerim Chung", "venue": "한국경영과학회지", "publisher": null, "abstract": "This paper investigates the usefulness of drones in an urban delivery system. We define the vehicle and drone routing problem with time window (VDRPTW) and present a model that can describe a dual mode delivery system consisting of drones and vehicles in the metropolitan area. Drones are relatively free from traffic congestion but have limited flight range and capacity. Vehicles are not free from traffic congestion, and the complexity of urban road network reduces the efficiency of vehicles. Using drones and vehicles together can reduce inefficiency of the urban delivery system because of their complementary cooperation. In this paper, we assume that drones operate in a point-to-point manner between the depot and customers, and that customers in the need of fast delivery are willing to pay additional charges. For the experiment datasets, we use instances of Solomon (1987), which are well known in the Vehicle Routing Problem society. Moreover, to mirror the urban logistics demand trend, customers who want fast delivery are added to the Solomon's instances. We propose a hybrid evolutionary algorithm for solving VDRPTW. The experiment results provide different useful insights according to the geographical distributions of customers. In the instances where customers are randomly located and in instances where some customers are randomly located while others form some clusters, the dual mode delivery system displays lower total cost and higher customer satisfaction. In instances with clustered customers, the dual mode delivery system exhibits narrow competition for the total cost with the delivery system that uses only vehicles. In this case, using drones and vehicles together can reduce the level of dissatisfaction of customers who take their cargo over the time-window. From the view point of strategic flexibility, the dual mode delivery system appears to be more interesting. In meeting the objective of maximizing customer satisfaction, the use of drones and vehicles incurs less cost and requires fewer resources.", "keywords": [ "Drone", "Computer science", "Metropolitan area", "Vehicle routing problem", "Routing (electronic design automation)", "Traffic congestion", "Inefficiency", "Mode (computer interface)", "Operations research", "Transport engineering", "Computer network", "Economics" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "http://koreascience.or.kr:80/article/JAKO201609633505758.pdf" }, { "id": "https://openalex.org/W2359819205", "doi": null, "title": "Vehicle Routing Optimization with Carbon Emissions Considered under Time-varying Network", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Tang Jin-hua" ], "first_author": "Tang Jin-hua", "venue": "Systems Engineering", "publisher": "Wiley", "abstract": "For the vehicle scheduling and routing distribution problem in urban distribution,we provide a multi-objective model pertaining to minimization of travel time and carbon emissions,which treats the travel speed as a critical variable.And a multi-objective particle swarm optimization(MOPSO) algorithm is provided to solve the problem.Finally,a numerical experiment about cargo of city is conducted.The superiority of time-varying network is shown.Also the influence of customer satisfaction and vehicle capacity on the Pareto results is analyzed.The research results will play an important instructing role in theory on the urban distribution with carbon emissions considered.", "keywords": [ "Vehicle routing problem", "Particle swarm optimization", "Scheduling (production processes)", "Minification", "Pareto principle", "Mathematical optimization", "Computer science", "Variable (mathematics)", "Operations research", "Routing (electronic design automation)", "Engineering", "Mathematics" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://en.cnki.com.cn/Article_en/CJFDTotal-GCXT201509006.htm" }, { "id": "https://openalex.org/W2110342725", "doi": "10.3141/1964-13", "title": "Modeling Impact of Technological Changes on Urban Commercial Trips by Commercial Activity Routing Type", "year": 2006, "publication_date": "2006-01-01", "type": "article", "language": "en", "authors": [ "Miguel Figliozzi" ], "first_author": "Miguel Figliozzi", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "Several noteworthy developments in logistics practice have taken place without an equivalent and comprehensive development in urban freight transportation modeling. Part of the problem is the lack of deep understanding of the workings of distribution processes in relation to the generation of truck traffic. This study emphasizes the role and importance that distribution network size and information and communications technology have on the truck traffic flows that materialize as the supply chain flows over the public infrastructure. A concept is developed of commercial activity routing types that characterize the interplay between transportation demand requests and routing characteristics. This research contributes to the field by proposing a novel and detailed characterization of truck flows in a supply chain context. With well-known, yet simple, models and formulas from vehicle routing, operations research, and management science literature, behavioral insights are derived about distributors’ and carriers’ routing and order-sizing decisions, since routing constraints and second-order effects are important drivers of truck flows. The main contribution is to bring a new commercial activity-routing perspective and a deeper level of operational decision-making analysis to cope with the intricacies of freight transportation modeling.", "keywords": [ "TRIPS architecture", "Transport engineering", "Routing (electronic design automation)", "Engineering", "Environmental science", "Embedded system" ], "cited_by_count": 32, "is_retracted": false, "is_paratext": false, "open_access_url": "https://pdxscholar.library.pdx.edu/cengin_fac/273" }, { "id": "https://openalex.org/W2996068532", "doi": "10.1109/iecon.2019.8927526", "title": "Impact Assessment of High Power Electric Bus Charging on Urban Distribution Grids", "year": 2019, "publication_date": "2019-10-01", "type": "conference-paper", "language": "en", "authors": [ "Daniel Stahleder", "David Reihs", "Stephan Ledinger", "Felix Lehfuß" ], "first_author": "Daniel Stahleder", "venue": null, "publisher": null, "abstract": "The ongoing electrification of public bus traffic in cities improves the local air quality and can help to reduce CO2emissions. Besides several operational challenges, an appropriate grid integration of battery electric buses (BEBs) is crucial to maintain a safe and stable operation of the distribution grid. Increasing charging powers of up to 600 kW may complicate the situation further. The objective of this study is to evaluate the grid impacts of three different bus charging methods - Every Station Charging, End Station Charging and Overnight Charging - on a typical urban European distribution grid. Therefore, the charging behavior of an electric bus line was modeled with a time resolution of one second and then connected to a large grid simulation. Multiple scenario modifications have been discussed, such as increasing the number of electrified bus lines, taking into account photovoltaics, and charging in the LV grid instead. Results show that the tested grid is capable of integrating BEBs in most situations, while Every Station Charging causes higher simultaneity of charging and larger voltage drops than the other scenarios. Moreover, LV charging shows to be unsuitable for high power charging. To conclude, the results of the simulations offer a solid basis for considerations regarding the electrification of public bus routes.", "keywords": [ "Electrification", "Grid", "Charging station", "Computer science", "Public transport", "Distribution grid", "Photovoltaics", "Battery (electricity)", "Electrical engineering", "Automotive engineering", "Power (physics)", "Electricity" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/iecon.2019.8927526" }, { "id": "https://openalex.org/W2742257659", "doi": "10.1109/wsc.2016.7822261", "title": "A simheuristic algorithm for Horizontal Cooperation in urban distribution: Application to a case study in COLOMBIA", "year": 2016, "publication_date": "2016-12-01", "type": "conference-paper", "language": "en", "authors": [ "Carlos L. Quintero-Araújo", "Angel Alejandro Juan", "Jairo R. Montoya‐Torres", "Andrés Muñoz‐Villamizar" ], "first_author": "Carlos L. Quintero-Araújo", "venue": null, "publisher": null, "abstract": "The challenge in last-mile supply chains deliveries is to maintain and improve the operational cost-effectiveness by the implementation of efficient procedures while facing increased levels of congestion in cities. One competitive alternative is Horizontal Cooperation (HC). City distribution problems under HC conditions can be modeled as multi-depot vehicle routing problems, which are NP-hard problems meaning that exact methods provide optimal solutions only for small datasets. This complexity increases when considering stochastic demand. Therefore, real-life situations must be solved using heuristic algorithms. This paper proposes the implementation of a simheuristic (i.e., an algorithm combining heuristics with simulation). Experiments are carried out using realistic data from the city of Bogotá, Colombia, regarding the distribution of goods to the whole network of the three major chains of convenience stores currently operating in the city. Results show the power of the proposed simheuristic in comparison with traditional solution approaches based on mathematical programming.", "keywords": [ "Heuristics", "Computer science", "Mathematical optimization", "Vehicle routing problem", "Heuristic", "Routing (electronic design automation)", "Supply chain", "Distribution (mathematics)", "Algorithm", "Operations research", "Mathematics", "Artificial intelligence" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/wsc.2016.7822261" }, { "id": "https://openalex.org/W2511969379", "doi": "10.1016/j.ijepes.2016.08.001", "title": "Path-set based optimal planning of new urban distribution networks", "year": 2016, "publication_date": "2016-08-25", "type": "article", "language": "en", "authors": [ "Jovan M. Nahman", "Dragoslav Perić" ], "first_author": "Jovan M. Nahman", "venue": "International Journal of Electrical Power & Energy Systems", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Set (abstract data type)", "Path (computing)", "Motion planning", "Computer science", "Mathematical optimization", "Distribution (mathematics)", "Operations research", "Artificial intelligence", "Mathematics", "Computer network" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ijepes.2016.08.001" }, { "id": "https://openalex.org/W4385603493", "doi": "10.1016/j.tre.2023.103234", "title": "Route planning for last-mile deliveries using mobile parcel lockers: A hybrid q-learning network approach", "year": 2023, "publication_date": "2023-08-05", "type": "article", "language": "en", "authors": [ "Yubin Liu", "Qiming Ye", "Jose Javier Escribano Macias", "Yuxiang Feng", "Eduardo Candela", "Panagiotis Angeloudis" ], "first_author": "Yubin Liu", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": "Mobile parcel lockers (MPLs) have been recently proposed by logistics operators as a technology that could help reduce traffic congestion and operational costs in urban freight distribution. Given their ability to relocate throughout their area of deployment, they hold the potential to improve customer accessibility and convenience. In this study, we formulate the Mobile Parcel Locker Problem (MPLP), a special case of the Location-Routing Problem (LRP) which determines the optimal stopover location for MPLs throughout the day and plans corresponding delivery routes. A Hybrid Q-Learning-Network-based Method (HQM) is developed to resolve the computational complexity of the resulting large problem instances while escaping local optima. In addition, the HQM is integrated with global and local search mechanisms to resolve the dilemma of exploration and exploitation faced by classic reinforcement learning (RL) methods. We examine the performance of HQM under different problem sizes (up to 200 nodes) and benchmarked it against the exact approach and Genetic Algorithm (GA). Our results indicate that HQM achieves better optimisation performance with shorter computation time than the exact approach solved by the Gurobi solver in large problem instances. Additionally, the average reward obtained by HQM is 1.96 times greater than GA’s, which demonstrates that HQM has a better optimisation ability. Further, we identify critical factors that contribute to fleet size requirements, travel distances, and service delays. Our findings outline that the efficiency of MPLs is mainly contingent on the length of time windows and the deployment of MPL stopovers. Finally, we highlight managerial implications based on parametric analysis to provide guidance for logistics operators in the context of efficient last-mile distribution operations.", "keywords": [ "Computer science", "Software deployment", "Reinforcement learning", "Solver", "Vehicle routing problem", "Mathematical optimization", "Service (business)", "Routing (electronic design automation)", "Multiprotocol Label Switching", "Last mile (transportation)", "Operations research", "Genetic algorithm" ], "cited_by_count": 54, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2023.103234" }, { "id": "https://openalex.org/W2740621768", "doi": "10.1109/icsssm.2017.7996286", "title": "Choosing the fastest route for urban distribution based on big data of vehicle travel time", "year": 2017, "publication_date": "2017-06-01", "type": "conference-paper", "language": "en", "authors": [ "Kesheng Tang", "Min Qian", "Limei Duan" ], "first_author": "Kesheng Tang", "venue": null, "publisher": null, "abstract": "With the increase in the number of urban cars, the city's road congestion is getting heavier and heavier. Often, we choose the shortest path to reduce costs and improve efficiency during logistics distribution, but now, in order to improve timeliness, it is necessary to choose the fastest route to deliver because of traffic jams. This paper proposes a method to select the fastest route based on big data of vehicle travel time, replacing distance values with travel time values, by using the improved Floyd algorithm. The method can improve the efficiency of urban distribution and reduce the time cost, and has significant application value.", "keywords": [ "Travel time", "Transport engineering", "Computer science", "Big data", "Traffic congestion", "Path (computing)", "Order (exchange)", "Distribution (mathematics)", "Shortest path problem", "City logistics", "Operations research", "Computer network" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/icsssm.2017.7996286" }, { "id": "https://openalex.org/W4366150211", "doi": "10.1016/j.procs.2023.03.124", "title": "How the Street Network Slope Influences Fuel Consumption in Urban Freight Routing", "year": 2023, "publication_date": "2023-01-01", "type": "conference-paper", "language": "en", "authors": [ "Javier Yesid Mahecha Nuñez", "Rafael Humberto Rojas Millán", "Juan José Cabello Eras", "Oscar Pinto Garralaga", "Gustavo Gatica" ], "first_author": "Javier Yesid Mahecha Nuñez", "venue": "Procedia Computer Science", "publisher": "Elsevier BV", "abstract": "Although there are many investigations on the problem of vehicle routing, few consider the real slope changes in the road networks of cities. The objective of this work is to calculate the effect that the slopes of a road network can have on fuel consumption, combining a metaheuristic solution algorithm, traffic characterization and an algorithm for the calculation of road slopes. The results of the model show that considering the slope in the urban merchandise distribution model can increase the estimates of fuel consumption by 28.67%.", "keywords": [ "Computer science", "Fuel efficiency", "Routing (electronic design automation)", "Traffic network", "Vehicle routing problem", "Routing algorithm", "Work (physics)", "Consumption (sociology)", "Transport engineering", "Automotive engineering", "Computer network", "Routing protocol" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.procs.2023.03.124" }, { "id": "https://openalex.org/W2490418198", "doi": "10.1201/b17715-13", "title": "Intelligent Transport Systems in City Logistics", "year": 2014, "publication_date": "2014-10-29", "type": "book-chapter", "language": "en", "authors": [ "Eiichi Taniguchi", "Russell G. Thompson" ], "first_author": "Eiichi Taniguchi", "venue": null, "publisher": null, "abstract": "Intelligent Transport Systems (ITS) plays an important role in promoting city logistics for efcient and environmentally friendly urban freight transport systems (Taniguchi et al., 2001). It is no exaggeration to say that the goals of city logistics, which are mobility, sustainability, and livability, 9.1 Introduction 135 9.2 Function of ITS 137 9.3 Applications in City Logistics 140 9.3.1 Modeling City Logistics Using Historical or Real-Time Travel Time Data 140 9.3.2 Matching Systems between Shippers’ Orders and Unutilized Capacity on Trucks via the Internet 142 9.3.3 Parking Information and Booking Systems 143 9.3.4 Joint Delivery Systems 143 9.4 Future Perspectives 145 9.4.1 Platform of Public-Private Partnerships (PPP) 145 9.4.2 Co-modality 146 References 147 cannot be achieved without ITS. There are two reasons for this. One reason is that ITS considerably helps in monitoring the behavior of several of the stakeholders involved in urban freight transport systems, including shippers, freight carriers, administrators, and residents. ITS assists in identifying improved solutions and implementing policy measures relating to urban freight transport issues. Shippers worry about their logistics costs, freight carriers concentrate on providing reliable goods delivery services in urban areas to meet the requests of shippers including time windows. Residents worry about air pollution, noise, vibration, and visual intrusion by pickup-delivery trucks movements and parking when loading/ unloading goods. Administrators in municipalities aim to promote economic development as well as to reduce negative environmental impacts. ITS and Information and Communication Technology (ICT) have the capability of solving these complicated and difcult problems. The other reason is that the efciency of urban freight transport seems to be contradictory to environmental friendliness, but ITS and ICT can solve this contradiction. A good example can be seen in the optimization of Vehicle Routing and scheduling Problems (VRP) based on ITS as well as joint delivery systems using ITS. ITS is very powerful for collecting precise data on the variation of travel times on road networks and these data can be used to establish probabilistic VRP models and solutions that incorporate the uncertainty of travel times.", "keywords": [ "City logistics", "Business", "Computer science", "Transport engineering", "Engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1201/b17715-13" }, { "id": "https://openalex.org/W2083611113", "doi": "10.1016/j.sbspro.2014.01.1488", "title": "Predictive Models for Routing in Urban Distribution", "year": 2014, "publication_date": "2014-03-01", "type": "conference-paper", "language": "en", "authors": [ "Raluca Raicu", "Şerban Raicu", "Dorinela Costescu", "Mihaela Popa" ], "first_author": "Raluca Raicu", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "Freight urban distribution faces various and complex uncertainties in relation to travel and idle times in operation. In order to schedule the distribution, time reserves have to be factored in to compensate for the random travel time variations. This paper presents methodologies to estimate the time reserves based on travel and idle time costs, and statistical data. In addition there are solutions presented to stimulate on time deliveries to customers by giving priority to vehicles running on time according to the planned schedule. The comparison between alternatives for a certain origin and destination is performed with the aid of multi-criteria analysis. The problem of finding the optimal route is solved employing a specific methodology. Recommendations are made for on time deliveries.", "keywords": [ "Schedule", "Idle", "Computer science", "Vehicle routing problem", "Operations research", "Travel time", "Distribution (mathematics)", "Routing (electronic design automation)", "Order (exchange)", "Relation (database)", "Transport engineering", "Mathematics" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877042814015262/pdf" }, { "id": "https://openalex.org/W1596562670", "doi": null, "title": "City logistics : network modelling and intelligent transport systems", "year": 2001, "publication_date": "2001-01-01", "type": "book", "language": "en", "authors": [ "栄一 谷口" ], "first_author": "栄一 谷口", "venue": "Pergamon eBooks", "publisher": null, "abstract": "Chapter headings: Introduction. Modelling city logistics. City logistics with ITS. Demand and supply models. Impact models. Vehicle routing and scheduling. Vehicle routing and scheduling with ITS. Location of logistics terminals. Future perspectives. References. Index.", "keywords": [ "City logistics", "Scheduling (production processes)", "Vehicle routing problem", "Operations research", "Transport engineering", "Computer science", "Routing (electronic design automation)", "Computer network", "Engineering", "Operations management" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ci.nii.ac.jp/ncid/BA52658230" }, { "id": "https://openalex.org/W649581983", "doi": null, "title": "The Potential of Urban Freight Consolidation for the Toronto Central Business District", "year": 2014, "publication_date": "2014-01-01", "type": "article", "language": "en", "authors": [ "Fangzhou Su", "Matthew J. Roorda" ], "first_author": "Fangzhou Su", "venue": "Transportation Research Board 93rd Annual MeetingTransportation Research Board", "publisher": null, "abstract": "In large metropolitan centres, multiple courier and small package delivery companies often deliver large amounts of goods to many receivers in a small area, which leads to opportunities to improve efficiency by consolidating these goods at an urban freight consolidation centre. In this study, a consolidation centre is proposed to serve the Toronto Central Business District (CBD) and located on the south east corner of the study area. Demand for goods delivery in the Toronto CBD is simulated and assigned to numerous courier and small package delivery companies. Delivery vehicles are routed through the study area to determine the total distance travelled with and without freight consolidation. Multiple scenarios with varying numbers of participating companies and levels of market share are tested. The results show that savings in total vehicle-kilometres travelled is positive in the majority of scenarios, and the savings increase as the number of participating companies increase, and decrease as the number of deliveries for these participating companies increase.", "keywords": [ "Metropolitan area", "Consolidation (business)", "City logistics", "Central business district", "Business", "Kilometer", "Transport engineering", "Travel time", "Operations management", "Finance", "Geography", "Engineering" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1288135" }, { "id": "https://openalex.org/W845702668", "doi": null, "title": "CITY LOGISTICS CONCEPT FOR KASSEL", "year": 1997, "publication_date": "1997-09-01", "type": "article", "language": "en", "authors": [ "Uwe Köhler", "S Strauss" ], "first_author": "Uwe Köhler", "venue": null, "publisher": null, "abstract": "The rising number of urban freight deliveries, especially to retail shops in central business districts (CBD), is leading to considerable traffic increases. The resulting problems include congestion leading to loss of time and additional trip lengths due to detours, uncoordinated deliveries, and underused vehicles. The Kassel City Logistics project, begun in 1994, was one of the first German projects to cover a whole CBD. This initiative was taken by ten forwarder agents, to supply the city more efficiently, and contribute to better traffic and environmental conditions. The agents cooperate and arrange for a neutral carrier to deliver their goods to and from the CBD, but this project covers only about 3% of the CBD's traffic. Full-scale city logistics requires participants' willingness to communicate, overcome competition, and find common solutions. Its effects can be increased by considering various possibilities, including: (1) its expansion to larger city areas and large retailers; (2) including further commercial traffic; (3) including services for home delivery and removing packing material, etc.; (4) considering the possible role of public transport in delivering goods; (5) using low-emission vehicles; and (6) using advanced computer and information systems to plan routes. For the covering abstract, see IRRD 898133.", "keywords": [ "Business", "Traffic management", "Transport engineering", "Traffic congestion", "Competition (biology)", "Plan (archaeology)", "City logistics", "Truck", "Public transport", "Supply chain", "Scale (ratio)", "Operations management" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/486535" }, { "id": "https://openalex.org/W2586218869", "doi": null, "title": "Sustainable city logistics : fleet planning, routing and scheduling problems", "year": 2015, "publication_date": "2015-01-01", "type": "dissertation", "language": "en", "authors": [ "Anna Franceschetti" ], "first_author": "Anna Franceschetti", "venue": "TU/e Research Portal", "publisher": null, "abstract": "più si perdeva in quartieri sconosciuti di città lontane, più capiva le altre città che aveva attraversato per giungere fin là Italo Calvino, Le città invisibili the more one was lost in unfamiliar quarters of distant cities, the more one understood the other cities he had crossed to arrive there I am grateful to all my current and former colleagues at the OPAC department.", "keywords": [ "Scheduling (production processes)", "Vehicle routing problem", "Business", "Operations research", "Computer science", "Operations management", "Transport engineering", "Routing (electronic design automation)", "Engineering", "Computer network" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://research.tue.nl/nl/publications/d2848b1b-64be-46c4-9d84-e1ca5d02a1d4" }, { "id": "https://openalex.org/W2766796395", "doi": "10.1007/978-3-319-67636-4_2", "title": "Analyzing Last Mile Delivery Operations in Barcelona’s Urban Freight Transport Network", "year": 2017, "publication_date": "2017-10-26", "type": "conference-paper", "language": "en", "authors": [ "Burcu Kolbay", "Petar Mrazovic", "Josep Llus Larriba-Pey" ], "first_author": "Burcu Kolbay", "venue": "Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering", "publisher": null, "abstract": null, "keywords": [ "Mile", "Last mile (transportation)", "Transport engineering", "City logistics", "Business", "Engineering", "Geography" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-67636-4_2" }, { "id": "https://openalex.org/W4402773048", "doi": "10.1007/978-3-031-70977-7_4", "title": "Cargo Bikes for Sustainable City Logistics Systems: Optimizing Distribution Routes in a Dynamic Environment", "year": 2024, "publication_date": "2024-01-01", "type": "conference-paper", "language": "en", "authors": [ "Natalya Shramenko", "Christoph Hupfer", "Vladyslav Shramenko" ], "first_author": "Natalya Shramenko", "venue": "Lecture notes in logistics", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Business", "Transport engineering", "City logistics", "Environmental planning", "Environmental science", "Engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-031-70977-7_4" }, { "id": "https://openalex.org/W4417006888", "doi": "10.1038/s41598-025-29861-y", "title": "Optimizing urban last mile delivery efficiency through dynamic vehicle routing heuristics and traffic flow analysis", "year": 2025, "publication_date": "2025-12-04", "type": "article", "language": "en", "authors": [ "Lu Liu", "Tianxia Wang" ], "first_author": "Lu Liu", "venue": "Scientific Reports", "publisher": "Nature Portfolio", "abstract": "Urban last-mile delivery systems operate under volatile traffic conditions, narrow delivery windows, and frequent real-time disruptions that limit the effectiveness of static and single-strategy vehicle routing approaches. Existing dynamic and traffic-aware VRP models address these challenges only partially, lacking unified mechanisms for adaptive search, congestion-sensitive cost evaluation, and proactive disruption management. This research introduces a Tabu-guided Adaptive Large Neighborhood Search with Rollout-based Real-Time Dispatch (T-ALNS-RRD), a traffic-aware optimization framework that integrates three previously uncombines components: (a) an ALNS core enhanced with dynamic congestion-penalized cost functions, (b) a multi-layered Tabu memory system with move-based, solution-based, and frequency-based diversification for non-cycling exploration, and (c) a rollout-based dispatch mechanism that conducts bounded-horizon simulations to pre-emptively select disruption responses. Experimental evaluation on a realistic urban delivery scenario involving 47 customers and 4 vehicles demonstrates significant performance advances over static and traffic-aware baselines. T-ALNS-RRD achieves a 24.3% reduction in total operational cost, increases on-time delivery rates from 68.1% to 92.8%, and reduces congestion exposure by 54.4%. Under extreme traffic variability, the method limits degradation to 15.1%, compared to 26.2% in static systems. Real-time adaptation enables the successful handling of 27.4 disruptive events per scenario with a 94.2% resolution rate and an average response time of 143.7 ms. Statistical comparison against state-of-the-art (SOTA) metaheuristics confirms a performance improvement of 6.6% (p < 0.001) under the tested conditions. These findings establish the approach as a validated mid-scale framework for dynamic urban delivery optimization and provide a scalable methodological basis for future large-instance deployments.", "keywords": [ "Vehicle routing problem", "Scalability", "Heuristics", "Metaheuristic", "Traffic congestion", "Tabu search", "Routing (electronic design automation)", "Resilience (materials science)" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.nature.com/articles/s41598-025-29861-y_reference.pdf" }, { "id": "https://openalex.org/W4408089309", "doi": "10.54254/2753-8818/2025.21231", "title": "Research on Vehicle Routing Optimization Based on VRPTW", "year": 2025, "publication_date": "2025-03-03", "type": "article", "language": "en", "authors": [ "Lingling Zeng", "Zijin Wang" ], "first_author": "Lingling Zeng", "venue": "Theoretical and Natural Science", "publisher": null, "abstract": "Urban delivery, as an important link in the logistics chain, plays an increasingly prominent role in supporting urban manufacturing, consumption economy, and other sectors. This study establishes a mathematical model aimed at minimizing total cost, exploring the Vehicle Routing Problem with Time Windows (VRPTW) considering factors such as time windows, cargo capacity, and the number of vehicles. The model and algorithm’s effectiveness is validated through simulation examples. The results show that the model and algorithm successfully solve the VRPTW problem, providing a feasible path optimization method for industry practitioners.", "keywords": [ "Vehicle routing problem", "Computer science", "Mathematical optimization", "Routing (electronic design automation)", "Mathematics", "Computer network" ], "cited_by_count": 1, "is_retracted": false, "is_paratext": false, "open_access_url": "https://tns.ewapub.com/article/view/21231.pdf" }, { "id": "https://openalex.org/W2989949285", "doi": "10.18287/1613-0073-2019-2416-95-103", "title": "Optimization of urban freight transportation based on evolutionary modelling", "year": 2019, "publication_date": "2019-01-01", "type": "conference-paper", "language": "en", "authors": [ "Elizaveta Gladchenko", "Сапрыкин Олег Николаевич", "Aleksey Tikhonov" ], "first_author": "Elizaveta Gladchenko", "venue": null, "publisher": null, "abstract": "Logistics problems require special attention, because every year they become more complicated and multivariable. On the one hand, a supply chain management includes incessant monitoring of such issues as requests elaboration, paths determination, routing of shipments, multimodal choice, set up of transhipments, fleet choice and maintenance, warehousing, packaging and others. On the other hand, dozens of people are involved in the logistics process. All these moments complicate the decision-making that is why data driven decisions are required nowadays. As well as shipment problems are NP-hard, the heuristic methods should be applied to resolve them. In this article we propose a genetic algorithm to solve the complex problem that consists of the Travelling Salesman Problem combined with the Knapsack Problem. We have developed an urban freight transportation model which is focused on the minimization of the underway time as well as on the maximization of the truck’s loading. A significant contribution in our method is the census of traffic frequency by using traffic zoning. The developed approach has been implemented using the Python programming language in the Zeppelin environment. The first version of the system has been approved in the city of Samara (Russia) with test demand dataset.", "keywords": [ "Computer science", "Truck", "Travelling salesman problem", "Operations research", "Vehicle routing problem", "Knapsack problem", "Genetic algorithm", "Heuristic", "Zoning", "Process (computing)", "Transport engineering", "Routing (electronic design automation)" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.18287/1613-0073-2019-2416-95-103" }, { "id": "https://openalex.org/W4232378610", "doi": "10.1007/978-3-319-07153-4_55-1", "title": "City Logistics", "year": 2017, "publication_date": "2017-01-01", "type": "book-chapter", "language": "en", "authors": [ "Jaume Barceló", "Hanna Grzybowska", "Jesús Arturo Orozco" ], "first_author": "Jaume Barceló", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Computer science", "Key (lock)", "Set (abstract data type)", "Field (mathematics)", "Vehicle routing problem", "Operations research", "Metaheuristic", "Management science", "Routing (electronic design automation)", "Engineering", "Artificial intelligence", "Computer security" ], "cited_by_count": 2, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-07153-4_55-1" }, { "id": "https://openalex.org/W4414957519", "doi": "10.1016/j.ejor.2025.10.008", "title": "A hybrid urban delivery system with robots", "year": 2025, "publication_date": "2025-10-08", "type": "article", "language": "en", "authors": [ "Shaohua Yu", "Ann Melissa Campbell", "Jan Fabian Ehmke", "Jakob Puchinger" ], "first_author": "Shaohua Yu", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Robot", "Hybrid system", "Delivery Performance", "Distribution (mathematics)", "Sensitivity (control systems)", "Delivery system" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hal.science/hal-05307302v1/document" }, { "id": "https://openalex.org/W601611699", "doi": null, "title": "Multi-agent model for an Urban Distribution Centre", "year": 2010, "publication_date": "2010-10-14", "type": "dissertation", "language": "en", "authors": [ "A.H. Van Kolck" ], "first_author": "A.H. Van Kolck", "venue": "Research Repository (Delft University of Technology)", "publisher": "Delft University of Technology", "abstract": "In a 6 month research at Kyoto University and Delft University of Technology, the urban distribution centre (UDC) was investigated with a multi-agent model to find situations where the UDC can be financial viable. From a literature study the main modeling components were found: commodity estimation, vehicle routing, traffic environment, agent interaction and various policy measurements. Policies to test the impact on the business case of the UDC are: different congestion and toll rates, subsidy and a dynamic fee. Hereby a gap in literature is addressed by dynamic modeling with a multi-agent model with vehicle routing and incorporating dynamic usage. Dynamics are included with variable traffic conditions (resulting in dynamic travel times) and dynamic demand locations. Dynamic UDC usage was tested by various delivery schemes and a dynamic fee, which changes hourly. After generating the multi-agent model with a genetic algorithm for vehicle routing, it has to be checked that an increasing UDC usage rate corresponds to decreasing both the NOx emission and km count (NOx emission reduction of 19.0% ± 13.7 % and km count reduction of 18.8% ± 12.9% over 2318 runs). The model tested different UDC delivery schemes (early delivery, fixed time delivery or full truck delivery), congestion rates (low, normal or high), toll rates (none, low or high) and subsidy levels (none, 25%, 33% or 50% subsidized). The only positive business case for the UDC is with a subsidy rate of 50% (rate 4), which shows the complexity of generating a positive business case for an UDC. Per setting 360 runs were performed. To enhace the UDC financial performance the dynamic UDC fee was tested. This fee varies during the different hours of the day. Five cases were tested by increasing the general dynamic fee curve with an additional global shift of -20, -10, 0, 10 or 20 Yen per parcel. The impact of NOx emission or km count reduction correcsponds to the fixed fee scenario. Per setting 50 runs were performed. Significant differences between various dynamic fee settings are present. The fact that the UDC income is close to being significantly higher than the -300.000 Yen per day, compared to similar fixed fee conditions is highly encouraging. However further and full evaluation of all possible dynamic fee settings is desired to find potential better dynamic fee settings than the currently used settings. At the end of this research three cases are compared for dynamic fee usage: a reference case, highly congested city case and the involved municipality case. Comparing the three scenarios, there is no significant difference between the NOx emission or km count reduction and the freight carriers costs. For the UDC income there is a significant income increase in the third scenario with respect to the other scenarios. Also for the municipality there is a significant increase in costs in the third scenario. Since there is no significant decrease in NOx emission or km count between the second and third scenario, the municipality will need other social or financial incentives, before the municipality will participate in providing such high and long term subsidies. From this research it is clear that generating a positive business for a UDC is highly challenging. For a UDC to be profitable, it seems to be necessary to receive subsidy permanently. This analysis of the UDC analysis relates to the low UDC success rate of the research of Browne, Sweet et al (2005). The conditions for generating a successful business case for the UDC are hard and limited. Further research of dynamic fee settings and investigation of the possibility to implement this in a real-life case can contribute to future prospective and the success rate for urban distribution centres.", "keywords": [ "Subsidy", "Toll", "Vehicle routing problem", "Truck", "Computer science", "Traffic congestion", "Business model", "Congestion pricing", "Variable (mathematics)", "Transport engineering", "Routing (electronic design automation)", "Operations research" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://repository.tudelft.nl/file/File_e088cbfc-6cc2-4736-a0a8-42faecfa2bd9" }, { "id": "https://openalex.org/W2230263726", "doi": null, "title": "Comparing fast VRP algorithms for collaborative urban freight transport systems: a solution probleming analysis", "year": 2015, "publication_date": "2015-01-01", "type": "preprint", "language": "en", "authors": [ "Josep Maria Salanova Grau", "Jesús González-Feliu" ], "first_author": "Josep Maria Salanova Grau", "venue": "RePEc: Research Papers in Economics", "publisher": "Federal Reserve Bank of St. Louis", "abstract": "This paper proposes a comparison between two fast heuristic algorithms to solve a multi-carrier 2E-VRP in city logistics, under realistic conditions. We propose a cluster-first route second algorithm to compare the performance of two route construction and post-optimization algorithms on real-size test cases. The clustering phase is made by a seep algorithm, which defines the number of used vehicles and assigns a set of customers to it. Then, for each cluster, which represents a vehicle, we build a min-cost route by the two following methods. The first is a semi-greedy algorithm. The second is a genetic algorithm that includes post-optimization at the level of each route. In this work we make the route construction and post-optimization without any possible exchange of the routes to guaranty a pertinent comparison between both algorithms. After presenting both approaches, we apply them, first to classical 2E-CVRP instances to state on the algorithm capabilities, then on real-size instances to compare them. Computational results are presented and discussed. Finally, practical implications are addressed.", "keywords": [ "Computer science", "Algorithm", "Cluster analysis", "Heuristic", "Greedy algorithm", "Vehicle routing problem", "Set (abstract data type)", "Genetic algorithm", "Mathematical optimization", "Routing (electronic design automation)", "Mathematics", "Artificial intelligence" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://EconPapers.repec.org/RePEc:hal:journl:halshs-01176134" }, { "id": "https://openalex.org/W3199498228", "doi": "10.1109/iciss53185.2021.9533210", "title": "A Reference Framework for the Performance-Based Decision Support of City Authorities in Urban Freight Transport", "year": 2021, "publication_date": "2021-08-02", "type": "conference-paper", "language": "en", "authors": [ "Thomas G. Otte", "Tobias Meisen" ], "first_author": "Thomas G. Otte", "venue": null, "publisher": null, "abstract": "Urban freight transport is one major contributor to the existing externalities of urban transport (e.g., congestion, pollutant emissions). While the extent of these externalities is often the result of decentral and extra-urban decision-making processes of involved actors (e.g., tour planning and routing of fleet operators), the responsibility to implement corrective as well as preventive measures is typically centralized in the hands of the city authorities. In conformity with their key functions, the authorities have to meet, the often oppositely aligned, societal expectations, business needs as well as existing political objectives. Amplified by this constellation, selecting effective measures with positive cost-benefit relations for the society from an existing plethora of measures leads to complex decision scenarios and embodies a particularly challenging endeavor. In order to supplement existing approaches to support the decision-making of city authorities in urban freight transport (e.g., modeling and simulation; stakeholder involvement procedures), performance-based procedures from the domain of information management embody promising approaches. As one fundamental step towards their realization, this paper presents a reference framework to define the system boundaries, to relate the involved system components, and to establish a consistent perspective as well as a uniform understanding for scholars and practitioners. In this context, the framework development process is presented along with a pre-defined set of requirements.", "keywords": [ "Externality", "Stakeholder", "Context (archaeology)", "Process (computing)", "Computer science", "Process management", "Decision support system", "Multiple-criteria decision analysis", "Order (exchange)", "Business", "Risk analysis (engineering)", "Transport engineering" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/iciss53185.2021.9533210" }, { "id": "https://openalex.org/W3107543150", "doi": "10.1109/fists46898.2020.9264858", "title": "Shipment-based urban freight emission calculation", "year": 2020, "publication_date": "2020-11-03", "type": "conference-paper", "language": "en", "authors": [ "Sebastiaan Thoen", "Michiel de Bok", "Lóránt Antal Tavasszy" ], "first_author": "Sebastiaan Thoen", "venue": null, "publisher": null, "abstract": "In this paper we present a methodology to more accurately calculate emissions in regional freight transportation models by taking the loading rate of vehicles into account in the emission factors. This is done by incorporating the shipment-based demand data from a multi-agent simulation framework into the route assignment. In a case study we show that disregarding the vehicle loading rate can lead to underestimations of the amount of pollutant gasses. The application of this methodology in combination with a multi-agent simulation model allows to simulate impacts of changes in logistics behavior, such as vehicle type use or the scheduling of round tours, on emissions more accurately.", "keywords": [ "Scheduling (production processes)", "Transport engineering", "Environmental science", "Computer science", "Automotive engineering", "Pollutant", "Simulation", "Engineering", "Operations management" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "http://resolver.tudelft.nl/uuid:8b423847-ea63-4370-8c35-dad02131e59a" }, { "id": "https://openalex.org/W1584800183", "doi": null, "title": "Management of Competing Demands on Urban Freight Corridors", "year": 2005, "publication_date": "2005-12-01", "type": "article", "language": "en", "authors": [ "Euan Ramsay", "Jonathan M. Bunker" ], "first_author": "Euan Ramsay", "venue": "QUT ePrints (Queensland University of Technology)", "publisher": "Queensland University of Technology", "abstract": "Abstract: This paper compares the performance under various scenarios of an urban traffic corridor section subjected to a range of vehicle types. A micro-simulation-based model of the corridor was developed from first principles to stochastically assign characteristics and headways for each vehicle and then to track each vehicle as it moved along the corridor. Kinematic behaviour of the different vehicle types (ranging from passenger cars through to B-doubles) were obtained from GPS data collected during a series of chase car surveys on an urban arterial freight route in suburban Brisbane. The car-following and lane-selection algorithms used by the model are outlined in the paper. In order to account for the variability between runs, multiple simulation runs were typically conducted using different random number seeds. Corridor performance was reported in terms of intersection capacity and delays as well as travel speeds and stop rates for each vehicle type. The performance of the corridor was found to be sensitive to traffic control measures including the speed limit and traffic signal controller settings such as cycle time and progression design speed. A range of freight policy scenarios were examined, including the effects of increasing freight volumes, freight vehicle mode choice, and vehicle type-specific lane restrictions. Some policies having the potential to improve corridor traffic performance and freight efficiency were able to be identified.", "keywords": [ "Transport engineering", "Intersection (aeronautics)", "Speed limit", "Range (aeronautics)", "Microsimulation", "Truck", "Track (disk drive)", "Engineering", "Computer science", "Automotive engineering" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://eprints.qut.edu.au/10672/1/10672.pdf" } ]