Token导航 LogoToken导航

Agent Skill · 待分类

tour-operations(旅游业务)

tour-operations 用于处理 GitHub 仓库、Issue、Pull Request 和代码协作信息,适合在 Codex、Claude、Cursor、Gemini CLI 中需要围绕仓库状态、代码变更或协作事项进行整理时使用。可结合来源仓库、安装命令和原始 README 继续核验具体用法。安装前建议确认权限范围、维护状态,以及是否会触发联网、命令执行或文件读写。

tour-operations 是待分类类 Agent Skill,可用宿主为 Codex、Claude、Cursor、Gemini CLI,通过GitHub 仓库获取,权限为只读;许可证信息还不明确,第三方扫描已通过,按安装量在待分类类的 11,209 个 Skill 里排第 7,770。

总安装 343周安装 14GitHub Stars 13下载 111核验 2026-05-01

安装说明

本站只整理中文说明,不托管安装包,也不代用户安装。
GitHub
许可证
unknown

安装方式

通过对话安装

复制提示词发给支持本地命令或 Skills 的 AI 助手,先确认命令和权限,再让它执行。

请帮我安装这个 Agent Skill:tour-operations(旅游业务)
来源仓库:https://github.com/kishorkukreja/awesome-supply-chain
仓库路径:skills/tour-operations
安装命令:
npx skills add https://github.com/kishorkukreja/awesome-supply-chain --skill tour-operations
安装前请先检查当前环境是否支持对应 CLI,并向我确认将要执行的命令、安装目录、联网范围和文件读写权限;确认后再执行。

命令行安装

复制命令到本机终端执行。该命令会通过 npx skills 从第三方来源获取 Skill;本站只展示命令,不托管安装包,也不自动执行。

skills.shnpx skills
npx skills add https://github.com/kishorkukreja/awesome-supply-chain --skill tour-operations

这个 Skill 是做什么的

这个 Skill 的分类还没最终确定,用法以来源仓库的说明为准。

tour-operations 用于处理 GitHub 仓库、Issue、Pull Request 和代码协作信息。它适合在 Codex、Claude、Cursor 等环境中围绕仓库状态进行整理。

可通过 npx skills add 命令从 kishorkukreja/awesome-supply-chain 仓库安装使用。安装前建议确认权限范围、维护状态及是否触发联网或文件操作。适用宿主包括 Codex、Claude、Cursor、Gemini CLI,接入前应确认版本、权限和运行环境要求。

来源仓库内路径:skills/tour-operations

上手步骤

4 步
  1. 1

    确认自己的宿主工具

    公开资料标注支持 Codex、Claude、Cursor、Gemini CLI;先确认自己用的是其中之一,再按对应工具的 Skills 目录放置。

  2. 2

    拿到安装命令

    可以直接复制的命令是 npx skills add https://github.com/kishorkukreja/awesome-supply-chain --skill tou…;命令里的占位符换成自己的路径或密钥再执行。

  3. 3

    安装后重启宿主

    命令执行完要完全退出宿主工具再打开,让新装的 Skill 被重新扫描到,否则列表里可能看不到。

  4. 4

    按最小权限试用

    它标注为只读,先用只读任务试一次,确认行为符合预期再扩大使用范围。

常见问题

6 条

tour-operations 怎么安装?

在终端执行 npx skills add https://github.com/kishorkukreja/awesome-supply-chain --skill tour-operatio…。装完完全退出宿主工具再打开,让它重新扫描本地 Skill。

tour-operations 支持哪些 AI 工具?

公开资料标注支持 Codex、Claude、Cursor、Gemini CLI。其他工具只要能读取本地 Skill 目录,一般也能手动放进去,但要自己确认触发方式是否一致。

tour-operations 需要什么权限?

权限级别是只读。该 Skill 主要提供规则、说明或参考内容,本身偏只读;真正读写文件、联网或执行命令仍取决于宿主 Agent 的任务。

tour-operations 是免费的吗?

公开资料没有标注明确许可证,收费和商用限制都无法确认。正式使用前请到来源仓库核对授权说明。

tour-operations 用的人多吗?

公开数据是累计安装 343 次,近一周安装 14 次,下载 111 次,GitHub 13 星。这些数字来自第三方目录统计,只能当作热度参考,不代表质量或安全性。

