期末项目：Capacitated Facility Location Problem

最新推荐文章于 2023-03-12 15:23:49 发布
最新推荐文章于 2023-03-12 15:23:49 发布
阅读量300 收藏
点赞数
分类专栏： 算法作业
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/L_Realoo/article/details/85421162
版权

题目

在这里插入图片描述
在这里插入图片描述

代码

import random
import math
import datetime
import os
import time

INSTANCE_NUMBER = 71
LOOP_LENGTH = 1000
MAX_TEMPERATURE = 100
MIN_TEMPERATURE = 0.5
ATTENUATION_QUOTIENT = 0.9

MAX_NUM = 100000000

class CFLP:

    def __init__(self, filename): # f means facility, c means customer
        self.filename = filename
        self.f_num = 0
        self.c_num = 0
        self.f_capacity = []
        self.f_open_cost = []
        self.c_demand = []
        self.distance_to_f = []
        self.read_file()

        self.f_open_list = [0]*self.f_num
        self.c_allocation = []

        self.total_cost = 0

        self.temperature = MAX_TEMPERATURE

    def read_file(self):
        fp = open(self.filename)
        problem_size = fp.readline().split()
        self.f_num = int(problem_size[0])
        self.c_num = int(problem_size[1])

        for i in range(0, self.f_num):
            f_info = fp.readline().split()
            self.f_capacity.append(int(f_info[0]))
            self.f_open_cost.append(int(f_info[1]))

        while len(self.c_demand) < self.c_num:
            demand_info = fp.readline().split()
            for i in range(0, len(demand_info)):
                self.c_demand.append(float(demand_info[i]))

        distance_infos = []
        while len(distance_infos) < self.f_num:
            distance_info = []
            while len(distance_info) < self.c_num:
                temp = fp.readline().split()
                for i in range(0, len(temp)):
                    distance_info.append(float(temp[i]))
            distance_infos.append(distance_info)

        for i in range(0, self.c_num):
            temp_distance = []
            for j in range(0, self.f_num):
                temp_distance.append(distance_infos[j][i])
            self.distance_to_f.append(temp_distance)

    def init_alloc_c(self):
        for i in range(0, self.c_num):
            while True:
                choose_f = random.randint(0, self.f_num-1)
                if self.f_capacity[choose_f] >= self.c_demand[i]:
                    if self.f_open_list[choose_f] == 0:
                        self.total_cost += self.f_open_cost[choose_f]
                    self.f_open_list[choose_f] += 1
                    self.f_capacity[choose_f] -= self.c_demand[i]
                    self.total_cost += self.distance_to_f[i][choose_f]

                    self.c_allocation.append(choose_f)
                    break

    def local_change_f(self): # 局部搜索版移动顾客
        while True:
            choose_c = random.randint(0, self.c_num-1)
            choose_f = random.randint(0, self.f_num-1)
            if self.c_allocation[choose_c] == choose_f:
                continue
            if self.f_capacity[choose_f] < self.c_demand[choose_c]:
                continue
            # 总花费对比
            allocated_f_before = self.c_allocation[choose_c]
            cost_before = self.distance_to_f[choose_c][allocated_f_before]
            if self.f_open_list[allocated_f_before] == 1:
                cost_before += self.f_open_cost[allocated_f_before]
            cost_after = self.distance_to_f[choose_c][choose_f]
            if self.f_open_list[choose_f] == 0:
                cost_after += self.f_open_cost[choose_f]
            if cost_before <= cost_after:
                return False

            self.f_capacity[allocated_f_before] += self.c_demand[choose_c]
            self.f_capacity[choose_f] -= self.c_demand[choose_c]

            self.f_open_list[allocated_f_before] -= 1
            self.f_open_list[choose_f] += 1

            self.c_allocation[choose_c] = choose_f
            self.total_cost = self.total_cost - cost_before + cost_after

            return True

    def annealing_change_f(self): # 退火版
        while True:
            choose_c = random.randint(0, self.c_num-1)
            choose_f = random.randint(0, self.f_num-1)
            if self.c_allocation[choose_c] == choose_f:
                continue
            if self.f_capacity[choose_f] < self.c_demand[choose_c]:
                continue
            allocated_f_before = self.c_allocation[choose_c]
            cost_before = self.distance_to_f[choose_c][allocated_f_before]
            if self.f_open_list[allocated_f_before] == 1:
                cost_before += self.f_open_cost[allocated_f_before]
            cost_after = self.distance_to_f[choose_c][choose_f]
            if self.f_open_list[choose_f] == 0:
                cost_after += self.f_open_cost[choose_f]
            # 不能退火
            if cost_before <= cost_after and \
                    random.random() > math.exp((cost_before - cost_after)/self.temperature):
                return False
            self.f_capacity[allocated_f_before] += self.c_demand[choose_c]
            self.f_capacity[choose_f] -= self.c_demand[choose_c]
            self.f_open_list[allocated_f_before] -= 1
            self.f_open_list[choose_f] += 1
            self.c_allocation[choose_c] = choose_f
            self.total_cost = self.total_cost - cost_before + cost_after

            return True

    def write_file(self, method):
        if method == 1:
            fp = open('Local Search/' + self.filename.split('/')[1], 'w')
        elif method == 2:
            fp = open('Simulated Annealing Search/' + self.filename.split('/')[1], 'w')
        fp.write(str(self.total_cost) + '\n')
        for i in range(0, self.f_num):
            if self.f_open_list[i] != 0:
                fp.write('1 ')
            else:
                fp.write('0 ')
        fp.write('\n')
        for i in range(0, self.c_num):
            fp.write(str(self.c_allocation[i]) + ' ')

    def LocalSearchSolve(self):
        self.init_alloc_c()
        print('使用局部搜索，初始分配方案花费：', self.total_cost)
        for i in range(0, 100*LOOP_LENGTH):
            if self.local_change_f():
                print('使用局部搜索，第', i, '循环 ','花费：', self.total_cost)
        self.write_file(1)
        return self.total_cost

    def AnnealingSolve(self):
        self.init_alloc_c()
        print('使用模拟退火，初始分配方案花费：', self.total_cost)
        while self.temperature > MIN_TEMPERATURE:
            for i in range(0, LOOP_LENGTH):
                if self.annealing_change_f():
                    print('使用模拟退火，当前温度：', self.temperature, '，第', i, '循环 ', '花费:', self.total_cost)
            self.temperature *= ATTENUATION_QUOTIENT
        self.write_file(2)
        return self.total_cost

