Dynamic assignment vehicle routing problem; insertion method; problem decomposition; genetic algorithm; heuristic; travelling salesman problem; minimum spanning tree
Dollevoet, T.A.B.
hdl.handle.net/2105/55683
Econometrie
Erasmus School of Economics

Verzijlbergen, E.A. (2021, January 27). Improved methods for solving the dynamic assignment vehicle routing problem using historical data, an insertion heuristic and a genetic algorithm. Econometrie. Retrieved from http://hdl.handle.net/2105/55683