tour-operations 安全吗?

第三方扫描结果为通过,但这只覆盖已知的静态检查项,不能替代自己读一遍源码和安装命令。

值得选的地方和要先想清楚的地方

值得选的地方

  • 同时适配 4 种工具,换客户端不用重新找替代品。
  • 第三方扫描已通过,常见的高风险行为没有命中。
  • 标注为只读权限,试用阶段不容易误改本地文件。

先想清楚的地方

  • 许可证没有明确标注,能不能商用、能不能再分发都不确定。
  • 第三方目录整理,版本更新和行为细节以来源仓库为准。

适不适合你

更适合

  • 已经在用 Codex,想直接扩展它能力的人。
  • 需要处理待分类类任务、又不想每次都手写提示词的人。
  • 只想先试试效果、不希望它改动本地文件的人。

不太适合

  • 需要明确授权才能用到公司项目里的场景。
  • 需要厂商级技术支持和 SLA 的生产系统。

待分类类 Skill 对比

6 个同类
Skill总安装GitHub 星权限许可证扫描
infsh-cli

infsh CLI · Codex、Claude

4,374,576382权限未标注未明确未收录
ai-video-generation

AI 视频生成 · Codex、Claude

4,313,376382调用外部服务未明确有提醒
lark-openapi-explorer

云雀 OpenAPI 浏览器 · Codex、Claude

2,064,1209,011需要联网未明确有提醒
lark-workflow-standup-report

Lark 工作流程站立报告 · Codex、Claude

2,041,6328,978需要联网未明确通过
use-my-browser

使用我的浏览器 · Codex、Claude

1,848,49140操作浏览器未明确未通过
tour-operations

旅游业务 · 本页

34313只读未明确通过

按安装量取同分类前几名;数字来自第三方目录统计,只作热度参考,不代表质量结论。

SKILL.md 原文

Tour Operations

You are an expert in tour operations and package travel management. Your goal is to help optimize tour planning, package construction, resource allocation, and operational logistics for tour operators, ensuring profitability while delivering excellent customer experiences.

Initial Assessment

Before optimizing tour operations, understand:

  1. Tour Operator Profile

- Operator type? (inbound, outbound, ground handler, DMC) - Market segments? (adventure, luxury, budget, cultural, special interest) - Geographic focus? (domestic, regional, international) - Business model? (retail, wholesale, B2B, B2C)

  1. Tour Portfolio

- Tour types? (escorted, independent, FIT, SIT, GIT) - Duration range? (day tours, multi-day, extended) - Number of active tours and departures? - Seasonal vs. year-round operation?

  1. Resource Constraints

- Transportation fleet? (owned, leased, contracted) - Guide availability and languages? - Hotel and accommodation contracts? - Supplier relationships?

  1. Objectives & Challenges

- Primary goals? (profitability, market share, customer satisfaction) - Current pain points? (utilization, costs, operations) - Technology systems? (booking, operations, CRM) - Competitive positioning?


Tour Operations Framework

Tour Package Components

Transportation:

  • Motorcoach/bus
  • Trains
  • Flights (group bookings)
  • Transfers and private vehicles
  • Ferries and boats

Accommodation:

  • Hotels (groups, series, allotments)
  • Resorts
  • Alternative (hostels, B&B, apartments)

Attractions & Activities:

  • Guided tours and excursions
  • Entrance fees
  • Activities and experiences
  • Meals and dining

Services:

  • Tour guides and tour directors
  • Local guides
  • Transfers
  • Porter services

Tour Package Pricing & Profitability

Cost-Plus Pricing Model

import numpy as np
import pandas as pd

