• Title/Summary/Keyword: Turn Label

Search Result 12, Processing Time 0.019 seconds

Development of A Turn Label Based Optimal Path Search Algorithm (Turn Label 기반 최적경로탐색 알고리즘 개발)

  • Meeyoung Lee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.23 no.2
    • /
    • pp.1-14
    • /
    • 2024
  • The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

An One-To-One K-Shortest Path Algorithm Considering Vine Travel Pattern (덩굴망 통행패턴을 고려한 One-To-One 다경로알고리즘)

  • Lee, Mee-Young;Yu, Ki-Yun;Kim, Jeong-Hyun;Shin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.6
    • /
    • pp.89-99
    • /
    • 2003
  • Considering a path represented by a sequence of link numbers in a network, the vine is differentiated from the loop in a sense that any link number can be appeared in the path only once, while more than once in the loop. The vine provides a proper idea how to account for complicated travel patterns such as U-turn and P-turn witnessed nearby intersections in urban roads. This paper proposes a new algorithm in which the vine travel pattern can be considered for finding K number of sequential paths. The main idea of this paper is achieved by replacing the node label of the existing Yen's algorithm by the link label technique. The case studies show that the algorithm properly represent the vine travel patterns in searching K number of paths. A noticeable result is that the algorithm may be a promising alternative for ITS deployment by enabling to provide reasonable route information including perceived traveler costs.

A Link-Label Based Node-to-Link Optimal Path Algorithm Considering Non Additive Path Cost (비가산성 경로비용을 반영한 링크표지기반 Node-to-Link 최적경로탐색)

  • Lee, Mee Young;Nam, Doohee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.5
    • /
    • pp.91-99
    • /
    • 2019
  • Existing node-to-node based optimal path searching is built on the assumption that all destination nodes can be arrived at from an origin node. However, the recent appearance of the adaptive path search algorithm has meant that the optimal path solution cannot be derived in node-to-node path search. In order to reflect transportation data at the links in real-time, the necessity of the node-to-link (or link-to-node; NL) problem is being recognized. This research assumes existence of a network with link-label and non-additive path costs as a solution to the node-to-link optimal path problem. At the intersections in which the link-label has a turn penalty, the network retains its shape. Non-additive path cost requires that M-similar paths be enumerated so that the ideal path can be ascertained. In this, the research proposes direction deletion and turn restriction so that regulation of the loop in the link-label entry-link-based network transformation method will ensure that an optimal solution is derived up until the final link. Using this method on a case study shows that the proposed method derives the optimal solution through learning. The research concludes by bringing to light the necessity of verification in large-scale networks.

K-th Path Search Algorithms with the Link Label Correcting (링크표지갱신 다수경로탐색 알고리즘)

  • Lee, Mee-Young;Baik, Nam-Cheol;Choi, Dae-Soon;Shin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.2 s.73
    • /
    • pp.131-143
    • /
    • 2004
  • Given a path represented by a sequence of link numbers in a graph, the vine is differentiated from the loop in a sense that any link number can be visited in the path no more than once, while more than once in the loop. The vine provides a proper idea on complicated travel patterns such as U-turn and P-turn witnessed near intersections in urban transportation networks. Application of the link label method(LLM) to the shortest Path algorithms(SPA) enables to take into account these vine travel features. This study aims at expanding the LLM to a K-th path search algorithm (KPSA), which adopts the node-based-label correcting method to find a group of K number of paths. The paths including the vine type of travels are conceptualized as drivers reasonable route choice behaviors(RRCB) based on non-repetition of the same link in the paths, and the link-label-based MPSA is proposed on the basis of the RRCB. The small-scaled network test shows that the algorithm sequence works correctly producing multiple paths satisfying the RRCB. The large-scaled network study detects the solution degeneration (SD) problem in case the number of paths (K) is not sufficient enough, and the (K-1) dimension algorithm is developed to prevent the SD from the 1st path of each link, so that it may be applied as reasonable alternative route information tool, an important requirement of which is if it can generate small number of distinct alternative paths.

