中文
相关论文

相关论文: The Cheapest Ticket Problem in Public Transport

200 篇论文

We consider the problem of efficiently constructing cheap and novel round trip flight itineraries by combining legs from different airlines. We analyse the factors that contribute towards the price of such itineraries and find that many…

机器学习 · 计算机科学 2018-12-06 Dmytro Karamshuk , David Matthews

This technical report is about grouping vehicles in public transport into routes so that two vehicles of a route do not overtake each other. We say that such a set of routes satisfies the FIFO property. A natural question is: Given a set of…

数据结构与算法 · 计算机科学 2024-07-02 Patrick Steil

Consider a customer who needs to fulfill a shopping list, and also a personal shopper who is willing to buy and resell to customers the goods in their shopping lists. It is in the personal shopper's best interest to find (shopping) routes…

数据库 · 计算机科学 2020-09-28 Samiul Anwar , Francesco Lettich , Mario A. Nascimento

The profitable tour problem (PTP) is a well-known NP-hard routing problem searching for a tour visiting a subset of customers while maximizing profit as the difference between total revenue collected and traveling costs. PTP is known to be…

数据结构与算法 · 计算机科学 2025-03-03 Enrico Angelelli , Renata Mansini , Romeo Rizzi

We study the problem of planning Pareto-optimal journeys in public transit networks. Most existing algorithms and speed-up techniques work by computing subjourneys to intermediary stops until the destination is reached. In contrast, the…

数据结构与算法 · 计算机科学 2016-09-16 Sascha Witt

In Group Trip Planning (GTP) Query Problem, we are given a city road network where a number of Points of Interest (PoI) have been marked with their respective categories (e.g., Cafeteria, Park, Movie Theater, etc.). A group of agents want…

多智能体系统 · 计算机科学 2025-05-27 Dildar Ali , Suman Banerjee , Yamuna Prasad

Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applications, each edge in a network is associated with a certain…

社会与信息网络 · 计算机科学 2011-05-06 Franz Graf , Hans-Peter Kriegel , Matthias Schubert

Corporations today face increasing demands for the timely and effective delivery of customer service. This creates the need for a robust and accurate automated solution to what is formally known as the ticket routing problem. This task is…

人工智能 · 计算机科学 2020-03-03 Jianglei Han , Jing Li , Aixin Sun

Public transport network constitutes for an indispensable part of a city by providing mobility services to the general masses. To improve ease of access and reduce infrastructural investments, public transport authorities often adopt proof…

计算机与社会 · 计算机科学 2018-03-13 Vaibhav Kulkarni , Bertil Chapuis , Benoît Garbinato , Abhijit Mahalunkar

This work addresses a route planning problem constrained by a bus road network that includes the schedules of all buses. Given a query with a starting bus stop and a set of Points of Interest (POIs) to visit, our goal is to find an optimal…

数据库 · 计算机科学 2025-12-30 Simu Liu , Kailin Jiao , Junping Du , Yawen Li , Zhe Xue , Xiaoyang Sean Wang , Ziqiang Yu , Yunchuan Shi

Standard algorithms for finding the shortest path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are deterministic. We consider the problem of uncertain edge costs, with potential…

人工智能 · 计算机科学 2013-02-21 Michael P. Wellman , Matthew Ford , Kenneth Larson

We consider the line planning problem in public transport in the Parametric City, an idealized model that captures typical scenarios by a (small) number of parameters. The Parametric City is rotation symmetric, but optimal line plans are…

最优化与控制 · 数学 2022-01-25 Berenike Masing , Niels Lindner , Ralf Borndörfer

The current paper deals with the subject of shortest path routing in transportation networks (in terms of travelling time), where the speed in several of the network's roads is a function of the time interval. The main contribution of the…

数据结构与算法 · 计算机科学 2016-01-08 Costas K. Constantinou , Georgios Ellinas , Christos Panayiotou , Marios Polycarpou

A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph. A plethora of shortest-path algorithms is studied in the literature that span across multiple disciplines. This paper presents a survey of…

数据结构与算法 · 计算机科学 2017-05-08 Amgad Madkour , Walid G. Aref , Faizan Ur Rehman , Mohamed Abdur Rahman , Saleh Basalamah

We present algorithms for multi-modal route planning in road and public transit networks, as well as in combined networks. Therefore, we explore the nearest neighbor and shortest path problem and propose solutions based on Cover-Trees, ALT…

数据结构与算法 · 计算机科学 2018-09-17 Daniel Tischner

Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods. However, it is not yet clear if this…

物理与社会 · 物理学 2022-05-19 Alessandro Lonardi , Mario Putti , Caterina De Bacco

Path-finding is one of the most popular subjects in the field of computer science. Pathfinding strategies determine a path from a given coordinate to another. The focus of this paper is on finding the optimal path for the bus transportation…

物理与社会 · 物理学 2023-09-20 Soroor Malekmohammadi faradunbeh , Hongle Li , Mangkyu Kang , Choongjae Iim

The advancement of mobile technologies and the proliferation of map-based applications have enabled a user to access a wide variety of services that range from information queries to navigation systems. Due to the popularity of map-based…

数据库 · 计算机科学 2020-04-24 Hossain Mahmud , Ashfaq Mahmood Amin , Mohammed Eunus Ali , Tanzima Hashem

In this paper, we study the pickup and delivery problem with multiple transportation modalities, and address the challenge of efficiently allocating transportation resources while price matching users with their desired delivery modes. More…

系统与控制 · 电气工程与系统科学 2024-11-18 Mark Beliaev , Negar Mehr , Ramtin Pedarsani

We study the network pricing problem where the leader maximizes their revenue by determining the optimal amounts of tolls to charge on a set of arcs, under the assumption that the followers will react rationally and choose the shortest…

最优化与控制 · 数学 2025-04-01 Quang Minh Bui , Bernard Gendron , Margarida Carvalho