Log in

Relevant bibliographies by topics / Cluster First Route Second / Journal articles

To see the other types of publications on this topic, follow the link: Cluster First Route Second.

Journal articles on the topic 'Cluster First Route Second'

Author: Grafiati

Published: 5 June 2025

Last updated: 1 August 2025

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 'Cluster First Route Second.'

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

Gin, Gin Ginanjar, Ali-Azim Hilal, Taufik Septiadi Muhamad, Rahman Taufiq, Gusti Yangsa Yayang, and Anwar Asep. "Optimisation Route Value Comparison of Cataract Implant Lenses of PT XYZ by Saving Matrix Method and Cluster First Route Second Method to Select Hospitals in West Java and DKI Jakarta." ITALIENISCH 12, no. 2 (2022): 219–26. https://doi.org/10.5281/zenodo.6698771.

Full text

Abstract:

The purpose of this research is to obtain the most accurate and optimal route of cataract implant lenses distribution to minimise distribution costs and to find out the maximum extent of cost saving possible. The population in this research is obtained from company data in the pharmaceutical industry located at Padalarang and the sample for this research is the data for the demand of lenses from select hospitals in West Java and DKI Jakarta. Determination of the distribution route is analysed by using the Saving Matrix method and Cluster First Route Second method. Results of the Saving Matrix

APA, Harvard, Vancouver, ISO, and other styles

2

Chandra, Agung, and Bambang Setiawan. "Minimasi Jalur Distribusi di PT. XYZ dengan Metode Improved Cluster First Route Second." Jurnal METRIS 20, no. 1 (2021): 11–16. http://dx.doi.org/10.25170/metris.v20i1.2377.

Full text

Abstract:

Reducing distance in delivery service from distribution center to subsidiaries can be reached through well-managed routing which known as VRP - Vehicle Routing Problem. This study was conducted in a food industry PT. XYZ. Two methods, Cluster First Route Second algorithm and linier programming were used to obtain the minimum distance between distribution center to outlets in Jabodetabek area. The cluster first route second method was improved using linier programming – solver. The improved method shows 774.18 kilometer is better than Cluster Firs Route Second, 832.19 kolometer which is 6.97% s

APA, Harvard, Vancouver, ISO, and other styles

3

Deitch, Ray, and Shaul P. Ladany. "The Bus Touring Problem: Cluster — First, Route — Second Heuristic." Tourism Economics 6, no. 3 (2000): 263–79. http://dx.doi.org/10.5367/000000000101297631.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

5

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

6

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

7

S., Gopinath. "Cluster based Optimal Energy Efficient Routing Protocol for Wireless Sensor Networks." Revista Gestão Inovação e Tecnologias 11, no. 2 (2021): 1921–32. http://dx.doi.org/10.47059/revistageintec.v11i2.1808.

Full text

Abstract:

Balancing the energy consumption and location accuracy is one of the critical tasks in WSN. Energy consumption of sensor nodes is measured in terms of route discovery, packet forwarding and data transmission. In this research work, it is proposed that scheduling based Optimal Energy Clustering Scheme (SOECS) to attain the maximum location accuracy and energy efficiency during route maintenance. It contains three major modules. In first module, the node deployment is done using Gaussian distribution function to route the packets effectively. In second module, Cluster heads are chosen and energy

APA, Harvard, Vancouver, ISO, and other styles

8

Miranda-Bront, Juan José, Brian Curcio, Isabel Méndez-Díaz, Agustín Montero, Federico Pousa, and Paula Zabala. "A cluster-first route-second approach for the swap body vehicle routing problem." Annals of Operations Research 253, no. 2 (2016): 935–56. http://dx.doi.org/10.1007/s10479-016-2233-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Putri, Karina Aginta, Nur Layli Rachmawati, Mirna Lusiani, and Anak Agung Ngurah Perwira Redi. "Genetic Algorithm with Cluster-first Route-second to Solve the Capacitated Vehicle Routing Problem with Time Windows." Jurnal Teknik Industri 23, no. 1 (2021): 75–82. http://dx.doi.org/10.9744/jti.23.1.75-82.

Full text

Abstract:

In a distribution problem, designing the right distribution route can minimize the total transportation costs. Therefore, this research aims to design a distribution route that produces a minimal distribution distance by clustering the demand points first. We generated the clustering method to cluster the demand points by considering the proximity among the demand points and the total vehicle capacity. In solving this problem, we are using p-median to determine the cluster and a genetic algorithm to determine the distribution route with the characteristics of the CVRPTW problem. CVRPTW or capa

APA, Harvard, Vancouver, ISO, and other styles

10

Filimonov, A. B., and N. B. Filimonov. "Two-Stage Routing of Transport Using Geospatial Clustering." Mekhatronika, Avtomatizatsiya, Upravlenie 26, no. 4 (2025): 199–208. https://doi.org/10.17587/mau.26.199-208.

Full text

Abstract:

