Relevant bibliographies by topics / Vehicle-routing-Problem / Heuristik

Contents

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

Academic literature on the topic 'Vehicle-routing-Problem / Heuristik'

Author: Grafiati
Published: 4 June 2021
Last updated: 12 February 2022

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 / Heuristik.'

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 / Heuristik"

1

INDAKA, A., S. SISWANDI, and F. HANUM. "PENYELESAIAN OPEN VEHICLE ROUTING PROBLEM MENGGUNAKAN METODE HEURISTIK SARIKLIS POWELL." Journal of Mathematics and Its Applications 10, no. 2 (2011): 31. http://dx.doi.org/10.29244/jmap.10.2.31-40.

Full text
Abstract:
Masalah rute kendaraan terbuka (open vehicle routing problem) sehingga kendaraan tidak diperlukan untuk kembali ke depot merupakan bagian dari Vehicle Routing Problem (VRP)yang mengharuskan setiap konsumen dikunjungi sekali dan hanya sekali dengan tepat satu kendaraan.Metode heuristik yang digunakan untuk menyelesaikan masalah ini merupakan suatu algoritme yang terdiri dari beberapa fase.Fase pertama ialah fase pembentukan cluster yang seimbang, sedangkan fase kedua ialah fase penentuan rute. Fase kedua dilakukan dengan penentuan minimumspanning tree(MST) dengan algoritme Prim, pemodifikasian
APA, Harvard, Vancouver, ISO, and other styles
2

Dimyati, Tjutju T. "PENGARUH NILAI PARAMETER TERHADAP SOLUSI HEURISTIK PADA MODEL VTPTW." INFOMATEK 19, no. 01 (2017): 37. http://dx.doi.org/10.23969/infomatek.v19i01.547.

Full text
Abstract:
Penentuan rute kendaraan (Vehicle Routing Problem, VRP) merupakan sub persoalan yang sangat penting dari suatu sistem distribusi, sehingga telah mengundang banyak perhatian peneliti untuk menggali berbagai aspek yang terkait dengan persoalan ini. Pada makalah ini dikemukakan suatu metode heuristik untuk menyelesaikan persoalan penentuan rute kendaraan dimana setiap pelanggan menetapkan batas awal dan akhir waktu pengiriman, yang dikenal sebagai Vehicle Routing Problem with Time Windows (VRPTW). Penentuan rute ditujukan tidak hanya untuk meminimumkan total ongkos perjalanan tetapi juga total wa
APA, Harvard, Vancouver, ISO, and other styles
3

Wirasambada, Sudiana, and Dwi Iryaning Handayani. "VEHICLE ROUTING UNTUK PICK UP PROBLEM DENGAN PENDEKATAN MOST VALUEABLE NEIGHBORHOOD DAN NEAREST NEIGHBOR PADA JASA PENGIRIMAN BARANG." WAKTU: Jurnal Teknik UNIPA 14, no. 2 (2016): 43–49. http://dx.doi.org/10.36456/waktu.v14i2.138.

Full text
Abstract:
Berkembangnya bisnis jasa pengiriman barang mendorong perusahaan-perusahaan jasa pengiriman barang
 seperti PT. X memperluas jaringan bisnisnya. Sistem agen yang diterapkan menyebabkan lokasi pick up
 barang menjadi lebih banyak. Oleh karena itu, optimalisasi penjadwalan rute kendaraan adalah hal yang
 penting untuk menurunkan kemungkinan barang yang tidak terangkut, menurunkan biaya operasional, dan
 meningkatkan keuntungan. Tujuan penelitian yaitu melakukan optimalisasi rute pada operator jasa
 pengiriman barang PT. X dengan mengggunakan pendekatan heuristik. Dua met
APA, Harvard, Vancouver, ISO, and other styles
4

Andriansyah, Andriansyah, Rizky Novatama, and Prima Denny Sentia. "Algoritma Simulated Annealing untuk Menentukan Rute Kendaraan Heterogen (Studi Kasus)." Jurnal Teknologi Informasi dan Ilmu Komputer 7, no. 5 (2020): 933. http://dx.doi.org/10.25126/jtiik.2020752018.