class TourPackagePricing:
    """
    Calculate tour package costs and optimal pricing
    """

    def __init__(self, tour_name, duration_days, max_pax):
        self.tour_name = tour_name
        self.duration = duration_days
        self.max_pax = max_pax

    def calculate_tour_cost(self, components):
        """
        Calculate total tour cost per passenger

        Components include:
        - Hotels (per room per night)
        - Transportation (fixed + per km)
        - Meals (per meal per person)
        - Attractions (per person)
        - Guide (per day)
        - Other (insurance, tips, etc.)
        """

        # Per-passenger costs
        per_pax_cost = {
            'accommodation': 0,
            'meals': 0,
            'attractions': 0,
            'guide_services': 0,
            'transportation': 0,
            'other': 0
        }

        # Accommodation cost (assume double occupancy)
        hotels = components['hotels']
        for hotel in hotels:
            cost_per_room = hotel['rate_per_night'] * hotel['nights']
            per_pax_cost['accommodation'] += cost_per_room / 2  # Double occupancy

        # Meals
        meals = components['meals']
        per_pax_cost['meals'] = (
            meals['breakfasts'] * meals['breakfast_cost'] +
            meals['lunches'] * meals['lunch_cost'] +
            meals['dinners'] * meals['dinner_cost']
        )

        # Attractions and entrance fees
        for attraction in components['attractions']:
            per_pax_cost['attractions'] += attraction['cost_per_person']

        # Fixed costs allocated per passenger (at full capacity)
        # Transportation
        transport = components['transportation']
        total_transport_cost = (
            transport['fixed_cost'] +
            transport['distance_km'] * transport['cost_per_km'] +
            transport['driver_cost_per_day'] * self.duration
        )
        per_pax_cost['transportation'] = total_transport_cost / self.max_pax

        # Guide services
        guide_cost_total = components['guide']['cost_per_day'] * self.duration
        per_pax_cost['guide_services'] = guide_cost_total / self.max_pax

        # Other costs
        per_pax_cost['other'] = components.get('other_per_pax', 0)

        return per_pax_cost

    def calculate_breakeven_price(self, per_pax_cost, overhead_percentage=0.15):
        """
        Calculate breakeven price including overhead
        """
        total_direct_cost = sum(per_pax_cost.values())
        overhead = total_direct_cost * overhead_percentage
        breakeven = total_direct_cost + overhead

        return breakeven

    def calculate_selling_price(self, breakeven_price, margin_percentage=0.25,
                               single_supplement_pct=0.30):
        """
        Calculate selling prices with desired margin

        Parameters:
        - margin_percentage: target profit margin
        - single_supplement_pct: additional charge for single occupancy
        """

        # Base selling price (double occupancy)
        base_price = breakeven_price / (1 - margin_percentage)

        # Single occupancy price (pays for full room)
        single_price = base_price * (1 + single_supplement_pct)

        # Child price (if applicable)
        child_price = base_price * 0.75  # 25% discount

        return {
            'double_occupancy': base_price,
            'single_occupancy': single_price,
            'child': child_price,
            'margin_percentage': margin_percentage,
            'margin_amount': base_price - breakeven_price
        }

    def calculate_tour_profitability(self, selling_price, actual_pax,
                                    pax_mix={'double': 20, 'single': 4, 'child': 2}):
        """
        Calculate tour profitability for given passenger mix
        """

        # Revenue
        revenue = (
            pax_mix['double'] * selling_price['double_occupancy'] +
            pax_mix['single'] * selling_price['single_occupancy'] +
            pax_mix['child'] * selling_price['child']
        )

        # Recalculate costs for actual passenger count
        total_pax = sum(pax_mix.values())

        # Variable costs scale with actual pax
        # Fixed costs remain the same

        # Simplified profitability
        total_cost = self.calculate_breakeven_price(self.calculate_tour_cost(components)) * total_pax

        profit = revenue - total_cost
        profit_margin = profit / revenue if revenue > 0 else 0

        return {
            'total_revenue': revenue,
            'total_cost': total_cost,
            'gross_profit': profit,
            'profit_margin': profit_margin,
            'revenue_per_pax': revenue / total_pax,
            'cost_per_pax': total_cost / total_pax
        }

# Example tour costing
tour = TourPackagePricing("European Highlights", duration_days=7, max_pax=45)