Antecedents of Manufacturer's Private Label Program Engagement : A Focus on Strategic Market Management Perspective (제조업체 Private Labels 도입의 선행요인 : 전략적 시장관리 관점을 중심으로)

  • Lim, Chae-Un;Yi, Ho-Taek
    • Journal of Distribution Research
    • /
    • v.17 no.1
    • /
    • pp.65-86
    • /
    • 2012
  • The $20^{th}$ century was the era of manufacturer brands which built higher brand equity for consumers. Consumers moved from generic products of inconsistent quality produced by local factories in the $19^{th}$ century to branded products from global manufacturers and manufacturer brands reached consumers through distributors and retailers. Retailers were relatively small compared to their largest suppliers. However, sometime in the 1970s, things began to slowly change as retailers started to develop their own national chains and began international expansion, and consolidation of the retail industry from mom-and-pop stores to global players was well under way (Kumar and Steenkamp 2007, p.2) In South Korea, since the middle of the 1990s, the bulking up of retailers that started then has changed the balance of power between manufacturers and retailers. Retailer private labels, generally referred to as own labels, store brands, distributors own private-label, home brand or own label brand have also been performing strongly in every single local market (Bushman 1993; De Wulf et al. 2005). Private labels now account for one out of every five items sold every day in U.S. supermarkets, drug chains, and mass merchandisers (Kumar and Steenkamp 2007), and the market share in Western Europe is even larger (Euromonitor 2007). In the UK, grocery market share of private labels grew from 39% of sales in 2008 to 41% in 2010 (Marian 2010). Planet Retail (2007, p.1) recently concluded that "[PLs] are set for accelerated growth, with the majority of the world's leading grocers increasing their own label penetration." Private labels have gained wide attention both in the academic literature and popular business press and there is a glowing academic research to the perspective of manufacturers and retailers. Empirical research on private labels has mainly studies the factors explaining private labels market shares across product categories and/or retail chains (Dahr and Hoch 1997; Hoch and Banerji, 1993), factors influencing the private labels proneness of consumers (Baltas and Doyle 1998; Burton et al. 1998; Richardson et al. 1996) and factors how to react brand manufacturers towards PLs (Dunne and Narasimhan 1999; Hoch 1996; Quelch and Harding 1996; Verhoef et al. 2000). Nevertheless, empirical research on factors influencing the production in terms of a manufacturer-retailer is rather anecdotal than theory-based. The objective of this paper is to bridge the gap in these two types of research and explore the factors which influence on manufacturer's private label production based on two competing theories: S-C-P (Structure - Conduct - Performance) paradigm and resource-based theory. In order to do so, the authors used in-depth interview with marketing managers, reviewed retail press and research and presents the conceptual framework that integrates the major determinants of private labels production. From a manufacturer's perspective, supplying private labels often starts on a strategic basis. When a manufacturer engages in private labels, the manufacturer does not have to spend on advertising, retailer promotions or maintain a dedicated sales force. Moreover, if a manufacturer has weak marketing capabilities, the manufacturer can make use of retailer's marketing capability to produce private labels and lessen its marketing cost and increases its profit margin. Figure 1. is the theoretical framework based on a strategic market management perspective, integrated concept of both S-C-P paradigm and resource-based theory. The model includes one mediate variable, marketing capabilities, and the other moderate variable, competitive intensity. Manufacturer's national brand reputation, firm's marketing investment, and product portfolio, which are hypothesized to positively affected manufacturer's marketing capabilities. Then, marketing capabilities has negatively effected on private label production. Moderating effects of competitive intensity are hypothesized on the relationship between marketing capabilities and private label production. To verify the proposed research model and hypotheses, data were collected from 192 manufacturers (212 responses) who are producing private labels in South Korea. Cronbach's alpha test, explanatory / comfirmatory factor analysis, and correlation analysis were employed to validate hypotheses. The following results were drawing using structural equation modeling and all hypotheses are supported. Findings indicate that manufacturer's private label production is strongly related to its marketing capabilities. Consumer marketing capabilities, in turn, is directly connected with the 3 strategic factors (e.g., marketing investment, manufacturer's national brand reputation, and product portfolio). It is moderated by competitive intensity between marketing capabilities and private label production. In conclusion, this research may be the first study to investigate the reasons manufacturers engage in private labels based on two competing theoretic views, S-C-P paradigm and resource-based theory. The private label phenomenon has received growing attention by marketing scholars. In many industries, private labels represent formidable competition to manufacturer brands and manufacturers have a dilemma with selling to as well as competing with their retailers. The current study suggests key factors when manufacturers consider engaging in private label production.

  • PDF

A Study on Visual Merchandising for the SPA Fashion Brands in Japan (일본 SPA 패션브랜드의 비주얼머천다이징에 대한 연구)

  • Lee Young-Sook
    • Journal of the Korea Fashion and Costume Design Association
    • /
    • v.6 no.3
    • /
    • pp.19-29
    • /
    • 2004
  • The current fashion market is experiencing a lot of difficulties in fashion forecasting due to consumers' fast-changing lifestyle on fashion, changes in consumer behavior, and the segmentation of the fashion market. To cope with this harsh reality, many fashion enterprises have paid much attention to the SPA (Specialty Retailer's Store of Private Label Apparel) brand as a promising fashion marketing strategy in terms of which they can survive in the extremely competing fashion market. The SPA brand is in the stage of inception in Korea, but the SPA brands such as MUJI and UNIQLO are already dominating the fashion business in Japan. Korea has just started developing the SPA brand, but its technological development, which was triggered by the success of 'BASIC HOUSE', is rapidly evolving. Under these circumstances, the SPA brand is getting vital for the fashion market in efficiently realizing consumers' requirements, revolutionizing the method for providing product information and the process of Marketing Mix Program, and expressing the value of shop. This paper studies the nature of the SPA brand and fashion merchandising system, and in turn examine the differences between the visual merchandising of the existing fashion brands and the Japanese SPA brands that are used as the fashion marketing strategy which is driven by the up-to-date technological system. Centering around these issues, we propose a visual merchandising system for fashion enterprises which serves to develop Korean-style SPA brands.

  • PDF

