Relevant bibliographies by topics / Vehicle routing problem (VRP)

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Vehicle routing problem (VRP)'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Vehicle routing problem (VRP).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Vehicle routing problem (VRP)"

1

Qin, Hu, Xinxin Su, Teng Ren, and Zhixing Luo. "A review on the electric vehicle routing problems: Variants and algorithms." Frontiers of Engineering Management 8, no. 3 (2021): 370–89. http://dx.doi.org/10.1007/s42524-021-0157-1.

Full text
Abstract:
AbstractOver the past decade, electric vehicles (EVs) have been considered in a growing number of models and methods for vehicle routing problems (VRPs). This study presents a comprehensive survey of EV routing problems and their many variants. We only consider the problems in which each vehicle may visit multiple vertices and be recharged during the trip. The related literature can be roughly divided into nine classes: Electric traveling salesman problem, green VRP, electric VRP, mixed electric VRP, electric location routing problem, hybrid electric VRP, electric dial-a-ride problem, electric
APA, Harvard, Vancouver, ISO, and other styles
2

Erdelić, Tomislav, and Tonči Carić. "A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches." Journal of Advanced Transportation 2019 (May 9, 2019): 1–48. http://dx.doi.org/10.1155/2019/5075671.

Full text
Abstract:
In order to ensure high-quality and on-time delivery in logistic distribution processes, it is necessary to efficiently manage the delivery fleet. Nowadays, due to the new policies and regulations related to greenhouse gas emission in the transport sector, logistic companies are paying higher penalties for each emission gram of CO2/km. With electric vehicle market penetration, many companies are evaluating the integration of electric vehicles in their fleet, as they do not have local greenhouse gas emissions, produce minimal noise, and are independent of the fluctuating oil price. The well-res
APA, Harvard, Vancouver, ISO, and other styles
3

Br Ginting, Emmita, Parapat Gultom, and Sutarman Sutarman. "Optimization Model for Electric Vehicle Routing Problem with Two Charging Options." Sinkron 8, no. 3 (2023): 1446–52. http://dx.doi.org/10.33395/sinkron.v8i3.12577.

Full text
Abstract:
The use of electric vehicles recently is an alternative way to lower pollutants and the emissions of carbon dioxide resulting from the usage of motor vehicle fuel oil. The limited battery capacity of this electric vehicle is a problem for its users. Vehicle routing problem (VRP) is a problem of integer programming and combinatorial optimization that is frequently used in planning and decision-making processes. One application of this issue is to find the best path for delivering items from a corporation to customers. VRP problems are frequently utilized in order to reduce internal expenditure.
APA, Harvard, Vancouver, ISO, and other styles
4

Ferdiani Harahap, Rio, and Sawaluddin. "Study vehicle routing problem using Nearest Neighbor Algorithm." Journal of Physics: Conference Series 2421, no. 1 (2023): 012027. http://dx.doi.org/10.1088/1742-6596/2421/1/012027.

Full text
Abstract:
Abstract Vehicle routing problem (VRP) has a key role in logistics management. VRP plays a role in designing the optimal route used by a number of vehicles placed at the depot to serve a number of customers with known requests. To solve the VRP, the nearest neighbor algorithm used to get the most optimal results. The Nearest Neighbor algorithm is a heuristic method which is done by starting the starting point than looking for the nearest point. In this paper, algorithm nearest neighbour can save the distance of 13,14% and cost 13,17%.
APA, Harvard, Vancouver, ISO, and other styles
5

Ochelska-Mierzejewska, Joanna, Aneta Poniszewska-Marańda, and Witold Marańda. "Selected Genetic Algorithms for Vehicle Routing Problem Solving." Electronics 10, no. 24 (2021): 3147. http://dx.doi.org/10.3390/electronics10243147.

Full text
Abstract:
The traveling salesman problem (TSP) consists of finding the shortest way between cities, which passes through all cities and returns to the starting point, given the distance between cities. The Vehicle Routing Problem (VRP) is the issue of defining the assumptions and limitations in mapping routes for vehicles performing certain operational activities. It is a major problem in logistics transportation. In specific areas of business, where transportation can be perceived as added value to the product, it is estimated that its optimization can lower costs up to 25% in total. The economic benef
APA, Harvard, Vancouver, ISO, and other styles
6

