Search results for: traveling%20salesman%20problem

Authors: Ana Rita Conde, Pilar Mota, Tânia Botelho, Carlos Rodrigues, Osvaldo Silva, Áurea Sousa, Suzana Caldeira, Isabel Rego, Jéssica Pacheco

Abstract:

Families with children with ASD are interested in traveling but end up not traveling due to the obstacles they face and not finding inclusive traveling offers. This study will identify the needs of families with children with ASD, to develop the products targeted to their tourist needs. 137 families from different countries answered a questionnaire about their travel experiences, needs and preferences. Based on the results, guidelines are presented for the development of products specially aimed for this market niche.

Keywords: inclusive tourism, sustainability, autism spectrum disorder, children, families

Procedia PDF Downloads 99

Authors: Boris Melnikov, Dmitrii Chaikovskii, Elena Melnikova

Abstract:

The traveling salesman problem (TSP) is a well-known optimization problem that seeks to find the shortest possible route that visits a set of points and returns to the starting point. In this paper, we apply some heuristics of the TSP for the task of restoring the DNA matrix. This restoration problem is often considered in biocybernetics. For it, we must recover the matrix of distances between DNA sequences if not all the elements of the matrix under consideration are known at the input. We consider the possibility of using this method in the testing of distance calculation algorithms between a pair of DNAs to restore the partially filled matrix.

Keywords: optimization problems, DNA matrix, partially filled matrix, traveling salesman problem, heuristic algorithms

Procedia PDF Downloads 122

Authors: Daniel Kostrzewa, Henryk Josiński

Abstract:

The expanded Invasive Weed Optimization algorithm (exIWO) is an optimization metaheuristic modelled on the original IWO version created by the researchers from the University of Tehran. The authors of the present paper have extended the exIWO algorithm introducing a set of both deterministic and non-deterministic strategies of individuals’ selection. The goal of the project was to evaluate the exIWO by testing its usefulness for solving some test instances of the traveling salesman problem (TSP) taken from the TSPLIB collection which allows comparing the experimental results with optimal values.

Keywords: expanded invasive weed optimization algorithm (exIWO), traveling salesman problem (TSP), heuristic approach, inversion operator

Procedia PDF Downloads 807

Authors: Meng-Hui Chen, Chiao-Wei Yu, Pei-Chann Chang

Abstract:

Imperial competitive algorithm (ICA) simulates a multi-agent algorithm. Each agent is like a kingdom has its country, and the strongest country in each agent is called imperialist, others are colony. Countries are competitive with imperialist which in the same kingdom by evolving. So this country will move in the search space to find better solutions with higher fitness to be a new imperialist. The main idea in this paper is using the peculiarity of ICA to explore the search space to solve the kinds of combinational problems. Otherwise, we also study to use the greed search to increase the local search ability. To verify the proposed algorithm in this paper, the experimental results of traveling salesman problem (TSP) is according to the traveling salesman problem library (TSPLIB). The results show that the proposed algorithm has higher performance than the other known methods.

Keywords: traveling salesman problem, artificial chromosomes, greedy search, imperial competitive algorithm

Procedia PDF Downloads 427

Authors: Siddharth Rana

Abstract:

As we know so far, there are 3 dimensions that we are capable of interpreting and perceiving, and there is a 4th dimension, called time, about which we don’t know much yet. We, as humans, live in the 4th dimension, not the 3rd. We travel 3 dimensionally but cannot yet travel 4 dimensionally; perhaps if we could, then visiting the past and the future would be like climbing a mountain or going down a road. So far, we humans are not even capable of imagining any higher dimensions than the three dimensions in which we can travel. We are the beings of the 4th dimension; we are the beings of time; that is why we can travel 3 dimensionally; however, if, say, there were beings of the 5th dimension, then they would easily be able to travel 4 dimensionally, i.e., they could travel in the 4th dimension as well. Beings of the 5th dimension can easily time travel. However, beings of the 4th dimension, like us, cannot time travel because we live in a 4-D world, traveling 3 dimensionally. That means to ever do time travel, we just need to go to a higher dimension and not only perceive it but also be able to travel in it. However, traveling to the past is not very possible, unlike traveling to the future. Even if traveling to the past were possible, it would be very unlikely that an event in the past would be changed. In this paper, some approaches are provided to define time, our movement in time to the future, some aspects of time travel using dimensions, and how we can perceive a higher dimension.

