Search results for: maximal covering location problem

Authors: Jiayuan Wu. Lu Hu

Abstract:

With the development of the sharing economy and mobile technology, carsharing becomes more popular. In this paper, we focus on the joint optimization of one-way station-based carsharing systems. We model the problem as an integer linear program with six elements: station locations, station capacity, fleet size, initial vehicle allocation, vehicle relocation, and demand selection. A greedy-based heuristic is proposed to address the model. Firstly, initialization based on the location variables relaxation using Gurobi solver is conducted. Then, according to the profit margin and demand satisfaction of each station, the number of stations is downsized iteratively. This method is applied to real data from Chengdu, Sichuan taxi data, and it’s efficient when dealing with a large scale of candidate stations. The result shows that with vehicle relocation and demand selection, the profit and demand satisfaction of carsharing systems are increased.

Keywords: one-way carsharing, location, vehicle relocation, demand selection, greedy algorithm

Procedia PDF Downloads 114

Authors: Seyed Habib A. Rahmati, Mohamad Hasan Sadeghpour, Parsa Fallah Sheikhlari

Abstract:

Location quotient (LQ) is a comparison technique that represents emphasized economic structure of single zone versus the standard area to identify specialty for every zone. In another words, the exact calculation of this metric can show the main core competencies and critical capabilities of an area to the decision makers. This research focus on the exact calculation of the LQ for an Iranian Province called Qazvin and within a case study introduces LQ of the capable industries of Qazvin. Finally, through different graphs and tables, it creates an opportunity to compare the recognized capabilities.

Keywords: location quotient, case study, province analysis, core competency

Procedia PDF Downloads 631

Authors: Wan-I Chen, Tsung-I Pai

Abstract:

Future the society aging of population will create the social problem has not had the good mechanism solution in the Asian country, especially in Taiwan. In the future ten year the people in Taiwan must facing the condition which is localization aging social problem. In this situation, how to use the spatial in eco way to development space use to solve the old age spatial demand is the way which might develop in the future Taiwan society. Over the next 10 years, taking care of the aging people will become part of the social problem of aging phenomenon. The research concentrate in the feasibility of spatial substitution, secondary use of spatial might solve out of spatial problem for aging people. In order to prove the space usable, the research required to review the project with the support system and infill system for space experiment, by using network grid way. That defined community level of space elements location relationship, make new definitions of space and return to cooperation. Research to innovation in the the appraisal space causes the possibility, by spatial replacement way solution on spatial insufficient suitable condition. To evaluation community spatial by using the support system and infill system in order to see possibilities of use in replacement inner space and modular architecture into housing. The study is discovering the solution on the Eco way to develop space use to figure out the old age spatial demand.

Keywords: sustainable use, space conversion, integration, replacement


Procedia PDF Downloads 164

Authors: Sofia Ait Bouazza

Abstract:

We consider the problem of finding a minimum identifying code in a graph. This problem was initially introduced in 1998 and has been since fundamentally connected to a wide range of applications (fault diagnosis, location detection …). Suppose we have a building into which we need to place fire alarms. Suppose each alarm is designed so that it can detect any fire that starts either in the room in which it is located or in any room that shares a doorway with the room. We want to detect any fire that may occur or use the alarms which are sounding to not only to not only detect any fire but be able to tell exactly where the fire is located in the building. For reasons of cost, we want to use as few alarms as necessary. The first problem involves finding a minimum domination set of a graph. If the alarms are three state alarms capable of distinguishing between a fire in the same room as the alarm and a fire in an adjacent room, we are trying to find a minimum locating domination set. If the alarms are two state alarms that can only sound if there is a fire somewhere nearby, we are looking for a differentiating domination set of a graph. These three areas are the subject of much active research; we primarily focus on the third problem. An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from other vertices by the set of vertices in C that are at distance at most r≥1 from x. When only vertices out of the code are asked to be identified, we get the related concept of a locating dominating set. The problem of finding an identifying code (resp a locating dominating code) of minimum size is a NP-hard problem, even when the input graph belongs to a number of specific graph classes. Therefore, we study this problem in some restricted classes of undirected graphs like split graph, line graph and path in a directed graph. Then we present some results on the identifying code by giving an exact value of upper total locating domination and a total 2-identifying code in directed and undirected graph. Moreover we determine exact values of locating dominating code and edge identifying code of thin headless spider and locating dominating code of complete suns.

Keywords: identiying codes, locating dominating set, split graphs, thin headless spider

Procedia PDF Downloads 456

Authors: Blair D. Macdonald

Abstract:

After nearly one hundred years of its origin, foundational quantum mechanics remains one of the greatest unexplained mysteries in physicists today. Within this time, chaos theory and its geometry, the fractal, has developed. In this paper, the propagation behaviour with an iteration of a simple fractal, the Koch Snowflake, was described and analysed. From an arbitrary observation point within the fractal set, the fractal propagates forward by oscillation—the focus of this study and retrospectively behind by exponential growth from a point beginning. It propagates a potentially infinite exponential oscillating sinusoidal wave of discrete triangle bits sharing many characteristics of light and quantum entities. The model's wave speed is potentially constant, offering insights into the perception and a direction of time where, to an observer, when travelling at the frontier of propagation, time may slow to a stop. In isolation, the fractal is a superposition of component bits where position and scale present a problem of location. In reality, this problem is experienced within fractal landscapes or fields where 'position' is only 'known' by the addition of information or markers. The quantum' measurement problem', 'uncertainty principle,' 'entanglement,' and the classical-quantum interface are addressed; these are a problem of scale invariance associated with isolated fractality. Dual forward and retrospective perspectives of the fractal model offer the opportunity for unification between quantum mechanics and cosmological mathematics, observations, and conjectures. Quantum and cosmological problems may be different aspects of the one fractal geometry.

Keywords: measurement problem, observer, entanglement, unification

Procedia PDF Downloads 72

Authors: Kenza Aida Amara, Bachir Djebbar

Abstract:

We treat the two-dimensional bin packing problem which involves packing a given set of rectangles into a minimum number of larger identical rectangles called bins. This combinatorial problem is NP-hard. We propose a pretreatment for the oriented version of the problem that allows the valorization of the lost areas in the bins and the reduction of the size problem. A heuristic method based on the strategy first-fit adapted to this problem is presented. We present an approach of resolution by bee colony optimization. Computational results express a comparison of the number of bins used with and without pretreatment.

Keywords: bee colony optimization, bin packing, heuristic algorithm, pretreatment

Procedia PDF Downloads 610

Authors: I. Touaїbia, E. Azzag, O. Narjes

Abstract:

Power supply networks are growing continuously and their reliability is getting more important than ever. The complexity of the whole network comprises numerous components that can fail and interrupt the power supply for the end user. Underground distribution systems are normally exposed to permanent faults, due to specific construction characteristics. In these systems, visual inspection cannot be performed. In order to enhance service restoration, accurate fault location techniques must be applied. This paper describes the different faults that affect the underground distribution system of SONELGAZ (National Society of Electricity and Gas of Algeria), and cable fault location procedure with impulse reflection method (TDR), based in the analyses of the cable response of the electromagnetic impulse, allows cable fault prelocation. The results are obtained from real test in the underground distribution feeder from electrical network of energy distribution company of Souk-Ahras, in order to know the influence of cable characteristics in the types and frequency of faults.

Keywords: distribution networks, fault location, TDR, underground cable

Procedia PDF Downloads 513

Authors: Sukhveer Singh, Sandeep Singh

Abstract:

A bi-objective fuzzy transportation problem with the objectives to minimize the total fuzzy cost and fuzzy time of transportation without according priorities to them is considered. To the best of our knowledge, there is no method in the literature to find efficient solutions of the bi-objective transportation problem under uncertainty. In this paper, a bi-objective transportation problem in an uncertain environment has been formulated. An algorithm has been proposed to find efficient solutions of the bi-objective transportation problem under uncertainty. The proposed algorithm avoids the degeneracy and gives the optimal solution faster than other existing algorithms for the given uncertain transportation problem.

Keywords: uncertain transportation problem, efficient solution, ranking function, fuzzy transportation problem

Procedia PDF Downloads 498

Authors: Claudio Calosi, Damiano Costa, Paolo Natali

Abstract:

Determination is the relation that holds between certain kinds of properties, determinables – such as “being colored”, and others, determinates – such as “being red”. Subordination is the relation that holds between genus properties – such as “being an animal”, and others, species properties – such as “being human”'. It is widely held that Determination and Subordination share important similarities, yet also crucial differences. But what grounds such similarities and differences? This question is hardly ever addressed. The present paper provides the first step towards filling this gap in the literature. It argues that a locational theory of instantiation, roughly the view that to have a property is to occupy a location in quality space, holds the key for such an answer. More precisely, it argues that both principles of Determination and Subordination are just examples of more general principles of location. Consider Determination. The principle that everything that has a determinate has a determinable boils down to the claim that everything that has a precise location in quality space is in quality space – an eminently reasonable principle. The principle that nothing can have two determinates (at the same level of determination) boils down to the principle that nothing can be “multilocated” in quality space. In effect, the following provides a “translation table” between principles of location and determination: LOCATION DETERMINATION Functionality At Most One Determination Focus At Most One Determination & Requisite Determination* Exactness Requisite Determination* Super-Exactness Requisite Determination Exactitude Requisite Determination Converse-Exactness Determinable Inehritance This grounds the similarity between Determination and Subordination. What about the differences? The paper argues that the differences boil down to the mereological structure of the regions that are occupied in quality space, in particular whether they are simple or complex. The key technical detail is that Determination and Subordination induce a “set-theoretic rooted tree” structure over the domain of properties. Interestingly, the analysis also provides a possible justification for the Aristotelian claim that being is not a genus property – an argument that the paper develops in some detail.

