• Title/Summary/Keyword: Prize collecting

Search Result 2, Processing Time 0.017 seconds

Analysis of Tour Information Services using Agent-based Simulation (시뮬레이션 모형을 통한 관광정보서비스 효과 분석)

  • Kim, Hyeon-Myeong;O, Jun-Seok
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.6 s.92
    • /
    • pp.103-117
    • /
    • 2006
  • This study develops an agent-based simulation model to evaluate tourist information systems under ubiquitous environment. In this study, individual tourist's activity chaining behavior is formulated as a utility maximization problem. The underlying assumption of the model is that tourists increase their activities within their time and budget constraints to maximize their utilities. The model seeks individual's optimal tour schedule by solving Prize-Collecting Multiple-Day Traveling Salesman Problem(PC MD TSP). The simulation-based evaluation framework allows investigating individual utility gains by their information type and the total expenditure at each tour attractions. The real-time tour activity scheduling system enables tourists to optimize their tour activities by minimizing their time loss and maximizing their opportunity to use high utility facilities.

Dynamic Programming Approach for Prize Colleting Travelling Salesman Problem with Time Windows (시간제약이 있는 상금 획득 외판원 문제에 대한 동적 계획 접근 방법)

  • Tae, Hyun-Chul;Kim, Byung-In
    • IE interfaces
    • /
    • v.24 no.2
    • /
    • pp.112-118
    • /
    • 2011
  • This paper introduces one type of prize collecting travelling salesman problem with time windows (PCTSPTW), proposes a mixed integer programming model for the problem, and shows that the problem can be reduced to the elementary shortest path problem with time windows and capacity constraints (ESPPTC). Then, a new dynamic programming algorithm is proposed to solve ESPPTC quickly. Computational results show the effectiveness of the proposed algorithm.