Keywords: time, dimensions, String theory, relativity

Procedia PDF Downloads 72

Authors: M. Osman Gani, M. Ferdows, Toshiyuki Ogawa

Abstract:

In this work, we proposed a modified FHN-type reaction-diffusion system for a bistable excitable system by adding a scaled function obtained from a given function. We study the existence and the stability of the periodic traveling waves (or wavetrains) for the FitzHugh-Nagumo (FHN) system and the modified one and compare the results. The stability results of the periodic traveling waves (PTWs) indicate that most of the solutions in the fast family of the PTWs are stable for the FitzHugh-Nagumo equations. The instability occurs only in the waves having smaller periods. However, the smaller period waves are always unstable. The fast family with sufficiently large periods is always stable in FHN model. We find that the oscillation of pulse widths is absent in the standard FHN model. That motivates us to study the PTWs in the proposed FHN-type reaction-diffusion system for the bistable excitable media. A good agreement is found between the solutions of the traveling wave ODEs and the corresponding whole PDE simulation.

Keywords: bistable system, Eckhaus bifurcation, excitable media, FitzHugh-Nagumo model, periodic traveling waves

Procedia PDF Downloads 164

Authors: Boris Melnikov, Ye Zhang, Dmitrii Chaikovskii

Abstract:

This study explores the pseudo-geometric version of the extensively researched Traveling Salesman Problem (TSP), proposing a novel generalization of existing algorithms which are traditionally confined to the geometric version. By adapting the "onion husk" method and introducing auxiliary algorithms, this research fills a notable gap in the existing literature. Through computational experiments using randomly generated data, several metrics were analyzed to validate the proposed approach's efficacy. Preliminary results align with expected outcomes, indicating a promising advancement in TSP solutions.

Keywords: optimization problems, traveling salesman problem, heuristic algorithms, “onion husk” algorithm, pseudo-geometric version

Procedia PDF Downloads 172

Authors: Arindam Roy, Madhushree Das, Apurba Manna, Samir Maity

Abstract:

In this research paper, an algorithmic approach is developed to solve a novel multi-objective four-dimensional traveling salesman problem (MO4DTSP) where different paths with various numbers of conveyances are available to travel between two cities. NSGA-II and Decomposition algorithms are modified to solve MO4DTSP in an IoT-based transport system. This IoT-based transport system can be widely observed, analyzed, and controlled by an extensive distribution of traffic networks consisting of various types of sensors and actuators. Due to urbanization, most of the cities are connected using an intelligent traffic management system. Practically, for a traveler, multiple routes and vehicles are available to travel between any two cities. Thus, the classical TSP is reformulated as multi-route and multi-vehicle i.e., 4DTSP. The proposed MO4DTSP is designed with traveling cost, time, and customer satisfaction as objectives. In reality, customer satisfaction is an important parameter that depends on travel costs and time reflects in the present model.

Keywords: multi-objective four-dimensional traveling salesman problem (MO4DTSP), decomposition, NSGA-II, IoT-based transport system, customer satisfaction

Procedia PDF Downloads 81

Authors: Hussein Abbas Jebur, Yasir Abd Ulrazzaq

Abstract:

This study was carried out at the farm of El-Gemmaiza Agriculture Research Station, El-Garbia Governorate Egypt, to determine the performance characteristics of an agricultural transport. The performance of this transportation was compared between three surfaces (asphalt, dusty and field). The study was concentrated on the rate of drawbar pull, slip ratio, tractive efficiency and specific energy per unit area. The comparison was made under three different surfaces (asphalt, dusty and field), different traveling speeds from (3.38 to 6.55 km/h) and variable weights (0 and 300 kg). The results showed that the highest value of the tractive efficiency 60.20% was obtained at traveling speed 4.00 km/h with weight on the rear wheel on the asphalt surface. The highest value of specific energy 1.93 kW.h/ton during use of ballast on rear tractor wheels at traveling speed 3.38 km/h on the field surface.

