相关论文: Maximizing the Score in "Ticket to Ride"

In this paper, we introduce three different classes of undergraduate research projects that implement model building and integer programming. These research projects focus on determining and analyzing solutions to the game The Genius…

In this paper, we consider a mobility system of travelers and providers, and propose a "mobility game" to study when a traveler is matched to a provider. Each traveler seeks to travel using the services of only one provider, who manages one…

We present a novel proof that the maximum number of sets with 4 properties for 12 cards is 14 using the geometry of the finite field F_3^4, number theory, combinatorics, and graph theory. We also present several computer algorithms for…

The Traveling Tournament Problem(TTP) is a combinatorial optimization problem where we have to give a scheduling algorithm which minimizes the total distance traveled by all the participating teams of a double round-robin tournament…

One-way car-sharing systems are transportation systems that allow customers to rent cars at stations scattered around the city, use them for a short journey, and return them at any station. The maximum customers' satisfaction problem…

In this paper, we consider a multi-modal mobility system of travelers each with an individual travel budget, and propose a game-theoretic framework to assign each traveler to a ``mobility service" (each one representing a different mode of…

Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts and crosses) board game. Two players compete to win three aligned "fields", each of them being a tic-tac-toe game. Each move determines which field the next player…

Ride-sharing can reduce traffic congestion and thus reduce gas emissions and save travel time. However, transportation system with ride-sharing is currently inefficient due to low occupancy rate, high travel demand and some other factors.…

We consider the following simple game: We are given a table with ten slots indexed one to ten. In each of the ten rounds of the game, three dice are rolled and the numbers are added. We then put this number into any free slot. For each…

Spurred by the growth of transportation network companies and increasing data capabilities, vehicle routing and ride-matching algorithms can improve the efficiency of private transportation services. However, existing routing solutions do…

Integrating ridesharing matching explicitly into multimodal traffic models is crucial for accurately assessing the impacts of multimodal transport (MT) on urban economic and environmental aspects. This paper integrates an optimal…

The culture of sharing instead of ownership is sharply increasing in individuals behaviors. Particularly in transportation, concepts of sharing a ride in either carpooling or ridesharing have been recently adopted. An efficient optimization…

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…

How to form groups in a mobility system that offers shared rides, and how to split the costs within the travellers of a group, are non-trivial tasks, as two objectives conflict: 1) minimising the total costs of the system, and 2) making…

We study the problem of optimally routing plug-in electric and conventional fuel vehicles on a city level. In our model, commuters selfishly aim to minimize a local cost that combines travel time, from a fixed origin to a desired…

We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. We take a novel approach, focusing on trips and transfers between them,…

In the school bus scheduling problem, the main contributing factor to the cost is the number of buses needed for the operations. However, in the case of subcontracting the transportation of pupils, unbalanced tours can increase the costs…

The ridesharing problem is that given a set of trips, each trip consists of an individual, a vehicle of the individual and some requirements, select a subset of trips and use the vehicles of selected trips to deliver all individuals to…

In the maximum scatter traveling salesman problem the objective is to find a tour that maximizes the shortest distance between any two consecutive nodes. This model can be applied to manufacturing processes, particularly laser melting…

The orienteering problem is a well-studied and fundamental problem in transportation science. In the problem, we are given a graph with prizes on the nodes and lengths on the edges, together with a budget on the overall tour length. The…