Jayarathna, D. G. N. D. "Survey on Thirty Years of Vehicle Routing Problems: Mathematical Models, Solution Methods, and Real-Life Applications." International Journal of Research and Scientific Innovation XI, no. VII (2024): 435–49. http://dx.doi.org/10.51244/ijrsi.2024.1107032.

Full text
Abstract:
In recent years, warehouse management concerns have become a major focus in logistics management research, and they have been widely used in studying transportation and logistics distribution networks. The purpose of this work is to undertake a Carrying out a comprehensive analytical literature survey of past twenty years on Vehicle Routing Problem (VRP). VRP is a well-studied combinatorial optimization problem in operations research and computer science. The VRP can be classified as Capacitated Vehicle Routing Problem (CVRP), Vehicle Routing Problem with Time Windows (VRPTW), Vehicle Routing
APA, Harvard, Vancouver, ISO, and other styles
7

Usman, Halima, and Omoniyi Raymondjoy Obafemi. "Enhancing Transportation Efficiency in Sokoto State Metropolis Through Vehicle Routing Problem Optimization." International Journal of Science for Global Sustainability 10, no. 3 (2024): 160–66. https://doi.org/10.57233/ijsgs.v10i3.716.

Full text
Abstract:
Enhancing transportation is critical to urban development, particularly in rapidly growing regions like Sokoto State in Nigeria. The Vehicle Routing Problem (VRP) is a widely researched optimization problem that seeks to find the most efficient routes for a fleet of vehicles to service a set of customers or locations, minimizing travel costs and time. This paper explores how Vehicle Routing Problem (VRP) optimization can address transportation challenges in the Sokoto metropolis by designing efficient routes for vehicle fleets. The study incorporates extensive data collection, including geospa
APA, Harvard, Vancouver, ISO, and other styles
8

Takwa, Tlili, Faiz Sami, and Saoussen Krichen and. "INTEGRATION OF GIS AND OPTIMIZATION ROUTINES FOR THE VEHICLE ROUTING PROBLEM." International Journal of Chaos, Control, Modelling and Simulation (IJCCMS) 2, no. 2 (2013): 09–17. https://doi.org/10.5281/zenodo.6837214.

Full text
Abstract:
This paper evokes the vehicle routing problem (VRP) which aims to determine the minimum total cost pathways for a fleet of heterogeneous vehicles to deliver a set of customers' orders. The inability of optimization algorithms alone to fully satisfy the needs of logistic managers become obvious in transportation field due to the spatial nature of such problems. In this context, we couple a geographical information system (GIS) with a metaheuristic to handle the VRP efficiently then generate a geographical solution instead of the numerical solution. A real-case instance in a Tunisian region
APA, Harvard, Vancouver, ISO, and other styles
9

Sztajerowski, Wiktor, Joanna Ochelska-Mierzejewska, and Jacek Kucharski. "SYSTEM FOR VEHICLE ROUTING PROBLEM ALGORITHMS ANALYSIS." Informatics Control Measurement in Economy and Environment Protection 7, no. 2 (2017): 28–31. http://dx.doi.org/10.5604/01.3001.0010.4833.

Full text
Abstract:
Paper concerns the software system supporting the analysis of different cases of solving VRP by various algorithms. VRP has been characterised and application structure has been presented. Illustrative experimental results show the usefulness of the system.
APA, Harvard, Vancouver, ISO, and other styles
10

Wen, Zhi Bin, Yi Xiang Yue, and Qun Xing Yue. "Chaos Optimization Algorithm for Vehicle Routing Problem." Advanced Materials Research 538-541 (June 2012): 2722–26. http://dx.doi.org/10.4028/www.scientific.net/amr.538-541.2722.

Full text
Abstract:
The vehicle routing problem (VRP) plays an important role in the optimization of distribution networks. Therefore, this paper designed an algorithm that can solve the VRP by using the Chaos Optimization theory which has the advantage of ergodicity and randomness. In this algorithm, logistic map generate chaotic groups and chaotic groups generate initial feasible solution (optimized by the chaos search). Then obtain final solution by using interpolation node method under the constraints of VRP. The effectiveness of the algorithm and the superiority of the result were demonstrated by the test of
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Vehicle routing problem (VRP)"

1

Battaglia, Andrea. "Metodi euristici per il Vehicle Routing Problem." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/6244/.