Keywords: determinables/determinates, genus/species, location, Aristotle on being is not a genus

Procedia PDF Downloads 56

Authors: Amit Gupta, Deepak Juneja, Sorabh Gupta

Abstract:

This paper presents a model based on distance based approach (DBA) method employed for evaluation, selection, and ranking of replenishment policies for a single location inventory, which hitherto not developed in the literature. This work recognizes the significance of the selection problem, identifies the selection criteria, the relative importance of selection criteria for this research problem. The developed model is capable of comparing any number of alternate inventory policies for various selection criteria where cardinal values are assigned as a rating to alternate inventory polices for selection criteria and weights of selection criteria. The illustrated example demonstrates the model and presents the result in terms of ranking of replenishment policies.

Keywords: DBA, ranking, replenishment policies, selection criteria

Procedia PDF Downloads 142

Authors: M. Bertsiou, E. Feloni, E. Baltas

Abstract:

The proper management of the water supply and electricity is the key issue, especially in small islands, where sustainability has been combined with the autonomy and covering of water needs and the fast development in potential sectors of economy. In this research work a hybrid system in Fournoi island (Icaria), a small island of Aegean, has been evaluated in order to produce hydropower and cover water demands, as it can provide solutions to acute problems, such as the water scarcity or the instability of local power grids. The meaning and the utility of hybrid system and the cooperation with a desalination plant has also been considered. This kind of project has not yet been widely applied, so the consideration will give us valuable information about the storage of water and the controlled distribution of the generated clean energy. This process leads to the conclusions about the functioning of the system and the profitability of this project, covering the demand for water and electricity.

Keywords: hybrid system, water, electricity, island

Procedia PDF Downloads 304

Authors: Neha Bharti, Martin Sénéchal, Danielle R. Bouchard

Abstract:

Mostly attributed to lack of time, only 15% of adults currently reach the International Physical Activity Guidelines, which state that every adult should achieve minimum of 150 minutes of aerobic exercise per week at moderate to vigorous intensity in minimum bouts of 10 minutes each, in addition to two days of resistance training. Recent studies have suggested that any bout of aerobic exercise reaching moderate intensity has potential to improve health. If one could reach moderate intensity while doing resistance training, this could reduce the total weekly time involvement to reach the International Physical Activity Guidelines. Objectives: 1) To determine whether overweight and older adults can reach a minimum of moderate intensity while doing resistance training compared with young non-overweight adults, 2) To identify if the proportion of time spent at moderate to vigorous intensity is different in overweight adults and older adults when compared with young non-overweight adults when lifting 70% or 80% of maximal load, 3) To determine variables associated with proportion of time spent at moderate to vigorous intensity while doing resistance training. Methods: Sixty participants already doing resistance training were recruited (20 young non-overweight adults, 20 overweight adults, and 20 older adults). Participants visited fitness facility three times, separated by at least 48 hours, and performed eight resistance exercises each time. First visit was to collect baseline measurements and to measure maximal load for each of the eight exercises. Second and third visits were performed wearing a heart rate monitor to record heart rate and to measure exercise intensity. The two exercise sessions were performed at 70% and 80% of maximal capacity. Moderate intensity was defined as 40% of heart rate reserve. Results: The proportion of time spent at moderate to vigorous intensity ranged from 51% to 93% among the three groups. No difference was observed between the young group and the overweight adults group in the proportion of time spent at moderate to vigorous intensity, 82.6% (69.2-94.6) vs 92.5% (73.3-99.1). However, older adults spent lower proportion of time at moderate to vigorous intensity for both sessions 51.5% (22.0-86.6); P < .01. When doing resistance training at 70% and 80% of maximal capacity, the proportion of time spent at moderate to vigorous intensity was 82.3% (56.1-94.7) and 82.0% (59.2-98.0) with no significant difference (P=.83). Conclusion: This study suggests that overweight adults and older adults can reach moderate intensity for at least 51% of the time spent doing resistance training. However, time spent at moderate to vigorous intensity was lower for older adults compared to young non-overweight adults. For adults aged 60 or less, three resistance training sessions of 60 minutes weekly could be enough to reach both aerobic and resistance training components of the International Physical Activity Guidelines. Further research is needed to test if resistance training at moderate to vigorous intensity can have the same health benefits compared with adults completing the International Physical Activity Guidelines as currently suggested.

