scholarly journals Modified ALNS Algorithm for a Processing Application of Family Tourist Route Planning: A Case Study of Buriram in Thailand

Computation ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 23
Author(s):  
Narisara Khamsing ◽  
Kantimarn Chindaprasert ◽  
Rapeepan Pitakaso ◽  
Worapot Sirirak ◽  
Chalermchat Theeraviriya
Keyword(s):  
Processing Time ◽  
Time Windows ◽  
Route Planning ◽  
Exact Method ◽  
Neighborhood Search ◽  
Large Problem ◽  
Processing Application ◽  
Tourist Attractions ◽  
Time Required

This research presents a solution to the family tourism route problem by considering daily time windows. To find the best solution for travel routing, the modified adaptive large neighborhood search (MALNS) method, using the four destructions and the four reconstructions approach, is applied here. The solution finding performance of the MALNS method is compared with an exact method running on the Lingo program. As shown by various solutions, the MALNS method can balance travel routing designs, including when many tourist attractions are present in each path. Furthermore, the results of the MALNS method are not significantly different from the results of the exact method for small problem sizes. For medium and large problem sizes, the MALNS method shows a higher performance and a smaller processing time for finding solutions. The values for the average total travel cost and average travel satisfaction rating derived by the MALNS method are approximately 0.18% for a medium problem and 0.05% for a large problem, 0.24% for a medium problem, and 0.21% for a large problem, respectively. The values derived from the exact method are slightly different. Moreover, the MALNS method calculation requires less processing time than the exact method, amounting to approximately 99.95% of the time required for the exact method. In this case study, the MALNS algorithm result shows a suitable balance of satisfaction and number of tourism places in relation to the differences between family members of different ages and genders in terms of satisfaction in tour route planning. The proposed solution methodology presents an effective high-quality solution, suggesting that the MALNS method has the potential to be a great competitive algorithm. According to the empirical results shown here, the MALNS method would be useful for creating route plans for tourism organizations that support travel route selection for family tours in Thailand.

scholarly journals Location Decision Making and Transportation Route Planning Considering Fuel Consumption

2019 ◽  
Vol 5 (2) ◽  
pp. 27 ◽  
Author(s):  
Chalermchat Theeraviriya ◽  
Rapeepan Pitakaso ◽  
Kittima Sillapasa ◽  
Sasitorn Kaewman
Keyword(s):  
Fuel Consumption ◽  
Palm Oil ◽  
Processing Time ◽  
Computational Study ◽  
Exact Method ◽  
Neighborhood Search ◽  
Fixed Cost ◽  
Location Routing ◽  
Consumption Cost

This study presents the Location Routing Problem (LRP) for which we have created a model for the integration of locating facilities and vehicle routing decisions to solve the problem. The case study is the Palm Oil Collection Center, which is also important for the supply chain system. A mathematical model was made to minimize the total cost of a facility-opening cost, fixed cost of vehicle uses and fuel consumption cost. The fuel consumption cost relies on the distance and road conditions, in case of poor physical condition of a road, and its width, which can be affected the speed of the vehicle as well as the used fuel. Thus, we propose an Adaptive Large Neighborhood Search (ALNS) based on heuristic for solving the LRP. The ALNS method was tested with three datasets of samples divided into small, medium and large problems. Then, the results were compared with the results from the exact method by the Lingo program. The computational study indicated that the ALNS algorithm was competitive to the results of the Lingo for all instance sizes. Moreover, the ALNS was more effective than the exact method; approximately 99% in terms of processing time. We extended this approach to solve the case study, which was considered to be the largest problem, and the ALNS algorithm was efficient with acceptable solutions and short processing time. Therefore, the proposed method provided an effective solution to manage location routing decision of the palm oil collection center.

scholarly journals Marketplace Location Decision Making and Tourism Route Planning