components = {
    'hotels': [
        {'city': 'Paris', 'rate_per_night': 120, 'nights': 2},
        {'city': 'Rome', 'rate_per_night': 100, 'nights': 2},
        {'city': 'Barcelona', 'rate_per_night': 110, 'nights': 2},
    ],
    'meals': {
        'breakfasts': 7, 'breakfast_cost': 15,
        'lunches': 4, 'lunch_cost': 20,
        'dinners': 6, 'dinner_cost': 35
    },
    'attractions': [
        {'name': 'Eiffel Tower', 'cost_per_person': 25},
        {'name': 'Colosseum', 'cost_per_person': 30},
        {'name': 'Sagrada Familia', 'cost_per_person': 35},
    ],
    'transportation': {
        'fixed_cost': 5000,  # Bus rental
        'distance_km': 2500,
        'cost_per_km': 1.5,
        'driver_cost_per_day': 200
    },
    'guide': {
        'cost_per_day': 300
    },
    'other_per_pax': 50  # Insurance, tips, etc.
}

per_pax_cost = tour.calculate_tour_cost(components)
breakeven = tour.calculate_breakeven_price(per_pax_cost)
selling_price = tour.calculate_selling_price(breakeven, margin_percentage=0.25)

print(f"Breakeven price: ${breakeven:.2f}")
print(f"Selling price (double occupancy): ${selling_price['double_occupancy']:.2f}")
print(f"Margin: ${selling_price['margin_amount']:.2f} ({selling_price['margin_percentage']:.1%})")

Tour Scheduling & Resource Allocation

Multi-Tour Scheduling Optimization

def optimize_tour_schedule(tours, vehicles, guides, planning_horizon_days=90):
    """
    Optimize tour departures and resource allocation

    Parameters:
    - tours: list of tour products with demand
    - vehicles: available vehicles/buses
    - guides: available tour guides
    - planning_horizon_days: scheduling window
    """
    from pulp import *

    prob = LpProblem("Tour_Scheduling", LpMaximize)

    # Decision variables: schedule tour t with vehicle v and guide g on day d
    x = {}

    for t, tour in enumerate(tours):
        for v, vehicle in enumerate(vehicles):
            for g, guide in enumerate(guides):
                for d in range(planning_horizon_days):
                    # Only if vehicle and guide are qualified for this tour
                    if (vehicle['capacity'] >= tour['min_pax'] and
                        tour['language'] in guide['languages']):
                        x[t, v, g, d] = LpVariable(
                            f"Schedule_{t}_{v}_{g}_{d}",
                            cat='Binary'
                        )

    # Objective: maximize revenue
    revenue = []

    for (t, v, g, d), var in x.items():
        tour = tours[t]
        # Revenue = passengers × price
        # Assume tour runs at 80% capacity
        expected_pax = vehicle['capacity'] * 0.8
        tour_revenue = expected_pax * tour['price_per_pax']

        revenue.append(tour_revenue * var)

    prob += lpSum(revenue)

    # Constraints

    # Vehicle can do one tour at a time
    for v, vehicle in enumerate(vehicles):
        for d in range(planning_horizon_days):
            # Check all tours that overlap with day d
            using_vehicle = []

            for (t, v_, g, d_start), var in x.items():
                if v_ == v:
                    tour = tours[t]
                    # Tour occupies vehicle from d_start to d_start + duration
                    if d_start <= d < d_start + tour['duration_days']:
                        using_vehicle.append(var)

            if using_vehicle:
                prob += lpSum(using_vehicle) <= 1

    # Guide can do one tour at a time
    for g, guide in enumerate(guides):
        for d in range(planning_horizon_days):
            using_guide = []

            for (t, v, g_, d_start), var in x.items():
                if g_ == g:
                    tour = tours[t]
                    if d_start <= d < d_start + tour['duration_days']:
                        using_guide.append(var)

            if using_guide:
                prob += lpSum(using_guide) <= 1

    # Meet minimum demand for popular tours
    for t, tour in enumerate(tours):
        min_departures = tour.get('min_departures_per_month', 0)

        if min_departures > 0:
            scheduled = lpSum([var for (t_, v, g, d) in x
                             if t_ == t and d < 30])
            prob += scheduled >= min_departures

    # Solve
    solver = PULP_CBC_CMD(msg=0, timeLimit=60)
    prob.solve(solver)

    # Extract schedule
    schedule = []
    for (t, v, g, d), var in x.items():
        if var.varValue > 0.5:
            tour = tours[t]
            schedule.append({
                'tour': tour['name'],
                'vehicle': vehicles[v]['id'],
                'guide': guides[g]['name'],
                'departure_day': d,
                'return_day': d + tour['duration_days'] - 1,
                'duration': tour['duration_days'],
                'expected_revenue': vehicle['capacity'] * 0.8 * tour['price_per_pax']
            })

    schedule_df = pd.DataFrame(schedule).sort_values('departure_day')

    return {
        'status': LpStatus[prob.status],
        'total_revenue': value(prob.objective),
        'schedule': schedule_df,
        'vehicle_utilization': {
            vehicles[v]['id']: len(schedule_df[schedule_df['vehicle'] == vehicles[v]['id']]) /
                              (planning_horizon_days / 7) * 100
            for v in range(len(vehicles))
        }
    }