Full text
Abstract:
Il problema della consegna di prodotti da un deposito/impianto ai clienti mediante una flotta di automezzi è un problema centrale nella gestione di una catena di produzione e distribuzione (supply chain). Questo problema, noto in letteratura come Vehicle Routing Problem (VRP), nella sua versione più semplice consiste nel disegnare per ogni veicolo disponibile presso un dato deposito aziendale un viaggio (route) di consegna dei prodotti ai clienti, che tali prodotti richiedono, in modo tale che (i) la somma delle quantità richieste dai clienti assegnati ad ogni veicolo non superi la capacità de
APA, Harvard, Vancouver, ISO, and other styles
2

Seyyedhasani, Hasan. "USING THE VEHICLE ROUTING PROBLEM (VRP) TO PROVIDE LOGISTICS SOLUTIONS IN AGRICULTURE." UKnowledge, 2017. https://uknowledge.uky.edu/bae_etds/53.

Full text
Abstract:
Agricultural producers consider utilizing multiple machines to reduce field completion times for improving effective field capacity. Using a number of smaller machines rather than a single big machine also has benefits such as sustainability via less compaction risk, redundancy in the event of an equipment failure, and more flexibility in machinery management. However, machinery management is complicated due to logistics issues. In this work, the allocation and ordering of field paths among a number of available machines have been transformed into a solvable Vehicle Routing Problem (VRP). A ba
APA, Harvard, Vancouver, ISO, and other styles
3

Ursani, Ziauddin Engineering &amp Information Technology Australian Defence Force Academy UNSW. "Localized genetic algorithm for the vehicle routing problem." Awarded by:University of New South Wales - Australian Defence Force Academy. Engineering & Information Technology, 2009. http://handle.unsw.edu.au/1959.4/43763.

Full text
Abstract:
This thesis identifies some problems, the genetic algorithm (GA) is facing in the area of vehicle routing and proposes various methods to address those problems. Those problems arise from the unavailability of suitable chromosomal representation and evaluation schemes of GA for the Vehicle Routing Problem (VRP). The representation and evaluation schemes already in use have problems of high computational cost, illegal chromosomes (chromosomes not representing a legal tour) and wrong fitness assignment (fitness not truly representing chromosome genetic makeup). These problems are addressed by se
APA, Harvard, Vancouver, ISO, and other styles
4

Rebillas, Loredo Victoria. "The multi-depot VRP with vehicle interchanges." Doctoral thesis, Universitat Politècnica de Catalunya, 2018. http://hdl.handle.net/10803/664634.

Full text
Abstract:
In real-world logistic operations there are a lot of situations that can be exploited to get better operational strategies. It is important to study these new alternatives, because they can represent significant cost reductions to the companies working with physical distribution. This thesis defines the Multi-Depot Vehicle Routing Problem with Vehicle Interchanges (MDVRPVI). In this problem, both vehicle capacities and duration limits on the routes of the drivers are imposed. To favor a better utilization of the available capacities and working times, it is allowed to combine pairs of routes a
APA, Harvard, Vancouver, ISO, and other styles
5

Radiy, Mamon. "A hybrid method for capacitated vehicle routing problem." Thesis, Curtin University, 2010. http://hdl.handle.net/20.500.11937/69.

Full text
Abstract:
The vehicle routing problem (VRP) is to service a number of customers with a fleet of vehicles. The VRP is an important problem in the fields of transportation, distribution and logistics. Typically the VRP deals with the delivery of some commodities from a depot to a number of customer locations with given demands. The problem frequently arises in many diverse physical distribution situations. For example bus routing, preventive maintenance inspection tours, salesmen routing and the delivery of any commodity such as mail, food or newspapers.We focus on the Symmetric Capacitated Vehicle Routin
APA, Harvard, Vancouver, ISO, and other styles
6

Tejaswi, Nunna. "Performance Analysis on Hybrid and ExactMethods for Solving Clustered VRP : A Comparative Study on VRP Algorithms." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-14112.

Full text
Abstract:
Context: The Vehicle Routing Problem is an NP-hard problem with a combination of varieties oftopics like logistics, optimization research and data mining. There is a vast need of vehicle routingsolutions in day to day like with different constraints. According to the requirements, this problem hasbeen a field of interest to a lot of researchers who incorporate scientific methods to combine andinnovate new solutions to optimize the routing. Being an np-hard problem, it is almost impossible tocompute the solutions to optimality but years of research on this area has paid off quite significantlya
APA, Harvard, Vancouver, ISO, and other styles
7

