Увійти

Готові списки джерел за темами / Open Vehicle Routing Problem / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Open Vehicle Routing Problem.

Статті в журналах з теми "Open Vehicle Routing Problem"

Автор: Grafiati

Опубліковано: 3 червня 2025

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Open Vehicle Routing Problem".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Zhao, Yan Wei, J. L. Zhang, and D. J. Peng. "Open Vehicle Routing Problem Using Quantum Evolutionary Algorithm." Advanced Materials Research 102-104 (March 2010): 807–12. http://dx.doi.org/10.4028/www.scientific.net/amr.102-104.807.

Повний текст джерела

Анотація:

Open vehicle routing problem is a kind of special vehicle routing problem, in which the vehicles do not return the depots after completing the task. Aiming at open vehicle routing problem, the mathematical model was founded by introducing virtual depots. A quantum evolutionary algorithm combined with local optimization algorithms was proposed in this paper, in which 0-1 matrix encoding was used to construct chromosomes, rotation gate with adaptively adjusting rotation angle was used to realize evolution, nearest neighbors and 2-Opt were incorporated to further improve solutions. Based on bench

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Amalia, Atika Dwi Hanun, Herry Suprajitno, and Asri Bekti Pratiwi. "Solving Close-Open Mixed Vehicle Routing Problem Using Bat Algorithm." Contemporary Mathematics and Applications (ConMathA) 2, no. 1 (2020): 46. http://dx.doi.org/10.20473/conmatha.v2i1.19301.

Повний текст джерела

Анотація:

The purpose of this research is to solve the Close-Open Mixed Vehicle Routing Problem (COMVRP) using Bat Algorithm. COMVRP which is a combination of Close Vehicle Routing Problem or commonly known as Vehicle Routing Problem (VRP) with Open Vehicle Routing Problem (OVRP) is a problem to determine vehicles route in order to minimize total distance to serve customers without exceed vehicle capacity. COMVRP occurs when the company already has private vehicles but its capacity could not fulfill all customer demands so the company must rent several vehicles from other companies to complete the distr

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Dutta, Joydeep, Partha Sarathi Barma, Samarjit Kar, and Tanmay De. "A Modified Kruskal's Algorithm to Improve Genetic Search for Open Vehicle Routing Problem." International Journal of Business Analytics 6, no. 1 (2019): 55–76. http://dx.doi.org/10.4018/ijban.2019010104.

Повний текст джерела

Анотація:

This article has proposed a modified Kruskal's method to increase the efficiency of a genetic algorithm to determine the path of least distance starting from a central point to solve the open vehicle routing problem. In a vehicle routing problem, vehicles start from a central point and several customers placed in different locations to serve their demands and return to the central point. In the case of the open vehicle routing problem, the vehicles do not go back to the central point after serving the customers. The challenge is to reduce the number of vehicles used and the distance travelled

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Rahman, Laula Ika Setya, Asri Bekti Pratiwi, and Herry Suprajitno. "Penerapan Seagulls Optimization Algorithm untuk Menyelesaikan Open Vehicle Routing Problem." Contemporary Mathematics and Applications (ConMathA) 4, no. 1 (2022): 42–50. http://dx.doi.org/10.20473/conmatha.v4i1.34549.

Повний текст джерела

Анотація:

This paper aims to solve the problem of Open Vehicle Routing Problem using Seagulls Optimization Algorithm. Open Vehicle Routing Problem (OVRP) is a variation of Vehicle Routing Problem (VRP) which will not return to the depot after visiting the last customer, is different from VRP which requires the vehicle to return to the depot because the company have insufficient number of vehicles for the distribution of products to customers so they must to rent vehicles and this OVRP aims to minimize the total cost of distributing products with the shortest optimal distance to meet the demands of each

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Yu, Vincent F., Parida Jewpanya, and A. A. N. Perwira Redi. "Open vehicle routing problem with cross-docking." Computers & Industrial Engineering 94 (April 2016): 6–17. http://dx.doi.org/10.1016/j.cie.2016.01.018.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Liu, Ran, and Zhibin Jiang. "The close–open mixed vehicle routing problem." European Journal of Operational Research 220, no. 2 (2012): 349–60. http://dx.doi.org/10.1016/j.ejor.2012.01.061.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Yuliza, Evi, Fitri Maya Puspita, and Siti Suzlin Supadi. "The robust counterpart open capacitated vehicle routing problem with time windows on waste transport problems." Bulletin of Electrical Engineering and Informatics 9, no. 5 (2020): 2074–81. http://dx.doi.org/10.11591/eei.v9i5.2439.

Повний текст джерела

Анотація:

The optimum route for garbage transport vehicles is restricted by vehicle capacity and time windows that the garbage transport vehicle starts at the origin and does not return to the origin. The problem of transporting waste routes is a robust optimization problem where the amount of waste in an area and travel time is uncertain. In the real world, traffic jams and vehicle engine damage can cause delays. This paper proposes the robust counterpart open capacitated vehicle routing problem (denoted by RCOCVRP) with soft time windows model. The aim of RCOCVRP with soft time windows model is to fin

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Evi, Yuliza, Maya Puspita Fitri, and Suzlin Supadi Siti. "The robust counterpart open capacitated vehicle routing problem with time windows on waste transport problems." Bulletin of Electrical Engineering and Informatics 9, no. 5 (2020): 2074–81. https://doi.org/10.11591/eei.v9i5.2439.

Повний текст джерела

Анотація:

The optimum route for garbage transport vehicles is restricted by vehicle capacity and time windows that the garbage transport vehicle starts at the origin and does not return to the origin. The problem of transporting waste routes is a robust optimization problem where the amount of waste in an area and travel time is uncertain. In the real world, traffic jams and vehicle engine damage can cause delays. This paper proposes the robust counterpart open capacitated vehicle routing problem (denoted by RCOCVRP) with soft time windows model. The aim of RCOCVRP with soft time windows model is to fin

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Díaz-Parra, Ocotlán, Jorge A. Ruiz-Vanoye, Beatriz Bernábe Loranca, Alejandro Fuentes-Penna, and Ricardo A. Barrera-Cámara. "A Survey of Transportation Problems." Journal of Applied Mathematics 2014 (2014): 1–17. http://dx.doi.org/10.1155/2014/848129.

Повний текст джерела

Анотація:

This paper aims at being a guide to understand the different types of transportation problems by presenting a survey of mathematical models and algorithms used to solve different types of transportation modes (ship, plane, train, bus, truck, Motorcycle, Cars, and others) by air, water, space, cables, tubes, and road. Some problems are as follows: bus scheduling problem, delivery problem, combining truck trip problem, open vehicle routing problem, helicopter routing problem, truck loading problem, truck dispatching problem, truck routing problem, truck transportation problem, vehicle routing pr

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Yousefikhoshbakht, Majid, and Azam Dolatnejad. "A Column Generation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem." International Journal of Production Management and Engineering 5, no. 2 (2017): 55. http://dx.doi.org/10.4995/ijpme.2017.5916.

Повний текст джерела

Анотація:

<div><p class="TtuloAbstract">This paper addressed the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), in which the vehicles are not required to return to the depot after completing a service. In this new problem, the demands of customers are fulfilled by a heterogeneous fixed fleet of vehicles having various capacities, fixed costs and variable costs. This problem is an important variant of the open vehicle routing problem (OVRP) and can cover more practical situations in transportation and logistics. Since this problem belongs to NP-hard Problems, An approach ba

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Repoussis, P. P., C. D. Tarantilis, and G. Ioannou. "The open vehicle routing problem with time windows." Journal of the Operational Research Society 58, no. 3 (2007): 355–67. http://dx.doi.org/10.1057/palgrave.jors.2602143.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Cao, Erbao, and Mingyong Lai. "The open vehicle routing problem with fuzzy demands." Expert Systems with Applications 37, no. 3 (2010): 2405–11. http://dx.doi.org/10.1016/j.eswa.2009.07.021.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Atefi, Reza, Majid Salari, Leandro C. Coelho, and Jacques Renaud. "The open vehicle routing problem with decoupling points." European Journal of Operational Research 265, no. 1 (2018): 316–27. http://dx.doi.org/10.1016/j.ejor.2017.07.033.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Kim, Gitae. "Electric Vehicle Routing Problem with States of Charging Stations." Sustainability 16, no. 8 (2024): 3439. http://dx.doi.org/10.3390/su16083439.