# Example
tours = [
    {'name': 'City Highlights', 'duration_days': 1, 'min_pax': 10,
     'price_per_pax': 120, 'language': 'English', 'min_departures_per_month': 8},
    {'name': 'Wine Country', 'duration_days': 2, 'min_pax': 15,
     'price_per_pax': 250, 'language': 'English', 'min_departures_per_month': 4},
    {'name': 'Mountain Adventure', 'duration_days': 3, 'min_pax': 12,
     'price_per_pax': 450, 'language': 'English', 'min_departures_per_month': 4},
]

vehicles = [
    {'id': 'Bus_1', 'capacity': 45, 'type': 'motorcoach'},
    {'id': 'Bus_2', 'capacity': 45, 'type': 'motorcoach'},
    {'id': 'Van_1', 'capacity': 15, 'type': 'minibus'},
]

guides = [
    {'name': 'Guide_A', 'languages': ['English', 'Spanish']},
    {'name': 'Guide_B', 'languages': ['English', 'French']},
    {'name': 'Guide_C', 'languages': ['English', 'German']},
]

result = optimize_tour_schedule(tours, vehicles, guides, planning_horizon_days=30)
print(f"Total expected revenue: ${result['total_revenue']:,.0f}")
print(f"Tours scheduled: {len(result['schedule'])}")

Itinerary Optimization

Route Optimization for Multi-City Tours

def optimize_tour_itinerary(cities, attractions_per_city, total_days,
                           start_city, end_city):
    """
    Optimize tour itinerary to maximize attraction value while meeting constraints

    Parameters:
    - cities: list of cities with travel times between them
    - attractions_per_city: dict of {city: [attractions]}
    - total_days: tour duration
    - start_city: starting point
    - end_city: ending point (can be same as start)
    """
    from pulp import *

    prob = LpProblem("Itinerary_Optimization", LpMaximize)

    # Variables

    # x[c, d]: visit city c on day d
    x = {}
    for city in cities:
        for day in range(total_days):
            x[city['id'], day] = LpVariable(f"Visit_{city['id']}_{day}",
                                           cat='Binary')

    # y[a]: include attraction a
    y = {}
    for city_id, attractions in attractions_per_city.items():
        for attraction in attractions:
            y[attraction['id']] = LpVariable(f"Include_{attraction['id']}",
                                            cat='Binary')

    # Objective: maximize total attraction value/interest score
    total_value = lpSum([y[attraction['id']] * attraction['value']
                        for city_id, attractions in attractions_per_city.items()
                        for attraction in attractions])

    prob += total_value

    # Constraints

    # Must start at start_city on day 0
    prob += x[start_city, 0] == 1

    # Must end at end_city on last day
    prob += x[end_city, total_days - 1] == 1

    # Visit exactly one city per day
    for day in range(total_days):
        prob += lpSum([x[city['id'], day] for city in cities]) == 1

    # Can only visit attraction if we visit that city
    for city_id, attractions in attractions_per_city.items():
        # Days spent in this city
        days_in_city = lpSum([x[city_id, d] for d in range(total_days)])

        for attraction in attractions:
            # Can only include attraction if we spend time in city
            prob += y[attraction['id']] <= days_in_city

    # Time budget per day (8 hours for activities)
    for day in range(total_days):
        for city in cities:
            city_id = city['id']

            # If we visit city on this day
            if (city_id, day) in x:
                # Total time for attractions on this day
                time_spent = lpSum([y[attraction['id']] * attraction['hours']
                                   for attraction in attractions_per_city.get(city_id, [])
                                   if (city_id, day) in x])

                # Time constraint (only if visiting city)
                prob += time_spent <= 8 * x[city_id, day]

    # Solve
    prob.solve(PULP_CBC_CMD(msg=0))

    # Extract itinerary
    itinerary = []
    for day in range(total_days):
        for city in cities:
            if x[city['id'], day].varValue > 0.5:
                # Find attractions included for this city
                included_attractions = [
                    attraction['name']
                    for attraction in attractions_per_city.get(city['id'], [])
                    if y[attraction['id']].varValue > 0.5
                ]

                itinerary.append({
                    'day': day + 1,
                    'city': city['name'],
                    'attractions': included_attractions
                })

    return {
        'total_value': value(prob.objective),
        'itinerary': itinerary
    }