2018 ◽  
Vol 8 (4) ◽  
pp. 72 ◽  
Author(s):  
Worapot Sirirak ◽  
Rapeepan Pitakaso
Keyword(s):  
Route Planning ◽  
Exact Method ◽  
Neighborhood Search ◽  
Agricultural Product ◽  
Market Place ◽  
Processing Times ◽  
Route Design ◽  
Market Location ◽  
Tourism Attractions

This research addresses the problem of planning tourism routes and finding appropriate shopping (market place) locations for agricultural product transportation. Generally, tourists visit popular tourism attractions; and generally, unpopular tourism attractions do not stimulate the economy, trade, or local income. Popular tourism attractions that are located far away from each other require the transportation of local products, and tourists must make decisions as to which locations to visit when planning their vacation. Planning a tourism route while balancing tourism attractions and shopping markets is important for the economic stimulation of tourism. This work presents a problem-solving method for tourism route-planning for a particular case study in Chiang Rai province, Thailand, using the Adaptive Large Neighborhood Search (ALNS) method. Six main destruction and five repair cycles in the ALNS method were applied to solve the tourism route design problem and to find the best solution so that tourists can visit all of the main attractions. We found that 13 tourism routes provide the shortest travel distance for each travel route. The total distance traveled was 2538.02 km for all routes. To balance the tourism on all routes, the popular and less popular tourism attractions were combined. For all routes, the shopping market location is the best place for tourism products to be sold and where tourist relaxation occurs. The results from ALNS were compared with the results from those obtained by the exact Lingo program V11. The ALNS algorithm results were not significantly different from the Lingo results. For the computational results for all examined cases, the ALNS algorithm was shown to be competitive, with short processing times given the sizes of the problems. For the traveling distance, the ALNS result significantly differs from the exact method by approximately 1.12%, and had a better effect than the exact method by approximately 99% in terms of processing time. Therefore, the proposed methodology provides an effective and high-quality solution for tourism route planning.

scholarly journals Pengembangan Algoritma Hybrid Restart Simulated Annealing with Variable Neighborhood Search (HRSA-VNS) untuk penyelesaian kasus Vehicle Routing Problem with Time Windows (VRPTW)

2017 ◽  
Vol 6 (1) ◽  
pp. 49
Author(s):  
Titi Iswari
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Variable Neighborhood Search ◽  
Simulated Annealing Algorithm ◽  
Time Windows ◽  
Heuristic Method ◽  
Neighborhood Search ◽  
Routing Problem ◽  
Time Required

<p><em>Determining the vehicle routing is one of the important components in existing logistics systems. It is because the vehicle route problem has some effect on transportation costs and time required in the logistics system. In determining the vehicle routes, there are some restrictions faced, such as the maximum capacity of the vehicle and a time limit in which depot or customer has a limited or spesific opening hours (time windows). This problem referred to Vehicle Routing Problem with Time Windows (VRPTW). To solve the VRPTW, this study developed a meta-heuristic method called Hybrid Restart Simulated Annealing with Variable Neighborhood Search (HRSA-VNS). HRSA-VNS algorithm is a modification of Simulated Annealing algorithm by adding a restart strategy and using the VNS algorithm scheme in the stage of finding neighborhood solutions (neighborhood search phase). Testing the performance of HRSA-VNS algorithm is done by comparing the results of the algorithm to the Best Known Solution (BKS) and the usual SA algorithm without modification. From the results obtained, it is known that the algorithm perform well enough in resolving the VRPTW case with the average differences are -2.0% with BKS from Solomon website, 1.83% with BKS from Alvarenga, and -2.2% with usual SA algorithm without any modifications.</em></p><p><em>Keywords : vehicle routing problem, time windows, simulated annealing, VNS, restart</em></p>

scholarly journals Solving practical waste collection with time windows in an urban area

2020 ◽  
Vol 9 (1) ◽  
pp. 1 ◽  
Author(s):  
Abdulwahab Almutairi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Neighborhood Search ◽  
Large Neighborhood Search ◽  
Optimal Solutions ◽  
Waste Collection ◽  
Routing Problem ◽  
Iterated Greedy

