Identifikasi Potensi Penumpang Moda Pesawat Terbang Rute Bandar Lampung – Jogjakarta Dan Solo

Movement pattern that done by the resident of Lampung Province to Central Java Province likeSolo and Yogyakarta such as by using direct bus from Lampung to Yogyakarta-Solo, using bus toJakarta and then continued by plane, and using plane from Lampung to Jakarta and thencontinued by plane again. The purpose of this research are knowing about the passengerscharacteristics, so we can identify the factors that influence passengers in choosing the kind oftransportation and to know the passenger\u27s potency that using plane from Lampung Province toYogyakarta-Solo.From surveys that have been done, the opinion of responders about new plan route of plane fromLampung to Yogyakarta-Solo are 93,79 % of the responders that using bus agree and 6,21 %disagree, otherwise opinion of responders that do movement pattern by using bus and thencontinued by plane, and also movement pattern fully by plane express 100% agreement. Factorswhich influence the election of transportation from the responders are cost for the bus ( 43,79%), comfortable for the movement pattern by using bus continued by plane ( 65 %), and time tripfor the movement pattern by using plane continued by plane ( 82,05 %)

Analisis Kinerja Dan Tingkat Pelayanan Fasilitas Pedestrian Pada Pusat Pertokoan Di Bandar Lampung

The main idea is to know the requirement or demand of pedestrian facility and also the service level of pedestrian facility that have been there. This research is using two kind of data, a secondary data and a primary data. The primary data is got from survei of pedestrian volume, pedestrian cycle time, and eksisting weidth of trotoar. The final result from all those survei are trotoar pedestrian volume, pedestrian velocity, weidht affective, and also the service level of pedestrian facility on each location that we analysis. The result of this research result shows that the biggest volume of pedestrian are on Sunday for 26782 pedestrian, on Monday pedestrian volume are dicrease between 10-40%. Velocity rates of pedestrian are different betwen male and female, the male velocity rate are faster than female. Trotoar affective weidht on four trotoar location that we survey shows that almost of the trotoar does not have the appropriate weidth wich pedestrian need. Male velocity rates on trotoar is 49,1m/minutes and female are 47,7m/minutes. For service level of pedestrian facility, crossing bridge on Kartini have the lowest level that is “F”

Local Stellar Kinematics from RAVE data - VII. Metallicity Gradients from Red Clump Stars

We investigate the Milky Way Galaxy's radial and vertical metallicity gradients using a sample of 47,406 red clump stars from the RAVE DR4. This sample is more than twice the size of the largest sample in the literature investigating radial and vertical metallicity gradients. The absolute magnitude of Groenewegen (2008) is used to determine distances to our sample stars. The resulting distances agree with the RAVE DR4 distances Binney et al. (2014) of the same stars. Our photometric method also provides distances to 6185 stars that are not assigned a distance in RAVE DR4. The metallicity gradients are calculated with their current orbital positions ($R_{gc}$ and $Z$) and with their orbital properties (mean Galactocentric distance, $R_{m}$ and $z_{max}$), as a function of the distance to the Galactic plane: d[Fe/H]/d$R_{gc}=$-$0.047\pm0.003$ dex/kpc for $0\leq |Z|\leq0.5$ kpc and d[Fe/H]/d$R_m=$-$0.025\pm0.002$ dex/kpc for $0\leq z_{max}\leq0.5$ kpc. This reaffirms the radial metallicity gradient in the thin disc but highlights that gradients are sensitive to the selection effects caused by the difference between $R_{gc}$ and $R_{m}$. The radial gradient is flat in the distance interval 0.5-1 kpc from the plane and then becomes positive greater than 1 kpc from the plane. The radial metallicity gradients are also eccentricity dependent. We showed that d[Fe/H]/d$R_m=$-$0.089\pm0.010$, -$0.073\pm0.007$, -$0.053\pm0.004$ and -$0.044\pm0.002$ dex/kpc for $e_p\leq0.05$, $e_p\leq0.07$, $e_p\leq0.10$ and $e_p\leq0.20$ sub-samples, respectively, in the distance interval $0\leq z_{max}\leq0.5$ kpc. Similar trend is found for vertical metallicity gradients. Both the radial and vertical metallicity gradients are found to become shallower as the eccentricity of the sample increases. These findings can be used to constrain different formation scenarios of the thick and thin discs.Comment: 18 pages, including 16 figures and 6 tables, accepted for publication in PAS