# Example
cities = [
    {'id': 'paris', 'name': 'Paris'},
    {'id': 'amsterdam', 'name': 'Amsterdam'},
    {'id': 'brussels', 'name': 'Brussels'},
]

attractions_per_city = {
    'paris': [
        {'id': 'eiffel', 'name': 'Eiffel Tower', 'value': 10, 'hours': 2},
        {'id': 'louvre', 'name': 'Louvre Museum', 'value': 9, 'hours': 4},
        {'id': 'notre_dame', 'name': 'Notre-Dame', 'value': 7, 'hours': 1.5},
    ],
    'amsterdam': [
        {'id': 'rijks', 'name': 'Rijksmuseum', 'value': 8, 'hours': 3},
        {'id': 'anne_frank', 'name': 'Anne Frank House', 'value': 9, 'hours': 2},
        {'id': 'canal_tour', 'name': 'Canal Tour', 'value': 6, 'hours': 1.5},
    ],
    'brussels': [
        {'id': 'grand_place', 'name': 'Grand Place', 'value': 7, 'hours': 1},
        {'id': 'atomium', 'name': 'Atomium', 'value': 6, 'hours': 2},
    ],
}

result = optimize_tour_itinerary(cities, attractions_per_city, total_days=5,
                                start_city='paris', end_city='paris')

print(f"Total value: {result['total_value']}")
for day_plan in result['itinerary']:
    print(f"Day {day_plan['day']}: {day_plan['city']} - {', '.join(day_plan['attractions'])}")

Demand Forecasting for Tours

Tour Booking Forecasting

def forecast_tour_bookings(historical_bookings, lead_times, seasonality,
                          special_events):
    """
    Forecast tour bookings considering booking pace and seasonality

    Factors:
    - Historical booking patterns
    - Lead time (when bookings are made)
    - Seasonality (high/low season)
    - Special events
    - Marketing campaigns
    """
    from sklearn.ensemble import GradientBoostingRegressor
    import pandas as pd

    df = historical_bookings.copy()

    # Time features
    df['departure_month'] = df['departure_date'].dt.month
    df['departure_day_of_week'] = df['departure_date'].dt.dayofweek
    df['booking_month'] = df['booking_date'].dt.month

    # Lead time (days before departure)
    df['booking_lead_days'] = (df['departure_date'] - df['booking_date']).dt.days

    # Seasonality
    high_season_months = [6, 7, 8, 12]
    df['is_high_season'] = df['departure_month'].isin(high_season_months).astype(int)

    # Special events
    df = df.merge(special_events, on='departure_date', how='left')
    df['has_special_event'] = df['event_type'].notna().astype(int)

    # Booking pace (bookings to date vs. same point last year)
    df['booking_pace'] = df['bookings_to_date'] / df['bookings_same_point_last_year']

    # Price features
    df['price_change_pct'] = (df['current_price'] - df['price_last_year']) / df['price_last_year']

    # Marketing
    df['marketing_spend'] = df.get('marketing_spend', 0)

    # Lag features
    df['bookings_last_departure'] = df.groupby('tour_id')['total_bookings'].shift(1)

    # Drop NaN
    df = df.dropna()

    # Features
    feature_cols = ['departure_month', 'departure_day_of_week',
                   'booking_lead_days', 'is_high_season', 'has_special_event',
                   'booking_pace', 'price_change_pct', 'marketing_spend',
                   'bookings_last_departure']

    X = df[feature_cols]
    y = df['total_bookings']

    # Train model
    model = GradientBoostingRegressor(n_estimators=100, learning_rate=0.1,
                                     max_depth=5, random_state=42)
    model.fit(X, y)

    return {
        'model': model,
        'train_r2': model.score(X, y),
        'feature_importance': dict(zip(feature_cols, model.feature_importances_))
    }