Keywords: tractor, energy, transportation, weight, power

Procedia PDF Downloads 261

Authors: M. F. F. Ab Rashid, A. N. Mohd Rose, N. M. Z. Nik Mohamed, W. S. Wan Harun, S. A. Che Ghani

Abstract:

Traveling salesman problem with precedence constraint (TSPPC) is one of the most complex problems in combinatorial optimization. The existing algorithms to solve TSPPC cost large computational time to find the optimal solution. The purpose of this paper is to present an efficient genetic algorithm that guarantees optimal solution with less number of generations and iterations time. Unlike the existing algorithm that generates priority factor as chromosome, the proposed algorithm directly generates sequence of solution as chromosome. As a result, the proposed algorithm is capable of generating optimal solution with smaller number of generations and iteration time compare to existing algorithm.

Keywords: traveling salesman problem, sequencing, genetic algorithm, precedence constraint

Procedia PDF Downloads 535

Authors: Y. Wang

Abstract:

The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is O(CN_maxn²) where C is the iterations, N_max is the maximum number of frequency quadrilaterals containing each edge and n is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5n edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced.

Keywords: frequency quadrilateral, iterative algorithm, sparse graph, traveling salesman problem

Procedia PDF Downloads 195

Authors: Ai Fujii, Kan Shimazaki

Abstract:

Bicycle users must ride on the street according the law in Japan, but in practice, many bicycle users ride on the sidewalk. Drivers generally feel that bicycles riding in the street are in the way. In contrast, pedestrians generally feel that bicycles riding on the sidewalk are in the way. That seems to make sense. What, then, is the difference between riding a bicycle on the sidewalk or in the street by usual traveling means. We made 3D computer graphics models of pedestrians, a car, and a bicycle at an intersection. The bicycle was positioned to choose between advancing to the sidewalk or the street after a few seconds. We then made a 2D stimulus picture by changing the point of view of the 3DCG model pictures. Attitudes were surveyed using this 2D stimulus picture, and we compared attitudes between three groups, people traveling by car, on foot, or by bicycle. Here we report the survey result.

Keywords: bicycle, sidewalk, pedestrians, driver, intersection, safety

Procedia PDF Downloads 154

Authors: Ke Zhang, Yongli Zhu

Abstract:

Due to rapid load growths in today’s highly electrified societies and the requirement for green energy sources, large-scale wind farm power transmission system is constantly developing. This system is a typical multi-terminal power supply system, whose structure of the network topology of transmission lines is complex. What’s more, it locates in the complex terrain of mountains and grasslands, thus increasing the possibility of transmission line faults and finding the fault location with difficulty after the faults and resulting in an extremely serious phenomenon of abandoning the wind. In order to solve these problems, a fault location method for multi-terminal transmission line based on wind farm characteristics and improved single-ended traveling wave positioning method is proposed. Through studying the zero sequence current characteristics by using the characteristics of the grounding transformer(GT) in the existing large-scale wind farms, it is obtained that the criterion for judging the fault interval of the multi-terminal transmission line. When a ground short-circuit fault occurs, there is only zero sequence current on the path between GT and the fault point. Therefore, the interval where the fault point exists is obtained by determining the path of the zero sequence current. After determining the fault interval, The location of the short-circuit fault point is calculated by the traveling wave method. However, this article uses an improved traveling wave method. It makes the positioning accuracy more accurate by combining the single-ended traveling wave method with double-ended electrical data. What’s more, a method of calculating the traveling wave velocity is deduced according to the above improvements (it is the actual wave velocity in theory). The improvement of the traveling wave velocity calculation method further improves the positioning accuracy. Compared with the traditional positioning method, the average positioning error of this method is reduced by 30%.This method overcomes the shortcomings of the traditional method in poor fault location of wind farm transmission lines. In addition, it is more accurate than the traditional fixed wave velocity method in the calculation of the traveling wave velocity. It can calculate the wave velocity in real time according to the scene and solve the traveling wave velocity can’t be updated with the environment and real-time update. The method is verified in PSCAD/EMTDC.