Повний текст джерела

Анотація:

This paper proposes an electric vehicle routing problem, considers the states of charging stations and suggests solution strategies. The charging of electric vehicles is a main issue in the field of electric vehicle routing. There are many studies that find the locations of charging stations, recharging functions for the batteries of vehicles, and so on. However, the state of charging stations significantly affects the routes of electric vehicles, which is not much explored. The states may include open or closed charging stations, occupied or empty charging slots, and so on. This paper investi

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Septiyafi, Ihda, Herry Suprajitno, and Asri Bekti Pratiwi. "Penerapan Algoritma Kunang-Kunang pada Open Vehicle Routing Problem (OVRP)." Contemporary Mathematics and Applications (ConMathA) 1, no. 1 (2019): 46. http://dx.doi.org/10.20473/conmatha.v1i1.14774.

Повний текст джерела

Анотація:

This paper aims to solve Open Vehicle Routing Problem using Firefly Algorithm. Open Vehicle Routing Problem (OVRP) is a variant of Vehicle Routing Problem (VRP) where vehicles used to serve customers do not return to the depot after serving the last customer on each route. The steps of the Firefly Algorithm to handle OVRP are data input and initialization parameters, generating the initial population for each firefly, sorting population sources, calculating the value of the objective function and light intensity, comparing the intensity of light, performing movement, setting the best fireflies

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Soto-Mendoza, Valeria, Irma García-Calvillo, Efraín Ruiz-y-Ruiz, and Jaime Pérez-Terrazas. "A Hybrid Grasshopper Optimization Algorithm Applied to the Open Vehicle Routing Problem." Algorithms 13, no. 4 (2020): 96. http://dx.doi.org/10.3390/a13040096.

Повний текст джерела

Анотація:

This paper presents a hybrid grasshopper optimization algorithm using a novel decoder and local search to solve instances of the open vehicle routing problem with capacity and distance constraints. The algorithm’s decoder first defines the number of vehicles to be used and then it partitions the clients, assigning them to the available routes. The algorithm performs a local search in three neighborhoods after decoding. When a new best solution is found, every route is locally optimized by solving a traveling salesman problem, considering the depot and clients in the route. Three sets containin

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Ahmed, Zakir Hussain, and Majid Yousefikhoshbakht. "A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows." Symmetry 15, no. 2 (2023): 486. http://dx.doi.org/10.3390/sym15020486.

Повний текст джерела

Анотація:

Nowadays, using a rental fleet to transport goods for delivering to customers at a particular time frame is very important in the services and industry. That is why, in this study, we consider the heterogeneous fixed fleet open vehicle routing problem with time windows, which is one version of the vehicle routing problem with time windows. The problem has not attracted attention so much in the operational research literature than the usual vehicle routing problem. The problem consists of determining the minimum cost routes for a fleet of a fixed number of vehicles with various capacities in or

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Yousefikhoshbakht, Majid, Azam Dolatnejad, Farzad Didehvar, and Farhad Rahmati. "A Modified Column Generation to Solve the Heterogeneous Fixed Fleet Open Vehicle Routing Problem." Journal of Engineering 2016 (2016): 1–12. http://dx.doi.org/10.1155/2016/5692792.

Повний текст джерела

Анотація:

In the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), several different types of vehicles can be used to service the customers. The types of vehicles are different in terms of capacity, fixed cost, and variable cost. In this problem, the vehicles are not required to return to the depot after completing a service and the number of vehicles of each type is fixed and limited. Since this problem belongs to NP-hard problems, in this paper a compound heuristic algorithm called SISEC which includes sweep algorithm, insert, swap, and 2-opt moves, modified elite ant system (EAS), and

Стилі APA, Harvard, Vancouver, ISO та ін.

19

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Imran, A. "Two-Stage Algorithm for the Open Vehicle Routing Problem." IOP Conference Series: Materials Science and Engineering 532 (June 13, 2019): 012006. http://dx.doi.org/10.1088/1757-899x/532/1/012006.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Masutti, Thiago A. S., and Leandro N. de Castro. "Bee-Inspired Algorithms Applied to Vehicle Routing Problems: A Survey and a Proposal." Mathematical Problems in Engineering 2017 (2017): 1–20. http://dx.doi.org/10.1155/2017/3046830.

Повний текст джерела

Анотація:

Vehicle routing problems constitute a class of combinatorial optimization tasks that search for optimal routes (e.g., minimal cost routes) for one or more vehicles to attend a set of nodes (e.g., cities or customers). Finding the optimal solution to vehicle routing tasks is an NP-hard problem, meaning that the size of problems that can be solved by exhaustive search is limited. From a practical perspective, this class of problems has a wide and important set of applications, from the distribution of goods to the integrated chip design. Rooted on the use of collective intelligence, swarm-inspir

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Zhang, Li Hua, and Ming Yang Wang. "Study on a Multi-Depot and Heterogeneous-Vehicle Open Vehicle Routing Problem to Reduce Fuel Consumption." Applied Mechanics and Materials 336-338 (July 2013): 2567–71. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.2567.

Повний текст джерела

Анотація:

An open vehicle routing problem is studied. In this problem, multi-depot, heterogeneous-vehicle, fuel consumption and start-up costs of vehicles are considered, thus a genetic algorithm is given to solve this hard problem. In order to improve the performance of the genetic algorithm, a heuristic algorithm is provided to produce the initial population and participate in crossover. An example is given to illustrate the genetic algorithm.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

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.

Повний текст джерела

Анотація:

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 та ін.

26

Grakova, Ekaterina, Martin Golasowski, Roberto Montemanni, et al. "Hyperparameter search in periodic vehicle routing problem." MATEC Web of Conferences 259 (2019): 01003. http://dx.doi.org/10.1051/matecconf/201925901003.

Повний текст джерела

Анотація:

The large number of real-world applications have shown that the use of computational method for distribution process planning produces substantial savings. Many of these applications lead to problem generally known as Vehicle Routing Problem. The real-world applications are highly computationally demanding for larger instances. This article aims to show the possibilities and benefits of using hyperparameter search for solving the Periodic Vehicle Routing Problem for exhausted oil collection by execution on the supercomputing infrastructure using HyperLoom platform. HyperLoom is an open source

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Maryam, Ashouri, and Yousefikhoshbakht Majid. "BRAIN Journal - A Combination of Meta-heuristic and Heuristic Algorithms for the VRP, OVRP and VRP with Simultaneous Pickup and Delivery." BRAIN: Broad Research in Artificial Intelligence and Neuroscience 8, no. 2 (2017): 81–95. https://doi.org/10.5281/zenodo.1045361.

Повний текст джерела

Анотація:

ABSTRACT Vehicle routing problem (VRP) is a Nondeterministic Polynomial Hard combinatorial optimization problem to serve the consumers from central depots and returned back to the originated depots with given vehicles. Furthermore, two of the most important extensions of the VRPs are the open vehicle routing problem (OVRP) and VRP with simultaneous pickup and delivery (VRPSPD). In OVRP, the vehicles have not return to the depot after last visit and in VRPSPD, customers require simultaneous delivery and pick-up service. The aim of this paper is to present a combined effective ant colony optimiz