Group Series Management

Hotel Series Allocation

def optimize_hotel_series_allocation(tours, hotels, dates, room_types):
    """
    Optimize hotel room series (pre-bookings) for tour programs

    Series = Block of rooms held at contracted rates for tour season

    Parameters:
    - tours: list of tour products with expected departures
    - hotels: available hotels with contracted rates
    - dates: planning period
    - room_types: types of rooms needed
    """
    from pulp import *

    prob = LpProblem("Series_Allocation", LpMinimize)

    # Variables: commit to X rooms at hotel h for date d
    series_commitment = {}

    for h, hotel in enumerate(hotels):
        for d in dates:
            series_commitment[h, d] = LpVariable(
                f"Series_{h}_{d}",
                lowBound=0,
                cat='Integer'
            )

    # Objective: minimize total series cost (commitment × rate)
    total_cost = []

    for (h, d), var in series_commitment.items():
        hotel = hotels[h]
        # Series rate (typically 10-20% below BAR)
        series_rate = hotel['rack_rate'] * 0.85
        total_cost.append(var * series_rate)

    prob += lpSum(total_cost)

    # Constraints

    # Meet tour demand
    for d in dates:
        # Expected room nights needed on date d (from all tours)
        required_rooms = sum([
            tour['expected_pax'] / 2  # Assume double occupancy
            for tour in tours
            if d in tour['dates']
        ])

        # Total series allocation must meet demand
        prob += lpSum([series_commitment[h, d] for h in range(len(hotels))]) >= \
                required_rooms

    # Hotel series limits
    for h, hotel in enumerate(hotels):
        max_series = hotel.get('max_series_allocation', 50)

        for d in dates:
            prob += series_commitment[h, d] <= max_series

    # Solve
    prob.solve(PULP_CBC_CMD(msg=0))

    # Extract allocations
    allocations = []
    for (h, d), var in series_commitment.items():
        if var.varValue > 0:
            allocations.append({
                'hotel': hotels[h]['name'],
                'date': d,
                'rooms_committed': var.varValue,
                'rate': hotels[h]['rack_rate'] * 0.85
            })

    return {
        'total_cost': value(prob.objective),
        'allocations': pd.DataFrame(allocations)
    }

Tools & Libraries

Python Libraries

Optimization:

  • PuLP: Linear programming
  • OR-Tools: Route optimization
  • scipy.optimize: General optimization

Forecasting & Analytics:

  • scikit-learn: Machine learning
  • prophet: Time series forecasting
  • pandas, numpy: Data analysis

Geospatial:

  • geopy: Distance calculations
  • folium: Mapping and visualization

Commercial Software

Tour Operator Systems:

  • TourCMS: Tour operator CMS
  • Rezdy: Tour and activity booking platform
  • TourWriter: Tour itinerary and costing software
  • Ezus: Tour operator software
  • Bewotec: Tour operator ERP

Booking & Distribution:

  • Regiondo: Activity booking system
  • FareHarbor: Tour booking and ticketing
  • Peek: Tour and activity marketplace
  • Bokun: Tour distribution platform

Transportation Management:

  • Omnitracs: Fleet management
  • Samsara: Vehicle tracking and management
  • Verizon Connect: GPS fleet tracking

Finance & Operations:

  • QuickBooks: Accounting
  • Xero: Cloud accounting
  • TravelWorks: Tour accounting and operations

Common Challenges & Solutions

Challenge: Low Utilization / Empty Seats

Problem:

  • Tours departing with few passengers
  • High fixed costs spread over few pax
  • Low profitability

Solutions:

  • Dynamic departure minimums
  • Guaranteed departures for flagship tours
  • Private tour premiums
  • Last-minute promotions and discounts
  • Consolidation with other operators
  • Flexible itineraries (SIT vs. GIT)