In logistics, several algorithms can be implemented in order to solve the problems of the vehicle routing with variants in order to find near-optimal solutions. Waste Collection can be considered as an essential logistic activity within any area or city. This kind of paper is aimed to implement Iterated greedy (IG) and Adaptive Large Neighborhood Search (ALNS) to solve waste collection vehicle routing problem with time windows on a real-case study. The idea is to generate an efficient way to collect waste problems in an area located in Riyadh, Saudi Arabia. Moreover, generating a route plays a significant role in terms of serving all customers’ demands who have own different time windows of receiving goods. Also, the performance of the proposed algorithms according to all instances is examined and minimizing the total costs and meeting all constraints that related to capacity, time windows, and others. To evaluate the execution of the presented algorithms, the computational results showed essential improvements, and also ALNS algorithm generates reasonable solutions in terms of total costs and a reasonable amount of time, when compared to other algorithms.  

Perancangan dan Pembuatan Alat Bantu Meja Putar untuk Mesin Cnc 4 Axis

2016 ◽  
Vol 10 (2) ◽  
pp. 162-171
Author(s):  
Hafid Hafid ◽  
Tatang Sutisna
Keyword(s):  
Processing Time ◽  
Rotary Table ◽  
Engineering Process ◽  
Cnc Machine ◽  
Economical Analysis ◽  
Machining Center ◽  
Design And Manufacturing ◽  
The Cost ◽  
Productivity And Competitiveness

The design and manufacturing of the rotary table with the specification Ø 170 mm (6 inches) for CNC machine 4 axis has been done. The objective of manufacturing a rotary table is to increase the efficiency of CNC machine Hardford 4 axis to be above 80% in line machining center CV. IM’s workshop. The engineering methods was taken, consist of: working preparation, manufacturing of working drawing, engineering process, the manufacturing and testing. The prototype has been tested and operated, the resulting of increasing productivity of which were as follows: the process of assembling was increased to be 3 time ( before 1 time) and processing time for a specific case reduced from 5 hours to 3 hours, number of operators for the case of assembling the rotary reduced to 1 person (before 4 persons), safety and security become to be better. The results show increased efficiency of CNC machine Hardford, from under 50% to be above 80%. Based on the economical analysis obtained by the cost of good sold (C.G.S) of the rotary table is IDR 34.060.000. The results presented in this paper is expected to be case study for developing a business of the metal and engineering SMEs domestic to the effort of improving efficiency, quality, productivity and competitiveness in global market.ABSTRAKPerancangan dan pembuatan alat bantu meja putar (rotary table) dengan spesifikasi teknis Ø 170 mm (6 inci) untuk mesin CNC 4 axis telah dilakukan. Tujuan pembuatan rotary table adalah untuk meningkatkan efisiensi mesin CNC Hardford 4 axis di atas 80% pada line machining center Bengkel CV. IM. Metode rancang bangun yang dilakukan, meliputi: persiapan kerja, pembuatan gambar kerja, proses engineering, pembuatan dan uji coba. Prototip tersebut telah diuji coba dan dioperasikan dengan hasil peningkatan produktivitas sebagai berikut: proses pengerjaan bongkar pasang meningkat menjadi 3 kali (sebelumnya 1 kali) dan waktu pengerjaan untuk kasus tertentu berkurang dari 5 jam menjadi 3 jam, jumlah operator untuk kasus bongkar pasang rotary berkurang menjadi 1 orang (sebelumnya 4 orang), keselamatan kerja dan keamanan menjadi lebih baik. Hasil peningkatan berupa efisiensi mesin CNC Hardford 4 axis dari sebelumnya di bawah 50% menjadi di atas 80%. Berdasarkan hasil perhitungan analisis ekonomi diperoleh harga pokok produksi (HPP) alat bantu meja putar adalah sebesar Rp. 34.060.000. Bahasan ini diharapkan menjadi contoh kasus bagi pengembangan usaha IKM logam dan mesin dalam negeri untuk meningkatkan efisiensi, mutu, produktivitas dan keunggulan daya saing di pasar global.Kata kunci: alat bantu meja putar, mesin CNC, harga pokok produksi