Keywords: grounding transformer, multi-terminal transmission line, short circuit fault location, traveling wave velocity, wind farm

Procedia PDF Downloads 226

Authors: Takahiro Hino, Michiharu Maeda

Abstract:

Particle swarm optimization (PSO) is an optimization approach that achieves the social model of bird flocking and fish schooling. PSO works in continuous space and can solve continuous optimization problem with high quality. Set-based particle swarm optimization (SPSO) functions in discrete space by using a set. SPSO can solve combinatorial optimization problem with high quality and is successful to apply to the large-scale problem. In this paper, we present an algorithm of SPSO with status memory to decide the position based on the previous position for solving traveling salesman problem (TSP). In order to show the effectiveness of our approach. We examine SPSOSM for TSP compared to the existing algorithms.

Keywords: combinatorial optimization problems, particle swarm optimization, set-based particle swarm optimization, traveling salesman problem

Procedia PDF Downloads 513

Authors: Dmitri Terzi

Abstract:

The article presents the results of an algorithmic study of a special optimization problem of the transport type (traveling salesman problem): 1) To solve the problem, a new natural algorithm has been developed based on the decomposition of the initial data into convex hulls, which has a number of advantages; it is applicable for a fairly large dimension, does not require a large amount of memory, and has fairly good performance. The relevance of the algorithm lies in the fact that, in practice, programs for problems with the number of traversal points of no more than twenty are widely used. For large-scale problems, the availability of algorithms and programs of this kind is difficult. The proposed algorithm is natural because the optimal solution found by the exact algorithm is not always feasible due to the presence of many other factors that may require some additional restrictions. 2) Another inverse problem solved here is to describe a class of traveling salesman problems that have a predetermined optimal solution. The constructed algorithm 2 allows us to characterize the structure of traveling salesman problems, as well as construct test problems to evaluate the effectiveness of algorithms and other purposes. 3) The appendix presents a software implementation of Algorithm 1 (in MATLAB), which can be used to solve practical problems, as well as in the educational process on operations research and optimization methods.

Keywords: traveling salesman problem, solution construction algorithm, convex hulls, optimality verification

Procedia PDF Downloads 35

Authors: Intan Izafina Idrus, Mardina Abdullah, Alina Marie Hasbi, Asnawi Husin

Abstract:

This paper presents the result of large-scale traveling ionospheric disturbance (LSTID) observation during moderate magnetic storm event on 25 October 2011 with SYM-H ~ -160 nT and Kp ~ 7 over Peninsular Malaysia at equatorial region using vertical total electron content (VTEC) from the Global Positioning System (GPS) observation measurement. The propagation of the LSTID signatures in the TEC measurements over Peninsular Malaysia was also investigated using VTEC map. The LSTID was found to propagate equator-ward during this event. The results showed that the LSTID propagated with an average phase velocity of 526.41 m/s and average periods of 140 min. The occurrence of this LSTID was also found to be the subsequent effects of substorm activities in the auroral region.

Keywords: Global Positioning System (GPS), large-scale traveling ionospheric disturbance (LSTID), moderate geomagnetic storm, vertical total electron content (VTEC)

Procedia PDF Downloads 200

Authors: Mouhamadou Diop, Mohamed I. Hassan

Abstract:

Molten metallic flow in metallurgical plant is highly turbulent and presents a complex coupling with heat transfer, phase transfer, chemical reaction, momentum transport, etc. Molten silicon flow has significant effect in directional solidification of multicrystalline silicon by affecting the temperature field and the emerging crystallization interface as well as the transport of species and impurities during casting process. Owing to the complexity and limits of reliable measuring techniques, computational models of fluid flow are useful tools to study and quantify these problems. The overall objective of this study is to investigate the potential of a traveling magnetic field for an efficient operating control of the molten metal flow. A multidimensional numerical model will be developed for the calculations of Lorentz force, molten metal flow, and the related phenomenon. The numerical model is implemented in a laboratory-scale silicon crystallization furnace. This study presents the potential of traveling magnetic field approach for an efficient operating control of the molten flow. A numerical model will be used to study the effects of magnetic force applied on the molten flow, and their interdependencies. In this paper, coupled and decoupled, steady and unsteady models of molten flow and crystallization interface will be compared. This study will allow us to retrieve the optimal traveling magnetic field parameter range for crystallization furnaces and the optimal numerical simulations strategy for industrial application.

