• Title/Summary/Keyword: NP-hard Problem

Search Result 366, Processing Time 0.024 seconds

An Efficient Algorithm for Constructing a Maximal Request Bandwidth Tree on Public-shared Network (공유 네트워크에서 최대 요구대역폭 트리 구축을 위한 효율적인 알고리즘)

  • Chong, Kyun-Rak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.4
    • /
    • pp.87-93
    • /
    • 2015
  • Recently, an idea has been suggested in which members construct the network by sharing their surplus bandwidth of their own access point. This kind of network is called public-shared network. As an application, SVC video streaming delivery system on public-shared network has been proposed. To send video stream from the stream server to clients, a tree structure is constructed where the root is a stream server, internal nodes are sharable access points, and leafs are clients. The previous researches have focused on constructing the minimal sharable-bandwidth tree which can serve all video streaming requests using the minimal sharable bandwidth. In this paper, we have shown that the problem of constructing a tree structure with given sharable access points to serve maximal video streaming requests is NP-hard. We also have developed an efficient heuristic algorithm for this problem and evaluated experimentally our algorithm.

Railway Track Maintenance Scheduling using Artificial Bee Colony (Artificial Bee Colony 기법을 이용한 철도궤도 유지보수 일정계획 수립 연구)

  • Nam, Duk-Hee;Kim, Ki-Dong;Lee, Sung-Uk;Kim, Sung-Soo
    • Journal of the Korean Society for Railway
    • /
    • v.13 no.6
    • /
    • pp.601-607
    • /
    • 2010
  • The objective of this paper is to propose a fast and easy Binary Artificial Bee Colony (BABC) heuristic algorithm to optimize NP-hard scheduling problem of railway track maintenance considering real conditions. The optimal or best solutions can be found using proposed BABC within very short or user specified computation time. We can greatly maximize the objective value using this proposed method in 30, 60, 100 and 200 work size railway track maintenance scheduling problems for experiment and analysis.

Inverse Bin-packing Number Problems: NP-Hardness and Approximation Algorithms

  • Chung, Yerim
    • Management Science and Financial Engineering
    • /
    • v.18 no.2
    • /
    • pp.19-22
    • /
    • 2012
  • In the bin-packing problem, we deal with how to pack the items by using a minimum number of bins. In the inverse bin-packing number problem, IBPN for short, we are given a list of items and a fixed number of bins. The objective is to perturb at the minimum cost the item-size vector so that all items can be packed into the prescribed number of bins. We show that IBPN is NP-hard and provide an approximation algorithm. We also consider a variant of IBPN where the prescribed solution value should be returned by a pre-selected specific approximation algorithm.

Analysis of transportation problems with trailers and tractors (트레일러와 트렉터를 사용하는 하는 운송문제 분석)

  • Han Yun-Taek;Jang Su-Yeong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1-8
    • /
    • 2006
  • This paper considers an interesting transportation problem where trailers and tractors are involved in moving material. We identified a class of combinatorial optimization problems for minimizing the number of tractors and trailers required to accommodate the transportation needs. Then, we show that the fundamental problem is NP-hard and analyze its properties to develop efficient heuristic to handle the problem effectively.

  • PDF

Optimizing Reliable Network using Genetic Algorithm (유전자 알고리즘을 이용한 신뢰 통신망 최적화)

  • 이학종;강주락;권기호
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.452-455
    • /
    • 1999
  • Genetic algorithm is well known as the efficient algorithm which can solve a difficult problem. Network design considering reliability is NP-hard problem with cost, distance, and volume. Therefore genetic algorithm is considered as a good method for this problem. This paper suggests the reliable network which can be constructed with minimum cost using genetic algorithm and the rank method based on reliability for improving the performance. This method shows more excellent than existing method and confirms the result through simulation.

  • PDF

A New Total Coloring Problem in Multi-hop Networks

  • Watanabe, K.;Sengoku, M.;Tamura, H.;Nakano, K.;Shinoda, S.
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1375-1377
    • /
    • 2002
  • New graph coloring problems are discussed as models of a multihop network in this report. We consider a total scheduling problem, and prove that this problem is NP-hard. We propose new scheduling models of a multi-hop network for CDMA system, and show the complexity results of the scheduling problems.

  • PDF

