The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach
From MaRDI portal
Publication:2676335
Recommendations
- Vehicle routing with transportable resources: using carpooling and walking for on-site services
- The shared customer collaboration vehicle routing problem
- The vehicle routing problem with occasional drivers
- Optimal charging and repositioning of electric vehicles in a free-floating carsharing system
- A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems
Cites work
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
- Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems
- Home health care routing and scheduling: a review
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- The dial-a-ride problem: Models and algorithms
- Two exact algorithms for the distance-constrained vehicle routing problem
- Vehicle routing with transportable resources: using carpooling and walking for on-site services
- Workforce routing and scheduling for electricity network maintenance with downtime minimization
Cited in
(5)- An MILP for scheduling problems in an FMS with one vehicle
- Online generalized assignment problem with historical information
- Event-based MILP models for ridepooling applications
- Vehicle routing with transportable resources: using carpooling and walking for on-site services
- Mobility offer allocations in corporate settings
This page was built for publication: The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676335)