Стилі APA, Harvard, Vancouver, ISO та ін.

28

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.

Повний текст джерела

Анотація:

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 та ін.

29

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.

Повний текст джерела

Анотація:

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 та ін.

30

Gasset, Diego, Felipe Paillalef, Sebastián Payacán, et al. "Route Optimization for Open Vehicle Routing Problem (OVRP): A Mathematical and Solution Approach." Applied Sciences 14, no. 16 (2024): 6931. http://dx.doi.org/10.3390/app14166931.

Повний текст джерела

Анотація:

In the everchanging landscape of human mobility and commerce, efficient route planning has become paramount. This paper addresses the open vehicle routing problem (OVRP), a major logistical challenge in route optimization for a fleet of vehicles serving geographically dispersed customers. Using a heuristic approach, we explore the complexities of OVRP, comparing the results with advanced optimization methods. This study not only highlights the effectiveness of mathematical modeling, but also explores the practicality of heuristic algorithms such as Greedy, Nearest Neighbor and 2-opt to provide

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Zhou, Zhongxin, Minghu Ha, Hao Hu, and Hongguang Ma. "Half Open Multi-Depot Heterogeneous Vehicle Routing Problem for Hazardous Materials Transportation." Sustainability 13, no. 3 (2021): 1262. http://dx.doi.org/10.3390/su13031262.

Повний текст джерела

Анотація:

How to reduce the accidents of hazardous materials has become an important and urgent research topic in the safety management of hazardous materials. In this study, we focus on the half open multi-depot heterogeneous vehicle routing problem for hazardous materials transportation. The goal is to determine the vehicle allocation and the optimal route with minimum risk and cost for hazardous materials transportation. A novel transportation risk model is presented considering the variation of vehicle loading, vehicle types, and hazardous materials category. In order to balance the transportation r

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Niu, Yunyun, Zehua Yang, Ping Chen, and Jianhua Xiao. "A Hybrid Tabu Search Algorithm for a Real-World Open Vehicle Routing Problem Involving Fuel Consumption Constraints." Complexity 2018 (2018): 1–12. http://dx.doi.org/10.1155/2018/5754908.

Повний текст джерела

Анотація:

Outsourcing logistics operation to third-party logistics has attracted more attention in the past several years. However, very few papers analyzed fuel consumption model in the context of outsourcing logistics. This problem involves more complexity than traditional open vehicle routing problem (OVRP), because the calculation of fuel emissions depends on many factors, such as the speed of vehicles, the road angle, the total load, the engine friction, and the engine displacement. Our paper proposed a green open vehicle routing problem (GOVRP) model with fuel consumption constraints for outsourci

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Gnanapragasam, S. R., and W. B. Daundasekera. "Open vehicle routing problem with moving shipments at the cross-docking terminal." Ruhuna Journal of Science 14, no. 1 (2023): 14–28. http://dx.doi.org/10.4038/rjs.v14i1.131.

Повний текст джерела

Анотація:

In this study, one of the internal operations at the Cross-docking Terminal (CDT), moving shipments (MS) from receiving doors to shipping doors of CDT is integrated with Open Vehicle Routing Problem (OVRP) and the problem is indicated here as OVRPCD-MS. As an additional feature, asymmetric distance between any two customers is assigned by incorporating a characteristic of one-way routes between cities in real-life transportation. The objective is to minimize the total transportation cost which incurs travelling cost between customers, service cost at customer points, service cost at the receiv

Стилі APA, Harvard, Vancouver, ISO та ін.

34