Full text
Abstract:
<p>Permasalahan transportasi dalam supply chain management sangat penting untuk dikaji karena dapat menimbulkan biaya logistik yang sangat besar. Salah satu cara untuk mengurangi biaya transportasi adalah dengan penentuan rute kendaraan atau dikenal dengan istilah vehicle routing problem. Objek yang menjadi kajian merupakan perusahaan yang bergerak pada bidang distribusi produk untuk area kota Banda Aceh dan sekitarnya. Dalam proses distribusi, perusahaan ini menggunakan dua jenis kendaraan dengan kapasitas dan biaya operasional yang berbeda sehingga permasalahan menjadi heterogeneous fl
APA, Harvard, Vancouver, ISO, and other styles
5

Winarno, Heru, and Samsul Arifin. "PENENTUAN RUTE DISTRIBUSI PRODUK YANG OPTIMAL DENGAN MENGGUNAKAN CLARKLE AND WRIGHT SAVING HEURISTIK." Journal Industrial Manufacturing 4, no. 1 (2019): 13. http://dx.doi.org/10.31000/jim.v4i1.1240.

Full text
Abstract:
PT X adalah salah satu perusahaan yang bergerak pada bidang Transportasi, Warehousing, dan Packaging, yang berlokasi di Cilegon Banten. Kegiatan bisnis yang sangat dominan di PT. X adalah pendistribusi barang dari pabrik ke daerah sekitar Banten. Salah satunya barang yang didistribusikan yaitu semen, untuk memenuhi banyaknya permintaan semen dari toko-toko yang tersebar di Banten. Tujuan utama dalam distribusi ini adalah untuk merangcang biaya yang optimal dalam pendistribusian produk dari gudang ke setiap toko. dengan jarak tempuh minimum setiap rute dalam pengiriman dan pendistribusian produ
APA, Harvard, Vancouver, ISO, and other styles
6

Ripplinger, David. "Rural School Vehicle Routing Problem." Transportation Research Record: Journal of the Transportation Research Board 1922, no. 1 (2005): 105–10. http://dx.doi.org/10.1177/0361198105192200114.

Full text
Abstract:
The school bus routing problem traditionally has been defined in an urban context. However, because of the unique attributes of the problem in rural areas, traditional heuristic methods for solving the problem may produce impractical results. In many cases, these characteristics also provide the opportunity to investigate what size and mix of vehicles, whether large or small buses, conforming vans, or other modes, are most efficient. In addition, these vehicles may be further differentiated by the presence of equipment for transporting students with special needs. To address this situation, a
APA, Harvard, Vancouver, ISO, and other styles
7

Levy, David, Kaarthik Sundar, and Sivakumar Rathinam. "Heuristics for Routing Heterogeneous Unmanned Vehicles with Fuel Constraints." Mathematical Problems in Engineering 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/131450.

Full text
Abstract:
This paper addresses a multiple depot, multiple unmanned vehicle routing problem with fuel constraints. The objective of the problem is to find a tour for each vehicle such that all the specified targets are visited at least once by some vehicle, the tours satisfy the fuel constraints, and the total travel cost of the vehicles is a minimum. We consider a scenario where the vehicles are allowed to refuel by visiting any of the depots or fuel stations. This is a difficult optimization problem that involves partitioning the targets among the vehicles and finding a feasible tour for each vehicle.
APA, Harvard, Vancouver, ISO, and other styles
8

Okitonyumbe Y. F, Joseph, Berthold Ulungu E.-L, and Joel Kapiamba Nt. "Cobweb heuristic for multi-objective vehicle routing problem." International Journal of Applied Mathematical Research 4, no. 3 (2015): 430. http://dx.doi.org/10.14419/ijamr.v4i3.4317.

Full text
Abstract:
<p>Solving a classical vehicle routing problem (VRP) by exact methods presents many difficulties for large dimension problem. Consequently, in multi-objective framework, heuristic or metaheuristic methods are required. Due to particular VRP structure, it seems that a dedicated heuristicis more suitable than a metaheuristic. The aim of this article is to collapse different heuristics solving classical VRP and adapt them for to solve the multi-objective vehicle routing problem (MOVRP). The so-called Cobweb Algorithm simulates spider’s behavior when weaving cobweb. This paper presents the a
APA, Harvard, Vancouver, ISO, and other styles
9

Sinha Roy, Debdatta, Adriano Masone, Bruce Golden, and Edward Wasil. "Modeling and Solving the Intersection Inspection Rural Postman Problem." INFORMS Journal on Computing 33, no. 3 (2021): 1245–57. http://dx.doi.org/10.1287/ijoc.2020.1013.