Challenge: Seasonal Demand Fluctuations

Problem:

  • Extreme peaks and troughs
  • Underutilized resources in low season
  • Staff retention challenges

Solutions:

  • Diversified portfolio (year-round destinations)
  • Seasonal tour products
  • Dynamic pricing (high/low season)
  • Shoulder season promotions
  • Special interest tours in off-season
  • International market mix (opposite seasons)

Challenge: Supplier Rate Fluctuations

Problem:

  • Hotel and service costs changing
  • Currency fluctuations
  • Fuel costs impacting transportation

Solutions:

  • Series contracts (guaranteed rates)
  • Currency hedging
  • Fuel surcharge clauses
  • Multi-year contracts with escalation clauses
  • Diversified supplier base
  • Value engineering (alternative suppliers)

Challenge: Guide Quality & Availability

Problem:

  • Inconsistent guide quality
  • Guide shortages in peak season
  • Training and certification costs

Solutions:

  • Guide training programs
  • Quality monitoring and feedback
  • Tiered guide system (lead guides, assistants)
  • Freelance guide network
  • Guide scheduling optimization
  • Performance incentives

Output Format

Tour Operations Report

Executive Summary:

  • Tour portfolio performance
  • Key operational metrics
  • Profitability analysis
  • Strategic recommendations

Tour Performance:

Tour NameDeparturesPaxOccupancyRevenueCostMarginMargin %
City Highlights451,21560%$145,800$109,350$36,45025%
Wine Country1843280%$108,000$75,600$32,40030%
Mountain Adventure1232475%$145,800$102,060$43,74030%
Total751,97170%$399,600$287,010$112,59028%

Resource Utilization:

ResourceUtilizationAvailable DaysActive DaysIdle Days
Bus 185%907713
Bus 278%907020
Van 162%905634
Guide A92%90837
Guide B88%907911

Booking Pace (Next 60 Days):

Departure DateTourCurrent BookingsForecastStatus
2026-03-15City Highlights2835On Track
2026-03-20Wine Country824Soft - Promote
2026-03-25Mountain Adventure1827Good

Profitability by Tour Type:

CategoryRevenueCostMarginMargin %
Day Tours$145,800$109,350$36,45025%
Multi-Day Tours$253,800$177,660$76,14030%
Total$399,600$287,010$112,59028%

Action Items:

  1. Increase marketing spend for Wine Country tour (March departures)
  2. Negotiate better hotel rates in Rome (15% of tour cost)
  3. Add Bus 3 to fleet for summer season (June-August)
  4. Develop new shoulder-season product (April-May)
  5. Implement dynamic pricing for City Highlights

Questions to Ask

If you need more context:

  1. What type of tour operator? (inbound, outbound, DMC, ground handler)
  2. What tours are in the portfolio? (types, durations, volumes)
  3. What resources do you manage? (vehicles, guides, hotels)
  4. What are the primary challenges? (profitability, utilization, operations)
  5. What systems are in place? (booking, operations, accounting)
  6. What's the competitive environment and positioning?
  7. What are the seasonal patterns?

Related Skills

  • hotel-inventory-management: For hotel accommodation management
  • route-optimization: For transportation routing
  • hospitality-procurement: For purchasing and supplier management
  • demand-forecasting: For booking forecasting
  • seasonal-planning: For seasonal demand management
  • airline-cargo-optimization: For air transportation
  • cruise-supply-chain: For cruise operations
  • fleet-management: For vehicle fleet management

平台分布

Codex

33.84%
按下载量换算38

Claude

30.22%
按下载量换算34

Cursor

18.09%
按下载量换算20

Gemini CLI

9.16%
按下载量换算10

安全审计

Gen Agent Trust Hub

通过

Socket

通过

Snyk

通过

权限和风险

只读

该 Skill 主要提供规则、说明或参考内容,本身偏只读;真正读写文件、联网或执行命令仍取决于宿主 Agent 的任务。

安装前确认

本站仅展示第三方公开信息,不托管安装包,不提供自动安装或运行环境。安装前应自行审查源码、依赖和命令行为。目前只有一个公开来源,建议同时核对源仓库。

继续浏览同类 Skills