Tourism Route Planning Route Based on Tourist Category using Orientee ring Problem with Time Windows

2019 ◽  
Vol 1 (1) ◽  
pp. 42-49
Author(s):  
Indri Hapsari ◽  
◽  
Hazrul Is wadi ◽  
Yosvaldo Ongko Cahyadi ◽  
◽  
...  
Keyword(s):  
Time Windows ◽  
Route Planning ◽  
Ring Problem

Recent advances on urban taxi sharing systems with the path arrival probability

2020 ◽  
Vol 13 ◽  
Author(s):  
Dui Hongyan ◽  
Zhang Chi
Keyword(s):  
Failure Probability ◽  
Traffic Congestion ◽  
Optimal Strategy ◽  
Time Windows ◽  
Optimal Path ◽  
Route Planning ◽  
Driving Time ◽  
Load Rate ◽  
Travel Efficiency ◽  
Arrival Probability

Background : Taxi sharing is an emerging transportation arrangement that helps improve the passengers’ travel efficiency and reduce costs. This study proposes an urban taxi sharing system. Methods: Considering each side congestion of the transport network, their corresponding reliability and failure probability are analyzed. Under the constraints of the number of passengers and their own time windows, the analysis is performed on passengers whose optimal path is inclusive. Results: According to the optimal strategy, the different passengers can be arranged into the same taxi to realize the taxi sharing. Then the shared taxi route can be optimized. Conclusion: Due to the reasonable vehicle route planning and passenger combination, these can effectively alleviate the traffic congestion, save the driving time, reduce the taxi no-load rate, and save the driving distance. At last, a numerical example is used to demonstrate the proposed method.

scholarly journals Evaluating Life Cycle of Buildings Using an Integrated Approach Based on Quantitative-Qualitative and Simplified Best-Worst Methods (QQM-SBWM)

2021 ◽  
Vol 13 (8) ◽  
pp. 4487
Author(s):  
Maghsoud Amiri ◽  
Mohammad Hashemi-Tabatabaei ◽  
Mohammad Ghahremanloo ◽  
Mehdi Keshavarz-Ghorabaee ◽  
Edmundas Kazimieras Zavadskas ◽  
...  
Keyword(s):  
Life Cycle ◽  
Computer Software ◽  
Integrated Approach ◽  
Comfort Level ◽  
Combination Method ◽  
New Combination ◽  
Numerical Examples ◽  
Environmental Consequences ◽  
Time Required

Evaluating the life cycle of buildings is a valuable tool for assessing sustainability and analyzing environmental consequences throughout the construction operations of buildings. In this study, in order to determine the importance of building life cycle evaluation indicators, a new combination method was used based on a quantitative-qualitative method (QQM) and a simplified best-worst method (SBWM). The SBWM method was used because it simplifies BWM calculations and does not require solving complex mathematical models. Reducing the time required to perform calculations and eliminating the need for complicated computer software are among the advantages of the proposed method. The QQM method has also been used due to its ability to evaluate quantitative and qualitative criteria simultaneously. The feasibility and applicability of the SBWM were examined using three numerical examples and a case study, and the results were evaluated. The results of the case study showed that the criteria of the estimated cost, comfort level, and basic floor area were, in order, the most important criteria among the others. The results of the numerical examples and the case study showed that the proposed method had a lower total deviation (TD) compared to the basic BWM. Sensitivity analysis results also confirmed that the proposed approach has a high degree of robustness for ranking and weighting criteria.

Sign in / Sign up

Export Citation Format

Share Document