使用C++实现电梯调度算法

电梯调度算法是一种优化电梯运行的算法，通常用于多层建筑物中的电梯调度。下面是使用C++实现电梯调度算法的示例代码。

#include <iostream>
#include <queue>
#include <vector>
using namespace std;

class Elevator {
public:
    int current_floor;
    int direction;
    int capacity;
    int max_floor;
    vector<int> requests;

    Elevator(int max_floor, int capacity) {
        this->current_floor = 1;
        this->direction = 1;
        this->capacity = capacity;
        this->max_floor = max_floor;
        this->requests = vector<int>(max_floor + 1, 0);
    }

    void add_request(int floor) {
        this->requests[floor] = 1;
    }

    bool is_full() {
        int count = 0;
        for (int i = 1; i <= max_floor; i++) {
            if (requests[i] == 1) count++;
        }
        return count >= capacity;
    }

    bool has_request() {
        for (int i = 1; i <= max_floor; i++) {
            if (requests[i] == 1) return true;
        }
        return false;
    }

    void move() {
        if (direction == 1) {
            current_floor++;
        } else {
            current_floor--;
        }
    }

    void serve_requests() {
        while (has_request()) {
            if (requests[current_floor] == 1) {
                cout << "Stopping at floor " << current_floor << endl;
                requests[current_floor] = 0;
            }
            move();
        }
        if (direction == 1) {
            direction = -1;
        } else {
            direction = 1;
        }
    }
};

class ElevatorSystem {
public:
    int num_elevators;
    int max_floor;
    int capacity;
    vector<Elevator> elevators;

    ElevatorSystem(int num_elevators, int max_floor, int capacity) {
        this->num_elevators = num_elevators;
        this->max_floor = max_floor;
        this->capacity = capacity;
        this->elevators = vector<Elevator>(num_elevators, Elevator(max_floor, capacity));
    }

    void add_request(int floor) {
        int min_distance = max_floor;
        int min_index = 0;
        for (int i = 0; i < num_elevators; i++) {
            int distance = abs(elevators[i].current_floor - floor);
            if (distance < min_distance && !elevators[i].is_full()) {
                min_distance = distance;
                min_index = i;
            }
        }
        elevators[min_index].add_request(floor);
    }

    void run() {
        while (true) {
            for (int i = 0; i < num_elevators; i++) {
                elevators[i].serve_requests();
            }
        }
    }
};

int main() {
    ElevatorSystem elevator_system(2, 10, 8);
    elevator_system.add_request(3);
    elevator_system.add_request(5);
    elevator_system.add_request(7);
    elevator_system.run();
    return 0;
}

该代码中定义了Elevator类和ElevatorSystem类，其中Elevator类表示一个电梯，它有当前楼层、运行方向、容量、最大楼层数和请求列表等属性，以及添加请求、判断是否满载、判断是否有请求、运动和服务请求等方法。ElevatorSystem类表示整个电梯系统，它有电梯数量、最大楼层数、容量和电梯列表等属性，以及添加请求和运行等方法。

在main函数中，首先创建一个ElevatorSystem对象，然后添加请求，最后调用run方法运行电梯系统。

该代码实现了简单的电梯调度算法，当有新的请求时，它会选取距离最近且未满载的电梯来服务请求。每个电梯会持续服务请求直到请求列表为空，然后改变运行方向并等待新的请求。