Keywords: aerobic exercise, international physical activity guidelines, moderate to vigorous intensity, resistance training

Procedia PDF Downloads 520

Authors: Ravneil Nand

Abstract:

Cooperative coevolution uses problem decomposition methods to solve a larger problem. The problem decomposition deals with breaking down the larger problem into a number of smaller sub-problems depending on their method. Different problem decomposition methods have their own strengths and limitations depending on the neural network used and application problem. In this paper we are introducing a new problem decomposition method known as Hidden-Neuron Level Decomposition (HNL). The HNL method is competing with established problem decomposition method in time series prediction. The results show that the proposed approach has improved the results in some benchmark data sets when compared to the standalone method and has competitive results when compared to methods from literature.

Keywords: cooperative coevaluation, feed forward network, problem decomposition, neuron, synapse

Procedia PDF Downloads 307

Authors: Milad Pirali, Sohrab Keyhani, Mohhamad Ali Sanjari, Ali Ashraf Jamshidi

Abstract:

Purpose: The effect of hamstring antagonist activity on the knee extensors torque of the Anterior Cruciate Ligament reconstruction (ACLR) is not clear and persistent muscle weakness is common after ACLR. Hamstring activation when acting as antagonist is considered very important for knee strengths. Therefore the purpose of this study was to examine hamstring antagonist coactivation during maximal effort of the isokinetic knee extension in ACLR athletes with hamstring autograft. Materials and Methods: We enrolled 20 professional athletes who underwent primary ACLR (hamstring tendon autograft)with 6-24 months postoperative and 20 healthy subjects as control group. Each subjects performed maximal effort isokinetic knee extension and flexion in 60/˚ s and 180/˚ s velocities for the involved and uninvolved limb. Synchronously, surface electromyography (EMG) was recorded of vastus medialis (VM), vastus lateralis (VL), rectus femoris (RF) and biceps femoris (BF). The antagonist integrated EMG (IEMG) values were normalized to the IEMG of the same muscle during maximal isokinetic eccentric effort at the same velocities and ROM. Results: A one-way analysis of variance designs shows significantly greater IEMG coactivation of hamstring and decreased activation of Vm in ACLR when compared to uninvolved and control group leg in 60/˚ s and 180/˚ s velocities. Likewise peak torque to body weight was decreased in ACLR compared to uninvolved and control group during knee extension in both velocities (p < 0.05). Conclusions: Decreased extensors moment caused by decreased quadriceps inhibition and increased hamstring coactivation. In addition, these result indicated to decrease of motor unit recruitment in the VM (as a kinesiologicmonitore of the knee). It is appearing that strengthening of the quadriceps to be an important for rehabilitation program after ACLR for preparation in athletes endeavors. Therefore, we suggest that having more emphasis and focus on quadriceps strength and less emphasis on hamstring following ACLR.

Keywords: ACLR-coactivation, dynamometry, electromyography, isokinetic

Procedia PDF Downloads 233

Authors: Andrey A. Chernousov, Ben Y. B. Chan

Abstract:

The thermal behavior of a large-scale, phase change material (PCM) enhanced building envelope system was studied in regard to the need for pre-fabricated construction in subtropical regions. The proposed large-scale envelope consists of a reinforced aluminum skin, insulation core, phase change material and reinforced gypsum board. The PCM impact on an energy efficiency of an enveloped room was resolved by validation of the Energy Plus numerical scheme and optimization of a smart material location in the core. The PCM location was optimized by a minimization method of a cooling energy demand. It has been shown that there is good agreement between the test and simulation results. The optimal location of the PCM layer in Hong Kong summer conditions has been then recomputed for core thicknesses of 40, 60 and 80 mm. A non-dimensional value of the optimal PCM location was obtained to be same for all the studied cases and the considered external and internal conditions.

Keywords: thermal performance, phase change material, energy efficiency, PCM optimization

Procedia PDF Downloads 390

Authors: Mao Zhaofang, Xu Yida, Fang Kan, Fu Enyuan, Zhao Zhao

Abstract:

Nowadays, last-mile distribution plays an increasingly important role in the whole industrial chain delivery link and accounts for a large proportion of the whole distribution process cost. Promoting the upgrading of logistics networks and improving the layout of final distribution points has become one of the trends in the development of modern logistics. Due to the discrete and heterogeneous needs and spatial distribution of customer demand, which will lead to a higher delivery failure rate and lower vehicle utilization, last-mile delivery has become a time-consuming and uncertain process. As a result, courier companies have introduced a range of innovative parcel storage facilities, including pick-up points and lockers. The introduction of pick-up points and lockers has not only improved the users’ experience but has also helped logistics and courier companies achieve large-scale economy. Against the backdrop of the COVID-19 of the previous period, contactless delivery has become a new hotspot, which has also created new opportunities for the development of collection services. Therefore, a key issue for logistics companies is how to design/redesign their last-mile distribution network systems to create integrated logistics and distribution networks that consider pick-up points and lockers. This paper focuses on the introduction of self-pickup facilities in new logistics and distribution scenarios and the heterogeneous demands of customers. In this paper, we consider two types of demand, including ordinary products and refrigerated products, as well as corresponding transportation vehicles. We consider the constraints associated with self-pickup points and lockers and then address the location-routing problem with self-pickup facilities and heterogeneous demands (LRP-PFHD). To solve this challenging problem, we propose a mixed integer linear programming (MILP) model that aims to minimize the total cost, which includes the facility opening cost, the variable transport cost, and the fixed transport cost. Due to the NP-hardness of the problem, we propose a hybrid adaptive large-neighbourhood search algorithm to solve LRP-PFHD. We evaluate the effectiveness and efficiency of the proposed algorithm by using instances generated based on benchmark instances. The results demonstrate that the hybrid adaptive large neighbourhood search algorithm is more efficient than MILP solvers such as Gurobi for LRP-PFHD, especially for large-scale instances. In addition, we made a comprehensive analysis of some important parameters (e.g., facility opening cost and transportation cost) to explore their impacts on the results and suggested helpful managerial insights for courier companies.

Keywords: city logistics, last-mile delivery, location-routing, adaptive large neighborhood search

Procedia PDF Downloads 58

Authors: Longfei Wang, Selçuk Köse

Abstract:

Hardware Trojan becomes great concern as integrated circuit (IC) technology advances and not all manufacturing steps of an IC are accomplished within one company. Real-time hardware Trojan detection is proven to be a feasible way to detect randomly activated Trojans that cannot be detected at testing stage. On-chip sensors serve as a great candidate to implement real-time hardware Trojan detection, however, the optimization of on-chip sensors has not been thoroughly investigated and the location of Trojan has not been carefully explored. On-chip sensor ellipse distribution method and equivalent mapping technique are proposed based on the characteristics of on-chip power delivery network in this paper to address the optimization and distribution of on-chip sensors for real-time hardware Trojan detection as well as to estimate the location and current consumption of hardware Trojan. Simulation results verify that hardware Trojan activation can be effectively detected and the location of a hardware Trojan can be efficiently estimated with less than 5% error for a realistic power grid using our proposed methods. The proposed techniques therefore lay a solid foundation for isolation and even deactivation of hardware Trojans through accurate location of Trojans.

Keywords: hardware trojan, on-chip sensor, power distribution network, power/ground noise

Procedia PDF Downloads 376

Authors: Sani M. Lawal, Idris Musa, Aliyu D. Usman

Abstract:

The Pareto approach of optimal solutions in a search space that evolved in multi-objective optimization problems is adopted in this paper, which stands for a set of solutions in the search space. This paper aims at presenting an optimal placement of Distributed Generation (DG) in radial distribution networks with an optimal size for minimization of power loss and voltage deviation as well as maximizing voltage profile of the networks. And these problems are formulated using particle swarm optimization (PSO) as a constraint nonlinear optimization problem with both locations and sizes of DG being continuous. The objective functions adopted are the total active power loss function and voltage deviation function. The multiple nature of the problem, made it necessary to form a multi-objective function in search of the solution that consists of both the DG location and size. The proposed PSO algorithm is used to determine optimal placement and size of DG in a distribution network. The output indicates that PSO algorithm technique shows an edge over other types of search methods due to its effectiveness and computational efficiency. The proposed method is tested on the standard IEEE 34-bus and validated with 33-bus test systems distribution networks. Results indicate that the sizing and location of DG are system dependent and should be optimally selected before installing the distributed generators in the system and also an improvement in the voltage profile and power loss reduction have been achieved.

Keywords: distributed generation, pareto, particle swarm optimization, power loss, voltage deviation

Procedia PDF Downloads 345

Authors: Mrinal Jana, Geetanjali Panda