One of the urgent and key problems of the transport industry is considered. This is the problem of planning the routes of vehicles. The given problem can be described and formalized as the Traveling Salesman Problem (TSP) for many applications.This problem consists in finding of the optimal route for a traveling salesman passing through the indicated cities at least once and with returning to the source city. In general, when planning such routes, it is necessary to solve the multiple traveling salesman problem (MTSP), which allows for more than one traveling salesman and more than one depot,

APA, Harvard, Vancouver, ISO, and other styles

11

Comert, Serap Ercan, Harun Resit Yazgan, Sena Kır, and Furkan Yener. "A cluster first-route second approach for a capacitated vehicle routing problem: a case study." International Journal of Procurement Management 11, no. 4 (2018): 399. http://dx.doi.org/10.1504/ijpm.2018.092766.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Yener, Furkan, Sena Kır, Harun Resit Yazgan, and Serap Ercan Comert. "A cluster first-route second approach for a capacitated vehicle routing problem: a case study." International Journal of Procurement Management 11, no. 4 (2018): 399. http://dx.doi.org/10.1504/ijpm.2018.10012137.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Yüksel, Zeynep, Dursun Epcim, and Süleyman Mete. "First Cluster Second Route Approach with Collaboration Unmanned Aerial Vehicle in Post-Disaster Humanitarian Logistic." Journal of Transportation and Logistics 8, no. 2 (2024): 97–111. http://dx.doi.org/10.26650/jtl.2023.1372701.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Liu, Yao, Jianmai Shi, Zhong Liu, Jincai Huang, and Tianren Zhou. "Two-Layer Routing for High-Voltage Powerline Inspection by Cooperated Ground Vehicle and Drone." Energies 12, no. 7 (2019): 1385. http://dx.doi.org/10.3390/en12071385.

Full text

Abstract:

A novel high-voltage powerline inspection system was investigated, which consists of the cooperated ground vehicle and drone. The ground vehicle acts as a mobile platform that can launch and recycle the drone, while the drone can fly over the powerline for inspection within limited endurance. This inspection system enables the drone to inspect powerline networks in a very large area. Both vehicle’ route in the road network and drone’s routes along the powerline network have to be optimized for improving the inspection efficiency, which generates a new Two-Layer Point-Arc Routing Problem (2L-PA

APA, Harvard, Vancouver, ISO, and other styles

15

Yin, Ruyang, and Peixia Lu. "A Cluster-First Route-Second Constructive Heuristic Method for Emergency Logistics Scheduling in Urban Transport Networks." Sustainability 14, no. 4 (2022): 2301. http://dx.doi.org/10.3390/su14042301.

Full text

Abstract:

Advanced strategies for emergency logistics scheduling problems in urban transport networks have been a challenging topic for centuries. This study proposed a cluster-first route-second constructive heuristic method based on the continuous approximation (CA) for ‘one-to-many’ vehicle routing to dispatch commidities after an emergency. The objective of the study is to provide a replenish schedule and routing solution from the government/provider’s end in order to minimize the total motion cost, pipeline inventory cost, and holding cost with backorder for the disaster relief operation. The devel

APA, Harvard, Vancouver, ISO, and other styles

16

González Vargas, Guillermo, and Felipe González Aristizábal. "Metaheuristics applied to vehicle routing. A case study. Part 2: genetic algorithm, compared to a heuristics solution." Ingeniería e Investigación 27, no. 1 (2007): 149–57. http://dx.doi.org/10.15446/ing.investig.v27n1.14795.

Full text

Abstract:

This paper presents a solution to a vehicle-routing problem by using two different techniques. In the first instance, a genetic algorithm was applied (different experiments were done); later on the cluster first-route second methodology was used via heuristic sweep and local search, respectively. The results of the different techniques were then compared.

APA, Harvard, Vancouver, ISO, and other styles

17

HIQUEBRAN, D. T., A. S. ALFA, J. A. SHAPIRO, and D. H. GITTOES. "A REVISED SIMULATED ANNEALING AND CLUSTER-FIRST ROUTE-SECOND ALGORITHM APPLIED TO THE VEHICLE ROUTING PROBLEM." Engineering Optimization 22, no. 2 (1993): 77–107. http://dx.doi.org/10.1080/03052159308941327.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Alikulov, Khusniddin, Zarif Aminov, La Hoang Anh, Tran Dang Xuan, and Wookyung Kim. "Comparative Technical and Economic Analyses of Hydrogen-Based Steel and Power Sectors." Energies 17, no. 5 (2024): 1242. http://dx.doi.org/10.3390/en17051242.

Full text

Abstract:

Decarbonizing the current steel and power sectors through the development of the hydrogen direct-reduction iron ore–electric arc furnace route and the 100% hydrogen-fired gas turbine cycle is crucial. The current study focuses on three clusters of research works. The first cluster covers the investigation of the mass and energy balance of the route and the subsequent application of these values in experiments to optimize the reduction yield of iron ore. In the second cluster, the existing gas turbine unit was selected for the complete replacement of natural gas with hydrogen and for finding th

APA, Harvard, Vancouver, ISO, and other styles

19

Horng, Sophea, and Pisal Yenradee. "Performance Comparison of Two-phase LP-based Heuristic Methods for Capacitated Vehicle Routing Problem with Three Objectives." Engineering Journal 24, no. 5 (2020): 145–59. http://dx.doi.org/10.4186/ej.2020.24.5.145.

Full text

Abstract:

This paper develops a two-phase LP-based heuristic for the Capacitated Vehicle Routing Problem (CVRP). It considers three objectives: (1) minimizing the total costs of fuel consumption and overtime, (2) maximizing the total personal relationships between customers and drivers, and (3) balancing the delivery weights of vehicles. The two-phase LP-based heuristic (cluster-first route-second) is proposed. First, in the clustering stage, three LP-based clustering models (denoted by C1, C2, and C3) are developed. Customers are grouped into clusters based on real distances between the customers for C

APA, Harvard, Vancouver, ISO, and other styles

20

Savitri, H., and D. A. Kurniawati. "Sweep Algorithm and Mixed Integer Linear Program for Vehicle Routing Problem with Time Windows." Journal of Advanced Manufacturing Systems 17, no. 04 (2018): 505–13. http://dx.doi.org/10.1142/s0219686718500282.

Full text

Abstract:

CV. Jogja Transport is a company that distribute cakes “Sari Roti” in Yogyakarta, Indonesia. It has responsibility to distribute the cakes for every customer during the customers’ time windows. The distribution problem of CV. Jogja Transport belongs to Vehicle Routing Problem with Time Window (VRPTW). This paper tries to solve the problem of CV. Jogja Transport by proposing “cluster first route second” algorithm of simple heuristic method. Then the algorithm is combined with sweep algorithm for clustering the customers and Mixed Integer Linear Programming (MILP) to select the best route so tha

APA, Harvard, Vancouver, ISO, and other styles

21

Saputro, Thomy Eko, and Aprilia Prihatina. "PERENCANAAN JADWAL DAN RUTE DISTRIBUSI ROKOK UNTUK MENEKAN TOTAL BIAYA TRANSPORTASI." Jurnal Teknik Industri 13, no. 2 (2012): 151. http://dx.doi.org/10.22219/jtiumm.vol13.no2.151-157.

Full text

Abstract:

Thomy Eko Saputro DAN Aprilia PrihatinaJurusan Teknik Industri, Fakultas Teknik, Universitas Muhammadiyah MalangLaman: thoms.engineering@gmail.comABSTRAKSalah satu hal yang berpengaruh dalam meningkatkan pelayanan konsumen adalah bagaimana mengirimkan produkyang tepat waktu kepada seluruh konsumen. Oleh karena itu pelaku bisnis perlu menerapkan suatu strategi yang tepat agardapat mengefisienkan dan mengefektifkan proses distribusinya. PR 567 sebagai distributor rokok perwakilan Purwodadiberupaya agar pendistribusian berjalan dengan baik karena mengingat proses distribusi dengan jumlah agen yan

APA, Harvard, Vancouver, ISO, and other styles

22

Thammasang, Supitcha, and Sirawadee Arunyanart. "Efficient Route Optimization for Ice Distribution: Enhanced VRPTW with Customer Retention Strategies." Engineering, Technology & Applied Science Research 14, no. 5 (2024): 16346–56. http://dx.doi.org/10.48084/etasr.8239.

Full text

Abstract:

This study addresses the Vehicle Routing Problem with Time Windows (VRPTW) in the context of ice distribution by introducing a novel mathematical model that incorporates practical constraints essential for real-world applications. These constraints include customer retention strategies and quality preservation methods, which are important for maintaining customer satisfaction and product integrity. The objective is to minimize the total costs, including fuel expenses, standard and bonus driver wages, missed delivery penalties, and costs related to a quality preservation strategy. Given the NP-

APA, Harvard, Vancouver, ISO, and other styles

23

Pandey, Anand, Pankaj Singh, Prashant Mani, Saptarshi Gupta, and Jay Prakash Narayan Verma. "Message Ferry Route Calculation through K-means Clustering Algorithm for Partially-Connected MANET." Webology 17, no. 2 (2020): 15–30. http://dx.doi.org/10.14704/web/v17i2/web17013.

Full text

Abstract:

Partially-connected MANETs are the Wi-Fi networks where most of the time a comprehensive path between source and destination does not exist due to narrow radio transmission range of the nodes, low density of nodes, wide deployment area, physical obstacles like high rise buildings, severe weather conditions, or other physical factors. The traditional routing protocols of the Mobile Ad-hoc Network presume that the network is connected. There are two possible solutions to solve the connectivity problem in sparse MANET. The first solution makes use of random movement of nodes to transfer messages

APA, Harvard, Vancouver, ISO, and other styles

24

Ramaiah, Sridhar, and Guruprasad Nagraj. "Deep Neural Glow Worm Swarm Optimized Soft C-Means Clustering for Energy Aware Route Discovery and Data Gathering in WSN." International Journal of Intelligent Engineering and Systems 14, no. 1 (2021): 72–81. http://dx.doi.org/10.22266/ijies2021.0228.08.

Full text

Abstract:

Cluster head selection enacts a prominent role in Wireless Sensor Network to optimize the energy usage during the data collection. Few research works have been designed to choose the best cluster head in wireless network using different optimization techniques. However, cluster head selection performance of conventional algorithms was lower to extend the lifetime of network. Therefore, a Deep Neural Glowworm Swarm Optimized Soft C-Means Clustering (DNGSOSCC) model is proposed. Initially, DNGSOSCC model obtains number of sensor nodes as input at the input layer. After taking input, soft cluster

APA, Harvard, Vancouver, ISO, and other styles

25

Diabat, Ali, Claudia Archetti, and Waleed Najy. "The Fixed-Partition Policy Inventory Routing Problem." Transportation Science 55, no. 2 (2021): 353–70. http://dx.doi.org/10.1287/trsc.2020.1019.

Full text

Abstract:

In this paper, we formally introduce a variant of the inventory routing problem (IRP) that we call the fixed-partition policy IRP (FPP-IRP). In contrast to the classical IRP in which delivery routes are arbitrary, the FPP-IRP partitions customers into mutually exclusive clusters that are fixed throughout the optimization horizon, and distribution is performed separately for each cluster. By restricting the flexibility inherent in the classical IRP, the FPP-IRP attains many potential advantages. First, partitioning reduces the operational complexity of the system and allows a simpler organizati

APA, Harvard, Vancouver, ISO, and other styles

26

Sukhov, A. M., A. Y. Romanov, and E. V. Glushak. "Routing in circulant graphs based on a virtual coordinate system." Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki 165, no. 3 (2024): 282–93. http://dx.doi.org/10.26907/2541-7746.2023.3.282-293.

Full text

Abstract:

This article explores routing methods in two-dimensional circulant graphs where each vertex is linked to four neighboring ones. The unique symmetries of the circulant graph make it a viable topology for high-performance computing devices, such as networks-on-chip and cluster supercomputers. It was shown that the coordinates of the vertices can be determined as the minimum number of transitions along the generators from the initial vertex. Two virtual coordinate-based routing methods were developed. The first method entails restoring the vertex numbers and finding the difference between them, w

APA, Harvard, Vancouver, ISO, and other styles

27

Zagdyn, Z. M., O. B. Nechaeva, S. A. Sterlikov, T. P. Vasilyeva, and O. Yu Alexandrova. "HIV and HIV/TB coinfection: cluster distribution of regions in the Northwestern Federal District of Russia." HIV Infection and Immunosuppressive Disorders 14, no. 3 (2022): 77–85. http://dx.doi.org/10.22328/2077-9828-2022-14-3-77-85.

Full text

Abstract:

Introduction. One of the main factors affecting TB burden is HIV progression and, in turn, PLWH predominantly die of TB.The study purpose was to identify high risk regions of HIV, HIV/TB coinfection in NWFD of Russia between years of 2007 to 2018.Materials and methods. K-means method was applied to identify HIV, HIV/TB incidence, prevalence and mortality rates, as well as share of heterosexual HIV transmission route clusters in 10 regions of NWFD. The need data were extracted from relevant forms of federal statistical observation between 2007 to 2018. NAO was excluded from cluster analysis due

APA, Harvard, Vancouver, ISO, and other styles

28

Zeng, Zheng-yang, Wei-sheng Xu, Zhi-yu Xu, and Wei-hui Shao. "A Hybrid GRASP+VND Heuristic for the Two-Echelon Vehicle Routing Problem Arising in City Logistics." Mathematical Problems in Engineering 2014 (2014): 1–11. http://dx.doi.org/10.1155/2014/517467.

Full text

Abstract:

The two-echelon vehicle routing problem (2E-VRP) is a variant of the classical vehicle routing problem (VRP) arising in two-level transportation systems such as those encountered in the context of city logistics. In the 2E-VRP, freight from a depot is compulsorily delivered through intermediate depots, named satellites. The first echelons are routes that distribute freight from depot to satellites, and the second are those from satellites to customers. This problem is solved by a hybrid heuristic which is composed of a greedy randomized adaptive search procedure (GRASP) with a route-first clus

APA, Harvard, Vancouver, ISO, and other styles

29

Abed, Ahmed M., and Samia Elattar. "Minimize the Route Length Using Heuristic Method Aided with Simulated Annealing to Reinforce Lean Management Sustainability." Processes 8, no. 4 (2020): 495. http://dx.doi.org/10.3390/pr8040495.

Full text

Abstract:

Cost reduction is a cornerstone of the Lean administration’s sustainability through modify its algorithms scheme to become multi-useful. This paper focuses on control “movement” waste, to minimize pipeline, cabling and sewerage network deployments time, to avoid demurrages (i.e., constructor sectors) and quickens planning through two stages. The first belongs to the build constrained hybridization of published heuristic routing methods (e.g., S-Shape, Mid-point, Largest-Gap, Return, Ascending, FLA-5, FLA-6 [Flow Line Analysis], and Composite) to select the shortest path that serves many locati

APA, Harvard, Vancouver, ISO, and other styles

30

Villalba, Andrés Felipe León, and Elsa Cristina González La Rotta. "Clustering and heuristics algorithm for the vehicle routing problem with time windows." International Journal of Industrial Engineering Computations 13, no. 2 (2022): 165–84. http://dx.doi.org/10.5267/j.ijiec.2021.12.002.

Full text

Abstract:

This article presents a novel algorithm based on the cluster first-route second method, which executes a solution through K-means and Optics clustering techniques and Nearest Neighbor and Local Search 2-opt heuristics, for the solution of a vehicle routing problem with time windows (VRPTW). The objective of the problem focuses on reducing distances, supported by the variables of demand, delivery points, capacities, time windows and type of fleet in synergy with the model's taxonomy, based on data referring to deliveries made by a logistics operator in Colombia. As a result, good solutions are

APA, Harvard, Vancouver, ISO, and other styles

31

Flores Fernández, Alberto, Jonas Wurst, Eduardo Sánchez Morales, Michael Botsch, Christian Facchi, and Andrés García Higuera. "Probabilistic Traffic Motion Labeling for Multi-Modal Vehicle Route Prediction." Sensors 22, no. 12 (2022): 4498. http://dx.doi.org/10.3390/s22124498.

Full text

Abstract:

The prediction of the motion of traffic participants is a crucial aspect for the research and development of Automated Driving Systems (ADSs). Recent approaches are based on multi-modal motion prediction, which requires the assignment of a probability score to each of the multiple predicted motion hypotheses. However, there is a lack of ground truth for this probability score in the existing datasets. This implies that current Machine Learning (ML) models evaluate the multiple predictions by comparing them with the single real trajectory labeled in the dataset. In this work, a novel data-based

APA, Harvard, Vancouver, ISO, and other styles

32

P. Rathinabhagya and J. Merline Vinotha. "Fuzzy vehicle routing problem for a municipal solid waste management system with greenhouse gas emission at various disposal stages." Scientific Temper 16, no. 04 (2025): 4077–84. https://doi.org/10.58414/scientifictemper.2025.16.4.09.

Full text

Abstract:

In developing countries, municipal solid waste management and their authorities face hurdles during the collection, transport, trash segregation process, and disposal of solid waste that will have an environmental impact and affect human health and the economy. This study investigates an existing case study of the waste management system, and the existing case study mainly focuses on determining the routes and clusters within each ward for weekdays and weekends by utilizing the Clarke and Wright algorithm. The availability of daily waste is increasing due to the real-life consequences of dry l

APA, Harvard, Vancouver, ISO, and other styles

33

Ohmori, Shunichi, and Kazuho Yoshimoto. "Multi-product multi-vehicle inventory routing problem with vehicle compatibility and site dependency: A case study in the restaurant chain industry." Uncertain Supply Chain Management 9, no. 2 (2021): 351–62. http://dx.doi.org/10.5267/j.uscm.2021.2.007.

Full text

Abstract:

We study an inventory routing problem (IRP) for the restaurant chain. We proposed a model a multi-product multi-vehicle IRP (MMIRP) with multi-compatibility and site-dependency (MMIRP-MCSD). The problem was formulated as a mixed integer programming (MIP). This model is difficult to solve because it is a problem that integrates MMIRP, a multi-compartment vehicle routing problem (MCVRP), and a site dependent VRP (SDVRP), each of which is difficult even by itself. Therefore, in this study, we proposed three-stage Math Heuristics based on the cluster-first and route-second method. In the numerical

APA, Harvard, Vancouver, ISO, and other styles

34

Zhao, Yan Wei, B. Wu, W. L. Wang, Ying Li Ma, W. A. Wang, and H. Sun. "Particle Swarm Optimization for Vehicle Routing Problem with Time Windows." Materials Science Forum 471-472 (December 2004): 801–5. http://dx.doi.org/10.4028/www.scientific.net/msf.471-472.801.

Full text

Abstract:

The investigation of the performance of the Particle Swarm Optimization (PSO) method for Vehicle Routing Problem with Time Windows is the main theme of the paper. “Exchange minus operator” is constructed to compute particle’s velocity. We use Saving algorithm, Nearest Neighbor algorithm, and Solomon insertion heuristics for parameter initialization and apply the “Routing first and Cluster second” strategy for solution generation. By PSO, customers are sorted in an ordered sequence for vehicle assignment and Nearest Neighbor algorithm is used to optimize every vehicle route. In our experiments,

APA, Harvard, Vancouver, ISO, and other styles

35

Ivokhin, Eugene, and Kostyantyn Yushtin. "Two-Stage Method for Solving the Traveling Salesman Problem Using the Genetic Algorithm." Mathematical and computer modelling. Series: Physical and mathematical sciences 25 (September 30, 2024): 82–95. http://dx.doi.org/10.32626/2308-5878.2024-25.82-95.

Full text

Abstract:

One of the main tasks in logistics is to find the most efficient route in the traveling salesman problem on a given transportation network, allowing for the servicing of the maximum number of customers while considering certain criteria. In the typical traveling salesman problem, the objective function is most often the route length or duration. However, such a formulation does not account for the subjectivity in evaluating the travel durations at different stages, which may be influenced by various objective and subjective factors. The problem of the traveling salesman with fuzzily defined tr

APA, Harvard, Vancouver, ISO, and other styles

36

Ilabaca, Antonia, Germán Paredes-Belmar, and Pamela P. Alvarez. "Optimization of Humanitarian Aid Distribution in Case of an Earthquake and Tsunami in the City of Iquique, Chile." Sustainability 14, no. 2 (2022): 819. http://dx.doi.org/10.3390/su14020819.

Full text

Abstract:

In this paper, we introduce, model, and solve a clustered resource allocation and routing problem for humanitarian aid distribution in the event of an earthquake and subsequent tsunami. First, for the preparedness stage, we build a set of clusters to identify, classify, sort, focus, and prioritize the aid distribution. The clusters are built with k-means method and a modified version of the capacitated p-median model. Each cluster has a set of beneficiaries and candidate delivery aid points. Second, vehicle routes are strategically determined to visit the clusters for the response stage. A mix

APA, Harvard, Vancouver, ISO, and other styles

37

Espinosa, Jorge R., Pablo Sampedro, Chantal Valeriani, Carlos Vega, and Eduardo Sanz. "Lattice mold technique for the calculation of crystal nucleation rates." Faraday Discussions 195 (2016): 569–82. http://dx.doi.org/10.1039/c6fd00141f.

Full text

Abstract:

We present a new simulation method for the calculation of crystal nucleation rates by computer simulation. The method is based on the use of molds to induce crystallization in state points where nucleation is a rare event. The mold is a cluster of potential energy wells placed in the lattice positions of the solid. The method has two distinct steps. In the first one the probability per unit volume of forming a sub-critical crystal cluster in the fluid is computed by means of thermodynamic integration. The thermodynamic route consists in gradually switching on an attractive interaction between

APA, Harvard, Vancouver, ISO, and other styles

38

Wójcik-Fatla, Angelina, Joanna Krzowska-Firych, Krzysztof Czajka, Joanna Nozdryn-Płotnicka, and Jacek Sroka. "The Consumption of Raw Goat Milk Resulted in TBE in Patients in Poland, 2022 “Case Report”." Pathogens 12, no. 5 (2023): 653. http://dx.doi.org/10.3390/pathogens12050653.

Full text

Abstract:

The alimentary route is the second most important route of tick-borne encephalitis infection. In Poland, the last TBE case due to the consumption of unpasteurized milk or dairy products of infected animals was recorded in 2017 as the fourth documented outbreak of TBEV infection in the country. In this study, two patients infected with TBEV through consumption of unpasteurized goat’s milk from one source are described from a cluster of eight cases. In August and September 2022, a 63- and 67-year-old woman were hospitalized at the Infectious Diseases Clinic of the Institute of Rural Health (Lubl

APA, Harvard, Vancouver, ISO, and other styles

39

Lombó, Felipe, Alfredo F. Braña, Carmen Méndez, and José A. Salas. "The Mithramycin Gene Cluster of Streptomyces argillaceus Contains a Positive Regulatory Gene and Two Repeated DNA Sequences That Are Located at Both Ends of the Cluster." Journal of Bacteriology 181, no. 2 (1999): 642–47. http://dx.doi.org/10.1128/jb.181.2.642-647.1999.

Full text

Abstract:

ABSTRACT Sequencing of a 4.3-kb DNA region from the chromosome ofStreptomyces argillaceus, a mithramycin producer, revealed the presence of two open reading frames (ORFs). The first one (orfA) codes for a protein that resembles several transport proteins. The second one (mtmR) codes for a protein similar to positive regulators involved in antibiotic biosynthesis (DnrI, SnoA, ActII-orf4, CcaR, and RedD) belonging to the Streptomycesantibiotic regulatory protein (SARP) family. Both ORFs are separated by a 1.9-kb, apparently noncoding region. Replacement of themtmR region by an antibiotic resista

APA, Harvard, Vancouver, ISO, and other styles

40

Srinivas, T. Aditya Sai, and S. S. Manivannan. "Black Hole and Selective Forwarding Attack Detection and Prevention in IoT in Health Care Sector: Hybrid meta-heuristic-based shortest path routing." Journal of Ambient Intelligence and Smart Environments 13, no. 2 (2021): 133–56. http://dx.doi.org/10.3233/ais-210591.

Full text

Abstract:

In the current health care scenario, security is the major concern in IoT-WSN with more devices or nodes. Attack or anomaly detection in the IoT infrastructure is increasing distress in the field of medical IoT. With the enormous usage of IoT infrastructure in every province, threats and attacks in these infrastructures are also mounting commensurately. This paper intends to develop a security mechanism to detect and prevent the black hole and selective forwarding attack from medical IoT-WSN. The proposed secure strategy is developed in five stages: First is selecting the cluster heads, second

APA, Harvard, Vancouver, ISO, and other styles

41

Zou, Qian, Wen Xiong, Xiaoxuan Wang, and Fukun Qin. "Research on Real-Time Anomaly Detection Method of Bus Trajectory Based on Flink." Electronics 12, no. 18 (2023): 3897. http://dx.doi.org/10.3390/electronics12183897.

Full text

Abstract:

Bus transportation system has become the primary mode of traffic for urban residents. Every day, thousands of buses provide services for millions of passengers. Efficiently monitoring bus trajectories is essential for evaluating service quality and ensuring public safety. In this study, we propose a Flink-based solution to detect anomalies for bus trajectories in real time. Specifically, it can identify two types of anomalies. The first type is when a bus deviates from its designated route during a trip. The second type is when a bus arrives at a scheduled stop along its route but fails to sto

APA, Harvard, Vancouver, ISO, and other styles

42

Dr. D. Maruthanayagam. "An Efficient and Most Reliable Novel Route Selection Algorithm (ERRSAE) to Improve QOS in Manet Environment." International Journal of Scientific Research in Computer Science, Engineering and Information Technology 11, no. 1 (2025): 2652–66. https://doi.org/10.32628/cseit251112281.

Full text

Abstract:

Mobile ad-hoc network (MANET) has got more focus because of its pragmatic applications and inevitability of communication in mobile devices. MANETs are collection of mobile hosts dynamically forming a temporary network without the aid of any existing infrastructure or centralized control. Quality of Service (QoS) support for MANET is a challenging task due to the dynamic topology and limited resources. The existing QoS based routing solutions for MANET involves with single metric or two metrics. It is important that MANETs should provide QoS support routing such as end-to-end-delay, energy con

APA, Harvard, Vancouver, ISO, and other styles

43

Alnaser, As’ad Mahmoud As’ad, Said S. Saloum, Ahmed A. M. Sharadqh, and Hazem (Moh’d Said) Hatamleh. "Optimizing Multi-Tier Scheduling and Secure Routing in Edge-Assisted Software-Defined Wireless Sensor Network Environment Using Moving Target Defense and AI Techniques." Future Internet 16, no. 11 (2024): 386. http://dx.doi.org/10.3390/fi16110386.

Full text

Abstract:

Software Defined Wireless Sensor Networks (SDWSN) enable flexibility in Wireless Sensor Network (WSN) environments by defining the controllable functions to WSN nodes by the Software Defined Network (SDN) controller. Due to the rapid evolution of SDWSNs, adverse effects also have occurred in terms of interference, energy consumption, and security issues. Several state-of-the-art works lend their utmost best to the SDWSN environment. However, the complete picture (i.e., relatability and security in SDWSN) poses severe challenges. The state-of-the-art issues is addressed in this research by prop

APA, Harvard, Vancouver, ISO, and other styles

44

Purwaningrum, Alfi, Amalia Nur Alifah, Dwi Bagus Dermawan, and Galuh Andini. "Unlocking Pharma Market Segmentation for Strategic Growth Through Advanced Data Intelligence." Engineering, MAthematics and Computer Science Journal (EMACS) 7, no. 1 (2025): 25–34. https://doi.org/10.21512/emacsjournal.v7i1.12199.

Full text

Abstract:

Business competition compels companies to understand customer characteristics in order to maintain and enhance their competitiveness, especially in the pharmaceutical industry, which involves various customer segments such as hospitals, pharmacies, patients, and end consumers with diverse needs. Customer segmentation becomes crucial in developing effective strategies, with K-Means algorithm being one of the commonly used methods due to its simplicity and efficiency in clustering large datasets. This study combines the K-Means Clustering algorithm with the elbow method to determine the optimal

APA, Harvard, Vancouver, ISO, and other styles

45

Kusuma, Purba Daru, and Meta Kallista. "Pickup and delivery problem in the collaborative city courier service by using genetic algorithm and nearest distance." Bulletin of Electrical Engineering and Informatics 11, no. 2 (2022): 1026–36. http://dx.doi.org/10.11591/eei.v11i2.3223.

Full text

Abstract:

One problem in collaborative pickup delivery problem (PDP) was excessive outsourced jobs. It happened in many studies on the collaborative PDP. Besides, the revenue sharing in it was unclear although important. This work aimed to propose a novel collaborative PDP model which minimizes total travel distance while maintains low outsourced jobs. It proposed several contributions. First, it prioritized internal jobs first rather than full collaborative model. Second, it proposed new revenue sharing model. It adopted cluster-first route-second and mixed pickup and delivery. It was developed by comb

APA, Harvard, Vancouver, ISO, and other styles

46

Purba, Daru Kusuma, and Kallista Meta. "Pickup and delivery problem in the collaborative city courier service by using genetic algorithm and nearest distance." Bulletin of Electrical Engineering and Informatics 11, no. 2 (2022): 1026~1036. https://doi.org/10.11591/eei.v11i2.3223.

Full text

Abstract:

One problem in collaborative pickup delivery problem (PDP) was excessive outsourced jobs. It happened in many studies on the collaborative PDP. Besides, the revenue sharing in it was unclear although important. This work aimed to propose a novel collaborative PDP model which minimizes total travel distance while maintains low outsourced jobs. It proposed several contributions. First, it prioritized internal jobs first rather than full collaborative model. Second, it proposed new revenue sharing model. It adopted cluster-first route-second and mixed pickup and delivery. It was developed by comb

APA, Harvard, Vancouver, ISO, and other styles

47

ul Hassan, Mahmood, Amin A. Al-Awady, Abid Ali, et al. "ANN-Based Intelligent Secure Routing Protocol in Vehicular Ad Hoc Networks (VANETs) Using Enhanced AODV." Sensors 24, no. 3 (2024): 818. http://dx.doi.org/10.3390/s24030818.

Full text

Abstract:

A vehicular ad hoc network (VANET) is a sophisticated wireless communication infrastructure incorporating centralized and decentralized control mechanisms, orchestrating seamless data exchange among vehicles. This intricate communication system relies on the advanced capabilities of 5G connectivity, employing specialized topological arrangements to enhance data packet transmission. These vehicles communicate amongst themselves and establish connections with roadside units (RSUs). In the dynamic landscape of vehicular communication, disruptions, especially in scenarios involving high-speed vehi

APA, Harvard, Vancouver, ISO, and other styles

48

Nainggolan, Jhon Rindu, L. Denny Siahaan, and Adenan Suhalis. "Analysis of Development and Arrangement of Rapid Transit Bus in Public Transport Planning in Gorontalo City." Dinasti International Journal of Digital Business Management 6, no. 1 (2024): 27–35. https://doi.org/10.38035/dijdbm.v6i1.3807.

Full text

Abstract:

System transportation in particular field transport common in the city of gorontalo, is not optimal, thing This can be seen from the characteristics of people who prefer to use bentor (motor tricycles) in carrying out their daily activities compared to using public transportation. For example, the Trans Hulonthalangi BRT (Bus Rapid Transit) has not been used optimally, as well as other public transportation, because object to be researched or data source very large with cover Cluster Sampling (Sampling Area) . Sampling technique area, often used two Step that is first determine the sample area

APA, Harvard, Vancouver, ISO, and other styles

49

Lee, Meng-Tse, Bo-Yu Chen, and Ying-Chih Lai. "A Hybrid Tabu Search and 2-opt Path Programming for Mission Route Planning of Multiple Robots under Range Limitations." Electronics 9, no. 3 (2020): 534. http://dx.doi.org/10.3390/electronics9030534.

Full text

Abstract:

The application of an unmanned vehicle system allows for accelerating the performance of various tasks. Due to limited capacities, such as battery power, it is almost impossible for a single unmanned vehicle to complete a large-scale mission area. An unmanned vehicle swarm has the potential to distribute tasks and coordinate the operations of many robots/drones with very little operator intervention. Therefore, multiple unmanned vehicles are required to execute a set of well-planned mission routes, in order to minimize time and energy consumption. A two-phase heuristic algorithm was used to pu

APA, Harvard, Vancouver, ISO, and other styles

50

Kędzierski, Adam, Dorota Malarczyk, and Dariusz Wyczółkowski. "Recent Finds of Islamic Coins from the Old Town and Zawodzie Districts in Kalisz." Notae Numismaticae - TOM XV, no. 15 (May 17, 2021): 211–34. http://dx.doi.org/10.52800/ajst.1.a.12.

Full text

Abstract:

A settlement cluster around Kalisz first emerged in the Roman Period on a route leading from the south towards the Baltic coast. In the Early Middle Ages, a settlement centre connected with the Kalisz-Zawodzie stronghold developed at the crossroads of trade routes linking Wielkopolska with Silesia, Mazowsze, and Małopolska, with the earliest traces of early medieval occupation dating back to the 8th century. In the 10th century, oriental silver in the form of silver dirhams started to flow into the discussed region. These coins were part of deposits discovered in the sites of Kalisz-Szałe and

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!