Aguayo, Bustos Maichel Miguel. "Modeling, Analysis, and Exact Algorithms for Some Biomass Logistics Supply Chain Design and Routing Problems." Diss., Virginia Tech, 2016. http://hdl.handle.net/10919/81878.

Full text
Abstract:
This dissertation focuses on supply chain design and logistics problems with emphasis on biomass logistics and routing problems. In biomass logistics, we have studied problems arising in a switchgrass-based bio-ethanol supply chain encountered in the Southeast, and a corn stover harvest scheduling problem faced in the Midwest Unites States, both pertaining to the production of cellulosic ethanol. The main contributions of our work have been in introducing new problems to the literature that lie at the interface of the lot-sizing and routing problems, and in developing effective exact algorithm
APA, Harvard, Vancouver, ISO, and other styles
8

Sadeghi, Azadeh. "Social Cost-Vehicle Routing Problem in Post-Disaster Humanitarian Logistics." Ohio University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1626446795459101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yang, Xiaozhe. "Vehicle Routing Problem with Time Windows and Driving/Working Time Restrictions." Ohio University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1227621524.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

ABBATECOLA, LORENZO. "Vehicle Routing Problems: Decision Support Systems and Distributed Approaches." Doctoral thesis, Università degli Studi di Trieste, 2018. http://hdl.handle.net/11368/2921241.

Full text
Abstract:
Modern logistics received increasing attention for planning and scheduling operations of transport systems that have to be resource efficient, environmentally sustainable, and compatible with workers’ rights. In particular, modern timeliness requirements and technological advances respectively call for and enable new formulations and solutions for the classical vehicle routing problem (VRP). Indeed, companies and service supplier need of real-time data and fast procedure to face uncertainty and meet people’s expectative, and Information Communication Technologies make this information increasi
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Vehicle routing problem (VRP)"

1

Caric, Tonci, and Hrvoje Gold. Vehicle routing problem. InTech, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Golden, Bruce, Xingyin Wang, and Edward Wasil. The Evolution of the Vehicle Routing Problem. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-18716-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pereira, Francisco Babtista, and Jorge Tavares, eds. Bio-inspired Algorithms for the Vehicle Routing Problem. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-85152-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Golden, Bruce, S. Raghavan, and Edward Wasil, eds. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-77778-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

French, Alan Paul. The vehicle routing problem: A case study in specification using VDM. Loughborough University Business School, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Khan, Shamresh. Heuristic search methods for the vehicle routing problem with the time windows. University of Birmingham, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gavigan, Kevin Charles. The design, development and application of a combined connectionist expert system and 'Pocket' Boltzmann machine approach to the Dynamic Customer Assignment and Vehicle Routing Problem. typescript, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Xingyin, Bruce Golden, and Edward Wasil. Evolution of the Vehicle Routing Problem: A Survey of VRP Research and Practice from 2005 To 2022. Springer, 2022.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Evolution of the Vehicle Routing Problem: A Survey of VRP Research and Practice from 2005 To 2022. Springer, 2024.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Caric, Tonci, and Hrvoje Gol, eds. Vehicle Routing Problem. InTech, 2008. http://dx.doi.org/10.5772/64.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Vehicle routing problem (VRP)"

1

Golden, Bruce, Xingyin Wang, and Edward Wasil. "The Evolution of the Vehicle Routing Problem—A Survey of VRP Research and Practice from 2005 to 2022." In The Evolution of the Vehicle Routing Problem. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-18716-2_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Silva, Adriano S., José Lima, Adrián M. T. Silva, Helder T. Gomes, and Ana I. Pereira. "Time-Dependency of Guided Local Search to Solve the Capacitated Vehicle Routing Problem with Time Windows." In Communications in Computer and Information Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-53025-8_7.

Full text
Abstract:
AbstractResearch have been driven by the increased demand for delivery and pick-up services to develop new formulations and algorithms for solving Vehicle Routing Problems (VRP). The main objective is to create algorithms that can identify paths considering execution time in real-world scenarios. This study focused on using the Guided Local Search (GLS) metaheuristic available in OR-Tools to solve the Capacitated Vehicle Routing Problem with Time Windows using the Solomons instances. The execution time was used as a stop criterion, with short runs ranging from 1 to 10 s and a long run of 360 s
APA, Harvard, Vancouver, ISO, and other styles
3

