Увійти

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

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Open Vehicle Routing Problem"

Автор: Grafiati

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

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

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

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

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Open Vehicle Routing Problem".

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

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

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

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

Більше джерел

Дисертації з теми "Open Vehicle Routing Problem"

1

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.

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

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

2

Sukarno, Setyawan Ajie. "Méthodes d'approximation au problème de routage de véhicule pour une gestion de flotte de drones." Thesis, Valenciennes, Université Polytechnique Hauts-de-France, 2019. http://www.theses.fr/2019UPHF0022.

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

Анотація:

Aujourd’hui, le drone joue un rôle important dans les activités civiles et deviendra de plus en plus important à l’avenir. Récemment, de nouvelles tendances se dirigent vers la gestion d’une ﬂotte de drones aﬁn de réaliser les missions données. Ce problème ouvre de nombreuses idées de recherche, et notre projet est fait pour répondre au déﬁ, développer une plateforme de gestion de ﬂotte de drones. Entre plusieurs approches, le problème de routage de véhicule (VRP) est une étude parfaite pour relever ce déﬁ, aﬁn de répartir les tâches et de trouver le meilleur chemin pour chaque drone, en tenan

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

3

Villanueva, Rafael Salcedo. "A pragmatic approach to improve the efficiency of the waste management system in Stockholm through the use of Big Data, Heuristics and open source VRP solvers : A real life waste collection problem;Stockholm’s waste collection system and inherent vehicle routing problem, VRP." Thesis, KTH, Hållbar utveckling, miljövetenskap och teknik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-272200.

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

Анотація:

In this thesis, we will address a real life waste collection problem; Stockholm’s waste collection system and inherent vehicle routing problem, VRP. To do this we will first delve into some mathematical theory of Combinatorial Optimization and Heuristics to understand the fundamentals of the problem. Following with some pragmatic approaches recommended by experts within the Smart Cities context. Finally, the most important part of the work is the creation of a model of the actual collection system and two optimized versions. After completing the model of the system, we compare the current situ

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

4

Mourgaya, Virapatrin Magalie. "The periodic vehicle routing problem : planning before routing." Bordeaux 1, 2004. http://www.theses.fr/2004BOR12843.

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

Анотація:

Le problème de tournées de véhicules multipériodiques consisté à planifier des visites client sur un horizon de temps donné en les affectant à des tournées de véhicule. Les fréquences de visites ou espacement entre elles sont prescrits. Ces contraintes peuvent prendre la forme de scénarios de visites admissibles. Nous étudions les différentes variantes de ce problème et proposons une classification. Nous présentons ensuite un algorithme heuristique pour un modèle de planification tactique qui optimise la répartition de la charge et la régionalisation des tournées. L'objectif traditionnel de mi

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

5

Jacobs, Charlotte Diane. "The vehicle routing problem with backhauls." Diss., Georgia Institute of Technology, 1987. http://hdl.handle.net/1853/25629.

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

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

6

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.

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

Анотація:

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

7

Johar, Farhana. "Vehicle routing problem with availability constraints." Thesis, University of Southampton, 2015. https://eprints.soton.ac.uk/389516/.

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

Анотація:

This work is concerned with solving the vehicle routing problem (VRP) which takes into account the customer's release and due date. The problem studied can also be categorized as a non-classical VRP as the departure times of vehicles depend on the dates of orders released from the production line and become available for the distribution process. Hence, the problem is known as VRP with availability constraints (VRPAC). The VRPAC is investigated through two stages. In the first stage, vehicle routing problem with release and due date (VRPRDD) is treated. At the beginning of the planning, it is

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

8

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

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

Анотація:

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

9

Maqueo, Rodrigo Rubio. "Dynamic-stochastic vehicle routing and inventory problem." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/10593.

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

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

10

Cornick, Namrata Uppal. "The vehicle routing problem with demand ranges." College Park, Md.: University of Maryland, 2009. http://hdl.handle.net/1903/9376.

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

