论文部分内容阅读
将垃圾收运系统中收运小车一天的收运计划问题,分为停车场设在转运站或别处两种情况,以小车行走总距离最小为目标,分别构建了混合整数规划模型.接着提出问题的求解思路:当停车场设在转运站时,可以将问题转化为VRP问题求解;若停车场设在别处,在求解上一问题的基础上设计了最近回路节点插入法将停车场插入离其最近的回路节点即可.最后以实例验证了模型和求解思路的可行性和有效性.
The collection and delivery system in the collection and delivery system of the day car collection and delivery problems are divided into parking lot located at the transfer station or elsewhere in two cases, the minimum distance traveled by the car as the goal, respectively, to build a mixed integer programming model. : When the parking lot is located at the transfer station, the problem can be transformed into VRP problem solving; if the parking lot is located elsewhere, based on the solution to the previous problem, the nearest loop node insertion method is designed to insert the parking lot away from it The nearest loop nodes can be.Finally, an example is given to verify the feasibility and effectiveness of the model and the solution.