[ { "id": "https://openalex.org/W2088221540", "doi": "10.1007/s13676-014-0074-0", "title": "Vehicle routing problems for city logistics", "year": 2015, "publication_date": "2015-01-09", "type": "article", "language": "en", "authors": [ "Diego Cattaruzza", "Nabil Absi", "Dominique Feillet", "Jesús González-Feliu" ], "first_author": "Diego Cattaruzza", "venue": "EURO Journal on Transportation and Logistics", "publisher": "Springer Science+Business Media", "abstract": "This paper surveys the vehicle routing problems met in cities for good distribution. It applies the following methodology. First, it gives an overview of the literature devoted to vehicle route optimization in cities. Then, it classifies and analyses urban logistic flows. As a result, it identifies the principal scientific challenges that need to be addressed: time-dependency, multi-level and multi-trip organization of the distribution, dynamic information. Finally, it focuses on each one of these challenges, analyses the main difficulties they imply and how they are treated in the literature.", "keywords": [ "Vehicle routing problem", "Principal (computer security)", "Dependency (UML)", "Routing (electronic design automation)", "Distribution (mathematics)", "Computer science", "Operations research", "City logistics", "Transport engineering", "Engineering", "Computer security", "Artificial intelligence" ], "cited_by_count": 336, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2192437620300893/pdf" }, { "id": "https://openalex.org/W2146004814", "doi": "10.1016/j.cor.2012.04.007", "title": "An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics", "year": 2012, "publication_date": "2012-04-27", "type": "article", "language": "en", "authors": [ "Vera C. Hemmelmayr", "Jean‐François Cordeau", "Teodor Gabriel Crainic" ], "first_author": "Vera C. Hemmelmayr", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": "In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP.", "keywords": [ "Vehicle routing problem", "Heuristic", "Computer science", "Context (archaeology)", "Routing (electronic design automation)", "Mathematical optimization", "Scheme (mathematics)", "Local search (optimization)", "Operations research", "Mathematics", "Algorithm", "Artificial intelligence" ], "cited_by_count": 535, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0305054812000871/pdf" }, { "id": "https://openalex.org/W2914011715", "doi": "10.1016/j.trd.2019.01.006", "title": "Energy consumption estimation integrated into the Electric Vehicle Routing Problem", "year": 2019, "publication_date": "2019-02-13", "type": "article", "language": "en", "authors": [ "Rafael Basso", "Balaźs Kulcsár", "Bo S. Egardt", "Peter Lindroth", "Ivan Sanchez-Diaz" ], "first_author": "Rafael Basso", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Energy consumption", "Routing (electronic design automation)", "Payload (computing)", "Energy (signal processing)", "Computer science", "Powertrain", "Range (aeronautics)", "Automotive engineering", "Electric vehicle", "Mathematical optimization", "Acceleration", "Simulation" ], "cited_by_count": 282, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2019.01.006" }, { "id": "https://openalex.org/W2084724891", "doi": "10.1016/j.sbspro.2012.03.105", "title": "The Waste Collection Vehicle Routing Problem with Time Windows in a City Logistics Context", "year": 2012, "publication_date": "2012-01-01", "type": "conference-paper", "language": "en", "authors": [ "Katja Buhrkal", "Allan Larsen", "Stefan Røpke" ], "first_author": "Katja Buhrkal", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "Collection of waste is an important logistic activity within any city. In this paper we study how to collect waste in an efficient way. We study the Waste Collection Vehicle Routing Problem with Time Window which is concerned with finding cost optimal routes for garbage trucks such that all garbage bins are emptied and the waste is driven to disposal sites while respecting customer time windows and ensuring that drivers are given the breaks that the law requires. We propose an adaptive large neighborhood search algorithm for solving the problem and illustrate the usefulness of the algorithm by showing that the algorithm can improve the objective of a set of instances from the literature as well as for instances provided by a Danish garbage collection company.", "keywords": [ "Garbage", "Truck", "Vehicle routing problem", "Garbage collection", "Waste collection", "Computer science", "Context (archaeology)", "Operations research", "Set (abstract data type)", "Data collection", "Routing (electronic design automation)", "Transport engineering" ], "cited_by_count": 177, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877042812005721/pdf" }, { "id": "https://openalex.org/W4213318779", "doi": "10.1016/j.ejor.2022.02.022", "title": "Two-echelon vehicle routing problems: A literature review", "year": 2022, "publication_date": "2022-02-22", "type": "article", "language": "en", "authors": [ "Natasja Sluijk", "Alexandre M. Florio", "Joris Kinable", "Nico Dellaert", "Tom Van Woensel" ], "first_author": "Natasja Sluijk", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": "In the two-echelon vehicle routing problem (2E-VRP), the distribution network is split into two echelons. Different vehicles are operated on the first and second echelon to maintain economies of scale and adhere to any vehicle restrictions that may be present in either echelon. Intermediate facilities are located at the borders of the echelons to facilitate the consolidation and transshipment of goods between echelons. Examples of two-echelon distribution systems include express delivery, grocery and hypermarket products distribution, multi-modal freight transportation, city logistics, and e-commerce and home delivery services. In recent years, the body of literature on the 2E-VRP has expanded significantly. Over 60 research papers have appeared in the scientific literature so far, which underlines both the academic and practical relevance of 2E-VRPs. In this review, we structure and revise all literature on the 2E-VRP. Mathematical formulations, exact and heuristic solution methods, and benchmark datasets used to test and evaluate new algorithms are reviewed and discussed. This survey concludes with a selected list of open research areas on 2E-VRPs.", "keywords": [ "Vehicle routing problem", "Transshipment (information security)", "Computer science", "Consolidation (business)", "Benchmark (surveying)", "Operations research", "Heuristic", "Green logistics", "Routing (electronic design automation)", "Business", "Mathematics", "Economics" ], "cited_by_count": 236, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2022.02.022" }, { "id": "https://openalex.org/W1996315642", "doi": "10.1109/tits.2015.2395536", "title": "City Vehicle Routing Problem (City VRP): A Review", "year": 2015, "publication_date": "2015-02-24", "type": "article", "language": "en", "authors": [ "Gitae Kim", "Yew-Soon Ong", "Chen Kim Heng", "Puay Siew Tan", "Nengsheng Allan Zhang" ], "first_author": "Gitae Kim", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "Lately, the Vehicle Routing Problem (VRP) in the city, known as City VRP, has gained popularity with its importance in city logistics. Similar to city logistics, City VRP mainly differs from conventional VRP in terms of the stakeholders involved, namely the shipper, carrier, resident, and administrator. Accordingly, this paper surveys the City VRP literature categorized by stakeholders and summarizes the constraints, models, and solution methods for VRP in urban cities. City VRPs are also analyzed based on the problem of interest considered by the stakeholders and the corresponding models that have been proposed in response. Through this review, we identify the state of the art of City VRP, highlight the core challenging issues, and suggest some potential research area in this field that have remained underexplored.", "keywords": [ "Vehicle routing problem", "City logistics", "Popularity", "Transport engineering", "Computer science", "Routing (electronic design automation)", "Operations research", "Engineering", "Political science" ], "cited_by_count": 215, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2015.2395536" }, { "id": "https://openalex.org/W3006014023", "doi": "10.1016/j.cor.2020.104919", "title": "The two-echelon vehicle routing problem with covering options: City logistics with cargo bikes and parcel lockers", "year": 2020, "publication_date": "2020-02-13", "type": "article", "language": "en", "authors": [ "David L.J.U. Enthoven", "Bolor Jargalsaikhan", "Kees Jan Roodbergen", "Michiel A.J. uit het Broek", "Albert H. Schrotenboer" ], "first_author": "David L.J.U. Enthoven", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Benchmark (surveying)", "Truck", "Heuristic", "Computer science", "Routing (electronic design automation)", "City logistics", "Operations research", "Integer programming", "Transport engineering", "Mathematical optimization", "Mathematics" ], "cited_by_count": 197, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0305054820300368" }, { "id": "https://openalex.org/W2742261706", "doi": "10.1016/j.ejor.2017.08.011", "title": "A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution", "year": 2017, "publication_date": "2017-08-12", "type": "article", "language": "en", "authors": [ "Lin Zhou", "Roberto Baldacci", "Daniele Vigo", "Xu Wang" ], "first_author": "Lin Zhou", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Computer science", "Exploit", "Last mile (transportation)", "Mathematical optimization", "Routing (electronic design automation)", "Population", "Heuristic", "Genetic algorithm", "Operations research", "Facility location problem", "Mile" ], "cited_by_count": 308, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/11585/617858" }, { "id": "https://openalex.org/W2081708500", "doi": "10.1016/j.ejor.2013.06.012", "title": "A memetic algorithm for the Multi Trip Vehicle Routing Problem", "year": 2013, "publication_date": "2013-06-20", "type": "article", "language": "en", "authors": [ "Diego Cattaruzza", "Nabil Absi", "Dominique Feillet", "Thibaut Vidal" ], "first_author": "Diego Cattaruzza", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "TRIPS architecture", "Memetic algorithm", "Computer science", "Context (archaeology)", "Set (abstract data type)", "Genetic algorithm", "Routing (electronic design automation)", "Local search (optimization)", "Service (business)", "Mathematical optimization", "Operations research" ], "cited_by_count": 176, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2013.06.012" }, { "id": "https://openalex.org/W2956685526", "doi": "10.1016/j.knosys.2019.06.021", "title": "Time-dependent vehicle routing problem with time windows of city logistics with a congestion avoidance approach", "year": 2019, "publication_date": "2019-07-18", "type": "article", "language": "en", "authors": [ "Liu Changshi", "Gang Kou", "Xiancheng Zhou", "Yi Peng", "Huyi Sheng", "Fawaz E. Alsaadi" ], "first_author": "Liu Changshi", "venue": "Knowledge-Based Systems", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Traffic congestion", "Fuel efficiency", "Travel time", "Computer science", "Vehicle routing problem", "Routing (electronic design automation)", "Transport engineering", "Simulation", "Automotive engineering", "Computer network", "Engineering" ], "cited_by_count": 150, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.knosys.2019.06.021" }, { "id": "https://openalex.org/W2332834184", "doi": "10.1016/j.ejor.2016.03.040", "title": "An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization", "year": 2016, "publication_date": "2016-03-31", "type": "article", "language": "en", "authors": [ "Philippe Grangier", "Michel Gendreau", "Fabien Lehuédé", "Louis-Martin Rousseau" ], "first_author": "Philippe Grangier", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Heuristics", "Computer science", "Synchronization (alternating current)", "Routing (electronic design automation)", "Set (abstract data type)", "Mathematical optimization", "Real-time computing", "Operations research", "Computer network", "Mathematics" ], "cited_by_count": 282, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2016.03.040" }, { "id": "https://openalex.org/W2856829278", "doi": "10.1016/j.ejor.2018.07.002", "title": "The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology", "year": 2018, "publication_date": "2018-07-08", "type": "article", "language": "en", "authors": [ "Wanchen Jie", "Jun Yang", "Min Zhang", "Yongxi Huang" ], "first_author": "Wanchen Jie", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Battery (electricity)", "Vehicle routing problem", "Electric vehicle", "Computer science", "Driving range", "Range (aeronautics)", "Mathematical optimization", "Integer programming", "Routing (electronic design automation)", "Sensitivity (control systems)", "Reduction (mathematics)", "Automotive engineering" ], "cited_by_count": 258, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2018.07.002" }, { "id": "https://openalex.org/W2762626604", "doi": "10.1016/j.trd.2017.09.018", "title": "Matheuristic for a two-echelon capacitated vehicle routing problem with environmental considerations in city logistics service", "year": 2017, "publication_date": "2017-10-12", "type": "article", "language": "en", "authors": [ "Kangzhou Wang", "Yeming Shao", "Weihua Zhou" ], "first_author": "Kangzhou Wang", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Integer programming", "Integer (computer science)", "Mathematics", "Construct (python library)", "Mathematical optimization", "Algorithm", "Routing (electronic design automation)", "Computer science" ], "cited_by_count": 105, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2017.09.018" }, { "id": "https://openalex.org/W2278542412", "doi": "10.1287/trsc.2015.0608", "title": "The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates", "year": 2016, "publication_date": "2016-01-21", "type": "article", "language": "en", "authors": [ "Diego Cattaruzza", "Nabil Absi", "Dominique Feillet" ], "first_author": "Diego Cattaruzza", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "The multi-trip vehicle routing problem with time windows and release dates is a variant of the multi-trip vehicle routing problem where a time window and a release date are associated with each customer. The release date represents the date when the merchandise requested by a customer becomes available at the depot. The interest for this problem comes from the field of city logistics and the study of delivery systems involving City Distribution Centers (CDC). In these systems, goods are first delivered to a CDC before being transferred to eco-friendly vehicles for final delivery. We propose to address the problem through a population-based algorithm, with a giant tour representation for individuals. An efficient labeling procedure allows turning giant tours into solutions. Experiments demonstrate the effectiveness of the method.", "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "City logistics", "Computer science", "Population", "Transport engineering", "Operations research", "Real-time computing", "Engineering", "Computer network" ], "cited_by_count": 144, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.2015.0608" }, { "id": "https://openalex.org/W2990322253", "doi": "10.1016/j.cor.2019.104859", "title": "Solving the vehicle routing problem with multi-compartment vehicles for city logistics", "year": 2019, "publication_date": "2019-11-29", "type": "article", "language": "en", "authors": [ "Reza Eshtehadi", "Emrah Demir", "Yuan Huang" ], "first_author": "Reza Eshtehadi", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "City logistics", "Computer science", "Compartment (ship)", "Routing (electronic design automation)", "Quality (philosophy)", "Operations research", "Transport engineering", "Business", "Computer network", "Mathematics", "Engineering" ], "cited_by_count": 76, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2019.104859" }, { "id": "https://openalex.org/W2972676994", "doi": "10.1016/j.tre.2019.08.015", "title": "The electric vehicle routing problem with time windows, partial recharges and satellite customers", "year": 2019, "publication_date": "2019-09-12", "type": "article", "language": "en", "authors": [ "David L. Cortés-Murcia", "Caroline Prodhon", "Hasan Murat Afsar" ], "first_author": "David L. Cortés-Murcia", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Iterated local search", "Metaheuristic", "Computer science", "Vehicle routing problem", "Context (archaeology)", "Routing (electronic design automation)", "Electric vehicle", "Set (abstract data type)", "Variable (mathematics)", "Mathematical optimization", "Operations research", "Real-time computing" ], "cited_by_count": 140, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/am/pii/S1366554518310597?via%3Dihub" }, { "id": "https://openalex.org/W2603001102", "doi": null, "title": "Models and Methods for the City Logistics: The Two-Echelon Capacitated Vehicle Routing Problem", "year": 2008, "publication_date": "2008-05-12", "type": "dissertation", "language": "en", "authors": [ "Jesús González-Feliu" ], "first_author": "Jesús González-Feliu", "venue": "HAL (Le Centre pour la Communication Scientifique Directe)", "publisher": "Centre National de la Recherche Scientifique", "abstract": "Freight distribution is a field which is constantly in development, and constitutes an important economy factor. However, in cities, it contributes to the main problems of congestion, pollution, noise and other diseases for the inhabitants of the city. To deal with these problems, a new discipline , called \" City Logistics \", has been created in late XXth century, with the aims of reducing the traffic congestion, the air pollution and the noise produced by freight transportation in urban areas. In the last years, several studies and experiences have been developed in Europe, but for the moment, no common policies have been adopted at UE level for urban freight distribution. In Italy, only some small and middle-sized cities have experimented city logistics policies with success, but these experiences are not connected between them. We observe that most of these experiences use Urban Distribution Centers to organize and distribute the different goods, which can be traduced into a multi-echelon transportation system. Several studies in Operations Research have focused on multi-echelon freight distribution system. However, the optimization of the transportation costs is usually calculated without considering the connexion aspects between levels, or by approximating some of them. Another problem derives from the fact that each study uses its own vocabulary and notation, and we observe a lack of unification of terms that increases the difficulty of the bibliographic research. The aims of this research are mainly two: to propose several guidelines for the urban freight distribution planning, unifying some of the terms, and to present a family of vehicle routing problems which consider the transportation costs in multi-echelon distribution systems without separating or approximating each echelon's travel costs. In a first time, we will present the main Italian experiences in urban freight distribution, and the main guidelines to plan an efficient and operative city logistics system, from the conclusions obtained on these experiences. Then, a brief survey in multi-echelon distribution will be presented, unifying the main vocabulary and notation. We will present a new family of transportation cost optimization problems: the multi-echelon vehicle routing problems, focusing on the basic problem, which is the two-echelon case. We propose some mathematical models to solve this problem, a group of benchmarks to test them and the main results of this study, showing the advantages and limits of this modeling approach.", "keywords": [ "Transport engineering", "Distribution (mathematics)", "Traffic management", "Vehicle routing problem", "City logistics", "Traffic congestion", "Business", "Routing (electronic design automation)", "Computer science", "Operations research", "Regional science", "Geography" ], "cited_by_count": 70, "is_retracted": false, "is_paratext": false, "open_access_url": "https://theses.hal.science/tel-00844731" }, { "id": "https://openalex.org/W4212798104", "doi": "10.1109/access.2022.3152062", "title": "A Simulated Annealing Algorithm for the Vehicle Routing Problem With Parcel Lockers", "year": 2022, "publication_date": "2022-01-01", "type": "article", "language": "en", "authors": [ "Vincent F. Yu", "Hadi Susanto", "Panca Jodiawan", "Tsai-Wei Ho", "Shih-Wei Lin", "Yu-Tsung Huang" ], "first_author": "Vincent F. Yu", "venue": "IEEE Access", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "Due to the growth in e-commerce, city logistics needs to cope with the rise of customers’ demand. Consequently, it adds to the complexity of the last-mile delivery process. Moreover, this process often contributes significantly to the distribution cost of companies. An alternative to alleviate the problem is the utilization of parcel lockers. It allows the delivery to be extended not only for home delivery but also for locker delivery, which brings several advantages in terms of cost-saving. However, considering multiple delivery options means adding new complexity to the delivery system. In the previous works, vehicle routing problem with time windows (VRPTW) has been widely dealt by only considering home delivery. This research proposes a new VRPTW variant by adding locker delivery as one of the delivery options. The developed problem is called the vehicle routing problem with parcel lockers (VRPPL). The goal of VRPPL is to minimize the total traveling cost. In this research, we formulate a new mathematical programming model and develop a simulated annealing (SA) algorithm to deal with VRPPL. A newly generated set of instances was developed from the well-known Solomon’s VRPTW instances. The performance of the proposed algorithm is also presented.", "keywords": [ "Simulated annealing", "Computer science", "Vehicle routing problem", "Routing (electronic design automation)", "Algorithm", "Computer network" ], "cited_by_count": 86, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ieeexplore.ieee.org/ielx7/6287639/9668973/09714328.pdf" }, { "id": "https://openalex.org/W2944798258", "doi": "10.1016/j.cie.2019.05.008", "title": "A multi-compartment vehicle routing problem with time windows for urban distribution – A comparison study on particle swarm optimization algorithms", "year": 2019, "publication_date": "2019-05-08", "type": "article", "language": "en", "authors": [ "Jiumei Chen", "Jing Shi" ], "first_author": "Jiumei Chen", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Particle swarm optimization", "Simulated annealing", "Mathematical optimization", "Swarm behaviour", "Computer science", "Algorithm", "Multi-swarm optimization", "Routing (electronic design automation)", "Mathematics" ], "cited_by_count": 95, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2019.05.008" }, { "id": "https://openalex.org/W2964487007", "doi": "10.1016/j.ejor.2019.07.049", "title": "Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and ‘grey zone’ customers arising in urban logistics", "year": 2019, "publication_date": "2019-07-28", "type": "article", "language": "en", "authors": [ "Alexandra Anderluh", "Pamela C. Nolz", "Vera C. Hemmelmayr", "Teodor Gabriel Crainic" ], "first_author": "Alexandra Anderluh", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": "We present a multi-ob’jective two-echelon vehicle routing problem with vehicle synchronization and ‘grey zone’ customers arising in the context of urban freight deliveries. Inner-city center deliveries are performed by small vehicles due to access restrictions, while deliveries outside this area are carried out by conventional vehicles for economic reasons. Goods are transferred from the first to the second echelon by synchronized meetings between vehicles of the respective echelons. We investigate the assignment of customers to vehicles, i.e., to the first or second echelon, within a so-called ‘grey zone’ on the border of the inner city and the area around it. While doing this, the economic objective as well as negative external effects of transport, such as emissions and disturbance (negative impact on citizens due to noise and congestion), are taken into account to include objectives of companies as well as of citizens and municipal authorities. Our metaheuristic – a large neighborhood search embedded in a heuristic rectangle/cuboid splitting – addresses this problem efficiently. We investigate the impact of the free assignment of part of the customers (‘grey zone’) to echelons and of three different city layouts on the solution. Computational results show that the impact of a ‘grey zone’ and thus the assignment of these customers to echelons depend significantly on the layout of a city. Potentially pareto-optimal solutions for two and three objectives are illustrated to efficiently support decision makers in sustainable city logistics planning processes.", "keywords": [ "Vehicle routing problem", "Computer science", "Operations research", "Synchronization (alternating current)", "City logistics", "Routing (electronic design automation)", "Business", "Mathematical optimization", "Transport engineering", "Computer network", "Mathematics", "Engineering" ], "cited_by_count": 157, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0377221719306289/pdf" }, { "id": "https://openalex.org/W3177888742", "doi": "10.1016/j.cor.2021.105491", "title": "Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics", "year": 2021, "publication_date": "2021-07-31", "type": "article", "language": "en", "authors": [ "Christian Friedrich", "Ralf M. Elbert" ], "first_author": "Christian Friedrich", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Transshipment (information security)", "Vehicle routing problem", "Benchmark (surveying)", "Computer science", "Context (archaeology)", "Routing (electronic design automation)", "Operations research", "Local search (optimization)", "Mathematical optimization", "Computer network", "Artificial intelligence", "Engineering" ], "cited_by_count": 62, "is_retracted": false, "is_paratext": false, "open_access_url": "https://arxiv.org/pdf/2107.06086" }, { "id": "https://openalex.org/W2406405144", "doi": "10.1080/23249935.2016.1189723", "title": "Inverse vehicle routing for activity-based urban freight forecast modeling and city logistics", "year": 2016, "publication_date": "2016-05-17", "type": "article", "language": "en", "authors": [ "Soyoung Iris You", "Joseph Y.J. Chow", "Stephen G. Ritchie" ], "first_author": "Soyoung Iris You", "venue": "Transportmetrica A Transport Science", "publisher": "Taylor & Francis", "abstract": "Goods movement is one of the fastest growing transportation sectors, affecting both economic and environmental sustainability, particularly in dense urban areas with traffic congestion and air pollution. To meet this challenge, urban public agencies have paid attention to policies and systems to facilitate efficient and sustainable city logistics. This paper proposes a modeling framework to consider both spatial–temporal constraints and a means to calibrate the model from observable data, based on an adaptation of an activity-based passenger model called the household activity pattern problem. Conceptual comparisons with a state-of-the-art freight forecasting methodology are made using an example. Application of the model is illustrated through formulating and implementing a Sequential Selective Vehicle Routing Problem associated with drayage truck activities at the San Pedro Bay Ports in Southern California.", "keywords": [ "Truck", "Transport engineering", "Traffic congestion", "Sustainability", "Routing (electronic design automation)", "Traffic management", "Vehicle routing problem", "City logistics", "Computer science", "Operations research", "Business", "Engineering" ], "cited_by_count": 57, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/23249935.2016.1189723" }, { "id": "https://openalex.org/W1590882662", "doi": "10.1155/2014/517467", "title": "A Hybrid GRASP+VND Heuristic for the Two‐Echelon Vehicle Routing Problem Arising in City Logistics", "year": 2014, "publication_date": "2014-01-01", "type": "article", "language": "en", "authors": [ "Zheng-yang Zeng", "Weisheng Xu", "Zhiyu Xu", "Weihui Shao" ], "first_author": "Zheng-yang Zeng", "venue": "Mathematical Problems in Engineering", "publisher": "Hindawi Publishing Corporation", "abstract": "The two‐echelon vehicle routing problem (2E‐VRP) is a variant of the classical vehicle routing problem (VRP) arising in two‐level transportation systems such as those encountered in the context of city logistics. In the 2E‐VRP, freight from a depot is compulsorily delivered through intermediate depots, named satellites. The first echelons are routes that distribute freight from depot to satellites, and the second are those from satellites to customers. This problem is solved by a hybrid heuristic which is composed of a greedy randomized adaptive search procedure (GRASP) with a route‐first cluster‐second procedure embedded and a variable neighborhood descent (VND), called GRASP+VND hereafter. Firstly, an extended split algorithm in the GRASP continuously splits randomly generated permutations of all customers and assigns customers to satellites reasonably until a feasible assignment appears, and a complete 2E‐VRP feasible solution is obtained by solving the first echelon problem subsequently and, secondly, a VND phase attempts to improve this solution until no more improvements can be found. The process above is iterated until the maximum number of iterations is reached. Computational tests conducted on three sets of benchmark instances from the literature show that our algorithm is both effective and efficient and outperforms the best existing heuristics for the 2E‐VRP.", "keywords": [ "Vehicle routing problem", "GRASP", "Greedy randomized adaptive search procedure", "Benchmark (surveying)", "Heuristics", "Mathematical optimization", "Heuristic", "Context (archaeology)", "Computer science", "Routing (electronic design automation)", "Iterated local search", "Greedy algorithm" ], "cited_by_count": 53, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/mpe/2014/517467.pdf" }, { "id": "https://openalex.org/W2174802421", "doi": "10.1007/978-0-387-71722-7_8", "title": "Vehicle Routing And Scheduling Models, Simulation And City Logistics", "year": 2008, "publication_date": "2008-06-03", "type": "book-chapter", "language": "en", "authors": [ "Jaime Barceló", "Hanna Grzybowska", "Sara Pardo" ], "first_author": "Jaime Barceló", "venue": null, "publisher": null, "abstract": null, "keywords": [ "Scheduling (production processes)", "Vehicle routing problem", "Computer science", "Transport engineering", "Traffic congestion", "Routing (electronic design automation)", "City logistics", "Operations research", "Engineering", "Computer network", "Operations management" ], "cited_by_count": 83, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-0-387-71722-7_8" }, { "id": "https://openalex.org/W4402999952", "doi": "10.1016/j.tre.2024.103798", "title": "Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows", "year": 2024, "publication_date": "2024-09-30", "type": "article", "language": "en", "authors": [ "Yong Wang", "Zikai Wei", "Siyu Luo", "Jingxin Zhou", "Lu Zhen" ], "first_author": "Yong Wang", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Resource (disambiguation)", "Routing (electronic design automation)", "Computer science", "Shared resource", "Transport engineering", "Operations research", "Engineering", "Computer network" ], "cited_by_count": 87, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2024.103798" }, { "id": "https://openalex.org/W2893882621", "doi": "10.1007/978-3-319-95666-4_7", "title": "Vehicle Routing Problem for Urban Freight Transportation: A Review of the Recent Literature", "year": 2018, "publication_date": "2018-09-27", "type": "book-chapter", "language": "en", "authors": [ "Sotiris P. Gayialis", "Grigorios D. Konstantakopoulos", "Ilías P. Tatsiópoulos" ], "first_author": "Sotiris P. Gayialis", "venue": "Springer proceedings in business and economics", "publisher": "Springer International Publishing", "abstract": null, "keywords": [ "Vehicle routing problem", "City logistics", "Scopus", "Transport engineering", "Categorization", "Computer science", "Operations research", "Schedule", "Traffic management", "Scheduling (production processes)", "Routing (electronic design automation)", "Engineering" ], "cited_by_count": 32, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-95666-4_7" }, { "id": "https://openalex.org/W2901921500", "doi": "10.1016/j.tra.2018.10.033", "title": "A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics", "year": 2018, "publication_date": "2018-11-13", "type": "article", "language": "en", "authors": [ "Nicolás Rincón-García", "Ben J. Waterson", "Tom Cherrett", "Fernando Salazar" ], "first_author": "Nicolás Rincón-García", "venue": "Transportation Research Part A Policy and Practice", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Transport engineering", "City logistics", "Metaheuristic", "Computer science", "Benchmark (surveying)", "Travel time", "Traffic congestion", "Operations research", "Software", "Routing (electronic design automation)", "Business" ], "cited_by_count": 50, "is_retracted": false, "is_paratext": false, "open_access_url": "https://eprints.soton.ac.uk/426352/1/2018_10_A_Vehicle_Routing_TResA_.pdf" }, { "id": "https://openalex.org/W2529339987", "doi": "10.1016/j.trb.2016.09.012", "title": "The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems", "year": 2016, "publication_date": "2016-10-05", "type": "article", "language": "en", "authors": [ "Hongqi Li", "Lu Zhang", "Tan Lv", "Xinyu Chang" ], "first_author": "Hongqi Li", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Mathematical optimization", "Operations research", "Engineering", "Computer network", "Mathematics" ], "cited_by_count": 67, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trb.2016.09.012" }, { "id": "https://openalex.org/W2920639560", "doi": "10.1016/j.cie.2019.03.001", "title": "Application of a variable neighborhood search algorithm to a fleet size and mix vehicle routing problem with electric modular vehicles", "year": 2019, "publication_date": "2019-03-02", "type": "article", "language": "en", "authors": [ "Dhekra Rezgui", "Jouhaina Chaouachi Siala", "Wassila Aggoune‐Mtalaa", "Hend Bouziri" ], "first_author": "Dhekra Rezgui", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Vehicle routing problem", "Benchmark (surveying)", "Modular design", "Routing (electronic design automation)", "Computer science", "Transport engineering", "Last mile (transportation)", "Variable (mathematics)", "Electric vehicle", "Operations research", "Engineering" ], "cited_by_count": 90, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2019.03.001" }, { "id": "https://openalex.org/W2073974278", "doi": "10.1016/j.sbspro.2012.03.135", "title": "Vehicle Routing for Attended Home Delivery in City Logistics", "year": 2012, "publication_date": "2012-01-01", "type": "conference-paper", "language": "en", "authors": [ "Jan Fabian Ehmke", "Dirk Christian Mattfeld" ], "first_author": "Jan Fabian Ehmke", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "Cost-efficient and sustainable delivery of e-commerce products results in enormous challenges for city logistics service providers. We focus on the last mile of delivery in terms of reliable and efficient vehicle routing approaches. In recent years, telematics based traffic data collection has built the ground for time-dependent vehicle routing, which supports the fulfillment of customer promises as well as economic and sustainable delivery concepts. This becomes extremely important in Attended Home Delivery applications, requiring the presence of the customer during delivery. Based on Floating Car Data and Data Mining methods, we provide time-dependent travel time data sets and discuss the integration of time-dependent travel times in time-dependent vehicle routing models. A case study offers insights into effort and benefits of sophisticated travel time collection, data aggregation and time-dependent vehicle routing.", "keywords": [ "Vehicle routing problem", "Telematics", "City logistics", "Data collection", "Routing (electronic design automation)", "Transport engineering", "Computer science", "Last mile (transportation)", "Real-time data", "Computer network", "Telecommunications", "Engineering" ], "cited_by_count": 63, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877042812006027/pdf" }, { "id": "https://openalex.org/W2735382638", "doi": "10.1016/j.cor.2017.06.023", "title": "A Simulation Based Restricted Dynamic Programming approach for the Green Time Dependent Vehicle Routing Problem", "year": 2017, "publication_date": "2017-07-12", "type": "article", "language": "en", "authors": [ "Mehmet Soysal", "Mustafa Çi̇men" ], "first_author": "Mehmet Soysal", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Dynamic programming", "Heuristic", "Computer science", "Mathematical optimization", "Routing (electronic design automation)", "Vehicle routing problem", "Computation", "Set (abstract data type)", "Integer programming", "Algorithm", "Mathematics" ], "cited_by_count": 72, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2017.06.023" }, { "id": "https://openalex.org/W2778912694", "doi": "10.1109/clei.2017.8226454", "title": "A multi-objective two-echelon vehicle routing problem. An urban goods movement approach for smart city logistics", "year": 2017, "publication_date": "2017-09-01", "type": "conference-paper", "language": "en", "authors": [ "Haiko Eitzen", "Fabio López‐Pires", "Benjamı́n Barán", "Fernando Sandoya", "Jorge Luis Chicaiza" ], "first_author": "Haiko Eitzen", "venue": "2017 XLIII Latin American Computer Conference (CLEI)", "publisher": null, "abstract": "Current trends of urbanization and growing economies bring with them rising levels of traffic congestion and city governments must recur to new strategies to deal with such problems. Multi-level distribution is an already-known strategy employed by businesses, and the classic formulation of the Two-Echelon Vehicle Routing Problem (2E-VRP) reflects the perspective of a single provider, without regarding the routing decisions of other parties. The lack of coordination between providers executing their individual schedules and, consequently, the lack of a holistic approach to urban traffic may cause further problems. Additionally, the various stakeholders (government, businesses, residents) may have conflicting objectives. The main contribution of this paper is a first-time multi-objective formulation of the multi-provider (or multi-commodity) heterogeneous vehicle 2E-VRP, from a city government perspective within an Urban Goods Movement context, demonstrating with didactic examples the potential benefit of this approach to all parties involved, simultaneously considering potentially conflicting objectives.", "keywords": [ "Context (archaeology)", "Government (linguistics)", "Vehicle routing problem", "Commodity", "Routing (electronic design automation)", "Urbanization", "Traffic congestion", "Business", "Computer science", "Perspective (graphical)", "Transport engineering", "Operations research" ], "cited_by_count": 42, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/clei.2017.8226454" }, { "id": "https://openalex.org/W2036954693", "doi": "10.1016/j.sbspro.2012.03.101", "title": "Impact of Generalized Travel Costs on Satellite Location in the Two-Echelon Vehicle Routing Problem", "year": 2012, "publication_date": "2012-01-01", "type": "conference-paper", "language": "en", "authors": [ "Teodor Gabriel Crainic", "Simona Mancini", "Guido Perboli", "Roberto Tadei" ], "first_author": "Teodor Gabriel Crainic", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "In this paper we address the Two-Echelon Vehicle Routing Problem (2E-VRP), the variant of VRP where freight is delivered from depots to intermediate satellites, and then it is delivered to customers while minimizing the global routing costs of the overall two-echelon network. The goal of this work is to address more realistic situations in urban freight delivery where the travel costs are not only given by distances, but also by other components, like fixed costs for using the arcs, operational costs, and environmental costs. We introduce a generalized travel cost that may combine different components, e.g., operational, environmental, congestion, etc. We then analyze how the different components of the generalized cost affect the satellite location in the 2E-VRP and whether and under which conditions the Two-Echelon approach dominates the Single-Echelon one.", "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "Operations research", "Computer science", "Fixed cost", "Travel time", "Transport engineering", "Mathematical optimization", "Computer network", "Engineering", "Economics", "Mathematics" ], "cited_by_count": 56, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.sbspro.2012.03.101" }, { "id": "https://openalex.org/W2582325829", "doi": "10.1057/s41274-016-0170-7", "title": "A genetic-algorithm-based approach to the two-echelon capacitated vehicle routing problem with stochastic demands in logistics service", "year": 2017, "publication_date": "2017-01-25", "type": "article", "language": "en", "authors": [ "Kangzhou Wang", "Shulin Lan", "Yingxue Zhao" ], "first_author": "Kangzhou Wang", "venue": "Journal of the Operational Research Society", "publisher": "Palgrave Macmillan", "abstract": "This paper addresses the two-echelon capacitated vehicle routing problem (2E-CVRP) with stochastic demands (2E-CVRPSD) in city logistics. A stochastic program with recourse is used to describe the problem. This program aims to minimize the sum of the travel cost and the expected cost of recourse actions resulting from potential route failures. In a two-echelon distribution system, split deliveries are allowed at the first level but not at the second level, thereby increasing the difficulty of calculating the expected failure cost. Three types of routes with or without split deliveries are identified. Different methods are devised or adapted from the literature to compute the failure cost. A genetic-algorithm-based (GA) approach is proposed to solve the 2E-CVRPSD. A simple encoding and decoding scheme, a modified route copy crossover operator, and a satellite-selection-based mutation operator are devised in this approach. The numerical results show that for all instances, the expected cost of the best 2E-CVRPSD solution found by the proposed approach is not greater than that of the best-known 2E-CVRP solution with an average relative gap of 2.57%. Therefore, the GA-based approach can find high-quality solutions for the 2E-CVRPSD.", "keywords": [ "Vehicle routing problem", "Crossover", "Computer science", "Mathematical optimization", "Genetic algorithm", "Operator (biology)", "Service (business)", "Algorithm", "Routing (electronic design automation)", "Operations research", "Mathematics", "Artificial intelligence" ], "cited_by_count": 69, "is_retracted": false, "is_paratext": false, "open_access_url": "https://figshare.com/articles/journal_contribution/A_genetic-algorithm-based_approach_to_the_two-echelon_capacitated_vehicle_routing_problem_with_stochastic_demands_in_logistics_service/5752887" }, { "id": "https://openalex.org/W2063848026", "doi": "10.1080/014416400295347", "title": "An evaluation methodology for city logistics", "year": 2000, "publication_date": "2000-01-01", "type": "article", "language": "en", "authors": [ "Eiichi Taniguchi", "R.E.C.M. van der Heijden" ], "first_author": "Eiichi Taniguchi", "venue": "Transport Reviews", "publisher": "Taylor & Francis", "abstract": "This paper presents a methodology for evaluating city logistics initiatives using a dynamic traffic simulation with optimal routing and scheduling. This methodology was applied to a test road network. The performance of three city logistics initiatives, advanced routing and scheduling systems, cooperative freight transport systems and load factor controls were assessed in terms of total costs and CO2 emissions by pickup/delivery trucks operations within the network. Results indicated that these initiatives were not only effective for reducing total costs, but also for CO2 emissions. The methodology presented here allows city planners to quantitatively evaluate city logistics initiatives.", "keywords": [ "City logistics", "Truck", "Transport engineering", "Scheduling (production processes)", "Vehicle routing problem", "Traffic management", "Routing (electronic design automation)", "Operations research", "Computer science", "Engineering", "Operations management", "Automotive engineering" ], "cited_by_count": 219, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/014416400295347" }, { "id": "https://openalex.org/W2222036532", "doi": "10.1016/j.trb.2015.12.010", "title": "The impact of depot location, fleet composition and routing on emissions in city logistics", "year": 2016, "publication_date": "2016-01-08", "type": "article", "language": "en", "authors": [ "Çağrı Koç", "Tolga Bektaş", "Ola Jabali", "Gilbert Laporte" ], "first_author": "Çağrı Koç", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Depot", "Benchmark (surveying)", "Vehicle routing problem", "Fuel efficiency", "Routing (electronic design automation)", "Computer science", "Transport engineering", "Operations research", "Consumption (sociology)", "Total cost", "Environmental economics", "Business" ], "cited_by_count": 175, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trb.2015.12.010" }, { "id": "https://openalex.org/W4293199134", "doi": "10.1109/tits.2022.3197424", "title": "Heterogeneous Fleets for Green Vehicle Routing Problem With Traffic Restrictions", "year": 2022, "publication_date": "2022-08-25", "type": "article", "language": "en", "authors": [ "Heng Wang", "Menghan Li", "Zhenyu Wang", "Wei Li", "Tianjiao Hou", "Xianyi Yang", "Zhenzhen Zhao", "Zhenfeng Wang", "Tong He Sun" ], "first_author": "Heng Wang", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "Suffering from environmental distress like carbon emissions, traffic restrictions have been enforced extensively in distribution logistics. Reasonable arrangement of urban freight transportation can effectively improve distribution efficiency, reduce distribution costs, and alleviate the impact of traffic restrictions in distribution logistics. In response to increasingly stringent traffic restrictions, we establish a multi-objective optimization model, including the minimum distributions and the minimum carbon emissions. Given that the limits of battery capacity and cargo capacity, we build a green vehicle routing problem with soft time windows (GVRPTW) model with heterogenous fleets. In this study, three different factors, that is restricted area, travel time of vehicles, and carbon tax prices, are discussed in details. In order to solve the NP-hard model, we propose an improved ant colony optimization algorithm (IACO) by optimizing the state transition probability, and verifies the worth of the algorithm. The experimental results can explore the impacts of traffic restriction policies on the formulation of distribution scheme and offer reference opinions for the government to formulate reasonable restriction policies and better guide logistics enterprises to reduce carbon emissions.", "keywords": [ "Vehicle routing problem", "Carbon tax", "Order (exchange)", "Computer science", "Distribution (mathematics)", "Traffic management", "Transport engineering", "Routing (electronic design automation)", "Ant colony optimization algorithms", "Operations research", "Greenhouse gas", "Environmental economics" ], "cited_by_count": 36, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2022.3197424" }, { "id": "https://openalex.org/W3008192476", "doi": "10.1016/j.tre.2020.101891", "title": "Augmented Lagrangian relaxation approach for logistics vehicle routing problem with mixed backhauls and time windows", "year": 2020, "publication_date": "2020-02-21", "type": "article", "language": "en", "authors": [ "Senyan Yang", "Lianju Ning", "Pan Shang", "Lu Carol Tong" ], "first_author": "Senyan Yang", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Mathematical optimization", "Vehicle routing problem", "Relaxation (psychology)", "Augmented Lagrangian method", "Node (physics)", "Discretization", "Block (permutation group theory)", "Computer science", "Lagrangian relaxation", "Flow network", "Routing (electronic design automation)", "State space" ], "cited_by_count": 51, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2020.101891" }, { "id": "https://openalex.org/W3201180648", "doi": "10.1080/03155986.2021.1973785", "title": "The time-dependent shortest path and vehicle routing problem", "year": 2021, "publication_date": "2021-09-11", "type": "article", "language": "en", "authors": [ "Rabie Jaballah", "Marjolein Veenstra", "Leandro Callegari Coelho", "Jacques Renaud" ], "first_author": "Rabie Jaballah", "venue": "INFOR Information Systems and Operational Research", "publisher": "Taylor & Francis", "abstract": "We introduce the time-dependent shortest path and vehicle routing problem. In this problem, a set of homogeneous vehicles is used to visit a set of customer locations dispersed over a very large network where the travel times are time-dependent and therefore the shortest path between two locations may change over time. The aim of the problem is to simultaneously determine the sequence in which the customer locations are visited and the arcs traveled on the paths between each pair of consecutively visited customers, such that the total travel time is minimized. We are the first to formally define and solve this fully integrated problem, providing tight bounds to it. We then propose a dynamic time-dependent shortest path algorithm embedded within a simulated annealing metaheuristic to efficiently solve the problem. We also propose a variant of the algorithm where some time-dependent shortest paths are precomputed. We test our formulations and algorithms on a set of real-life instances generated from a dataset of the road network in Québec City, Canada. Our results indicate that the resulting models are too large to be solved even for small instances. However, the obtained bounds show that the developed simulated annealing heuristic performs very well. We also demonstrate that neglecting time-dependent information on traffic leads to imprecise estimation of the traveling time. Moreover, the results show the importance of solving the shortest paths and routing problems simultaneously, as using a set of precomputed shortest paths leads to slightly worse solutions. This work adds new research avenues to city logistics and congestion studies.", "keywords": [ "Shortest path problem", "K shortest path routing", "Constrained Shortest Path First", "Computer science", "Simulated annealing", "Mathematical optimization", "Private Network-to-Network Interface", "Heuristic", "Routing (electronic design automation)", "Vehicle routing problem", "Shortest Path Faster Algorithm", "Path (computing)" ], "cited_by_count": 31, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/03155986.2021.1973785" }, { "id": "https://openalex.org/W4385652200", "doi": "10.1016/j.scs.2023.104857", "title": "A simultaneous facility location and vehicle routing problem with recyclable express packaging consideration for sustainable city logistics", "year": 2023, "publication_date": "2023-08-08", "type": "article", "language": "en", "authors": [ "Yuhe Shi", "Yun Jung Lin", "Songyi Wang", "Haolin Wen", "Ming Kim Lim", "Yan Li" ], "first_author": "Yuhe Shi", "venue": "Sustainable Cities and Society", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Supply chain", "Routing (electronic design automation)", "Exploit", "Integer programming", "Reverse logistics", "Transport engineering", "Sustainable development", "Linear programming", "Resource (disambiguation)", "Computer science", "Environmental economics" ], "cited_by_count": 28, "is_retracted": false, "is_paratext": false, "open_access_url": "https://eprints.gla.ac.uk/304354/2/304354.pdf" }, { "id": "https://openalex.org/W2112039414", "doi": "10.1016/j.jtrangeo.2012.05.008", "title": "Understanding urban freight activity – key issues for freight planning", "year": 2012, "publication_date": "2012-07-05", "type": "article", "language": "en", "authors": [ "Tom Cherrett", "Julian Allen", "Fraser N. McLeod", "Sarah Maynard", "Adrian J. Hickford", "Mike Browne" ], "first_author": "Tom Cherrett", "venue": "Journal of Transport Geography", "publisher": "Elsevier BV", "abstract": "Using information gathered from some 30 UK surveys undertaken over the last decade, this paper provides planners with an understanding of road-based urban retail freight transport activity. The findings suggest that the average High Street business could expect up to 10 core goods and 7.6 service visits per week, in non-peak trading periods.with 25% additional activity during the build up to Christmas. Vans (‘light goods vehicles’) were the dominant mode, responsible for 42% of delivery activity with a mean dwell time of 10 minutes. Where possible, load consolidation should be encouraged by methods such as Delivery and Servicing Plans and using out-of-town freight consolidation centres to bring in goods over the last mile in shared vehicles. Where this is not possible, loading bay monitoring and control, and preferred lorry routes can help manage the movement of vehicles in and out of dense urban areas. Service vehicle activity is a significant contributor to urban freight movements and often requires vehicles to be parked close to the premises being served. Centrally coordinating elements of service provision (e.g. for cleaning, equipment maintenance, recyclate collection), or providing improved, more flexible parking provision for service vehicles could be as or more beneficial in reducing overall freight impacts than focusing on core goods deliveries. In the case of the latter, ‘pay-as-you-leave’ car park charging systems could encourage short-stay service vehicles to park off-street.", "keywords": [ "Transport engineering", "Truck", "Consolidation (business)", "Business", "Service (business)", "Traffic management", "Last mile (transportation)", "Mile", "Marketing", "Engineering", "Finance", "Geography" ], "cited_by_count": 252, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.jtrangeo.2012.05.008" }, { "id": "https://openalex.org/W3044549082", "doi": "10.1016/j.ejor.2020.07.034", "title": "A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles", "year": 2020, "publication_date": "2020-07-23", "type": "article", "language": "en", "authors": [ "Ferdinand Mühlbauer", "Pirmin Fontaine" ], "first_author": "Ferdinand Mühlbauer", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Swap (finance)", "Heuristics", "Vehicle routing problem", "Computer science", "City logistics", "Benchmark (surveying)", "Heuristic", "Neighbourhood (mathematics)", "Mathematical optimization", "Routing (electronic design automation)", "Mathematics", "Transport engineering" ], "cited_by_count": 61, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2020.07.034" }, { "id": "https://openalex.org/W1978172395", "doi": "10.3141/1790-06", "title": "Modeling City Logistics", "year": 2002, "publication_date": "2002-01-01", "type": "article", "language": "en", "authors": [ "Eiichi Taniguchi", "Russell George Thompson" ], "first_author": "Eiichi Taniguchi", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "Urban freight systems are experiencing many problems due to higher levels of service and lower costs being demanded by shippers, with carriers having to operate in increasingly congested road conditions. Trucks operating in urban areas produce many negative impacts for society in terms of emissions, crashes, noise, and vibration. City logistics aims to globally optimize urban freight systems by considering the costs and benefits of schemes to the public as well as the private sector. The concepts of city logistics are introduced, and an outline is presented of some models that have recently been developed to predict the consequences of intelligent transportation systems. In particular, a stochastic vehicle routing and scheduling procedure that incorporates the variation of travel times is described. Results indicate that this approach can lead to significant reduction in operating costs by carriers as well as shorter routes with fewer trucks and increased reliability for customers. This procedure also reduces emissions and fuel consumption.", "keywords": [ "Truck", "City logistics", "Fuel efficiency", "Transport engineering", "Traffic management", "Scheduling (production processes)", "Reliability (semiconductor)", "Public transport", "Business", "Environmental economics", "Computer science", "Operations research" ], "cited_by_count": 127, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/1790-06" }, { "id": "https://openalex.org/W1591462369", "doi": "10.1108/09600030410567504", "title": "Minimizing logistics risk through real‐time vehicle routing and mobile technologies", "year": 2004, "publication_date": "2004-10-01", "type": "article", "language": "en", "authors": [ "George M. Giaglis", "Ioannis E. Minis", "A. Tatarakis", "Vasileios Zeimpekis" ], "first_author": "George M. Giaglis", "venue": "International Journal of Physical Distribution & Logistics Management", "publisher": "Emerald Publishing Limited", "abstract": "Vehicle routing (VR) is critical in successful logistics execution. The emergence of technologies and information systems allowing for seamless mobile and wireless connectivity between delivery vehicles and distribution facilities is paving the way for innovative approaches to real‐time VR and distribution management. This paper investigates avenues for building upon recent trends in VR‐related research towards an integrated approach to real‐time distribution management. A review of the advances to‐date in both fields, i.e. the relevant research in the VR problem and the advances in mobile technologies, forms the basis of this investigation. Further to setting requirements, we propose a system architecture for urban distribution and real‐time event‐driven vehicle management.", "keywords": [ "Vehicle routing problem", "Computer science", "Distribution management system", "Event (particle physics)", "Routing (electronic design automation)", "Distribution (mathematics)", "Architecture", "Wireless", "Systems engineering", "Embedded system", "Telecommunications", "Engineering" ], "cited_by_count": 160, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/09600030410567504" }, { "id": "https://openalex.org/W4292289277", "doi": "10.1287/trsc.2022.1162", "title": "A Chance-Constrained Two-Echelon Vehicle Routing Problem with Stochastic Demands", "year": 2022, "publication_date": "2022-08-17", "type": "article", "language": "en", "authors": [ "Natasja Sluijk", "Alexandre M. Florio", "Joris Kinable", "Nico Dellaert", "Tom Van Woensel" ], "first_author": "Natasja Sluijk", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "Two-echelon distribution systems are often considered in city logistics to maintain economies of scale and satisfy the emission zone requirements in the cities. In this work, we formulate the two-echelon vehicle routing problem with stochastic demands as a chance-constrained stochastic optimization problem, where the total demand of the customers in each second-echelon route should fit within the second-echelon vehicle capacity with a high probability. We propose two efficient solution procedures based on column generation. Key to the efficiency of these procedures is the underlying labeling algorithm to generate new columns. We propose a novel labeling algorithm based on simultaneous construction of second-echelon routes and a labeling algorithm that builds second-echelon routes sequentially. To further enhance the performance of the solution procedure, we use statistical inference tests to ensure that the chance constraints are met. We reduce the number of customer combinations for which the chance constraint needs to be verified by imposing feasibility bounds on the stochastic customer demands. With these bounds, the runtimes of the labeling algorithms are reduced significantly. The novel labeling algorithm, statistical inference, and feasibility bounds can also be applied to dependent, correlated, and data-driven (scenario-based) demand distributions. Finally, we show the value of the stochastic formulation in terms of improved solution cost and guaranteed feasibility of second-echelon routes. Funding: This work was funded by the Dutch Research Council (NWO) DAREFUL project [Grant 629.002.211] and was carried out on the Dutch national e-infrastructure with the support of SURF Cooperative. Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2022.1162 .", "keywords": [ "Vehicle routing problem", "Column generation", "Computer science", "Mathematical optimization", "Inference", "Constraint (computer-aided design)", "Routing (electronic design automation)", "Stochastic optimization", "Key (lock)", "Statistical inference", "Operations research", "Mathematics" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://research.tue.nl/en/publications/260c23a9-f384-45fd-898a-25a4be5f4e34" }, { "id": "https://openalex.org/W4396609578", "doi": "10.1016/j.eswa.2024.124141", "title": "Two-echelon multi-commodity multimodal vehicle routing problem considering user heterogeneity in city logistics", "year": 2024, "publication_date": "2024-05-03", "type": "article", "language": "en", "authors": [ "Shuai Wang", "Xiaoning Zhu", "Pan Shang", "Lin Wei Xiao", "Liya Yang", "Lóránt Antal Tavasszy" ], "first_author": "Shuai Wang", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Commodity", "Computer science", "Routing (electronic design automation)", "Operations research", "Artificial intelligence", "Business", "Computer network", "Mathematics" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2024.124141" }, { "id": "https://openalex.org/W179875921", "doi": null, "title": "AN INTELLIGENT SOLUTION SYSTEM FOR A VEHICLE ROUTING PROBLEM IN URBAN DISTRIBUTION", "year": 2007, "publication_date": "2007-01-01", "type": "article", "language": "en", "authors": [ "Xiangpei Hu", "Minfang Huang", "Amy Zhaohui Zeng" ], "first_author": "Xiangpei Hu", "venue": null, "publisher": null, "abstract": "Abstract. In this paper, we present an intelligent solution system for a vehicle routing problem (VRP) with rigid time window in urban distribution. The solution has three stages. The first stage uses Clustering Analysis in Data Mining to classify all customers by a number of attributes, such as distance, demand level, the density of customer, and city layout. The second stage introduces how to generate feasible routing schemes for each vehicle type. Specifically, a depth-first search algorithm with control rules is presented to generate feasible routing schemes. In the last stage, an integer programming model is constructed to identify the optimal routing schemes. Finally, we present a real VRP case to show that the approach and the system are efficient and provide a new way to solve the VRP problems with time-windows.", "keywords": [ "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Destination-Sequenced Distance Vector routing", "Cluster analysis", "Static routing", "Mathematical optimization", "Integer programming", "Link-state routing protocol", "Artificial intelligence", "Computer network", "Algorithm" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.7229" }, { "id": "https://openalex.org/W2064756728", "doi": "10.1016/j.sbspro.2010.04.008", "title": "Exact solution for the vehicle routing problem with semi soft time windows and its application", "year": 2010, "publication_date": "2010-01-01", "type": "conference-paper", "language": "en", "authors": [ "Ali Gul Qureshi", "Eiichi Taniguchi", "Tadashi Yamada" ], "first_author": "Ali Gul Qureshi", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "This paper reflects on a soft time windows variant of the Vehicle Routing Problem (VRP) that only considers penalties on late arrival while waiting on early arrival is allowed without cost, namely the Vehicle Routing and scheduling Problem with Semi Soft Time Windows (VRPSSTW). A column generation (Dantzig-Wolfe decomposition) based exact optimisation approach is presented to obtain exact solutions for the VRPSSTW. While the computation time for the exact approach is adequate for smaller instances, the computation time for large-sized problems is very large for the exact solution technique, which favours the use of heuristics for the soft time windows variants of the VRP, in city logistics-related research. Therefore, as an application, this paper shows that how these exact solutions can be used as benchmark solutions to evaluate the performance of heuristics on smaller instances before applying these heuristics to large VRPSSTW instances. Errors between the optimal solutions and approximate solutions were used to calibrate a genetic algorithm heuristic for the VRPSSTW. Large errors instigated a change in the initialization procedure in the genetic algorithm heuristic, which resulted in the improved performance in terms of cost and computation time.", "keywords": [ "Vehicle routing problem", "Heuristics", "Benchmark (surveying)", "Computation", "Mathematical optimization", "Computer science", "Initialization", "Heuristic", "Scheduling (production processes)", "Column generation", "Genetic algorithm", "Routing (electronic design automation)" ], "cited_by_count": 38, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S187704281001061X/pdf" }, { "id": "https://openalex.org/W2891179660", "doi": "10.1016/j.trpro.2018.09.017", "title": "A novel Dynamic programming approach for Two-Echelon Capacitated Vehicle Routing Problem in City Logistics with Environmental considerations", "year": 2018, "publication_date": "2018-01-01", "type": "article", "language": "en", "authors": [ "Mario Marinelli", "Aleksandra Colovic", "Mauro Dell’Orco" ], "first_author": "Mario Marinelli", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The paper proposes a Two-Echelon Capacitated Vehicle Routing Problem with Environmental consideration, intended for managing urban freight distribution in City Logistics. It presents a novel Dynamic programming approach that divides the main problem into several ones and uses an exact algorithm to obtain optimal route paths. The approach applies Fuzzy C-Means Clustering for assigning a group of customers to a satellite. The initial solution is improved with roulette selection, 2-opt, and Or-opt exchange heuristics. The approach was tested on benchmark instances, and obtained results are satisfactory. Moreover, the proposed method highlights the environmental improvement we can obtain in managing urban freight transportation.", "keywords": [ "Vehicle routing problem", "Heuristics", "Benchmark (surveying)", "Operations research", "Computer science", "Mathematical optimization", "Routing (electronic design automation)", "Cluster analysis", "Fitness proportionate selection", "Selection (genetic algorithm)", "Fuzzy logic", "Transport engineering" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146518300899/pdf" }, { "id": "https://openalex.org/W4387159219", "doi": "10.1016/j.xinn.2023.100520", "title": "Can language models be used for real-world urban-delivery route optimization?", "year": 2023, "publication_date": "2023-09-29", "type": "article", "language": "en", "authors": [ "Yang Liu", "Fanyou Wu", "Zhiyuan Liu", "Kai Wang", "Feiyue Wang", "Xiaobo Qu" ], "first_author": "Yang Liu", "venue": "The Innovation", "publisher": "Elsevier BV", "abstract": "Language models have contributed to breakthroughs in interdisciplinary research, such as protein design and molecular dynamics understanding. In this study, we reveal that beyond language, representations of other entities, such as human behaviors, that are mappable to learnable sequences can be learned by language models. One compelling example is the real-world delivery route optimization problem. We here propose a novel approach based on the language model to optimize delivery routes on the basis of drivers' historical experiences. Although a broad range of optimization-based approaches have been designed to optimize delivery routes, they do not capture the implicit knowledge of complex delivery operating environments. The model we propose integrates this knowledge in the route optimization process by learning from driving behaviors in experienced drivers. A real-world delivery route that preserves drivers' implicit behavioral patterns is first analogized to a sentence in natural language. Through unsupervised learning, we then learn the vector representations of words and infer the drivers' delivery chains on the basis of the tailored chain-reaction-based algorithm. We also provide insights into the fusion of language models and operations research methods. In our approach, language models are applied to learn drivers' delivery behaviors and infer new deliveries at the delivery zone level, while the classic traveling salesman problem (TSP) model is embedded into the hybrid framework for intra-zone optimization. Numerical experiments performed on real-world data from Amazon's delivery service demonstrate that the proposed approach outperforms pure optimization, supporting the effectiveness, efficiency, and extensibility of our model. As a versatile approach, the proposed framework can easily be extended to various disciplines in which the data follow certain grammar rules. We anticipate that our work will serve as a stepping stone toward the understanding and application of language models in tackling interdisciplinary research problems.", "keywords": [ "Computer science", "Artificial intelligence", "Process (computing)", "Machine learning", "Extensibility", "Sentence", "Language model", "Optimization problem", "Travelling salesman problem", "Human–computer interaction", "Data science", "Programming language" ], "cited_by_count": 160, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.xinn.2023.100520" }, { "id": "https://openalex.org/W1977462895", "doi": "10.1016/j.dss.2012.12.014", "title": "A PAM approach to handling disruptions in real-time vehicle routing problems", "year": 2012, "publication_date": "2012-12-22", "type": "article", "language": "en", "authors": [ "Xiangpei Hu", "Lijun Sun", "Linlin Liu" ], "first_author": "Xiangpei Hu", "venue": "Decision Support Systems", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Scheduling (production processes)", "Heuristic", "Vehicle routing problem", "Process (computing)", "Scale (ratio)", "Distributed computing", "Routing (electronic design automation)", "Mathematical optimization", "Artificial intelligence", "Embedded system", "Mathematics" ], "cited_by_count": 29, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.dss.2012.12.014" }, { "id": "https://openalex.org/W1997054010", "doi": "10.1016/j.jocs.2012.01.006", "title": "Advanced routing for city logistics service providers based on time-dependent travel times", "year": 2012, "publication_date": "2012-02-16", "type": "article", "language": "en", "authors": [ "Jan Fabian Ehmke", "Andre Friedrich Steinert", "Dirk Christian Mattfeld" ], "first_author": "Jan Fabian Ehmke", "venue": "Journal of Computational Science", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Heuristics", "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Route planning", "Adaptability", "Traffic congestion", "Service provider", "Operations research", "Service (business)", "Telematics", "Transport engineering" ], "cited_by_count": 106, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.jocs.2012.01.006" }, { "id": "https://openalex.org/W3211898816", "doi": "10.1109/tcyb.2021.3108597", "title": "An Embedded Hamiltonian Graph-Guided Heuristic Algorithm for Two-Echelon Vehicle Routing Problem", "year": 2021, "publication_date": "2021-11-16", "type": "article", "language": "en", "authors": [ "Han Huang", "Shuling Yang", "Xueqiang Li", "Zhifeng Hao" ], "first_author": "Han Huang", "venue": "IEEE Transactions on Cybernetics", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "Two-echelon vehicle routing problem (2E-VRP) is an NP-hard combinatorial optimization problem and a basic mathematical model of modern city logistics. While it is difficult to obtain the optimal solution of 2E-VRP, this study finds a breakthrough that the structure of the optimal route planning for 2E-VRP is usually an embedded Hamiltonian graph. In the graph, routes can be drawn in a planar graph as Hamiltonian circuits without intersections. Based on this finding, an embedded Hamiltonian graph-guided heuristic algorithm is proposed to solve 2E-VRP. As a crucial part of the algorithm, an initialization scheme is designed to search for the farthest vertices from each route and insert the rest of the vertices. In the satellite-adjustment process, a dynamic adjustment for satellites scheme is proposed to adjust the state of satellites. The two schemes aim to construct Hamiltonian circuits with few intersections. Experiments have been conducted on 207 instances to demonstrate the effect of the proposed algorithm on solving 2E-VRP. Experimental results show that the proposed algorithm can obtain more solutions of 2E-VRP with significantly smaller objective-function values. Furthermore, the number of intersections in routes generated by the proposed algorithm is much less than those obtained by the compared algorithms. With the use of the two schemes, the embedded Hamiltonian graph-guided heuristic algorithm significantly outperforms the compared algorithms for 2E-VRP.", "keywords": [ "Hamiltonian path problem", "Initialization", "Heuristic", "Hamiltonian (control theory)", "Graph", "Hamiltonian path", "Electronic circuit" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tcyb.2021.3108597" }, { "id": "https://openalex.org/W2791374511", "doi": "10.1007/s10732-018-9366-0", "title": "A biased-randomized variable neighborhood search for sustainable multi-depot vehicle routing problems", "year": 2018, "publication_date": "2018-02-27", "type": "article", "language": "en", "authors": [ "Lorena Silvana Reyes-Rubiano", "Laura Calvet", "Angel Alejandro Juan", "Javier Faulín", "Lluc Bové" ], "first_author": "Lorena Silvana Reyes-Rubiano", "venue": "Journal of Heuristics", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Vehicle routing problem", "Variable neighborhood search", "Computer science", "Variable (mathematics)", "Process (computing)", "Routing (electronic design automation)", "Work (physics)", "Operations research", "Sustainable transport", "Metaheuristic", "City logistics", "Transport engineering" ], "cited_by_count": 30, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10732-018-9366-0" }, { "id": "https://openalex.org/W4224210037", "doi": "10.1287/trsc.2022.1146", "title": "A Branch and Price Algorithm for the Heterogeneous Fleet Multi-Depot Multi-Trip Vehicle Routing Problem with Time Windows", "year": 2022, "publication_date": "2022-04-19", "type": "article", "language": "en", "authors": [ "Munise Kübra Şahin", "Hande Yaman" ], "first_author": "Munise Kübra Şahin", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "The multi-trip vehicle routing problem (MTVRP) extends the well-known VRP by allowing vehicles to perform several trips in a workday. The motivation arises from the new challenges in city logistics that push companies to use smaller and cleaner vehicles such as cargo bikes. With the integration of small vehicles into the fleet, many companies start to operate with a heterogeneous fleet and use multiple depots located in the city centers to reload the small vehicles. Inspired by these new challenges the companies face, we study the heterogeneous fleet multi-depot MTVRP with time windows under shared depot resources where small and large vehicles have different travel times in certain areas. We formulate this problem using workday variables and propose a branch and price algorithm that exhibits an enhanced performance by a new heuristic algorithm based on the reduction in the graph size. The proposed algorithm introduces a new way to compute the completion bounds using the iterative structure of the state-space augmenting algorithm and eliminates the need for solving a separate relaxation. We conduct experiments on modified small- and medium-size instances from Solomon’s benchmark set. The results of our computational experiments show that the proposed algorithm is very effective and can solve instances with up to 40 customers, three depots, and two types of vehicles.", "keywords": [ "Vehicle routing problem", "Computer science", "Benchmark (surveying)", "Heuristic", "Mathematical optimization", "TRIPS architecture", "Fleet management", "Set (abstract data type)", "Routing (electronic design automation)", "Operations research", "Algorithm", "Engineering" ], "cited_by_count": 41, "is_retracted": false, "is_paratext": false, "open_access_url": "https://lirias.kuleuven.be/retrieve/3b319603-efc7-44cf-b363-876b901cdef6" }, { "id": "https://openalex.org/W4383893672", "doi": "10.1016/j.eswa.2023.120945", "title": "The two-echelon vehicle routing problem with time windows, intermediate facilities, and occasional drivers", "year": 2023, "publication_date": "2023-07-11", "type": "article", "language": "en", "authors": [ "Vincent F. Yu", "Panca Jodiawan", "Albert H. Schrotenboer", "Ming-Lu Hou" ], "first_author": "Vincent F. Yu", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Transshipment (information security)", "Computer science", "Routing (electronic design automation)", "Operations research", "Quality (philosophy)", "Set (abstract data type)", "Integer programming", "Linear programming", "Mathematical optimization", "Mathematics", "Algorithm" ], "cited_by_count": 31, "is_retracted": false, "is_paratext": false, "open_access_url": "https://research.tue.nl/files/305963747/1-s2.0-S0957417423014471-main.pdf" }, { "id": "https://openalex.org/W650902666", "doi": "10.1007/978-1-4614-3628-7", "title": "Integration of Information and Optimization Models for Routing in City Logistics", "year": 2012, "publication_date": "2012-01-01", "type": "book", "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)", "Enhanced Data Rates for GSM Evolution", "Vehicle routing problem", "City logistics", "Computer science", "Operations research", "Business", "Transport engineering", "Engineering", "Computer network", "Telecommunications" ], "cited_by_count": 89, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-1-4614-3628-7" }, { "id": "https://openalex.org/W3107189808", "doi": "10.1287/trsc.2021.1092", "title": "A Branch-Price-and-Cut Algorithm for the Two-Echelon Vehicle Routing Problem with Time Windows", "year": 2021, "publication_date": "2021-12-06", "type": "article", "language": "en", "authors": [ "Tayeb Mhamedi", "Henrik Andersson", "Marilène Cherkesly", "Guy Desaulniers" ], "first_author": "Tayeb Mhamedi", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "In this paper, we propose an exact branch-price-and-cut (BPC) algorithm for the two-echelon vehicle routing problem with time windows. This problem arises in city logistics when high-capacity and low-capacity vehicles are used to transport items from depots to satellites (first echelon) and from satellites to customers (second echelon), respectively. The aim is to determine a set of least-cost first- and second-echelon routes such that the load on the routes respect the capacity of the vehicles, each second-echelon route is supplied by exactly one first-echelon route, and each customer is visited by exactly one second-echelon route within its time window. We model the problem with a route-based formulation where first-echelon routes are enumerated a priori, and second-echelon routes are generated using column generation. The problem is solved using BPC. To generate second-echelon routes, one pricing problem per satellite is solved using a labeling algorithm which keeps track of the first-echelon route associated with each (partial) second-echelon route considered. Furthermore, to speed up the solution process, we introduce effective deep dual-optimal inequalities and apply known valid inequalities. We perform extensive computational experiments on benchmark instances and show that our method outperforms a state-of-the-art algorithm. We also conduct sensitivity analyses on the different components of our algorithm and derive managerial insights related to the structure of the first-echelon routes.", "keywords": [ "Column generation", "Vehicle routing problem", "Benchmark (surveying)", "Echelon formation", "Computer science", "Mathematical optimization", "Routing (electronic design automation)", "Branch and cut", "Algorithm", "Process (computing)", "Integer programming", "Mathematics" ], "cited_by_count": 31, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.2021.1092" }, { "id": "https://openalex.org/W2056295481", "doi": "10.1016/j.cor.2014.06.008", "title": "A survey on two-echelon routing problems", "year": 2014, "publication_date": "2014-06-17", "type": "article", "language": "en", "authors": [ "Rosario Cuda", "Gianfranco Guastaroba", "Maria Grazia Speranza" ], "first_author": "Rosario Cuda", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Computer science", "Routing (electronic design automation)", "Vehicle routing problem", "Operations research", "Distribution (mathematics)", "Consolidation (business)", "Class (philosophy)", "Business", "Engineering", "Mathematics", "Computer network" ], "cited_by_count": 385, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2014.06.008" }, { "id": "https://openalex.org/W2981408797", "doi": "10.2514/1.c035473", "title": "A Multi-Trip Vehicle Routing Problem for Small Unmanned Aircraft Systems-Based Urban Delivery", "year": 2019, "publication_date": "2019-10-21", "type": "article", "language": "en", "authors": [ "Younghoon Choi", "Bradford E. Robertson", "Youngjun Choi", "Dimitri N. Mavris" ], "first_author": "Younghoon Choi", "venue": "Journal of Aircraft", "publisher": "American Institute of Aeronautics and Astronautics", "abstract": "With the emergence of new technologies for small unmanned aircraft systems (sUAS), such as lightweight sensors and high-efficiency batteries, the operation of small unmanned aerial vehicles (sUAVs) will expand from military use to commercial use. A promising commercial application of sUAS is package delivery because of its potential to reduce acquisition and operating costs of the last-mile delivery system, while enabling new services such as same-day delivery. Moreover, in urban areas, sUAVs can deliver packages to customers without negatively affecting street traffic. To conduct urban operations, sUAS-based delivery systems must obey regulations for sUAS operations and avoid urban obstacles. In this paper, a maximum-flight-time-constrained multitrip vehicle routing problem with time windows optimization model is used to create routes for sUAS-based delivery missions. To address the actual urban environment with the optimization model, a two-layered urban flight network is built by feeding an airborne light detection and ranging sensor data into an algorithm that uses a Voronoi diagram to create collision-free paths. This paper uses this approach to study a possible package delivery using sUAS in San Diego, CA.", "keywords": [ "Routing (electronic design automation)", "Computer science", "Vehicle routing problem", "Transport engineering", "Real-time computing", "Engineering", "Computer network" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.2514/1.c035473" }, { "id": "https://openalex.org/W3127583541", "doi": "10.1016/j.trpro.2021.01.061", "title": "Using a Route-based and Vehicle Type specific Range Constraint for Improving Vehicle Routing Problems with Electric Vehicles", "year": 2021, "publication_date": "2021-01-01", "type": "article", "language": "en", "authors": [ "Ricardo Ewert", "Kai Martins-Turner", "Carina Thaller", "Kai Nagel" ], "first_author": "Ricardo Ewert", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "In this research project, we implement a vehicle type dependent range constraint into a Vehicle Routing Problem (VRP) to consider the limited range of electric vehicles in urban freight transport planning due to the its restricted battery capacity and energy consumption. We apply this VRP in the route optimization jsprit which is linked to the microscopic agent-based simulation MATSim. In the framework of a case study focusing on food retail distribution in Berlin, Germany, we operationalize the range constraint and demonstrate the functionality and the effectiveness of this constraint using the distance from routing in a transport simulation network. Based on the simulation results, we analyze and discuss the impacts of the limitations of Battery Electric Vehicles (BEVs) on freight transport demand, road mileage performed and the resulting transport costs and greenhouse gas (GHG) emissions.", "keywords": [ "Vehicle routing problem", "Constraint (computer-aided design)", "Range (aeronautics)", "Electric vehicle", "Driving range", "Greenhouse gas", "Transport engineering", "Automotive engineering", "Computer science", "Routing (electronic design automation)", "Battery (electricity)", "Operationalization" ], "cited_by_count": 31, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146521001022/pdf" }, { "id": "https://openalex.org/W1998752744", "doi": "10.3141/2411-05", "title": "Urban Freight Consolidation Centers", "year": 2014, "publication_date": "2014-01-01", "type": "article", "language": "en", "authors": [ "Maria K. Triantafyllou", "Tom Cherrett", "Michael J. Browne" ], "first_author": "Maria K. Triantafyllou", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "In recent years, traditional urban distribution systems have undergone major structural changes as a result of the increasing power of customers demanding greater variety of quality products at low cost. These customer demands have increased the competition between businesses, and at the same time more complicated and longer supply chains have emerged as a result of the globalization of many businesses in their search for low-cost production locations and access to new skills. In response, hub-and-spoke systems are increasingly used to deal with product flows from many origins and to many destinations. As a result, a growing number of studies have examined the establishment of various forms of intermodal transshipment centers to minimize the use of roads in city centers and support the frequent and rapid replenishment of goods at retail and catering outlets. This study examined the establishment of a consolidation center servicing nearly 100 businesses that operated in an urban shopping mall in Southampton, United Kingdom. Through the review of numerous existing UK and international consolidation schemes and the examination of their operational characteristics, the study aimed to identify potential strengths, weaknesses, and risks that would impact the operation of the consolidation center. Various operational scenarios considering business take-up combinations, vehicle delivery mixes, fill rates, and back-load practices were examined to elucidate the potential transport and environmental effects of the consolidation scheme. To quantify and to verify these effects accurately, a multistage analysis framework, including data collection, map routing, emissions assessment, and scenario-building activities, was developed.", "keywords": [ "Consolidation (business)", "Business", "Transshipment (information security)", "Destinations", "City logistics", "Supply chain", "Transport engineering", "Environmental economics", "Marketing", "Operations research", "Tourism", "Engineering" ], "cited_by_count": 102, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/2411-05" }, { "id": "https://openalex.org/W582118599", "doi": null, "title": "Innovations in City Logistics", "year": 2008, "publication_date": "2008-12-30", "type": "article", "language": "en", "authors": [ "E Taniguchi", "Russell George Thompson" ], "first_author": "E Taniguchi", "venue": null, "publisher": null, "abstract": "Preface Modelling the behavior of stakeholders in city logistics City access restrictions and the implications for goods deliveries City logistics over the years -- Lessons learned, research directions and interests An investigation into the attitudinal factors determining participation in cooperative multi-carrier delivery initiatives Economy of scale and the role of publicly available congestion information for the local delivery industry: an agent-based simulation approach The potential use of urban consolidation centres in the hotel industry in London Revival of cost benefit analysis for evaluating the city distribution center concept? 8 Sustainable goods supply and transport in conurbations: Freight patterns and developments in Switzerland Challenging the traditional scope of solving vehicle routing and scheduling A hybrid genetic algorithm for VRPSTW using column generation Provision of real-time traffic information for VRPTW model A macroscopic traffic simulator for evaluating urban transport measures for heavy vehicles Urban freight policy-oriented modelling in Europe Melbourne freight movement model Modeling logistics location choice and truck route choice behavior by Tokyo metropolitan region freight survey A hybrid microsimulation model of freight flows An investigation into the delivery of goods to the city centre of Liege Typology of efforts by Japanese companies to address logistics-related environmental issues Policy making in Germany -- Integrated commercial traffic concept of Berlin An evaluation of recent pick-up point experiments in European cities: The rise of two competing models? Reserved areas for logistics activities in the metropolitan zone of Mexico city Customized policies for sustainable urban distribution Metropolitan freight distribution by railways A practical approach to solving the just in time periodic transportation problem Quantifying the effects of community level regulation on city logistics Urban freight transport and logistics: Retailers choices Studying distribution in Tokyo metropolitan region using a local freight survey An analysis on bottlenecks for domestic vehicular transportation of international maritime container cargos in Japanese hinterland Citylog(c), a software tool for city logistics operation: Testing and validation activities Supply-chain logistics for retailing, from the standpoint of resource productivity: Researching a comprehensive evaluation method Light freight transport in urban areas Elements for a master plan in urban logistics New trends on distribution in the metropolitan zone of Mexico city A centre for eco-friendly city freight distribution: Urban logistics innovation in a mid-size historical city in Italy The conditions of modal shift in dense urban areas A case study of urban freight in Mexico A probabilistic bi-level optimization approach to highway infrastructure maintenance in urban areas Index.", "keywords": [ "City logistics", "Metropolitan area", "Traffic management", "Truck", "Transport engineering", "Business", "Microsimulation", "Scope (computer science)", "Distribution (mathematics)", "Supply chain", "Regional science", "Engineering" ], "cited_by_count": 88, "is_retracted": false, "is_paratext": false, "open_access_url": "https://bvbr.bib-bvb.de:443/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016956363&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA" }, { "id": "https://openalex.org/W3093428716", "doi": "10.1016/j.tre.2020.102058", "title": "Interval travel times for robust synchronization in city logistics vehicle routing", "year": 2020, "publication_date": "2020-10-13", "type": "article", "language": "en", "authors": [ "Patrick-Oliver Groß", "Jan Fabian Ehmke", "Dirk Christian Mattfeld" ], "first_author": "Patrick-Oliver Groß", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Interval (graph theory)", "Routing (electronic design automation)", "Computer science", "Vehicle routing problem", "Shortest path problem", "Synchronization (alternating current)", "Computation", "Real-time computing", "Operations research", "Distributed computing", "Computer network", "Mathematics" ], "cited_by_count": 30, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2020.102058" }, { "id": "https://openalex.org/W2972747848", "doi": "10.1002/net.21905", "title": "Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location", "year": 2019, "publication_date": "2019-09-14", "type": "article", "language": "en", "authors": [ "Briseida Sarasola", "Karl F. Doerner" ], "first_author": "Briseida Sarasola", "venue": "Networks", "publisher": "Wiley", "abstract": "Abstract A vehicle routing problem with synchronization constraints arises in urban freight transportation, in which context customers require deliveries from one or more logistics service providers. These deliveries should be efficient to reduce idle times at the delivery locations. Idle time is defined as nonservice time between the first and the last delivery received by the customer. We propose a strategy which relies on self‐imposed time windows, and we compare our approach with an exact determination of a feasible schedule and fixed time windows. The results show that idle times can be reduced by 54.12%‐79.77%, with an average cost rise of 9.87%. In addition, self‐imposed time windows provide solutions with 15.74%‐21.43% lower costs than feasibility checks for short runtimes and 13.71%‐21.15% lower than fixed time windows.", "keywords": [ "Idle", "Vehicle routing problem", "Computer science", "Schedule", "Synchronization (alternating current)", "Context (archaeology)", "Routing (electronic design automation)", "Mathematical optimization", "Real-time computing", "Computer network", "Mathematics", "Operating system" ], "cited_by_count": 28, "is_retracted": false, "is_paratext": false, "open_access_url": "https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.21905" }, { "id": "https://openalex.org/W2938352754", "doi": "10.1016/j.trpro.2020.03.160", "title": "A vehicle routing problem with movement synchronization of drones, sidewalk robots, or foot-walkers", "year": 2020, "publication_date": "2020-01-01", "type": "article", "language": "en", "authors": [ "Puyuan Deng", "Glareh Amirjamshidi", "Matthew J. Roorda" ], "first_author": "Puyuan Deng", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The vehicle routing problem (VRP) and its variants have many city logistics applications, such as goods delivery. The VRP extension with movement synchronization (VRPMS) has potential applications of drone and robot technologies to assist with the delivery of parcels. VRPMS seeks the optimal route for a set of composite resources, e.g. delivery van with drones, or delivery van with sidewalk robots. This paper proposes an exact formulation of the problem, and a metaheuristic approach to solve larger instances of the VRPMS in order to assess the economic benefits of the different technologies. It is shown that with the current physical constraints of drone technology, assisted delivery with drones has some challenges because of its capacity. Sidewalk robots and walkers, however, do contribute a cost savings compared to truck deliveries. As the technology matures, the presented metaheuristic approach can be used to evaluate improved economic benefits and cost benefit ratios.", "keywords": [ "Drone", "Robot", "Vehicle routing problem", "Metaheuristic", "Routing (electronic design automation)", "Computer science", "Synchronization (alternating current)", "Truck", "Transport engineering", "Set (abstract data type)", "Operations research", "Simulation" ], "cited_by_count": 25, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146520303604/pdf" }, { "id": "https://openalex.org/W2073621157", "doi": "10.1016/j.sbspro.2010.04.014", "title": "Evaluating city logistics measures using a multi-agent model", "year": 2010, "publication_date": "2010-01-01", "type": "conference-paper", "language": "en", "authors": [ "Dai Tamagawa", "Eiichi Taniguchi", "Tadashi Yamada" ], "first_author": "Dai Tamagawa", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "This paper presents a methodology for evaluating city logistics measures considering the behaviour of several stakeholders associated with urban freight transport using a multi-agent model. The model constructed consists of a learning model and a model for vehicle routing and scheduling problem with time window-forecasted (VRP-TW-F). We used a method of Q-learning, a technique of reinforcement learning, in constructing a learning model. We implemented the model on a test road network representing an urban area. The results indicate that implementing a truck ban directly to environmentally damaged areas and discounting motorway tolls entirely in the urban motorway network together has large environmental effects, and leads to an acceptable environment for all stakeholders.", "keywords": [ "Truck", "City logistics", "Computer science", "Scheduling (production processes)", "Reinforcement learning", "Transport engineering", "Discounting", "Vehicle routing problem", "Routing (electronic design automation)", "Operations research", "Engineering", "Artificial intelligence" ], "cited_by_count": 138, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877042810010670/pdf" }, { "id": "https://openalex.org/W3048261522", "doi": "10.1109/access.2020.3014638", "title": "Research on Optimization of Electric Vehicle Routing Problem With Time Window", "year": 2020, "publication_date": "2020-01-01", "type": "article", "language": "en", "authors": [ "Hao Li", "Zhenping Li", "Li Cao", "Ruoda Wang", "Mu Ren" ], "first_author": "Hao Li", "venue": "IEEE Access", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "As the urban population and scale gradually increase, the per capita income level of urban residents is also constantly increasing, more people have put forward higher requirements for material life. The degree of congestion of urban roads has a strong positive correlation with the development level of the national economy. The crowded lanes directly affect the way people travel, especially in the field of logistics distribution. Electric vehicle distribution is one of the existing distribution methods that is less affected by traffic, but it is subject to mileage, cargo capacity and number of vehicles. In order to find an optimal urban distribution route that satisfies both the electric vehicle limitation and the customer time window limitation, a mixed planning model is established to conduct in-depth research on the routing problem. In the process of verifying the correctness of the model, a mixed algorithm with lower time complexity, which was calculated by the highest order in the model, is established, and two sets of instance data are used for calculation. The results show that the mixed algorithm not only has a faster calculation speed, but also can calculate the vehicle route in a large-scale situation.", "keywords": [ "Computer science", "Vehicle routing problem", "Window (computing)", "Routing (electronic design automation)", "Real-time computing", "Computer network" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ieeexplore.ieee.org/ielx7/6287639/8948470/09160932.pdf" }, { "id": "https://openalex.org/W4205427346", "doi": "10.3390/math10020191", "title": "A Rich Vehicle Routing Problem for a City Logistics Problem", "year": 2022, "publication_date": "2022-01-08", "type": "article", "language": "en", "authors": [ "Daniela Ambrosino", "Carmine Cerrone" ], "first_author": "Daniela Ambrosino", "venue": "Mathematics", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "In this work, a Rich Vehicle Routing Problem (RVRP) is faced for solving city logistic problems. In particular, we deal with the problem of a logistic company that has to define the best distribution strategy for obtaining an efficient usage of vehicles and for reducing transportation costs while serving customers with different priority demands during a given planning horizon. Thus, we deal with a multi-period vehicle routing problem with a heterogeneous fleet of vehicles, with customers’ requirements and company restrictions to satisfy, in which the fleet composition has to be daily defined. In fact, the company has a fleet of owned vehicles and the possibility to select, day by day, a certain number of vehicles from the fleet of a third-party company. Routing costs must be minimized together with the number of vehicles used. A mixed integer programming model is proposed, and an experimental campaign is presented for validating it. Tests have been used for evaluating the quality of the solutions in terms of both model behavior and service level to grant to the customers. Moreover, the benefits that can be obtained by postponing deliveries are evaluated. Results are discussed, and some conclusions are highlighted, including the possibility of formulating this problem in such a way as to use the general solver proposed in the recent literature. This seems to be the most interesting challenge to permit companies to improve the distribution activities.", "keywords": [ "Vehicle routing problem", "Solver", "Time horizon", "Operations research", "Computer science", "Routing (electronic design automation)", "Work (physics)", "Service (business)", "Fleet management", "Integer programming", "Distribution (mathematics)", "City logistics" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2227-7390/10/2/191/pdf?version=1641642567" }, { "id": "https://openalex.org/W4407128128", "doi": "10.1109/tits.2025.3533477", "title": "Optimizing Urban Logistics: Vehicle Routing Problem With Underground Transportation", "year": 2025, "publication_date": "2025-02-04", "type": "article", "language": "en", "authors": [ "Ho Young Jeong", "Byung Duk Song" ], "first_author": "Ho Young Jeong", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "In response to increasing congestion and inefficiencies in urban freight transportation systems, driven by the rapid rise of e-commerce and urbanization, underground logistics are emerging as a promising alternative. This study introduces the Vehicle Routing Problem with Underground Transportation (VRP-UT), a novel model that integrates traditional vehicle routing with underground logistics facilities to optimize urban deliveries. To address the model’s complexity, we propose a hybrid solution approach that combines Q-learning with pruning techniques, enhancing route optimization and minimizing unnecessary operations. Comprehensive numerical and sensitivity analyses further validate the model’s effectiveness, positioning VRP-UT as a scalable and efficient solution to meet growing urban logistics demands while supporting sustainable development. A case study, including sensitivity analysis based on Seoul Subway Line 3, demonstrates the practical applicability of the VRP-UT model, highlighting its potential to alleviate surface-level traffic congestion, reduce operational costs, and shorten delivery times in densely populated urban areas.", "keywords": [ "Vehicle routing problem", "Transport engineering", "Routing (electronic design automation)", "City logistics", "Computer science", "Engineering", "Computer network" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2025.3533477" }, { "id": "https://openalex.org/W2565342342", "doi": "10.1109/ieem.2016.7798095", "title": "Simulating Dynamic Vehicle Routing Problem using Agent-Based Modeling and Simulation", "year": 2016, "publication_date": "2016-12-01", "type": "conference-paper", "language": "en", "authors": [ "Bertha Maya Sopha", "Afriana Siagian", "Anna Maria Sri Asih" ], "first_author": "Bertha Maya Sopha", "venue": null, "publisher": null, "abstract": "Changing demand trend (e-commerce business, timely delivery) has contributed to dynamism and complexity of routing problems. Despite its importance, Dynamic Vehicle Routing Problem (DVRP) has received little attention. Most of VRP works have been characterized by static and deterministic problem. To fill the gap, the present study aims at developing Agent-Based Modeling and Simulation (ABMS) to simulate DVRP by capturing dynamism and stochasticity. Urban freight transport serving sixty-two retailers at Yogyakarta city (Indonesia) is taken as a studied case. GIS data and Particle Swarm Optimization are embedded in ABMS to mimic retailers' location, road infrastructure in the real system and to evaluate optimal routes respectively. Experiments were conducted to evaluate the effect of the degree of dynamism (dod) on logistics performances. Results indicate a linear relationship between the dod and both travelled distance and lateness. For every 1% increase of the dod, the travelled distance would increase,on average, by 7%.", "keywords": [ "Dynamism", "Vehicle routing problem", "Routing (electronic design automation)", "Particle swarm optimization", "Computer science", "Operations research", "Swarm behaviour", "Transport engineering", "Distributed computing", "Engineering", "Computer network", "Artificial intelligence" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/ieem.2016.7798095" }, { "id": "https://openalex.org/W4385989177", "doi": "10.1016/j.eswa.2023.121150", "title": "Two-echelon vehicle routing problem with direct deliveries and access time windows", "year": 2023, "publication_date": "2023-08-18", "type": "article", "language": "en", "authors": [ "Saiqi Zhou", "Dezhi Zhang", "Bin Ji", "Shuangyan Li" ], "first_author": "Saiqi Zhou", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Integer programming", "Linear programming", "Operations research", "Transport engineering", "Computer network", "Automotive engineering", "Engineering", "Algorithm" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2023.121150" }, { "id": "https://openalex.org/W2991365300", "doi": "10.1016/j.trb.2019.09.013", "title": "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution", "year": 2019, "publication_date": "2019-11-26", "type": "article", "language": "en", "authors": [ "Felix M. Bergmann", "Stephan M. Wagner", "Matthias Winkenbach" ], "first_author": "Felix M. Bergmann", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Last mile (transportation)", "Mile", "Pickup", "Computer science", "Transport engineering", "Operations research", "Engineering", "Geography" ], "cited_by_count": 145, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trb.2019.09.013" }, { "id": "https://openalex.org/W4392519880", "doi": "10.1016/j.cor.2024.106600", "title": "Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization", "year": 2024, "publication_date": "2024-03-06", "type": "article", "language": "en", "authors": [ "Guanghui Zhou", "Dengyuhui Li", "Junsong Bian", "Yixiang Zhang" ], "first_author": "Guanghui Zhou", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Computer science", "Crossover", "Mathematical optimization", "Heuristic", "Pickup", "Population", "Routing (electronic design automation)", "Mathematics", "Computer network" ], "cited_by_count": 26, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cor.2024.106600" }, { "id": "https://openalex.org/W4399768132", "doi": "10.1016/j.sca.2024.100072", "title": "A systematic review of vehicle routing problems and models in multi-echelon distribution networks", "year": 2024, "publication_date": "2024-06-18", "type": "review", "language": "en", "authors": [ "Peter Nielsen", "Mahekha Dahanayaka", "H. Niles Perera", "Amila Thibbotuwawa", "Deniz Kenan Kılıç" ], "first_author": "Peter Nielsen", "venue": "Supply Chain Analytics", "publisher": "Elsevier BV", "abstract": "The vehicle routing problem (VRP) is a combinatorial optimization problem that determines optimal routes to enhance distribution efficiency. One of the most popular strategies in freight distribution is multi-echelon distribution. Multi-echelon distribution networks often apply to supply chain management, land transportation, the maritime industry, aviation, etc., and rely on VRP. This comprehensive review systematically analyses 382 papers retrieved through the Scopus database. We use a bibliometric and network analysis tool to complete a systematic literature mapping identifying key interrelationships and research clusters. The analysis depicts five main research clusters: green logistics and decision analysis, scheduling and inventory optimization, VRP for city logistics, mathematical modeling and optimization, and outbound logistics and customer service, identified based on author keywords of the systematically derived paper pool. Each cluster is provided with foundational knowledge, concepts, theories, and employed techniques. Finally, future studies are suggested to explore more comprehensive investigation in highly discussed domains like city logistics problems in e-commerce, vehicle routing problems for sustainable logistics, and technological advancement-based applications.", "keywords": [ "Vehicle routing problem", "Computer science", "Operations research", "Aviation", "Supply chain", "Scheduling (production processes)", "Service (business)", "Routing (electronic design automation)", "Transport engineering", "Business", "Operations management", "Engineering" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.sca.2024.100072" }, { "id": "https://openalex.org/W2146100722", "doi": "10.1016/j.trc.2010.11.002", "title": "The impacts of congestion on time-definitive urban freight distribution networks CO2 emission levels: Results from a case study in Portland, Oregon", "year": 2011, "publication_date": "2011-01-13", "type": "article", "language": "en", "authors": [ "Miguel Figliozzi" ], "first_author": "Miguel Figliozzi", "venue": "Transportation Research Part C Emerging Technologies", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Traffic congestion", "Transport engineering", "Vehicle miles of travel", "Business", "Public transport", "Environmental economics", "Vehicle routing problem", "Routing (electronic design automation)", "Environmental science", "Computer science", "Economics", "Engineering" ], "cited_by_count": 180, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trc.2010.11.002" }, { "id": "https://openalex.org/W4398147053", "doi": "10.1016/j.ejtl.2024.100133", "title": "A Two-echelon Vehicle Routing Problem with time-dependent travel times in the city logistics context", "year": 2024, "publication_date": "2024-01-01", "type": "article", "language": "en", "authors": [ "Andres Gutierrez", "Nacima Labadie", "Christian Prins" ], "first_author": "Andres Gutierrez", "venue": "EURO Journal on Transportation and Logistics", "publisher": "Springer Science+Business Media", "abstract": "The fast rates at which urban population is growing coupled with increasing demands expressed within cities have given rise to challenging freight transportation problems. The Two-echelon Vehicle Routing Problem (2E-VRP) has been proposed as a scheme to tackle city-related problems. To better evaluate its pertinence in large congested city areas, this work addresses a version of the 2E-VRP in which synchronization is required among the two echelons. Besides, it considers time-dependent travel times at both echelons as well as time windows at customers. Other characteristics such as open routes at second echelon offer a degree of flexibility on the efficiency of the distribution specially when dealing with outsourcing schemes. The primary goal is to minimize the number of vehicles. Meanwhile, travel and waiting times, as well as penalties for late deliveries are minimized as a secondary objective. A two-phase metaheuristic approach is proposed to solve the problem on existing benchmarks; as well on a new set of instances based on real information from the city of Bogota, provided by an industrial partner. The experiments prove that including time-dependent travel times is of utmost importance for practical applications.", "keywords": [ "Vehicle routing problem", "Context (archaeology)", "Routing (electronic design automation)", "Travel time", "Transport engineering", "Operations research", "Time travel", "Computer science", "Business", "Engineering", "Geography", "Artificial intelligence" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejtl.2024.100133" }, { "id": "https://openalex.org/W4404087519", "doi": "10.1007/s10586-024-04809-5", "title": "Multi-depot vehicle routing problem with drones in emergency logistics", "year": 2024, "publication_date": "2024-11-04", "type": "article", "language": "en", "authors": [ "Xun Weng", "Wenke She", "Hong-Qiang Fan", "Jingtian Zhang", "Lifen Yun" ], "first_author": "Xun Weng", "venue": "Cluster Computing", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Computer science", "Vehicle routing problem", "Depot", "Drone", "Routing (electronic design automation)", "Operations research", "Computer network" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10586-024-04809-5" }, { "id": "https://openalex.org/W2977376121", "doi": "10.1287/trsc.2019.0909", "title": "Adaptive Large Neighborhood Search for Multitrip Vehicle Routing with Time Windows", "year": 2019, "publication_date": "2019-10-02", "type": "article", "language": "en", "authors": [ "Véronique François", "Yasemin Arda", "Yves Crama" ], "first_author": "Véronique François", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "We consider a multitrip vehicle routing problem with time windows (MTVRPTW), in which each vehicle can perform several trips during its working shift. This problem is especially relevant in the context of city logistics. Heuristic solution methods for multitrip vehicle routing problems often separate routing and assignment phases to create trips and then assign them to the available vehicles. We show that this approach is outperformed by an integrated solution method in the presence of time windows. We use an automatic configuration tool to obtain efficient and contextualized implementations of our solution methods. We provide suitable instances for the MTVRPTW as well as an instance generator. Also, we discuss the relevance of two objective functions: the total duration and the total travel time. When minimizing the travel time, large increases in waiting time are incurred, which is not realistic in practice.", "keywords": [ "Vehicle routing problem", "Computer science", "TRIPS architecture", "Routing (electronic design automation)", "Context (archaeology)", "Heuristic", "Generator (circuit theory)", "Relevance (law)", "Implementation", "City logistics", "Duration (music)", "Time limit" ], "cited_by_count": 60, "is_retracted": false, "is_paratext": false, "open_access_url": "https://orbi.uliege.be/handle/2268/233048" }, { "id": "https://openalex.org/W2920519397", "doi": "10.5267/j.ijiec.2019.1.001", "title": "Consolidation centers in city logistics: A cooperative approach based on the location routing problem", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Sachin Nataraj", "Daniele Ferone", "Carlos L. Quintero-Araújo", "Angel Alejandro Juan", "Paola Festa" ], "first_author": "Sachin Nataraj", "venue": "International Journal of Industrial Engineering Computations", "publisher": "Growing Science", "abstract": "In the context of city logistics, freight transportation is one of the prominent causes of traffic congestion, high levels of pollution, and safety concerns.To decrease the negative impact of these issues, different methods have been traditionally implemented.On the one hand, the location of urban consolidation Centers (UCCs) near a city can be used to consolidate freight delivery services.Therefore, the number of trucks moving in urban areas can be reduced.On the other hand, Horizontal Cooperation can also help to reduce environmental impact while increasing service level.This paper combines both strategies, that is, we deal with the location of UCCs and, simultaneously, we analyze different scenarios where the players of different supply chain processes exhibit various levels of cooperation.Thus, different levels of cooperations regarding routing and UCCs-location decisions are considered in the following scenarios: (a) non-cooperative case, in which all decisions are decentralized (i.e., each enterprise solves its own vehicle routing problem); (b) low-cooperative case, where depot capacities are shared but the customers are still being served by each company's fleet of vehicles; (c) semicooperative case, based on centralized route planning decisions (i.e.facilities and fleets are shared among participating enterprises); and (d) fully cooperative scenario, where the routing plans and facility-location decisions are taken by consensus amongst all the participants.In order to estimate the benefits of both strategies, we propose a flexible metaheuristic algorithm to deal with the combined location and routing problem under the different cooperative scenarios.Our results show impressive benefits of the proposed approach.", "keywords": [ "Consolidation (business)", "City logistics", "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Transport engineering", "Operations research", "Operations management", "Business", "Engineering", "Computer network", "Finance" ], "cited_by_count": 65, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5267/j.ijiec.2019.1.001" }, { "id": "https://openalex.org/W4411225498", "doi": "10.1016/j.eswa.2025.128503", "title": "Multi-objective optimization for time-dependent vehicle routing problem with drones", "year": 2025, "publication_date": "2025-06-12", "type": "article", "language": "en", "authors": [ "Yong Peng", "Chengxi Zhang", "Ajinkya N. Tanksale", "Dennis Z. Yu" ], "first_author": "Yong Peng", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Drone", "Vehicle routing problem", "Computer science", "Mathematical optimization", "Routing (electronic design automation)", "Mathematics", "Computer network" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2025.128503" }, { "id": "https://openalex.org/W2751815712", "doi": "10.1016/j.tre.2017.08.011", "title": "The impact of path selection on GHG emissions in city logistics", "year": 2017, "publication_date": "2017-09-03", "type": "article", "language": "en", "authors": [ "Martin Behnke", "Thomas Kirschstein" ], "first_author": "Martin Behnke", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Greenhouse gas", "Selection (genetic algorithm)", "Path (computing)", "Routing (electronic design automation)", "Reduction (mathematics)", "Computer science", "Transport engineering", "Vehicle routing problem", "Mathematical optimization", "Operations research", "Environmental science", "Engineering" ], "cited_by_count": 90, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2017.08.011" }, { "id": "https://openalex.org/W564009027", "doi": "10.1016/s1474-6670(17)43907-3", "title": "Vehicle Routing Methods for City Logistics Operations", "year": 1997, "publication_date": "1997-06-01", "type": "conference-paper", "language": "en", "authors": [ "Hisafumi Kokubugata", "Hideo Itoyama", "H. Kawashima" ], "first_author": "Hisafumi Kokubugata", "venue": "IFAC Proceedings Volumes", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Scheme (mathematics)", "Vehicle routing problem", "Simulated annealing", "Scheduling (production processes)", "Computer science", "Mathematical optimization", "Routing (electronic design automation)", "Algorithm", "Mathematics", "Computer network" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/s1474-6670(17)43907-3" }, { "id": "https://openalex.org/W4384937338", "doi": "10.1016/j.eswa.2023.120979", "title": "Green vehicle routing using mixed fleets for cold chain distribution", "year": 2023, "publication_date": "2023-07-20", "type": "article", "language": "en", "authors": [ "Wanru Chen", "Dezhi Zhang", "Tom Van Woensel", "Guangming Xu", "Guo Jing" ], "first_author": "Wanru Chen", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Computer science", "Energy consumption", "Mathematical optimization", "Automotive engineering", "Green logistics", "Routing (electronic design automation)", "Environmental economics", "Mathematics", "Engineering", "Embedded system", "Economics" ], "cited_by_count": 59, "is_retracted": false, "is_paratext": false, "open_access_url": "https://pure.tue.nl/ws/files/309283747/1-s2.0-S0957417423014811-main.pdf" }, { "id": "https://openalex.org/W4392843881", "doi": "10.1109/tits.2024.3360420", "title": "A Two-Echelon Capacitated Vehicle Routing Problem With Sharing Satellite Resources", "year": 2024, "publication_date": "2024-02-14", "type": "article", "language": "en", "authors": [ "Dezhi Zhang", "Saiqi Zhou", "Bin Ji", "Shuangyan Li" ], "first_author": "Dezhi Zhang", "venue": "IEEE Transactions on Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "Collaboration vehicle routing has garnered increasing attention recently because it can help enterprises reduce costs by sharing resources. This paper addresses a novel two-echelon capacitated vehicle routing problem with sharing satellite resources (2E-CVRPSSR), which arises with the development of e-commerce and the Sharing economy in city logistics. In this problem, goods are delivered within a two-echelon routing network, where satellites are used to consolidate and transfer goods between first-and second-echelon routing. Moreover, the second-echelon vehicles can depart from and return to different satellites. A mixed integer linear programming model is first presented, and an adaptive large neighborhood search algorithm with several new search operators and strategies is proposed to solve this problem. The numerical results show that the proposed algorithm can effectively solve the 2E-CVRPSSR. Moreover, an average transportation cost savings of 6.29% can be obtained by sharing satellite resources. In addition, geographic analysis indicates that the layout of the depot, satellites, and customers largely impacts the economic advantages of sharing satellite resources. Specifically, the highest economic benefits are achieved when the satellites are distributed from nearest to farthest from the depot, with customers located between nearby and distant satellites and with satellites of large enough capacity close to the depot.", "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "Satellite", "Operations research", "Computer network", "Engineering", "Aerospace engineering" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/tits.2024.3360420" }, { "id": "https://openalex.org/W4367839694", "doi": "10.1016/j.tra.2023.103688", "title": "Modular vehicle routing for combined passenger and freight transport", "year": 2023, "publication_date": "2023-05-03", "type": "article", "language": "en", "authors": [ "Jonas Hatzenbühler", "Erik Jenelius", "Győző Gidófalvi", "Oded Cats" ], "first_author": "Jonas Hatzenbühler", "venue": "Transportation Research Part A Policy and Practice", "publisher": "Elsevier BV", "abstract": "This study investigates the potential of modular vehicle concepts and consolidation to increase the efficiency of urban freight and passenger transport. Modularity is achieved by connecting multiple vehicles together to form a platoon. Consolidation is realized by integrating passenger and freight demand in the routing problem. Vehicles are specific for each demand type but can be connected freely, allowing the transport of multiple demand types in the same platoon. The routing problem formulation considers travel time costs, travel distance costs, fleet size costs, and unserved requests costs. The operations are modeled in a novel modular multi-purpose pickup and delivery problem (MMP-PDP) which is solved using CPLEX and Adaptive Large Neighborhood Search (ALNS). In an extensive scenario study, the potential of the modular vehicle type is explored for different spatial and temporal demand distributions. A parameter study on vehicle capacity, vehicle range and platoon cost saving is performed to assess their influence on efficiency. The experiments indicate a cost saving of 48% due to modularity and an additional 9% due to consolidation. The reduction mainly stems from reduced operating costs and reduced trip duration, while the same number of requests can be served in all cases. Empty vehicle kilometers are reduced by more than 60% by consolidation and modularity. A large-scale case study in Stockholm highlights the practical applicability of the modular transport system. The proposed model and optimization framework can be used by companies and policy makers to identify required fleet sizes, optimal vehicle routes and cost savings due to different types of operation and vehicle technology.", "keywords": [ "Modular design", "Vehicle routing problem", "Transport engineering", "Platoon", "Computer science", "Consolidation (business)", "Operations research", "Routing (electronic design automation)", "Engineering", "Business" ], "cited_by_count": 53, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tra.2023.103688" }, { "id": "https://openalex.org/W2074186253", "doi": "10.4018/joris.2011040103", "title": "Multi Depot Probabilistic Vehicle Routing Problems with a Time Window", "year": 2011, "publication_date": "2011-04-01", "type": "article", "language": "en", "authors": [ "Sutapa Samanta", "Manoj K. Jha" ], "first_author": "Sutapa Samanta", "venue": "International Journal of Operations Research and Information Systems", "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)", "Path (computing)", "Mathematics", "Artificial intelligence" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.4018/joris.2011040103" }, { "id": "https://openalex.org/W4388199003", "doi": "10.1007/s40747-023-01259-1", "title": "A two-stage hybrid ant colony algorithm for multi-depot half-open time-dependent electric vehicle routing problem", "year": 2023, "publication_date": "2023-10-26", "type": "article", "language": "en", "authors": [ "Lijun Fan" ], "first_author": "Lijun Fan", "venue": "Complex & Intelligent Systems", "publisher": "Springer Science+Business Media", "abstract": "Abstract This article presents a detailed investigation into the Multi-Depot Half-Open Time-Dependent Electric Vehicle Routing Problem (MDHOTDEVRP) within the domain of urban distribution, prompted by the growing urgency to mitigate the environmental repercussions of logistics transportation. The study first surmounts the uncertainty in Electric Vehicle (EV) range arising from the dynamic nature of urban traffic networks by establishing a flexible energy consumption estimation strategy. Subsequently, a Mixed-Integer Programming (MIP) model is formulated, aiming to minimize the total distribution costs associated with EV dispatch, vehicle travel, customer service, and charging operations. Given the unique attributes intrinsic to the model, a Two-Stage Hybrid Ant Colony Algorithm (TSHACA) is developed as an effective solution approach. The algorithm leverages enhanced K-means clustering to assign customers to EVs in the first stage and employs an Improved Ant Colony Algorithm (IACA) for optimizing the distribution within each cluster in the second stage. Extensive simulations conducted on various test scenarios corroborate the economic and environmental benefits derived from the MDHOTDEVRP solution and demonstrate the superior performance of the proposed algorithm. The outcomes highlight TSHACA’s capability to efficiently allocate EVs from different depots, optimize vehicle routes, reduce carbon emissions, and minimize urban logistic expenditures. Consequently, this study contributes significantly to the advancement of sustainable urban logistics transportation, offering valuable insights for practitioners and policy-makers.", "keywords": [ "Ant colony optimization algorithms", "Electric vehicle", "Vehicle routing problem", "Cluster analysis", "Computer science", "Operations research", "Mathematical optimization", "Service (business)", "Routing (electronic design automation)", "Engineering", "Algorithm", "Artificial intelligence" ], "cited_by_count": 29, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s40747-023-01259-1.pdf" }, { "id": "https://openalex.org/W4392361436", "doi": "10.1016/j.cie.2024.110022", "title": "Vehicle routing problem for fresh products distribution considering customer satisfaction through adaptive large neighborhood search", "year": 2024, "publication_date": "2024-03-01", "type": "article", "language": "en", "authors": [ "Min Huang", "Minghao Liu", "Hanbin Kuang" ], "first_author": "Min Huang", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Customer satisfaction", "Routing (electronic design automation)", "Mathematical optimization", "Distribution (mathematics)", "Computer science", "Transport engineering", "Engineering", "Mathematics", "Business", "Marketing", "Computer network" ], "cited_by_count": 22, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2024.110022" }, { "id": "https://openalex.org/W4416743846", "doi": "10.1007/s10479-025-06904-1", "title": "A metaheuristic approach for the multi-objective sustainable vehicle routing problem", "year": 2025, "publication_date": "2025-11-27", "type": "article", "language": "en", "authors": [ "Reza Moghdani", "Khodakaram Salimifard", "Emrah Demir", "Sasan Barak", "Adel Aazami", "Seyed Ashkan Hosseini Shekarabi" ], "first_author": "Reza Moghdani", "venue": "Annals of Operations Research", "publisher": "Springer Science+Business Media", "abstract": "Abstract This study introduces the Multi-Objective Sustainable Vehicle Routing Problem (MOSVRP) with time windows, designed for congested urban networks. The model simultaneously addresses economic, environmental, and social sustainability by minimizing costs and emissions while maximizing customer satisfaction through enhanced service at pickup nodes. To manage the complexity of large-scale urban routing, we propose a novel Voronoi diagram-based network shrinking procedure that significantly reduces computational effort. More specifically, the model incorporates time-dependent traffic patterns to capture realistic urban conditions. For the solution, we propose a tailored metaheuristic, the enhanced Multi-Objective Volleyball Premier League (MOVPL) algorithm, which incorporates reference point guidance, disruption operators, and adaptive weight adjustment. This hybrid approach effectively balances conflicting objectives and improves solution diversity. Applied to Tehran’s urban freight network, the proposed method demonstrates superior performance across all metrics compared to benchmark algorithms and exact methods. Results show notable reductions in fuel consumption and travel distance, alongside improved service equity. Furthermore, the framework offers a scalable and transferable solution for sustainable logistics in other urban contexts.", "keywords": [ "Benchmark (surveying)", "Vehicle routing problem", "Traffic congestion", "Heuristics", "Scalability", "Sustainability", "Metaheuristic", "Routing (electronic design automation)", "Service level", "Service (business)" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s10479-025-06904-1.pdf" }, { "id": "https://openalex.org/W2118543479", "doi": "10.1007/s13676-012-0004-y", "title": "A bi-objective time-dependent vehicle routing and scheduling problem for hazardous materials distribution", "year": 2012, "publication_date": "2012-04-03", "type": "article", "language": "en", "authors": [ "Konstantinos N. Androutsopoulos", "Konstantinos G. Zografos" ], "first_author": "Konstantinos N. Androutsopoulos", "venue": "EURO Journal on Transportation and Logistics", "publisher": "Springer Science+Business Media", "abstract": "Planning hazardous materials distribution routes for servicing a given set of orders within specified time windows is a problem frequently surfacing in a city logistics environment which is characterized by dynamic travel times. The hazardous materials distribution problem involves the determination of the sequence of deliveries and the corresponding paths assigned to each truck. This paper presents the formulation of the hazardous materials distribution problem as a bi-objective time-dependent vehicle routing problem with time windows. The paper presents the mathematical formulation of the problem as an integer network flow model with multiple objectives. The weighted-sum method is applied decomposing the bi-objective vehicle routing and scheduling problem to a series of single-objective instances of the problem, where the objective function is expressed by the weighted sum of the criteria under consideration. A route-building heuristic algorithm is presented for addressing each of the constituent single-objective problems, where stops are inserted iteratively in the front part of the unfinished route. A label-setting algorithm is integrated in the heuristic algorithm for solving the time-dependent shortest path problem with multiple intermediate stops arising after the insertion of any stop in the route. The proposed solution approach has been applied to a set of solvable test problems to assess the accuracy of the heuristic solutions. The results indicate a tolerable deviation of the heuristic solutions from the actual non-dominated solutions. In addition, the proposed algorithm was applied to a set of test problems resembling real-life problem cases. The average computational time needed for solving this type of test problems is not prohibitive.", "keywords": [ "Mathematical optimization", "Vehicle routing problem", "Scheduling (production processes)", "Job shop scheduling", "Heuristic", "Routing (electronic design automation)", "Hazardous waste", "Shortest path problem", "Set (abstract data type)", "Computer science", "Truck", "Integer programming" ], "cited_by_count": 64, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2192437620600139/pdf" }, { "id": "https://openalex.org/W2945640949", "doi": "10.1016/j.procs.2019.04.115", "title": "How Driving Multiple Tours Affects the Results of Last Mile Delivery Vehicle Routing Problems", "year": 2019, "publication_date": "2019-01-01", "type": "conference-paper", "language": "en", "authors": [ "Kai Martins-Turner", "Kai Nagel" ], "first_author": "Kai Martins-Turner", "venue": "Procedia Computer Science", "publisher": "Elsevier BV", "abstract": "Solving Vehicle Routing Problems (VRPs) is one very important step for modeling and simulating urban freight transportation and especially urban last-mile delivery. It is observed in several studies, that tour plans consist of a very high number of vehicles needed because vehicles only drive one tour. For the next tour, a new vehicle with new fixed costs is needed. This also starts in the beginning of its temporal availability. This article intends to answer the question: how tour plan and fleet size changes when vehicles can reload at the depot and run another tour within its temporal availability. The possible effects are shown in two studies for Berlin: (i) food retailing delivery and (ii) parcel delivery for one district of Berlin. The studies have different designs and policy cases to see the effects under different situations. The present research shows that reloading within the delivery tour leads to a significant reduction of vehicles needed and therefore to lower costs for the carrier. If one tour is not limited by the vehicle’s capacity but by the vehicle’s temporal availability no saving can be observed. This was the case for parcel delivery with light parcel delivery trucks. When using smaller vehicles, e.g. cargo bicycles for last mile delivery from local city hubs, vehicle capacity is the limiting factor and therefore also significant saving can be observed. As another consequence it is possible to get rid of artificially inserted breaks in time-windows for more realistic traffic. The article also critically addresses the problem of increasing computation time.", "keywords": [ "Truck", "Last mile (transportation)", "Computer science", "Vehicle routing problem", "Transport engineering", "Routing (electronic design automation)", "Mile", "Plan (archaeology)", "Limiting", "Food delivery", "Operations research", "Automotive engineering" ], "cited_by_count": 18, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877050919305794/pdf" }, { "id": "https://openalex.org/W2980433312", "doi": "10.1088/1742-6596/1324/1/012071", "title": "A two-echelon vehicle routing problem involving electric vehicles with time windows", "year": 2019, "publication_date": "2019-10-01", "type": "conference-paper", "language": "en", "authors": [ "Dan Wang", "Hong Fei Zhou", "Ruxin Feng" ], "first_author": "Dan Wang", "venue": "Journal of Physics Conference Series", "publisher": "IOP Publishing", "abstract": "This paper addresses a two-echelon vehicle routing problem involving electric vehicles considering time windows and battery swapping stations (2E-EVRPTW-BSS), which aims at determining the delivery strategy under battery driving range and time windows for city logistics. Unilateral time windows and time windows are considered to guarantee the timeliness of transportation. The electric vehicles (EVs) operating at the 2 nd -echelon have battery swapping costs. A mathematical model is constructed to formulate the problem in which the total of shipping cost, handling cost, battery swapping costs, fixed cost of vehicles, and penalty cost due to tardiness is minimized. Numerical experiments with 14 randomly-generated instances have been conducted to demonstrate the effective of the model.", "keywords": [ "Tardiness", "Vehicle routing problem", "Battery (electricity)", "Operating cost", "Routing (electronic design automation)", "Computer science", "Electric vehicle", "Range (aeronautics)", "Battery capacity", "Mathematical optimization", "Automotive engineering", "Engineering" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://iopscience.iop.org/article/10.1088/1742-6596/1324/1/012071/pdf" }, { "id": "https://openalex.org/W2910277245", "doi": "10.1109/is.2018.8710538", "title": "Multi-vehicle Route Planning for Efficient Urban Freight Transport", "year": 2018, "publication_date": "2018-09-01", "type": "conference-paper", "language": "en", "authors": [ "Petar Mrazovic", "Elif Eser", "Hakan Ferhatosmanoğlu", "Josep-L. Larriba-Pey", "Mihhail Matskin" ], "first_author": "Petar Mrazovic", "venue": null, "publisher": null, "abstract": "The urban parking spaces for loading/unloading are typically over-occupied, which shifts delivery operations to traffic lanes and pavements, increases traffic, generates noise, and causes pollution. We present a data analytics based routing optimization that improves the circulation of vehicles and utilization of parking spaces. We formalize this new problem and develop a novel multivehicle route planner that avoids congestions at loading/unloading areas and minimizes the total duration. We present the developed tool with an illustration and analysis for the urban freight in the city of Barcelona, which monitors tens of thousands of deliveries every day. Our system includes an effective evaluation of candidate routes by considering the waiting times and further delays of other deliverers as a first class citizen in the optimization. A two-layer local search is proposed with a greedy randomized adaptive method for variable neighborhood search. Our approach is applied and validated over data collected across Barcelona's urban freight transport network, which contains 3,704,034 parking activities. Our solution is shown to significantly improve the use of available parking spaces and the circulation of vehicles, as evidenced by the results. The analysis also provides useful insights on how to manage delivery routes and parking spaces for sustainable urban freight transport and city logistics.", "keywords": [ "Planner", "Transport engineering", "Routing (electronic design automation)", "Variable neighborhood search", "Computer science", "Vehicle routing problem", "Traffic management", "City logistics", "Pedestrian", "Computer network", "Metaheuristic", "Engineering" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/2117/172512" }, { "id": "https://openalex.org/W3038093615", "doi": "10.1016/j.tre.2020.102018", "title": "Two-echelon urban deliveries using autonomous vehicles", "year": 2020, "publication_date": "2020-07-23", "type": "article", "language": "en", "authors": [ "Shaohua Yu", "Jakob Puchinger", "Shudong Sun" ], "first_author": "Shaohua Yu", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Heuristics", "Implementation", "Backtracking", "Vehicle routing problem", "Computer science", "Metaheuristic", "Mathematical optimization", "Sensitivity (control systems)", "Routing (electronic design automation)", "Operations research", "Transport engineering", "Engineering" ], "cited_by_count": 93, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hal.science/hal-02877730" }, { "id": "https://openalex.org/W4405045402", "doi": "10.1016/j.eswa.2024.125996", "title": "A new branch-and-Benders-cut algorithm for the time-dependent vehicle routing problem", "year": 2024, "publication_date": "2024-12-05", "type": "article", "language": "en", "authors": [ "Pedro Belin Castellucci", "Leandro Callegari Coelho", "Maryam Darvish" ], "first_author": "Pedro Belin Castellucci", "venue": "Expert Systems with Applications", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Branch and cut", "Computer science", "Algorithm", "Mathematical optimization", "Routing (electronic design automation)", "Integer programming", "Mathematics", "Computer network" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eswa.2024.125996" }, { "id": "https://openalex.org/W2084004310", "doi": "10.1016/j.sbspro.2014.07.242", "title": "A Vehicle Routing Problem Solution Considering Alternative Stop Points", "year": 2014, "publication_date": "2014-07-01", "type": "conference-paper", "language": "en", "authors": [ "Zhifeng Lang", "Enjian Yao", "Weisong Hu", "Zheng Yu Pan" ], "first_author": "Zhifeng Lang", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "Logistics, especially the city logistics delivery becomes one of the main contributors of energy consumption and environment pollution in urban transportation system. Reasonable vehicle route planning is viewed as an important solution to lower the energy consumption of delivery vehicle as well as reduce logistics enterprises’ operation costs. However, in most existing vehicle routing problem (VRP) studies, the road networks were simplified and the client points were connected by unidirectional roads, which is obviously inconsistent with the actual conditions of road network. A new VRP solution based on a bi-directional road network, which aims to minimizing fuel consumption for gasoline powered delivery vehicle, is proposed in this paper. First, the mathematic VRP model with the minimal-fuel consumption as optimization objective is established. Then, a bi-directional road network for VRP is constructed, and alternative stop point for each delivery client is formulated according to the weight of package and the walking distance of deliveryman. Finally, the proposed method is evaluated in an actual road network, and the results show that the proposed solution for VRP reduces the distance of roundabout and the fuel consumption of delivery vehicle effectively.", "keywords": [ "Vehicle routing problem", "Roundabout", "Fuel efficiency", "Energy consumption", "Transport engineering", "Point (geometry)", "Routing (electronic design automation)", "Computer science", "City logistics", "Automotive engineering", "Operations research", "Engineering" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877042814041627/pdf" }, { "id": "https://openalex.org/W2731741248", "doi": "10.1155/2017/8687515", "title": "Combining Facility Location and Routing Decisions in Sustainable Urban Freight Distribution under Horizontal Collaboration: How Can Shippers Be Benefited?", "year": 2017, "publication_date": "2017-01-01", "type": "article", "language": "en", "authors": [ "Hanan Ouhader", "Malika El Kyal" ], "first_author": "Hanan Ouhader", "venue": "Mathematical Problems in Engineering", "publisher": "Hindawi Publishing Corporation", "abstract": "This article investigates the potential economic, environmental, and social effects of combining depot location and vehicle routing decisions in urban road freight transportation under horizontal collaboration. We consider a city in which several suppliers decide to joint deliveries to their customers and goods are delivered via intermediate depots. We study a transportation optimization problem from the perspective of sustainability development. This quantitative approach is based on three‐objective mathematical model for strategic, tactical, and operational decision‐making as a two‐echelon location routing problem (2E‐LRP). The objectives are to minimize cost and CO2 emissions of the transportation and maximize the created job opportunities. The model was solved with the ε ‐constraint method using extended known instances reflecting the real distribution in urban area to evaluate several goods’ delivery strategies. The obtained results by comparing collaborative and noncollaborative scenarios show that collaboration leads to a reduction in CO2 emissions, transportation cost, used vehicles, and travelled distances in addition to the improvement of the vehicles load rate but collaboration affects negatively social impact. To evaluate the effect of the method used to allocate the total gains to the different partners, we suggest to decision makers a comparison between well‐known allocation methods.", "keywords": [ "Vehicle routing problem", "Sustainability", "Constraint (computer-aided design)", "Routing (electronic design automation)", "Transport engineering", "Distribution (mathematics)", "Operations research", "Computer science", "Environmental economics", "Business", "Engineering", "Economics" ], "cited_by_count": 80, "is_retracted": false, "is_paratext": false, "open_access_url": "https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/2017/8687515" }, { "id": "https://openalex.org/W2394868424", "doi": "10.1007/978-3-319-00795-3_87", "title": "Energy-Optimized Routing of Electric Vehicles in Urban Delivery Systems", "year": 2013, "publication_date": "2013-11-27", "type": "book-chapter", "language": "en", "authors": [ "Henning Preis", "Stefan Frank", "Karl Nachtigall" ], "first_author": "Henning Preis", "venue": "Operations research proceedings", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Heuristics", "Tabu search", "Computer science", "Vehicle routing problem", "Battery capacity", "Battery (electricity)", "Driving range", "Energy consumption", "Range (aeronautics)", "Routing (electronic design automation)", "Mathematical optimization", "Automotive engineering" ], "cited_by_count": 45, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-00795-3_87" }, { "id": "https://openalex.org/W2125840663", "doi": null, "title": "Towards E(lectric)- urban freight: first promising steps in the electric vehicle revolution", "year": 2013, "publication_date": "2013-12-31", "type": "article", "language": "en", "authors": [ "Ron van Duin", "Lóránt Antal Tavasszy", "Hans J. Quak" ], "first_author": "Ron van Duin", "venue": "Research Repository (Delft University of Technology)", "publisher": "Delft University of Technology", "abstract": "Innovative logistics service providers are currently looking for possibilities to introduce electric vehicles for goods distribution. As electrical vehicles still suffer from a limited operation range, the logistical process faces important challenges. In this research we advise on the composition of the electrical vehicle fleet and on the configuration of the service network, to achieve a successful implementation of electric vehicles in the innercity of Amsterdam. Additional question in our research is whether the CO2 emission reduces at all or might even increase due to an increase of tripkilometres as a consequence of mileage constraints by the batteries. The aim of the implementation of the research is to determine the ideal fleet to transport a known demand of cargo, located at a central depot, to a known set of recipients using vehicles of varying types. The problem can be classified as a Fleet Size and Mix Vehicle Routing Problem (FSMVRP). In addition to the regular constraints that apply to the regular FSMVRP, in our case also time windows apply to the cargo that needs to be transported (FSMVRPTW). The operation range of the vehicles is constrained by the battery capacity. We suggest modifications to existing formulations of the FSMVRPTW to make it suitable for the application on cases with electrical vehicles. We apply the model to create an optimal fleet configuration and the service routes. In our research case of the Cargohopper in Amsterdam, the performance of alternative fleet compositions is determined for a variety of scenarios, to assess their robustness. The main uncertainties addressed in the scenarios are the cargo composition, the operation range of the vehicles and their operation speed. Based on our research findings in Amsterdam we conclude that the current generation of electric vehicles as a part of urban consolidation concept have the ability to perform urban freight transport efficiently (19% reduction in vehicle kilometres) and meanwhile have the capability to improve air quality and reduce CO2-emissions by 90%, and reduce noise nuisance in the inner cities of our (future) towns.", "keywords": [ "Vehicle routing problem", "Transport engineering", "Robustness (evolution)", "Electric vehicle", "Service (business)", "Computer science", "Operations research", "Driving range", "Range (aeronautics)", "Process (computing)", "Alternative fuel vehicle", "Routing (electronic design automation)" ], "cited_by_count": 96, "is_retracted": false, "is_paratext": false, "open_access_url": "http://resolver.tudelft.nl/uuid:58fad1de-b08d-4066-ac7d-39125f0c3daa" }, { "id": "https://openalex.org/W2788385173", "doi": "10.1155/2018/4621694", "title": "Mathematical Formulation and Comparison of Solution Approaches for the Vehicle Routing Problem with Access Time Windows", "year": 2018, "publication_date": "2018-01-01", "type": "article", "language": "en", "authors": [ "Rafael Grosso", "Jesús Muñuzuri", "Alejandro Escudero-Santana", "Elena Barbadilla-Martín" ], "first_author": "Rafael Grosso", "venue": "Complexity", "publisher": "Hindawi Publishing Corporation", "abstract": "The application of the principles of sustainability to the implementation of urban freight policies requires the estimation of all the costs and externalities involved. We focus here on the case of access time windows, which ban the access of freight vehicles to central urban areas in many European cities. Even though this measure seeks to reduce congestion and emissions in the most crowded periods of the day, it also imposes additional costs for carriers and results in higher emissions and energy consumption. We present here a mathematical model for the Vehicle Routing Problem with Access Time Windows, a variant of the VRP suitable for planning delivery routes in a city subject to this type of accessibility restriction. We use the model to find exact solutions to small problem instances based on a case study and then compare the performance over larger instances of a modified savings algorithm, a genetic algorithm, and a tabu search procedure, with the results showing no clear prevalence of any of them, but confirming the significance of those additional costs and externalities.", "keywords": [ "Vehicle routing problem", "Computer science", "Tabu search", "Externality", "Routing (electronic design automation)", "Sustainability", "Mathematical optimization", "Traffic congestion", "Focus (optics)", "Transport engineering", "Genetic algorithm", "Operations research" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "http://downloads.hindawi.com/journals/complexity/2018/4621694.pdf" }, { "id": "https://openalex.org/W2180003982", "doi": "10.1016/j.eiar.2015.09.002", "title": "Transport spatial model for the definition of green routes for city logistics centers", "year": 2015, "publication_date": "2015-10-22", "type": "article", "language": "en", "authors": [ "Dragan Stevan Pamucar", "Ljubomir Gigović", "Goran Ćirović", "Miodrag Regodić" ], "first_author": "Dragan Stevan Pamucar", "venue": "Environmental Impact Assessment Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Dijkstra's algorithm", "Environmentally friendly", "Green logistics", "Scheduling (production processes)", "Geographic information system", "Transport engineering", "City logistics", "Computer science", "Plan (archaeology)", "Operations research", "Shortest path problem", "Environmental economics" ], "cited_by_count": 53, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.eiar.2015.09.002" }, { "id": "https://openalex.org/W2888559674", "doi": "10.1007/978-3-319-99707-0_24", "title": "Developing an Advanced Cloud-Based Vehicle Routing and Scheduling System for Urban Freight Transportation", "year": 2018, "publication_date": "2018-01-01", "type": "conference-paper", "language": "en", "authors": [ "Sotiris P. Gayialis", "Grigorios D. Konstantakopoulos", "Georgios A. Papadopoulos", "Evripidis P. Kechagias", "Stavros T. Ponis" ], "first_author": "Sotiris P. Gayialis", "venue": "IFIP advances in information and communication technology", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Cloud computing", "Vehicle routing problem", "Scheduling (production processes)", "Computer science", "Transport engineering", "Routing (electronic design automation)", "Computer network", "Engineering", "Operations management", "Operating system" ], "cited_by_count": 16, "is_retracted": false, "is_paratext": false, "open_access_url": "https://inria.hal.science/hal-02177850" }, { "id": "https://openalex.org/W2803397704", "doi": "10.1080/00207543.2018.1471241", "title": "Incorporating supplier selection and order allocation into the vehicle routing and multi-cross-dock scheduling problem", "year": 2018, "publication_date": "2018-05-17", "type": "article", "language": "en", "authors": [ "Mohammad Mahdi Nasiri", "Ali Rahbari", "Frank M. Werner", "Roya Karimi" ], "first_author": "Mohammad Mahdi Nasiri", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "In the vehicle routing problem with cross-docking (VRPCD), it is assumed that the selected suppliers and the quantity of the products purchased from each supplier are known. This paper presents an MILP model which incorporates supplier selection and order allocation into the VRPCD in a multi-cross-dock system minimising the total costs, including purchasing, transportation, cross-docking, inventory and early/tardy delivery penalty costs. The sensitivity of the model on the key parameters of the objective function is analysed and the supply decisions are evaluated when the coefficients of the distribution cost are changed. A two-stage solution algorithm (TSSA) is proposed and the results of the TSSA for small-sized instances are compared with the exact solutions. Finally, a large-sized real case of an urban freight transport is solved using the TSSA.", "keywords": [ "Purchasing", "Scheduling (production processes)", "Operations research", "Vehicle routing problem", "Computer science", "DOCK", "Total cost", "Selection (genetic algorithm)", "Routing (electronic design automation)", "Operations management", "Business", "Engineering" ], "cited_by_count": 52, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2018.1471241" }, { "id": "https://openalex.org/W2899184533", "doi": "10.1145/3267305.3274166", "title": "Knowledge-Based Learning for Solving Vehicle Routing Problem", "year": 2018, "publication_date": "2018-10-08", "type": "conference-paper", "language": "en", "authors": [ "Thananut Phiboonbanakit", "Teerayut Horanont", "Thepchai Supnithi", "Van‐Nam Huynh" ], "first_author": "Thananut Phiboonbanakit", "venue": null, "publisher": null, "abstract": "In this study, we have developed a method that applies machine learning in combination with an optimization heuristic algorithm such as a genetic algorithm (GA) for solving the vehicle routing problem (VRP). Further, we developed a knowledge-based algorithm for a knowledge learning system. The algorithm learns to classify coordinates (unlabeled) into regions. Consequently, dividing routing calculations into regions (clusters) provides many benefits over traditional methods, and can result in an improvement in routing cost over the traditional company method by up to 25.68% and over the classical GA by up to 8.10%. It is also shown that our proposed method can reduce traveling distance compared to previous methods. Finally, the prediction of future customer regions has an accuracy of up to 0.72 for the predicted unlabeled customer coordinates. This study can contribute toward creation of more efficient and environmentally friendly urban freight transportation systems.", "keywords": [ "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Heuristic", "Genetic algorithm", "Artificial intelligence", "Travelling salesman problem", "Routing algorithm", "Mathematical optimization", "Machine learning", "Algorithm", "Mathematics" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1145/3267305.3274166" }, { "id": "https://openalex.org/W4309716834", "doi": "10.5267/j.ijiec.2022.9.002", "title": "Half-open time-dependent multi-depot electric vehicle routing problem considering battery recharging and swapping", "year": 2022, "publication_date": "2022-11-23", "type": "article", "language": "en", "authors": [ "Lijun Fan", "Liu Changshi", "Wu Zhang" ], "first_author": "Lijun Fan", "venue": "International Journal of Industrial Engineering Computations", "publisher": "Growing Science", "abstract": "In order to promote green and sustainable development of the transportation industry, an increasing number of logistics companies have begun to deploy electric vehicles (EVs) to provide urban distribution services. This paper studies a Half-Open Time-Dependent Multi-Depot Electric Vehicle Routing Problem Considering Battery Recharging and Swapping (HOTDMDEVRPBRS) in last-mile delivery. Based on the calculation functions of EV energy consumption, travel time, and carbon emissions under the time-dependent road network, a mixed integer programming model is formulated. The goal of the model is to minimize the economic cost and environmental cost of logistics companies. Given the complexity of the problem, this paper designs a multi-objective simulated annealing algorithm (SAA). Finally, this paper carries out comprehensive computational experiments to verify and evaluate the performance of the proposed model and method and examines the economic and environmental benefits brought by the Half-Open Joint Distribution Mode (HOJDM). According to the results, SAA shows good performance and provides a high-quality solution. Meanwhile, the HOJDM significantly reduces the total cost and carbon emissions of logistics enterprises and provides valuable suggestions for enterprise managers and government decision-makers.", "keywords": [ "Simulated annealing", "Electric vehicle", "Vehicle routing problem", "Battery (electricity)", "Transport engineering", "Environmental economics", "Integer programming", "Green logistics", "Total cost", "Operations research", "Sustainable development", "Computer science" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5267/j.ijiec.2022.9.002" }, { "id": "https://openalex.org/W4386737505", "doi": "10.1371/journal.pone.0291473", "title": "A hybrid adaptive large neighborhood search for time-dependent open electric vehicle routing problem with hybrid energy replenishment strategies", "year": 2023, "publication_date": "2023-09-14", "type": "article", "language": "en", "authors": [ "Lijun Fan" ], "first_author": "Lijun Fan", "venue": "PLoS ONE", "publisher": "Public Library of Science", "abstract": "As competition intensifies, an increasing number of companies opt to outsource their package distribution operations to professional Third-Party Logistics (3PL) fleets. In response to the growing concern over urban pollution, 3PL fleets have begun to deploy Electric Vehicles (EVs) to perform transportation tasks. This paper aims to address the Time-Dependent Open Electric Vehicle Routing Problem with Hybrid Energy Replenishment Strategies (TDOEVRP-HERS) in the context of urban distribution. The study considers the effect of dynamic urban transport networks on EV energy drain and develops an approach for estimating energy consumption. Meanwhile, the research further empowers 3PL fleets to judiciously oscillate between an array of energy replenishment techniques, encompassing both charging and battery swapping. Based on these insights, a Mixed-Integer Programming (MIP) model with the objective of minimizing total distribution costs incurred by the 3PL fleet is formulated. Given the characteristics of the model, a Hybrid Adaptive Large Neighborhood Search (HALNS) is designed, synergistically integrating the explorative prowess of Ant Colony Optimization (ACO) with the localized search potency of Adaptive Large Neighborhood Search (ALNS). The strategic blend leverages the broad-based solution initiation of ACO as a foundational layer for ALNS's deeper, nuanced refinements. Numerical experiments on a spectrum of test sets corroborate the efficacy of the HALNS: it proficiently designs vehicular itineraries, trims down EV energy requisites, astutely chooses appropriate energy replenishment avenues, and slashes logistics-related outlays. Therefore, this work not only introduces a new hybrid heuristic technique within the EVRP field, providing high-quality solutions but also accentuates its pivotal role in fostering a sustainable trajectory for urban logistics transportation.", "keywords": [ "Context (archaeology)", "Computer science", "Vehicle routing problem", "Electric vehicle", "Operations research", "Mathematical optimization", "Heuristic", "Metaheuristic", "Routing (electronic design automation)", "Engineering", "Artificial intelligence", "Mathematics" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0291473&type=printable" }, { "id": "https://openalex.org/W2888522242", "doi": "10.1016/j.simpat.2018.08.006", "title": "Smart urban freight transport: tools for planning and optimising delivery operations", "year": 2018, "publication_date": "2018-08-22", "type": "article", "language": "en", "authors": [ "Antonio Comi", "Massimiliano Maria Schiraldi", "Berta Buttarazzi" ], "first_author": "Antonio Comi", "venue": "Simulation Modelling Practice and Theory", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Sustainability", "Reservation", "Transport engineering", "Telematics", "Seven Management and Planning Tools", "Routing (electronic design automation)", "Computer science", "Transportation planning", "Operations research", "Engineering", "Operations management", "Computer network" ], "cited_by_count": 86, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1569190X18301217/pdf" }, { "id": "https://openalex.org/W3175228486", "doi": "10.1016/j.scs.2021.103105", "title": "Planning a mixed fleet of electric and conventional vehicles for urban freight with routing and replacement considerations", "year": 2021, "publication_date": "2021-06-17", "type": "article", "language": "en", "authors": [ "Reema Al-Dalain", "Dilay Çelebi" ], "first_author": "Reema Al-Dalain", "venue": "Sustainable Cities and Society", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Transport engineering", "Fleet management", "Constraint (computer-aided design)", "Electric vehicle", "Traffic management", "Routing (electronic design automation)", "Driving range", "Vehicle routing problem", "Range (aeronautics)", "Battery electric vehicle", "Sustainability", "Automotive engineering" ], "cited_by_count": 49, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.scs.2021.103105" }, { "id": "https://openalex.org/W2015629733", "doi": "10.1016/j.trc.2011.11.004", "title": "Floating car based travel times for city logistics", "year": 2011, "publication_date": "2011-12-14", "type": "article", "language": "en", "authors": [ "Jan Fabian Ehmke", "Stephan Meisel", "Dirk Christian Mattfeld" ], "first_author": "Jan Fabian Ehmke", "venue": "Transportation Research Part C Emerging Technologies", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Routing (electronic design automation)", "City logistics", "Computer science", "Quality (philosophy)", "Transport engineering", "Volume (thermodynamics)", "Vehicle routing problem", "Operations research", "Computer network", "Data mining", "Engineering" ], "cited_by_count": 80, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trc.2011.11.004" }, { "id": "https://openalex.org/W4381095295", "doi": "10.1007/s10472-023-09858-x", "title": "A hybrid simulated annealing and variable neighborhood search algorithm for the close-open electric vehicle routing problem", "year": 2023, "publication_date": "2023-06-17", "type": "article", "language": "en", "authors": [ "Themistoklis Stamadianos", "Nikolaos A. Kyriakakis", "Magdalene Marinaki", "Yannis Marinakis" ], "first_author": "Themistoklis Stamadianos", "venue": "Annals of Mathematics and Artificial Intelligence", "publisher": "Springer Science+Business Media", "abstract": "Abstract Electric Vehicles (EVs) are the future of transportation, but due to their battery and charging technology they cannot yet directly replace traditional vehicles. Nonetheless, EVs are a great option for city-logistics, due to the small distances and their zero local emissions. In this paper, a novel variant of the Electric Vehicle Routing Problem (EVRP), called Close-Open EVRP (COEVRP), is presented. It considers ending EV trips at Charging Stations, as opposed to other EVRP variants that only allow for en-route charging. This new variant follows a traditional routing scheme, allowing EVs to recharge only at the end of their route. The objective is to minimize energy consumption, as well as the number of vehicles. The energy consumption function takes into account the weight of the transported items. A mathematical formulation for the problem is presented and small instances were solved using a commercial solver. To solve larger instances, a hybrid metaheuristic combining Simulated Annealing and Variable Neighborhood Search algorithm was employed and thoroughly tested.", "keywords": [ "Simulated annealing", "Mathematical optimization", "Solver", "Electric vehicle", "Variable neighborhood search", "Computer science", "Metaheuristic", "Vehicle routing problem", "Energy consumption", "Variable (mathematics)", "Routing (electronic design automation)", "Battery electric vehicle" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s10472-023-09858-x.pdf" }, { "id": "https://openalex.org/W1579291420", "doi": "10.1155/2015/302867", "title": "Conventional, Hybrid, or Electric Vehicles: Which Technology for an Urban Distribution Centre?", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Philippe Lebeau", "Cedric De Cauwer", "Joeri Van Mierlo", "Cathy Macharis", "Wouter Verbeke", "Thierry Coosemans" ], "first_author": "Philippe Lebeau", "venue": "The Scientific World JOURNAL", "publisher": "Hindawi Publishing Corporation", "abstract": "Freight transport has an important impact on urban welfare. It is estimated to be responsible for 25% of CO2 emissions and up to 50% of particles matters generated by the transport sector in cities. Facing that problem, the European Commission set the objective of reaching free CO2 city logistics by 2030 in major urban areas. In order to achieve this goal, electric vehicles could be an important part of the solution. However, this technology still faces a number of barriers, in particular high purchase costs and limited driving range. This paper explores the possible integration of electric vehicles in urban logistics operations. In order to answer this research question, the authors have developed a fleet size and mix vehicle routing problem with time windows for electric vehicles. In particular, an energy consumption model is integrated in order to consider variable range of electric vehicles. Based on generated instances, the authors analyse different sets of vehicles in terms of vehicle class (quadricycles, small vans, large vans, and trucks) and vehicle technology (petrol, hybrid, diesel, and electric vehicles). Results show that a fleet with different technologies has the opportunity of reducing costs of the last mile.", "keywords": [ "Truck", "Transport engineering", "Vehicle routing problem", "Electric vehicle", "Order (exchange)", "Range (aeronautics)", "Driving range", "Automotive engineering", "City logistics", "Computer science", "Diesel fuel", "Fuel efficiency" ], "cited_by_count": 92, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/tswj/2015/302867.pdf" }, { "id": "https://openalex.org/W2593437733", "doi": "10.1016/j.cor.2016.06.014", "title": "A large neighbourhood based heuristic for two-echelon routing problems", "year": 2016, "publication_date": "2016-06-28", "type": "article", "language": "en", "authors": [ "U. Breunig", "Verena Schmid", "Richard F. Hartl", "Thibaut Vidal" ], "first_author": "U. Breunig", "venue": "Computers & Operations Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Benchmark (surveying)", "Computer science", "Vehicle routing problem", "Routing (electronic design automation)", "Context (archaeology)", "Heuristic", "Metaheuristic", "Mathematical optimization", "Neighbourhood (mathematics)", "Operations research", "Algorithm", "Artificial intelligence" ], "cited_by_count": 170, "is_retracted": false, "is_paratext": false, "open_access_url": "https://arxiv.org/pdf/1505.08003" }, { "id": "https://openalex.org/W4391840327", "doi": "10.3390/wevj15020069", "title": "Heuristic Algorithms for Heterogeneous and Multi-Trip Electric Vehicle Routing Problem with Pickup and Delivery", "year": 2024, "publication_date": "2024-02-15", "type": "article", "language": "en", "authors": [ "Li Wang", "Yifan Ding", "Zhiyuan Chen", "Zhiyuan Su", "Yufeng Zhuang" ], "first_author": "Li Wang", "venue": "World Electric Vehicle Journal", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "In light of the widespread use of electric vehicles for urban distribution, this paper delves into the electric vehicle routing problem (EVRP): specifically addressing multiple trips per vehicle, diverse vehicle types, and simultaneous pickup and delivery. The primary objective is to minimize the overall cost, which encompasses travel expenses, waiting times, recharging costs, and fixed vehicle costs. The focal problem is formulated as a heterogeneous and multi-trip electric vehicle routing problem with pickup and delivery (H-MT-EVRP-PD). Additionally, we introduce two heuristic algorithms to efficiently approximate solutions within a reasonable computational time. The variable neighborhood search (VNS) algorithm and the adaptive large neighborhood search (ALNS) algorithm are presented and compared based on our computational experiences with both. Through solving a series of large-scale real-world instances for the H-MT-EVRP-PD and smaller instances using an exact method, we demonstrate the efficacy of the proposed approaches.", "keywords": [ "Vehicle routing problem", "Pickup", "Variable neighborhood search", "Computer science", "Heuristic", "Routing (electronic design automation)", "Electric vehicle", "Mathematical optimization", "Algorithm", "Variable (mathematics)", "TRIPS architecture", "Local search (optimization)" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2032-6653/15/2/69/pdf?version=1707988928" }, { "id": "https://openalex.org/W4400776155", "doi": "10.1287/trsc.2023.0261", "title": "The Vehicle Routing Problem with Access Restrictions", "year": 2024, "publication_date": "2024-07-18", "type": "article", "language": "en", "authors": [ "Munise Kübra Şahin", "Hande Yaman" ], "first_author": "Munise Kübra Şahin", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "To mitigate the negative effects of freight vehicles on urban areas, many cities have implemented road accessibility restrictions, including limited traffic zones, which restrict access to specific areas during certain times of the day. Implementing these zones creates a tradeoff between the delivery cost and time, even under the assumption of equal traversal time and travel cost. Consequently, the planners in charge of vehicle routing need to work with graphs containing information on all Pareto-optimal paths. Inspired by these changes in city logistics and the resulting computational challenges, we study the vehicle routing problem with access restrictions, where some streets are closed to traffic within a given time period. We formulate this problem using workday variables and propose two branch and price algorithms based on the underlying road network and multigraph. The results of our computational experiments demonstrate the effectiveness of the proposed algorithms, solving instances with up to 100 nodes and 33 customers, and underline the importance of considering alternative paths in reducing costs. Funding: This work was supported by KU Leuven [C14/22/026].", "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "Transport engineering", "Computer science", "Operations research", "Computer network", "Business", "Engineering" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.2023.0261" }, { "id": "https://openalex.org/W2768235228", "doi": "10.1016/j.trd.2017.11.007", "title": "A framework to evaluate policy options for supporting electric vehicles in urban freight transport", "year": 2017, "publication_date": "2017-11-16", "type": "article", "language": "en", "authors": [ "Seyed Mostafa Mirhedayatian", "Shiyu Yan" ], "first_author": "Seyed Mostafa Mirhedayatian", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Subsidy", "Externality", "Traffic congestion", "Business", "Transport engineering", "Service (business)", "Welfare", "Environmental economics", "Social Welfare", "Population", "City logistics", "Public economics" ], "cited_by_count": 74, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trd.2017.11.007" }, { "id": "https://openalex.org/W2142730013", "doi": null, "title": "Data allocation and application for time-dependent vehicle routing in city logistics", "year": 2010, "publication_date": "2010-12-01", "type": "article", "language": "en", "authors": [ "Jan Fabian Ehmke", "Dirk Christian Mattfeld" ], "first_author": "Jan Fabian Ehmke", "venue": null, "publisher": null, "abstract": "In city logistics, service providers have to consider dynamics within logistics processes in order to \\nachieve higher schedule reliability and delivery flexibility. To this end, city logistics routing demands for \\ntime-dependent travel time estimates and time-dependent optimization models. We consider the process \\nof allocation and application of empirical traffic data for time-dependent vehicle routing in city logistics \\nwith respect to its usage. Telematics based traffic data collection and the conversion from raw empirical \\ntraffic data into information models are discussed. A city logistics scenario points out the applicability of \\nthe information models provided, which are based on huge amounts of real traffic data (FCD). Thus, the \\nbenefits of time-dependent planning in contrast to common static planning methods can be demonstrated.", "keywords": [ "Schedule", "Vehicle routing problem", "Computer science", "Telematics", "City logistics", "Routing (electronic design automation)", "Operations research", "Flexibility (engineering)", "Traffic management", "Reliability (semiconductor)", "Transport engineering", "Process (computing)" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.openstarts.units.it/bitstream/10077/6163/1/46D_EhmkeMattfeld.pdf" }, { "id": "https://openalex.org/W4200302128", "doi": "10.1155/2021/5539762", "title": "Collaborative Vehicle Routing Problem in the Urban Ring Logistics Network under the COVID-19 Epidemic", "year": 2021, "publication_date": "2021-12-21", "type": "article", "language": "en", "authors": [ "Wenjia Zheng", "Zhongyu Wang", "Liucheng Sun" ], "first_author": "Wenjia Zheng", "venue": "Mathematical Problems in Engineering", "publisher": "Hindawi Publishing Corporation", "abstract": "This paper explored the problem of collaborative vehicle routing in the urban ring logistics network (Co-VRP-URLN) during the COVID-19 epidemic. According to the characteristics of urban distribution and the restriction of traffic all over China during this period, this study mainly considers a common distribution mode of order exchange through the outer ring of the city and then solves the vehicle routing problem of distribution, which belongs to a special multidepot vehicle routing problem with time windows. According to the definition of the problem, the corresponding mixed-integer programming problem of multicommodity flow is established, and the variable neighborhood search algorithm is designed in detail to solve it. The effectiveness of the algorithm is verified by a standard example, and the benefits of joint distribution are revealed through the improved standard example. At last, the influence of different distribution centers is compared. The results show that this model can significantly improve the distribution efficiency within the city under the restriction of traffic.", "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "City logistics", "Distribution (mathematics)", "Integer programming", "Computer science", "Mode (computer interface)", "Mathematical optimization", "Traffic flow (computer networking)", "Variable (mathematics)", "Operations research", "Computer network" ], "cited_by_count": 11, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/mpe/2021/5539762.pdf" }, { "id": "https://openalex.org/W2890163274", "doi": "10.1051/matecconf/201820407007", "title": "Vehicle Routing Problem (VRP) for courier service: A review", "year": 2018, "publication_date": "2018-01-01", "type": "conference-paper", "language": "en", "authors": [ "Citra Dewi Purnamasari", "Amelia Santoso" ], "first_author": "Citra Dewi Purnamasari", "venue": "MATEC Web of Conferences", "publisher": "EDP Sciences", "abstract": "The internet development access is really very fast and change all aspects for life activities include buying and selling transactions of goods or services that can arrange online or also called e-commerce which courier service influence. The courier basic operational is logistics of a supply chain. Transportation is a vital component in logistics management because it becomes the largest cost component in its activities that is about 50-60% of the total logistics costs. The purpose of this study is to find out what kind of vehicle routing problem (VRP) is used for courier service so can be used as reference for further research. Collect and selection process found 40 science journals for analyse. There has been a lot of research about the shortest route problem for courier service or can also called city logistics with VRP which the optimum solution obtained with heuristic and metaheuristic algorithm. Result found VRP type often used for courier service are dynamic VRP (DVRP) and VRP with time window (VRPTW) or can merging both dynamic VRP with time window (DVRPTW).", "keywords": [ "Vehicle routing problem", "Service (business)", "Computer science", "Operations research", "Heuristic", "Metaheuristic", "Process (computing)", "Routing (electronic design automation)", "Transport engineering", "Business", "Engineering", "Computer network" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.matec-conferences.org/articles/matecconf/pdf/2018/63/matecconf_imiec2018_07007.pdf" }, { "id": "https://openalex.org/W2757788779", "doi": "10.1108/ijlm-05-2016-0123", "title": "Analyzing the diffusion of eco-friendly vans for urban freight distribution", "year": 2017, "publication_date": "2017-09-29", "type": "article", "language": "en", "authors": [ "Anna Corinna Cagliano", "Antonio Carlin", "Giulio Mangano", "Carlo Rafele" ], "first_author": "Anna Corinna Cagliano", "venue": "The International Journal of Logistics Management", "publisher": "Emerald Publishing Limited", "abstract": "Purpose The purpose of this paper is to investigate the diffusion dynamics of electric and hybrid commercial vans and its enabling factors in the city logistics (CL) contexts. The case of parcel delivery in Torino, Italy, is considered. Attention is paid to the influence on the choice of low impact vehicles of not only public strategies but also operational aspects characterizing urban freight distribution systems. Design/methodology/approach A System Dynamics model based on the Bass diffusion theory computes the number of adopters of low-emission vehicles together with the quantity of vans required and the associated economic savings. The model includes variables about freight demand, delivery frequency, van carrying capacity, routes, stops, distances traveled, and vehicle charging stations. A sensitivity analysis has been completed to identify the main diffusion levers. The focus is on advertising and other drivers, such as public contributions, taxes traditional polluting vehicles are subjected to, as well as on routing optimization strategies. Findings Advertising programs, green image, and word-of-mouth drive market saturation, although in a long time period. In fact, low-impact vehicles do not offer any economic advantage over traditional ones requiring higher investment and operating costs. Public incentives to purchase both green vehicles and charging stations, together with carbon taxes and a congestion charge affecting polluting vehicles, are able to shorten the adoption time. In particular, public intervention reveals to be effective only when it unfolds through a number of measures that both facilitate the use of environmentally friendly vehicles and discourage the adoption of traditional commercial vans. Route optimization also hastens the complete market saturation. Research limitations/implications This work fosters research about the mutual relationships between the diffusion of low-emission commercial vehicles and the operational and contextual CL factors. It provides a structured approach for investigating the feasibility of innovative good vehicles that might be part of assessments of CL measures and requirements. Finally, the model supports studies about the cooperation among stakeholders to identify effective commercial vehicle fleets. Practical implications This study fosters collaboration among CL players by providing a roadmap to identify the key factors for the diffusion of environmentally friendly freight vehicles. It also enables freight carriers to assess the operational and economic feasibility of adopting low-impact vehicles. Finally, it might assist public authorities in capturing the effects of new urban transportation policies prior to their implementation. Originality/value Most of the current CL literature defines policies and analyzes their effects. Also, there are several contributions on the diffusion of low emission cars. The present study is one of the first works on the diffusion of low-impact commercial vehicles in urban areas by considering the associated key operational factors. A further value is that the proposed model combines operational variables with economic and environmental issues.", "keywords": [ "Incentive", "Business", "Environmentally friendly", "Public transport", "Congestion pricing", "Transport engineering", "Distribution (mathematics)", "Environmental economics", "Traffic congestion", "Economics", "Engineering" ], "cited_by_count": 59, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/ijlm-05-2016-0123" }, { "id": "https://openalex.org/W3008879938", "doi": "10.1016/j.procs.2020.03.159", "title": "Electrification of Urban Freight Transport - a Case Study of the Food Retailing Industry", "year": 2020, "publication_date": "2020-01-01", "type": "conference-paper", "language": "en", "authors": [ "Kai Martins-Turner", "Alexander Grahle", "Kai Nagel", "Dietmar Göhlich" ], "first_author": "Kai Martins-Turner", "venue": "Procedia Computer Science", "publisher": "Elsevier BV", "abstract": "Decarbonisation is a major challenge for the coming decades, for all industries, including the transport sector. Battery electric vehicles are a potential solution for the transport sector to reduce its carbon impact. Asides from the question whether there is sufficient supply of electric vehicles for freight transport, it is also unclear whether battery-powered trucks meet the practical requirements, especially in terms of their driving range. To investigate this, synthetic tours were generated by solving a Vehicle Routing Problem (VRP). This also generates the fleet size and composition depending on a set of different vehicle types. The network with underlying traffic conditions comes from an publicly available transport model. The generated tours are then simulated with an open-source transport simulation (MATSim), for both diesel and battery electric vehicles (BEVs). In a sensitivity study, two different purchase prices were considered for calculating vehicle costs. The case study uses a model of the food retailing industry for the city of Berlin. 56% of the tours can be driven without recharging. When recharged one time, 90% of the tours are suitable for BEVs. The costs for transporting the goods will increase by 17 to 23% depending on the assumption for the purchase prices for the BEVs. Using a well-to-wheel calculation, the electrification of all tours leads to a reduction of greenhouse gas (GHG) emissions by 26 to 96% depending on the assumed electricity production.", "keywords": [ "Electrification", "Truck", "Battery (electricity)", "Greenhouse gas", "Electricity", "Computer science", "Automotive engineering", "Range (aeronautics)", "Driving range", "Electric vehicle", "Diesel fuel", "Transport engineering" ], "cited_by_count": 55, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877050920306177/pdf" }, { "id": "https://openalex.org/W1971034919", "doi": "10.1061/(asce)up.1943-5444.0000099", "title": "Estimation of Daily Vehicle Flows for Urban Freight Deliveries", "year": 2011, "publication_date": "2011-07-20", "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": "Journal of Urban Planning and Development", "publisher": "American Society of Civil Engineers", "abstract": "Given its contribution to congestion, pollution, and energy consumption and the complex and changing characteristics of delivery routes, the modeling of urban freight transport is a difficult, highly data-demanding and often unreliable task. Extending other previous works that focused only on the morning peak hour, the authors have developed a trip generation model by using the available data to their maximum extent and adding other parameters that can be found through simple surveys. This trip generation model is then included as part of a four-stage process, with the trip distribution solved through entropy maximization and resulting in the estimation of an origin-destination matrix for freight transport in a city. The application to a case study in the city of Seville and the validation with on-street vehicle counts shows reasonably robust results and provides a simple and effective tool to analyze urban freight deliveries from a macroscopic point of view.", "keywords": [ "Entropy maximization", "Computer science", "Estimation", "Maximization", "Energy consumption", "Transport engineering", "Principle of maximum entropy", "Environmental science", "Mathematical optimization", "Engineering", "Mathematics" ], "cited_by_count": 58, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1061/(asce)up.1943-5444.0000099" }, { "id": "https://openalex.org/W4394626656", "doi": "10.1504/ijstl.2024.137895", "title": "Stochastic two-echelon vehicle routing problem with time windows: city logistics case study", "year": 2024, "publication_date": "2024-01-01", "type": "article", "language": "en", "authors": [ "Angie Ramirez Villamil", "Jairo R. Montoya‐Torres", "Anicia Jaegler", "Yosimar Diaz" ], "first_author": "Angie Ramirez Villamil", "venue": "International Journal of Shipping and Transport Logistics", "publisher": "Inderscience Publishers", "abstract": "The two-echelon capacitated vehicle routing problem (2E-CVRP) is a popular modelling approach used for solving urban logistics problems. Its aim is to handle freight distribution starting at a depot that supplies satellites or consolidation centres, and then to customers. Inspired by a case study, this work studies a 2E-CVRP variant with heterogeneous fleet of vehicles between echelons and limited loading capacity and time windows. The objective is the minimisation of the travel time. To deal with the computational complexity of the problem, a decomposition algorithm based on mixed integer linear programming (MILP) to solve the deterministic version is proposed. Also, a simheuristic is designed to solve its stochastic version. Experiments are carried out using real data of a case study in the city of Bogota, Colombia. Results show the impact of different freight delivery scenarios, providing insights for efficient decision-making.", "keywords": [ "Vehicle routing problem", "Computer science", "Business", "Operations research", "Operations management", "Routing (electronic design automation)", "Economics", "Computer network", "Mathematics" ], "cited_by_count": 5, "is_retracted": false, "is_paratext": false, "open_access_url": "https://hdl.handle.net/10818/62761" }, { "id": "https://openalex.org/W2769854990", "doi": "10.1080/00207543.2017.1401235", "title": "A heterogeneous fleet two-echelon capacitated location-routing model for joint delivery arising in city logistics", "year": 2017, "publication_date": "2017-11-17", "type": "article", "language": "en", "authors": [ "Quanwu Zhao", "Wei Wang", "Robert de Souza" ], "first_author": "Quanwu Zhao", "venue": "International Journal of Production Research", "publisher": "Taylor & Francis", "abstract": "This paper focuses on optimisation issue in designing urban logistics network for joint delivery alliances in parcel delivery industry, explicitly taking into account heterogeneous fleet and practices of joint delivery alliances in China. The objective is to determine the set of Intermediate Depots (IDs) to open and the allocation of city logistics terminals to minimise a total cost comprised of the set-up costs of IDs and the total variable cost of routes under joint delivery. A powerful cooperative approximation heuristic algorithm is developed and a comparative analysis is performed with three published approaches based on the well-known benchmark instances in this field. The results suggest that the proposed method can find good solutions in a reasonable amount of time for most data-sets. The proposed method has also been successfully applied to an industrial case for a joint delivery alliance in Chongqing, China. Comprehensively analysis are conducted between joint delivery and separate delivery, heterogeneous and homogeneous fleets, considering the carbon emissions or not, and demand variations.", "keywords": [ "Computer science", "Benchmark (surveying)", "Operations research", "Heuristic", "Joint (building)", "Homogeneous", "Routing (electronic design automation)", "Set (abstract data type)", "Delivery Performance", "Vehicle routing problem", "Engineering", "Industrial engineering" ], "cited_by_count": 55, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1080/00207543.2017.1401235" }, { "id": "https://openalex.org/W2273882117", "doi": "10.1016/j.trpro.2016.02.061", "title": "A Column Generation Based Heuristic for the Multicommodity-ring Vehicle Routing Problem", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Paolo Gianessi", "Laurent Alfandari", "Lucas Létocart", "Roberto Wolfler Calvo" ], "first_author": "Paolo Gianessi", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "We study a new routing problem arising in City Logistics. Given a ring connecting a set of urban distribution centers (UDCs) in the outskirts of a city, the problem consists in delivering goods from virtual gates located outside the city to the customers inside of it. Goods are transported from a gate to a UDC, then either go to another UDC before being delivered to customers or are directly shipped from the first UDC. The reverse process occurs for pick-up. Routes are performed by electric vans and may be open. The objective is to find a set of routes that visit each customer and to determine ring and gates-UDC flows so that the total transportation and routing cost is minimized. We solve this problem using a column generation-based heuristic, which is tested over a set of benchmark instances issued from a more strategic location-routing problem.", "keywords": [ "Column generation", "Routing (electronic design automation)", "Heuristic", "Benchmark (surveying)", "Vehicle routing problem", "Set (abstract data type)", "Mathematical optimization", "Computer science", "Process (computing)", "Column (typography)", "Ring (chemistry)", "Operations research" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146516000624/pdf" }, { "id": "https://openalex.org/W4285731861", "doi": "10.1177/03611981221103596", "title": "Last-Mile Strategies for Urban Freight Delivery: A Systematic Review", "year": 2022, "publication_date": "2022-07-17", "type": "review", "language": "en", "authors": [ "Torrey Lyons", "Noreen McDonald" ], "first_author": "Torrey Lyons", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "Trends in retail and e-commerce have led to greater demand for urban freight and last-mile deliveries. This is a concern for urban planners, parcel carriers, and citizens as they struggle to cope with the demands that increased freight flows create in an urban context. This topic has also seen a corresponding expansion in the academic literature as researchers propose solutions to the problem of last-mile delivery. We conduct a systematic review of the literature to identify innovative last-mile delivery strategies as well as ways that those strategies are evaluated by researchers. This study will help academics as they consider directing future research as well as practitioners as they assess how delivery patterns may shift. We identify 22 last-mile delivery strategies and group them into four categories: innovative vehicles, urban goods consolidation, technological and routing advances in city logistics, and emerging planning tools and policies. We find that urban consolidation centers, freight bicycles, and collaborative logistics are the strategies that have received the most attention to date. Analyses of these options has focused on operational, environmental, social, and economic impacts with operational efficiency, emissions, and congestion being the three evaluation criteria discussed most in the literature. We propose that safety has not been adequately considered as a means for evaluating last-mile delivery strategies and should be a higher-priority focus for urban freight research going forward.", "keywords": [ "Last mile (transportation)", "City logistics", "Transport engineering", "Context (archaeology)", "Traffic congestion", "Business", "Consolidation (business)", "Mile", "Paratransit", "Traffic management", "Urban planning", "Environmental planning" ], "cited_by_count": 56, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1177/03611981221103596" }, { "id": "https://openalex.org/W1549231257", "doi": "10.3390/su7066610", "title": "Urban Freight Truck Routing under Stochastic Congestion and Emission Considerations", "year": 2015, "publication_date": "2015-05-26", "type": "article", "language": "en", "authors": [ "Taesung Hwang", "Yanfeng Ouyang" ], "first_author": "Taesung Hwang", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Freight trucks are known to be a major source of air pollutants as well as greenhouse gas emissions in U.S. metropolitan areas, and they have significant effects on air quality and global climate change. Emissions from freight trucks during their deliveries should be considered by the trucking service sector when they make routing decisions. This study proposes a model that incorporates total delivery time, various emissions including CO2, VOC, NOX, and PM from freight truck activities, and a penalty for late or early arrival into the total cost objective of a stochastic shortest path problem. We focus on urban transportation networks in which random congestion states on each link follows an independent probability distribution. Our model finds the best truck routing on a given network so as to minimize the expected total cost. This problem is formulated into a mathematical model, and two solution algorithms including a dynamic programming approach and a deterministic shortest path heuristic are proposed. Numerical examples show that the proposed approach performs very well even for the large-size U.S. urban networks.", "keywords": [ "Truck", "Metropolitan area", "Routing (electronic design automation)", "Transport engineering", "Shortest path problem", "Computer science", "Heuristic", "Greenhouse gas", "Traffic congestion", "Vehicle routing problem", "Air quality index", "Operations research" ], "cited_by_count": 32, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/7/6/6610/pdf?version=1432639963" }, { "id": "https://openalex.org/W2889207336", "doi": "10.4230/oasics.atmos.2018.11", "title": "A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem", "year": 2018, "publication_date": "2018-01-01", "type": "article", "language": "en", "authors": [ "Youcef Amarouche", "Rym Nesrine Guibadj", "Aziz Moukrim" ], "first_author": "Youcef Amarouche", "venue": "DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)", "publisher": "Schloss Dagstuhl – Leibniz Center for Informatics", "abstract": "The Two-Echelon Vehicle Routing Problem (2E-VRP) is a variant of the classical vehicle routing problem arising in the context of city logistics. In the 2E-VRP, freight from a main depot is delivered to final customers using intermediate facilities, called satellites. In this paper, we propose a new hybrid heuristic method for solving the 2E-VRP that relies on two components. The first component effectively explores the search space in order to discover a set of interesting routes. The second recombines the discovered routes into high-quality solutions. Experimentations on benchmark instances show the performance of our approach: our algorithm achieves high-quality solutions in short computational times and improves the current best known solutions for several large scale instances.", "keywords": [ "Cover (algebra)", "Vehicle routing problem", "Heuristic", "Set cover problem", "Routing (electronic design automation)", "Set (abstract data type)", "Computer science", "Mathematical optimization", "Artificial intelligence", "Mathematics", "Engineering", "Computer network" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://drops.dagstuhl.de/storage/01oasics/oasics-vol065-atmos2018/OASIcs.ATMOS.2018.11/OASIcs.ATMOS.2018.11.pdf" }, { "id": "https://openalex.org/W3101333365", "doi": "10.1088/1742-6596/1626/1/012097", "title": "Vehicle Routing Problem with Time Windows Arising in Urban Delivery", "year": 2020, "publication_date": "2020-10-01", "type": "conference-paper", "language": "en", "authors": [ "Can Cao", "Xiangfei Zhang", "Zhanyuan Guo" ], "first_author": "Can Cao", "venue": "Journal of Physics Conference Series", "publisher": "IOP Publishing", "abstract": "Abstract Delivery is an important part of logistics operation. The way to plan the vehicle route with consideration of the demand, time window and total travel cost will directly affect the operation cost and the efficiency of delivery. In this paper, a mathematical model of the vehicle routing with time windows arising in urban delivery was formulated, and Clarke and Wright saving algorithm was used to solve it. A real case of a company was used to test its performance. The result shows that the Clarke and Wright saving algorithm is more effective than the actual operation of the company.", "keywords": [ "Vehicle routing problem", "Wright", "Computer science", "Routing (electronic design automation)", "Plan (archaeology)", "Operations research", "City logistics", "Window (computing)", "Travel time", "Simulation", "Transport engineering", "Mathematical optimization" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://iopscience.iop.org/article/10.1088/1742-6596/1626/1/012097/pdf" }, { "id": "https://openalex.org/W2058742269", "doi": "10.1007/s12351-010-0100-4", "title": "Data envelopment analysis models to support the selection of vehicle routing software for city logistics operations", "year": 2010, "publication_date": "2010-12-21", "type": "article", "language": "en", "authors": [ "Yiannis Smirlis", "Vasileios Zeimpekis", "George Kaimakamis" ], "first_author": "Yiannis Smirlis", "venue": "Operational Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Computer science", "Software", "Routing (electronic design automation)", "Vehicle routing problem", "Data envelopment analysis", "Operations research", "Selection (genetic algorithm)", "Computational intelligence", "Variety (cybernetics)", "Artificial intelligence", "Engineering", "Mathematical optimization" ], "cited_by_count": 15, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s12351-010-0100-4" }, { "id": "https://openalex.org/W2974874797", "doi": "10.4018/ijban.2019100101", "title": "Performance Comparison of Two Recent Heuristics for Green Time Dependent Vehicle Routing Problem", "year": 2019, "publication_date": "2019-09-20", "type": "article", "language": "en", "authors": [ "Mehmet Soysal", "Mustafa Çi̇men", "Mine Ömürgönülşen", "Sedat Belbağ" ], "first_author": "Mehmet Soysal", "venue": "International Journal of Business Analytics", "publisher": "IGI Global", "abstract": "This article concerns a green Time Dependent Capacitated Vehicle Routing Problem (TDCVRP) which is confronted in urban distribution planning. The problem is formulated as a Markovian Decision Process and a dynamic programming (DP) approach has been used for solving the problem. The article presents a performance comparison of two recent heuristics for the green TDCVRP that explicitly accounts for time dependent vehicle speeds and fuel consumption (emissions). These heuristics are the classical Restricted Dynamic Programming (RDP) algorithm, and the Simulation Based RDP that consists of weighted random sampling, RDP heuristic and simulation. The numerical experiments show that the Simulation Based Restricted Dynamic Programming heuristic can provide promising results within relatively short computational times compared to the classical Restricted Dynamic Programming for the green TDCVRP.", "keywords": [ "Heuristics", "Vehicle routing problem", "Heuristic", "Mathematical optimization", "Dynamic programming", "Routing (electronic design automation)", "Computer science", "Fuel efficiency", "Process (computing)", "Sampling (signal processing)", "Mathematics", "Engineering" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.4018/ijban.2019100101" }, { "id": "https://openalex.org/W3165356636", "doi": "10.3390/app11114790", "title": "A Proposal and Analysis of New Realistic Sets of Benchmark Instances for Vehicle Routing Problems with Asymmetric Costs", "year": 2021, "publication_date": "2021-05-23", "type": "article", "language": "en", "authors": [ "Keyju Lee", "Junjae Chae" ], "first_author": "Keyju Lee", "venue": "Applied Sciences", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Despite their 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 Korea, is used. This paper also analyzes some important issues prevailing in urban transportation environments. These include the challenges of accounting for the frequency and distance in which air travel differs from reality when measuring closeness, the differences in distance and time for outgoing and return trips, and the rough conversion ratios from air distance to road distance and to road time. This paper contributes to the research community by providing more realistic ACVRP benchmark instances that reflect urban transportation environments. In addition, the cost matrix analyses provide insights into the behaviors of urban road networks.", "keywords": [ "Benchmark (surveying)", "Closeness", "TRIPS architecture", "Computer science", "Routing (electronic design automation)", "Distance matrix", "Operations research", "Transport engineering", "Geography", "Engineering", "Mathematics", "Computer network" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2076-3417/11/11/4790/pdf?version=1621784476" }, { "id": "https://openalex.org/W2958836259", "doi": "10.1016/j.trpro.2019.06.044", "title": "Creating safer routing for urban freight transportation", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Oleksii Prasolenko", "Dmytro Burko", "Illya Tolmachov", "Nizami Gyulyev", "Anrii Galkin", "Oleksii Lobashov" ], "first_author": "Oleksii Prasolenko", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "The article examines the impact of traffic conditions on truck drivers. To assess driver’s state the galvanic skin response (GSR) method and the electrocardiogram method (ECG), based on heart rate variability assessment, are used. Obtained results show that the degree of danger in a real driving situation can be estimated through changing driver’s functional state as responding reaction on variations of limits characteristics of driver’s state. GSR response occurs instantly when the driver is exposed to the following factors (events): driving in congested traffic; inhibition of the car moving ahead; change of lane of the leading moving car; lane change and the choice of the movement direction by the driver; car parking along the road; density of traffic flow; pedestrian appearance while driving; maneuvering at crossroads, etc. The cardiac rhythm also shows a change from the above-listed factors which is manifested in a heart rate shift from the initial values before starting the trip by the driver. The proposed method can be used to compile safe traffic routing in urban freight transportation conditions including human factors.", "keywords": [ "Transport engineering", "SAFER", "Pedestrian", "Truck", "Traffic flow (computer networking)", "Routing (electronic design automation)", "Computer science", "Automotive engineering", "Simulation", "Engineering", "Computer security", "Computer network" ], "cited_by_count": 21, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146519301322/pdf" }, { "id": "https://openalex.org/W4206900180", "doi": "10.1007/s12652-022-03696-1", "title": "Solving a 3-dimensional vehicle routing problem with delivery options in city logistics using fast-neighborhood based crowding differential evolution algorithm", "year": 2022, "publication_date": "2022-01-24", "type": "article", "language": "en", "authors": [ "Mu‐Chen Chen", "Sinjana Yerasani", "Manoj Kumar Tiwari" ], "first_author": "Mu‐Chen Chen", "venue": "Journal of Ambient Intelligence and Humanized Computing", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Computer science", "Vehicle routing problem", "Computational intelligence", "Last mile (transportation)", "Convergence (economics)", "Routing (electronic design automation)", "Crowding", "Differential evolution", "Service (business)", "Operations research", "Mathematical optimization", "Algorithm" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s12652-022-03696-1" }, { "id": "https://openalex.org/W4200580718", "doi": "10.1016/j.cie.2021.107899", "title": "A combined GA-TS algorithm for two-echelon dynamic vehicle routing with proactive satellite stations", "year": 2021, "publication_date": "2021-12-22", "type": "article", "language": "en", "authors": [ "Guiqin Xue", "Yong Wang", "Xiangyang Guan", "Zheng Wang" ], "first_author": "Guiqin Xue", "venue": "Computers & Industrial Engineering", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Genetic algorithm", "Tabu search", "Solver", "Idle", "Truck", "Vehicle routing problem", "Routing (electronic design automation)", "Real-time computing", "Mathematical optimization", "Operations research", "Algorithm" ], "cited_by_count": 38, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.cie.2021.107899" }, { "id": "https://openalex.org/W2093976283", "doi": "10.1007/s11590-013-0662-1", "title": "Service network design models for two-tier city logistics", "year": 2013, "publication_date": "2013-06-17", "type": "article", "language": "en", "authors": [ "Teodor Gabriel Crainic", "Antonino Sgalambro" ], "first_author": "Teodor Gabriel Crainic", "venue": "Optimization Letters", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Flexibility (engineering)", "Computer science", "Traffic management", "Service (business)", "Tier 2 network", "Network planning and design", "Tier 1 network", "Fleet management", "Transport engineering", "Operations research", "Telecommunications", "Business" ], "cited_by_count": 58, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s11590-013-0662-1" }, { "id": "https://openalex.org/W2553885145", "doi": "10.1016/j.trb.2016.10.005", "title": "Strategic fleet planning for city logistics", "year": 2016, "publication_date": "2016-11-09", "type": "article", "language": "en", "authors": [ "Anna Franceschetti", "Dorothée Honhon", "Gilbert Laporte", "Tom Van Woensel", "Jan C. Fransoo" ], "first_author": "Anna Franceschetti", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Partition (number theory)", "Operations research", "Service (business)", "Dimension (graph theory)", "Computer science", "Order (exchange)", "Transport engineering", "Integer programming", "Fleet management", "Set (abstract data type)", "Integer (computer science)", "Mathematical optimization" ], "cited_by_count": 49, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S019126151630042X" }, { "id": "https://openalex.org/W3006767690", "doi": "10.3390/app10041489", "title": "A Path-Based Selection Solution Approach for the Low Carbon Vehicle Routing Problem with a Time-Window Constraint", "year": 2020, "publication_date": "2020-02-21", "type": "article", "language": "en", "authors": [ "Xianlong Ge", "Xiaobo Ge", "Weixin Wang" ], "first_author": "Xianlong Ge", "venue": "Applied Sciences", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Due to the gradual improvement of urban traffic network construction and the increasing number of optional paths between any two points, how to optimize a vehicle travel path in a multi-path road network and then improve the efficiency of urban distribution has become a difficult problem for logistics companies. For this purpose, a mixed-integer mathematical programming model with a time window based on multiple paths for urban distribution in a multi-path environment is established and its exact solution solved using software CPLEX. Additionally, in order to test the application and feasibility of the model, simulation experiments were performed on the four parameters of time, distance, cost, and fuel consumption. Furthermore, using Jingdong (JD), the main urban area in Chongqing, as an example, the experimental results reveal that an algorithm that considers the path selection can significantly improve the efficiency of urban distribution in metropolitan areas with complex road structures.", "keywords": [ "Mathematical optimization", "Computer science", "Selection (genetic algorithm)", "Path (computing)", "Constraint (computer-aided design)", "Integer programming", "Window (computing)", "Algorithm", "Engineering", "Mathematics", "Artificial intelligence", "Computer network" ], "cited_by_count": 10, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2076-3417/10/4/1489/pdf?version=1582625340" }, { "id": "https://openalex.org/W2588871316", "doi": "10.1109/liss.2016.7854384", "title": "Vehicle routing optimization of urban distribution with self-pick-up lockers", "year": 2016, "publication_date": "2016-07-01", "type": "conference-paper", "language": "en", "authors": [ "Jing Ya Wen", "Yisong Li" ], "first_author": "Jing Ya Wen", "venue": null, "publisher": null, "abstract": "With the explosive development of E-commerce in China, an efficient accurate package distribution is badly needed, causing urban distribution Last Mile Problem. Under the circumstance of worse traffic congestion and environment pollutions in today's cities, not only accuracy and speed, but also alleviation of traffic congestion, air pollutions are highly required while solving Last Mile Problem. Self-pick-up locker has been tried to reach these requirements in recent years. Nevertheless, how to optimize the delivery vehicle routing with self-pick-up locker and then saving distribution cost of express enterprises is important for the popularization of self-pick-up locker remained to be seen. Based on above, a vehicle routing optimization model with self-pick-up lockers is set up, considering CO2emission, customer time window and congestion. Then the case of Mingguangcun, Beijing is brought into the model to reach a solution. What's been found in this paper should be helpful for express enterprises to promote the use of self-pick-up lockers.", "keywords": [ "Vehicle routing problem", "Beijing", "City logistics", "Routing (electronic design automation)", "Computer science", "Last mile (transportation)", "Traffic congestion", "Transport engineering", "Distribution (mathematics)", "Operations research", "China", "Computer network" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/liss.2016.7854384" }, { "id": "https://openalex.org/W3125757963", "doi": "10.1016/j.treng.2021.100047", "title": "Freight distribution with electric vehicles: A case study in Sicily. RES, infrastructures and vehicle routing", "year": 2021, "publication_date": "2021-01-21", "type": "article", "language": "en", "authors": [ "Giuseppe Napoli", "Salvatore Micari", "Giorgio Dispenza", "Laura Andaloro", "V. Antonucci", "Antonio Polimeni" ], "first_author": "Giuseppe Napoli", "venue": "Transportation Engineering", "publisher": "Elsevier BV", "abstract": "This paper deals with the issue of the production of electricity required for an electric delivery van to carry out its daily mission. In particular, the technical solutions adopted for the generation and management of energy from renewable energy sources will be illustrated. Subsequently a vehicle routing problem with time windows is formulated in order to optimize the freight distribution at urban level completing the exploration of two aspects, infrastructures and management of the service, considered fundamental for dealing with the distribution of freight in a system scenario. The article describes a case study for the delivery of freight within the last mile in which the installation of renewable energy production plants is proposed in the same place where the urban distribution center has been planned. The area dedicated to freight handling is thus proposed in the work as an energy platform as well as logistics. The optimization of a freight delivery service is performed in order to reduce the energy used by the vehicle in its daily travels and some aspects related to the governance (i.e. time windows allowed for the delivery/pick-up operations) are included in the problem constraints. A test application, considering a set of 84 retailers, has been carried out as case study in the Capo d'Orlando municipality (Sicily, Italy).", "keywords": [ "Last mile (transportation)", "Transport engineering", "City logistics", "Renewable energy", "Vehicle routing problem", "Service (business)", "Traffic management", "Electricity", "Routing (electronic design automation)", "Order (exchange)", "Energy management", "Operations research" ], "cited_by_count": 35, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2666691X21000038/pdf" }, { "id": "https://openalex.org/W4415700579", "doi": "10.1016/j.tre.2025.104510", "title": "Mitigate the range anxiety: two-stage optimization for the electric vehicle routing problem with time windows and battery status uncertainty", "year": 2025, "publication_date": "2025-10-30", "type": "article", "language": "en", "authors": [ "Zijian Yuan", "Tao Wang", "Junfang Tian", "Jing Zhang", "Jianfeng Zheng", "Jianjun Wu", "Ziyou Gao" ], "first_author": "Zijian Yuan", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Electric vehicle", "Range (aeronautics)", "Vehicle routing problem", "Battery (electricity)", "Battery electric vehicle", "Battery capacity" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2025.104510" }, { "id": "https://openalex.org/W3200538121", "doi": "10.1016/j.trb.2021.08.015", "title": "Deep Reinforcement Learning for Crowdsourced Urban Delivery", "year": 2021, "publication_date": "2021-09-13", "type": "article", "language": "en", "authors": [ "Tanvir Ahamed", "Bo Zou", "Nahid Parvez Farazi", "Theja Tulabandhula" ], "first_author": "Tanvir Ahamed", "venue": "Transportation Research Part B Methodological", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Reinforcement learning", "Computer science", "Heuristics", "Leverage (statistics)", "Artificial intelligence", "Context (archaeology)", "Node (physics)", "Machine learning" ], "cited_by_count": 70, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.trb.2021.08.015" }, { "id": "https://openalex.org/W2313132166", "doi": "10.11175/easts.11.678", "title": "Issues for the Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows", "year": 2015, "publication_date": "2015-01-01", "type": "article", "language": "en", "authors": [ "Huey-Kuo Chen" ], "first_author": "Huey-Kuo Chen", "venue": "Journal of the Eastern Asia Society for transportation studies/Journal of the Eastern Asia Society for Transportation Studies", "publisher": "Eastern Asia Society for Transportation Studies", "abstract": "The linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW) is a new version of city logistics. Four important issues are explored and fifteen sample examples used for demonstration. First, the LFVRPTW always yields better results than the vehicle routing problem with time windows (VRPTW). Second, LFVRPTW is advantageous compared with VRPTW. Third, more virtual depot (VD) candidates would yield a bit better results than fewer VD candidates. Fourth, less restricted time window constraints can yield significant benefit to the LFVRPTW. The authors also test the combined effect of VD candidates and time window constraints. We conclude that: (1) The LFVRPTW problem generally performs better than the VRPTW; (2) The LFVRPTW algorithm embedding the modified sequential insertion heuristic I1 is more effective than that containing the minimum cost insertion method; (3) For LFVRPTW, a looser time window constraint is more critical than the addition of more VD candidates.", "keywords": [ "Vehicle routing problem", "Embedding", "Heuristic", "Routing (electronic design automation)", "Mathematical optimization", "Constraint (computer-aided design)", "Computer science", "Window (computing)", "Time constraint", "Mathematics", "Artificial intelligence", "Embedded system" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1378277" }, { "id": "https://openalex.org/W561708605", "doi": null, "title": "Combining vehicle routing models and microscopic traffic simulation to model and evaluating city logistics applications", "year": 2005, "publication_date": "2005-01-01", "type": "article", "language": "en", "authors": [ "Jaume Barceló", "Hanna Grzybowska", "S Pardo" ], "first_author": "Jaume Barceló", "venue": null, "publisher": null, "abstract": "The distribution of goods based on road services in urban areas contribute to traffic congestion, generates environmental impacts and in some cases incurs in high logistics costs. On the other hand the various stakeholders involved in the applications may have possibly conflicting objectives. Industrial firms, shippers, freight carriers, have individually established to meet consumer demands looking to maximize the company effectiveness and as a consequence from a social point of view the resulting logistics system is inefficient from the point of view of the social costs and environmental impacts. As a consequence the design and evaluation of City Logistics applications requires an integrated framework in which all components could work together. Therefore City Logistics models must be models that, further than including the main components of City Logistics applications, as vehicle routing and fleet management models, should be able of including also the dynamic aspects of the underlying road network, namely if ICT applications are taken into account. Some of the methodological proposals made so far are based on an integration of vehicle routing models and, dynamic traffic simulation models that emulate the actual traffic conditions providing at each time interval the estimates of the current travel times, queues, etc. on each link of the road network, that is, the information that will be used by the logistic model (i.e. a fleet management system identifying in real-time the positions of each vehicle in the fleet and its operational conditions - type of load, available capacity, etc. - to determine the optimal dynamic routing and scheduling of the vehicle. This paper reports on the modelling framework developed and tested in the European Project MEROPE of the INTERREG IIIB Programme, and in the national project SADERYL, sponsored by the Spanish DGCYT. The modelling framework is supported by a Computer Decision Support System which core architecture consists of the following main components: A Data Base, to store all the data required by the implied models: locations of logistic centres and customers, capacities of warehouses and depots, transportation costs, operational costs, fleet data, etc.; a Data Base Management System, for the updating of the information stored in the data base; a Model Base, containing the family of models and algorithms to solve the related problems, discrete location, network location, street vehicle routing and scheduling, to account explicitly with the asymmetry of costs typical of urban applications etc.; a Model Base Management System, to update, modify, add or delete models from the Model Base; a Graphic User Interface, GUI, supporting the windows based dialogues to define and update data, select the model suited to the intended problem, apply the corresponding algorithm, visualize the problem and the results, etc. Taking into account the nature of the problems addressed in City Logistic Application, and their underlying geographic reality, the framework in which the GUI has been embedded is that of a software platform with the main GIS functions required to support transport applications, which imports the digital map of the urban area, and generates automatically the graph its road network to generate the input for the Network Location and Vehicle Routing models. The underlying dynamic simulation model (AIMSUN in this case) tacks individually the fleet vehicles, emulating in this way the monitoring of fleet vehicles in a real time fleet management system, gathering dynamic data (i.e. current position, previous position, current speed, previous speed, etc.) while following the vehicle, in a similar way as the data that in real life an equipped vehicle could provide. This is the information required by the Dynamic Router and Scheduler to determine which vehicle will be assigned the new service and which will be the new route for the selected vehicle. For the covering abstract please see ITRD E135207.", "keywords": [ "Traffic management", "Vehicle routing problem", "Scheduling (production processes)", "Computer science", "Transport engineering", "Operations research", "City logistics", "Routing (electronic design automation)", "Work (physics)", "Fleet management", "Operations management", "Engineering" ], "cited_by_count": 13, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/846413" }, { "id": "https://openalex.org/W1983101030", "doi": "10.1016/j.sbspro.2012.03.113", "title": "Evaluating City Logistics Measure in E-Commerce with Multiagent Systems", "year": 2012, "publication_date": "2012-01-01", "type": "conference-paper", "language": "en", "authors": [ "Joel S.E. Teo", "Eiichi Taniguchi", "Ali Gul Qureshi" ], "first_author": "Joel S.E. Teo", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "This paper presents a multi-agent systems (MAS) model to evaluate City Logistics measure for an urban road network in an e-commerce delivery system environment. Most notable contribution of this evaluation methodology is the combination of vehicle routing and scheduling problem with time window (VRPTW), auction theory and reinforcement learning in a multi-agent framework. This approach seeks to represent the behaviour of each stakeholder involved in the delivery of goods between producers and customers. The preliminary results of the model shows that Government-driven City Logistics measures such as freight vehicle road pricing has the potential of reducing truck emission when the administrator learns and price the road links.", "keywords": [ "City logistics", "Truck", "Computer science", "Measure (data warehouse)", "Vehicle routing problem", "Reinforcement learning", "Scheduling (production processes)", "Stakeholder", "Transport engineering", "Multi-agent system", "Operations research", "Routing (electronic design automation)" ], "cited_by_count": 55, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.sbspro.2012.03.113" }, { "id": "https://openalex.org/W3156359523", "doi": "10.1155/2021/5531500", "title": "Vehicle Routing Problem for Collaborative Multidepot Petrol Replenishment under Emergency Conditions", "year": 2021, "publication_date": "2021-04-17", "type": "article", "language": "en", "authors": [ "Guangcan Xu", "Qiguang Lyu" ], "first_author": "Guangcan Xu", "venue": "Journal of Advanced Transportation", "publisher": "Hindawi Publishing Corporation", "abstract": "In recent years, emergency events have affected urban distribution with increasing frequency. For example, the 2019 novel coronavirus has caused a considerable impact on the supply guarantee of important urban production and living materials, such as petrol and daily necessities. On this basis, this study establishes a dual-objective mixed-integer linear programming model to formulate and solve the cooperative multidepot petrol emergency distribution vehicle routing optimization problem with multicompartment vehicle sharing and time window coordination. As a method to solve the model, genetic variation of multiobjective particle swarm optimization algorithm is considered. The effectiveness of the proposed method is analyzed and verified by first using a small-scale example and then investigating a regional multidepot petrol distribution network in Chongqing, China. Cooperation between petrol depots in the distribution network, customer clustering, multicompartment vehicle sharing, time window coordination, and vehicle routing optimization under partial road blocking conditions can significantly reduce the total operation cost and shorten the total delivery time. Meanwhile, usage of distribution trucks is optimized in the distribution network, that is, usage of single- and double-compartment trucks is reduced while that of three-compartment trucks is increased. This approach provides theoretical support for relevant government departments to improve the guarantee capability of important materials in emergencies and for relevant enterprises to improve the efficiency of emergency distribution.", "keywords": [ "Truck", "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "Genetic algorithm", "Operations research", "Transport engineering", "Particle swarm optimization", "Engineering", "Computer network", "Automotive engineering" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://downloads.hindawi.com/journals/jat/2021/5531500.pdf" }, { "id": "https://openalex.org/W2913279825", "doi": "10.1016/j.trpro.2018.12.169", "title": "Cost-Efficient and Reliable City Logistics Vehicle Routing with Satellite Locations under Travel Time Uncertainty", "year": 2019, "publication_date": "2019-01-01", "type": "article", "language": "en", "authors": [ "Patrick-Oliver Groß", "Jan Fabian Ehmke", "Dirk Christian Mattfeld" ], "first_author": "Patrick-Oliver Groß", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "In this paper, we propose a city logistics vehicle routing problem in which goods are delivered from a major terminal to several satellite locations. Travel times in the planning area are uncertain. The objective is to find suitable a-priori tours that are both cost-efficient and reliable. Therefore, Interval Travel Times (ITT) and a suitable criterion for efficiency and reliability are considered within vehicle routing. The resulting delivery tours are evaluated within a case study for the city of Stuttgart. Computational experiments show that integrating ITT into the routing leads to an improved efficiency and reliability of the planned tours.", "keywords": [ "Reliability (semiconductor)", "Vehicle routing problem", "Routing (electronic design automation)", "Computer science", "City logistics", "Travel time", "Transport engineering", "Operations research", "Satellite", "Engineering", "Computer network" ], "cited_by_count": 12, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146518305842/pdf" }, { "id": "https://openalex.org/W53328587", "doi": "10.1007/978-3-319-04630-3_34", "title": "A Hybrid Algorithm for Solving the General Vehicle Routing Problem in the Case of the Urban Freight Distribution", "year": 2014, "publication_date": "2014-01-01", "type": "book-chapter", "language": "en", "authors": [ "Juan Antonio Sicilia Montalvo", "David Escuín", "Beatriz Royo", "Emilio Larrodé", "Jesús Medrano" ], "first_author": "Juan Antonio Sicilia Montalvo", "venue": "Advances in intelligent systems and computing", "publisher": "Springer Nature", "abstract": null, "keywords": [ "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Distribution (mathematics)", "Transport engineering", "Operations research", "Mathematical optimization", "Engineering", "Mathematics", "Computer network" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/978-3-319-04630-3_34" }, { "id": "https://openalex.org/W2890285949", "doi": "10.1108/ijlm-11-2017-0303", "title": "Collaboration in urban distribution of online grocery orders", "year": 2018, "publication_date": "2018-09-07", "type": "article", "language": "en", "authors": [ "Dimitris Zissis", "Emel Aktaş", "Michael Bourlakis" ], "first_author": "Dimitris Zissis", "venue": "The International Journal of Logistics Management", "publisher": "Emerald Publishing Limited", "abstract": "Purpose Population growth, urbanisation and the increased use of online shopping are some of the key challenges affecting the traditional logistics model. The purpose of this paper is to focus on the distribution of grocery products ordered online and the subsequent home delivery and click and collect services offered by online retailers to fulfil these orders. These services are unsustainable due to increased operational costs, carbon emissions, traffic and noise. The main objective of the research is to propose sustainable logistics models to reduce economic, environmental and social costs whilst maintaining service levels. Design/methodology/approach The authors have a mixed methodology based on simulation and mathematical modelling to evaluate the proposed shared logistics model using: primary data from a major UK retailer, secondary data from online retailers and primary data from a consumer survey on preferences for receiving groceries purchased online. Integration of these three data sets serves as input to vehicle routing models that reveal the benefits from collaboration by solving individual distribution problems of two retailers first, followed by the joint distribution problem under single decision maker assumption. Findings The benefits from collaboration could be more than 10 per cent in the distance travelled and 16 per cent in the time required to deliver the orders when two online grocery retailers collaborate in distribution activities. Originality/value The collaborative model developed for the online grocery market incentivises retailers to switch from current unsustainable logistics models to the proposed collaborative models.", "keywords": [ "Distribution (mathematics)", "Business", "Marketing", "Originality", "Population", "Service (business)", "Environmental economics", "Computer science", "Economics" ], "cited_by_count": 69, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ueaeprints.uea.ac.uk/id/eprint/72359/1/Accepted_Manuscript.pdf" }, { "id": "https://openalex.org/W2195088785", "doi": "10.1287/trsc.2015.0606", "title": "Modeling Demand Uncertainty in Two-Tier City Logistics Tactical Planning", "year": 2015, "publication_date": "2015-12-10", "type": "article", "language": "en", "authors": [ "Teodor Gabriel Crainic", "Fausto Errico", "Walter Rei", "Nicoletta Ricciardi" ], "first_author": "Teodor Gabriel Crainic", "venue": "Transportation Science", "publisher": "Institute for Operations Research and the Management Sciences", "abstract": "We consider the complex and not-yet-studied issue of building the tactical plan of a two-tiered city logistics system while explicitly accounting for the uncertainty in the forecast demand. We describe and formally define the problem and then propose a general modeling framework, which takes the form of a two-stage stochastic programming formulation, the first stage selecting the first-tier service network design and the general workloads of the intertier transfer facilities, and the second stage determines the actual vehicle routing on the second tier as well as some limited adjustments of the first-stage service design decisions. Four different strategies of adapting the plan to the observed demand are introduced together with the associated recourse formulations. These strategies are then experimentally compared through an evaluation procedure that, based on Monte Carlo principles, mimics the decision process of a priori planning followed by repetitively applying the adjusted plan to the periods of the planning horizon. The performances of the city logistics system under the adjustment strategies are contrasted through performance measures relative to the costs of operating the system, including those of additional vehicle capacity and movements required when the plan does not provide sufficient transportation means, the utilization of the various types of vehicles, the intensity of the vehicle presence within the city, and the utilization of the intertier transfer facilities. The comparisons are discussed both based on the numerical figures obtained through simulation and from the point of view of managerial insights into the implication for managing city logistics physical and human resources. The analysis emphasizes the interest of flexibility in managing resources and operations for the overall performance of the system, discusses the associated trade-offs, and underlines the benefits of consolidation in terms of system efficiency and impact on the city. The comparisons also show that even when demand variability and management constraints are explicitly taken into account, our approach is still able to build good tactical plans.", "keywords": [ "Plan (archaeology)", "Operations research", "Computer science", "Time horizon", "A priori and a posteriori", "Service (business)", "Stochastic programming", "Process (computing)", "Service level", "Routing (electronic design automation)", "Point (geometry)", "Mathematical optimization" ], "cited_by_count": 62, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1287/trsc.2015.0606" }, { "id": "https://openalex.org/W2809183503", "doi": "10.1016/j.energy.2018.06.125", "title": "Dynamic management of loading bays for energy efficient urban freight deliveries", "year": 2018, "publication_date": "2018-06-19", "type": "article", "language": "en", "authors": [ "Tomislav Letnik", "Alessandro Farina", "Matej Mencinger", "Marino Lupi", "Stanislav Božičnik" ], "first_author": "Tomislav Letnik", "venue": "Energy", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Transport engineering", "Routing (electronic design automation)", "Computer science", "Environmental science", "Fuzzy logic", "Operations research", "Civil engineering", "Engineering" ], "cited_by_count": 55, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S0360544218311903" }, { "id": "https://openalex.org/W3011770641", "doi": "10.5220/0008871801380142", "title": "Immediate Parcel to Vehicle Assignment for Cross Docking in City Logistics: A Dynamic Assignment Vehicle Routing Problem", "year": 2020, "publication_date": "2020-01-01", "type": "conference-paper", "language": "en", "authors": [ "Frank Phillipson", "S. E. de Koff" ], "first_author": "Frank Phillipson", "venue": null, "publisher": null, "abstract": "In this paper we present the Dynamic Assignment Vehicle Routing Problem. This problem arises in parcel to vehicle assignment where the destination of the parcels is not known up to the assignment of the parcel to a delivering vehicle. The assignment has to be done immediately without the possibility of re-assignment afterwards. The problem is defined and various methods are proposed to come to an efficient solution method. Three cases are presented to test this efficiency. An approach using minimum cost insertion with penalty performs best.", "keywords": [ "Vehicle routing problem", "Assignment problem", "Computer science", "Routing (electronic design automation)", "Generalized assignment problem", "Weapon target assignment problem", "Mathematical optimization", "Operations research", "Computer network", "Engineering", "Mathematics" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5220/0008871801380142" }, { "id": "https://openalex.org/W2948407930", "doi": "10.1016/j.scs.2019.101606", "title": "Integrated Municipal Solid Waste Management under uncertainty: A tri-echelon city logistics and transportation context", "year": 2019, "publication_date": "2019-06-03", "type": "article", "language": "en", "authors": [ "Hossein Asefi", "Shahrooz Shahparvari", "Prem Chhetri" ], "first_author": "Hossein Asefi", "venue": "Sustainable Cities and Society", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Vehicle routing problem", "Context (archaeology)", "Operations research", "Linear programming", "Computer science", "Flow network", "Stochastic programming", "Network planning and design", "Integer programming", "Decomposition", "Routing (electronic design automation)", "Mathematical optimization" ], "cited_by_count": 60, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.scs.2019.101606" }, { "id": "https://openalex.org/W1513385460", "doi": null, "title": "AN INNOVATING CONCEPT FOR CITY-LOGISTICS", "year": 1997, "publication_date": "1997-01-01", "type": "article", "language": "en", "authors": [ "Uwe Köhler" ], "first_author": "Uwe Köhler", "venue": null, "publisher": null, "abstract": "The growing number of uncoordinated delivery trips to retail shops especially in the Central Business Districts of cities leads to a considerable increase of traffic as well as to a continuously stronger hindrance of the remaining traffic due to the loading and unloading procedures on the streets. Therefore it is an important goal to reach a better coordination of the commercial traffic through city-logistics-concepts, especially by bundling goods. All goods which can be bundled should be labelled (e.g. in a freight transport centre) indicating destination, weight and volume of goods. A special software for route optimization will compute the sequence in which deliveries should be effected. During the trip the optimized route will be checked continuously with the help of ITS on the basis of the actual traffic situation and actual position of the vehicle and possibly modified in order to save time. This system can be expanded announcing the exact arrival time of the vehicle at the loading area of a shop thus enabling to clear the loading area for the incoming goods. For the covering abstract, see IRRD 490001.", "keywords": [ "TRIPS architecture", "Transport engineering", "Position (finance)", "Order (exchange)", "Business", "City logistics", "Finished good", "Volume (thermodynamics)", "Traffic management", "Computer science", "Operations research", "Operations management" ], "cited_by_count": 35, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/540500" }, { "id": "https://openalex.org/W2025988413", "doi": "10.1007/s11067-009-9099-6", "title": "Modelization of Time-Dependent Urban Freight Problems by Using a Multiple Number of Distribution Centers", "year": 2009, "publication_date": "2009-02-04", "type": "article", "language": "en", "authors": [ "David Escuín", "Carlos Millán", "Emilio Larrodé" ], "first_author": "David Escuín", "venue": "Networks and Spatial Economics", "publisher": "Springer Science+Business Media", "abstract": "The aim of the paper is to model urban distribution vehicle routing problems by means of hubs in large cities. The idea behind the urban distribution center (DC) is to provide buffer points where cargo and packages which are to be delivered to shops and businesses can be stored beforehand. At these centers, there will be other kinds of routing problems corresponding to other fairly similar distribution problems. In this paper, a new vehicle routing model (based on the known Time-Dependent Vehicle Routing Problem with Time Windows, TDVRPTW ) has been carried out and a change in the traditional approach is proposed, by adopting a system in which some customers are served by urban DCs while remaining customers are served by traditional routes. This study is also motivated by recent developments in real time traffic data acquisition systems, as well as national and international policies aimed at reducing concentrations of greenhouse gases emitted by traditional vans. By using k DCs, the whole problem is now composed of k+1 problems: one special VRPTW for each DC in addition to the main problem, in which some customers and k DC are serviced. The model has been tested by simulating one real case of pharmaceutical distribution within the city of Zaragoza.", "keywords": [ "Vehicle routing problem", "Routing (electronic design automation)", "Distribution (mathematics)", "Computer science", "City logistics", "Transport engineering", "Operations research", "Computer network", "Engineering", "Mathematics" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://link.springer.com/content/pdf/10.1007/s11067-009-9099-6.pdf" }, { "id": "https://openalex.org/W4399367054", "doi": "10.1016/j.clscn.2024.100157", "title": "An exact method for vehicle routing problem with backhaul discounts in urban express delivery network", "year": 2024, "publication_date": "2024-06-01", "type": "article", "language": "en", "authors": [ "Jinqiu Zhao", "Yongwu Liu", "Jinwei Zhang", "Jing Zhang", "Yixiao Huang", "Le Yu", "Binglei Xie" ], "first_author": "Jinqiu Zhao", "venue": "Cleaner Logistics and Supply Chain", "publisher": "Elsevier BV", "abstract": "The surge in e-commerce has led to an increased demand for urban express services, requiring the strategic development of delivery networks that are both efficient and cost-effective. This study addresses a practical vehicle routing problem (VRP) in an urban express delivery network to minimize transportation costs. Specifically, it considers the implementation of backhaul discounts, a factor disregarded in the existing literature. This VRP is further complicated by various realistic constraints, including pickup and delivery, time windows, multiple trips, heterogeneous fleets, and docking capacity limitations, which make most general VRP solvers inapplicable. This study proposes a trip-based formulation to overcome this challenge and develop a tailored branch-and-price algorithm. Feasible trips are classified into four types to simplify the computation of backhaul discounts, thereby enhancing solution efficiency. Validation with real-world data from SF Express substantiates the efficacy of our method and yields insights for sustainable city logistics management. Moreover, our simplified column generation algorithm exhibits competitive performance, achieving optimal solutions expeditiously for the tested instances.", "keywords": [ "Backhaul (telecommunications)", "Vehicle routing problem", "TRIPS architecture", "Column generation", "City logistics", "Computer science", "Transport engineering", "Operations research", "Routing (electronic design automation)", "Computation", "Mathematical optimization", "Computer network" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.clscn.2024.100157" }, { "id": "https://openalex.org/W3087894820", "doi": "10.35833/mpce.2019.000601", "title": "Optimal Feeder Routing in Urban Distribution Networks Planning with Layout Constraints and Losses", "year": 2020, "publication_date": "2020-01-01", "type": "article", "language": "en", "authors": [ "Alessandro Bosisio", "Alberto Berizzi", "E. Amaldi", "Cristian Bovo", "Xu Andy Sun" ], "first_author": "Alessandro Bosisio", "venue": "Journal of Modern Power Systems and Clean Energy", "publisher": "Springer Nature", "abstract": "We address the problem of optimally re-routing the feeders of urban distribution network in Milano, Italy, which presents some peculiarities and significant design challenges. Milano has two separate medium-voltage (MV) distribution networks, previously operated by two different utilities, which grew up independently and incoordinately. This results in a system layout which is inefficient, redundant, and difficult to manage due to different operating procedures. The current utility UNARETI, which is in charge of the overall distribution system, aims at optimally integrating the two MV distribution networks and moving to a new specific layout that offers advantages from the perspectives of reliability and flexibility. We present a mixed-integer programming (MIP) approach for the design of a new network configuration satisfying the so-called 2-step ladder layout required by the planner. The model accounts for the main electrical constraints such as power flow equations, thermal limits of high-voltage (HV)/MV substation transformers, line thermal limits, and the maximum number of customers per feeder. Real power losses are taken into account via a quadratic formulation and a piecewise linear approximation. Computational tests on a small-scale system and on a part of the Milano distribution network are reported.", "keywords": [ "Mathematical optimization", "Piecewise linear function", "Integer programming", "Transformer", "Quadratic equation", "Routing (electronic design automation)", "Voltage", "Busbar", "Network planning and design", "Flexibility (engineering)", "Computer science", "Linear programming" ], "cited_by_count": 38, "is_retracted": false, "is_paratext": false, "open_access_url": "https://ieeexplore.ieee.org/ielx7/8685265/9205722/09112770.pdf" }, { "id": "https://openalex.org/W2056328001", "doi": "10.1007/s12544-014-0149-x", "title": "A new urban freight distribution scheme and an optimization methodology for reducing its overall cost", "year": 2015, "publication_date": "2015-01-23", "type": "article", "language": "en", "authors": [ "Elvezia Maria Cepolina", "Alessandro Farina" ], "first_author": "Elvezia Maria Cepolina", "venue": "European Transport Research Review", "publisher": "Springer Science+Business Media", "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 UDC on the border of urban areas through trucks or trains which perform the long distance transport. After, freight is reorganized and consolidated into load units, i.e. the 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 FURBOT vehicle. The receivers are in charge of collecting their packages in the related unloading bays where they have been delivered. The paper concerns a methodology for optimizing this freight transport system’s performances. The overall methodology receives in input the actual freight demand and the road network, and finds the transport system parameters (number of required FURBOT boxes, their temporary unloading bay, the FURBOT fleet dimension and the FURBOT vehicle routing) that minimize the system overall 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’s cost, which depends on the number of required boxes, the total distance travelled by the FURBOT vehicles and the required number of FURBOT vehicles. The overall procedure has been applied to the case study of Barreiro old town, a suburb of Lisbon, Portugal.", "keywords": [ "Truck", "Transport engineering", "Train", "Routing (electronic design automation)", "Process (computing)", "Dimension (graph theory)", "Traffic management", "Rail freight transport", "Computer science", "Engineering", "Operations research", "Automotive engineering" ], "cited_by_count": 51, "is_retracted": false, "is_paratext": false, "open_access_url": "https://etrr.springeropen.com/counter/pdf/10.1007/s12544-014-0149-x" }, { "id": "https://openalex.org/W2312197454", "doi": "10.1049/cp.2012.2309", "title": "An hybrid heuristic algorithm for the two-echelon vehicle routing problem", "year": 2012, "publication_date": "2012-01-01", "type": "conference-paper", "language": "en", "authors": [ "He Jiang" ], "first_author": "He Jiang", "venue": null, "publisher": null, "abstract": "This paper aims to put forward a kind of hybrid heuristic algorithm to solve the Two-Echelon Vehicle Routing Problem (2E-VRP), which can improve the solution quality and accelerate the convergence of algorithm. By combining greedy algorithm, ant colony optimization algorithm and neighbourhood search algorithm together, the hybrid heuristic algorithm can take full advantage of the rapidness of greedy algorithm, the search diversity of ant colony algorithm and the strong local optimization ability of local search algorithm. The paper applies the algorithm to 22 benchmark examples and three large-scale examples, and compares the results with similar studies. The experimental results show that the hybrid heuristic algorithm can not only guarantee a high accuracy, but also have high efficiency. Compared with the similar algorithm of the highest accuracy, although the hybrid heuristic algorithm performs somewhat less well in solution quality, but shows great advantage as far as the solving speed is concerned. The experimental results also show that in some cases the 2E-VRP approach obtains better performances with respect to the classical VRP, and the setting of satellites can significantly improve the city logistics efficiency.", "keywords": [ "Greedy algorithm", "Vehicle routing problem", "Benchmark (surveying)", "Computer science", "Heuristic", "Algorithm", "Ant colony optimization algorithms", "Mathematical optimization", "Convergence (economics)", "Local search (optimization)", "Hybrid algorithm (constraint satisfaction)", "Routing (electronic design automation)" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1049/cp.2012.2309" }, { "id": "https://openalex.org/W3084456119", "doi": "10.3390/su12187500", "title": "Flexible Assignment of Loading Bays for Efficient Vehicle Routing in Urban Last Mile Delivery", "year": 2020, "publication_date": "2020-09-11", "type": "article", "language": "en", "authors": [ "Tomislav Letnik", "Matej Mencinger", "Iztok Peruš" ], "first_author": "Tomislav Letnik", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Urban freight deliveries are often subject to many access restrictions which creates the need to establish a system of loading bays and to split the last mile delivery into driving and walking parts. A new model based on hard and soft clustering approach is developed to solve the loading bay assignment problem for efficient vehicle routing and walking in last mile delivery. The flexibility of the model is provided by the soft clustering approach based on different membership degrees of customers to loading bays. Especially for instances with large numbers of loading bays, soft clustering seems to give better results, it leads to higher flexibility of city logistics systems, minimal driving distances, and adequately short walking paths, which contribute to the goal of reaching sustainable urban freight deliveries.", "keywords": [ "Flexibility (engineering)", "Last mile (transportation)", "Vehicle routing problem", "Mile", "Cluster analysis", "Transport engineering", "Computer science", "Routing (electronic design automation)", "Operations research", "Engineering", "Computer network", "Geography" ], "cited_by_count": 23, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/12/18/7500/pdf" }, { "id": "https://openalex.org/W4389817110", "doi": "10.1007/s10668-023-04123-x", "title": "Feeder vehicle routing problem in a collaborative environment using hybrid particle swarm optimization and adaptive learning strategy", "year": 2023, "publication_date": "2023-12-15", "type": "article", "language": "en", "authors": [ "M. Salehi Sarbijan", "Javad Behnamian" ], "first_author": "M. Salehi Sarbijan", "venue": "Environment Development and Sustainability", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Particle swarm optimization", "Vehicle routing problem", "Computer science", "Swarm behaviour", "Routing (electronic design automation)", "Multi-swarm optimization", "Mathematical optimization", "Artificial intelligence", "Computer network", "Machine learning", "Mathematics" ], "cited_by_count": 8, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10668-023-04123-x" }, { "id": "https://openalex.org/W4214604201", "doi": "10.1007/s12351-022-00695-0", "title": "A city logistics system for freight transportation: integrating information technology and operational research", "year": 2022, "publication_date": "2022-03-01", "type": "article", "language": "en", "authors": [ "Sotiris P. Gayialis", "Evripidis P. Kechagias", "Grigorios D. Konstantakopoulos" ], "first_author": "Sotiris P. Gayialis", "venue": "Operational Research", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "City logistics", "Traffic management", "Traffic congestion", "Computer science", "Vehicle routing problem", "Routing (electronic design automation)", "Transport engineering", "Information system", "Quality (philosophy)", "Architecture", "Information technology", "Business" ], "cited_by_count": 51, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s12351-022-00695-0" }, { "id": "https://openalex.org/W2041622750", "doi": "10.1111/itor.12110", "title": "A set covering based matheuristic for a real‐world city logistics problem", "year": 2014, "publication_date": "2014-07-02", "type": "article", "language": "en", "authors": [ "Marco Antonio Boschetti", "Vittorio Maniezzo" ], "first_author": "Marco Antonio Boschetti", "venue": "International Transactions in Operational Research", "publisher": "Wiley", "abstract": "Abstract This paper describes an application of a matheuristic algorithm to a real‐world city logistics problem for a mid‐sized town, whose core could be modeled as a multitrip vehicle routing problem with time windows, pickup and deliveries, and heterogeneous fleet. The proposed matheuristic is based on a dual ascent procedure applied to an extended set covering model (SCC) and on a randomized constructive heuristic. It starts by constructing an initial set of feasible solutions. The corresponding routes are the starting subset of columns of SCC. At each iteration, the dual ascent based on a Lagrangian optimization of the SCC computes a near‐optimal dual solution that is returned along with a primal solution obtained by a Lagrangian heuristic. The dual costs are used for generating new feasible solutions by means of the constructive heuristic, and the corresponding routes are the new columns added to the SCC. At the end of the algorithm, the best heuristic solution is pruned to get a feasible solution for the city logistics problem. The matheuristic could actually solve different city logistics scenarios to be used as a basis for a successive stakeholders concertation process. A further interesting byproduct of this research is the dual ascent procedure that also proved effective on the classical set covering problem, in addition to its extension considered in this paper.", "keywords": [ "Heuristic", "Mathematical optimization", "Constructive", "Dual (grammatical number)", "Vehicle routing problem", "Computer science", "Set (abstract data type)", "Process (computing)", "Core (optical fiber)", "Routing (electronic design automation)", "Lagrangian relaxation", "Mathematics" ], "cited_by_count": 38, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1111/itor.12110" }, { "id": "https://openalex.org/W2781998419", "doi": "10.1016/j.trpro.2017.12.138", "title": "A multi-scale agent-based modelling framework for urban freight distribution", "year": 2017, "publication_date": "2017-01-01", "type": "article", "language": "en", "authors": [ "André Romano Alho", "B. K. Bhavathrathan", "Monique A. Stinson", "Raja Gopalakrishnan", "Diem-Trinh Le", "Moshe E Ben-Akiva" ], "first_author": "André Romano Alho", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "Comprehensive modelling of urban freight operations remains a challenge in transportation research. This is partly due to the diversity of commodities transported, shipment units, vehicle types used, stakeholders’ objectives (e.g. suppliers, carriers, receivers), and to the limited availability of data. Thus, existing modelling efforts require several assumptions yet have limited behavioral foundations and minimal interaction between agents. This paper proposes a new agent-based modelling framework, which considers the heterogeneity of urban freight agents and their interactions. Agents include establishments (suppliers, carriers, and receivers) and freight vehicle drivers. Agents’ decisions are structured in three temporal resolutions: strategic, tactical, and operational. A single set of agents is represented throughout all modelling levels ensuring a consistent and sequential flow of information. At the strategic level, establishments’ characteristics and strategic decisions are modelled. These include location choices, fleet constitution, annual production/consumption of commodities, and establishment-to-establishment commodity flows. At the tactical level, shipments are assigned to carriers, who in turn plan their operations in terms of vehicle-driver-route assignments. Finally, at the operational level, the interactions between daily operational demands and transportation network supply are simulated. The supply representation has two different resolution levels (micro or meso) allowing for either detailed or computational efficient simulation. The simulation platform is distinct from previous works, as it explicitly considers planning horizons, replicates agent decision makings/interactions and involves a structure that allows for the propagation of influences bottom-up (e.g., prior simulation travel times on future route choice). The paper describes the simulation platform, constituent models, and illustrates its capabilities using an application of the modelling framework to the city of Singapore.", "keywords": [ "Supply chain", "Scale (ratio)", "Computer science", "Operations research", "Traffic simulation", "Commodity", "Plan (archaeology)", "Transport engineering", "Set (abstract data type)", "Agent-based model", "Flow network", "Engineering" ], "cited_by_count": 43, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146517310359/pdf" }, { "id": "https://openalex.org/W2104873320", "doi": null, "title": "Multi-echelon distribution systems in city logistics", "year": 2013, "publication_date": "2013-08-01", "type": "article", "language": "en", "authors": [ "Simona Mancini" ], "first_author": "Simona Mancini", "venue": "OpenstarTs (Univeristy of Trieste https://www.units.it/)", "publisher": "University of Trieste", "abstract": "In the last decades \\n, \\nthe increasing quality of services requested by the cust \\nomer, yields to the necessity of \\noptimizing \\nthe whole distribution process. \\nThis goal may be achieved through a smart exploitation of \\nexisting resources other than a clever planning of the whole distribution process. For doing that, it is \\nnecessary to enha \\nnce goods consolidation. \\nOne of the most efficient way to implement \\nit \\nis to adopt \\nMulti \\n- \\nEchelon distribution systems \\nwhich are very common in \\nCity Logistic context, \\nin which they allow \\nto keep large trucks from the city center, with strong \\nenvironmental \\na \\ndvantages \\n. \\nThe aim of the \\npaper \\nis to \\nreview \\nrouting \\nproblems \\narising \\nin City Logistics \\n, in which multi \\n- \\ne \\nchelon distribution systems are \\ninvolved: the \\nTwo Echelon \\nLocation Routing Problem ( \\n2E \\n- \\nLRP) \\n, the Two \\nEchelon Vehicle Routing \\nProblem (2E \\n- \\nVRP) and Truck and Trailer Routing Problem (TTRP), and to discuss literature on \\noptimization methods, both exact and heuristic, developed to address these problems.", "keywords": [ "Vehicle routing problem", "Truck", "City logistics", "Routing (electronic design automation)", "Computer science", "Operations research", "Context (archaeology)", "Distribution center", "Process (computing)", "Transport engineering", "Business", "Engineering" ], "cited_by_count": 27, "is_retracted": false, "is_paratext": false, "open_access_url": "http://hdl.handle.net/10077/8868" }, { "id": "https://openalex.org/W2285498447", "doi": "10.1016/j.trpro.2016.02.076", "title": "Urban Freight Transport: From Optimized Routes to Robust Routes", "year": 2016, "publication_date": "2016-01-01", "type": "article", "language": "en", "authors": [ "Mohamed Guedria", "Nicolas Malhéné", "Jean‐Christophe Deschamps" ], "first_author": "Mohamed Guedria", "venue": "Transportation research procedia", "publisher": "Elsevier BV", "abstract": "This paper considers two well-known strategies for the organization of tours for urban deliveries: the vehicle routing problem (VRP) and the optimization of vehicle loading plan problem. Experience shows that optimal solutions are rarely implemented given the many intervening disturbances on an urban tour. As illustrated using a simple theoretical scenario, we propose a hybrid approach between the two strategies and introduce the concept of robustness in the tour, in order to guarantee a predefined level of performance.", "keywords": [ "Robustness (evolution)", "Vehicle routing problem", "Computer science", "Transport engineering", "Plan (archaeology)", "Route planning", "Mathematical optimization", "Routing (electronic design automation)", "Operations research", "Engineering", "Computer network", "Mathematics" ], "cited_by_count": 9, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2352146516000776/pdf" }, { "id": "https://openalex.org/W2094079285", "doi": "10.1016/j.sbspro.2012.03.142", "title": "Decision Support System for Real-Time Urban Freight Management", "year": 2012, "publication_date": "2012-01-01", "type": "conference-paper", "language": "en", "authors": [ "Hanna Grzybowska", "Jaume Barceló" ], "first_author": "Hanna Grzybowska", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "The urban network is a highly dynamic system. Thus, a modern and efficient fleet management in urban areas should account for dynamics of traffic conditions and variability in travel times, since they significantly affect the distribution of goods and the provision of services. For the proficient dynamic fleet management decisions it is proper instead of relying exclusively on the experience of a dispatcher, to base the freight management decisions on information provided by a professional Decision Support System (DSS), which facilitates the consideration of all the factors conditioning the addressed problem. This paper provides a proposal of such DSS for real-time freight management. Its design is based on integration of selected pickup and delivery vehicle routing model and dynamic traffic simulation models, which objective is to carefully emulate the evolving traffic conditions. The optimal dynamic routing and scheduling of a vehicle fleet is obtained due to dynamic modifications of the current routing and scheduling plan on the basis of the newly revealed information conditioning the addressed problem.", "keywords": [ "Decision support system", "Business", "Transport engineering", "Computer science", "Engineering", "Artificial intelligence" ], "cited_by_count": 32, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.sbspro.2012.03.142" }, { "id": "https://openalex.org/W4286487963", "doi": "10.3389/ffutr.2022.887307", "title": "Emerging Information and Communication Technologies: the Challenges for the Dynamic Freight Management in City Logistics", "year": 2022, "publication_date": "2022-07-22", "type": "article", "language": "en", "authors": [ "Antonio Comi", "Francesco Russo" ], "first_author": "Antonio Comi", "venue": "Frontiers in Future Transportation", "publisher": "Frontiers Media", "abstract": "Recently, the evolution of emerging information and communication technologies (e-ICTs) has opened the road for developing and implementing new integrated and dynamic city logistics solutions and subsequently for identifying new frontiers of intelligent transport systems (ITSs). The study evolves pointing out the different city logistics groups of actors and their reciprocal interactions in relation to the considered new technologies (i.e., internet of things, block chain, big data, and artificial intelligence), which allow actors to increase their utility exploiting the advancement of current intelligent transport systems. The changes in the generalized path costs supported by each stakeholder are explored, and the modifications guided by e-ICTs are analyzed. The learning process due to the update for within-day and day-to-day dynamics is detailed and formalized. In this way, the current formulation of the classical transport problem (vehicle routing and scheduling) and the new one (pushed from the growth of ecommerce, i.e., courier routing) are explored under the light of the new knowledge derived from the use of e-ICTs. Novelty of the study mainly comprises the analysis of each emerging ICT group and of the formalization, in the classical transport system models (TSM), of the new knowledge for each actor group.", "keywords": [ "Information and Communications Technology", "Computer science", "Novelty", "Knowledge management", "Big data", "Supply chain", "Supply chain management", "Smart city", "The Internet", "Relation (database)", "Process management", "Business" ], "cited_by_count": 48, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.frontiersin.org/articles/10.3389/ffutr.2022.887307/pdf" }, { "id": "https://openalex.org/W3194124356", "doi": "10.1016/j.scs.2021.103168", "title": "Monitoring of urban freight flows distribution considering the human factor", "year": 2021, "publication_date": "2021-08-14", "type": "article", "language": "en", "authors": [ "Natalia Davidich", "Andrii Galkin", "Stanisław Iwan", "Kinga Kijewska", "Igor Chumachenkо", "Yurii Davidich" ], "first_author": "Natalia Davidich", "venue": "Sustainable Cities and Society", "publisher": "Elsevier BV", "abstract": "The intensive growth of urban freight transport leads to an increase in the amount of transport links, which causes problems such as traffic congestion, an imbalance between the transport services demand and the actual capacity of roads, and the negative impact on the environment. This leads to advanced requirements for urban industrial infrastructures. To optimise freight flows, it becomes necessary to determine the patterns of how drivers choose their routes between the origin and destination points. Drivers participate directly in the transportation process. From the driver's perspective, decision-making about the current route is predicated on the technological parameters of the transportation process (speed, time, etc.), the traffic load of the urban roads, and traffic safety, but also on the level of influence of urban freight flows on the environment. The environmental impact of transportation processes is directly related to the quality of life of city dwellers and increasing of the city sustainability level. This research paper aims to determine the patterns of urban freight flows generation while considering the human factor. The choice of route parameters is significantly affected by individual characteristics of the drivers, which are dependent on the properties of the central nervous system. These properties are grouped by type of temperament. Traffic parameters on different routes have various effects on drivers of dissimilar temperaments. Having estimated the influence of each parameter on the drivers, it is possible to identify preferences of choosing a driving route from among many alternatives. The results of the survey made it possible to determine the parameters of the routes chosen by the drivers moving between the points of departure and arrival of goods, considering the age and temperament of the drivers. The results of the research study described the models for changing the share of origin-destination trips of freight transport, which is performed by drivers of different temperaments along each of the possible routes. This information can be used in modelling of freight transport flows within a city. It could significantly influence the quality of life in the cities and make cities more compliant with social expectations.", "keywords": [ "Transport engineering", "Process (computing)", "Traffic congestion", "Sustainability", "Quality (philosophy)", "Traffic management", "Distribution (mathematics)", "Business", "Computer science", "Engineering", "Ecology" ], "cited_by_count": 36, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S2210670721004492/pdf" }, { "id": "https://openalex.org/W2781622569", "doi": "10.1016/j.tre.2017.12.011", "title": "Predicting travel pattern changes of freight trucks in the Tokyo Metropolitan area based on the latest large-scale urban freight survey and route choice modeling", "year": 2018, "publication_date": "2018-01-02", "type": "article", "language": "en", "authors": [ "Hideki Oka", "Yasukatsu Hagino", "Takeshi Kenmochi", "Ryota Tani", "Ryuta Nishi", "Kotaro Endo", "Daisuke Fukuda" ], "first_author": "Hideki Oka", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Truck", "Metropolitan area", "Transport engineering", "Scale (ratio)", "Ring road", "Geography", "Engineering", "Cartography", "Automotive engineering" ], "cited_by_count": 45, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2017.12.011" }, { "id": "https://openalex.org/W2598022189", "doi": "10.1007/s13748-017-0122-8", "title": "Using simheuristics to promote horizontal collaboration in stochastic city logistics", "year": 2017, "publication_date": "2017-03-23", "type": "article", "language": "en", "authors": [ "Carlos L. Quintero-Araújo", "Aljoscha Gruler", "Angel Alejandro Juan", "Jésica de Armas", "Helena Ramalhinho" ], "first_author": "Carlos L. Quintero-Araújo", "venue": "Progress in Artificial Intelligence", "publisher": "Springer Science+Business Media", "abstract": null, "keywords": [ "Vehicle routing problem", "Computational intelligence", "Computer science", "Monte Carlo method", "City logistics", "Order (exchange)", "Metaheuristic", "Operations research", "Mathematical optimization", "Routing (electronic design automation)", "Transport engineering", "Artificial intelligence" ], "cited_by_count": 26, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s13748-017-0122-8" }, { "id": "https://openalex.org/W7154984860", "doi": "10.1007/s10479-026-07220-y", "title": "A two-echelon vehicle routing problem with multi-trips, synchronisation constraints and direct deliveries, in the context of city logistics", "year": 2026, "publication_date": "2026-04-20", "type": "article", "language": "en", "authors": [ "Bruno Oliveira", "Antonio Galrao Ramos", "Jorge Pinho de Sousa" ], "first_author": "Bruno Oliveira", "venue": "Annals of Operations Research", "publisher": "Springer Science+Business Media", "abstract": "Abstract This work studies a two-echelon distribution system, in the context of city logistics, where storage is not permitted at intermediate transfer locations. Therefore, vehicles operating at both echelons need to be synchronised in time and space, allowing loads to be directly transferred from the first to the second echelon vehicles. Moreover, the problem considers that vehicles operating at the first echelon can perform direct deliveries to customers, that load transfers may occur at some customers’ locations, and that vehicles operating at the second echelon are able to perform multiple trips before returning to the depot at the end of the day. To address this problem, we propose a novel mixed integer programming (MIP) model for the two-echelon, multi-trip vehicle routing problem with satellite synchronisation and direct deliveries (2E-MTVRPSS-DD). We tighten this formulation with several sets of valid inequalities, including symmetry breaking constraints based on lexicographical ordering, vehicle rounded capacity constraints, and satellite rounded capacity constraints. We test the model using a commercial solver with newly generated instances, and present computational results, as well as an evaluation of the performance of the proposed valid inequalities. The results show that for relatively small instances, the proposed model is able to solve the problem optimally, but in general, is unable to solve large instances in acceptable computational time, even when considering the proposed valid inequalities. Nevertheless, we show that adding these valid inequalities has a positive impact in improving the model’s linear relaxation, with better lower and upper bounds, and ultimately in improving the MIP gaps. Moreover, we show that adding symmetry breaking constraints based on lexicographical ordering has a negative impact, in terms of computational time, for the solver to find a first upper bound, and that this issue may be overcome by warm-starting the MIP model.", "keywords": [ "Lexicographical order", "Context (archaeology)", "Solver", "Vehicle routing problem", "Integer programming", "Theory of computation", "Transfer (computing)", "Routing (electronic design automation)" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1007/s10479-026-07220-y" }, { "id": "https://openalex.org/W2034407146", "doi": "10.3141/2410-10", "title": "City Logistics", "year": 2014, "publication_date": "2014-01-01", "type": "article", "language": "en", "authors": [ "Lan Jiang", "Hani S. Mahmassani" ], "first_author": "Lan Jiang", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "This paper addresses freight management in large, congested urban settings. Congestion creates a substantial variation in travel time (speeds) during morning peak and evening peak periods. Besides the day-to-day dynamics of traffic conditions, traffic incidents contribute significantly to urban congestion, resulting in unplanned travel delays. Urban route designs that ignore such significant variations are often found to be inefficient or even infeasible (in regard to delivery or pickup time windows) in a congested traffic environment. This limitation may lead to delays, higher operational costs, and inferior customer service. To take the dynamics of traffic conditions into account, the proposed modeling framework includes an underlying dynamic network traffic simulation-assignment model that is able to compute time-dependent shortest paths (TDSPs) and simulate individual vehicles on a realistic representation of urban road network elements, including signalization, ramp metering, and other operational controls. A two-phase set-partitioning–based heuristic approach is proposed to construct freight vehicle routes. No parameter tuning is required. The integrated modeling framework was first tested on a small network, and then the application was demonstrated on a real-world urban network, the Chicago, Illinois, area network, with problem instances of up to 500 customers with TDSPs updated at 10-min intervals.", "keywords": [ "Transport engineering", "Traffic congestion", "Computer science", "Heuristic", "Level of service", "Urban network", "Set (abstract data type)", "Metering mode", "Service (business)", "Operations research", "Simulation", "Engineering" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/2410-10" }, { "id": "https://openalex.org/W1496923398", "doi": "10.5772/5564", "title": "Application of Simulated Annealing to Routing Problems in City Logistics", "year": 2008, "publication_date": "2008-09-01", "type": "book-chapter", "language": "en", "authors": [ "Hisafumi Kokubugata", "Hironao Kawashim" ], "first_author": "Hisafumi Kokubugata", "venue": "InTech eBooks", "publisher": null, "abstract": "Simulated Annealing 132 a variety of routing problems in city logistics, is proposed in this chapter.Evaluation of the proposed method is conducted by comparisons on computational results with those derived from other heuristics. How to referenceIn order to correctly reference this scholarly work, feel free to copy and paste the following: Hisafumi Kokubugata and Hironao Kawashima (2008).Application of Simulated Annealing to Routing Problems in City Logistics, Simulated Annealing, Cher Ming Tan (Ed.),", "keywords": [ "Simulated annealing", "Vehicle routing problem", "City logistics", "Materials science", "Routing (electronic design automation)", "Computer science", "Business", "Computer network", "Transport engineering", "Engineering", "Machine learning" ], "cited_by_count": 17, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.intechopen.com/citation-pdf-url/4627" }, { "id": "https://openalex.org/W3111217629", "doi": "10.1016/j.tre.2020.102147", "title": "Real-time demand forecasting for an urban delivery platform", "year": 2020, "publication_date": "2020-12-07", "type": "article", "language": "en", "authors": [ "Alexander Hess", "Stefan Spinler", "Matthias Winkenbach" ], "first_author": "Alexander Hess", "venue": "Transportation Research Part E Logistics and Transportation Review", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Exponential smoothing", "Demand forecasting", "Computer science", "Demand patterns", "Smoothing", "Routing (electronic design automation)", "Selection (genetic algorithm)", "Machine learning", "Operations research", "Artificial intelligence", "Demand management", "Engineering" ], "cited_by_count": 50, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tre.2020.102147" }, { "id": "https://openalex.org/W1977423520", "doi": "10.3141/2269-15", "title": "Evaluation of Distance-Based and Cordon-Based Urban Freight Road Pricing in E-Commerce Environment with Multiagent Model", "year": 2012, "publication_date": "2012-01-01", "type": "article", "language": "en", "authors": [ "Joel S.E. Teo", "Eiichi Taniguchi", "Ali Gul Qureshi" ], "first_author": "Joel S.E. Teo", "venue": "Transportation Research Record Journal of the Transportation Research Board", "publisher": "SAGE Publishing", "abstract": "E-commerce is gradually changing the way shoppers acquire goods and services. Shoppers seek ways to purchase goods easily through the Internet, and shippers or producers offer cheap ways to deliver goods to their customers through the services of carriers for home delivery. A theoretical model was established to evaluate city logistics schemes for multiple stakeholders before implementation. Policy measures to manage truck operations in the city and keep pollution levels at a minimum were evaluated. Cordon-based freight road pricing was found to provide better pollution reduction compared with distance-based pricing, but cordon-based pricing had less impact on areas outside a city. The problem was solved with a modeling approach for multiagent systems that used a vehicle routing problem with time windows, freight electronic marketplaces, and Q-learning.", "keywords": [ "Truck", "City logistics", "Transport engineering", "Business", "Road pricing", "The Internet", "Vehicle routing problem", "Traffic management", "Computer science", "Routing (electronic design automation)", "Traffic congestion", "Engineering" ], "cited_by_count": 35, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.3141/2269-15" }, { "id": "https://openalex.org/W2801358948", "doi": "10.1016/j.tranpol.2018.04.006", "title": "Planning urban distribution center location with variable restocking demand scenarios: General methodology and testing in a medium-size town", "year": 2018, "publication_date": "2018-04-25", "type": "article", "language": "en", "authors": [ "Giuseppe Musolino", "Corrado Rindone", "Antonio Polimeni", "Antonino Vitetta" ], "first_author": "Giuseppe Musolino", "venue": "Transport Policy", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Sustainability", "Transport engineering", "Variable (mathematics)", "Measure (data warehouse)", "Order (exchange)", "City logistics", "Distribution (mathematics)", "Business", "Duration (music)", "Routing (electronic design automation)", "Set (abstract data type)", "Location model" ], "cited_by_count": 58, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.tranpol.2018.04.006" }, { "id": "https://openalex.org/W2045133551", "doi": "10.1016/j.sbspro.2012.03.104", "title": "A Collaborative Urban Distribution Network", "year": 2012, "publication_date": "2012-01-01", "type": "conference-paper", "language": "en", "authors": [ "Russell George Thompson", "Kim Peter Hassall" ], "first_author": "Russell George Thompson", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "Many urban areas are experiencing an increase in the number of trucks and vans delivering goods to retailers as well as a decrease in the utilisation of delivery vehicles. This leads to increased emissions, noise and conflicts with pedestrians. Large metropolitan areas often have a number of retail centres with outlets being regularly serviced by wholesalers. Urban distribution systems are typically characterised by suppliers operating their own vehicle fleets, distributing only their goods to their customers on a regular basis. Within specific sectors there is an opportunity to combine urban distribution networks to reduce the number of vehicles required for deliveries as well as the distance travelled by delivery vehicles. This can result in substantial savings in transport operating costs for carriers as well as reduced emissions and noise from freight vehicles. It is common in urban distribution networks for suppliers to distribute only their goods to retail outlets. This involves each supplier operating vehicles to carry each retailer's goods and vehicles must visit each retail outlet regularly from the supplier's warehouse. While routes and schedules can be optimised for each wholesaler, vehicles generally have low utilisation. This paper estimates the benefits of a collaborative distribution network that involves suppliers sharing the use of vehicles as well as their storage areas. With the collaborative system, a transfer route is used to transfer goods between suppliers where goods with destinations near other suppliers are transferred to these suppliers. This allows delivery routes from suppliers to be developed with higher utilisation and lower travel distances. A hypothetical urban distribution system is used to estimate the performance of the collaborative distribution system. The process used to transform independent distribution systems to collaborative networks is also presented.", "keywords": [ "Metropolitan area", "Truck", "Business", "Distribution (mathematics)", "Destinations", "Transport engineering", "Transfer (computing)", "Computer science", "Tourism", "Engineering" ], "cited_by_count": 42, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S187704281200571X/pdf" }, { "id": "https://openalex.org/W3133151256", "doi": "10.1109/logistiqua49782.2020.9353927", "title": "The vehicle routing problem with Time Window and Stochastic Demands(VRPTW-SD): Review", "year": 2020, "publication_date": "2020-12-02", "type": "conference-paper", "language": "en", "authors": [ "Mariem Boujlil", "Saâd Lissane Elhaq" ], "first_author": "Mariem Boujlil", "venue": null, "publisher": null, "abstract": "Our paper presents the first trial to make a review dedicated for the vehicle routing problem with time window and stochastic demands (VRPTW-SD). Since 1997, when Ong et al. [39] introduced the VRPTW-SD, no specific review was established to deal with this variant of the vehicle routing problem (VRP). Due to the fast evolution in the urban freight transport, the VRPTW-SD gained more attention, and tends to be considered as a respond to the need of a practical mathematical solution of the VRP, which takes into account two most important variables: time window and customer's demand. This work treats the VRP literature and presents a state of art of the VRP with time window (VRPTW) and the VRP with stochastic demands (VRPSD), which are the two aim elements to understand the advancement in this field, and highlight the importance of joining a deterministic problem with a stochastic one such as the VRPTW-SD.", "keywords": [ "Vehicle routing problem", "Computer science", "Routing (electronic design automation)", "Mathematical optimization", "State (computer science)", "Mathematics", "Algorithm" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/logistiqua49782.2020.9353927" }, { "id": "https://openalex.org/W3108344908", "doi": "10.3390/systems8040049", "title": "An Application of an Urban Freight Transportation System for Reduced Environmental Emissions", "year": 2020, "publication_date": "2020-11-29", "type": "article", "language": "en", "authors": [ "Evripidis P. Kechagias", "Sotiris P. Gayialis", "Grigorios D. Konstantakopoulos", "Georgios A. Papadopoulos" ], "first_author": "Evripidis P. Kechagias", "venue": "Systems", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Today, there is a great need for greener urban freight transportations due to their ever-increasing environmental impact. The planet’s climate has been significantly affected as the temperature is constantly rising and extreme weather events are occurring more and more often. Aiming to reduce the environmental impact of freight transportation in urban areas, an advanced vehicle routing and scheduling system for improving urban freight transportations, has been developed. This paper presents the functionality of the advanced system, while also analyzing its subsystems and demonstrating its use in a case study. The system is provided as an integrated cloud-based software to support the needs of logistics companies, in order to efficiently schedule their deliveries and perform the routing of their vehicles. The utilized multi-objective algorithm produces solutions that minimize either the distribution cost or the environmental emissions or a combination of these parameters. An application of the system is performed for validation purposes, concerning the comparison of the system’s results with corresponding real-life data provided by a medium-sized logistics company. The results of the testing reveal its significant contribution to the reduction of the environmental impact of the company’s distribution services.", "keywords": [ "Schedule", "Scheduling (production processes)", "Vehicle routing problem", "Transport engineering", "Green logistics", "Environmental impact assessment", "Routing (electronic design automation)", "Environmental science", "Computer science", "Environmental economics", "Engineering", "Operations management" ], "cited_by_count": 30, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2079-8954/8/4/49/pdf?version=1606801912" }, { "id": "https://openalex.org/W2023718892", "doi": "10.1016/j.jtrangeo.2014.04.006", "title": "Telematics, urban freight logistics and low carbon road networks", "year": 2014, "publication_date": "2014-05-01", "type": "article", "language": "en", "authors": [ "Guy H. Walker", "Alastair Manson" ], "first_author": "Guy H. Walker", "venue": "Journal of Transport Geography", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Telematics", "Transport engineering", "Interface (matter)", "Computer science", "Order (exchange)", "Duration (music)", "Engineering", "Telecommunications", "Business" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.jtrangeo.2014.04.006" }, { "id": "https://openalex.org/W2162201104", "doi": null, "title": "Using a GIS-Based Emissions Minimization Vehicle Routing Problem with Time Windows (EVRPTW) Model to Evaluate CO2 Emissions and Cost Trade-offs in a Case Study of an Urban Delivery System", "year": 2011, "publication_date": "2011-01-01", "type": "article", "language": "en", "authors": [ "Erica Wygonik", "Anne Goodchild" ], "first_author": "Erica Wygonik", "venue": "Transportation Research Board 90th Annual MeetingTransportation Research Board", "publisher": null, "abstract": "Growing pressure to limit greenhouse gas emissions is changing the way businesses operate. A model was developed in ArcGIS to evaluate the trade-offs between cost, service quality (represented by time window guarantees), and emissions of urban pickup and delivery systems under these changing pressures. A specific case study involving a real fleet with specific operational characteristics is modeled as an emissions minimization vehicle routing problem with time windows (EVRPTW). 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.", "keywords": [ "Minification", "Greenhouse gas", "Vehicle routing problem", "Routing (electronic design automation)", "Fuel efficiency", "Operating cost", "Total cost", "Transport engineering", "Environmental economics", "Automotive engineering", "Environmental science", "Operations research" ], "cited_by_count": 7, "is_retracted": false, "is_paratext": false, "open_access_url": "https://trid.trb.org/view/1091762" }, { "id": "https://openalex.org/W2026778502", "doi": "10.1016/j.sbspro.2014.01.1480", "title": "Intermodal Transport Cost Model and Intermodal Distribution in Urban Freight", "year": 2014, "publication_date": "2014-03-01", "type": "conference-paper", "language": "en", "authors": [ "Behzad Kordnejad" ], "first_author": "Behzad Kordnejad", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "This study aims to model a regional rail based intermodal transport system and to examine the feasibility of it through a case study for a shipper of daily consumables distributing in an urban area and to evaluate it regarding cost and emissions. The idea of an intermodal line train is that of making intermediate stops along the route thus enabling the coverage of a larger market area than conventional intermodal services, hence reducing the high costs associated with feeder transports, the congestion on the road network and generated externalities. The results of the case study indicate that the most critical parameters for the feasibility of such a system are the loading space utilization of the train and the cost for terminal handling.", "keywords": [ "Transport engineering", "Consumables", "Externality", "Business", "Computer science", "Engineering", "Economics" ], "cited_by_count": 34, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877042814015183/pdf" }, { "id": "https://openalex.org/W4297631085", "doi": "10.48550/arxiv.2209.01461", "title": "Modular Vehicle Routing for Combined Passenger and Freight Transport", "year": 2022, "publication_date": "2022-09-03", "type": "preprint", "language": "en", "authors": [ "Jonas Hatzenbühler", "Erik Jenelius", "Győző Gidófalvi", "Oded Cats" ], "first_author": "Jonas Hatzenbühler", "venue": "arXiv (Cornell University)", "publisher": "Cornell University", "abstract": "The continuous increase in urban deliveries and the ongoing urbanization of large cities require the development of efficient and sustainable transportation solutions. This study investigates the impact of modular vehicle concepts and the consolidation of different demand types in the route planning on the efficiency of the urban freight and passenger transportation system. Modularity is achieved by connecting multiple vehicles together to form a platoon. The consolidation of different demand types is realized by simultaneously consider passenger and freight demand in the optimization algorithm. The considered vehicles are specific for each demand type by can be connected freely, hence it is possible to transport different demand types in the same platoon. The cost terms in the problem formulation are comprised of travel time costs, travel distance costs, fleet size costs, and cost considering unserved requests. The modular vehicle operations are modeled in a novel pickup and delivery problem which is solved using CPLEX and Adaptive Large Neighborhood Search. In an extensive scenario study and case study in Stockholm, the potentials of the new modular vehicle type are explored for different spatial and temporal demand distributions. A parameter study on vehicle capacity, vehicle range and cost saving assumptions is performed to study their influence on the efficiency. The experiments carried out indicate a general cost savings of 48% due to modularity and an additional 9% due to consolidation. The reduction mainly stems from reduced operating costs and reduced trip duration, while the same number of requests can be served in all cases. Empty vehicle kilometers are reduced by more than 60% by consolidation and modularity. The proposed model and optimization framework can be used by companies and policy makers to identify required fleet sizes, optimal vehicle routes and cost savings.", "keywords": [ "Modular design", "Vehicle routing problem", "Platoon", "Transport engineering", "Computer science", "Consolidation (business)", "Pickup", "Operations research", "Routing (electronic design automation)", "Engineering", "Business" ], "cited_by_count": 14, "is_retracted": false, "is_paratext": false, "open_access_url": "https://arxiv.org/pdf/2209.01461" }, { "id": "https://openalex.org/W2120357552", "doi": "10.6092/unina/fedoa/3898", "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": [ "Claudio Sterle" ], "first_author": "Claudio Sterle", "venue": "Università degli Studi di Napoli Federico II", "publisher": null, "abstract": "In this thesis two City Logistics problems have been tackled. The first is a design problem for a two-echelon freight distribution system. The aim is to define the structure of a system optimizing the location and the number of two different kinds of facilities, the size of two different vehicle fleets and the related routes on each echelon. The problem has been modeled as a two-echelon location-routing problem (2E-LRP). It is NP-hard and the results obtained with the proposed models, in terms of quality of solution and computation time, confirmed the need of approaching it with a heuristic method. To this aim a Tabu Search heuristic has been proposed and implemented. It is based on the decomposition of the whole problem in four subproblems, one FLP and one VRP for each echelon. The four sub-problems are sequentially and iteratively solved and their solutions are opportunely combined in order to determine a good global solution. Tabu Search has been experienced on three set instances. Experimental results prove that the proposed TS is effective in terms of quality of solutions and computation times in the most of the solved instances. The second problem concerns the location of flow intercepting facilities (FIFLP). Differently to what happens in classical location problems, in this case facilities do not generate and/or attract flows, but they intercept flows traveling on the network. The aim is to define the locations of the facilities which optimize a performance criterion related to the flow values on each path. This is a path-covering problem which finds many applications in City Logistics. Four problems of flow intercepting facility location have been treated with several models and methods, some of them present in literature and other proposed by us. An extensive computational experimentation of them has been carried out in terms of quality of solutions and computation times. FIFLP models have been successfully applied to transportation and communication networks.", "keywords": [ "Tabu search", "Mathematical optimization", "Heuristic", "Vehicle routing problem", "Computation", "Path (computing)", "Routing (electronic design automation)", "Computer science", "Quality (philosophy)", "Set (abstract data type)", "Flow network", "Mathematics" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.6092/unina/fedoa/3898" }, { "id": "https://openalex.org/W581450603", "doi": "10.5821/dissertation-2117-95002", "title": "Combination of vehicle routing models and dynamic traffic simulation for city logistics applications", "year": 2012, "publication_date": "2012-06-08", "type": "dissertation", "language": "en", "authors": [ "Hanna Grzybwska" ], "first_author": "Hanna Grzybwska", "venue": null, "publisher": null, "abstract": "The urban network is a highly dynamic system. Thus, a modern and efficient fleet management in urban areas should account for dynamics of traffic conditions, variability in travel times, changes in demand and fleet availability. All these factors significantly affect the distribution of goods and the provision of services. As a consequence, the freight operations optimizing approaches should be based on the time-dependent travel time estimates rather than on the average static values commonly employed as input data. Proficient dynamic fleet management decisions need to take into consideration all the factors conditioning the addressed problem. Hence, the customers’ requests and service conditions (demands, time windows, etc.), operational conditions of the employed fleet (vehicles’ availability, status, positions, current occupancy of the carriage space, etc.) and traffic conditions need to be reckoned with. This information can be provided in the real-time fashion and at an affordable price by the ICT applications and tools such as: ATIS, GPS, GPRS or other. Instead of relying exclusively on the experience of a dispatcher, it is effective to base the freight management decisions on information provided by a professional Decision Support System facilitating the consideration of all the factors conditioning the addressed issue. The objective of the present thesis is to propose, implement and computationally test, on the basis of a simulation, the architecture of a Decision Support System for real-time freight management able of accounting for all the dynamic factors mentioned above. Its design is based on integration of a selected pickup and delivery vehicle routing model and dynamic traffic simulation models, whose purpose is to carefully emulate the evolving traffic conditions. The optimal dynamic routing and scheduling of a vehicle fleet is obtained due to dynamic modifications of the current routing and scheduling plan on the basis of the recently revealed information conditioning the addressed problem. The obtained results of computational experiments show that the performance of freight fleet strongly depends on the traffic information used to create the routing and scheduling plan. Due to the special character of transport operations performed in metropolitan areas it is possible that not all the scheduled customers would be served, although a feasible initial solution is created on the basis of the historical travel times’ data. Hence, there is a need to implement real-time rerouting strategies allowing modifications of the original routes in order to feasibly fulfil the routing tasks. In addition, the tighter the constraints specifying the customers’ time windows and the higher the number of dynamically appearing requests, the higher the cost of the performance and the level of utilization of the freight fleet. La red urbana es un sistema altamente dinámico. Por lo tanto, la gestión moderna y eficiente de la flota en las zonas urbanas debe tener en cuenta la dinámica de las condiciones del tráfico, la variabilidad en los tiempos de viaje y los cambios en la disponibilidad de la demanda y de la flota, ya que afectan de manera significativa en la distribución de bienes y la prestación de servicios. Como consecuencia, los enfoques para optimizar las operaciones de carga deben basarse en las estimaciones de los tiempos de viaje dependientes del tiempo y no en los valores medios estáticos comúnmente empleados como datos de entrada. Las decisiones competentes de gestión dinámica de las flotas necesitan tener en cuenta todos los factores que condicionan el problema abordado. Por lo tanto, hay que considerar las características de las peticiones y las condiciones de servicio de los clientes (demanda, ventanas de tiempo, etc.), las condiciones operacionales de la flota empleada (disponibilidad de los vehículos, estatus, ubicación, ocupación actual del espacio de transporte, etc.) y las condiciones de tráfico. Esta información puede ser proporcionada en tiempo real a un precio asequible por las aplicaciones de las TIC y herramientas tales como: ATIS, GPS, GPRS u otros. En lugar de confiar exclusivamente en la experiencia de un distribuidor, también sería correcto basar las decisiones de gestión de transporte de mercancías en la información proporcionada por un sistema profesional de apoyo a la toma de decisiones que facilita la consideración de todos los factores que condicionan el problema abordado. El objetivo de esta tesis es proponer, implementar y validar computacionalmente en base a la simulación, la arquitectura de un Sistema de Apoyo a la Toma de Decisiones para la gestión de transporte de mercancías en tiempo real capaz de considerar todos los factores dinámicos previamente mencionados. Su diseño se basa en la integración de un modelo seleccionado de rutas de vehículos con recogida y entrega y modelos de simulación de tráfico dinámicos cuyo propósito es emular detalladamente las condiciones de tráfico que cambian con el paso del tiempo. Las rutas y los horarios dinámicos óptimos para una flota de vehículos que transporta mercancías se obtienen de las modificaciones dinámicas de un plan actual de rutas y horarios en base a la nueva información recibida que condiciona el problema abordado. Los resultados obtenidos de los experimentos computacionales demuestran que el rendimiento de la flota de transporte de mercancías depende en gran medida de la información de tráfico utilizada para crear el plan de rutas y los horarios. Debido al carácter especial de las operaciones de transporte realizadas en las áreas metropolitanas, a pesar de una solución inicial factible que se crea sobre la base de los datos históricos de los tiempos de viaje, es posible que no todos los clientes sean servidos. Por lo tanto, hay una necesidad de implementar estrategias de cambios de rutas en tiempo real, que permiten modificar las rutas originales con el fin de cumplir las tareas de enrutamiento viables. Ade", "keywords": [ "Transport engineering", "Operations research", "Service (business)", "Routing (electronic design automation)", "Fleet management", "Global Positioning System", "Vehicle routing problem", "Computer science", "Engineering", "Computer network", "Telecommunications" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.5821/dissertation-2117-95002" }, { "id": "https://openalex.org/W1711829765", "doi": "10.1049/iet-its.2014.0212", "title": "Solving new urban freight distribution problems involving modular electric vehicles", "year": 2015, "publication_date": "2015-06-29", "type": "article", "language": "en", "authors": [ "Wassila Aggoune‐Mtalaa", "Zineb Habbas", "Amine Ait-Ouahmed", "Djamel Khadraoui" ], "first_author": "Wassila Aggoune‐Mtalaa", "venue": "IET Intelligent Transport Systems", "publisher": "Institution of Engineering and Technology", "abstract": "Vehicle routing problem (VRP) have been intensively studied over the past few years. Indeed, a strong strand of research is devoted to aid freight companies or public authorities in making their decisions. Nowadays, new solutions are proposed that take into account new technologies enabling the design of electric vehicles which can be used in new mobility schemes or help fleet owners stay competitive when delivering freight. In this study, the aim is to investigate the innovative concept of modular electric vehicles for goods delivery in cities. More precisely, the vehicles considered in this study can be split into two or several modules which can be let at a dedicated location and retrieved later during a run for charging purposes or to gain agility. The objective is then to address the challenging issues associated with the use of these new modular electric vehicles for urban freight transport. It is a completely new problem integrating both the complexity of the original VRP and specific constraints induced by using modular electric vehicles in urban environment. This study presents a first formulation of this problem together with a complete effective solving approach which shows promising results.", "keywords": [ "Modular design", "Vehicle routing problem", "Transport engineering", "Routing (electronic design automation)", "Computer science", "City logistics", "Electric vehicle", "Operations research", "Engineering", "Embedded system" ], "cited_by_count": 30, "is_retracted": false, "is_paratext": false, "open_access_url": "https://onlinelibrary.wiley.com/doi/pdfdirect/10.1049/iet-its.2014.0212" }, { "id": "https://openalex.org/W2003677825", "doi": "10.1016/j.ejor.2011.07.030", "title": "Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking", "year": 2011, "publication_date": "2011-08-02", "type": "article", "language": "en", "authors": [ "Viet‐Phuong Nguyen", "Christian Prins", "Caroline Prodhon" ], "first_author": "Viet‐Phuong Nguyen", "venue": "European Journal of Operational Research", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "GRASP", "Heuristics", "Metaheuristic", "Computer science", "Mathematical optimization", "Greedy randomized adaptive search procedure", "Reinforcement learning", "Vehicle routing problem", "Path (computing)", "Constructive", "Routing (electronic design automation)", "Process (computing)" ], "cited_by_count": 215, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.ejor.2011.07.030" }, { "id": "https://openalex.org/W2991653553", "doi": "10.48295/et.2020.78.8", "title": "Simulated Annealing Algorithm for Multi Depot Two-Echelon Capacitated Vehicle Routing Problem", "year": 2020, "publication_date": "2020-06-01", "type": "article", "language": "en", "authors": [ "Surendra Reddy Kancharla" ], "first_author": "Surendra Reddy Kancharla", "venue": "European Transport/Trasporti Europei", "publisher": "University of Trieste", "abstract": "Although urban freight transport is a significant contributor to the development of a country, it has adverse effects on the environment and the quality of life in urban areas. To reduce these adverse effects, we can deploy sustainable city logistic strategies. Scheduling and routing of vehicles is a crucial decision in city logistic strategies. Hence, in this paper, we solve the Multi-Depot Two Echelon Capacitated Vehicle Routing Problem (MD2E-CVRP), which is a variant of Vehicle Routing Problem (VRP) with heterogeneous fleets at both levels. Since VRP is NP-hard, we have proposed a Simulated Annealing (SA) based heuristic solution algorithm and have tested it on the standard 2E- CVRP and MD2E-CVRP instances. The results obtained from SA have a good solution quality at just one-fiftieth of computational time using CPLEX and was found to be faster than Adaptive Large Neighborhood Search (ALNS) with only a marginal drop in solution quality.", "keywords": [ "Vehicle routing problem", "Mathematical optimization", "Simulated annealing", "Computer science", "Depot", "Algorithm", "Routing (electronic design automation)", "Mathematics", "Computer network" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.48295/et.2020.78.8" }, { "id": "https://openalex.org/W1799906339", "doi": "10.11175/eastsats.2.48", "title": "Exact Solution for Vehicle Routing Problem with Soft Time Windows and Dynamic Travel Time", "year": 2012, "publication_date": "2012-01-01", "type": "article", "language": "en", "authors": [ "Ali Gul Qureshi", "Eiichi Taniguchi", "Tadashi Yamada" ], "first_author": "Ali Gul Qureshi", "venue": "Medical Entomology and Zoology", "publisher": "Japan Society of Medical Entomology and Zoology", "abstract": "The traffic conditions in urban areas change with time due to varying congestion levels and incidents, resulting in unexpected variations of travel time on the infrastructure links. These conditions lead to the formulation of the Dynamic Vehicle Routing and scheduling Problem with Soft Time Windows (D-VRPSTW) with dynamic travel time in the city logistics field. This paper presents a column generation-based exact solution approach for the D-VRPSTW. The performance evaluation on a test instance under different dynamic travel time events shows that the D-VRPSTW solutions based on the updated travel times result in significant cost savings as compared to the static version.", "keywords": [ "Vehicle routing problem", "Travel time", "Scheduling (production processes)", "Computer science", "Traffic congestion", "Routing (electronic design automation)", "Column generation", "Operations research", "Real-time computing", "Transport engineering", "Mathematical optimization", "Engineering" ], "cited_by_count": 4, "is_retracted": false, "is_paratext": false, "open_access_url": "http://ci.nii.ac.jp/naid/130004965105" }, { "id": "https://openalex.org/W4200048714", "doi": "10.1016/j.trd.2021.103121", "title": "Vehicle telematics data for urban freight environmental impact analysis", "year": 2021, "publication_date": "2021-12-06", "type": "article", "language": "en", "authors": [ "Simon Hu", "Siqi Shu", "Justin D.K. Bishop", "Xiaoxiang Na", "Marc E. J. Stettler" ], "first_author": "Simon Hu", "venue": "Transportation Research Part D Transport and Environment", "publisher": "Elsevier BV", "abstract": "Road freight transport is one of the major contributors to greenhouse gas and air pollutant emissions. Hence, it is increasingly regulated in urban areas to reduce its impact on the environment and human health. The rich data available from telematics has the potential to provide high-resolution information, yet research has not been conducted to understand, evaluate, and ultimately improve the operation and impacts of urban road freight. This paper demonstrates the role of vehicle telematics data in enabling quantitative assessment of the impacts of urban freight transport for the effective management of relevant policies. We present a comprehensive data-driven approach that provides a robust quantitative evaluation and applies it to a case study of the London Lorry Control Scheme (LLCS) policy in UK. We show that, for the studied freight operator, the LLCS policy affects their drivers’ route choice both inside and outside the restricted hours. The spatio-temporal distributions of different parameters including traffic speeds, fuel economy and emissions at different times of the day are compared and analyzed. The results indicate that the unintended consequences of urban freight transport policies can include an extra 15% vehicle-km traveled per trip and 12% liter of fuel consumed per trip.", "keywords": [ "Telematics", "Transport engineering", "Traffic management", "Greenhouse gas", "Truck", "Estimation", "Business", "Environmental science", "Environmental economics", "Environmental planning", "Computer science", "Engineering" ], "cited_by_count": 32, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1361920921004168/pdf" }, { "id": "https://openalex.org/W2356460580", "doi": null, "title": "Research of Genetic Algorithm on Allied Vehicle Routing Problems with Transfer Stations", "year": 2007, "publication_date": "2007-01-01", "type": "article", "language": "en", "authors": [ "Lin Zhuo-qiang" ], "first_author": "Lin Zhuo-qiang", "venue": "Computer Technology and Development", "publisher": "China Computer Federation", "abstract": "The advantages and characteristics of the vehicle routing problem with transfer stations is analyzed.On the basis of which an optimized mathematical model to solve the problem is established and the effective genetic algorithm for the model is constructed.Considering the characteristics of urban freight transportation,the new crossover operator is designed in this algorithm.Numerical calculation results indicate that the proposal model and the algorithm can effectively solve the vehicle routing problem with transfer stations.", "keywords": [ "Computer science", "Crossover", "Genetic algorithm", "Vehicle routing problem", "Routing (electronic design automation)", "Basis (linear algebra)", "Transfer (computing)", "Operator (biology)", "Mathematical optimization", "Algorithm", "Computer network", "Artificial intelligence" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://en.cnki.com.cn/Article_en/CJFDTOTAL-WJFZ200706056.htm" }, { "id": "https://openalex.org/W2387855681", "doi": null, "title": "Research of genetic algorithm on allied vehicle routing problems with transfer stations", "year": 2007, "publication_date": "2007-01-01", "type": "article", "language": "en", "authors": [ "Zhiyong Ding" ], "first_author": "Zhiyong Ding", "venue": "Jisuanji yingyong yanjiu", "publisher": "Computer Application in Sichuan Province", "abstract": "Considering the characteristics of urban freight transportation,the advantage and the characteristics of the allied vehicle routing problem(AVRP)with transfer stations was analyzed,on the basis of which an optimized mathematical model to solve the problem was established and the effective genetic algorithm for the model was constructed.The new crossover operator was designed.Numerical calculation results indicate that the proposal model and the algorithm can effectively solve the AVRP with transfer stations.", "keywords": [ "Computer science", "Crossover", "Genetic algorithm", "Routing (electronic design automation)", "Transfer (computing)", "Basis (linear algebra)", "Operator (biology)", "Vehicle routing problem", "Algorithm", "Mathematical optimization", "Operations research", "Computer network" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://en.cnki.com.cn/Article_en/CJFDTOTAL-JSYJ200711025.htm" }, { "id": "https://openalex.org/W226548646", "doi": "10.1108/9780080473222-010", "title": "Modelling effects of e-commerce on urban freight transport", "year": 2004, "publication_date": "2004-07-22", "type": "book-chapter", "language": "en", "authors": [ "Eiichi Taniguchi", "Yasushi Kakimoto" ], "first_author": "Eiichi Taniguchi", "venue": null, "publisher": null, "abstract": "This paper presents models of vehicle routing and scheduling within time windows and traffic simulation for evaluating the effects of e-commerce on urban freight transport and the environment. The models were applied to a test road network. Results indicate that introducing e-commerce (B2C) may lead to more traffic in urban areas and have negative impacts on the environment unless e-commerce is widely used by consumers to some extent. However, some measures including co-operative freight transport systems of home delivery companies, designating time windows by home delivery companies and pickup points are effective to reduce the total costs as well as total running times and emissions.", "keywords": [ "City logistics", "Vehicle routing problem", "Transport engineering", "Scheduling (production processes)", "Traffic management", "Routing (electronic design automation)", "Travel time", "Business", "Computer science", "Environmental economics", "Engineering", "Operations management" ], "cited_by_count": 24, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1108/9780080473222-010" }, { "id": "https://openalex.org/W2780161446", "doi": "10.2208/journalip.26.703", "title": "HYBRID INSERTION HEURISTICS FOR VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS", "year": 2009, "publication_date": "2009-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": "This paper presents a hybrid insertion heuristics (HIH) for the Vehicle Routing and scheduling Problem with Soft Time Windows (VRPSTW) that can be used as an analysis tool to evaluate the effectiveness of many infrastructure planning and management measures belonging to City Logistics such as cooperative delivery systems and ideal location of logistics terminals. The dual information obtained in the column generation master problem was used to guide the optimization in the HIH. Consequently the objective function rapidly converged to a good solution, which resulted in better performance as compared to a simple genetic algorithms heuristics and to another hybrid heuristics.", "keywords": [ "Heuristics", "Vehicle routing problem", "Scheduling (production processes)", "Computer science", "Genetic algorithm", "Routing (electronic design automation)", "Column generation", "Mathematical optimization", "Computer network", "Mathematics" ], "cited_by_count": 3, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.jstage.jst.go.jp/article/journalip1984/26/0/26_703/_pdf" }, { "id": "https://openalex.org/W2801803911", "doi": "10.1016/j.simpat.2018.05.001", "title": "A simulation framework for modeling urban freight operations impacts on traffic networks", "year": 2018, "publication_date": "2018-05-02", "type": "article", "language": "en", "authors": [ "Michele D. Simoni", "Christian G. Claudel" ], "first_author": "Michele D. Simoni", "venue": "Simulation Modelling Practice and Theory", "publisher": "Elsevier BV", "abstract": null, "keywords": [ "Computer science", "Component (thermodynamics)", "Traffic simulation", "Transport engineering", "Traffic generation model", "Operations research", "Distributed computing", "Simulation", "Microsimulation", "Engineering", "Real-time computing" ], "cited_by_count": 35, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1016/j.simpat.2018.05.001" }, { "id": "https://openalex.org/W3165905554", "doi": "10.3390/su13126703", "title": "Dynamic Inventory Routing and Pricing Problem with a Mixed Fleet of Electric and Conventional Urban Freight Vehicles", "year": 2021, "publication_date": "2021-06-12", "type": "article", "language": "en", "authors": [ "Hamid Reza Sayarshad", "Vahid Mahmoodian", "Nebojša Bojović" ], "first_author": "Hamid Reza Sayarshad", "venue": "Sustainability", "publisher": "Multidisciplinary Digital Publishing Institute", "abstract": "Urban freight transport is essential for supporting our society regarding providing the daily needs of consumers and local businesses. In addition, it allows for the movement of goods, is distributed within urban environments, provides thousands of jobs, and supports economic growth. However, a number of issues are associated with urban freight transport, including environmental impacts, road congestion, and land use of freight facilities that conflicts with residential land use. Electric freight vehicles create zero emissions and provide a sustainable delivery system in comparison with conventional freight vehicles. In this study, a novel dynamic inventory routing and pricing problem under a mixed fleet of electric and conventional vehicles was formulated to minimize the total travel and charging costs. The proposed model is capable of deciding on replenishment times and amounts and vehicle routes. We aimed to determine the maximum social welfare (SW) capable of providing an optimal trade-off between the supplier cost and customer delay that uses a mixed fleet of vehicles. Our computational study was conducted on real data generated from a delivery dataset in Tehran. Under the proposed policy with a fleet of only electric vehicles, the SW increased by 3% while the average customer delay reduced by 15% compared with a fleet of conventional vehicles. The results show that the number of served customers and customer delay would be affected by transitioning conventional urban freight vehicles to electric vehicles. Therefore, the proposed delivery system has a significant impact on energy savings and emissions.", "keywords": [ "Transport engineering", "Traffic management", "Business", "Environmental economics", "City logistics", "Vehicle routing problem", "Electric vehicle", "Sustainable transport", "Routing (electronic design automation)", "Traffic congestion", "Computer science", "Sustainability" ], "cited_by_count": 19, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.mdpi.com/2071-1050/13/12/6703/pdf" }, { "id": "https://openalex.org/W1981102640", "doi": "10.1016/j.sbspro.2014.01.1456", "title": "Evaluation of Load Factor Control and Urban Freight Road Pricing Joint Schemes with Multi-agent Systems Learning Models", "year": 2014, "publication_date": "2014-03-01", "type": "conference-paper", "language": "en", "authors": [ "Joel S.E. Teo", "Eiichi Taniguchi", "Ali Gul Qureshi" ], "first_author": "Joel S.E. Teo", "venue": "Procedia - Social and Behavioral Sciences", "publisher": "Elsevier BV", "abstract": "This paper describes the use of the multi-agent systems (MAS) modelling approach, incorporated with reinforcement learning models, that is experimented on a part of Osaka road network with ITS-based travel time information. The MAS model included an exact solution method to solve the vehicle routing problem of carriers’ delivery jobs and is used to evaluate the short-term impact of distance-based road pricing on the major stakeholders including the carriers, shippers, administrators and customers. The evaluation is extended to consider the load factor control scheme implemented as a joint scheme with the urban freight road pricing. The results from our experiment show that the city logistics joint scheme has the potential of improving average daily load factors and reduce emissions in comparison with no schemes implemented.", "keywords": [ "Scheme (mathematics)", "Computer science", "Joint (building)", "Transport engineering", "Control (management)", "Routing (electronic design automation)", "Road pricing", "Load factor", "Reinforcement learning", "City logistics", "Operations research", "Computer network" ], "cited_by_count": 32, "is_retracted": false, "is_paratext": false, "open_access_url": "https://www.sciencedirect.com/science/article/pii/S1877042814014943/pdf" }, { "id": "https://openalex.org/W7117709854", "doi": "10.1109/ojits.2025.3649932", "title": "Dynamic Vehicle Routing Optimization for Urban Distribution Under Real-Time Demand Fluctuations", "year": 2025, "publication_date": "2025-12-31", "type": "article", "language": "en", "authors": [ "Hashim Hashim Armayau", "Jiani Wu", "Wajahat Akbar", "Shuguang Li", "Altaf Hussain", "Insaf Ullah", "Tariq Hussain", "Mehmood Alam", "Weiwei Jiang" ], "first_author": "Hashim Hashim Armayau", "venue": "IEEE Open Journal of Intelligent Transportation Systems", "publisher": "Institute of Electrical and Electronics Engineers", "abstract": "With the rapid rise of e-commerce, the logistics and distribution industry is experiencing unprecedented growth. In particular, intra-city distribution is the crucial “last mile\" of logistics and plays a decisive role in determining overall customer satisfaction. This study improves an inclusive vehicle routing optimization framework for intra-city distribution under dynamic demand. The initiative of a novel memetic algorithm that efficiently solves the NP-hard dynamic vehicle routing problem while guaranteeing high service quality and cost reduction. However, modern intercity distribution systems often struggle with low information, unpredictable demand patterns, and high operational costs due to scattered customer locations and dynamic order information. Addressing these challenges, this study suggests a comprehensive and intelligent vehicle routing optimization framework tailored for intracity distribution under dynamic demand conditions. The proposed system begins with a grey prediction model for short-term demand forecasting across many distribution regions, permitting differentiated vehicle loading methods to optimize transportation costs and improve operational effectiveness. Building upon this, a dynamic vehicle routing optimization model is formulated to reduce costs while assuring high levels of customer satisfaction within strict delivery time windows. To competently manage fluctuating demand, a dynamic information processing approach is introduced; prioritizing customer needs based on their urgency and importance, thereby guaranteeing the timely delivery of critical orders with minimal computational overhead. Moreover, a novel memetic algorithm is considered to solve the complex NP-hard dynamic vehicle routing problem. This algorithm integrates an adaptive elite genetic algorithm for global search with improved crossover and mutation operators, improved by local search methods such as 2-opt and swap methods to refine solutions. Numerical experiments validate the feasibility and performance of the proposed method, indicating significant improvements over conventional fully loaded vehicle schemes and regular route update methods. The results highlight the practical value of the system in attractive intra-city logistics efficiency, reducing costs, and inspiring customer service standards.", "keywords": [ "Vehicle routing problem", "Memetic algorithm", "Routing (electronic design automation)", "Crossover", "Dynamic pricing", "Genetic algorithm", "Multi-objective optimization", "Customer satisfaction", "Optimization problem" ], "cited_by_count": 6, "is_retracted": false, "is_paratext": false, "open_access_url": "https://doi.org/10.1109/ojits.2025.3649932" }, { "id": "https://openalex.org/W4401801467", "doi": "10.1186/s12544-024-00669-7", "title": "Towards greener city logistics: an application of agile routing algorithms to optimize the distribution of micro-hubs in Barcelona", "year": 2024, "publication_date": "2024-08-23", "type": "article", "language": "en", "authors": [ "Cristian Castillo", "Javier Panadero", "Eduard J. Álvarez-Palau", "Angel Alejandro Juan" ], "first_author": "Cristian Castillo", "venue": "European Transport Research Review", "publisher": "Springer Science+Business Media", "abstract": "Abstract The COVID-19 pandemic accelerated the shift towards online shopping, reshaping consumer habits and intensifying the impact on urban freight distribution. This disruption exacerbated traffic congestion and parking shortages in cities, underscoring the need for sustainable distribution models. The European Union's common transport policy advocates for innovative UFD approaches that promote intermodal transportation, reduce traffic, and optimize cargo loads. Our study addresses these challenges by proposing an agile routing algorithm for an alternative UFD model in Barcelona. This model suggests strategically located micro-hubs selected from a set of railway facilities, markets, shopping centers, district buildings, pickup points, post offices, and parking lots (1057 points in total). It also promotes intermodality through cargo bikes and electric vans. The study has two main objectives: (i) to identify a network of intermodal micro-hubs for the efficient delivery of parcels in Barcelona and (ii) to develop an agile routing algorithm to optimize their location. The algorithm generates adaptive distribution plans considering micro-hub operating costs and vehicle routing costs, and using heuristic and machine learning methods enhanced by parallelization techniques. It swiftly produces high-quality routing plans based on transportation infrastructure, transportation modes, and delivery locations. The algorithm adapts dynamically and employs multi-objective techniques to establish the Pareto frontier for each plan. Real-world testing in Barcelona, using actual data has shown promising results, providing potential scenarios to reduce CO 2 emissions and improve delivery times. As such, this research offers an innovative and sustainable approach to UFD, that will contribute significantly to a greener future for cities.", "keywords": [ "Agile software development", "Vehicle routing problem", "City logistics", "Routing (electronic design automation)", "Computer science", "Engineering", "Distribution (mathematics)", "Routing algorithm", "Transport engineering", "Operations research", "Computer network", "Software engineering" ], "cited_by_count": 20, "is_retracted": false, "is_paratext": false, "open_access_url": "https://etrr.springeropen.com/counter/pdf/10.1186/s12544-024-00669-7" } ]