Анотація:

Thesis (M.S.) -- University of Maryland, College Park, 2009.<br>Thesis research directed by: Applied Mathematics and Scientific Computation Program . Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

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

Більше джерел

Книги з теми "Open Vehicle Routing Problem"

1

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

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

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

2

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

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

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

3

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

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

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

4

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

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

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

5

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

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

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

6

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

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

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

7

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

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

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

8

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

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

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

9

The Vehicle Routing Problem. Siam, 2002.

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

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

10

Bioinspired Algorithms For The Vehicle Routing Problem. Springer, 2008.

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

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

Більше джерел

Частини книг з теми "Open Vehicle Routing Problem"

1

Marinakis, Yannis, Magdalene Marinaki, and Athanasios Migdalas. "Variants and Formulations of the Vehicle Routing Problem." In Open Problems in Optimization and Data Analysis. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99142-9_7.

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

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

2

Idzikowski, Radosław. "Capacitated Open Vehicle Routing Problem with Time Couplings." In Theory and Applications of Dependable Computer Systems. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-48256-5_27.

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

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

3

Wang, Wanliang, Bin Wu, Yanwei Zhao, and Dingzhong Feng. "Particle Swarm Optimization for Open Vehicle Routing Problem." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/978-3-540-37275-2_126.

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

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

4

Güler, Bekir, and Aişe Zülal Şevkli. "Oscillated Variable Neighborhood Search for Open Vehicle Routing Problem." In Neural Information Processing. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26555-1_21.

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

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

5

Hosseinabadi, Ali Asghar Rahmani, Maryam Kardgar, Mohammad Shojafar, Shahab Shamshirband, and Ajith Abraham. "Gravitational Search Algorithm to Solve Open Vehicle Routing Problem." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-28031-8_8.

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

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

6

Li, Xiangyong, and Peng Tian. "An Ant Colony System for the Open Vehicle Routing Problem." In Ant Colony Optimization and Swarm Intelligence. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11839088_33.

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

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

7

Duan, Fenghua, and Xiaonian He. "Multiple Depots Incomplete Open Vehicle Routing Problem Based on Carbon Tax." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-45049-9_17.

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

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

8

Sun, Gao-Ji. "Knowledge-Guided Neighborhood Search Algorithm for Close-Open Vehicle Routing Problem." In Uncertainty and Operations Research. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5720-0_18.

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

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

9

Psychas, Iraklis-Dimitrios, Eleni Delimpasi, Magdalene Marinaki, and Yannis Marinakis. "Influenza Virus Algorithm for Multiobjective Energy Reduction Open Vehicle Routing Problem." In Emergence, Complexity and Computation. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77510-4_5.

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

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

10

Ge, Hongyi, Tong Zhen, Yuying Jiang, and Yi Che. "An Intelligent Solution for Open Vehicle Routing Problem in Grain Logistics." In Lecture Notes in Electrical Engineering. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14350-2_49.

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

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

Тези доповідей конференцій з теми "Open Vehicle Routing Problem"

1

Nouir, Rihem, and Imen Hamdi. "Open Vehicle Routing Problem with Time Windows in a Real Case Application." In 2024 International Conference on Decision Aid Sciences and Applications (DASA). IEEE, 2024. https://doi.org/10.1109/dasa63652.2024.10836484.

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

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

2

Belbachir, Ryan, Walid Behiri, Sana Belmokhtar-Berraf, E. Veronica Belmega, and Leila Hamdad. "A MIP for a generalized open vehicle routing problem with pickup and delivery considering optional cross-dock." In 2024 10th International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 2024. http://dx.doi.org/10.1109/codit62066.2024.10708082.

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

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

3

Xu, Yingkai, Anikó Kopacz, and Camelia Chira. "A Hybrid Granular Ball-Ant Colony Optimization for the Multi-Depot Half-Open Time-Dependent Electric Vehicle Routing Problem." In 2025 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2025. https://doi.org/10.1109/cec65147.2025.11043000.

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

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

