c语言实现模拟电梯调度算法代码

以下是一个简单的模拟电梯调度算法的 C 语言代码示例：

#include <stdio.h>
#include <stdlib.h>

#define MAX_FLOORS 20
#define MAX_ELEVATORS 5

typedef struct elevator {
    int id;
    int current_floor;
    int direction; // 0: 停止, 1: 上行, -1: 下行
    int requests[MAX_FLOORS + 1]; // 等待服务的请求
    int num_requests;
} Elevator;

typedef struct elevator_controller {
    Elevator elevators[MAX_ELEVATORS];
    int num_elevators;
} ElevatorController;

void init_elevator(Elevator *elevator, int id) {
    elevator->id = id;
    elevator->current_floor = 1;
    elevator->direction = 0;
    elevator->num_requests = 0;
    for (int i = 0; i <= MAX_FLOORS; i++) {
        elevator->requests[i] = 0;
    }
}

void add_request(Elevator *elevator, int floor) {
    // 将请求加入电梯的请求队列中
    if (!elevator->requests[floor]) {
        elevator->requests[floor] = 1;
        elevator->num_requests++;
    }

    // 根据请求方向调整电梯运行方向
    if (elevator->direction == 0) {
        elevator->direction = floor > elevator->current_floor ? 1 : -1;
    }
}

void move(Elevator *elevator) {
    // 根据当前方向移动电梯
    elevator->current_floor += elevator->direction;
}

void serve_request(Elevator *elevator) {
    // 处理当前楼层的请求
    if (elevator->requests[elevator->current_floor]) {
        elevator->requests[elevator->current_floor] = 0;
        elevator->num_requests--;
    }
}

int should_stop(Elevator *elevator) {
    // 判断是否需要在当前楼层停下
    if (elevator->requests[elevator->current_floor]) {
        return 1;
    }
    if (elevator->direction == 1) {
        for (int i = elevator->current_floor + 1; i <= MAX_FLOORS; i++) {
            if (elevator->requests[i]) {
                return 0;
            }
        }
        return 1;
    }
    if (elevator->direction == -1) {
        for (int i = elevator->current_floor - 1; i >= 1; i--) {
            if (elevator->requests[i]) {
                return 0;
            }
        }
        return 1;
    }
    return 0;
}

void run_elevator(Elevator *elevator) {
    // 运行电梯直到没有请求
    while (elevator->num_requests > 0) {
        serve_request(elevator);
        if (should_stop(elevator)) {
            elevator->direction = 0;
        } else {
            move(elevator);
        }
    }
}

void init_controller(ElevatorController *controller, int num_elevators) {
    controller->num_elevators = num_elevators;
    for (int i = 0; i < num_elevators; i++) {
        init_elevator(&controller->elevators[i], i);
    }
}

void add_request_to_controller(ElevatorController *controller, int floor) {
    // 选择离请求最近的电梯来服务该请求
    Elevator *elevator = NULL;
    int min_distance = MAX_FLOORS;
    for (int i = 0; i < controller->num_elevators; i++) {
        int distance = abs(controller->elevators[i].current_floor - floor);
        if (distance < min_distance) {
            elevator = &controller->elevators[i];
            min_distance = distance;
        }
    }
    add_request(elevator, floor);
}

void run_controller(ElevatorController *controller) {
    // 运行所有电梯
    for (int i = 0; i < controller->num_elevators; i++) {
        run_elevator(&controller->elevators[i]);
    }
}

int main() {
    ElevatorController controller;
    init_controller(&controller, 2);

    // 添加请求
    add_request_to_controller(&controller, 5);
    add_request_to_controller(&controller, 10);
    add_request_to_controller(&controller, 3);
    add_request_to_controller(&controller, 15);

    // 运行调度算法
    run_controller(&controller);

    return 0;
}

在这个示例中，`Elevator` 结构体表示一个电梯，包含了当前楼层、运行方向和等待服务的请求等信息，而 `ElevatorController` 结构体则负责将新请求分配给最近的空闲电梯，并运行所有电梯直到所有请求都得到服务。算法的具体实现是每次选择距离请求最近的电梯，并根据当前请求和电梯状态来调整电梯运行方向和停靠位置。