def __main__():
    command = input('请输入您想使用的算法：')
    write_file_name = ''
    if command == '1':
        write_file_name = 'Local Search'
    elif command == '2':
        write_file_name = 'Simulated Annealing'
    fp = open(write_file_name, 'a')
    if os.stat(write_file_name).st_size == 0:
        fp.write(''.ljust(10) + 'Result'.ljust(20) + 'Time(s)\n')

    for i in range(1, INSTANCE_NUMBER+1):
        filename = 'Instances/p' + str(i)
        res = 0
        start_time = datetime.datetime.now()
        solution = CFLP(filename)
        if command == '1':
            res = solution.LocalSearchSolve()
        elif command == '2':
            res = solution.AnnealingSolve()
        end_time = datetime.datetime.now()
        fp.write(('p' + str(i)).ljust(10) + str(res).ljust(20) + str((end_time - start_time).seconds) + '\n')

结果

local search
          Result              Time(s)
p1        10468.0             0
p2        8566.0              0
p3        10095.0             0
p4        12100.0             0
p5        9901.0              0
p6        8663.0              0
p7        10365.0             0
p8        12368.0             0
p9        8836.0              0
p10       7726.0              0
p11       9583.0              0
p12       11454.0             0
p13       9875.0              0
p14       8429.0              0
p15       9804.0              0
p16       12662.0             0
p17       10581.0             0
p18       7396.0              0
p19       10921.0             0
p20       13971.0             0
p21       10197.0             0
p22       8380.0              0
p23       10700.0             0
p24       11569.0             0
p25       15791.0             0
p26       13558.0             0
p27       16148.0             0
p28       18722.0             0
p29       15286.0             0
p30       13716.0             0
p31       16532.0             0
p32       19311.0             0
p33       16470.0             0
p34       12727.0             0
p35       16456.0             0
p36       19165.0             0
p37       15635.0             0
p38       13056.0             0
p39       16449.0             0
p40       17772.0             0
p41       7158.0              0
p42       8216.0              0
p43       8084.0              0
p44       7545.0              0
p45       8151.0              0
p46       7667.0              0
p47       7001.0              0
p48       7549.0              0
p49       6209.0              0
p50       10002.0             0
p51       9738.0              0
p52       10164.0             0
p53       10849.0             0
p54       9936.0              0
p55       10103.0             0
p56       23359.0             0
p57       31983.0             0
p58       50192.0             0
p59       37773.0             0
p60       23505.0             0
p61       31218.0             0
p62       51641.0             0
p63       38067.0             0
p64       23438.0             0
p65       32198.0             0
p66       51364.0             0
p67       36808.0             0
p68       23597.0             0
p69       32359.0             0
p70       51337.0             0
p71       36390.0             0