Keywords: multidimensional, numerical simulation, solidification, multicrystalline, traveling magnetic field

Procedia PDF Downloads 219

Authors: T. Toathom, M. Munlin, P. Sugunnasil

Abstract:

The traveling salesman problem (TSP) is one of the best-known problems in optimization problem. There are many research regarding the TSP. One of the most usage tool for this problem is the genetic algorithm (GA). The chromosome of the GA for TSP is normally encoded by the order of the visited city. However, the traditional chromosome encoding scheme has some limitations which are twofold: the large solution space and the inability to encapsulate some information. The number of solution for a certain problem is exponentially grow by the number of city. Moreover, the traditional chromosome encoding scheme fails to recognize the misplaced correct relation. It implies that the tradition method focuses only on exact solution. In this work, we relax some of the concept in the GA for TSP which is the exactness of the solution. The proposed work exploits the relation between cities in order to reduce the solution space in the chromosome encoding. In this paper, a second order GA is proposed to solve the TSP. The term second order refers to how the solution is encoded into chromosome. The chromosome is divided into 2 types: the high order chromosome and the low order chromosome. The high order chromosome is the chromosome that focus on the relation between cities such as the city A should be visited before city B. On the other hand, the low order chromosome is a type of chromosome that is derived from a high order chromosome. In other word, low order chromosome is encoded by the traditional chromosome encoding scheme. The genetic operation, mutation and crossover, will be performed on the high order chromosome. Then, the high order chromosome will be mapped to a group of low order chromosomes whose characteristics are satisfied with the high order chromosome. From the mapped set of chromosomes, the champion chromosome will be selected based on the fitness value which will be later used as a representative for the high order chromosome. The experiment is performed on the city data from TSPLIB.

Keywords: genetic algorithm, traveling salesman problem, initial population, chromosomes encoding

Procedia PDF Downloads 245

Authors: Preecha Phongpeng

Abstract:

The objectives of this research are to assess the prevalence of travel businesses websites in Thailand, investigate and evaluate the quality of travel business websites in Thailand. The sample size includes 323 websites from the population of 1,458 websites. The study covers 4 types of travel business websites including: 78 general travel agents, 30 online reservation travel agents, 205 hotels, 7 airlines, and 3 car-rental companies with nation-wide operation. The findings indicated that e-tourism in Thailand is at its growth stage, with only 13% of travel businesses having websites, 28% of them providing e-mail and the quality of travel business websites in Thailand was at the average level. Seven common problems were found in websites: lack of travel essential information, insufficient transportation information, lack of navigation tools, lack of link pages to other organizations, lack of safety features, unclear online booking functions, and lack of special features also as well.

Keywords: traveling business, website evaluation, e-commerce, e-tourism

Procedia PDF Downloads 278

Authors: Song Qingfeng

Abstract:

This research aims to seek the relationship between social media usage and overtourism from the perspective of tourists based on the theory of Maslow’s hierarchy needs. A questionnaire is formulated to collect data from 400 tourists who have visited the Hangzhou city in China in the last 12 months. Structural Equation Model (SEM) is employed to analysis data. The finding is that social media usage aggravates overtourism. Specifically, social media is used by tourists to information-seeking, entertainment, self-presentation, and socialization for traveling. These roles of social media would evoke the traveling intention to a specific destination at a certain time, which further influences the tourist flow. When the tourist flow concentrate, the overtourism would be aggravated. This study contributes to the destination managers to deep-understand the cause-effect relationship between social media and overtourism in order to address this problem.

Keywords: social media, overtourism, tourist flow, SEM, Maslow’s hierarchy of needs, Hangzhou

Procedia PDF Downloads 111

Authors: M. Brahim, I. Bahri, Y. Bernard

Abstract:

Traveling Wave Ultrasonic Motor (TWUM) is a compact, precise, and silent actuator generating high torque at low speed without gears. Moreover, the TWUM has a high holding torque without supply, which makes this motor as an attractive solution for holding position of robotic arms. However, their nonlinear dynamics, and the presence of load-dependent dead zones often limit their use. Those issues can be overcome in closed loop with effective and precise controllers. In this paper, robust H-infinity (H∞) and discrete time RST position controllers are presented. The H∞ controller is designed in continuous time with additional weighting filters to ensure the robustness in the case of uncertain motor model and external disturbances. Robust RST controller based on the pole placement method is also designed and compared to the H∞. Simulink model of TWUM is used to validate the stability and the robustness of the two proposed controllers.

Keywords: piezoelectric motors, position control, H∞, RST, stability criteria, robustness

Procedia PDF Downloads 221

Authors: D. P. Lawrence, T. M. M. D. Ariyarathna, W. N. K. De Silva, M. D. S. C. De Silva, Lasantha Abeysiri, Pradeep Abeygunawardhna

Abstract:

Safari traveling is one of the most famous hobbies all over the world. In Sri Lanka, 'Yala' is the second-largest national park, which is a better place to go for a safari. Many number of local and foreign travelers are coming to go for a safari in 'Yala'. But 'Yala' does not have a mobile application that is made to facilitate the traveler with some important features that the traveler wants to achieve in the safari experience. To overcome these difficulties, the proposed mobile application by adding those identified features to make travelers, guiders, and administration's works easier. The proposed safari traveling guidance mobile application is called 'SMART SAFARI' for the 'Yala' National Park in Sri Lanka. There are four facilities in this mobile application that provide for travelers as well as the guiders. As the first facility, the guider and traveler can view the created map of the park, and the guider can add temporary locations of animals and special locations on the map. This is a Geographic Information System (GIS) to capture, analyze, and display geographical data. And as the second facility is to generate optimal paths according to the travelers' requirements through the park by using machine learning techniques. In the third part, the traveler can get information about animals using an animal identification system by capturing the animal. As in the other facility, the traveler will be facilitated to add reviews and a rate and view those comments under categorized sections and pre-defined score range. With those facilities, this user-friendly mobile application provides the user to get a better experience in safari traveling, and it will probably help to develop tourism culture in Sri Lanka.

Keywords: animal identification system, geographic information system, machine learning techniques, pre defined score range

Procedia PDF Downloads 111

Authors: Farzaneh Rajabighamchi, Stan van Hoesel, Christof Defryn

Abstract:

The generalized traveling salesman problem (GTSP) is an extension of the traveling salesman problem (TSP) where the set of nodes is partitioned into clusters, and the salesman must visit exactly one node per cluster. In this research, we apply the definition of the GTSP to an order picker routing problem with multiple locations per product. As such, each product represents a cluster and its corresponding nodes are the locations at which the product can be retrieved. To pick a certain product item from the warehouse, the picker needs to visit one of these locations during its pick tour. As all products are scattered throughout the warehouse, the product clusters not separated geographically. We propose an exact LP model as well as heuristic and meta-heuristic solution algorithms for the order picking problem with multiple product locations.

Keywords: warehouse optimization, order picking problem, generalised travelling salesman problem, heuristic algorithm

Procedia PDF Downloads 81

Authors: Regita P. Permata, Ulfa S. Nuraini

Abstract:

Traveling Salesman Problem (TSP) is the most studied problem in combinatorial optimization. In simple language, TSP can be described as a problem of finding a minimum distance tour to a city, starting and ending in the same city, and exactly visiting another city. In product distribution, companies often get problems in determining the minimum distance that affects the time allocation. In this research, we aim to apply TSP heuristic methods to simulate nodes as city coordinates in product distribution. The heuristics used are sub tour reversal, nearest neighbor, farthest insertion, cheapest insertion, nearest insertion, and arbitrary insertion. We have done simulation nodes using Euclidean distances to compare the number of cities and processing time, thus we get optimum heuristic method. The results show that the optimum heuristic methods are farthest insertion and nearest insertion. These two methods can be recommended to solve product distribution problems in certain companies.

Keywords: Euclidean, heuristics, simulation, TSP