Abstract:

In this paper a methodology is developed to solve a nonlinear fractional programming problem in which the coefficients of the objective function and constraints are interval parameters. This model is transformed into a general optimization problem and relation between the original problem and the transformed problem is established. Finally the proposed methodology is illustrated through a numerical example.

Keywords: fractional programming, interval valued function, interval inequalities, partial order relation

Procedia PDF Downloads 504

Authors: Sophie N. Selby-Pham, Yudie Wang, Louise Bennett

Abstract:

Consumption of grapes promotes health and reduces the risk of chronic diseases due to the action of grape phytochemicals in regulation of Oxidative Stress and Inflammation (OSI). The bioefficacy of phytochemicals depends on their absorption in the human body. The time required for phytochemicals to achieve maximal plasma concentration (Tₘₐₓ) after oral intake reflects the time window of maximal bioefficacy of phytochemicals, with Tₘₐₓ dependent on physicochemical properties of phytochemicals. This research collated physicochemical properties of grape phytochemicals from white and red grapes to predict their Tₘₐₓ using pharmacokinetic modelling. The predicted values of Tₘₐₓ were then compared to the measured Tₘₐₓ collected from clinical studies to determine the accuracy of prediction. In both liquid and solid intake forms, white grapes exhibit a shorter Tₘₐₓ range (0.5-2.5 h) versus red grapes (1.5-5h). The prediction accuracy of Tₘₐₓ for grape phytochemicals was 33.3% total error of prediction compared to the mean, indicating high prediction accuracy. Pharmacokinetic modelling allows prediction of Tₘₐₓ without costly clinical trials, informing dosing frequency for sustained presence of phytochemicals in the body to optimize the health benefits of phytochemicals.

Keywords: absorption kinetics, phytochemical, phytochemical absorption prediction model, Vitis vinifera

Procedia PDF Downloads 128

Authors: G. Meccariello, L. Della Ragione

Abstract:

The exposure to outdoor air pollution causes lung cancer and increases the risk of bladder cancer. Because air pollution in urban areas is mainly caused by transportation, it is necessary to evaluate pollutant exhaust emissions from vehicles during their real-world use. Nevertheless their evaluation and reduction is a key problem, especially in the cities, that account for more than 50% of world population. A particular attention was given to the slope variability along the streets during each journey performed by the instrumented vehicle. In this paper we dealt with the problem of describing a quantitatively approach for the reconstruction of GPS coordinates and altitude, in the context of correlation study between driving cycles / emission / geographical location, during an experimental campaign realized with some instrumented cars. Finally the slope analysis can be correlated to the emission and consumption values in a specific road position, and it could be evaluated its influence on their behaviour.

Keywords: air pollution, driving cycles, GPS signal, slope, emission factor, fuel consumption

Procedia PDF Downloads 371

Authors: Monish Sengupta, Benjamin Heydecker, Daniel Woodland

Abstract:

New train control systems rely mainly on Automatic Train Protection (ATP) and Automatic Train Operation (ATO) dynamically to control the speed and hence performance. The ATP and the ATO form the vital element within the CBTC (Communication Based Train Control) and within the ERTMS (European Rail Traffic Management System) system architectures. Reliable and accurate measurement of train location, speed and acceleration are vital to the operation of train control systems. In the past, all CBTC and ERTMS system have deployed a balise or equivalent to correct the uncertainty element of the train location. Typically a CBTC train is allowed to miss only one balise on the track, after which the Automatic Train Protection (ATP) system applies emergency brake to halt the service. This is because the location uncertainty, which grows within the train control system, cannot tolerate missing more than one balise. Balises contribute a significant amount towards wayside maintenance and studies have shown that balises on the track also forms a constraint for future track layout change and change in speed profile.This paper investigates the causes of the location uncertainty that is currently experienced and considers whether it is possible to identify an effective filter to ascertain, in conjunction with appropriate sensors, more accurate speed, distance and location for a CBTC driven train without the need of any external balises. An appropriate sensor fusion algorithm and intelligent sensor selection methodology will be deployed to ascertain the railway location and speed measurement at its highest precision. Similar techniques are already in use in aviation, satellite, submarine and other navigation systems. Developing a model for the speed control and the use of Kalman filter is a key element in this research. This paper will summarize the research undertaken and its significant findings, highlighting the potential for introducing alternative approaches to train positioning that would enable removal of all trackside location correction balises, leading to huge reduction in maintenances and more flexibility in future track design.

Keywords: ERTMS, CBTC, ATP, ATO

Procedia PDF Downloads 396