p1
10468.0
1 1 1 1 1 1 1 1 0 1 
0 2 1 6 3 0 2 4 4 1 9 3 3 2 0 1 4 0 9 7 3 4 6 4 2 5 3 5 3 5 2 6 0 3 9 4 4 1 2 4 5 0 3 5 7 0 4 0 4 0 

p2
8566.0
1 1 1 1 1 1 1 1 1 1 
8 8 1 6 3 0 2 4 4 1 9 0 3 2 0 3 4 0 9 7 3 8 6 4 2 5 3 5 0 5 2 6 0 3 9 4 4 3 0 4 3 0 1 5 7 0 4 0 4 1 

p3
10095.0
1 0 1 1 1 1 1 0 1 1 
8 2 5 6 3 8 2 4 4 5 9 0 3 2 0 3 4 0 9 4 2 8 6 4 2 5 3 5 0 5 2 6 0 3 9 4 4 3 0 4 5 8 3 5 4 3 4 0 4 0 

p4
12100.0
1 1 1 1 1 1 1 1 1 1 
0 8 1 6 3 8 2 4 4 1 9 8 3 2 8 3 4 0 9 7 3 4 6 4 2 5 1 5 3 5 2 6 0 3 9 4 4 3 0 4 1 8 1 5 7 0 4 0 4 0 

p5
9901.0
1 1 1 1 1 1 1 1 1 1 
4 8 1 6 3 8 2 4 2 1 9 8 3 2 8 3 4 8 9 7 3 8 6 7 2 5 1 5 0 5 2 6 0 0 9 4 7 3 0 4 1 8 1 5 7 0 4 0 7 3 

annealing
          Result              Time(s)
p1        8916.0              5
p2        8027.0              6
p3        9385.0              5
p4        10765.0             5
p5        8900.0              7
p6        7821.0              7
p7        9720.0              8
p8        11291.0             8
p9        8483.0              5
p10       7626.0              5
p11       9458.0              5
p12       10427.0             5
p13       8413.0              4
p14       7137.0              4
p15       9177.0              4
p16       11054.0             4
p17       8489.0              4
p18       7125.0              5
p19       8988.0              4
p20       10896.0             4
p21       8114.0              4
p22       7154.0              4
p23       9430.0              4
p24       10614.0             4
p25       12251.0             6
p26       11037.0             6
p27       13533.0             6
p28       15707.0             6
p29       13364.0             7
p30       11900.0             6
p31       13667.0             6
p32       18616.0             6
p33       12427.0             6
p34       11287.0             6
p35       13499.0             6
p36       15006.0             6
p37       12201.0             6
p38       10986.0             7
p39       12985.0             6
p40       14985.0             6
p41       6929.0              10
p42       6542.0              8
p43       6090.0              7
p44       7177.0              9
p45       7540.0              8
p46       6385.0              6
p47       6345.0              10
p48       6288.0              9
p49       6175.0              6
p50       8973.0              10
p51       8112.0              7
p52       9393.0              9
p53       8782.0              7
p54       9018.0              11
p55       7939.0              8
p56       22751.0             5
p57       29681.0             5
p58       44197.0             4
p59       33951.0             5
p60       22665.0             4
p61       28185.0             5
p62       43615.0             5
p63       33479.0             5
p64       22357.0             5
p65       28981.0             5
p66       42186.0             5
p67       32224.0             4
p68       22920.0             5
p69       28815.0             5
p70       44530.0             4
p71       33712.0             5

