Solution Methods for Vehicle Routing and Scheduling Problems Description
This research project deals with the exact and heuristic resolution of optimization problems related to vehicle routing and scheduling. The VRPs studied are associated with problems involving: (i) pickup and delivery, including those related to the rebalancing of bike sharing systems; (ii) routing and trajectory optimization of unmanned aerial vehicles; (iii) variants with multiple attributes (rich VRPs). The scheduling problems to be considered are those involving mainly: (i) parallel machines with penalties for earliness and tardiness; (ii) batch sequencing and tardiness penalties; (iii) parallel machines with a single setup server, (iv) project scheduling with resource constraints; (v) conference scheduling. The (meta-)heuristic methods will be based on local search approaches, while the exact methods will be based on integer linear programming models, cutting planes and column generation. The project is expected to last 36 months.
- Anand Subramanian (UFPB – LASER)