Mobility offer allocations in corporate settings

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 problem as 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. We also present an adaptive large neighborhood search based approach which makes use of conflict graphs as well. In a computational study, the approaches are evaluated. It was found that greedy heuristics perform best if very tight run-time requirements are given, a solver for the integer linear programming model performs best on small and medium instances, and the adaptive large neighborhood search performs best on large instances.

[1]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[2]  Vangelis Th. Paschos,et al.  Weighted Coloring: Further Complexity and Approximability Results , 2005, ICTCS.

[3]  Natalia Kliewer,et al.  An overview on vehicle scheduling models , 2009, Public Transp..

[4]  Marielle Christiansen,et al.  Industrial aspects and literature survey: Fleet composition and routing , 2010, Comput. Oper. Res..

[5]  Andrew Harrison,et al.  A new comparison between the life cycle greenhouse gas emissions of battery electric vehicles and internal combustion vehicles , 2012 .

[6]  Markus Lienkamp,et al.  Fleet Disposition Modeling to Maximize Utilization of Battery Electric Vehicles in Companies with On-Site Energy Generation , 2016 .

[7]  Edmund K. Burke,et al.  A supernodal formulation of vertex colouring with applications in course timetabling , 2007, Ann. Oper. Res..

[8]  Guy Desaulniers,et al.  A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows , 2009, Networks.

[9]  William Gustin,et al.  Orientable embedding of Cayley graphs , 1963 .

[10]  Leslie Pérez Cáceres,et al.  The irace package: Iterated racing for automatic algorithm configuration , 2016 .

[11]  Moshe Lewenstein,et al.  Optimization problems in multiple-interval graphs , 2007, SODA '07.

[12]  Ammar Oulamara,et al.  Electric vehicle scheduling and optimal charging problem: complexity, exact and heuristic approaches , 2017, Int. J. Prod. Res..

[13]  Joseph Y.-T. Leung,et al.  An Optimal Solution for the Channel-Assignment Problem , 1979, IEEE Transactions on Computers.

[14]  Andreas T. Ernst,et al.  An efficient Lagrangean heuristic for rental vehicle scheduling , 2011, Comput. Oper. Res..

[15]  Guy Desaulniers,et al.  Multiple depot vehicle scheduling with controlled trip shifting , 2017, Transportation Research Part B: Methodological.

[16]  Wim Nuijten,et al.  Randomized Large Neighborhood Search for Cumulative Scheduling , 2005, ICAPS.

[17]  J. Moon,et al.  On cliques in graphs , 1965 .

[18]  Leo G. Kroon,et al.  Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem , 1997, Oper. Res..

[19]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[20]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[21]  Donald Shoup,et al.  The High Cost of Free Parking: Updated Edition , 2011 .

[22]  Beatriz Brito Oliveira,et al.  Fleet and revenue management in car rental companies: A literature review and an integrated conceptual framework , 2017 .

[23]  Beatriz Brito Oliveira,et al.  A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company , 2014, Eur. J. Oper. Res..

[24]  Reuven Bar-Yehuda,et al.  A unified approach to approximating resource allocation and scheduling , 2001, JACM.

[25]  David Pisinger,et al.  Modeling and solving a vehicle-sharing problem , 2020, ArXiv.

[26]  Andrew V. Goldberg,et al.  Route Planning in Transportation Networks , 2015, Algorithm Engineering.

[27]  Frits C. R. Spieksma,et al.  Interval scheduling: A survey , 2007 .

[28]  Falko Koetter,et al.  Schedule Rating Method based on a Fragmentation Criterion - Schedule Optimization in Corporate Carsharing of Electric Vehicles , 2015 .

[29]  Andreas T. Ernst,et al.  Static and Dynamic Order Scheduling for Recreational Rental Vehicles at Tourism Holdings Limited , 2007, Interfaces.

[30]  Dániel Marx,et al.  RAPH COLORING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING , 2022 .

[31]  Enrico Angelelli,et al.  Optimal interval scheduling with a resource constraint , 2014, Comput. Oper. Res..

[32]  J. Bates,et al.  Spaced Out: Perspectives on parking policy , 2012 .

[33]  Esther M. Arkin,et al.  Scheduling jobs with fixed start and end times , 1987, Discret. Appl. Math..

[34]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[35]  P. Dolan,et al.  Behavioural economics and its implications for transport , 2012 .

[36]  Martin Farber,et al.  Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..

[37]  David Pisinger,et al.  Large Neighborhood Search , 2018, Handbook of Metaheuristics.

[38]  Stephan Hassold,et al.  Public transport vehicle scheduling featuring multiple vehicle types , 2014 .

[39]  Joseph Y.-T. Leung,et al.  Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.

[40]  Kellogg S. Booth,et al.  A Linear Time Algorithm for Deciding Interval Graph Isomorphism , 1979, JACM.

[41]  Sebastian Hudert,et al.  Leveraging Electric Cross-Company Car Fleets through Cloud Service Chains: The Shared E-Fleet Architecture , 2014, 2014 Annual SRII Global Conference.

[42]  T. C. Edwin Cheng,et al.  A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines , 2014, J. Oper. Res. Soc..

[43]  T. C. Edwin Cheng,et al.  Fixed interval scheduling: Models, applications, computational complexity and algorithms , 2007, Eur. J. Oper. Res..

[44]  Peter Sanders,et al.  High quality graph partitioning , 2012, Graph Partitioning and Graph Clustering.