Full text
Abstract:
Local governments inspect roads to decide which segments and intersections to repair. Videos are taken using a camera mounted on a vehicle. The vehicle taking the videos proceeds straight or takes a left turn to cover an intersection fully. We introduce the intersection inspection rural postman problem (IIRPP), which is a new variant of the rural postman problem (RPP) that involves turns. We develop integer programming formulations of the IIRPP based on two different graph transformations to generate least-cost vehicle routes. One formulation is based on a new idea of transforming a graph. A s
APA, Harvard, Vancouver, ISO, and other styles
10

Soysal, Mehmet, Mustafa Çimen, Mine Ömürgönülşen, and Sedat Belbağ. "Performance Comparison of Two Recent Heuristics for Green Time Dependent Vehicle Routing Problem." International Journal of Business Analytics 6, no. 4 (2019): 1–11. http://dx.doi.org/10.4018/ijban.2019100101.

Full text
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 weighte
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Vehicle-routing-Problem / Heuristik"

1

Doerner, Karl, Manfred Gronalt, Richard F. Hartl, Marc Reimann, Christine Strauß, and Michael Stummer. "SavingsAnts for the vehicle routing problem." SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 2001. http://epub.wu.ac.at/1130/1/document.pdf.

Full text
Abstract:
In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to combine an Ant System (AS) with a problem specific constructive heuristic, namely the well known Savings algorithm. This differs from previous approaches, where the subordinate heuristic was the Nearest Neighbor algorithm initially proposed for the TSP. We compare our approach with some other classic, powerful meta-heuristics and show that our results are competitive.<br>Series: Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
APA, Harvard, Vancouver, ISO, and other styles
2

Reimann, Marc, Karl Doerner, and Richard F. Hartl. "Insertion based Ants for Vehicle Routing Problems with Backhauls and Time Windows." SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/1724/1/document.pdf.

Full text
Abstract:
In this paper we present and analyze the application of an Ant System to the Vehicle Routing Problem with Backhauls and Time Windows (VRPBTW). At the core of the algorithm we use an Insertion procedure to construct solutions. We provide results on the learning and runtime behavior of the algorithm as well as a comparison with a custom made heuristic for the problem.<br>Series: Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
APA, Harvard, Vancouver, ISO, and other styles
3

Gerlich, Michal. "Aplikace heuristik při řešení rozvozní úlohy." Master's thesis, Vysoká škola ekonomická v Praze, 2011. http://www.nusl.cz/ntk/nusl-73532.

Full text
Abstract:
This thesis deals with solving a real case from one specific part of Operations Research -- Discrete Models. The case can be classified as Vehicle Routing Problem (VRP) which is a subset of classical Travelling Salesman Problem (TSP). The VRP is modified TSP when requirements of customers and capacities of trucks play role. The data needed for calculations were taken from the real situation of Pivovar Svijany a.s. The problem can be defined as VRP with cars with different capacities and split delivery. Even though the mathematic model of the problem is known and described in the thesis, the si
APA, Harvard, Vancouver, ISO, and other styles
4

Trunda, Otakar. "Implementace heuristik pro rozvozní problém s časovými okny." Master's thesis, Vysoká škola ekonomická v Praze, 2017. http://www.nusl.cz/ntk/nusl-358970.

Full text
Abstract:
Vehicle Routing Problem with Time Windows is a hard optimization problem. Even though it has numerous practical applications, the question of solving it efficiently has not been satisfyingly solved yet. This thesis studies the Vehicle Routing Problem with Time Windows and presents several new algorithms for solving it. There are two heuristics presented here, as well as several more complex algorithms which use those heuristics as their components. The efficiency of presented techniques is evaluated experimentally using a set of test samples. As a part of this thesis, I have also developed a d
APA, Harvard, Vancouver, ISO, and other styles
5

Talaei, Majid. "Heuristics for energy efficient vehicle routing problem." Thesis, Wichita State University, 2012. http://hdl.handle.net/10057/5611.

Full text
Abstract:
US logistics cost of 1.397 trillion dollars in 2007, which stands for more that 10 percent of the total GDP of the country justifies any attempt of reducing it. Transportation followed by inventory-carrying and logistics administration has the greatest cost share in logistics. A tool which is very critical in transportation planning and can contribute to huge savings if used properly is Vehicle Routing Problem. Near optimum vehicle routs which are designed by outstanding heuristics and experts could contribute significantly to cost saving. Another important issue which directly affects logisti
APA, Harvard, Vancouver, ISO, and other styles
6