p1
8916.0
1 1 1 1 1 0 1 0 1 1 
2 2 1 6 3 8 2 4 4 1 9 8 3 2 8 3 4 0 9 4 3 8 6 4 2 6 1 6 0 1 2 6 0 3 9 4 4 3 0 4 3 8 1 6 4 0 4 0 4 0 

p2
8027.0
1 1 1 1 1 0 1 0 1 0 
0 2 1 6 3 8 2 4 4 1 4 8 3 2 8 3 4 0 6 4 3 8 6 4 2 6 1 6 0 1 2 6 0 3 2 4 4 3 0 4 2 8 1 6 4 0 2 0 4 3 

p3
9385.0
1 1 1 1 1 0 1 0 1 0 
2 8 1 6 3 8 2 4 4 1 4 8 3 2 8 3 2 0 6 4 3 4 6 4 2 6 1 6 0 1 2 6 0 3 4 4 4 3 0 4 3 8 1 6 4 0 2 0 4 0 

p4
10765.0
1 1 1 1 1 0 1 0 1 0 
8 2 1 6 3 8 2 4 4 1 4 8 3 2 0 3 2 0 6 4 3 4 6 4 2 6 1 6 0 1 2 6 0 3 4 4 4 3 0 4 3 8 1 6 4 0 2 0 4 0 

