Print Email Facebook Twitter Models, Solutions and Relaxations of the Asymmetrical Capacitated Vehicle Routing Problem Title Models, Solutions and Relaxations of the Asymmetrical Capacitated Vehicle Routing Problem Author Kerckhoffs, L. Contributor Aardal, K.I. (mentor) Faculty Electrical Engineering, Mathematics and Computer Science Department Delft Institute of Applied Mathematics Programme Optimization Date 2017-03-09 Abstract In this thesis, we take a look at the Asymmetrical Capacitated Vehicle Routing Problem (ACVRP). We will take a look at different possible formulations for the problem and choose one based on the ease of implementation, the computation speed of solving it, and the available relaxations. The problem, and its relaxations, will be modeled and solved using AIMMS, a commercial modeling software. Using the methods described above, we model different cases and instances of the problem using a Two-Index Vehicle Flow formulation. We apply an Assignment Problem relaxation and a Linear Programming relaxation to each of the instances. We find that the problem is easiest to solve when all customers are relatively close to each other (as opposed to being placed in separate clusters that are relatively far from each other), and that the LP relaxation gives bounds with a fairly good quality in short periods of time. Subject TSPVehicle RoutingVRPACVRPoptimizationonline supermarketrelaxation To reference this document use: http://resolver.tudelft.nl/uuid:03af3d1b-98d8-4c14-99ff-a448b4f4b2d0 Part of collection Student theses Document type bachelor thesis Rights (c) 2017 Kerckhoffs, L. Files PDF BEP_verslag.pdf 887.68 KB Close viewer /islandora/object/uuid:03af3d1b-98d8-4c14-99ff-a448b4f4b2d0/datastream/OBJ/view