A relevant problem within large logistic networks is to find the shortest route for a container that has to be transported, a problem that becomes more complex in multimodal networks. Different aspects that should be considered include the time windows for pick-up and delivery, the transport mode to be used, the transfer location, the existing schedules of train or maritime services, among many others. Moreover, different objectives should be considered and balanced, such as the economic cost, the lead time or the environmental impact. Although the problem has been studied before, there are still open gaps regarding the study of variants of the problem or the efficiency of the algorithms. For example, it is of interest to propose efficient methods to re-route a container after a disruption in the network, which make use of previous information to avoid repeating the whole optimization process used to find the previous solution. The main goal of this thesis is to propose a solution approach to solve the problem. This can include the formulation of a linear programming model and/or proposal of heuristic algorithms, comparing the performance of different approaches. The student should have an interest in the application of optimization techniques, as well as knowledge of some programming languages (preference C++ or java). NOTE : The writer should be familiar with or have knowledge of some programming language (preference C++ or java). One of these must be used to arrive at a conclusion or to provide a solution to the problem. I will like to receive updates or drafts of various chapters after every two weeks so I can read through them. It should be a hundred percent plagiarism-free.
Do you need Assignment help from intel-writers.us?