相关论文: Maximum Customers' Satisfaction in One-way Car-sha…

Reorganizing bus frequency to cater for the actual travel demand can save the cost of the public transport system significantly. Many, if not all, existing studies formulate this as a bus frequency optimization problem which tries to…

This paper explores a variant of bipartite matching problem, referred to as the Spatiotemporal Random Bipartite Matching Problem (ST-RBMP), that accommodates randomness and heterogeneity in the spatial distributions and temporal arrivals of…

Ride-sharing is an essential aspect of modern urban mobility. In this paper, we consider a classical problem in ride-sharing - the Multi-Vehicle Dial-a-Ride Problem (Multi-Vehicle DaRP). Given a fleet of vehicles with a fixed capacity…

Due to limited transit network coverage and infrequent service, suburban commuters often face the transit first mile/last mile (FMLM) problem. To deal with this, they either drive to a park-and-ride location to take transit, use carpooling,…

Line planning in public transport is the strategic problem of selecting lines and their operating frequencies. This problem is important as it defines the passenger service, based on available connections and expected travel times, and…

We study the problem of optimal multi-robot path planning on graphs MPP over four distinct minimization objectives: the makespan (last arrival time), the maximum (single-robot traveled) distance, the total arrival time, and the total…

In this study, we propose a novel heuristic two-step algorithm for shared ridehailing in which users can share their rides with only one more user. The algorithm, which is centrally formulated, starts with matching users and creating a set…

Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taking into account travel…

The advances in information and communication technology are changing theway people move. Companies that offer demand-responsive transportation serviceshave the opportunity to reduce their costs and increase their revenues…

We study the problem of optimal location querying for location based services in road networks, which aims to find locations for new servers or facilities. The existing optimal solutions on this problem consider only the cases with one new…

While conventional shared demand-responsive transportation (SDRT) systems mostly operate on a door-to-door policy, the usage of meeting points for the pick-up and drop-off of user groups can offer several advantages, like fewer stops and…

This paper addresses a mixed integer programming (MIP) formulation for the multi-item uncapacitated lot-sizing problem that is inspired from the trailer manufacturer. The proposed MIP model has been utilized to find out the optimum order…

We study a spatiotemporal service matching problem in which demand, heterogeneous in location and time sensitivity/preference, is to be assigned to service stations. The planner seeks to maximize social welfare, defined as total service…

The Multi-Objective Vehicle Routing Problem (MOVRP) is a complex optimization problem in the transportation and logistics industry. This paper proposes a novel approach to the MOVRP that aims to create routes that consider drivers' and…

Mobility-as-a-Service (MaaS) systems are two-sided markets, with two mutually exclusive sets of agents, i.e., travelers/users and operators, forming a mobility ecosystem in which multiple operators compete or cooperate to serve customers…

This paper studies a practical regional demand continuous multifacility location problems whose main goal is to locate a given number of services and entry points in each region to distribute certain products to the users at minimum…

The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a shortest path for an agent that starts at a stationary depot, visits a set of moving targets exactly once, each within one of their respective time windows, and returns to the…

Social groups give the opportunity for a new form of caching. In this paper, we investigate how a social group of users can jointly optimize bandwidth usage, by each caching parts of the data demand, and then opportunistically share these…

In this paper, we develop a profit-sharing-based optimal routing mechanism to incentivize horizontal collaboration among urban goods distributors. This paper investigates a collaborative routing problem for urban logistics, in which the…

Micro-transit services offer a promising solution to enhance urban mobility and access, particularly by complementing existing public transit. However, effectively designing these services requires determining optimal service zones for…