Procedia PDF Downloads 103

Authors: Taisir Eldos, Aws Kanan, Waleed Nazih, Ahmad Khatatbih

Abstract:

Chemical Reaction Optimization (CRO) is an optimization metaheuristic inspired by the nature of chemical reactions as a natural process of transforming the substances from unstable to stable states. Starting with some unstable molecules with excessive energy, a sequence of interactions takes the set to a state of minimum energy. Researchers reported successful application of the algorithm in solving some engineering problems, like the quadratic assignment problem, with superior performance when compared with other optimization algorithms. We adapted this optimization algorithm to the Printed Circuit Board Drilling Problem (PCBDP) towards reducing the drilling time and hence improving the PCB manufacturing throughput. Although the PCBDP can be viewed as instance of the popular Traveling Salesman Problem (TSP), it has some characteristics that would require special attention to the transactions that explore the solution landscape. Experimental test results using the standard CROToolBox are not promising for practically sized problems, while it could find optimal solutions for artificial problems and small benchmarks as a proof of concept.

Keywords: evolutionary algorithms, chemical reaction optimization, traveling salesman, board drilling

Procedia PDF Downloads 490

Authors: Jia-Chao Wang

Abstract:

A model of the universe without invoking space expansion is proposed to explain the observed redshift-distance relation and the cosmic microwave background radiation (CMB). The main hypothesized feature of the model is that photons traveling in space interact with the CMB photon gas. This interaction causes the photons to gradually lose energy through dissipation and, therefore, experience redshift. The interaction also causes some of the photons to be scattered off their track toward an observer and, therefore, results in beam intensity attenuation. As observed, the CMB exists everywhere in space and its photon density is relatively high (about 410 per cm³). The small average energy of the CMB photons (about 6.3×10⁻⁴ eV) can reduce the energies of traveling photons gradually and will not alter their momenta drastically as in, for example, Compton scattering, to totally blur the images of distant objects. An object moving through a thermalized photon gas, such as the CMB, experiences a drag. The cause is that the object sees a blue shifted photon gas along the direction of motion and a redshifted one in the opposite direction. An example of this effect can be the observed CMB dipole: The earth travels at about 368 km/s (600 km/s) relative to the CMB. In the all-sky map from the COBE satellite, radiation in the Earth's direction of motion appears 0.35 mK hotter than the average temperature, 2.725 K, while radiation on the opposite side of the sky is 0.35 mK colder. The pressure of a thermalized photon gas is given by Pγ = Eγ/3 = αT⁴/3, where Eγ is the energy density of the photon gas and α is the Stefan-Boltzmann constant. The observed CMB dipole, therefore, implies a pressure difference between the two sides of the earth and results in a CMB drag on the earth. By plugging in suitable estimates of quantities involved, such as the cross section of the earth and the temperatures on the two sides, this drag can be estimated to be tiny. But for a photon traveling at the speed of light, 300,000 km/s, the drag can be significant. In the present model, for the dissipation part, it is assumed that a photon traveling from a distant object toward an observer has an effective interaction cross section pushing against the pressure of the CMB photon gas. For the attenuation part, the coefficient of the typical attenuation equation is used as a parameter. The values of these two parameters are determined by fitting the 748 µ vs. z data points compiled from 643 supernova and 105 γ-ray burst observations with z values up to 8.1. The fit is as good as that obtained from the lambda cold dark matter (ΛCDM) model using online cosmological calculators and Planck 2015 results. The model can be used to interpret Hubble's constant, Olbers' paradox, the origin and blackbody nature of the CMB radiation, the broadening of supernova light curves, and the size of the observable universe.

Keywords: CMB as the lowest energy state, model of the universe, origin of CMB in a static universe, photon-CMB photon gas interaction

Procedia PDF Downloads 102

Authors: Anastasiya Paltarzhitskaya

Abstract:

Subjective time plays an important role in consciousness processes and self-awareness at the moment. The concept of intrinsic neural timescales (INT) explains the difference in perceiving various time intervals. The capacity to experience the present builds on the fundamental properties of temporal cognition. The challenge that both philosophy and neuroscience try to answer is how the brain differentiates the present from the past and future. In our work, we analyze papers which describe mechanisms involved in the perception of ‘present’ and ‘non-present’, i.e., future and past moments. Taking into account that we perceive time intervals even during rest or relaxation, we suppose that the default-mode network activity can code time features, including the present moment. We can compare some results of time perceptual studies, where brain activity was shown in states with different flows of time, including resting states and during “mental time travel”. According to the concept of mental traveling, we employ a range of scenarios which demand episodic memory. However, some papers show that the hippocampal region does not activate during time traveling. It is a controversial result that is further complicated by the phenomenological aspect that includes a holistic set of information about the individual’s past and future.

Keywords: temporal consciousness, time perception, memory, present

Procedia PDF Downloads 38

Authors: Bundit Pungnirund, Boonyada Pahasing

Abstract:

The objective of this research is to study factors related to behaviors of Thai travelers traveling to Koh Kret Island, Nonthaburi Province. The subjects of this study included 400 Thai travelers coming to Koh Kred. Questionnaires were used to collect data which were analyzed by computer program to find mean and correlation coefficient by Pearson. The results showed that Thai travelers reported their opinions and attitudes in high level on the marketing service mix, product, price, place, promotion, personal, physical evidence, and process. They reported on travelling motivation factor, tourist attraction, and facility at high level. Moreover, marketing service mix, product, price, place, promotion, personal, physical, and process including travelling motivation factor, tourist attraction, and facility had positive relationship with the frequency in travelling at statistically significant level (0.01), though in a low relationship but in the same direction.

Keywords: factors, behaviors, Thai travelers, Koh Kled, Nonthaburi Province

Procedia PDF Downloads 201

Authors: Chigozie P. Ugochukwu Okoro

Abstract:

While the needs of the traveling public are becoming more evolving due to the ever-changing tourism ecosphere; there is a seeming inability to sustain competitive advantage through hospitality enterprise service quality differentials and effective service delivery. Contending with these evolving needs demands a re-assessment of the notions that drive service evolvement thoughts pattern and service delivery processes management in the hospitality enterprise. The intent of this study was to explicate the trends of the evolving needs of the traveling public that are critical to hospitality enterprise service management. The hypothetical study used customer satisfaction to dissect the strategic implication of perception, experience, and socio-cultural engagements in customization of hospitality enterprise services. The study found out that customer perception is cognitive and does not shape service customization. The study also elucidated that customer experience which can be evaluated, is critical in service structure determination and delivery. Socio-cultural engagement is intrinsic in driving service diversification. The study recommends tourists’ audit and cognitive insights as strategic actions for re-designing service efficiency and delivery in hospitality enterprise service management.

Keywords: hospitality enterprise services, strategic management, quality service delivery, notions of criticality

Procedia PDF Downloads 146

Authors: Pratham Baheti, Rohan Sanghi, Aditya Gupta

Abstract:

In the largely populated city of New Delhi, India, there are a lot of people that travel by two-wheelers. Majority of the people wear helmets while traveling and know how important it is to wear helmets for their safety. Still, the number of deaths because of road accidents involving two-wheelers is significant. We had conducted a survey by traveling within and in the outskirts of Delhi so as to see the variation in data and in the opinion of people towards helmet being a safety device rather than to escape the traffic police. We conducted a survey at traffic junctions and crossings of all the stakeholders and collected feedback on the Helmet scenario in India. According to the survey, the possible reason for these deaths is that the people, being unaware of helmet safety standards (ISI standards for helmets), buy helmets with fake ISI mark from unauthorized helmet sellers for a cheap price. Also, for the people who do not wear a helmet at all or wear a helmet just because it is a law, the reasons that they do not want to wear a helmet is heavyweight, lack of ventilation, inconvenience due to a strap, and hair problems. To address all these problems, we are designing a helmet with reduced weight and also working on the Helmet’s retention system and ventilation. We plan to provide this product at a cheap cost whilst maintaining the ISI standards so that a larger section of the population would be able to afford the helmet.

Keywords: safety, survey, ISI marks, stakeholders, helmet

Procedia PDF Downloads 255