Abstract
Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use of battery electric vehicles. We introduce the mobility offer allocation problemas the core concept of a flexible booking system for corporate mobility. The problem is equivalent to interval scheduling on dedicated unrelated parallel machines. We show that the problem is NP-hard to approximate within any factor. We describe problem specific conflict graphs for representing and exploring the structure of feasible solutions. A characterization of all maximum cliques in these conflict graphs reveals symmetries which allow to formulate stronger integer linear programming models
Originalsprache | Englisch |
---|---|
Seiten (von - bis) | 1-16 |
Seitenumfang | 16 |
Fachzeitschrift | Elsevier - EURO Journal on Computational Optimization |
Volume | 9 |
DOIs | |
Publikationsstatus | Veröffentlicht - 2021 |
Research Field
- Ehemaliges Research Field - Integrated Energy Systems
Schlagwörter
- corporate mobility
- flexible booking
- programming models
- public transportation