Improved methods for solving the dynamic assignment vehicle routing problem using historical data, an insertion heuristic and a genetic algorithm

Additional Metadata
Keywords	Dynamic assignment vehicle routing problem; insertion method; problem decomposition; genetic algorithm; heuristic; travelling salesman problem; minimum spanning tree
Thesis Advisor	Dollevoet, T.A.B.
Persistent URL	hdl.handle.net/2105/55683
Series	Econometrie
Organisation	Erasmus School of Economics
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	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

Publication