A Study on VMD of SPA Brands and Purchasing Intention: Focus on Seoul and Gyeonggi-Do

  • Choi, In-Sik;Lee, Sang-Youn
    • Journal of Distribution Science
    • /
    • v.11 no.9
    • /
    • pp.51-57
    • /
    • 2013
  • Purpose - This study investigates the effect of visual merchandising display (VMD) of local specialty retailer of private label apparel (SPA) brands, such as space, display, and presentation on brand awareness, brand image, and purchase intention. It investigates consumers' VMD awareness and purchase intention of SPA brands to help business activities of local SPA enterprises. Research designs, data, methodology - This study uses SPSS 18.0 to study eight local SPA brands and has 193 effective usable copies from a sample of 200. Results - The display and presentation of VMDs of SPA brands had a positive influence on brand awareness and brand image, which in turn had a positive influence on purchase intention. Conclusions - As SPA brands are increasingly located in supercenters, they face space constraints and find it difficult to display their facade and signs effectively. Therefore, decisions pertaining to display, presentation, and space should consider whether these SPA brands are launched as independent specialty shops or in supercenters. The space for VMD is considered important in independent shops. However, shops that open in supercenters should pay more attention to presentation rather than space.

Finding the First K Shortest Loopless Paths in a Transportation Network (교통망에 적합한 K 비루프 경로 탐색 알고리즘)

  • Shin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.6
    • /
    • pp.121-131
    • /
    • 2004
  • The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.

The hybrid method of Listen-Before-Talk and Adaptive Frequency Hopping for coexistence of Bluetooth and WLAN (블루투스 및 무선 LAN 시스템의 동시지원을 위해 Listen-Before-Talk 기법을 결합한 Adaptive Frequency Hopping 방식의 제안)

  • ;Bin Zhen
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.7B
    • /
    • pp.706-718
    • /
    • 2002
  • In bluetooth system, there are two kinds of interference. One is the frequency static interference, for example 802.11 direct sequence, the interferer uses fixed frequency band. Another is frequency dynamic interference, for example other piconets or 802.11 frequency hopping, the interferer uses dynamic frequency channel and cant be estimated. In this paper we introduce a novel solution of hybrid method of Listen-Before-Talk (LBT) and Adaptive Frequency Hopping (AFH) to address the coexistence of bluetooth and Direct Sequence of wireless local area network (WLAN). Before any bluetooth packet transmission, in the turn around time of the current slot, both the sender and receiver sense the channel whether there is any transmission going on or not. If the channel is busy, packet transmission is withdrawn until another chance. This is the LBT in Bluetooth. Because of asymmetry sense ability of WLAN and bluetooth, AFH is introduced to combat the left front-edge packet collisions. In monitor period of AFH, LBT is performed to label the channels with static interference. Then, all the labeled noisy channels are not used in the followed bluetooth frequency hopping. In this way, both the frequency dynamic and frequency static interference are effectively mitigated. We evaluate the solution through packet collision analysis and a detail realistic simulation with IP traffic. It turns out that the hybrid method can combat both the frequency dynamic and frequency static interference. The packet collision analysis shows it almost doubles the maximal system aggregate throughput. The realistic simulation shows it has the least packet loss.

A User Optimer Traffic Assignment Model Reflecting Route Perceived Cost (경로인지비용을 반영한 사용자최적통행배정모형)

  • Lee, Mi-Yeong;Baek, Nam-Cheol;Mun, Byeong-Seop;Gang, Won-Ui
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.2
    • /
    • pp.117-130
    • /
    • 2005
  • In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.