Authors: Md. Ahsan Ayub, Kazi A. Kalpoma, Humaira Tasnim Proma, Syed Mehrab Kabir, Rakib Ibna Hamid Chowdhury

Abstract:

Constraint Satisfaction Problem (CSP) is observed in various applications, i.e., scheduling problems, timetabling problems, assignment problems, etc. Researchers adopt a CSP technique to tackle a certain problem; however, each technique follows different approaches and ways to solve a problem network. In our exhaustive study, it has been possible to visualize the processes of essential CSP algorithms from a very concrete constraint satisfaction example, NQueens Problem, in order to possess a deep understanding about how a particular constraint satisfaction problem will be dealt with by our studied and implemented techniques. Besides, benchmark results - time vs. value of N in N-Queens - have been generated from our implemented approaches, which help understand at what factor each algorithm produces solutions; especially, in N-Queens puzzle. Thus, extended decisions can be made to instantiate a real life problem within CSP’s framework.

Keywords: arc consistency (AC), backjumping algorithm (BJ), backtracking algorithm (BT), constraint satisfaction problem (CSP), forward checking (FC), least constrained values (LCV), maintaining arc consistency (MAC), minimum remaining values (MRV), N-Queens problem

Procedia PDF Downloads 347

Authors: Peter Egri, Tamas Kis

Abstract:

Scheduling problems have been studied by the algorithmic mechanism design research from the beginning. This paper is focusing on a practically important, but theoretically rather neglected field: the project scheduling problem where the jobs connected by precedence constraints compete for various nonrenewable resources, such as materials. Although the centralized problem can be solved in polynomial-time by applying the algorithm of Carlier and Rinnooy Kan from the Eighties, obtaining materials in a decentralized environment is usually far from optimal. It can be observed in practical production scheduling situations that project managers tend to cache the required materials as soon as possible in order to avoid later delays due to material shortages. This greedy practice usually leads both to excess stocks for some projects and materials, and simultaneously, to shortages for others. The aim of this study is to develop a model for the material allocation problem of a production plant, where a central decision maker—the inventory—should assign the resources arriving at different points in time to the jobs. Since the actual due dates are not known by the inventory, the mechanism design approach is applied with the projects as the self-interested agents. The goal of the mechanism is to elicit the required information and allocate the available materials such that it minimizes the maximal tardiness among the projects. It is assumed that except the due dates, the inventory is familiar with every other parameters of the problem. A further requirement is that due to practical considerations monetary transfer is not allowed. Therefore a mechanism without money is sought which excludes some widely applied solutions such as the Vickrey–Clarke–Groves scheme. In this work, a type of Serial Dictatorship Mechanism (SDM) is presented for the studied problem, including a polynomial-time algorithm for computing the material allocation. The resulted mechanism is both truthful and Pareto optimal. Thus the randomization over the possible priority orderings of the projects results in a universally truthful and Pareto optimal randomized mechanism. However, it is shown that in contrast to problems like the many-to-many matching market, not every Pareto optimal solution can be generated with an SDM. In addition, no performance guarantee can be given compared to the optimal solution, therefore this approximation characteristic is investigated with experimental study. All in all, the current work studies a practically relevant scheduling problem and presents a novel truthful material allocation mechanism which eliminates the potential benefit of the greedy behavior that negatively influences the outcome. The resulted allocation is also shown to be Pareto optimal, which is the most widely used criteria describing a necessary condition for a reasonable solution.

Keywords: material allocation, mechanism without money, polynomial-time mechanism, project scheduling

Procedia PDF Downloads 312

Authors: Bit-Na Kwon, Hyun-Jee Yang, Dong-Hyun Ha, Hyoung-Kyu Song

Abstract:

In this paper, an adaptive cooperative scheme in the cell edge is proposed. The proposed scheme considers the location of a user and applies the suitable cooperative scheme. In cellular systems, the performance of communication is degraded if the user is located in the cell edge. In conventional scheme, two base stations are used in order to obtain diversity gain. However, the performance of communication is not sufficiently improved since the distance between each base station and a user is still distant. Therefore, we propose a scheme that the relays are used and the cooperative scheme is adaptively applied according to the user location. Through simulation results, it is confirmed that the proposed scheme has better performance than the conventional scheme.

Keywords: adaptive transmission, cooperative communication, diversity gain, OFDM

Procedia PDF Downloads 551

Authors: Saad M. Algharib

Abstract:

The major concern of planners when placing fire stations is finding their optimal locations such that the fire companies can reach fire locations within reasonable response time or distance. Planners are also concerned with the numbers of fire stations that are needed to cover all service areas and the fires, as demands, with standard response time or distance. One of the tools for such analysis is location-allocation models. Location-allocation models enable planners to determine the optimal locations of facilities in an area in order to serve regional demands in the most efficient way. The purpose of this study is to examine the geographic distribution of the existing fire stations in Kuwait City. This study utilized location-allocation models within the Geographic Information System (GIS) environment and a number of statistical functions to assess the current locations of fire stations in Kuwait City. Further, this study investigated how well all service areas are covered and how many and where additional fire stations are needed. Four different location-allocation models were compared to find which models cover more demands than the others, given the same number of fire stations. This study tests many ways to combine variables instead of using one variable at a time when applying these models in order to create a new measurement that influences the optimal locations for locating fire stations. This study also tests how location-allocation models are sensitive to different levels of spatial dependency. The results indicate that there are some districts in Kuwait City that are not covered by the existing fire stations. These uncovered districts are clustered together. This study also identifies where to locate the new fire stations. This study provides users of these models a new variable that can assist them to select the best locations for fire stations. The results include information about how the location-allocation models behave in response to different levels of spatial dependency of demands. The results show that these models perform better with clustered demands. From the additional analysis carried out in this study, it can be concluded that these models applied differently at different spatial patterns.

Keywords: geographic information science, GIS, location-allocation models, geography

Procedia PDF Downloads 156

Authors: Ali Heydarimoghim

Abstract:

In this paper, the optimal placement of charging and discharging stations is done to determine the location and capacity of the stations, reducing the cost of electric vehicle owners' losses, reducing the cost of distribution system losses, and reducing the costs associated with the stations. Also, observing the permissible limits of the bus voltage and the capacity of the stations and their distance are considered as constraints of the problem. Given the traffic situation in different areas of a city, we estimate the amount of energy required to charge and the amount of energy provided to discharge electric vehicles in each area. We then introduce the electricity distribution system of the city in question. Following are the scenarios for introducing the problem and introducing the objective and constraint functions. Finally, the simulation results for different scenarios are compared.

Keywords: charging & discharging stations, hybrid vehicles, optimization, replacement

Procedia PDF Downloads 119

Authors: Mohammad Farid

Abstract:

In this paper, we introduce and study an explicit iterative method based on hybrid extragradient method to approximate a common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup in Hilbert space. Further, we prove that the sequence generated by the proposed iterative scheme converge strongly to the common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup. This common solution is the unique solution of a variational inequality problem and is the optimality condition for a minimization problem. The results presented in this paper are the supplement, extension and generalization of the previously known results in this area.

Keywords: generalized mixed equilibrium problem, fixed-point problem, nonexpansive semigroup, variational inequality problem, iterative algorithms, hybrid extragradient method

Procedia PDF Downloads 453

Authors: Deyadeen Ali Alshibani

Abstract:

In the literature, the multi-armed bandit problem as a statistical decision model of an agent trying to optimize his decisions while improving his information at the same time. There are several different algorithms models and their applications on this problem. In this paper, we evaluate the Regret-regression through comparing with Q-learning method. A simulation on determination of optimal treatment regime is presented in detail.

Keywords: optimal, bandit problem, optimization, dynamic programming

Procedia PDF Downloads 434

Authors: V. Antevska, B. Dejanova, L. Todorovska, J. Pluncevic, E. Sivevska, S. Petrovska, S. Mancevska, I. Karagjozova

Abstract:

Introduction: The aim of this study was to optimise the laboratory oxidative stress (OS) markers in soccer players. Material and methods: In a number of 37 soccer players (21±3 years old) and 25 control subjects (sedenters), plasma samples were taken for d-ROMs (reactive oxygen metabolites) and NO (nitric oxide) determination. The d-ROMs test was performed by measurement of hydroperoxide levels (Diacron, Italy). For NO determination the method of nitrate enzyme reduction with the Greiss reagent was used (OXIS, USA). The parameters were taken after the training of the soccer players and were compared with the control group. Training was considered as maximal exercise treadmill test. The criteria of maximum loading for each subject was established as >95% maximal heart rate. Results: The level of d-ROMs was found to be increased in the soccer players vs. control group but no significant difference was noticed. After the training d-ROMs in soccer players showed increased value of 299±44 UCarr (p<0.05). NO showed increased level in all soccer players vs. controls but significant difference was found after the training 102±29 μmol (p<0.05). Conclusion: Due to these results we may suggest that the measuring these OS markers in sport medicine may be useful for better estimation and evaluation of the training program. More oxidative stress should be used to clarify optimization of the training intensity program.

Keywords: oxidative stress markers, soccer players, training, sport

Procedia PDF Downloads 430