中文
相关论文

相关论文: The Bicycle Network Improvement Problem

200 篇论文

With the focus that cities around the world have put on sustainable transportation during the past few years, biking has become one of the foci for local governments around the world. Cities all over the world invest in bike infrastructure,…

应用统计 · 统计学 2019-02-14 Sara Daraei , Konstantinos Pelechrinis , Daniele Quercia

In this paper we consider a set of travelers, starting from likely different locations towards a common destination within a road network, and propose solutions to find the optimal connecting points for them. A connecting point is a vertex…

数据结构与算法 · 计算机科学 2016-05-09 George Tsatsanifos

During the last decade bike sharing systems have emerged as a public transport mode in urban short trips in more than 500 major cities around the world. For the mobility service mode, many challenges from its operations are not well…

性能 · 计算机科学 2016-06-16 Quan-Lin Li , Rui-Na Fan , Jing-Yu Ma

To enhance the service quality of bikesharing programs, bike fleet relocation is widely applied to redistribute bikes from bike sufficient areas to bike shortage areas thereby making a better bike-rider balance across different areas. In…

最优化与控制 · 数学 2023-11-06 Xinling Li , Yu Shen , Chi Xie , Xiaohu Zhang , Hanjun Fu

Widespread use of computer networks and the use of varied technology for the interconnection of computers has made congestion a significant problem. In this report, we summarize our research on congestion avoidance. We compare the concept…

网络与互联网体系结构 · 计算机科学 2007-05-23 R. Jain , K. Ramakrishnan , D. Chiu

Human mobility has a significant impact on several layers of society, from infrastructural planning and economics to the spread of diseases and crime. Representing the system as a complex network, in which nodes are assigned to regions…

With rapid population growth and urban development, traffic congestion has become an inescapable issue, especially in large cities. Many congestion reduction strategies have been proposed in the past, ranging from roadway extension to…

最优化与控制 · 数学 2022-04-18 Ali Ghafelebashi , Meisam Razaviyayn , Maged Dessouky

The goal of traffic management is efficiently utilizing network resources via adapting of source sending rates and routes selection. Traditionally, this problem is formulated into a utilization maximization problem. The single-path routing…

网络与互联网体系结构 · 计算机科学 2015-03-19 Ying Liu , Hongying Liu , Ke Xu , Meng Shen , Yifeng Zhong

We consider two covering variants of the network design problem. We are given a set of origin/destination pairs, called O/D pairs, and each such O/D pair is covered if there exists a path in the network from the origin to the destination…

最优化与控制 · 数学 2021-09-07 Víctor Bucarey , Bernard Fortz , Natividad González-Blanco , Martine Labbé , Juan A. Mesa

A bicycle node network is a wayfinding system targeted at recreational cyclists, consisting of numbered signposts placed alongside already existing infrastructure. Bicycle node networks are becoming increasingly popular as they encourage…

计算机与社会 · 计算机科学 2024-12-31 Anastassia Vybornova , Ane Rahbek Vierø , Kirsten Krogh Hansen , Michael Szell

In bike sharing systems the quality of the service to the users strongly depends on the strategy adopted to reposition the bikes. The bike repositioning problem is in general very complex as it involves different interrelated decisions: the…

最优化与控制 · 数学 2024-06-17 E. Angelelli , A. Mor , M. G. Speranza

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

An increased modal share of bicycle traffic is a key mechanism to reduce emissions and solve traffic-related problems. However, a lack of (perceived) safety keeps people from using their bikes more frequently. To improve safety in bicycle…

计算机与社会 · 计算机科学 2020-07-07 Ahmet-Serdar Karakaya , Jonathan Hasenburg , David Bermbach

In this paper, we mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. We formulate this problem as a many-to-many problem in which a rider can travel by transferring between multiple drivers, and…

数据结构与算法 · 计算机科学 2017-04-25 Neda Masoud , R. Jayakrishnan

Global infrastructure robustness and local transport efficiency are critical requirements for transportation networks. However, since passengers often travel greedily to maximize their own benefit and trigger traffic jams, overall…

适应与自组织系统 · 物理学 2024-01-09 Alessandro Lonardi , Caterina De Bacco

The COVID-19 pandemic has been a recent example for the spread of a harmful contagion in large populations. Moreover, the spread of harmful contagions is not only restricted to an infectious disease, but is also relevant to computer viruses…

最优化与控制 · 数学 2024-04-26 Kübra Tanınmış , Necati Aras , Evren Güney , Markus Sinnl

This paper introduces the Packing While Traveling problem as a new non-linear knapsack problem. Given are a set of cities that have a set of items of distinct profits and weights and a vehicle that may collect the items when visiting all…

数据结构与算法 · 计算机科学 2017-03-22 Sergey Polyakovskiy , Frank Neumann

The potential of integrating public transit with ridesharing includes shorter travel time for commuters and higher occupancy rate of personal vehicles and public transit ridership. In this paper, we describe a centralized transit system…

数据结构与算法 · 计算机科学 2023-08-21 Qian-Ping Gu , Jiajian Leo Liang

We consider the Single School Routing Problem (SSRP) where students from a single school are picked up by a fleet of school buses, subject to a set of constraints. The constraints that are typically imposed for school buses are bus…

最优化与控制 · 数学 2022-10-03 Xiaotong Guo , Samitha Samaranayake

Assume that $m \geq 1$ autonomous mobile agents and $0 \leq b \leq m$ single-agent transportation devices (called {\em bikes}) are initially placed at the left endpoint $0$ of the unit interval $[0,1]$. The agents are identical in…