Sariklis, Dimitrios. "Open Vehicle Routing Problem : description, formulations and heuristic methods." Thesis, London School of Economics and Political Science (University of London), 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265252.

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

Escobar, Velasquez John Willmer <1980&gt. "Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/5258/.

Full text
Abstract:
The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot. This thesis addresses heuristics algorithms based on the well-know granular search idea introduced by Toth and Vigo (2003) to solve the CLRP and the MDVRP. Extensive computational experiments on bench
APA, Harvard, Vancouver, ISO, and other styles
8

Silvestrin, Paulo Vitor. "An efficient heuristic for the multi-compartment vehicle routing problem." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/149656.

Full text
Abstract:
Este trabalho apresenta uma variação do problema de roteamento de veículos que permite o uso de veículos com múltiplos compartimentos. A necessidade de veículos com múltiplos compartimentos surge com frequência em aplicações práticas quando uma série de produtos, que possuem diferentes qualidades ou tipo, precisam ser transportados mas não podem ser misturados. Este problema é chamado na literatura de roteamento de veículos com múltiplos compartimentos (PRVMC). Nós propomos uma heurística busca tabu implementada em uma busca local iterada para resolver este problema. Experimentos foram feitos
APA, Harvard, Vancouver, ISO, and other styles
9

Plášková, Pavlína. "Strategické rozhodnutí společnosti Baťa, a.s." Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-3836.

Full text
Abstract:
In this thesis we report several of delivery problems. Here it is mostly describe Vehicle Routing Problem and Split Delivery Problem as suitable methods for the case study of the company Baťa a.s.In this thesis we used one of the most sofisticated software Roadnet Transportation Suite as effective program for distribution and planning routes.Finally we construct analysis as a support to find the optimal solution for the final strategical decision of the company Baťa a.s.
APA, Harvard, Vancouver, ISO, and other styles
10

Almutairi, Abdulwahab. "Sim-heuristic algorithms for Robust Vehicle Routing Problem with Stochastic Demand." Thesis, University of Portsmouth, 2016. https://researchportal.port.ac.uk/portal/en/theses/simheuristic-algorithms-for-robust-vehicle-routing-problem-with-stochastic-demand(c418aed0-29a5-49f5-b191-ece4796e5827).html.

Full text
Abstract:
The Vehicle Routing Problem with Stochastic Demand (VRPSD) is a fundamental problem underlying many operational challenges in the field of logistic and supply chain management. The VRPSD is a well-known NP-hard problem whereby a fleet of vehicles is located at a single depot. Each vehicle has a limited capacity and has to serve a number of customers whose actual demands are known only when the vehicle arrives at the customers’ locations. The VRPSD arises in practice whenever a company faces the problem of delivering to a set of customers, whose demands are uncertain. The solution to the VRPSD
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Vehicle-routing-Problem / Heuristik"

1

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

Book chapters on the topic "Vehicle-routing-Problem / Heuristik"

1

Werners, Brigitte, and Michael Drawe. "Capacitated Vehicle Routing Problem with Fuzzy Demand." In Fuzzy Sets Based Heuristics for Optimization. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-36461-0_21.

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

Utkina, Irina, Olga Bukanova, and Mikhail V. Batsyn. "Fast Heuristic for Vehicle Routing Problem on Trees." In Mathematical Optimization Theory and Operations Research. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58657-7_30.

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

Solano-Charris, Elyn L., Christian Prins, and Andréa Cynthia Santos. "Heuristic Approaches for the Robust Vehicle Routing Problem." In Lecture Notes in Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09174-7_33.

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

Solano-Charris, Elyn L., Christian Prins, and Andréa Cynthia Santos. "Heuristic Approaches for the Robust Vehicle Routing Problem." In Lecture Notes in Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-14115-2_33.

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

Ghaziri, Hassan. "Supervision in the Self-Organizing Feature Map: Application to the Vehicle Routing Problem." In Meta-Heuristics. Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1361-8_39.

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

Rego, César, and Catherine Roucairol. "A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem." In Meta-Heuristics. Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1361-8_40.

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

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
8