4

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

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

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

5

Huang, Fuhua, and Changshi Liu. "An Improved Tabu Search for Open Vehicle Routing Problem." In 2010 International Conference on Management and Service Science (MASS 2010). IEEE, 2010. http://dx.doi.org/10.1109/icmss.2010.5576368.

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

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

6

Tavakkoli-Moghaddam, Reza, Mohammadreza Meskini, Hadi Nasseri, and Haed Tavakkoli-Moghaddam. "A Multi-Depot Close and Open Vehicle Routing Problem with Heterogeneous Vehicles." In 2019 International Conference on Industrial Engineering and Systems Management (IESM). IEEE, 2019. http://dx.doi.org/10.1109/iesm45758.2019.8948137.

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

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

7

Pan, Lijun, and Z. Fu. "A Clone Selection Algorithm for the Open Vehicle Routing Problem." In 2009 3rd International Conference on Genetic and Evolutionary Computing (WGEC). IEEE, 2009. http://dx.doi.org/10.1109/wgec.2009.174.

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

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

8

Zhang, Jingling, Yanwei Zhao, Dianjun Peng, and Wanliang Wang. "A hybrid Quantum-Inspired Evolutionary Algorithm for open vehicle routing problem." In 2009 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM). IEEE, 2009. http://dx.doi.org/10.1109/aim.2009.5229905.

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

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

9

Zhen, Tong, Yuhua Zhu, and Qiuwen Zhang. "A Particle Swarm Optimization Algorithm for the Open Vehicle Routing Problem." In 2009 International Conference on Environmental Science and Information Application Technology, ESIAT. IEEE, 2009. http://dx.doi.org/10.1109/esiat.2009.273.

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

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

10

Chen, Ping, Xingye Dong, and Jianhua Xiao. "Study on split delivery open vehicle routing problem within two splits." In 2016 12th International Conference on Natural Computation and 13th Fuzzy Systems and Knowledge Discovery (ICNC-FSKD). IEEE, 2016. http://dx.doi.org/10.1109/fskd.2016.7603264.

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

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

Звіти організацій з теми "Open Vehicle Routing Problem"

1

Iyer, Ananth V., Samuel Labi, Steven R. Dunlop, et al. Heavy Fleet and Facilities Optimization. Purdue University, 2022. http://dx.doi.org/10.5703/1288284317365.

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

Анотація:

The Indiana Department of Transportation (INDOT) is responsible for timely clearance of snow on state-maintained highways in Indiana as part of its wintertime operations. For this and other maintenance purposes, the state’s subdistricts maintain 101 administrative units spread throughout the state. These units are staffed by personnel, including snow truck drivers and house snow removal trucks and other equipment. INDOT indicated a need to carry out value engineering analysis of the replacement timing of the truck fleet. To address these questions, this study carried out analysis to ascertain

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

2

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

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

Анотація:

Recent development of autonomous and connected trucks (ACT) has provided the freight industry with the option of using truck platooning to improve fuel efficiency, traffic throughput, and safety. However, closely spaced and longitudinally aligned trucks impose frequent and concentrated loading on pavements, which often accelerates pavement deterioration and increases the life cycle costs for the highway agency. Also, effectiveness of truck platooning can be maximized only in dedicated lanes; and its benefits and costs need to be properly balanced between stakeholders. This paper proposes a net

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

3

An Input Linearized Powertrain Model for the Optimal Control of Hybrid Electric Vehicles. SAE International, 2022. http://dx.doi.org/10.4271/2022-01-0741.

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

Анотація:

Models of hybrid powertrains are used to establish the best combination of conventional engine power and electric motor power for the current driving situation. The model is characteristic for having two control inputs and one output constraint: the total torque should be equal to the torque requested by the driver. To eliminate the constraint, several alternative formulations are used, considering engine power or motor power or even the ratio between them as a single control input. From this input and the constraint, both power levels can be deduced. There are different popular choices for th

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

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