Liu, Baoding. "Vehicle Routing Problem." In Theory and Practice of Uncertain Programming. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-89484-1_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shekhar, Shashi, and Hui Xiong. "Vehicle Routing Problem." In Encyclopedia of GIS. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_1443.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Laporte, Gilbert, Stefan Ropke, and Thibaut Vidal. "Chapter 4: Heuristics for the Vehicle Routing Problem." In Vehicle Routing. Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973594.ch4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Desaulniers, Guy, Oli B. G. Madsen, and Stefan Ropke. "Chapter 5: The Vehicle Routing Problem with Time Windows." In Vehicle Routing. Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973594.ch5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Irnich, Stefan, Michael Schneider, and Daniele Vigo. "Chapter 9: Four Variants of the Vehicle Routing Problem." In Vehicle Routing. Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973594.ch9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Semet, Frédéric, Paolo Toth, and Daniele Vigo. "Chapter 2: Classical Exact Algorithms for the Capacitated Vehicle Routing Problem." In Vehicle Routing. Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973594.ch2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Poggi, Marcus, and Eduardo Uchoa. "Chapter 3: New Exact Algorithms for the Capacitated Vehicle Routing Problem." In Vehicle Routing. Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973594.ch3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tadaros, Marduch, and Athanasios Migdalas. "Green Vehicle Routing Problem." In Encyclopedia of Optimization. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-54621-2_815-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Vehicle routing problem (VRP)"

1

Xing, Benbei, Lei Tang, and Junchi Ma. "VRPU: An Efficient Robust Optimization Approach for the Vehicle Routing Problem with Uncertain Travel Times and Demands." In 2024 20th International Conference on Mobility, Sensing and Networking (MSN). IEEE, 2024. https://doi.org/10.1109/msn63567.2024.00127.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Abibou, Soukayna, Dounia El Bourakadi, Ali Yahyaouy, and Hamid Gualous. "Hydrogen Vehicle Routing Problem with Time Windows and Vehicle Capacity." In 2024 International Conference on Intelligent Systems and Computer Vision (ISCV). IEEE, 2024. http://dx.doi.org/10.1109/iscv60512.2024.10620156.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lin, Zhuoyi, Yaoxin Wu, Bangjian Zhou, et al. "Cross-Problem Learning for Solving Vehicle Routing Problems." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/769.

Full text
Abstract:
Existing neural heuristics often train a deep architecture from scratch for each specific vehicle routing problem (VRP), ignoring the transferable knowledge across different VRP variants. This paper proposes the cross-problem learning to assist heuristics training for different downstream VRP variants. Particularly, we modularize neural architectures for complex VRPs into 1) the backbone Transformer for tackling the travelling salesman problem (TSP), and 2) the additional lightweight modules for processing problem-specific features in complex VRPs. Accordingly, we propose to pre-train the back
APA, Harvard, Vancouver, ISO, and other styles
4

Andrade, Matheus Diógenes, and Fábio Luiz Usberti. "Valid Inequalities for the Green Vehicle Routing Problem." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11086.

Full text
Abstract:
This work aims to investigate the Green Vehicle Routing Problem (G-VRP), which is an NP-Hard problem that generalizes the Vehicle Routing Problem (VRP) and integrates it with the green logistics. In the G-VRP, electric vehicles with limited autonomy can be recharged at Alternative Fuel Stations (AFSs) to keep visiting customers. This research proposes MILP formulations, valid inequalities, and preprocessing conditions.
APA, Harvard, Vancouver, ISO, and other styles
5

Gao, Chengrui, Haopu Shang, Ke Xue, Dong Li, and Chao Qian. "Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/764.

Full text
Abstract:
Machine learning has been adapted to help solve NP-hard combinatorial optimization problems. One prevalent way is learning to construct solutions by deep neural networks, which has been receiving more and more attention due to the high efficiency and less requirement for expert knowledge. However, many neural construction methods for Vehicle Routing Problems~(VRPs) focus on synthetic problem instances with specified node distributions and limited scales, leading to poor performance on real-world problems which usually involve complex and unknown node distributions together with large scales. T
APA, Harvard, Vancouver, ISO, and other styles
6

Hidalgo, I. Jessica, and Harrison M. Kim. "Two-Stage System of Systems Model by Linking System Design With Resource Allocation." In ASME 2006 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2006. http://dx.doi.org/10.1115/detc2006-99551.