New genetic crossover operators for sequencing problem (조합최적화 문제를 위한 새로운 유전연산자)

  • 석상문;안병하
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.61-63
    • /
    • 2003
  • 지난 10년 동안 유전 알고리즘은 어렵고 복잡한 다양한 문제들을 해결하기 위한 새로운 방법으로 인식되어왔다. 이러한 유전 알고리즘의 성능은 알고리즘 내에 구현되는 여러 연산자들에 좌우된다. 따라서 많은 연구자들이 새로운 연산자 개발에 관심을 가져 왔었다. 특히, 가장 널리 알려진 조합최적화 문제 중에 하나인 알려진 traveling salesman problem (TSP)의 경우 NP-hard문제로 분류되어 현재까지 이를 해결하기 위한 다양한 유전 연산자들이 개발되어 왔었다. 따라서 본 논문에서는 TSP 문제를 test problem로 이용하여 이를 해결하기 위한 새로운 유전 연산자 특히 교차 (Crossover Operator) 연산자들을 제안하고 기존의 다양한 연산자들과 비교를 통해서 성능을 입증한다.

  • PDF

Vertiport Location Problem to Maximize Utilization Rate for Air Taxi (에어 택시 이용률 최대화를 위한 수직이착륙장 위치 결정 문제)

  • Gwang Kim
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.28 no.5
    • /
    • pp.67-75
    • /
    • 2023
  • This paper deals with the operation of air taxis, which is one of the latest innovative technologies aimed at solving the issue of traffic congestion in cities. A key challenge for the successful introduction of the technology and efficient operation is a vertiport location problem. This paper employs a discrete choice model to calculate choice probabilities of transportation modes for each route, taking into account factors such as cost and travel time associated with different modes. Based on this probability, a mathematical formulation to maximize the utilization rate for air taxi is proposed. However, the proposed model is NP-hard, effective and efficient solution methodology is required. Compared to previous studies that simply proposed the optimization models, this study presents a solution methodology using the cross-entropy algorithm and confirms the effectiveness and efficiency of the algorith through numerical experiments. In addition to the academic excellence of the algorithm, it suggests that decision-making that considers actual data and air taxi utilization plans can increase the practial usability.

A ${\frac{1}{3}}$-Approximation Algorithm for the Order Consolidation Problem (주문집약문제에 대한 ${\frac{1}{3}}$-근사해법)

  • Myung, Young-Soo
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.42 no.1
    • /
    • pp.43-52
    • /
    • 2017
  • We consider the order consolidation problem that arises in production systems where customer orders are processed in batches. The problem involves maximizing the number of batches while satisfying the following conditions: (i) the total quantity processed in each batch must be above a prescribed level; (ii) the quantity in an order can be split and processed in more than one batches; (iii) each batch can include up to two different orders but can do so only when the two orders are compatible pair. This problem is known to be NP-hard and max-SNP hard. In this study, we develop an approximation algorithm with factor 1/3.

Model and Heuristics for the Heterogeneous Fixed Fleet Vehicle Routing Problem with Pick-Up and Delivery

  • Zhai, Shuai;Mao, Chao
    • Journal of Distribution Science
    • /
    • v.10 no.12
    • /
    • pp.19-24
    • /
    • 2012
  • Purpose - This paper discusses the heterogeneous fixed fleet vehicle routing problem with pick-up and delivery (HFFVRPPD), for vehicles with different capacities, fixed costs, and travel costs. Research Design, data, methodology - This paper made nine assumptions for establishing a mathematical model to describe HFFVRPPD. It established a practical mathematical model, and because of the non-deterministic polynomial-time hard (NP-hard), improved the traditional simulated annealing algorithm and tested a new algorithm using a certain scale model. Result - We calculated the minimum cost of the heterogeneous fixed fleet vehicle routing problem (HFFVRP) with a single task and, on comparing the results with the actual HFFVRP for the single task alone, observed that the total cost of HFFVRPPD reduced significantly by 46.7%. The results showed that the new algorithm provides better solutions and stability. Conclusions - This paper, by comparing the HFFVRP and HFFVRPPD results, highlights certain advantages of using HFFVRPPD in physical distribution enterprises, such as saving distribution vehicles, reducing logistics cost, and raising economic benefits.

  • PDF