Search - optimal location

Search - optimal location - List

[Data structs] guandao DL : 0: 某石油公司计划建造一条由东向西的主输油管道，这条管道要穿过n口油井的油田，每口油井通过一条次管道沿最短路径（或南或北）直接与主管道相连。就n口油井分布的一般位置，试确定主管道位置，使得各油井到主管道的输油管道长度总和达到最小。并验证可在线性时间内确定主管道的最优位置。-An oil company plans to build a from east to west of the main oil pipeline, this pipeline to pass through n wells of oil fields, oil wells in every through a second pipeline along the shortest path (or South or North) directly connected with the competent Road. Wells on the n distribution of the general location, test to determine the competent Road location, making the well-to-charge of Road to minimize the sum of the length of pipeline. And verify that the linear time can be in charge of Road to determine the optimal location.
Date : 2025-12-24 Size : 1kb User : me
[Data structs] shuyouguandao DL : 0: 问题描述：某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定n口油井的位置,即它们的x 坐标（东西向）和y 坐标（南北向）,应如何确定主管道的最优位置,即使各油井到主管道之间的输油管道长度总和最小的位置? 编程任务：给定n 口油井的位置,编程计算各油井到主管道之间的输油管道最小长度总和。-Problem Description: A oil company plans to build a main oil pipeline from east to west. The pipeline must pass through a n wells in oil fields. From each of wells must have an oil pipeline along the Shortest Path (or the South or North) and the director of Road connected. If for a given n the location of wells, that is, their x coordinates (east-west) and y coordinates (north-south), should be how to determine the optimal position in charge of Road, even though the well-to-head Road, the length of the pipeline between the sum of the minimum position? programming tasks: Given the location of wells n, programming calculate their well-to-head Road, the minimum length of the pipeline between the sum of.
Date : 2025-12-24 Size : 7kb User : 李东
[Data structs] jiayouzhanwenti DL : 0: 一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution
Date : 2025-12-24 Size : 3kb User : maweiwei
[Data structs] matlabyiqunsuanfa DL : 1: 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of optimization problems to solve new general heuristic method, which has a positive feedback, distributed computing and constructive and the greedy heuristic search features. Through the establishment of an appropriate mathematical model, over-current fault-based distribution network fault location into a nonlinear global optimization problem.
Date : 2025-12-24 Size : 3kb User : prince
[Data structs] 1(2) DL : 0: 分支限界法之布线问题一、要求： 1、输入电路板区域n*m以及布线的起始位置和结束位置； 2、输出布线方案； 3、可以使用c或者vc实现二、问题分析及实验原理：在n*m的方格阵列中存在封锁区域（布线时必须绕开的区域），找到起始位置到目标位置的最短路径。从目标位置开始向起始位置回溯，逐步构造最优解。每次向标记距离比当前方格标记距离少1的相邻方格移动，直到到达起始方格为止。-Branch and bound method of a wiring problem, requirement: 1, enter the circuit board wiring region n* m and the start position and end position 2, output routing program 3, you can use c or vc achieve two, the analysis and experimental principle : n* m in the box in the array block area there (wiring must be bypassed in the region), the starting position to the target location to find the shortest path. Starting from the target location back to the starting position, and gradually construct the optimal solution. To mark each box marked distance from the current less than 1 in its adjacent cells move up until you reach the starting grid.
Date : 2025-12-24 Size : 1kb User : 杨博文
[Data structs] shiyan4 DL : 0: 使用贪心法实现最优加油问题，给定距离可加油站的位置及距离，确定加油站的次序！-Using the greedy method to achieve optimal fuel problem, given the location and distance from the station to determine the order of the gas station!
Date : 2025-12-24 Size : 1kb User : wenjie
[Data structs] 3 DL : 0: 根据题目可分析：假设主管道位于所有管道的东侧（或是西侧），则测得个油井到主管道之间的输油管道总长度为sum1，若主管道的位置位于所有管道纵坐标的中位值，其输油管道总长度为sum2。由此可推算出sum1>=sum2。因此我采用第二个思路，进而将问题转化为求n个数中第k大数是什么的问题。总的输油管道长度可通过每个输油管道的纵坐标减中位值得到，最后即可解决问题。根据题目要求，需在线性时间内确定主管道的最优位置。在排序算法中，最优的便是快速排序，而根据题目要求，我们又不需要将所有n个数进行排序，因此可以采用快速排序的思想，达到目的。(According to the subject analysis, it is assumed that the chief pipeline is located on the east side of all pipes (or the west side), the total length of the oil pipeline between the oil well and the main pipe is sum1. If the position of the main pipe is located in the middle of all the longitudinal coordinates of the pipe, the total length of the pipeline is sum2. Thus, sum1>=sum2 can be calculated. So I use second ideas to transform the problem into the problem of finding K number in N numbers. The length of the total oil pipeline can be obtained by reducing the median value of each oil pipeline, and finally, it can solve the problem. According to the requirements of the subject, we need to determine the optimal location of the main pipeline in a linear time. In the sorting algorithm, the best is the fast sorting, and according to the title, we do not need to sort all the N numbers, so we can use the idea of fast sorting to achieve the goal.)
Date : 2025-12-24 Size : 592kb User : 鲸鱼和机遇