Formulations and algorithms for rich routing problems

Research output: ThesisThesis fully internal (DIV)

869 Downloads (Pure)


In the last years, the environment in which logistics service providers operate has become more complex due to several trends. The rise of e-commerce led to a rapid growth in the number of packages to deliver. Where home delivery used to be the standard option, we now see that different delivery options emerge such as attended or unattended pickup points. Moreover, we see that more customers demand for environmental behavior. These trends create logistical challenges and ask for new methods to support the decisions based on questions such as how to coordinate the large amount of freight flows, where to locate pickup point facilities, and how to take into account congestion and delays that result from the large amount of freight flows.

In this thesis, we consider four different routing problems that emerge from the logistical challenges as described above. The first two routing problems incorporate loading aspects in a routing context, the third problem is a routing problem integrated with a facility location problem for the position of pickup lockers, and the last problem considers traffic and delays in the routing decisions. We provide a mathematical formulation for each of the four routing problems, we develop both heuristics and exact methods to solve those problems and we provide new theoretical and practical insights.
Original languageEnglish
QualificationDoctor of Philosophy
Awarding Institution
  • University of Groningen
  • Vis, Iris, Supervisor
  • Roodbergen, Kees Jan, Supervisor
  • Callegari Coelho, Leandro, Co-supervisor
Award date15-May-2017
Place of Publication[Groningen]
Print ISBNs978-90-367-9726-9
Electronic ISBNs978-90-367-9725-2
Publication statusPublished - 2017

Cite this