• Title/Summary/Keyword: location-routing problem

Search Result 81, Processing Time 0.024 seconds

An Adaptive Genetic Algorithm Based Optimal Feeder Routing for Distribution System Planning (적응 유전알고리즘을 이용한 배전계통 계획의 급전선 최적경로 선정)

  • Kim, Byung-Seop;Kim, Min-Soo;Shin, Joong-rin
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.2
    • /
    • pp.58-66
    • /
    • 2001
  • This paper presents an application of a newly designed Adaptive Genetic Algorithm (AGA) to solve the Optimal Feeder Routing (OFR) problem for distribution system planning. The main objective of the OFR problem usually is to minimize the total cost that is the sum of investment costs and system operation costs. We propose a properly designed AGA, in this paper, which can handle the horizon-year expansion planning problem of power distribution network in which the location of substation candidates, the location and amount of forecasted demands are given. In the proposed AGA, we applied adaptive operators using specially designed adaptive probabilities. we also a Simplified Load Flow (SLF) technique for radial networks to improve a searching efficiency of AGA. The proposed algorithm has been evaluated with the practical 32, 69 bus test system to show favorable performance. It is also shown that the proposed method for the OFR can also be used for the network reconfiguration problem in distribution system.

  • PDF

Extended Hub-and-spoke Transportation Network Design using a Symbiotic Evolutionary Algorithm (공생 진화알고리듬을 이용한 확장된 hub-and-spoke 수송네트워크 설계)

  • Shin Kyoung-Seok;Kim Yeo-Keun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.2
    • /
    • pp.141-155
    • /
    • 2006
  • In this paper, we address an extended hub-and-spoke transportation network design problem (EHSNP). In the existing hub location problems, the location and number of spokes, and shipments on spokes are given as input data. These may, however, be viewed as the variables according to the areas which they cover. Also, the vehicle routing in each spoke needs to be considered to estimate the network cost more correctly. The EHSNP is a problem of finding the location of hubs and spokes, and pickup/delivery routes from each spoke, while minimizing the total related transportation cost in the network. The EHSNP is an integrated problem that consists of several interrelated sub-problems. To solve EHSNP, we present an approach based on a symbiotic evolutionary algorithm (symbiotic EA), which are known as an efficient tool to solve complex integrated optimization problems. First, we propose a framework of symbiotic EA for EHSNP and its genetic elements suitable for each sub-problem. To analyze the proposed algorithm, the extensive experiments are performed with various test-bed problems. The results show that the proposed algorithm is promising in solving the EHSNP.

Distribution Center Location and Routing Problem with Demand Dependent on the Customer Service (고객서비스에 따른 수요변화하에서의 분배센터 입지선정과 경로 문제)

  • 오광기;이상용
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.22 no.51
    • /
    • pp.29-40
    • /
    • 1999
  • The distribution center location and routing problem involves interdependent decisions among facility, transportation, and inventory decisions. The design of distribution system affects the customers' purchase decision by sets the level of customer service to be offered. Thus the lower product availability may cause a loss of demand as falls off the customers' purchase intention, and this is related to the firm's profit reduction. This study considers the product availability of the distribution centers as the measure of the demand level change of the demand points, and represents relation between customer service and demand level with linear demand function. And this study represents the distribution center location and routing to demand point in order to maximize the total profit that considers the products' sales revenue by customer service, the production cost and the distribution system related costs.

  • PDF

Enhanced Dynamic Management of Mobile Agent in Location Based Routing

  • Narahara, Yuichiro;Shiokawa, Shigeki
    • Journal of Multimedia Information System
    • /
    • v.3 no.4
    • /
    • pp.129-134
    • /
    • 2016
  • A routing protocol in mobile ad hoc networks is important, and a location based routing has attracted attention. We have proposed a method, in which plural mobile agents (MA) manage location information and construct a route and the number of MA dynamically changes depending on the network situation. However, the area where each MA manages is not always appropriate. This would increase the network load due to unnecessary split and mergence of MAs. To solve this problem, in this paper, we propose an enhanced method. In this method, the MA management area is properly determined based on distribution of nodes. From the performance evaluation, we show that the proposed method outperforms conventional methods in terms of packet delivery rate when network load is high.

Study of Location-based Routing Techniques of BS and Sensor Node (BS와 센서 노드의 위치 기반 라우팅 기법에 관한 연구)

  • Kim, Yong-Tae;Jeong, Yoon-Su
    • Journal of Digital Convergence
    • /
    • v.10 no.9
    • /
    • pp.289-295
    • /
    • 2012
  • Routing technique of wireless sensor network that is presented to improve effectiveness of consumption in energy at the previous study is existing in various ways, however for routing, its own location data and nodes' location data close to with 1-hop distance should be kept. And it uses multi-hop transmission method that transmits data to BS node via several nodes. This technique makes electronic consumption of sensor node and entire network's energy consumption so that it makes effective energy management problem. Therefore, this paper suggests location based 1-hop routing technique of BS node that satisfies distance $d{\pm}{\alpha}$ with source node using RSSI and radio wave range of sensor node.