จารุพัฒน์, อรประไพ, and ปวีณา เชาวลิตวงศ์. "Heuristic for Open Vehicle Routing Problem to Reduce Transportation Cost." วารสารวิศวกรรมศาสตร์ 4, no. 3 (2012): 57–72. http://dx.doi.org/10.4186/ejth.2012.4.3.57.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Diao, Xiaolong, Houming Fan, Xiaoxue Ren, and Chuanying Liu. "Multi-depot open vehicle routing problem with fuzzy time windows." Journal of Intelligent & Fuzzy Systems 40, no. 1 (2021): 427–38. http://dx.doi.org/10.3233/jifs-191968.

Повний текст джерела

Анотація:

This paper presents one method and one hybrid genetic algorithm for multi-depot open vehicle routing problem with fuzzy time windows (MDOVRPFTW) without maximum time windows. For the method, the degree of customers’ willingness to accept goods (DCWAG) is firstly proposed, it’s one fuzzy vague and determines maximum time windows. Referring to methods to determine fuzzy membership function, the function between DCWAG and the starting service time is constructed. By setting an threshold for DCWAG, the starting service time that the threshold corresponds can be treated as the maximum time window,

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Morris, Ann, Justin Schwartz, Michael Womack, and Burcu Adivar. "Open Source Business Analytics Solution for Capacitated Vehicle Routing Problem." International Journal of Logistics Systems and Management 1, no. 1 (2020): 1. http://dx.doi.org/10.1504/ijlsm.2020.10042625.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Campo Zuniga, Byron, Adel Mendoza Mendoza, and Daniel Mendoza Casseres. "Algorithms Heuristic for Solving the of Open Vehicle Routing Problem." Journal of Engineering and Applied Sciences 14, no. 9 (2019): 2993–98. http://dx.doi.org/10.36478/jeasci.2019.2993.2998.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Tarantilis, Christos D., George Ioannou, Chris T. Kiranoudis, and Gregory P. Prastacos. "A threshold accepting approach to the Open Vehicle Routing problem." RAIRO - Operations Research 38, no. 4 (2004): 345–60. http://dx.doi.org/10.1051/ro:2004029.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Aksen, D., Z. Özyurt, and N. Aras. "Open vehicle routing problem with driver nodes and time deadlines." Journal of the Operational Research Society 58, no. 9 (2007): 1223–34. http://dx.doi.org/10.1057/palgrave.jors.2602249.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Brandão, José. "A tabu search algorithm for the open vehicle routing problem." European Journal of Operational Research 157, no. 3 (2004): 552–64. http://dx.doi.org/10.1016/s0377-2217(03)00238-8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Lysgaard, Jens, Ana Dolores López-Sánchez, and Alfredo G. Hernández-Díaz. "A matheuristic for the MinMax capacitated open vehicle routing problem." International Transactions in Operational Research 27, no. 1 (2018): 394–417. http://dx.doi.org/10.1111/itor.12581.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

42

MirHassani, S. A., and N. Abolghasemi. "A particle swarm optimization algorithm for open vehicle routing problem." Expert Systems with Applications 38, no. 9 (2011): 11547–51. http://dx.doi.org/10.1016/j.eswa.2011.03.032.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Repoussis, P. P., C. D. Tarantilis, O. Bräysy, and G. Ioannou. "A hybrid evolution strategy for the open vehicle routing problem." Computers & Operations Research 37, no. 3 (2010): 443–55. http://dx.doi.org/10.1016/j.cor.2008.11.003.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Salari, Majid, Paolo Toth, and Andrea Tramontani. "An ILP improvement procedure for the Open Vehicle Routing Problem." Computers & Operations Research 37, no. 12 (2010): 2106–20. http://dx.doi.org/10.1016/j.cor.2010.02.010.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Ren, Chun Yu. "Study on Hybrid Genetic Algorithm for Multi-Type Vehicle Open Vehicle Routing Problem." Advanced Materials Research 204-210 (February 2011): 1287–90. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.1287.

Повний текст джерела

Анотація:

Multi-type vehicle open vehicle routing problem is logistics optimization indispensable part. Hybrid genetic algorithm is used to optimize the solution. Firstly, use sequence of real numbers coding so as to simplify the problem; Construct the targeted initial solution to improve the feasibility; adopt some arithmetic crossover operator to enhance whole search ability of the chromosome. Secondly, Boltzmann simulated annealing mechanism for control genetic algorithm crossover and mutation operations improve the convergence speed and search efficiency. Finally, comparing to standard genetic algor

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Puspita, Fitri Maya, Ani Sahara Br. Simanjuntak, Rima Melati, and Sisca Octarina. "Demand robust counterpart open capacitated vehicle routing problem time windows and deadline model of garbage transportation with LINGO 13.0." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 6 (2020): 6380. http://dx.doi.org/10.11591/ijece.v10i6.pp6380-6388.

Повний текст джерела

Анотація:

Demand robust counterpart-open capacitated vehicle routing problem with time windows and deadline (DRC-OCVRPtw,d) model formed and explained in this paper, is the model used to find the minimum distance and the time needed for vehicles to transport garbage in Sukarami Sub-District, Palembang that consists of the time it takes for the vehicle to pass through the route. Time needed to transport garbage to the vehicle is called time windows. Combination of the thoses times is called deadline. The farther  the distance passed by vehicle and the more garbage transported, the longer the deadli

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Fitri, Maya Puspita, Sahara Br. Simanjuntak Ani, Melati Rima, and Octarina Sisca. "Demand robust counterpart open capacitated vehicle routing problem time windows and deadline model of garbage transportation with LINGO 13.0." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 5 (2020): 6380–88. https://doi.org/10.11591/ijece.v10i6.pp6380-6388.

Повний текст джерела

Анотація:

Demand robust counterpart-open capacitated vehicle routing problem with time windows and deadline (DRC-OCVRPtw,d) model formed and explained in this paper, is the model used to find the minimum distance and the time needed for vehicles to transport garbage in Sukarami Sub-District, Palembang that consists of the time it takes for the vehicle to pass through the route. Time needed to transport garbage to the vehicle is called time windows. Combination of the thoses times is called deadline. The farther the distance passed by vehicle and the more garbage transported, the longer the deadline is n

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Li, Feiyue, Bruce Golden, and Edward Wasil. "The open vehicle routing problem: Algorithms, large-scale test problems, and computational results." Computers & Operations Research 34, no. 10 (2007): 2918–30. http://dx.doi.org/10.1016/j.cor.2005.11.018.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Poikonen, Stefan, and Bruce Golden. "The Mothership and Drone Routing Problem." INFORMS Journal on Computing 32, no. 2 (2020): 249–62. http://dx.doi.org/10.1287/ijoc.2018.0879.

Повний текст джерела

Анотація:

The mothership and drone routing problem (MDRP) considers the routing of a two-vehicle tandem. The larger vehicle, which may be a ship or an airplane, is called the mothership; the smaller vehicle, which may be a small boat or unmanned aerial vehicle, is called the drone. We assume that there exists a set of target locations T. For each t in T, the drone must launch from the mothership, visit t, and then return to the mothership to refuel. The drone has a limited range of R time units. In the MDRP, we assume that both mothership and drone operate in the “open seas” (i.e., using the Euclidean m

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Guia, Sana Sahar, Abdelkader Laouid, Mohammad Hammoudeh, Ahcène Bounceur, Mai Alfawair, and Amna Eleyan. "Co-Simulation of Multiple Vehicle Routing Problem Models." Future Internet 14, no. 5 (2022): 137. http://dx.doi.org/10.3390/fi14050137.

Повний текст джерела

Анотація:

Complex systems are often designed in a decentralized and open way so that they can operate on heterogeneous entities that communicate with each other. Numerous studies consider the process of components simulation in a complex system as a proven approach to realistically predict the behavior of a complex system or to effectively manage its complexity. The simulation of different complex system components can be coupled via co-simulation to reproduce the behavior emerging from their interaction. On the other hand, multi-agent simulations have been largely implemented in complex system modeling

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!