p5
8900.0
1 1 1 1 1 0 1 0 1 1 
8 8 1 6 1 8 2 4 4 1 9 8 0 2 8 3 2 0 9 4 3 8 6 4 2 6 1 1 0 1 2 6 0 3 9 9 4 3 0 4 1 8 1 6 4 0 9 0 4 3
L_Realoo
关注
专栏目录
Capacitated Facility Location Problem
Vilin的博客
12-22 1746
Capacitated Facility Location Problem 题目 要求 Suppose there are n facilities and m customers. We wish to choose: which of the n facilities to open. the assignment of customers to facilities. The objec...
Project:Capacitated Facility Location Problem：（一）贪心算法
weixin_43142208的博客
12-25 233
Capacitated Facility Location Problem Suppose there are n facilities and m customers. We wish to choose: which of the n facilities to open the assignment of customers to facilities The objective is t...
[算法Project] Capacited Facility Location Problem
Skywalker1111的博客
12-23 528
这次博客的内容是关于我们算法课程的期末project：Capacited Facility Location Problem。我使用的是python语言求解。这道题乍一看像是一个线性规划问题，但最终我还是选择了贪心算法以及模拟退火算法。源代码即各种数据可见：github项目地址 文章目录一、问题描述二、问题分析三、贪心算法四、模拟退火(SA) 一、问题描述 二、问题分析 首先，我们看看这个问...
[算法期末项目] Capacitated Facility Location Problem
Mrfive555的博客
12-23 468
题目 给定m个工厂和n个用户,每个用户有一定的需求,并将需要被指定(assign)给某一个工厂,但工厂的承载量时有限的,被指定给某一个工厂的用户的需求总和不能超过工厂的容量(capacity).工厂的开启和用户的指定都有花费.现在我们设计一个工厂开启和用户分配的方案,需要最小化工厂开启和用户分配的花费. 思路 算法框架 这题是一个组合优化问题,在不超过工厂容量的情况下,每一个用户都可以分配到不同的...
算法设计与分析项目——Capacitated Facility Location Problem
xun6838的博客
12-22 616
算法设计与分析项目——Capacitated Facility Location Problem 目录 算法设计与分析项目——Capacitated Facility Location Problem 问题详情 问题建模 算法设计 贪心算法 模拟退火算法 数据结构 代码实现 数据类Data： 贪心算法类Greedy： 模拟退火算法类Sa： 程序入口类main： 结果展示...
算法project——Capacitated Facility Location Problem
diceroller的博客
12-22 771
Capacitated Facility Location Problem是一个NP难的问题，为了在有限的时间内解决这个问题，我采用了两种启发式算法来解决它。第一种是模拟退火算法，第二种是禁忌搜索算法。两种算法应该说各有千秋。 下面是Capacitated Facility Location Problem的大致内容：  Suppose there are n facilities and m...
2020-5-A biased randomised algorithm for the capacitated facility location problem with soft constraints.pdf
08-16
biased-randomised algorithm for the capacitated facility location problem with soft constraints 在运筹学领域中，设施位置问题（Facility Location Problem，FLP）是一个经典的优化问题。它的目标是确定设施...
Capacitated Facility Location Problem容量有限设施选址问题
Runner1st的博客
12-21 2033
Capacitated Facility Location Problem 问题如下 给出所有工厂的容量和开工厂的成本，所有客户的需求，以及客户分配给某个工厂的的分配成本，要求解的问题是：找出一个分配方案，使得总成本最低。 算法思路 思路一：贪心 容易想到的是，从每个用户的角度出发，要使得总成本最小的话，则可以每个用户选择设施的时候都贪心选择一个成本最低的设施。一开始我想的是所有设施都先不开...
【算法项目】Capacitated Facility Location Problem
hcm_0079的博客
12-20 890
Capacitated Facility Location Problem 问题描述 Suppose there are n facilities and m customers. We wish to choose: which of the n facilities to open the assignment of customers to facilities Note： The o...
算法期末项目--Capacitated Facility Location Problem
cjinchan的博客
12-30 266
题目 Suppose there are n facilities and m customers. We wish to choose: (1) which of the n facilities to open (2) the assignment of customers to facilities The objective is to minimize the sum of the op...
算法设计与分析project（Capacitated Facility Location Problem）
ousuixin的博客
12-22 641
github项目 该project项目的： （1）71个测例 （2）源代码 （3）71个测例的计算结果存储文件（包括 分配方案总花费-运行时间表 和 每个测例的具体分配方案 ） 都能在我的github上获取 问题描述 这是有容量限制的工厂选址问题： （1）我们需要从待选的n个工厂中选择k个工厂来开放给用户使用 （2）我们需要将N个用户分配到k个开放的工厂 （3）要求分配到某个工厂的全部用户的需求...
算法设计期末项目：Capacitated Facility Location Problem
ZTao-z的博客
12-23 420
题目描述 Suppose there are n facilities and m customers. We wish to choose: （1）which of the n facilities to open. （2）the assignment of customers to facilities. （3）The objective is to minimize the sum of t...
Capacitated Facility Location Problem贪心算法实现
huang_wx的博客
12-30 259
问题描述 给定Ñ个工厂和米个顾客，开工厂需要一定的费用，一个工厂有一定的容量限制，每个顾客也有一定的需求，而每个顾客要选取某个工厂也需要一定的分配费用，现在要求找出一个分配方案，把顾客分配给不同的工厂，然后在可以满足所有顾客需求的前提下让所有的花费（开工厂的花费和分配的花费）最小。 问题分析： 解决思路 设集合I = {1，...，m}是所有设施 集合J = {1，...，n}是...
使用多种贪心和模拟退火算法求解Capacitated Facility Location Problem问题
羊城迷鹿的博客
12-21 653
文章目录题目描述数据集文件结构 题目描述 Suppose there are n facilities and m customers. We wish to choose: (1) which of the n facilities to open (2) the assignment of customers to facilities The objective is to mini...
2022-08-12-2023-03-10+ 关于仓库选址问题解决历程 (the uncapacitated facility location problem )
weixin_51745630的博客
03-12 4189
自2022年8月12日至2023年3月10日+的时间内，参加了院内的组合优化方向研究组，我致力于完成优化the uncapacitated facility location problem（UFLP）问题，以下是我的工作内容发展过程以及该工作结束后的总结反思。
python进行文档抽取与解析的简单实现
enjoyhot的专栏
01-18 3156
python进行文档抽取与解析的简单实现
generate a python script for Capacitated Vehicle Routing Problem (CVRP)
最新发布
06-05
Here is a basic implementation of CVRP in Python using ...Note that this is just a basic implementation and can be modified to suit specific requirements and constraints of individual problem instances.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值