Position-Based Multicast Routing in Mobile Ad hoc Networks: An Analytical Study

  • Qabajeh, Mohammad M.;Adballa, Aisha H.;Khalifa, Othman O.;Qabajeh, Liana K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.6
    • /
    • pp.1586-1605
    • /
    • 2012
  • With the prevalence of multimedia applications and the potential commercial usage of Mobile Ad hoc Networks (MANETs) in group communications, Quality of Service (QoS) support became a key requirement. Recently, some researchers studied QoS multicast issues in MANETs. Most of the existing QoS multicast routing protocols are designed with flat topology and small networks in mind. In this paper, we investigate the scalability problem of these routing protocols. In particular, a Position-Based QoS Multicast Routing Protocol (PBQMRP) has been developed. PBQMRP builds a source multicast tree guided by the geographic information of the mobile nodes, which helps in achieving more efficient multicast delivery. This protocol depends on the location information of the multicast members which is obtained using a location service algorithm. A virtual backbone structure has been proposed to perform this location service with minimum overhead and this structure is utilized to provide efficient packet transmissions in a dynamic mobile Ad hoc network environment. The performance of PBQMRP is evaluated by performing both quantitative analysis and extensive simulations. The results show that the used virtual clustering is very useful in improving scalability and outperforms other clustering schemes. Compared to On-Demand Multicast Routing Protocol (ODMRP), PBQMRP achieves competing packet delivery ratio and significantly lower control overhead.

A supply planning model based on inventory-allocation and vehicle routing problem with location-assignment (수송경로 문제를 고려한 물류최적화모델의 연구)

  • 황흥석;최철훈;박태원
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1997.10a
    • /
    • pp.201-204
    • /
    • 1997
  • This study is focussed on optimization problems which require allocating the restricted inventory to demand points and assignment of vehicles to routes in order to deliver goods for demand sites with optimal decision. This study investigated an integrated model using three step-by-step approach based on relationship that exists between the inventory allocation and vehicle routing with restricted amount of inventory and transportations. we developed several sub-models such as; first, an inventory-allocation model, second a vehicle-routing model based on clustering and a heuristic algorithms, and last a vehicle routing scheduling model, a TSP-solver, based on genetic algorithm. Also, for each sub-models we have developed computer programs and by a sample run it was known that the proposed model to be a very acceptable model for the inventory-allocation and vehicle routing problems.

  • PDF

Effective Heuristic Procedures for Solving a Gateway Location and fiber Routing Problem in Designing Multimedia Telecommunication Networks (멀티미디어 통신망 설계에서 게이트웨이 위치와 광경로 결정문제를 해결하는 휴리스틱 접근방법)

  • 이영호;남기효;김성인
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7B
    • /
    • pp.1220-1228
    • /
    • 1999
  • In this paper, we deal with an important network design problem in providing multimedia telecommunication services. The problem is to find an optimal gateway location and fiber routing, while minimizing the total cost. The cost elements are the installation cost of add-drop multiplexer and fiber cables. We have developed effective heuristic procedures for the problem. The performance of the developed heuristic shows promising computational results.

  • PDF

Routing for Enhancing Source-Location Privacy with Low Delivery Latency in Sensor Networks (센서 네트워크에서 낮은 전달 지연으로 근원지 위치 기밀을 강화하는 라우팅)

  • Tscha, Yeong-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.636-645
    • /
    • 2008
  • Most of routing schemes that protect the source's location from a malicious attacker usually make use of a path of a long length per message for the sake of lengthening the safety period. The biggest problem to such approaches is taking a very long latency in transferring messages to the destination. In this paper we show the problem to find the least-cost single path that is enough to keep the source-location always secure from the attacker, provided that it is used for the delivery of a set of messages given in priori, is NP-complete. Consequently we propose a routing protocol GSLP-w(GPSR-based Source-Location Privacy with crew size co) that is a trade-off between two extreme approaches. The advantage of GSLP-co lies in its enhanced safety period for the source and its lowered delivery latency in messaging. We consider NSP(Normalized Sefety Period) and NDL(Normalized Delivery Latency), measured in terms of the least number of hops to the destination, to achieve tangible interpretation of the results. We ran a simulation to confirm our claim by generating 100 topologies of 50,000 nodes with the average number of neighbors being 8. The results show that GSLP-$\omega$ provides more enhanced NSP compared to other protocols GSLP, an earlier version of GSLP-$\omega$, and PR-SP(Phantom Routing - Single Path), the most notable existing protocol for the source-location privacy, and less NDL than that of GSLP but more than that of PR-SP.

Cluster-Based Mobile Sink Location Management Scheme for Solar-Powered Wireless Sensor Networks

  • Oh, Eomji;Kang, Minjae;Yoon, Ikjune;Noh, Dong Kun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.9
    • /
    • pp.33-40
    • /
    • 2017
  • In this paper, we propose a sink-location management and data-routing scheme to effectively support the mobile sink in solar-powered WSN. Battery-based wireless sensor networks (WSNs) have a limited lifetime due to their limited energy, but solar energy-based WSNs can be supplied with energy periodically and can operate forever. On the other hand, introduction of mobile sink in WSNs can solve some energy unbalance problem between sink-neighboring nodes and outer nodes which is one of the major challenges in WSNs. However, there is a problem that additional energy should be consumed to notify each sensor node of the location of the randomly moving mobile sink. In the proposed scheme, one of the nodes that harvests enough energy in each cluster are selected as the cluster head, and the location information of the mobile sink is shared only among the cluster heads, thereby reducing the location management overhead. In addition, the overhead for setting the routing path can be removed by transferring data in the opposite direction to the path where the sink-position information is transferred among the heads. Lastly, the access node is introduced to transmit data to the sink more reliably when the sink moves frequently.