Huber, Sandra, and Martin Josef Geiger. "Swap Body Vehicle Routing Problem: A Heuristic Solution Approach." In Lecture Notes in Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11421-7_2.

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

Marinakis, Yannis, Magdalene Marinaki, and Athanasios Migdalas. "Particle Swarm Optimization for the Vehicle Routing Problem: A Survey and a Comparative Analysis." In Handbook of Heuristics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-07124-4_42.

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

Marinakis, Yannis, Magdalene Marinaki, and Athanasios Migdalas. "Particle Swarm Optimization for the Vehicle Routing Problem: A Survey and a Comparative Analysis." In Handbook of Heuristics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-07153-4_42-1.

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

Conference papers on the topic "Vehicle-routing-Problem / Heuristik"

1

Oudouar, Fadoua, and Zaoui El Miloud. "A hybrid Heuristic for vehicle routing problem." In BDIoT'19: The 4th International Conference On Big Data and Internet of Things. ACM, 2019. http://dx.doi.org/10.1145/3372938.3373014.

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

De Filippo, Allegra, Michele Lombardi, and Michela Milano. "Methods for off-line/on-line optimization under uncertainty." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/177.

Full text
Abstract:
In this work we present two general techniques to deal with multi-stage optimization problems under uncertainty, featuring off-line and on-line decisions. The methods are applicable when: 1) the uncertainty is exogenous; 2) there exists a heuristic for the on-line phase that can be modeled as a parametric convex optimization problem. The first technique replaces the on-line heuristics with an anticipatory solver, obtained through a systematic procedure. The second technique consists in making the off-line solver aware of the on-line heuristic, and capable of controlling its parameters so as to
APA, Harvard, Vancouver, ISO, and other styles
3

Hai Shen, Yunlong Zhu, Li Jin, and Wenping Zou. "Two-phase heuristic for Capacitated Vehicle Routing Problem." In 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC 2010). IEEE, 2010. http://dx.doi.org/10.1109/nabic.2010.5716362.

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

Rios, Brenner H. O., Eduardo C. Xavier, Flávio K. Miyazawa, and Pedro Amorim. "Stochastic multi-depot capacitated vehicle routing problem with pickup and delivery: heuristic approaches." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/etc.2021.16388.

Full text
Abstract:
We present a natural probabilistic variation of the multi-depot vehicle routing problem with pickup and delivery. We denote this variation by Stochastic multi-depot capacitated vehicle routing problem with pickup and delivery (SMCVRPPD). We present an algorithm to compute the expected length of an apriori route under general probabilistic assumptions. To solve the SMCVRPPD we propose an Iterated Local Search (ILS) and a Variable Neighborhood Search(VNS). We evaluate the performance of these heuristics on a data set adapted from TSPLIB instances. The results show that the ILS is effective to so
APA, Harvard, Vancouver, ISO, and other styles
5

Kouider, Tayeb Oulad, Wahiba Ramdane Cherif-Khettaf, and Ammar Oulamara. "Constructive Heuristics for Periodic Electric Vehicle Routing Problem." In 7th International Conference on Operations Research and Enterprise Systems. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0006630502640271.

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

Elneima, Ashraf, and Mohamed Salih. "Optimisation of Vehicle Routing Problem using Hyper-heuristics." In 2020 International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE). IEEE, 2021. http://dx.doi.org/10.1109/iccceee49695.2021.9429682.

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

Chang-shi Liu and Fu-hua Huang. "Hybrid heuristic for vehicle routing problem with due times." In 2010 2nd International Asia Conference on Informatics in Control, Automation and Robotics (CAR 2010). IEEE, 2010. http://dx.doi.org/10.1109/car.2010.5456884.

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

Wang, Xuping, Xu Wu, and Zheng Wang. "A Lagrangian heuristic for the urgency vehicle routing problem." In 2010 International Conference on Logistics Systems and Intelligent Management (ICLSIM). IEEE, 2010. http://dx.doi.org/10.1109/iclsim.2010.5461247.

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

Robinson, Christopher. "A vehicle routing heuristic: Derived from altered problem constraints." In 2017 Computing Conference. IEEE, 2017. http://dx.doi.org/10.1109/sai.2017.8252081.

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

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
You might also be interested in the extended bibliographies on the topic 'Vehicle-routing-Problem / Heuristik' for particular source types:
Journal articles Dissertations / Theses
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