中文
相关论文

相关论文: Mobility Offer Allocations in Corporate Settings

200 篇论文

We consider the problem of cooperative intersection management. It arises in automated transportation systems for people or goods but also in multi-robots environment. Therefore many solutions have been proposed to avoid collisions. The…

系统与控制 · 计算机科学 2013-10-30 Jean Gregoire , Silvère Bonnabel , Arnaud de La Fortelle

Motivated by a transit line planning problem in transportation systems, we investigate the following capacitated assignment problem under a budget constraint. Our model involves $L$ bins and $P$ items. Each bin $l$ has a utilization cost…

最优化与控制 · 数学 2024-10-11 Hongyi Jiang , Samitha Samaranayake

This paper presents an extension of a recently introduced multistage stochastic integer model designed for optimizing the deployment of charging stations under uncertainty. A key contribution of this work is incorporating additional…

最优化与控制 · 数学 2025-01-03 Antoine Deza , Kai Huang , Carlos Aníbal Suárez

We study the maximum capture problem in facility location under random utility models, i.e., the problem of seeking to locate new facilities in a competitive market such that the captured user demand is maximized, assuming that each…

最优化与控制 · 数学 2022-03-29 Tien Thanh Dam , Thuy Anh Ta , Tien Mai

Modern business models have enabled service systems to leverage a large pool of casual employees with flexible hours, paid based on piece rates, to fulfill on-demand work. These systems have been successfully implemented in sectors such as…

最优化与控制 · 数学 2025-04-09 Prakash Gawas , Antoine Legrain , Louis-Martin Rousseau

In the governance of the shared mobility market of a city or of a metropolitan area, there are two conflicting principles: 1) the healthy competition between multiple platforms, such as between Uber and Lyft in the United States, and 2)…

最优化与控制 · 数学 2024-10-29 Xiaotong Guo , Ao Qu , Hongmou Zhang , Peyman Noursalehi , Jinhua Zhao

Microtransit and other flexible transit fleet services can reduce costs by incorporating transfers. However, transfers are costly to users if they must get off a vehicle and wait at a stop for another pickup. A mixed integer linear…

最优化与控制 · 数学 2022-09-14 Zhexi Fu , Joseph Y. J. Chow

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

Urban intersections are prone to delays and inefficiencies due to static precedence rules and occlusions limiting the view on prioritized traffic. Existing approaches to improve traffic flow, widely known as automatic intersection…

机器人学 · 计算机科学 2022-07-27 Marvin Klimke , Benjamin Völz , Michael Buchholz

In Facility Location problems there are agents that should be connected to facilities and locations where facilities may be opened so that agents can connect to them. We depart from Uncapacitated Facility Location and by assuming that the…

计算机科学与博弈论 · 计算机科学 2025-11-14 Thanasis Lianeas , Marios Mertzanidis , Aikaterini Nikolidaki

The rapid growth of urban populations and the increasing need for sustainable transportation solutions have prompted a shift towards electric buses in public transit systems. However, the effective management of mixed fleets consisting of…

最优化与控制 · 数学 2026-01-14 Rishav Sen , Amutheezan Sivagnanam , Aron Laszka , Ayan Mukhopadhyay , Abhishek Dubey

This paper considers a Markov decision model for profit maximization of a cloud computing service provider catering to customers submitting jobs with firm real-time random deadlines. Customers are charged on a per-job basis, receiving a…

最优化与控制 · 数学 2021-04-27 José Niño-Mora

Several modern applications involve huge graphs and require fast answers to reachability queries. In more than two decades since first proposals, several approaches have been presented adopting on-line searches, hop labelling or transitive…

数据结构与算法 · 计算机科学 2016-11-09 Nicolas Boria , Gianpiero Cabodi , Paolo Camurati , Marco Palena , Paolo Pasini , Stefano Quer

In this paper the problem of scheduling of jobs on parallel machines under incompatibility relation is considered. In this model a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same…

数据结构与算法 · 计算机科学 2021-06-29 Tytus Pikies , Hanna Furmańczyk

The paper considers scheduling on parallel machines under the constraint that some pairs of jobs cannot be processed concurrently. Each job has an associated weight, and all jobs have the same deadline. The objective is to maximise the…

数据结构与算法 · 计算机科学 2021-06-15 Yakov Zinder , Joanna Berlińska , Charlie Peter

Stochastic matching is the stochastic version of the well-known matching problem, which consists in maximizing the rewards of a matching under a set of probability distributions associated with the nodes and edges. In most stochastic…

最优化与控制 · 数学 2024-05-01 Yuya Hikima , Yasunori Akagi , Hideaki Kim

In this paper we study the routing and rebalancing problem for a fleet of autonomous vehicles providing on-demand transportation within a congested urban road network (that is, a road network where traffic speed depends on vehicle density).…

系统与控制 · 计算机科学 2016-09-16 Federico Rossi , Rick Zhang , Marco Pavone

Shared mobility systems (e.g., shared cars and ride-hailing services) generate persistent spatial imbalances as vehicles concentrate at popular destinations, leaving trip origins depleted of supply. Operators incur substantial costs in…

应用物理 · 物理学 2026-04-07 Wenbo Fan , Zhouyun Chen , Weihua Gu

The advent of autonomous driving and electrification is enabling the deployment of Electric Autonomous Mobility-on-Demand (E-AMoD) systems, whereby electric autonomous vehicles provide on-demand mobility. Crucially, the design of the…

系统与控制 · 电气工程与系统科学 2023-09-25 Fabio Paparella , Theo Hofman , Mauro Salazar

In this paper a greedy algorithm to detect conflict cliques in interval graphs and circular-arc graphs is analyzed. In a graph, a stable set requires that at most one vertex is chosen for each edge. It is equivalent to requiring that at…

离散数学 · 计算机科学 2008-12-12 Gabrio Caimi , Holger Flier , Martin Fuchsberger , Marc Nunkesser
‹ 上一页 1 8 9 10 下一页 ›