The time-dependent vehicle routing problem with soft time windows and stochastic travel times

This paper studies a vehicle routing problem with time-dependent and stochastic travel times. In our problem setting, customers have soft time windows. A mathematical model is used in which both efficiency for service as well as reliability for customers are taken into account. Depending on whether service times are included or not, we consider two versions of this problem. Two metaheuristics are built: a Tabu Search and an Adaptive Large Neighborhood Search. We carry out our experiments for well-known problem instances and perform comprehensive analyses on the numerical results in terms of the computational time and the solution quality. Experiments confirm that the proposed procedure is effective to obtain very good solutions to be performed in real-life environment

Vehicle routing problem with stochastic travel times including soft time windows and service costs

This paper studies a vehicle routing problem with soft time windows and stochastic travel times. A model is developed that considers both transportation costs (total distance traveled, number of vehicles used and drivers’ total expected overtime) and service costs (early and late arrivals). We propose a Tabu Search method to solve our model. An initialization algorithm is developed to construct feasible routes by taking into account the travel time stochasticity. Solutions provided by the Tabu Search algorithm are further improved by a post-optimization method. We conduct our computational experiments for well-known problem instances. Results show that our Tabu Search method performs well by obtaining very good final solutions in a reasonable amount of time

Consumer credit in comparative perspective

We review the literature in sociology and related fields on the fast global growth of consumer credit and debt and the possible explanations for this expansion. We describe the ways people interact with the strongly segmented consumer credit system around the world—more specifically, the way they access credit and the way they are held accountable for their debt. We then report on research on two areas in which consumer credit is consequential: its effects on social relations and on physical and mental health. Throughout the article, we point out national variations and discuss explanations for these differences. We conclude with a brief discussion of the future tasks and challenges of comparative research on consumer credit.Accepted manuscrip

Vehicle routing with soft time windows and stochastic travel times : a column generation and branch-and-price solution approach

We study a vehicle routing problem with soft time windows and stochastic travel times. In this problem, we consider stochastic travel times to obtain routes which are both efficient and reliable. In our problem setting, soft time windows allow early and late servicing at customers by incurring some penalty costs. The objective is to minimize the sum of transportation costs and service costs. Transportation costs result from three elements which are the total distance traveled, the number of vehicles used and the total expected overtime of the drivers. Service costs are incurred for early and late arrivals; these correspond to time-window violations at the customers. We apply a column generation procedure to solve this problem. The master problem can be modeled as a classical set partitioning problem. The pricing subproblem, for each vehicle, corresponds to an elementary shortest path problem with resource constraints. To generate an integer solution, we embed our column generation procedure within a branch-and-price method. Computational results obtained by experimenting with well-known problem instances are reported

Numerical ordinality in a wild nectarivore

This work was supported by the Association for the Study of Animal Behaviour (S.D.H.), the University of Lethbridge, and the Natural Sciences and Engineering Research Council of Canada (RGPIN 121496-2003; T.A.H.)Ordinality is a numerical property that nectarivores may use to remember the specific order in which to visit a sequence of flowers, a foraging strategy also known as traplining. In this experiment, we tested whether wild, free-living rufous hummingbirds (Selasphorus rufus) could use ordinality to visit a rewarded flower. Birds were presented with a series of linear arrays of 10 artificial flowers; only one flower in each array was rewarded with sucrose solution. During training, birds learned to locate the correct flower independent of absolute spatial location. The birds' accuracy was independent of the rewarded ordinal position (1st, 2nd, 3rd or 4th), which suggests that they used an object-indexing mechanism of numerical processing, rather than a magnitude-based system. When distance cues between flowers were made irrelevant during test trials, birds could still locate the correct flower. The distribution of errors during both training and testing indicates that the birds may have used a so-called working up strategy to locate the correct ordinal position. These results provide the first demonstration of numerical ordinal abilities in a wild vertebrate and suggest that such abilities could be used during foraging in the wild.PostprintPeer reviewe