本次加拿大代写主要为Java算法相关的assignment
问题陈述
在这个任务中，你作为一名专业工程师需要模拟一个国家的交付过程和计划，以帮助你的朋友缩短他们的交付时间。
基本要求
让我们从我们将在这个问题上下文中使用的所有术语的定义开始。客户是具有特定需求的实体，因此需要车辆的存在，一个可以在客户和仓库之间移动的单元，一个最初拥有客户需求的单元。所有车辆都具有容量，它们只能容纳一定最大容量的货物（客户的需求）。在仓库和客户之间移动车辆需要一定的成本。路线是特定车辆访问的客户的序列，起点和终点在站点，而游览是所有车辆的路线列表，以满足所有客户的需求。
你可以把这个问题的底层结构想象成一个完整的无向图 G(V, E)。上面的图 1 给出了一个简单的可视化。
Problem Statement
In this assignment, you as a professional engineer are requested to simulate the delivery process and planning in a country to help your friend shorten their delivery time.
Basic Requirements
Let us start with definitions of all terms we are going to use in this problem context. A customer is an entity that has a certain demand and therefore requires the presence of a vehicle, a unit that can move between customers and the depot, a unit that initially possesses the demands of the customers. All vehicles are capacitated that they can only contain goods (the customer’s demands) up to a certain maximum capacity. Moving a vehicle between the depot and the customers comes with a certain cost. A route is a sequence of visited customers by a certain vehicle, starting and ending at a depot while a tour is a list of routes of all vehicles to fulfil all customers’ demands.
You can imagine the underlying structure of this problem as a complete undirected graph G(V, E). A simple visualization is given in the Fig. 1 above.