Log in

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

To see the other types of publications on this topic, follow the link: Vehicle-routing-Problem / Heuristik.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Azriati Mat, Nur, Aida Mauziah Benjamin, and Syariza Abdul-Rahman. "Efficiency of Heuristic Algorithms in Solving Waste Collection Vehicle Routing Problem: A Case Study." Journal of Social Sciences Research, SPI6 (December 25, 2018): 695–700. http://dx.doi.org/10.32861/jssr.spi6.695.700.

Full text

Abstract:

This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. In fact, these heuristics have been employed to solve several routing problems in past studies, but the performance of each heuristic has never been compared. Hence, this paper looked into the efficiency of these heuristics by testing them on a

APA, Harvard, Vancouver, ISO, and other styles

12

Rodrigues de Holanda Maia, Marcelo, Alexandre Plastino, and Puca Huachi Vaz Penna. "Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem." RAIRO - Operations Research 52, no. 3 (2018): 661–90. http://dx.doi.org/10.1051/ro/2017072.

Full text

Abstract:

The vehicle routing problem consists of determining a set of routes for a fleet of vehicles to meet the demands of a given set of customers. The development and improvement of techniques for finding better solutions to this optimization problem have attracted considerable interest since such techniques can yield significant savings in transportation costs. The heterogeneous fleet vehicle routing problem is distinguished by the consideration of a heterogeneous fleet of vehicles, which is a very common scenario in real-world applications, rather than a homogeneous one. Hybrid versions of metaheu

APA, Harvard, Vancouver, ISO, and other styles

13

Yuliza, Evi, Fitri Maya, and Siti Suzlin Supadi. "Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows." Science and Technology Indonesia 6, no. 2 (2021): 53–57. http://dx.doi.org/10.26554/sti.2021.6.2.53-57.

Full text

Abstract:

Garbage is one of the environmental problems. The process of transporting garbage sometimes occurs delays such as congestion and engine failure. Robust optimization model called a robust counterpart open capacitated vehicle routing problem (RCOCVRP) with time windows was formulated to get over this delays. This model has formulated with the limitation of vehicle capacity and time windows with an uncertainty of waste volume and travel time. The RCOCVRP model with time windows is solved by a heuristic approach. The heuristic approach used to solve the RCOCVRP model with time windows uses the nea

APA, Harvard, Vancouver, ISO, and other styles

14

Laporte, Gilbert. "The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization." International Journal of Strategic Decision Sciences 1, no. 2 (2010): 82–92. http://dx.doi.org/10.4018/jsds.2010040104.

Full text

Abstract:

The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.

APA, Harvard, Vancouver, ISO, and other styles

15

Andric Gusavac, Bisera, Milan Stanojevic, and Mirjana Cangalovic. "Optimal treatment of agricultural land – special multi-depot vehicle routing problem." Agricultural Economics (Zemědělská ekonomika) 65, No. 12 (2019): 569–78. http://dx.doi.org/10.17221/134/2019-agricecon.

Full text

Abstract:

This paper describes a problem of optimal agricultural land treatment using aviation. The studied problem consists of determining the optimal routes for a given set of aircraft used for chemical treatment of arable agricultural land divided into parcels. This NP (nondeterministic polynomial time) problem is represented on a graph and a mixed integer mathematical programming model of the problem is formulated. This mathematical model is a specific variant of the multi-depot vehicle routing problem where a min-cost plan for the transportation of a homogeneous product (chemicals used for land tre

APA, Harvard, Vancouver, ISO, and other styles

16

Leelertkij, Thanapat, Parthana Parthanadee, and Jirachai Buddhakulsomsiri. "Vehicle Routing Problem with Transshipment: Mathematical Model and Algorithm." Journal of Advanced Transportation 2021 (February 2, 2021): 1–15. http://dx.doi.org/10.1155/2021/8886572.

Full text

Abstract:

This paper presents a new variant of vehicle routing problem with paired transshipment demands (VRPT) between retail stores (customers) in addition to the regular demand from depot to retail stores. The problem originates in a real distribution network of high-end retail department stores in Thailand. Transshipment demands arise for one-order-per-season expensive items, whose inventories at the depot may become shortage after the middle of a season, while they remain available at some retail stores. A transshipment demand is a request for items that need to be picked up from a specific store t

APA, Harvard, Vancouver, ISO, and other styles

17

Garside, Annisa Kesy, and Nabila Rohmatul Laili. "A Cluster-First Route-Second Heuristic Approach to Solve The Multi-Trip Periodic Vehicle Routing Problem." Jurnal Teknik Industri 20, no. 2 (2019): 172. http://dx.doi.org/10.22219/jtiumm.vol20.no2.172-181.

Full text

Abstract:

This paper discusses periodic vehicle routing problems that allow vehicles to travel on multiple trips in a single day. It is known as the Multi-Trip Periodic Vehicles (MTPVRP) Problem Route. Cluster-first route-second (CFRS) heuristics to solve MTPVRP was proposed in this study. In phase 1, customers were divided into clusters using the formulation of integer programming. Phase 2 determined the route of the cluster and verifies that the total journey time to visit the trips does not exceed the working hours of the vehicle. The implementation of the heuristic CFRS to solve the real problem fac

APA, Harvard, Vancouver, ISO, and other styles

18

Garside, Annisa Kesy, and Nabila Rohmatul Laili. "A Cluster-First Route-Second Heuristic Approach to Solve The Multi-Trip Periodic Vehicle Routing Problem." Jurnal Teknik Industri 20, no. 2 (2019): 68. http://dx.doi.org/10.22219/jtiumm.vol20.no2.68-77.

Full text

Abstract:

This paper discusses periodic vehicle routing problems that allow vehicles to travel on multiple trips in a single day. It is known as the Multi-Trip Periodic Vehicles (MTPVRP) Problem Route. Cluster-first route-second (CFRS) heuristics to solve MTPVRP was proposed in this study. In phase 1, customers were divided into clusters using the formulation of integer programming. Phase 2 determined the route of the cluster and verifies that the total journey time to visit the trips does not exceed the working hours of the vehicle. The implementation of the heuristic CFRS to solve the real problem fac

APA, Harvard, Vancouver, ISO, and other styles

19

Liu, Chang Shi, and Fu Hua Huang. "A Two-Stage Hybrid Heuristic for Vehicle Routing Problem with Fuzzy Demands." Key Engineering Materials 460-461 (January 2011): 710–15. http://dx.doi.org/10.4028/www.scientific.net/kem.460-461.710.

Full text

Abstract:

A two-stage hybrid heuristic is presented for vehicle routing problem with fuzzy demands in this paper, the fuzzy credibility measure is employed to determine the credibility to send the vehicle to next node in the first stage, and a hybrid heuristics is proposed to determine a set of vehicle routes to minimize total costs in the second stage, especially for the additional distance and additional loading times. Finally the computational results are presented to show the high effectiveness and performance of the proposed approaches.

APA, Harvard, Vancouver, ISO, and other styles

20

Sobrino, D. R. Delgado, Oliver Moravčik, D. Caganová, and P. Kostal. "Hybrid Iterative Local Search Heuristic with a Multiple Criteria Approach for the Vehicle Routing Problem." Advanced Materials Research 383-390 (November 2011): 4560–67. http://dx.doi.org/10.4028/www.scientific.net/amr.383-390.4560.

Full text

Abstract:

This paper presents a Hybrid Iterative Local Search Heuristic and its framework, whose aim lies on helping to escape from local optima when a construction heuristic, for the VRP, has been trapped. The approach was mainly inspired by basic and modified versions of related successfully applied heuristics such as Variable Neighborhood Search (VNS) and Granular Local Search (GLS). Differently to a great deal of local search heuristics revised, which mainly consider a single decision criterion, multiple optimization criteria are considered all along the local search and a Multiple Criteria Threshol

APA, Harvard, Vancouver, ISO, and other styles

21

Shieh, How-Ming, and Ming-Der May. "On-Line Vehicle Routing with Time Windows: Optimization-Based Heuristics Approach for Freight Demands Requested in Real-Time." Transportation Research Record: Journal of the Transportation Research Board 1617, no. 1 (1998): 171–78. http://dx.doi.org/10.3141/1617-24.

Full text

Abstract:

The problem of the on-line version of the vehicle routing problem with time windows (VRPTW) differs from the traditional off-line problem in the dynamical arrival of requests and the execution of the partial tour during the run time. The study develops an on-line optimization-based heuristic that combined the concepts of the “on-line algorithm,” “anytime algorithm,” and local search heuristics to solve the on-line version of VRPTW. The solution heuristic is evaluated with modified Solomon’s problems. By comparing with these benchmark problems, the different results between on-line and off-line

APA, Harvard, Vancouver, ISO, and other styles

22

Pop, Petrică Claudiu, Ioana Zelina, Vasile Lupşe, Corina Pop Sitar, and Camelia Chira. "Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem." International Journal of Computers Communications & Control 6, no. 1 (2011): 158. http://dx.doi.org/10.15837/ijccc.2011.1.2210.

Full text

Abstract:

The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems and has been intensively studied due to the many practical applications in the field of distribution, collection, logistics, etc. We study a generalization of the VRP called the generalized vehicle routing problem (GVRP) where given a partition of the nodes of the graph into node sets we want to find the optimal routes from the given depot to the number of predefined clusters which include exactly one node from each cluster. The purpose of this paper is to present heuristic algorithms to solve this

APA, Harvard, Vancouver, ISO, and other styles

23

Найдьонов, Іван Михайлович. "The topological heuristic in vehicle routing problem (VRP)." ScienceRise 6, no. 2(11) (2015): 52. http://dx.doi.org/10.15587/2313-8416.2015.44381.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Gaudioso, M., and G. Paletta. "A Heuristic for the Periodic Vehicle Routing Problem." Transportation Science 26, no. 2 (1992): 86–92. http://dx.doi.org/10.1287/trsc.26.2.86.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Linfati, Rodrigo, and John Willmer Escobar. "Reoptimization Heuristic for the Capacitated Vehicle Routing Problem." Journal of Advanced Transportation 2018 (November 1, 2018): 1–8. http://dx.doi.org/10.1155/2018/3743710.

Full text

Abstract:

The solution to a dynamic context of the Capacitated Vehicle Routing Problem (CVRP) is challenging. Routing and replenishment decisions are necessary by considering the assignment of customers to vehicles when the information is gradually revealed over horizon time. The procedure to solve this type of problems is referred to as route reoptimization, which is the best option for minimizing expected transportation cost without incurring failures of unsatisfied demand on a route. This paper proposes a heuristic algorithm for the reoptimization of CVRP in which the number of customers increases. T

APA, Harvard, Vancouver, ISO, and other styles

26

Mourgaya, M., and F. Vanderbeck. "The periodic Vehicle routing problem: classification and heuristic." RAIRO - Operations Research 40, no. 2 (2006): 169–94. http://dx.doi.org/10.1051/ro:2006015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

AbdElAziz, Moh M., Haitham A. El-Ghareeb, and M. S. M. Ksasy. "Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 12, no. 9 (2014): 3844–51. http://dx.doi.org/10.24297/ijct.v12i9.2824.

Full text

Abstract:

The Capacitated Vehicle Routing Problem is the most common and basic variant of the vehicle routing problem, where it represents an important problem in the fields of transportation, distribution and logistics. It involves finding a set of optimal routes that achieve the minimum cost and serve scattered customer locations under several constraints such as the distance between customersâ€™ locations, available vehicles, vehicle capacity and customer demands. The Cluster first â€“ Route second is the proposed approach used to solve capacitated vehicle routing problem which applied in a real case

APA, Harvard, Vancouver, ISO, and other styles

28

Tasar, Bahar, Deniz Türsel Eliiyi, and Levent Kandiller. "Vehicle Routing with Compartments Under Product Incompatibility Constraints." PROMET - Traffic&Transportation 31, no. 1 (2019): 25–36. http://dx.doi.org/10.7307/ptt.v31i1.2670.

Full text

Abstract:

This study focuses on a distribution problem involving incompatible products which cannot be stored in a compartment of a vehicle. To satisfy different types of customer demand at minimum logistics cost, the products are stored in different compartments of fleet vehicles, which requires the problem to be modeled as a multiple-compartment vehicle routing problem (MCVRP). While there is an extensive literature on the vehicle routing problem (VRP) and its numerous variants, there are fewer research papers on the MCVRP. Firstly, a novel taxonomic framework for the VRP literature is proposed in thi

APA, Harvard, Vancouver, ISO, and other styles

29

Chu, Ching-Wu, and Hsiu-Li Hsu. "A heuristic algorithm for multiple trip vehicle routing problems with time window constraint and outside carrier selection." Maritime Business Review 4, no. 3 (2019): 256–73. http://dx.doi.org/10.1108/mabr-04-2019-0018.

Full text

Abstract:

Purpose In this paper, the authors introduced a real world new problem, the multi-trip vehicle routing problem with time windows and the possible use of a less-than-truckload carrier to satisfy customer demands. The purpose of this paper is to develop a heuristic algorithm to route the private trucks with time windows and to make a selection between truckload and less-than-truckload carriers by minimizing a total cost function. Design/methodology/approach Both mathematical model and heuristic algorithm are developed for routing the private trucks with time windows and for selecting of less-tha

APA, Harvard, Vancouver, ISO, and other styles

30

Soria-Alcaraz, Jorge A., Gabriela Ochoa, Andres Espinal, Marco A. Sotelo-Figueroa, Manuel Ornelas-Rodriguez, and Horacio Rostro-Gonzalez. "A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics." Complexity 2020 (February 13, 2020): 1–10. http://dx.doi.org/10.1155/2020/2871835.

Full text

Abstract:

Selection hyper-heuristics are generic search tools that dynamically choose, from a given pool, the most promising operator (low-level heuristic) to apply at each iteration of the search process. The performance of these methods depends on the quality of the heuristic pool. Two types of heuristics can be part of the pool: diversification heuristics, which help to escape from local optima, and intensification heuristics, which effectively exploit promising regions in the vicinity of good solutions. An effective search strategy needs a balance between these two strategies. However, it is not str

APA, Harvard, Vancouver, ISO, and other styles

31

Li, Yue Li, and Ai Hua Ren. "The Application of a Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem." Applied Mechanics and Materials 556-562 (May 2014): 4005–8. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.4005.

Full text

Abstract:

With the development of the market economy, the logistics industry has been developed rapidly.It is easy to understand that good vehicle travel path planning has very important significance in the logistics company,especially in the general production enterprises. This paper mainly studies the microcosmic traffic system in the type of vehicle routing problems: capacity-constrained vehicle routing problem. We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem, treated as nodes in a spatial network. For the networks where the nodes are concentrated, t

APA, Harvard, Vancouver, ISO, and other styles

32

Li, Yue Li, and Ai Hua Ren. "The Application of a Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem." Applied Mechanics and Materials 556-562 (May 2014): 4693–96. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.4693.

Full text

Abstract:

With the development of the market economy, the logistics industry has been developed rapidly.It is easy to understand that good vehicle travel path planning has very important significance in the logistics company,especially in the general production enterprises. This paper mainly studies the microcosmic traffic system in the type of vehicle routing problems: capacity-constrained vehicle routing problem. We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem, treated as nodes in a spatial network. For the networks where the nodes are concentrated, t

APA, Harvard, Vancouver, ISO, and other styles

33

Saravanan, M., and K.A.Sundararaman. "Metaheuristic Approaches for Vehicle Routing Problems." International Journal of Information Systems and Supply Chain Management 6, no. 2 (2013): 17–32. http://dx.doi.org/10.4018/jisscm.2013040102.

Full text

Abstract:

Routing of service vehicles are the heart of many service operations. Exclusively vehicle routing problem (VRP) plays a central role in the optimization of distribution networks. The routing of service vehicles has a major impact on the quality of the service provided. In distribution of goods and services, it is time and again required to determine a combination of least cost vehicle routes through a set of geographically scattered customers, subject to side constraints. The case most commonly studied is where all vehicles are identical. Due to the complexity involved in solving the VRP, most

APA, Harvard, Vancouver, ISO, and other styles

34

Prescott-Gagnon, Eric, Guy Desaulniers, and Louis-Martin Rousseau. "Heuristics for an oil delivery vehicle routing problem." Flexible Services and Manufacturing Journal 26, no. 4 (2012): 516–39. http://dx.doi.org/10.1007/s10696-012-9169-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Olivari, Luka, and Goran Đukić. "Current State of Dynamic Vehicle Routing Problems Solved by Ant Colony Optimization Algorithm." Tehnički glasnik 15, no. 3 (2021): 429–34. http://dx.doi.org/10.31803/tg-20210708131104.

Full text

Abstract:

Dynamic Vehicle Routing Problem is a more complex version of Vehicle Routing Problem, closer to the present, real-world problems. Heuristic methods are used to solve the problem as Vehicle Routing Problem is NP-hard. Among many different solution methods, the Ant Colony Optimization algorithm is proven to be the efficient solution when dealing with the dynamic version of the problem. Even though this problem is known to the scientific community for decades, the field is extremely active due to technological advancements and the current relevance of the problem. As various sub-types of routing

APA, Harvard, Vancouver, ISO, and other styles

36

Aydın, Nevin. "A Genetic Algorithm on Inventory Routing Problem." EMAJ: Emerging Markets Journal 3, no. 3 (2014): 59–66. http://dx.doi.org/10.5195/emaj.2014.31.

Full text

Abstract:

Inventory routing problem can be defined as forming the routes to serve to the retailers from the manufacturer, deciding on the quantity of the shipment to the retailers and deciding on the timing of the replenishments. The difference of inventory routing problems from vehicle routing problems is the consideration of the inventory positions of retailers and supplier, and making the decision accordingly. Inventory routing problems are complex in nature and they can be solved either theoretically or using a heuristics method. Metaheuristics is an emerging class of heuristics that can be applied

APA, Harvard, Vancouver, ISO, and other styles

37

Sariklis, D., and S. Powell. "A Heuristic Method for the Open Vehicle Routing Problem." Journal of the Operational Research Society 51, no. 5 (2000): 564. http://dx.doi.org/10.2307/254187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Editor. "Solving Rich Vehicle Routing Problem Using Three Steps Heuristic." International Journal of Artificial Intelligence 1, no. 1 (2019): 1–19. http://dx.doi.org/10.36079/lamintang.ijai-0101.9.

Full text

Abstract:

Vehicle Routing Problem (VRP) relates to the problem of providing optimum service with a fleet of vehicles to customers. It is a combinatorial optimization problem. The objective is usually to maximize the profit of the operation. However, for public transportation owned and operated by the government, accessibility takes priority over profitability. Accessibility usually reduces profit, while increasing profit tends to reduce accessibility. In this research, we look at how accessibility can be increased without penalizing the profitability. This requires the determination of routes with minim

APA, Harvard, Vancouver, ISO, and other styles

39

Editor. "Solving Rich Vehicle Routing Problem Using Three Steps Heuristic." International Journal of Artificial Intelligence 1, no. 1 (2019): 1–19. http://dx.doi.org/10.36079/lamintang.v1i1.9.

Full text

Abstract:

Vehicle Routing Problem (VRP) relates to the problem of providing optimum service with a fleet of vehicles to customers. It is a combinatorial optimization problem. The objective is usually to maximize the profit of the operation. However, for public transportation owned and operated by the government, accessibility takes priority over profitability. Accessibility usually reduces profit, while increasing profit tends to reduce accessibility. In this research, we look at how accessibility can be increased without penalizing the profitability. This requires the determination of routes with minim

APA, Harvard, Vancouver, ISO, and other styles

40

강성민. "A Heuristic Algorithm for the Asymmetric Vehicle Routing Problem." Korean Journal of Logistics 17, no. 2 (2009): 5–18. http://dx.doi.org/10.15735/kls.2009.17.2.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Younghwan Park, 채준재, and Jaeheon Woo. "A heuristic for vehicle routing problem considering CO2 emission." Korean Journal of Logistics 21, no. 3 (2013): 95–105. http://dx.doi.org/10.15735/kls.2013.21.3.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Tan, K. C., L. H. Lee, Q. L. Zhu, and K. Ou. "Heuristic methods for vehicle routing problem with time windows." Artificial Intelligence in Engineering 15, no. 3 (2001): 281–95. http://dx.doi.org/10.1016/s0954-1810(01)00005-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Sariklis, D., and S. Powell. "A heuristic method for the open vehicle routing problem." Journal of the Operational Research Society 51, no. 5 (2000): 564–73. http://dx.doi.org/10.1057/palgrave.jors.2600924.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Chao, I.-Ming, Bruce L. Golden, and Edward Wasil. "An improved heuristic for the period vehicle routing problem." Networks 26, no. 1 (1995): 25–44. http://dx.doi.org/10.1002/net.3230260104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Ren, Chun Yu. "Improved Heuristic Search Algorithm for Capacitated Vehicle Routing Problem." Applied Mechanics and Materials 361-363 (August 2013): 2079–82. http://dx.doi.org/10.4028/www.scientific.net/amm.361-363.2079.

Full text

Abstract:

The paper is focused on the capacitated vehicle routing problem. And solve this type of problems utilizing improved Heuristic Search Algorithm from the overall situation. According to the features of the problem, the essay centered the construct initial solution to construct neighborhood structure. For the operation, 1-exchange and 2-opt* were applied, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.

APA, Harvard, Vancouver, ISO, and other styles

46

Gendreau, Michel, Alain Hertz, and Gilbert Laporte. "A Tabu Search Heuristic for the Vehicle Routing Problem." Management Science 40, no. 10 (1994): 1276–90. http://dx.doi.org/10.1287/mnsc.40.10.1276.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Campo Zuniga, Byron, and Adel Mendoza Mendoza. "PST-Prim Heuristic for the Open Vehicle Routing Problem." IEEE Latin America Transactions 17, no. 02 (2019): 253–59. http://dx.doi.org/10.1109/tla.2019.8863171.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Zhang, Shuai, Yuvraj Gajpal, and S. S. Appadoo. "A meta-heuristic for capacitated green vehicle routing problem." Annals of Operations Research 269, no. 1-2 (2017): 753–71. http://dx.doi.org/10.1007/s10479-017-2567-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Kır, Sena, Harun Reşit Yazgan, and Emre Tüncel. "A novel heuristic algorithm for capacitated vehicle routing problem." Journal of Industrial Engineering International 13, no. 3 (2017): 323–30. http://dx.doi.org/10.1007/s40092-017-0187-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Qin, Lei, Ya Qin Li, and Kang Zhou. "Vehicle Routing Problem Based on Heuristic Artificial Fish School Algorithm." Applied Mechanics and Materials 721 (December 2014): 56–61. http://dx.doi.org/10.4028/www.scientific.net/amm.721.56.

Full text

Abstract:

Vehicle Routing Problem (VRP) is one of the core issue of logistics distribution, for traditional precision algorithms and heuristic algorithms had low accuracies or easily fell into local optimal solutions, it was difficult to obtain the optimal solution. This paper proposes a heuristic artificial fish school algorithm (HAFSA) for VRP, firstly, three-dimensional particle coding method is applied to vehicle routing code, and infeasible and inadequate artificial fish coding for heuristic repair, secondly HAFSA steps are given, finally the algorithm is tested through a simulative example. The ex

APA, Harvard, Vancouver, ISO, and other styles

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!