The growing popularity of aggregation platforms has attracted widespread attention in the ride-hailing market in recent years. In order to obtain additional orders by charging commissions and slotting fees, many ride-hailing platforms choose to bundle with aggregation platforms. Unlike traditional reseller electronic channels, the bundle channels may affect pricing of platforms, service levels of drivers, market demands and they may further impact on profits. These different attitudes raise an interesting and key question about the influence of bundle channels in ride-hailing platforms. In this paper, we propose an analytical framework for pricing strategies of ride-hailing and aggregation platforms under bundle mode and analyze their pricing process from the perspective of Nash and Stackelberg games, where the platforms serve as leaders to determine optimal prices through Nash equilibrium and the drivers serve as followers to provide optimal service levels. Through sensitivity analysis of service levels and costs, we capture the distribution trends of profits between the platforms. Based on some numerical examples and results analysis, some interesting managerial insights on pricing of ride-hailing and aggregation platforms are gained.

Poor urban planning and traffic congestion lead to excessive delays in workers’ transit times and decrease their quality of life, especially in emerging countries. Several medium and large companies have a need to hire a transport service for their staff. In this type of transportation system, there is a heterogeneous fleet of vehicles, which are assigned to a set of predefined routes. However, the total transport delay can be even greater if the private transportation system is inefficient or not controlled. The approach proposed in this study seeks to optimize the private transport service by defining the best allocation of its fleet to its routes. A mathematical model is proposed to minimize user wait times. This approach is validated using real data obtained from a transport company in Co-lombia. The results demonstrate the quantitative benefits that can be achieved when the proposed approach is implemented, represented by a considerable reduction in user wait times.

Facility location models are observed in many diverse areas such as communication networks, transportation, and distribution systems planning. They play significant role in supply chain and operations management and are one of the main well-known topics in strategic agenda of contemporary manufacturing and service companies accompanied by long-lasting effects. We define a new approach for solving stochastic single source capacitated facility location problem (SSSCFLP). Customers with stochastic demand are assigned to set of capacitated facilities that are selected to serve them. It is demonstrated that problem can be transformed to deterministic Single Source Capacitated Facility Location Problem (SSCFLP) for Poisson demand distribution. A hybrid algorithm which combines Lagrangian heuristic with adjusted mixture of Ant colony and Genetic optimization is proposed to find lower and upper bounds for this problem. Computational results of various instances with distinct properties indicate that proposed solving approach is efficient.