Full text
Abstract:
Decomposition-based product design optimization under system of systems paradigm is linked with resource (i.e., product) allocation. A two-stage, system of systems approach to linking resource allocation (e.g., vehicle routing problem (VRP)) and system design optimization (e.g., vehicle design problem (VDP)) is presented. The problem inherently contains discrete variables from VRP, thus a practical formulation is presented to overcome convergence difficulty associated with shared discrete variables in a decomposed setting. Two examples, composed of four and eight air routes respectively with t
APA, Harvard, Vancouver, ISO, and other styles
7

Sánchez, Aitor López, Marin Lujak, Frederic Semet, and Holger Billhardt. "Vehicle Routing Problem with Fair Profits and Time Windows (VRP-FPTW)." In 2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, 2023. http://dx.doi.org/10.1109/smc53992.2023.10394012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mulati, Mauro Henrique, and Flávio Keidi Miyazawa. "Tighter Analysis of an Approximation for the Cumulative VRP." In II Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2017. http://dx.doi.org/10.5753/etc.2017.3202.

Full text
Abstract:
We deal with the cumulative vehicle routing problem (VRP), a generalization of the capacitated VRP, which objective is to minimize the fuel consumption. Gaur et al. in 2013 gave a 4-approximation based on a well-known partition heuristic to the traveling salesperson problem (TSP). We present a tighter analysis obtaining a 4 3s34Q2 -approximation, where Q is the capacity of the vehicle and s is a scaling factor. To the best of our knowledge, this is the best proved approximation for the cumulative VRP so far.
APA, Harvard, Vancouver, ISO, and other styles
9

Shah, Syed, Narith Saum, and Mongkut Piantanakulchai. "Impact of Variable Travel Time on the Solution of Vehicle Routing Problem: A Case Study of Bangkok." In The SLIIT International Conference on Engineering and Technology 2022. Faculty of Engineering, SLIIT, 2022. http://dx.doi.org/10.54389/ijyh7022.

Full text
Abstract:
In the logistics industry, it is essential to have optimized vehicle routes for cost-effectiveness and customer satisfaction. However, most conventional studies on vehicle routing problem (VRP) do not consider the variation in travel time, leading to nonoptimal routes. This study shows the importance of variation in travel time for different times of the day and different days of the week by comparing the optimization results of vehicle routes for constant travel time and variable travel time. Two different scenarios were considered for Bangkok city, Case-1, where customers are scattered acros
APA, Harvard, Vancouver, ISO, and other styles
10

Scholz-Reiter, Bernd, Henning Rekersbrink, Bernd-Ludwig Wenning, and Thomas Makuschewitz. "A Survey of Autonomous Control Algorithms by Means of Adapted Vehicle Routing Problems." In ASME 2008 9th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2008. http://dx.doi.org/10.1115/esda2008-59077.

Full text
Abstract:
The German Collaborative Research Centre 637 “Autonomous Cooperating Logistic Processes – A Paradigm Shift and its Limitations”, develops, among other things, autonomous routing algorithms for transport networks. The discussed algorithm is designed to match goods and vehicles and to continuously make route decisions within a dynamic transport network. Here, each object makes its own decisions. It is called Distributed Logistics Routing Protocol – DLRP. Because of obvious similarities to the Vehicle Routing Problem (VRP), one question arises for both practitioners and researchers: How efficient
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Vehicle routing problem (VRP)"

1

She, Ruifeng, and Yanfeng Ouyang. Generalized Link-Cost Function and Network Design for Dedicated Truck-Platoon Lanes to Improve Energy, Pavement Sustainability, and Traffic Efficiency. Illinois Center for Transportation, 2021. http://dx.doi.org/10.36501/0197-9191/21-037.

Full text
Abstract:
Recent development of autonomous and connected trucks (ACT) has provided the freight industry with the option of using truck platooning to improve fuel efficiency, traffic throughput, and safety. However, closely spaced and longitudinally aligned trucks impose frequent and concentrated loading on pavements, which often accelerates pavement deterioration and increases the life cycle costs for the highway agency. Also, effectiveness of truck platooning can be maximized only in dedicated lanes; and its benefits and costs need to be properly balanced between stakeholders. This paper proposes a net
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Vehicle routing problem (VRP)' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography